{"signature":"fun duplicateTemplateProject ( buildVersions : BuildVersions , destination : File )","body":"{ prepareProjectFiles ( destination = destination ) updateCustomResourcesPath ( destination ) updateBuildCacheConfig ( buildVersions , destination ) }","docstring":"/**\n * Create a duplicate [AbstractGradleIntegrationTest.templateProjectDir] in [destination], for Gradle Build Cache\n * testing.\n */"} {"signature":"@ Suppress ( \"\" ) public fun < reified T : Any > Array < * > . isArrayOf ( ) : Boolean","body":"= T :: class . java . isAssignableFrom ( this :: class . java . componentType )","docstring":"/**\n * Checks if array can contain element of type [T].\n */"} {"signature":"private fun countTotalBytes ( column : AnyCol ) : Long ?","body":"{ val columnType = column . type ( ) return when { columnType . isSubtypeOf ( typeOf < String ? > ( ) ) -> column . values . fold ( ) { totalBytes , value -> totalBytes + value . toString ( ) . length * } else -> null } }","docstring":"/**\n * Calculate buffer size for VariableWidthVector (return null for FixedWidthVector)\n */"} {"signature":"private fun allocateVectorAndInfill ( field : Field , column : AnyCol ? , strictType : Boolean , strictNullable : Boolean , ) : FieldVector","body":"{ val containNulls = ( column == null || column . hasNulls ( ) ) val ( convertedColumn , actualField ) = try { convertColumnToTarget ( column , field . type ) to field } catch ( e : CellConversionException ) { if ( strictType ) { val mismatch = ConvertingMismatch . TypeConversionFail . ConversionFailError ( e . column ? . name ( ) ? : \"\" , e . row , e ) mismatchSubscriber ( mismatch ) throw ConvertingException ( mismatch ) } else { mismatchSubscriber ( ConvertingMismatch . TypeConversionFail . ConversionFailIgnored ( e . column ? . name ( ) ? : \"\" , e . row , e ) ) column to column ! ! . toArrowField ( mismatchSubscriber ) } } catch ( e : TypeConverterNotFoundException ) { if ( strictType ) { val mismatch = ConvertingMismatch . TypeConversionNotFound . ConversionNotFoundError ( field . name , e ) mismatchSubscriber ( mismatch ) throw ConvertingException ( mismatch ) } else { mismatchSubscriber ( ConvertingMismatch . TypeConversionNotFound . ConversionNotFoundIgnored ( field . name , e ) ) column to column ! ! . toArrowField ( mismatchSubscriber ) } } val vector = if ( ! actualField . isNullable && containNulls ) { var firstNullValue : Int ? = null for ( i in until ( column ? . size ( ) ? : - ) ) { if ( column ! ! [ i ] == null ) { firstNullValue = i break } } if ( strictNullable ) { val mismatch = ConvertingMismatch . NullableMismatch . NullValueError ( actualField . name , firstNullValue ) mismatchSubscriber ( mismatch ) throw ConvertingException ( mismatch ) } else { mismatchSubscriber ( ConvertingMismatch . NullableMismatch . NullValueIgnored ( actualField . name , firstNullValue ) ) Field ( actualField . name , FieldType ( true , actualField . fieldType . type , actualField . fieldType . dictionary ) , actualField . children ) . createVector ( allocator ) ! ! } } else { actualField . createVector ( allocator ) ! ! } if ( convertedColumn == null ) { check ( actualField . isNullable ) allocateVector ( vector , dataFrame . rowsCount ( ) ) infillWithNulls ( vector , dataFrame . rowsCount ( ) ) } else { allocateVector ( vector , dataFrame . rowsCount ( ) , countTotalBytes ( convertedColumn ) ) infillVector ( vector , convertedColumn ) } return vector }","docstring":"/**\n * Create Arrow FieldVector with [column] content cast to [field] type according to [strictType] and [strictNullable] settings.\n */"} {"signature":"@ Deprecated ( \"\" + \"\" + \"\" , level = DeprecationLevel . WARNING ) public fun runBlockingTest ( context : CoroutineContext = EmptyCoroutineContext , testBody : suspend TestCoroutineScope . ( ) -> Unit )","body":"{ val scope = createTestCoroutineScope ( TestCoroutineDispatcher ( ) + SupervisorJob ( ) + context ) val scheduler = scope . testScheduler val deferred = scope . async { scope . testBody ( ) } scheduler . advanceUntilIdle ( ) deferred . getCompletionExceptionOrNull ( ) ? . let { throw it } scope . cleanupTestCoroutines ( ) }","docstring":"/**\n * Executes a [testBody] inside an immediate execution dispatcher.\n *\n * This method is deprecated in favor of [runTest]. Please see the\n * [migration guide](https://github.com/Kotlin/kotlinx.coroutines/blob/master/kotlinx-coroutines-test/MIGRATION.md)\n * for an instruction on how to update the code for the new API.\n *\n * This is similar to [runBlocking] but it will immediately progress past delays and into [launch] and [async] blocks.\n * You can use this to write tests that execute in the presence of calls to [delay] without causing your test to take\n * extra time.\n *\n * ```\n * @Test\n * fun exampleTest() = runBlockingTest {\n * val deferred = async {\n * delay(1_000)\n * async {\n * delay(1_000)\n * }.await()\n * }\n *\n * deferred.await() // result available immediately\n * }\n *\n * ```\n *\n * This method requires that all coroutines launched inside [testBody] complete, or are cancelled, as part of the test\n * conditions.\n *\n * Unhandled exceptions thrown by coroutines in the test will be re-thrown at the end of the test.\n *\n * @throws AssertionError If the [testBody] does not complete (or cancel) all coroutines that it launches\n * (including coroutines suspended on join/await).\n *\n * @param context additional context elements. If [context] contains [CoroutineDispatcher] or [CoroutineExceptionHandler],\n * then they must implement [DelayController] and [TestCoroutineExceptionHandler] respectively.\n * @param testBody The code of the unit-test.\n */"} {"signature":"@ Deprecated ( \"\" , level = DeprecationLevel . WARNING ) public fun runBlockingTestOnTestScope ( context : CoroutineContext = EmptyCoroutineContext , testBody : suspend TestScope . ( ) -> Unit )","body":"{ val completeContext = TestCoroutineDispatcher ( ) + SupervisorJob ( ) + context val startJobs = completeContext . activeJobs ( ) val scope = TestScope ( completeContext ) . asSpecificImplementation ( ) scope . enter ( ) scope . start ( CoroutineStart . UNDISPATCHED , scope ) { scope . testBody ( ) } scope . testScheduler . advanceUntilIdle ( ) val throwable = try { scope . getCompletionExceptionOrNull ( ) } catch ( e : IllegalStateException ) { null } scope . backgroundScope . cancel ( ) scope . testScheduler . advanceUntilIdleOr { false } throwable ? . let { val exceptions = try { scope . legacyLeave ( ) } catch ( e : UncompletedCoroutinesError ) { listOf ( ) } throwAll ( it , exceptions ) return } throwAll ( null , scope . legacyLeave ( ) ) val jobs = completeContext . activeJobs ( ) - startJobs if ( jobs . isNotEmpty ( ) ) throw UncompletedCoroutinesError ( \"\" ) }","docstring":"/**\n * A version of [runBlockingTest] that works with [TestScope].\n */"} {"signature":"@ Deprecated ( \"\" + \"\" + \"\" , level = DeprecationLevel . WARNING ) public fun TestCoroutineScope . runBlockingTest ( block : suspend TestCoroutineScope . ( ) -> Unit ) : Unit","body":"= runBlockingTest ( coroutineContext , block )","docstring":"/**\n * Convenience method for calling [runBlockingTest] on an existing [TestCoroutineScope].\n *\n * This method is deprecated in favor of [runTest], whereas [TestCoroutineScope] is deprecated in favor of [TestScope].\n * Please see the\n * [migration guide](https://github.com/Kotlin/kotlinx.coroutines/blob/master/kotlinx-coroutines-test/MIGRATION.md)\n * for an instruction on how to update the code for the new API.\n */"} {"signature":"@ Deprecated ( \"\" , level = DeprecationLevel . WARNING ) public fun TestScope . runBlockingTest ( block : suspend TestScope . ( ) -> Unit ) : Unit","body":"= runBlockingTestOnTestScope ( coroutineContext , block )","docstring":"/**\n * Convenience method for calling [runBlockingTestOnTestScope] on an existing [TestScope].\n */"} {"signature":"@ Deprecated ( \"\" + \"\" + \"\" , level = DeprecationLevel . WARNING ) public fun TestCoroutineDispatcher . runBlockingTest ( block : suspend TestCoroutineScope . ( ) -> Unit ) : Unit","body":"= runBlockingTest ( this , block )","docstring":"/**\n * Convenience method for calling [runBlockingTest] on an existing [TestCoroutineDispatcher].\n *\n * This method is deprecated in favor of [runTest], whereas [TestCoroutineScope] is deprecated in favor of [TestScope].\n * Please see the\n * [migration guide](https://github.com/Kotlin/kotlinx.coroutines/blob/master/kotlinx-coroutines-test/MIGRATION.md)\n * for an instruction on how to update the code for the new API.\n */"} {"signature":"@ ExperimentalCoroutinesApi @ Deprecated ( \"\" , level = DeprecationLevel . WARNING ) public fun runTestWithLegacyScope ( context : CoroutineContext = EmptyCoroutineContext , dispatchTimeoutMs : Long = DEFAULT_DISPATCH_TIMEOUT_MS , testBody : suspend TestCoroutineScope . ( ) -> Unit )","body":"{ if ( context [ RunningInRunTest ] != null ) throw IllegalStateException ( \"\" ) val testScope = TestBodyCoroutine ( createTestCoroutineScope ( context + RunningInRunTest ) ) return createTestResult { runTestCoroutineLegacy ( testScope , dispatchTimeoutMs . milliseconds , TestBodyCoroutine :: tryGetCompletionCause , testBody ) { try { testScope . cleanup ( ) emptyList ( ) } catch ( e : UncompletedCoroutinesError ) { throw e } catch ( e : Throwable ) { listOf ( e ) } } } }","docstring":"/**\n * This is an overload of [runTest] that works with [TestCoroutineScope].\n */"} {"signature":"@ ExperimentalCoroutinesApi @ Deprecated ( \"\" , level = DeprecationLevel . WARNING ) public fun TestCoroutineScope . runTest ( dispatchTimeoutMs : Long = DEFAULT_DISPATCH_TIMEOUT_MS , block : suspend TestCoroutineScope . ( ) -> Unit ) : TestResult","body":"= runTestWithLegacyScope ( coroutineContext , dispatchTimeoutMs , block )","docstring":"/**\n * Runs a test in a [TestCoroutineScope] based on this one.\n *\n * Calls [runTest] using a coroutine context from this [TestCoroutineScope]. The [TestCoroutineScope] used to run the\n * [block] will be different from this one, but will use its [Job] as a parent.\n *\n * Since this function returns [TestResult], in order to work correctly on the JS, its result must be returned\n * immediately from the test body. See the docs for [TestResult] for details.\n */"} {"signature":"fun tryGetCompletionCause ( ) : Throwable ?","body":"= completionCause","docstring":"/** Throws an exception if the coroutine is not completing. */"} {"signature":"fun x ( )","body":"{ }","docstring":"/**\n * [ArrayList]\n */"} {"signature":"fun renameLocalNames ( context : NamingContext , function : JsFunction )","body":"{ for ( name in collectDefinedNames ( function . body ) ) { val temporaryName = JsScope . declareTemporaryName ( name . ident ) . apply { staticRef = name . staticRef } context . replaceName ( name , temporaryName . makeRef ( ) ) } }","docstring":"/**\n * Makes function local names fresh in context\n */"} {"signature":"public operator fun get ( index : Int ) : UByte","body":"= storage [ index ] . toUByte ( )","docstring":"/**\n * Returns the array element at the given [index]. This method can be called using the index operator.\n *\n * If the [index] is out of bounds of this array, throws an [IndexOutOfBoundsException] except in Kotlin/JS\n * where the behavior is unspecified.\n */"} {"signature":"public operator fun set ( index : Int , value : UByte )","body":"{ storage [ index ] = value . toByte ( ) }","docstring":"/**\n * Sets the element at the given [index] to the given [value]. This method can be called using the index operator.\n *\n * If the [index] is out of bounds of this array, throws an [IndexOutOfBoundsException] except in Kotlin/JS\n * where the behavior is unspecified.\n */"} {"signature":"public override operator fun iterator ( ) : kotlin . collections . Iterator < UByte >","body":"= Iterator ( storage )","docstring":"/** Creates an iterator over the elements of the array. */"} {"signature":"@ SinceKotlin ( \"\" ) @ ExperimentalUnsignedTypes @ kotlin . internal . InlineOnly public inline fun UByteArray ( size : Int , init : ( Int ) -> UByte ) : UByteArray","body":"{ return UByteArray ( ByteArray ( size ) { index -> init ( index ) . toByte ( ) } ) }","docstring":"/**\n * Creates a new array of the specified [size], where each element is calculated by calling the specified\n * [init] function.\n *\n * The function [init] is called for each array element sequentially starting from the first one.\n * It should return the value for an array element given its index.\n */"} {"signature":"private fun denseBenchmarkNames ( src : List < String > ) : Map < String , String >","body":"{ if ( src . isEmpty ( ) ) return emptyMap ( ) var first = true var prefixCut = false val prefix = src . fold ( emptyList < String > ( ) ) { prefix , s -> val names = s . split ( \"\" ) if ( first ) { first = false names . takeWhile { it . lowercase ( ) == it } } else { val common = prefix . zip ( names ) . takeWhile { ( p , n ) -> p == n && n . lowercase ( ) == n } if ( prefix . size != common . size ) prefixCut = true prefix . take ( common . size ) } } . map { if ( prefixCut ) it [ ] . toString ( ) else \"\" } return src . associateWith { s -> val names = prefix + s . split ( \"\" ) . drop ( prefix . size ) names . joinToString ( \"\" ) { if ( it . isNotEmpty ( ) ) \"\" else \"\" } . removeSuffix ( \"\" ) } }","docstring":"/**\n * Algorithm:\n * 1. remove package names, if it is the same for all benchmarks\n * 2. if not, shorthand same package names\n *\n * (jmh similar logic)\n */"} {"signature":"fun javaFile ( pathFromSrc : String , fillFile : JavaTestDataFile . ( ) -> Unit )","body":"fun javaFile ( pathFromSrc : String , fillFile : JavaTestDataFile . ( ) -> Unit )","docstring":"/**\n * Creates a `.java` file.\n *\n * By default, the package of this file is deduced automatically from the [pathFromSrc] param.\n * For example, for a path `org/jetbrains/dokka/test` the package will be `org.jetbrains.dokka.test`.\n * It is normally prohibited for Java files to have a mismatch in package and file path, so it\n * cannot be overridden.\n *\n * @param pathFromSrc path relative to the source code directory of the project.\n * Must contain packages (if any) and end in `.java`.\n * Example: `org/jetbrains/dokka/test/MyClass.java`\n */"} {"signature":"public fun copy ( copiedModelName : String ? = null , copyOptimizerState : Boolean = false , copyWeights : Boolean = true ) : Functional","body":"{ val serializedModel = serializeModel ( true ) return deserializeFunctionalModel ( serializedModel ) . also { modelCopy -> if ( copiedModelName != null ) modelCopy . name = copiedModelName if ( copyWeights ) copyWeightsTo ( modelCopy , copyOptimizerState ) } }","docstring":"/**\n * Creates a copy of this model.\n *\n * @param [copiedModelName] a name for the copy\n * @param [copyOptimizerState] whether optimizer state needs to be copied\n * @param [copyWeights] whether model weights need to be copied\n * @return A copied inference model.\n */"} {"signature":"public fun removeLastLayer ( ) : Functional","body":"{ require ( ! this . isModelCompiled ) { \"\" } val layers = mutableListOf < Layer > ( ) for ( layer in this . layers ) { layers . add ( layer ) } val lastLayer = layers . last ( ) for ( outboundLayer in lastLayer . inboundLayers ) outboundLayer . outboundLayers . remove ( lastLayer ) layers . removeLast ( ) return of ( layers ) }","docstring":"/** Removes the last layer from the [Functional] model, if it's not compiled yet! . */"} {"signature":"@ JvmStatic public fun of ( vararg layers : Layer , noInput : Boolean = false , gpuConfiguration : GpuConfiguration ? = null ) : Functional","body":"{ if ( ! noInput ) { layerValidation ( layers . toList ( ) ) } return preprocessAndCreate ( layers . toList ( ) , gpuConfiguration ) }","docstring":"/**\n * Creates the [Functional] model.\n *\n * @param [noInput] If true it disables input layer check.\n * @param [layers] The layers to describe the model design.\n * @param [gpuConfiguration] The configuration of a model passed to the Tensorflow Runtime.\n *\n * All connections between the layers must be established and form an acyclic directed graph.\n * Layers could be ordered in free way.\n *\n * NOTE: The first layer should be an input layer if you want to compile a model.\n *\n * @return the [Functional] model.\n */"} {"signature":"@ JvmStatic public fun of ( vararg layers : Layer , noInput : Boolean = false ) : Functional","body":"{ return of ( layers = layers , noInput = noInput , gpuConfiguration = null ) }","docstring":"/**\n * Creates the [Functional] model.\n *\n * @param [noInput] If true it disables input layer check.\n * @param [layers] The layers to describe the model design.\n *\n * All connections between the layers must be established and form an acyclic directed graph.\n * Layers could be ordered in free way.\n *\n * NOTE: The first layer should be an input layer if you want to compile a model.\n *\n * @return the [Functional] model.\n */"} {"signature":"@ JvmStatic public fun of ( layers : List < Layer > , noInput : Boolean = false , gpuConfiguration : GpuConfiguration ? = null ) : Functional","body":"{ if ( ! noInput ) { layerValidation ( layers . toList ( ) ) } return preprocessAndCreate ( layers , gpuConfiguration = gpuConfiguration ) }","docstring":"/**\n * Creates the [Functional] model.\n *\n * @param [noInput] If true it disables input layer check.\n * @param [layers] The layers to describe the model design.\n * @param [gpuConfiguration] The configuration of a model passed to the Tensorflow Runtime.\n *\n * All connections between the layers must be established and form an acyclic directed graph.\n * Layers could be ordered in free way.\n *\n * NOTE: The first layer should be an input layer if you want to compile a model.\n *\n * @return the [Functional] model.\n */"} {"signature":"@ JvmStatic public fun of ( layers : List < Layer > , noInput : Boolean = false ) : Functional","body":"{ return of ( layers = layers , noInput = noInput , gpuConfiguration = null ) }","docstring":"/**\n * Creates the [Functional] model.\n *\n * @param [noInput] If true it disables input layer check.\n * @param [layers] The layers to describe the model design.\n *\n * All connections between the layers must be established and form an acyclic directed graph.\n * Layers could be ordered in free way.\n *\n * NOTE: The first layer should be an input layer if you want to compile a model.\n *\n * @return the [Functional] model.\n */"} {"signature":"@ JvmStatic public fun of ( pretrainedModel : GraphTrainableModel , topModel : GraphTrainableModel , gpuConfiguration : GpuConfiguration ? = null ) : Functional","body":"{ require ( ! pretrainedModel . isModelCompiled ) { \"\" } require ( ! topModel . isModelCompiled ) { \"\" } val pretrainedLayers = pretrainedModel . layers pretrainedLayers . forEach { it . freeze ( ) } val layers = mutableListOf < Layer > ( ) layers += pretrainedLayers val topLayers = topModel . layers layers += topLayers topLayers [ ] . inboundLayers . add ( pretrainedLayers . last ( ) ) if ( topModel is Sequential && layers . size > ) { topLayers . subList ( , topLayers . size ) . forEachIndexed { index , layer -> val topLayersIndex = index - + layer . inboundLayers . add ( topLayers [ topLayersIndex ] ) } } return of ( layers , gpuConfiguration = gpuConfiguration ) }","docstring":"/**\n * Creates the [Functional] model from two models: [pretrainedModel] and [topModel].\n * All layers of pretrainedModel will be frozen automatically.\n * The input of the [topModel] will be connected to the output of the [pretrainedModel].\n *\n * NOTE: First layer of [pretrainedModel] should be an input layer.\n * NOTE: Both models should be non-compiled still.\n *\n * @return the [Functional] model.\n */"} {"signature":"@ JvmStatic public fun of ( pretrainedModel : GraphTrainableModel , topModel : GraphTrainableModel ) : Functional","body":"{ return of ( pretrainedModel , topModel , null ) }","docstring":"/**\n * Creates the [Functional] model from two models: [pretrainedModel] and [topModel].\n * All layers of pretrainedModel will be frozen automatically.\n * The input of the [topModel] will be connected to the output of the [pretrainedModel].\n *\n * NOTE: First layer of [pretrainedModel] should be an input layer.\n * NOTE: Both models should be non-compiled still.\n *\n * @return the [Functional] model.\n */"} {"signature":"@ JvmStatic public fun fromOutput ( finalLayer : Layer , gpuConfiguration : GpuConfiguration ? = null ) : Functional","body":"{ require ( finalLayer . inboundLayers . isNotEmpty ( ) ) { \"\" } val layers = mutableSetOf < Layer > ( ) layers . add ( finalLayer ) visitInboundNodes ( finalLayer , layers ) return preprocessAndCreate ( layers . toList ( ) , gpuConfiguration ) }","docstring":"/**\n * Creates the [Functional] model.\n *\n * @param [finalLayer] This layer specifies the output tensors that represent the outputs of this model.\n * All connections between the layers must be established and form an acyclic directed graph.\n *\n * @return the [Functional] model.\n */"} {"signature":"@ JvmStatic public fun fromOutput ( finalLayer : Layer ) : Functional","body":"{ return fromOutput ( finalLayer , null ) }","docstring":"/**\n * Creates the [Functional] model.\n *\n * @param [finalLayer] This layer specifies the output tensors that represent the outputs of this model.\n * All connections between the layers must be established and form an acyclic directed graph.\n *\n * @return the [Functional] model.\n */"} {"signature":"private fun preprocessAndCreate ( layers : List < Layer > , gpuConfiguration : GpuConfiguration ? = null ) : Functional","body":"{ val inputLayer = findInputLayer ( layers ) fillOutputLayers ( layers ) val layerList = topologicalSort ( layers , inputLayer ) preProcessLayerNames ( layerList . toTypedArray ( ) ) return Functional ( * layerList . toTypedArray ( ) , gpuConfiguration = gpuConfiguration ) }","docstring":"/**\n * Creates the [Functional] model.\n * @property [layers] The layers to describe the model design.\n *\n * NOTE: The first layer should be the input layer.\n *\n * @return the [Functional] model.\n */"} {"signature":"@ JvmStatic public fun loadModelConfiguration ( configuration : File , inputShape : IntArray ? = null ) : Functional","body":"{ require ( configuration . isFile ) { \"\" } return loadFunctionalModelConfiguration ( configuration , inputShape ) }","docstring":"/**\n * Loads a [Functional] model from json file with model configuration.\n *\n * @param [configuration] File in .json format, containing the [Functional] model.\n * @return Non-compiled and non-trained Functional model.\n */"} {"signature":"@ JvmStatic public fun loadModelLayersFromConfiguration ( configuration : File , inputShape : IntArray ? = null ) : List < Layer >","body":"{ require ( configuration . isFile ) { \"\" } val functionalConfig = loadSerializedModel ( configuration ) return loadFunctionalModelLayers ( functionalConfig , inputShape ) }","docstring":"/**\n * Loads a [Functional] model layers from json file with model configuration.\n *\n * @param [configuration] File in .json format, containing the [Functional] model.\n * @return List of layers. All connections between the layers are established and form an acyclic directed graph.\n */"} {"signature":"@ JvmStatic public fun loadDefaultModelConfiguration ( modelDirectory : File , inputShape : IntArray ? = null ) : Functional","body":"{ require ( modelDirectory . isDirectory ) { \"\" } val configuration = File ( \"\" ) if ( ! configuration . exists ( ) ) throw FileNotFoundException ( \"\" + \"\" ) return loadFunctionalModelConfiguration ( configuration , inputShape ) }","docstring":"/**\n * Loads a [Functional] model from json file with name 'modelConfig.json' with model configuration located in [modelDirectory].\n *\n * @param [modelDirectory] Directory, containing file 'modelConfig.json'.\n * @throws [FileNotFoundException] If 'modelConfig.json' file is not found.\n * @return Non-compiled and non-trained Functional model.\n */"} {"signature":"@ JvmStatic public fun loadModelLayersFromDefaultConfiguration ( modelDirectory : File , inputShape : IntArray ? = null ) : List < Layer >","body":"{ require ( modelDirectory . isDirectory ) { \"\" } val configuration = File ( \"\" ) if ( ! configuration . exists ( ) ) throw FileNotFoundException ( \"\" + \"\" ) val functionalConfig = loadSerializedModel ( configuration ) return loadFunctionalModelLayers ( functionalConfig , inputShape ) }","docstring":"/**\n * Loads a [Functional] model layers from json file with name 'modelConfig.json' with model configuration located in [modelDirectory].\n *\n * @param [modelDirectory] Directory, containing file 'modelConfig.json'.\n * @throws [FileNotFoundException] If 'modelConfig.json' file is not found.\n * @return List of layers. All connections between the layers are established and form an acyclic directed graph.\n */"} {"signature":"internal fun convertToState ( value : Any ? , irType : IrType ) : State","body":"{ return when ( value ) { is Proxy -> value . state is State -> value is Boolean , is Char , is Byte , is Short , is Int , is Long , is String , is Float , is Double , is Array < * > , is ByteArray , is CharArray , is ShortArray , is IntArray , is LongArray , is FloatArray , is DoubleArray , is BooleanArray -> Primitive ( value , irType ) null -> Primitive . nullStateOfType ( irType ) else -> irType . classOrNull ? . owner ? . let { Wrapper ( value , it , this ) } ? : Wrapper ( value , this . javaClassToIrClass [ value :: class . java ] ! ! , this ) } }","docstring":"/**\n * Convert object from outer world to state\n */"} {"signature":"private fun FirNamedFunctionSymbol . shouldBeVisibleAsOverrideOfBuiltInWithErasedValueParameters ( ) : Boolean","body":"{ if ( ! name . sameAsBuiltinMethodWithErasedValueParameters ) return false val candidatesToOverride = supertypeScopeContext . collectIntersectionResultsForCallables ( name , FirScope :: processFunctionsByName ) . flatMap { it . overriddenMembers } . filterNot { ( member , _ ) -> member . valueParameterSymbols . all { it . resolvedReturnType . lowerBoundIfFlexible ( ) . isAny } } . mapNotNull { ( member , scope ) -> BuiltinMethodsWithSpecialGenericSignature . getOverriddenBuiltinFunctionWithErasedValueParametersInJava ( member , scope ) } val jvmDescriptor = fir . computeJvmDescriptor ( ) return candidatesToOverride . any { candidate -> candidate . fir . computeJvmDescriptor ( ) == jvmDescriptor && this . hasErasedParameters ( ) } }","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 *\n * There is a case when we shouldn't hide a function even if it overrides builtin member with value parameter erasure:\n * if substituted kotlin overridden has the same parameters as current java override. Such situation may happen only in\n * case when `Any`/`Object` is used as parameterization of supertype:\n *\n * // java\n * class MySuperMap extends java.util.Map {\n * @Override\n * public boolean containsKey(Object key) {...}\n *\n * @Override\n * public boolean containsValue(Object key) {...}\n * }\n *\n * In this case, the signature of override, made based on the correct kotlin signature, will be the same (because of { K -> Any, V -> Any }\n * substitution for both functions).\n * And since the list of all such functions is well-known, the only case when this may happen is when value parameter types of kotlin\n * overridden are `Any`\n */"} {"signature":"private fun processOverridesForFunctionsWithErasedValueParameter ( name : Name , destination : MutableCollection < FirNamedFunctionSymbol > , resultOfIntersectionWithNaturalName : ResultOfIntersection < FirNamedFunctionSymbol > , explicitlyDeclaredFunctionWithNaturalName : FirNamedFunctionSymbol ? ) : Boolean","body":"{ val membersFromSupertypesWithScopes = resultOfIntersectionWithNaturalName . overriddenMembers val memberFromSupertypeWithValueParametersToBeErased = membersFromSupertypesWithScopes . firstOrNull { ( member , scope ) -> BuiltinMethodsWithSpecialGenericSignature . getOverriddenBuiltinFunctionWithErasedValueParametersInJava ( member , scope ) != null } ? . member ? : return false val unwrappedMemberFromSupertypeWithValueParametersToBeErased = memberFromSupertypeWithValueParametersToBeErased . fir . originalForSubstitutionOverride ? : memberFromSupertypeWithValueParametersToBeErased . fir val functionFromSupertypeWithValueParametersToBeErased = unwrappedMemberFromSupertypeWithValueParametersToBeErased . initialSignatureAttr ? . symbol as? FirNamedFunctionSymbol ? : unwrappedMemberFromSupertypeWithValueParametersToBeErased . symbol val explicitlyDeclaredFunctionWithErasedValueParameters = declaredMemberScope . getFunctions ( name ) . firstOrNull { declaredFunction -> declaredFunction . hasSameJvmDescriptor ( functionFromSupertypeWithValueParametersToBeErased ) && declaredFunction . hasErasedParameters ( ) && javaOverrideChecker . doesReturnTypesHaveSameKind ( functionFromSupertypeWithValueParametersToBeErased . fir , declaredFunction . fir ) } ? : return false var allParametersAreAny = true val declaredFunctionCopyWithParameterTypesFromSupertype = buildJavaMethodCopy ( explicitlyDeclaredFunctionWithErasedValueParameters . fir as FirJavaMethod ) { this . name = name symbol = FirNamedFunctionSymbol ( explicitlyDeclaredFunctionWithErasedValueParameters . callableId ) this . valueParameters . clear ( ) explicitlyDeclaredFunctionWithErasedValueParameters . fir . valueParameters . zip ( memberFromSupertypeWithValueParametersToBeErased . fir . valueParameters ) . mapTo ( this . valueParameters ) { ( overrideParameter , parameterFromSupertype ) -> if ( ! parameterFromSupertype . returnTypeRef . coneType . lowerBoundIfFlexible ( ) . isAny ) { allParametersAreAny = false } buildJavaValueParameterCopy ( overrideParameter ) { this@buildJavaValueParameterCopy . returnTypeRef = parameterFromSupertype . returnTypeRef } } } . apply { initialSignatureAttr = explicitlyDeclaredFunctionWithErasedValueParameters . fir } . symbol if ( allParametersAreAny ) { return false } val accidentalOverrideWithDeclaredFunction = explicitlyDeclaredFunctionWithNaturalName ? . takeIf { overrideChecker . isOverriddenFunction ( declaredFunctionCopyWithParameterTypesFromSupertype , it ) } val symbolToBeCollected = if ( accidentalOverrideWithDeclaredFunction == null ) { declaredFunctionCopyWithParameterTypesFromSupertype } else { val newSymbol = FirNamedFunctionSymbol ( accidentalOverrideWithDeclaredFunction . callableId ) val original = accidentalOverrideWithDeclaredFunction . fir val accidentalOverrideWithDeclaredFunctionHiddenCopy = buildSimpleFunctionCopy ( original ) { this . name = name symbol = newSymbol dispatchReceiverType = klass . defaultType ( ) } . apply { initialSignatureAttr = explicitlyDeclaredFunctionWithErasedValueParameters . fir isHiddenToOvercomeSignatureClash = true } accidentalOverrideWithDeclaredFunctionHiddenCopy . symbol } destination += symbolToBeCollected directOverriddenFunctions [ symbolToBeCollected ] = listOf ( resultOfIntersectionWithNaturalName ) for ( ( member , _ ) in membersFromSupertypesWithScopes ) { overrideByBase [ member ] = symbolToBeCollected } return true }","docstring":"/**\n * This function collects in [destination] an overriding method for base method group [resultOfIntersectionWithNaturalName],\n * in case base methods should have their value parameters erased in Java,\n * e.g. Collection.contains(T) in Kotlin is paired with Collection.contains(Object) in Java.\n *\n * Given we have a Java class [klass] and some its method(s) name [name]\n * with base method group [resultOfIntersectionWithNaturalName] and (maybe)\n * explicitly declared [explicitlyDeclaredFunctionWithNaturalName],\n * this function builds a synthetic override for [resultOfIntersectionWithNaturalName] in the Java class,\n * binds it with this intersection result using the override relation,\n * and collects it as a matching method with this name.\n *\n * Important: all explicitly declared functions are already collected at this point, there is no reason to collect them once more!\n *\n * @param name a given method name\n * @param destination used to collect base functions for [explicitlyDeclaredFunctionWithNaturalName] with erased value parameters in Java\n * @param resultOfIntersectionWithNaturalName one group of intersected base methods, each \"overridden member\" inside is a pair of (base method, its scope)\n * @param explicitlyDeclaredFunctionWithNaturalName the function in the Java class [klass] with the name [name], which overrides [resultOfIntersectionWithNaturalName] (if any)\n * @return true if we collected something, false otherwise\n * @see [SpecialGenericSignatures.GENERIC_PARAMETERS_METHODS_TO_DEFAULT_VALUES_MAP] and\n * [SpecialGenericSignatures.ERASED_COLLECTION_PARAMETER_NAME_AND_SIGNATURES]\n */"} {"signature":"private fun processOverridesForFunctionsWithDifferentJvmName ( someSymbolWithNaturalNameFromSuperType : FirNamedFunctionSymbol , explicitlyDeclaredFunctionWithNaturalName : FirNamedFunctionSymbol ? , naturalName : Name , resultOfIntersectionWithNaturalName : ResultOfIntersection < FirNamedFunctionSymbol > , destination : MutableCollection < FirNamedFunctionSymbol > , functionsFromSupertypesToSaveInCache : MutableList < ResultOfIntersection < FirNamedFunctionSymbol > > ) : Boolean","body":"{ val jvmName = resultOfIntersectionWithNaturalName . overriddenMembers . firstNotNullOfOrNull { it . member . getJvmMethodNameIfSpecial ( it . baseScope , session ) } ? : return false val ( intersectedOverridingRenamedBuiltin , intersectedOverridingNonBuiltin ) = resultOfIntersectionWithNaturalName . overriddenMembers . partition { it . member . getJvmMethodNameIfSpecial ( it . baseScope , session ) == jvmName } val explicitlyDeclaredFunctionWithBuiltinJvmName = declaredMemberScope . getFunctions ( jvmName ) . firstOrNull { overrideChecker . isOverriddenFunction ( it , someSymbolWithNaturalNameFromSuperType ) } val functionsFromSupertypesWithBuiltinJvmName = supertypeScopeContext . collectFunctions ( jvmName ) . firstOrNull { overrideChecker . similarFunctionsOrBothProperties ( it . extractSomeSymbolFromSuperType ( ) , someSymbolWithNaturalNameFromSuperType ) } fun createCopyWithNaturalName ( originalSymbol : FirNamedFunctionSymbol , isHidden : Boolean = false , origin : FirDeclarationOrigin ? = null , ) : FirNamedFunctionSymbol { val original = originalSymbol . fir val newSymbol = FirNamedFunctionSymbol ( originalSymbol . callableId . copy ( callableName = naturalName ) ) return if ( original is FirJavaMethod ) { buildJavaMethodCopy ( original ) { name = naturalName symbol = newSymbol dispatchReceiverType = klass . defaultType ( ) status = original . status . copy ( isOperator = true ) } } else { buildSimpleFunctionCopy ( original ) { name = naturalName symbol = newSymbol dispatchReceiverType = klass . defaultType ( ) origin ? . let { this . origin = it } } } . apply { initialSignatureAttr = original if ( isHidden ) { isHiddenToOvercomeSignatureClash = true } } . symbol } val resultsOfIntersectionWithNaturalNameOrRenamed = when { functionsFromSupertypesWithBuiltinJvmName != null -> { val membersByScope = buildList { intersectedOverridingRenamedBuiltin . mapTo ( this ) { it . baseScope to listOf ( it . member ) } addAll ( functionsFromSupertypesWithBuiltinJvmName . overriddenMembers . map { val renamedFunction = createCopyWithNaturalName ( it . member , origin = FirDeclarationOrigin . RenamedForOverride ) it . baseScope to listOf ( renamedFunction ) } ) } supertypeScopeContext . convertGroupedCallablesToIntersectionResults ( membersByScope ) } else -> { if ( intersectedOverridingNonBuiltin . isEmpty ( ) ) listOf ( resultOfIntersectionWithNaturalName ) else supertypeScopeContext . convertGroupedCallablesToIntersectionResults ( intersectedOverridingRenamedBuiltin . map { it . baseScope to listOf ( it . member ) } ) } } val functionWithNaturalNameExists = explicitlyDeclaredFunctionWithNaturalName != null || intersectedOverridingNonBuiltin . isNotEmpty ( ) if ( explicitlyDeclaredFunctionWithBuiltinJvmName != null ) { val renamedFunction = createCopyWithNaturalName ( explicitlyDeclaredFunctionWithBuiltinJvmName , isHidden = functionWithNaturalNameExists ) destination += renamedFunction setOverrides ( renamedFunction , resultsOfIntersectionWithNaturalNameOrRenamed ) } if ( functionWithNaturalNameExists ) { val resultOfIntersectionOfOverridingNonBuiltin = supertypeScopeContext . convertGroupedCallablesToIntersectionResults ( intersectedOverridingNonBuiltin . map { it . baseScope to listOf ( it . member ) } ) if ( explicitlyDeclaredFunctionWithNaturalName != null ) { setOverrides ( explicitlyDeclaredFunctionWithNaturalName , when { explicitlyDeclaredFunctionWithBuiltinJvmName == null -> resultsOfIntersectionWithNaturalNameOrRenamed else -> resultOfIntersectionOfOverridingNonBuiltin } ) } else { val intersectionOfNaturalName = resultOfIntersectionOfOverridingNonBuiltin . single ( ) destination += intersectionOfNaturalName . chosenSymbol if ( intersectionOfNaturalName is ResultOfIntersection . NonTrivial ) { setOverrides ( intersectionOfNaturalName . chosenSymbol , resultOfIntersectionOfOverridingNonBuiltin ) } } } else if ( explicitlyDeclaredFunctionWithBuiltinJvmName == null ) { for ( resultOfIntersection in resultsOfIntersectionWithNaturalNameOrRenamed ) { destination += resultOfIntersection . chosenSymbol } functionsFromSupertypesToSaveInCache += resultsOfIntersectionWithNaturalNameOrRenamed } return true }","docstring":"/**\n * This function collects in [destination] an overriding method for base method group [resultOfIntersectionWithNaturalName],\n * in case base methods should have its name changed in Java,\n * e.g. MutableList.removeAt(Int) in Kotlin is paired with List.remove(int) in Java.\n *\n * Given we have a Java class [klass] and some its method(s) name mapped to [naturalName] in Kotlin\n * with base method group [resultOfIntersectionWithNaturalName] and (maybe)\n * explicitly declared [explicitlyDeclaredFunctionWithNaturalName],\n * this function builds a synthetic override for [resultOfIntersectionWithNaturalName] in the Java class,\n * binds it with this intersection result using the override relation,\n * and collects it as a matching method with this [naturalName].\n *\n * Important: all explicitly declared functions are already collected at this point, there is no reason to collect them once more!\n *\n * @param naturalName the Kotlin name of the function, e.g., toByte, get, removeAt\n * @param destination used to collect base functions for [explicitlyDeclaredFunctionWithNaturalName] with erased value parameters in Java\n * @param resultOfIntersectionWithNaturalName one group of intersected base methods, each \"overridden member\" inside is a pair of (base method, its scope)\n * @param someSymbolWithNaturalNameFromSuperType unwrapped symbol taken from [resultOfIntersectionWithNaturalName]\n * @param explicitlyDeclaredFunctionWithNaturalName the function in the Java class [klass] with the name [naturalName], which overrides [resultOfIntersectionWithNaturalName] (if any)\n * @return true if we collected something, false otherwise\n * @see [SpecialGenericSignatures.NAME_AND_SIGNATURE_TO_JVM_REPRESENTATION_NAME_MAP] and\n * [SpecialGenericSignatures.JVM_SIGNATURES_FOR_RENAMED_BUILT_INS]\n */"} {"signature":"private fun FirRegularClass . hasKotlinSuper ( session : FirSession , visited : MutableSet < FirRegularClass > = mutableSetOf ( ) ) : Boolean","body":"= when { ! visited . add ( this ) -> false this is FirJavaClass -> superConeTypes . any { type -> type . toFir ( session ) ? . hasKotlinSuper ( session , visited ) == true } isInterface || origin == FirDeclarationOrigin . BuiltIns -> false else -> true }","docstring":"/**\n * Checks if class has any kotlin super-types apart from builtins and interfaces\n */"} {"signature":"private fun Frame < BasicValue > . getUninitializedValueForConstructorCall ( insn : AbstractInsnNode ) : UninitializedNewValue ?","body":"{ if ( ! insn . isConstructorCall ( ) ) return null assert ( insn . opcode == Opcodes . INVOKESPECIAL ) { \"\" } val paramsCountIncludingReceiver = Type . getArgumentTypes ( ( insn as MethodInsnNode ) . desc ) . size + val newValue = peek ( paramsCountIncludingReceiver ) as? UninitializedNewValue ? : if ( isInSpecialMethod ) return null else error ( \"\" ) assert ( peek ( paramsCountIncludingReceiver - ) is UninitializedNewValue ) { \"\" } return newValue }","docstring":"/**\n * @return value generated by NEW that used as 0-th argument of constructor call or null if current instruction is not constructor call\n */"} {"signature":"@ Test fun testRenameFileFacade ( )","body":"{ val changes = computeClasspathChanges ( File ( testDataDir , \"\" ) , tmpDir ) Changes ( lookupSymbols = setOf ( LookupSymbol ( name = \"\" , scope = \"\" ) , LookupSymbol ( name = \"\" , scope = \"\" ) , ) , fqNames = setOf ( \"\" ) ) . assertEquals ( changes ) }","docstring":"/** Regression test for KT-55021. */"} {"signature":"@ Test fun testChangedAnnotations ( )","body":"{ val changes = computeClasspathChanges ( File ( testDataDir , \"\" ) , tmpDir ) Changes ( lookupSymbols = setOf ( LookupSymbol ( name = \"\" , scope = \"\" ) , ) , fqNames = setOf ( \"\" , ) ) . assertEquals ( changes ) }","docstring":"/** Regression test for KT-58289.*/"} {"signature":"@ Test fun testDelegatedProperties ( )","body":"{ val changes = computeClasspathChanges ( File ( testDataDir , \"\" ) , tmpDir ) Changes ( lookupSymbols = setOf ( LookupSymbol ( name = \"\" , scope = \"\" ) , ) , fqNames = setOf ( \"\" ) ) . assertEquals ( changes ) }","docstring":"/** Regression test for KT-58986.*/"} {"signature":"@ Test override fun testImpactComputation_SupertypesInheritors ( )","body":"{ val changes = computeClasspathChanges ( File ( testDataDir , \"\" ) , tmpDir ) Changes ( lookupSymbols = setOf ( LookupSymbol ( name = \"\" , scope = \"\" ) , LookupSymbol ( name = \"\" , scope = \"\" ) , LookupSymbol ( name = \"\" , scope = \"\" ) , LookupSymbol ( name = \"\" , scope = \"\" ) , LookupSymbol ( name = \"\" , scope = \"\" ) , LookupSymbol ( name = \"\" , scope = \"\" ) , LookupSymbol ( name = SAM_LOOKUP_NAME . asString ( ) , scope = \"\" ) , LookupSymbol ( name = SAM_LOOKUP_NAME . asString ( ) , scope = \"\" ) , LookupSymbol ( name = SAM_LOOKUP_NAME . asString ( ) , scope = \"\" ) ) , fqNames = setOf ( \"\" , \"\" , \"\" ) ) . assertEquals ( changes ) }","docstring":"/** Tests [SupertypesInheritorsImpact]. */"} {"signature":"@ Test fun testImpactComputation_ConstantsInCompanionObjects ( )","body":"{ val changes = computeClasspathChanges ( File ( testDataDir , \"\" ) , tmpDir ) Changes ( lookupSymbols = setOf ( LookupSymbol ( name = \"\" , scope = \"\" ) , LookupSymbol ( name = SAM_LOOKUP_NAME . asString ( ) , scope = \"\" ) , LookupSymbol ( name = \"\" , scope = \"\" ) , ) , fqNames = setOf ( \"\" , \"\" ) ) . assertEquals ( changes ) }","docstring":"/**\n * Tests [ConstantsInCompanionObjectsImpact].\n *\n * Note that this test is slightly different from [testConstantsAndInlineFunctions]: In [testConstantsAndInlineFunctions], the companion\n * object's .class file changes, whereas in this test, the companion object's .class file does not change because we want to test that\n * the companion object is unchanged but *impacted* by the change in the .class file of the companion object's outer class.\n */"} {"signature":"@ Test override fun testImpactComputation_SupertypesInheritors ( )","body":"{ val changes = computeClasspathChanges ( File ( testDataDir , \"\" ) , tmpDir ) Changes ( lookupSymbols = setOf ( LookupSymbol ( name = \"\" , scope = \"\" ) , LookupSymbol ( name = \"\" , scope = \"\" ) , LookupSymbol ( name = \"\" , scope = \"\" ) , LookupSymbol ( name = \"\" , scope = \"\" ) , LookupSymbol ( name = \"\" , scope = \"\" ) , LookupSymbol ( name = \"\" , scope = \"\" ) , LookupSymbol ( name = SAM_LOOKUP_NAME . asString ( ) , scope = \"\" ) , LookupSymbol ( name = SAM_LOOKUP_NAME . asString ( ) , scope = \"\" ) , LookupSymbol ( name = SAM_LOOKUP_NAME . asString ( ) , scope = \"\" ) ) , fqNames = setOf ( \"\" , \"\" , \"\" ) ) . assertEquals ( changes ) }","docstring":"/** Tests [SupertypesInheritorsImpact]. */"} {"signature":"fun ScriptCompilationConfiguration ? . with ( body : ScriptCompilationConfiguration . Builder . ( ) -> Unit ) : ScriptCompilationConfiguration","body":"{ val newConfiguration = if ( this == null ) ScriptCompilationConfiguration ( body = body ) else ScriptCompilationConfiguration ( this , body = body ) return if ( newConfiguration == this ) this else newConfiguration }","docstring":"/**\n * An alternative to the constructor with base configuration, which returns a new configuration only if [body] adds anything\n * to the original one, otherwise returns original\n */"} {"signature":"fun beforeParsing ( handler : RefineScriptCompilationConfigurationHandler )","body":"{ ScriptCompilationConfiguration . refineConfigurationBeforeParsing . append ( RefineConfigurationUnconditionallyData ( handler ) ) }","docstring":"/**\n * The callback that will be called on the script compilation before parsing the script\n * @param handler the callback that will be called\n */"} {"signature":"fun onAnnotations ( annotations : List < KotlinType > , handler : RefineScriptCompilationConfigurationHandler )","body":"{ ScriptCompilationConfiguration . refineConfigurationOnAnnotations . append ( RefineConfigurationOnAnnotationsData ( annotations , handler ) ) }","docstring":"/**\n * The callback that will be called on the script compilation after parsing script file annotations\n * @param annotations the list of annotations to trigger the callback on\n * @param handler the callback that will be called\n */"} {"signature":"fun onAnnotations ( vararg annotations : KotlinType , handler : RefineScriptCompilationConfigurationHandler )","body":"{ onAnnotations ( annotations . asList ( ) , handler ) }","docstring":"/**\n * The callback that will be called on the script compilation after parsing script file annotations\n * @param annotations the list of annotations to trigger the callback on\n * @param handler the callback that will be called\n */"} {"signature":"inline fun < reified T : Annotation > onAnnotations ( noinline handler : RefineScriptCompilationConfigurationHandler )","body":"{ onAnnotations ( listOf ( KotlinType ( T :: class ) ) , handler ) }","docstring":"/**\n * The callback that will be called on the script compilation after parsing script file annotations\n * @param T the annotation to trigger the callback on\n * @param handler the callback that will be called\n */"} {"signature":"fun onAnnotations ( vararg annotations : KClass < out Annotation > , handler : RefineScriptCompilationConfigurationHandler )","body":"{ onAnnotations ( annotations . map { KotlinType ( it ) } , handler ) }","docstring":"/**\n * The callback that will be called on the script compilation after parsing script file annotations\n * @param annotations the list of annotations to trigger the callback on\n * @param handler the callback that will be called\n */"} {"signature":"fun onAnnotations ( annotations : Iterable < KClass < out Annotation > > , handler : RefineScriptCompilationConfigurationHandler )","body":"{ onAnnotations ( annotations . map { KotlinType ( it ) } , handler ) }","docstring":"/**\n * The callback that will be called on the script compilation after parsing script file annotations\n * @param annotations the list of annotations to trigger the callback on\n * @param handler the callback that will be called\n */"} {"signature":"fun beforeCompiling ( handler : RefineScriptCompilationConfigurationHandler )","body":"{ ScriptCompilationConfiguration . refineConfigurationBeforeCompiling . append ( RefineConfigurationUnconditionallyData ( handler ) ) }","docstring":"/**\n * The callback that will be called on the script compilation immediately before starting the compilation\n * @param handler the callback that will be called\n */"} {"signature":"suspend operator fun invoke ( script : SourceCode , scriptCompilationConfiguration : ScriptCompilationConfiguration ) : ResultWithDiagnostics < CompiledScript >","body":"suspend operator fun invoke ( script : SourceCode , scriptCompilationConfiguration : ScriptCompilationConfiguration ) : ResultWithDiagnostics < CompiledScript >","docstring":"/**\n * Compiles the [script] according to the [scriptCompilationConfiguration]\n * @param script the interface to the script source code\n * @param scriptCompilationConfiguration the script compilation configuration properties\n * @return result wrapper, if successful - with compiled script\n */"} {"signature":"suspend fun getClass ( scriptEvaluationConfiguration : ScriptEvaluationConfiguration ? ) : ResultWithDiagnostics < KClass < * > >","body":"suspend fun getClass ( scriptEvaluationConfiguration : ScriptEvaluationConfiguration ? ) : ResultWithDiagnostics < KClass < * > >","docstring":"/**\n * The function that loads compiled script class\n * @param scriptEvaluationConfiguration the script evaluation configuration properties\n * @return result wrapper, if successful - with loaded KClass\n */"} {"signature":"internal fun fromJsonListAnyColumns ( records : List < * > , keyValuePaths : List < JsonPath > = emptyList ( ) , header : List < String > = emptyList ( ) , jsonPath : JsonPath = JsonPath ( ) , ) : AnyFrame","body":"{ var hasPrimitive = false var hasArray = false var hasObject = false val nameGenerator = ColumnNameGenerator ( ) records . forEach { when ( it ) { is JsonObject -> { hasObject = true it . entries . forEach { nameGenerator . addIfAbsent ( it . key ) } } is JsonArray < * > -> hasArray = true null -> Unit else -> hasPrimitive = true } } val colType = when { hasArray && ! hasPrimitive && ! hasObject -> AnyColType . ARRAYS hasObject && ! hasPrimitive && ! hasArray -> AnyColType . OBJECTS else -> AnyColType . ANY } val justPrimitives = hasPrimitive && ! hasArray && ! hasObject val isKeyValue = keyValuePaths . any { jsonPath . matches ( it ) } if ( isKeyValue && colType != AnyColType . OBJECTS ) { error ( \"\" ) } @ Suppress ( \"\" ) val columns : List < AnyCol > = when { colType == AnyColType . ANY -> { val collector : DataCollectorBase < Any ? > = if ( justPrimitives ) createDataCollector ( records . size ) else createDataCollector ( records . size , typeOf < Any ? > ( ) ) val nanIndices = mutableListOf < Int > ( ) records . forEachIndexed { i , v -> when ( v ) { is JsonObject -> { val parsed = fromJsonListAnyColumns ( records = listOf ( v ) , keyValuePaths = keyValuePaths , jsonPath = jsonPath . replaceLastWildcardWithIndex ( i ) , ) collector . add ( if ( parsed . isSingleUnnamedColumn ( ) ) ( parsed . getColumn ( ) as UnnamedColumn ) . col . values . first ( ) else parsed . firstOrNull ( ) ? : DataRow . empty ) } is JsonArray < * > -> { val parsed = fromJsonListAnyColumns ( records = v , keyValuePaths = keyValuePaths , jsonPath = jsonPath . replaceLastWildcardWithIndex ( i ) . appendArrayWithWildcard ( ) , ) collector . add ( if ( parsed . isSingleUnnamedColumn ( ) ) ( parsed . getColumn ( ) as UnnamedColumn ) . col . values . asList ( ) else parsed . unwrapUnnamedColumns ( ) ) } \"\" -> { nanIndices . add ( i ) collector . add ( null ) } else -> collector . add ( v ) } } val column = collector . toColumn ( valueColumnName ) val res = if ( nanIndices . isNotEmpty ( ) ) { fun < C > DataColumn < C > . updateNaNs ( nanValue : C ) : DataColumn < C > { var j = var nextNanIndex = nanIndices [ j ] return mapIndexed ( column . type ) { i , v -> if ( i == nextNanIndex ) { j ++ nextNanIndex = if ( j < nanIndices . size ) nanIndices [ j ] else - nanValue } else v } } when ( column . typeClass ) { Double :: class -> column . cast < Double ? > ( ) . updateNaNs ( Double . NaN ) Float :: class -> column . cast < Float ? > ( ) . updateNaNs ( Float . NaN ) String :: class -> column . cast < String ? > ( ) . updateNaNs ( \"\" ) else -> column } } else column listOf ( UnnamedColumn ( res ) ) } colType == AnyColType . ARRAYS -> { val values = mutableListOf < Any ? > ( ) val startIndices = ArrayList < Int > ( ) records . forEach { startIndices . add ( values . size ) when ( it ) { is JsonArray < * > -> values . addAll ( it . value ) null -> Unit else -> error ( \"\" ) } } val parsed = fromJsonListAnyColumns ( records = values , keyValuePaths = keyValuePaths , jsonPath = jsonPath . appendArrayWithWildcard ( ) , ) val res = when { parsed . isSingleUnnamedColumn ( ) -> { val col = ( parsed . getColumn ( ) as UnnamedColumn ) . col val elementType = col . type val values = col . values . asList ( ) . splitByIndices ( startIndices . asSequence ( ) ) . toList ( ) DataColumn . createValueColumn ( name = arrayColumnName , values = values , type = List :: class . createType ( listOf ( KTypeProjection . invariant ( elementType ) ) ) , ) } else -> DataColumn . createFrameColumn ( name = arrayColumnName , df = parsed . unwrapUnnamedColumns ( ) , startIndices = startIndices , ) } listOf ( UnnamedColumn ( res ) ) } colType == AnyColType . OBJECTS && isKeyValue -> { val valueTypes = mutableSetOf < KType > ( ) val dataFrames = records . map { when ( it ) { is JsonObject -> { val map = it . map . mapValues { ( key , value ) -> val parsed = fromJsonListAnyColumns ( records = listOf ( value ) , keyValuePaths = keyValuePaths , jsonPath = jsonPath . append ( key ) , ) if ( parsed . isSingleUnnamedColumn ( ) ) ( parsed . getColumn ( ) as UnnamedColumn ) . col . values . first ( ) else parsed . unwrapUnnamedColumns ( ) . firstOrNull ( ) } val valueType = map . values . map { guessValueType ( sequenceOf ( it ) ) } . commonType ( ) valueTypes += valueType dataFrameOf ( columnOf ( * map . keys . toTypedArray ( ) ) . named ( KeyValueProperty < * > :: key . name ) , createColumn ( values = map . values , suggestedType = valueType , guessType = false ) . named ( KeyValueProperty < * > :: value . name ) , ) } null -> DataFrame . emptyOf < AnyKeyValueProperty > ( ) else -> error ( \"\" ) } } val valueColumns = dataFrames . map { it [ KeyValueProperty < * > :: value . name ] } val valueColumnSchema = when { valueColumns . all { it is ColumnGroup < * > } || valueColumns . all { it is FrameColumn < * > } -> valueColumns . concat ( ) . extractSchema ( ) else -> ColumnSchema . Value ( valueTypes . commonType ( ) ) } listOf ( UnnamedColumn ( DataColumn . createFrameColumn ( name = valueColumnName , groups = dataFrames , schema = lazy { DataFrameSchemaImpl ( columns = mapOf ( KeyValueProperty < * > :: key . name to ColumnSchema . Value ( typeOf < String > ( ) ) , KeyValueProperty < * > :: value . name to valueColumnSchema , ) ) } , ) ) ) } colType == AnyColType . OBJECTS && ! isKeyValue -> { nameGenerator . names . map { colName -> val values = ArrayList < Any ? > ( records . size ) records . forEach { when ( it ) { is JsonObject -> values . add ( it [ colName ] ) null -> values . add ( null ) else -> error ( \"\" ) } } val parsed = fromJsonListAnyColumns ( records = values , keyValuePaths = keyValuePaths , jsonPath = jsonPath . append ( colName ) , ) when { parsed . ncol == -> DataColumn . createValueColumn ( name = colName , values = arrayOfNulls < Any ? > ( values . size ) . toList ( ) , type = typeOf < Any ? > ( ) , ) parsed . isSingleUnnamedColumn ( ) -> ( parsed . getColumn ( ) as UnnamedColumn ) . col . rename ( colName ) else -> DataColumn . createColumnGroup ( colName , parsed . unwrapUnnamedColumns ( ) ) as AnyCol } } } else -> error ( \"\" ) } return when { columns . isEmpty ( ) -> DataFrame . empty ( records . size ) columns . size == && hasArray && header . isNotEmpty ( ) && columns [ ] . typeClass == List :: class -> columns [ ] . cast < List < * > > ( ) . splitInto ( * header . toTypedArray ( ) ) else -> columns . toDataFrame ( ) } }","docstring":"/**\n * Json to DataFrame converter that creates [Any] columns.\n * A.k.a. [TypeClashTactic.ANY_COLUMNS].\n *\n * @param records List of json elements to be converted to a [DataFrame].\n * @param keyValuePaths List of [JsonPath]s where instead of a [ColumnGroup], a [FrameColumn]<[KeyValueProperty]>\n * will be created.\n * @param header Optional list of column names. If given, [records] will be read like an object with [header] being the keys.\n * @return [DataFrame] from the given [records].\n */"} {"signature":"internal fun fromJsonListArrayAndValueColumns ( records : List < * > , keyValuePaths : List < JsonPath > = emptyList ( ) , header : List < String > = emptyList ( ) , jsonPath : JsonPath = JsonPath ( ) , ) : AnyFrame","body":"{ var hasPrimitive = false var hasArray = false val isKeyValue = keyValuePaths . any { jsonPath . matches ( it ) } val nameGenerator = ColumnNameGenerator ( ) records . forEach { when ( it ) { is JsonObject -> it . entries . forEach { nameGenerator . addIfAbsent ( it . key ) } is JsonArray < * > -> hasArray = true null -> Unit else -> hasPrimitive = true } } if ( records . all { it == null } ) hasPrimitive = true val valueColumn = if ( hasPrimitive || records . isEmpty ( ) ) { nameGenerator . addUnique ( valueColumnName ) } else null val arrayColumn = if ( hasArray ) { nameGenerator . addUnique ( arrayColumnName ) } else null if ( isKeyValue && ( hasPrimitive || hasArray ) ) { error ( \"\" ) } val columns : List < AnyCol > = when { isKeyValue -> { val dataFrames = records . map { when ( it ) { is JsonObject -> { val map = it . map . mapValues { ( key , value ) -> val parsed = fromJsonListArrayAndValueColumns ( records = listOf ( value ) , keyValuePaths = keyValuePaths , jsonPath = jsonPath . append ( key ) , ) if ( parsed . isSingleUnnamedColumn ( ) ) ( parsed . getColumn ( ) as UnnamedColumn ) . col . values . first ( ) else parsed . unwrapUnnamedColumns ( ) . firstOrNull ( ) } val valueType = map . values . map { guessValueType ( sequenceOf ( it ) ) } . commonType ( ) dataFrameOf ( columnOf ( * map . keys . toTypedArray ( ) ) . named ( KeyValueProperty < * > :: key . name ) , createColumn ( values = map . values , suggestedType = valueType , guessType = false , ) . named ( KeyValueProperty < * > :: value . name ) , ) } null -> DataFrame . emptyOf < AnyKeyValueProperty > ( ) else -> error ( \"\" ) } } listOf ( UnnamedColumn ( DataColumn . createFrameColumn ( name = valueColumnName , groups = dataFrames , schema = lazy { dataFrames . mapNotNull { it . takeIf { it . nrow > } ? . schema ( ) } . intersectSchemas ( ) } , ) ) ) } else -> nameGenerator . names . map { colName -> when { colName == valueColumn && ( hasPrimitive || records . isEmpty ( ) ) -> { val collector = createDataCollector ( records . size ) val nanIndices = mutableListOf < Int > ( ) records . forEachIndexed { i , v -> when ( v ) { is JsonObject -> collector . add ( null ) is JsonArray < * > -> collector . add ( null ) \"\" -> { nanIndices . add ( i ) collector . add ( null ) } else -> collector . add ( v ) } } val column = collector . toColumn ( colName ) val res = if ( nanIndices . isNotEmpty ( ) ) { fun < C > DataColumn < C > . updateNaNs ( nanValue : C ) : DataColumn < C > { var j = var nextNanIndex = nanIndices [ j ] return mapIndexed ( column . type ) { i , v -> if ( i == nextNanIndex ) { j ++ nextNanIndex = if ( j < nanIndices . size ) nanIndices [ j ] else - nanValue } else v } } when ( column . typeClass ) { Double :: class -> column . cast < Double ? > ( ) . updateNaNs ( Double . NaN ) Float :: class -> column . cast < Float ? > ( ) . updateNaNs ( Float . NaN ) String :: class -> column . cast < String ? > ( ) . updateNaNs ( \"\" ) else -> column } } else column UnnamedColumn ( res ) } colName == arrayColumn && hasArray -> { val values = mutableListOf < Any ? > ( ) val startIndices = ArrayList < Int > ( ) records . forEach { startIndices . add ( values . size ) if ( it is JsonArray < * > ) values . addAll ( it . value ) } val parsed = fromJsonListArrayAndValueColumns ( records = values , keyValuePaths = keyValuePaths , jsonPath = jsonPath . appendArrayWithWildcard ( ) , ) val res = when { parsed . isSingleUnnamedColumn ( ) -> { val col = ( parsed . getColumn ( ) as UnnamedColumn ) . col val elementType = col . type val values = col . values . asList ( ) . splitByIndices ( startIndices . asSequence ( ) ) . toList ( ) DataColumn . createValueColumn ( name = colName , values = values , type = List :: class . createType ( listOf ( KTypeProjection . invariant ( elementType ) ) ) , ) } else -> DataColumn . createFrameColumn ( colName , parsed . unwrapUnnamedColumns ( ) , startIndices ) } UnnamedColumn ( res ) } else -> { val values = ArrayList < Any ? > ( records . size ) records . forEach { when ( it ) { is JsonObject -> values . add ( it [ colName ] ) else -> values . add ( null ) } } val parsed = fromJsonListArrayAndValueColumns ( records = values , keyValuePaths = keyValuePaths , jsonPath = jsonPath . append ( colName ) , ) when { parsed . ncol == -> DataColumn . createValueColumn ( name = colName , values = arrayOfNulls < Any ? > ( values . size ) . toList ( ) , type = typeOf < Any ? > ( ) , ) parsed . isSingleUnnamedColumn ( ) -> ( parsed . getColumn ( ) as UnnamedColumn ) . col . rename ( colName ) else -> DataColumn . createColumnGroup ( colName , parsed . unwrapUnnamedColumns ( ) ) as AnyCol } } } } } return when { columns . isEmpty ( ) -> DataFrame . empty ( records . size ) columns . size == && hasArray && header . isNotEmpty ( ) && columns [ ] . typeClass == List :: class -> columns [ ] . cast < List < * > > ( ) . splitInto ( * header . toTypedArray ( ) ) else -> columns . toDataFrame ( ) } }","docstring":"/**\n * Json to DataFrame converter that creates allows creates `value` and `array` accessors\n * instead of [Any] columns.\n * A.k.a. [TypeClashTactic.ARRAY_AND_VALUE_COLUMNS].\n *\n * @param records List of json elements to be converted to a [DataFrame].\n * @param keyValuePaths List of [JsonPath]s where instead of a [ColumnGroup], a [FrameColumn]<[KeyValueProperty]>\n * will be created.\n * @param header Optional list of column names. If given, [records] will be read like an object with [header] being the keys.\n * @return [DataFrame] from the given [records].\n */"} {"signature":"internal fun IrFunction . isCEnumVarValueAccessor ( symbols : KonanSymbols ) : Boolean","body":"{ val parent = parent as? IrClass ? : return false return if ( symbols . interopCEnumVar in parent . superClasses && isPropertyAccessor ) { ( propertyIfAccessor as IrProperty ) . name . asString ( ) == \"\" } else { false } }","docstring":"/**\n * Check given function is a getter or setter\n * for `value` property of CEnumVar subclass.\n */"} {"signature":"private fun registerDokkatooSourceSets ( dokkatooExtension : DokkatooExtension , sourceSetDetails : NamedDomainObjectContainer < KotlinSourceSetDetails > , )","body":"{ sourceSetDetails . all details @ { dokkatooExtension . dokkatooSourceSets . register ( details = this @ details ) } }","docstring":"/** Register a [DokkaSourceSetSpec] for each element in [sourceSetDetails] */"} {"signature":"private fun NamedDomainObjectContainer < DokkaSourceSetSpec > . register ( details : KotlinSourceSetDetails )","body":"{ val kssPlatform = details . compilations . map { values : List < KotlinCompilationDetails > -> values . map { it . kotlinPlatform } . distinct ( ) . singleOrNull ( ) ? : KotlinPlatform . Common } val kssClasspath = determineClasspath ( details ) register ( details . name ) dss @ { suppress . set ( ! details . isPublishedSourceSet ( ) ) sourceRoots . from ( details . sourceDirectories ) classpath . from ( kssClasspath ) analysisPlatform . set ( kssPlatform ) dependentSourceSets . addAllLater ( details . dependentSourceSetIds ) } }","docstring":"/** Register a single [DokkaSourceSetSpec] for [details] */"} {"signature":"private fun ExtensionContainer . findKotlinExtension ( ) : KotlinProjectExtension ?","body":"= try { findByType ( ) ? : findByType < org . jetbrains . kotlin . gradle . dsl . KotlinJvmProjectExtension > ( ) } catch ( e : Throwable ) { when ( e ) { is TypeNotPresentException , is ClassNotFoundException , is NoClassDefFoundError -> null else -> throw e } }","docstring":"/** Try and get [KotlinProjectExtension], or `null` if it's not present */"} {"signature":"private fun createCompilationDetails ( compilation : KotlinCompilation < * > , ) : KotlinCompilationDetails","body":"{ val allKotlinSourceSetsNames = compilation . allKotlinSourceSets . map { it . name } + compilation . defaultSourceSet . name val dependentSourceSetNames = compilation . defaultSourceSet . dependsOn . map { it . name } val compilationClasspath : FileCollection = collectKotlinCompilationClasspath ( compilation = compilation ) return KotlinCompilationDetails ( target = compilation . target . name , kotlinPlatform = KotlinPlatform . fromString ( compilation . platformType . name ) , allKotlinSourceSetsNames = allKotlinSourceSetsNames . toSet ( ) , publishedCompilation = compilation . isPublished ( ) , dependentSourceSetNames = dependentSourceSetNames . toSet ( ) , compilationClasspath = compilationClasspath , defaultSourceSetName = compilation . defaultSourceSet . name ) }","docstring":"/** Create a single [KotlinCompilationDetails] for [compilation] */"} {"signature":"private fun collectKotlinCompilationClasspath ( compilation : KotlinCompilation < * > , ) : FileCollection","body":"{ val compilationClasspath = objects . fileCollection ( ) compilationClasspath . from ( providers . provider { compilation . compileDependencyFiles } ) if ( currentKotlinToolingVersion < KotlinToolingVersion ( \"\" ) && compilation is AbstractKotlinNativeCompilation ) { compilationClasspath . from ( konanHome . map { konanHome -> kotlinNativeDependencies ( konanHome , compilation . konanTarget ) } ) } return compilationClasspath }","docstring":"/**\n * Get the [Configuration][org.gradle.api.artifacts.Configuration] names of all configurations\n * used to build this [KotlinCompilation] and\n * [its source sets][KotlinCompilation.kotlinSourceSets].\n */"} {"signature":"private fun KotlinCompilation < * > . isPublished ( ) : Boolean","body":"{ return when ( this ) { is KotlinMetadataCompilation < * > -> true is KotlinJvmAndroidCompilation -> androidVariant is LibraryVariant || androidVariant is ApplicationVariant else -> name == MAIN_COMPILATION_NAME } }","docstring":"/**\n * Determine if a [KotlinCompilation] is 'publishable', and so should be enabled by default\n * when creating a Dokka publication.\n *\n * Typically, 'main' compilations are publishable and 'test' compilations should be suppressed.\n * This can be overridden manually, though.\n *\n * @see DokkaSourceSetSpec.suppress\n */"} {"signature":"fun isPublishedSourceSet ( ) : Provider < Boolean >","body":"= compilations . map { values -> values . any { it . publishedCompilation } }","docstring":"/** Estimate if this Kotlin source set contains 'published' sources */"} {"signature":"private tailrec fun KotlinSourceSet . allDependentSourceSets ( queue : Set < KotlinSourceSet > = dependsOn . toSet ( ) , allDependents : List < KotlinSourceSet > = emptyList ( ) , ) : List < KotlinSourceSet >","body":"{ val next = queue . firstOrNull ( ) ? : return allDependents return next . allDependentSourceSets ( queue = ( queue - next ) union next . dependsOn , allDependents = allDependents + next , ) }","docstring":"/**\n * Return a list containing _all_ source sets that this source set depends on,\n * searching recursively.\n *\n * @see KotlinSourceSet.dependsOn\n */"} {"signature":"@ Test fun testSharedFlowToCollection ( )","body":"= runTest { val sharedFlow = MutableSharedFlow < Int > ( ) val list = mutableListOf < Int > ( ) val set = mutableSetOf < Int > ( ) val jobs = listOf ( suspend { sharedFlow . toList ( list ) } , { sharedFlow . toSet ( set ) } ) . map { launch ( Dispatchers . Unconfined ) { it ( ) } } repeat ( ) { sharedFlow . emit ( it ) } jobs . forEach { it . cancelAndJoin ( ) } assertEquals ( ( .. ) . toList ( ) , list ) assertEquals ( ( .. ) . toSet ( ) , set ) }","docstring":"/**\n * Tests that using [SharedFlow.toList] and similar functions by passing a mutable collection does add values\n * to the provided collection.\n */"} {"signature":"@ Suppress ( \"\" ) @ SinceKotlin ( \"\" ) @ kotlin . internal . InlineOnly public actual inline fun StringBuilder . append ( value : Byte ) : StringBuilder","body":"= this . append ( value . toInt ( ) )","docstring":"/**\n * Appends the string representation of the specified byte [value] to this string builder and returns this instance.\n *\n * The overall effect is exactly as if the [value] were converted to a string by the `value.toString()` method,\n * and then that string was appended to this string builder.\n */"} {"signature":"@ Suppress ( \"\" ) @ SinceKotlin ( \"\" ) @ kotlin . internal . InlineOnly public actual inline fun StringBuilder . append ( value : Short ) : StringBuilder","body":"= this . append ( value . toInt ( ) )","docstring":"/**\n * Appends the string representation of the specified short [value] to this string builder and returns this instance.\n *\n * The overall effect is exactly as if the [value] were converted to a string by the `value.toString()` method,\n * and then that string was appended to this string builder.\n */"} {"signature":"@ Suppress ( \"\" ) @ SinceKotlin ( \"\" ) @ kotlin . internal . InlineOnly public actual inline fun StringBuilder . insert ( index : Int , value : Byte ) : StringBuilder","body":"= this . insert ( index , value . toInt ( ) )","docstring":"/**\n * Inserts the string representation of the specified byte [value] into this string builder at the specified [index] and returns this instance.\n *\n * The overall effect is exactly as if the [value] were converted to a string by the `value.toString()` method,\n * and then that string was inserted into this string builder at the specified [index].\n *\n * @throws IndexOutOfBoundsException if [index] is less than zero or greater than the length of this string builder.\n */"} {"signature":"@ Suppress ( \"\" ) @ SinceKotlin ( \"\" ) @ kotlin . internal . InlineOnly public actual inline fun StringBuilder . insert ( index : Int , value : Short ) : StringBuilder","body":"= this . insert ( index , value . toInt ( ) )","docstring":"/**\n * Inserts the string representation of the specified short [value] into this string builder at the specified [index] and returns this instance.\n *\n * The overall effect is exactly as if the [value] were converted to a string by the `value.toString()` method,\n * and then that string was inserted into this string builder at the specified [index].\n *\n * @throws IndexOutOfBoundsException if [index] is less than zero or greater than the length of this string builder.\n */"} {"signature":"@ SinceKotlin ( \"\" ) public actual fun StringBuilder . clear ( ) : StringBuilder","body":"= apply { setLength ( ) }","docstring":"/**\n * Clears the content of this string builder making it empty and returns this instance.\n *\n * @sample samples.text.Strings.clearStringBuilder\n */"} {"signature":"@ kotlin . internal . InlineOnly public actual inline operator fun StringBuilder . set ( index : Int , value : Char ) : Unit","body":"= this . setCharAt ( index , value )","docstring":"/**\n * Sets the character at the specified [index] to the specified [value].\n *\n * @throws IndexOutOfBoundsException if [index] is out of bounds of this string builder.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . internal . InlineOnly public actual inline fun StringBuilder . setRange ( startIndex : Int , endIndex : Int , value : String ) : StringBuilder","body":"= this . replace ( startIndex , endIndex , value )","docstring":"/**\n * Replaces characters in the specified range of this string builder with characters in the specified string [value] and returns this instance.\n *\n * @param startIndex the beginning (inclusive) of the range to replace.\n * @param endIndex the end (exclusive) of the range to replace.\n * @param value the string to replace with.\n *\n * @throws IndexOutOfBoundsException or [IllegalArgumentException] if [startIndex] is less than zero, greater than the length of this string builder, or `startIndex > endIndex`.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . internal . InlineOnly public actual inline fun StringBuilder . deleteAt ( index : Int ) : StringBuilder","body":"= this . deleteCharAt ( index )","docstring":"/**\n * Removes the character at the specified [index] from this string builder and returns this instance.\n *\n * If the `Char` at the specified [index] is part of a supplementary code point, this method does not remove the entire supplementary character.\n *\n * @param index the index of `Char` to remove.\n *\n * @throws IndexOutOfBoundsException if [index] is out of bounds of this string builder.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . internal . InlineOnly public actual inline fun StringBuilder . deleteRange ( startIndex : Int , endIndex : Int ) : StringBuilder","body":"= this . delete ( startIndex , endIndex )","docstring":"/**\n * Removes characters in the specified range from this string builder and returns this instance.\n *\n * @param startIndex the beginning (inclusive) of the range to remove.\n * @param endIndex the end (exclusive) of the range to remove.\n *\n * @throws IndexOutOfBoundsException or [IllegalArgumentException] when [startIndex] is out of range of this string builder indices or when `startIndex > endIndex`.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . internal . InlineOnly @ Suppress ( \"\" ) public actual inline fun StringBuilder . toCharArray ( destination : CharArray , destinationOffset : Int = , startIndex : Int = , endIndex : Int = this . length ) : Unit","body":"= this . getChars ( startIndex , endIndex , destination , destinationOffset )","docstring":"/**\n * Copies characters from this string builder into the [destination] character array.\n *\n * @param destination the array to copy to.\n * @param destinationOffset the position in the array to copy to, 0 by default.\n * @param startIndex the beginning (inclusive) of the range to copy, 0 by default.\n * @param endIndex the end (exclusive) of the range to copy, length of this string builder by default.\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 ( \"\" ) @ kotlin . internal . InlineOnly public actual inline fun StringBuilder . appendRange ( value : CharArray , startIndex : Int , endIndex : Int ) : StringBuilder","body":"= this . append ( value , startIndex , endIndex - startIndex )","docstring":"/**\n * Appends characters in a subarray of the specified character array [value] to this string builder and returns this instance.\n *\n * Characters are appended in order, starting at specified [startIndex].\n *\n * @param value the array from which characters are appended.\n * @param startIndex the beginning (inclusive) of the subarray to append.\n * @param endIndex the end (exclusive) of the subarray to append.\n *\n * @throws IndexOutOfBoundsException or [IllegalArgumentException] when [startIndex] or [endIndex] is out of range of the [value] array indices or when `startIndex > endIndex`.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . internal . InlineOnly public actual inline fun StringBuilder . appendRange ( value : CharSequence , startIndex : Int , endIndex : Int ) : StringBuilder","body":"= this . append ( value , startIndex , endIndex )","docstring":"/**\n * Appends a subsequence of the specified character sequence [value] to this string builder and returns this instance.\n *\n * @param value the character sequence from which a subsequence is appended.\n * @param startIndex the beginning (inclusive) of the subsequence to append.\n * @param endIndex the end (exclusive) of the subsequence to append.\n *\n * @throws IndexOutOfBoundsException or [IllegalArgumentException] when [startIndex] or [endIndex] is out of range of the [value] character sequence indices or when `startIndex > endIndex`.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . internal . InlineOnly public actual inline fun StringBuilder . insertRange ( index : Int , value : CharArray , startIndex : Int , endIndex : Int ) : StringBuilder","body":"= this . insert ( index , value , startIndex , endIndex - startIndex )","docstring":"/**\n * Inserts characters in a subarray of the specified character array [value] into this string builder at the specified [index] and returns this instance.\n *\n * The inserted characters go in same order as in the [value] array, starting at [index].\n *\n * @param index the position in this string builder to insert at.\n * @param value the array from which characters are inserted.\n * @param startIndex the beginning (inclusive) of the subarray to insert.\n * @param endIndex the end (exclusive) of the subarray to insert.\n *\n * @throws IndexOutOfBoundsException or [IllegalArgumentException] when [startIndex] or [endIndex] is out of range of the [value] array indices or when `startIndex > endIndex`.\n * @throws IndexOutOfBoundsException if [index] is less than zero or greater than the length of this string builder.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . internal . InlineOnly public actual inline fun StringBuilder . insertRange ( index : Int , value : CharSequence , startIndex : Int , endIndex : Int ) : StringBuilder","body":"= this . insert ( index , value , startIndex , endIndex )","docstring":"/**\n * Inserts characters in a subsequence of the specified character sequence [value] into this string builder at the specified [index] and returns this instance.\n *\n * The inserted characters go in the same order as in the [value] character sequence, starting at [index].\n *\n * @param index the position in this string builder to insert at.\n * @param value the character sequence from which a subsequence is inserted.\n * @param startIndex the beginning (inclusive) of the subsequence to insert.\n * @param endIndex the end (exclusive) of the subsequence to insert.\n *\n * @throws IndexOutOfBoundsException or [IllegalArgumentException] when [startIndex] or [endIndex] is out of range of the [value] character sequence indices or when `startIndex > endIndex`.\n * @throws IndexOutOfBoundsException if [index] is less than zero or greater than the length of this string builder.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . internal . InlineOnly public inline fun StringBuilder . appendLine ( value : StringBuffer ? ) : StringBuilder","body":"= append ( value ) . appendLine ( )","docstring":"/** Appends [value] to this [StringBuilder], followed by a line feed character (`\\n`). */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . internal . InlineOnly public inline fun StringBuilder . appendLine ( value : StringBuilder ? ) : 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 : Short ) : StringBuilder","body":"= append ( value . toInt ( ) ) . 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 : Byte ) : StringBuilder","body":"= append ( value . toInt ( ) ) . 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":"@ Deprecated ( \"\" , ReplaceWith ( \"\" ) , level = DeprecationLevel . WARNING ) public fun Appendable . appendln ( ) : Appendable","body":"= append ( SystemProperties . LINE_SEPARATOR )","docstring":"/** Appends a line separator to this Appendable. */"} {"signature":"@ Suppress ( \"\" ) @ Deprecated ( \"\" , ReplaceWith ( \"\" ) , level = DeprecationLevel . WARNING ) @ kotlin . internal . InlineOnly public inline fun Appendable . appendln ( value : CharSequence ? ) : Appendable","body":"= append ( value ) . appendln ( )","docstring":"/** Appends value to the given Appendable and line separator after it. */"} {"signature":"@ Suppress ( \"\" ) @ Deprecated ( \"\" , ReplaceWith ( \"\" ) , level = DeprecationLevel . WARNING ) @ kotlin . internal . InlineOnly public inline fun Appendable . appendln ( value : Char ) : Appendable","body":"= append ( value ) . appendln ( )","docstring":"/** Appends value to the given Appendable and line separator after it. */"} {"signature":"@ Deprecated ( \"\" , ReplaceWith ( \"\" ) , level = DeprecationLevel . WARNING ) public fun StringBuilder . appendln ( ) : StringBuilder","body":"= append ( SystemProperties . LINE_SEPARATOR )","docstring":"/** Appends a line separator to this StringBuilder. */"} {"signature":"@ Suppress ( \"\" ) @ Deprecated ( \"\" , ReplaceWith ( \"\" ) , level = DeprecationLevel . WARNING ) @ kotlin . internal . InlineOnly public inline fun StringBuilder . appendln ( value : StringBuffer ? ) : StringBuilder","body":"= append ( value ) . appendln ( )","docstring":"/** Appends [value] to this [StringBuilder], followed by a line separator. */"} {"signature":"@ Suppress ( \"\" ) @ Deprecated ( \"\" , ReplaceWith ( \"\" ) , level = DeprecationLevel . WARNING ) @ kotlin . internal . InlineOnly public inline fun StringBuilder . appendln ( value : CharSequence ? ) : StringBuilder","body":"= append ( value ) . appendln ( )","docstring":"/** Appends [value] to this [StringBuilder], followed by a line separator. */"} {"signature":"@ Suppress ( \"\" ) @ Deprecated ( \"\" , ReplaceWith ( \"\" ) , level = DeprecationLevel . WARNING ) @ kotlin . internal . InlineOnly public inline fun StringBuilder . appendln ( value : String ? ) : StringBuilder","body":"= append ( value ) . appendln ( )","docstring":"/** Appends [value] to this [StringBuilder], followed by a line separator. */"} {"signature":"@ Suppress ( \"\" ) @ Deprecated ( \"\" , ReplaceWith ( \"\" ) , level = DeprecationLevel . WARNING ) @ kotlin . internal . InlineOnly public inline fun StringBuilder . appendln ( value : Any ? ) : StringBuilder","body":"= append ( value ) . appendln ( )","docstring":"/** Appends [value] to this [StringBuilder], followed by a line separator. */"} {"signature":"@ Suppress ( \"\" ) @ Deprecated ( \"\" , ReplaceWith ( \"\" ) , level = DeprecationLevel . WARNING ) @ kotlin . internal . InlineOnly public inline fun StringBuilder . appendln ( value : StringBuilder ? ) : StringBuilder","body":"= append ( value ) . appendln ( )","docstring":"/** Appends [value] to this [StringBuilder], followed by a line separator. */"} {"signature":"@ Suppress ( \"\" ) @ Deprecated ( \"\" , ReplaceWith ( \"\" ) , level = DeprecationLevel . WARNING ) @ kotlin . internal . InlineOnly public inline fun StringBuilder . appendln ( value : CharArray ) : StringBuilder","body":"= append ( value ) . appendln ( )","docstring":"/** Appends [value] to this [StringBuilder], followed by a line separator. */"} {"signature":"@ Suppress ( \"\" ) @ Deprecated ( \"\" , ReplaceWith ( \"\" ) , level = DeprecationLevel . WARNING ) @ kotlin . internal . InlineOnly public inline fun StringBuilder . appendln ( value : Char ) : StringBuilder","body":"= append ( value ) . appendln ( )","docstring":"/** Appends [value] to this [StringBuilder], followed by a line separator. */"} {"signature":"@ Suppress ( \"\" ) @ Deprecated ( \"\" , ReplaceWith ( \"\" ) , level = DeprecationLevel . WARNING ) @ kotlin . internal . InlineOnly public inline fun StringBuilder . appendln ( value : Boolean ) : StringBuilder","body":"= append ( value ) . appendln ( )","docstring":"/** Appends [value] to this [StringBuilder], followed by a line separator. */"} {"signature":"@ Suppress ( \"\" ) @ Deprecated ( \"\" , ReplaceWith ( \"\" ) , level = DeprecationLevel . WARNING ) @ kotlin . internal . InlineOnly public inline fun StringBuilder . appendln ( value : Int ) : StringBuilder","body":"= append ( value ) . appendln ( )","docstring":"/** Appends [value] to this [StringBuilder], followed by a line separator. */"} {"signature":"@ Suppress ( \"\" ) @ Deprecated ( \"\" , ReplaceWith ( \"\" ) , level = DeprecationLevel . WARNING ) @ kotlin . internal . InlineOnly public inline fun StringBuilder . appendln ( value : Short ) : StringBuilder","body":"= append ( value . toInt ( ) ) . appendln ( )","docstring":"/** Appends [value] to this [StringBuilder], followed by a line separator. */"} {"signature":"@ Suppress ( \"\" ) @ Deprecated ( \"\" , ReplaceWith ( \"\" ) , level = DeprecationLevel . WARNING ) @ kotlin . internal . InlineOnly public inline fun StringBuilder . appendln ( value : Byte ) : StringBuilder","body":"= append ( value . toInt ( ) ) . appendln ( )","docstring":"/** Appends [value] to this [StringBuilder], followed by a line separator. */"} {"signature":"@ Suppress ( \"\" ) @ Deprecated ( \"\" , ReplaceWith ( \"\" ) , level = DeprecationLevel . WARNING ) @ kotlin . internal . InlineOnly public inline fun StringBuilder . appendln ( value : Long ) : StringBuilder","body":"= append ( value ) . appendln ( )","docstring":"/** Appends [value] to this [StringBuilder], followed by a line separator. */"} {"signature":"@ Suppress ( \"\" ) @ Deprecated ( \"\" , ReplaceWith ( \"\" ) , level = DeprecationLevel . WARNING ) @ kotlin . internal . InlineOnly public inline fun StringBuilder . appendln ( value : Float ) : StringBuilder","body":"= append ( value ) . appendln ( )","docstring":"/** Appends [value] to this [StringBuilder], followed by a line separator. */"} {"signature":"@ Suppress ( \"\" ) @ Deprecated ( \"\" , ReplaceWith ( \"\" ) , level = DeprecationLevel . WARNING ) @ kotlin . internal . InlineOnly public inline fun StringBuilder . appendln ( value : Double ) : StringBuilder","body":"= append ( value ) . appendln ( )","docstring":"/** Appends [value] to this [StringBuilder], followed by a line separator. */"} {"signature":"private fun removeNonAccessorsReturning ( fieldAccessors : MutableMap < PsiField , MutableList < PsiMethod > > ) : List < PsiMethod >","body":"{ val nonAccessors = mutableListOf < PsiMethod > ( ) fieldAccessors . entries . removeIf { ( field , methods ) -> if ( methods . size == && methods [ ] . isSetterFor ( field ) ) { nonAccessors . add ( methods [ ] ) true } else { false } } return nonAccessors }","docstring":"/**\n * If a field has no getter, it's not accessible as a property from Kotlin's perspective,\n * but it still might have a setter. In this case, this \"setter\" should be just a regular function\n */"} {"signature":"public fun Plot . toHTML ( iFrame : Boolean = true ) : String","body":"= PlotHtmlExport . buildHtmlFromRawSpecs ( toLetsPlot ( ) . toSpec ( ) , letsPlotJSUrl , iFrame )","docstring":"/**\n * Exports the plot to HTML format.\n *\n * @receiver [Plot] - the plot to export.\n * @param iFrame Whether to wrap HTML in IFrame\n * \n * @return A [String] in HTML format representing the exported plot.\n */"} {"signature":"public fun PlotGrid . toHTML ( iFrame : Boolean = true ) : String","body":"= PlotHtmlExport . buildHtmlFromRawSpecs ( wrap ( ) . toSpec ( ) , letsPlotJSUrl , iFrame )","docstring":"/**\n * Exports the plot grid to HTML format.\n *\n * @receiver [PlotGrid] - the plot grid to export.\n * @param iFrame Whether to wrap HTML in IFrame\n *\n * @return A [String] in HTML format representing the exported plot.\n */"} {"signature":"public fun PlotBunch . toHTML ( iFrame : Boolean = true ) : String","body":"= PlotHtmlExport . buildHtmlFromRawSpecs ( wrap ( ) . toSpec ( ) , letsPlotJSUrl , iFrame )","docstring":"/**\n * Exports the plot bunch to HTML format.\n *\n * @receiver [PlotBunch] - the plot bunch to export.\n * @param iFrame Whether to wrap HTML in IFrame\n *\n * @return A [String] in HTML format representing the exported plot.\n */"} {"signature":"public fun < T , C > DataFrame < T > . fillNulls ( columns : ColumnsSelector < T , C ? > ) : Update < T , C ? >","body":"= update ( columns ) . where { it == null }","docstring":"/**\n * @include [CommonFillNullsFunctionDoc]\n * @include [SelectingColumns.Dsl.WithExample] {@include [SetFillNullsOperationArg]}\n * @include [Update.DslParam]\n */"} {"signature":"public fun < T > DataFrame < T > . fillNulls ( vararg columns : String ) : Update < T , Any ? >","body":"= fillNulls { columns . toColumnSet ( ) }","docstring":"/**\n * @include [CommonFillNullsFunctionDoc]\n * @include [SelectingColumns.ColumnNames.WithExample] {@include [SetFillNullsOperationArg]}\n * @include [Update.ColumnNamesParam]\n */"} {"signature":"public fun < T , C > DataFrame < T > . fillNulls ( vararg columns : KProperty < C > ) : Update < T , C ? >","body":"= fillNulls { columns . toColumnSet ( ) }","docstring":"/**\n * @include [CommonFillNullsFunctionDoc]\n * @include [SelectingColumns.KProperties.WithExample] {@include [SetFillNullsOperationArg]}\n * @include [Update.KPropertiesParam]\n */"} {"signature":"public fun < T , C > DataFrame < T > . fillNulls ( vararg columns : ColumnReference < C > ) : Update < T , C ? >","body":"= fillNulls { columns . toColumnSet ( ) }","docstring":"/**\n * @include [CommonFillNullsFunctionDoc]\n * @include [SelectingColumns.ColumnAccessors.WithExample] {@include [SetFillNullsOperationArg]}\n * @include [Update.ColumnAccessorsParam]\n */"} {"signature":"public fun < T , C > DataFrame < T > . fillNaNs ( columns : ColumnsSelector < T , C > ) : Update < T , C >","body":"= update ( columns ) . where { it . isNaN }","docstring":"/**\n * @include [CommonFillNaNsFunctionDoc]\n * @include [SelectingColumns.Dsl.WithExample] {@include [SetFillNaNsOperationArg]}\n * @include [Update.DslParam]\n */"} {"signature":"public fun < T > DataFrame < T > . fillNaNs ( vararg columns : String ) : Update < T , Any ? >","body":"= fillNaNs { columns . toColumnSet ( ) }","docstring":"/**\n * @include [CommonFillNaNsFunctionDoc]\n * @include [SelectingColumns.ColumnNames.WithExample] {@include [SetFillNaNsOperationArg]}\n * @include [Update.ColumnNamesParam]\n */"} {"signature":"public fun < T , C > DataFrame < T > . fillNaNs ( vararg columns : KProperty < C > ) : Update < T , C >","body":"= fillNaNs { columns . toColumnSet ( ) }","docstring":"/**\n * @include [CommonFillNaNsFunctionDoc]\n * @include [SelectingColumns.KProperties.WithExample] {@include [SetFillNaNsOperationArg]}\n * @include [Update.KPropertiesParam]\n */"} {"signature":"public fun < T , C > DataFrame < T > . fillNaNs ( vararg columns : ColumnReference < C > ) : Update < T , C >","body":"= fillNaNs { columns . toColumnSet ( ) }","docstring":"/**\n * @include [CommonFillNaNsFunctionDoc]\n * @include [SelectingColumns.ColumnAccessors.WithExample] {@include [SetFillNaNsOperationArg]}\n * @include [Update.ColumnAccessorsParam]\n */"} {"signature":"public fun < T , C > DataFrame < T > . fillNA ( columns : ColumnsSelector < T , C ? > ) : Update < T , C ? >","body":"= update ( columns ) . where { it . isNA }","docstring":"/**\n * @include [CommonFillNAFunctionDoc]\n * @include [SelectingColumns.Dsl.WithExample] {@include [SetFillNAOperationArg]}\n * @include [Update.DslParam]\n */"} {"signature":"public fun < T > DataFrame < T > . fillNA ( vararg columns : String ) : Update < T , Any ? >","body":"= fillNA { columns . toColumnSet ( ) }","docstring":"/**\n * @include [CommonFillNAFunctionDoc]\n * @include [SelectingColumns.ColumnNames.WithExample] {@include [SetFillNAOperationArg]}\n * @include [Update.ColumnNamesParam]\n */"} {"signature":"public fun < T , C > DataFrame < T > . fillNA ( vararg columns : KProperty < C > ) : Update < T , C ? >","body":"= fillNA { columns . toColumnSet ( ) }","docstring":"/**\n * @include [CommonFillNAFunctionDoc]\n * @include [SelectingColumns.KProperties.WithExample] {@include [SetFillNAOperationArg]}\n * @include [Update.KPropertiesParam]\n */"} {"signature":"public fun < T , C > DataFrame < T > . fillNA ( vararg columns : ColumnReference < C > ) : Update < T , C ? >","body":"= fillNA { columns . toColumnSet ( ) }","docstring":"/**\n * @include [CommonFillNAFunctionDoc]\n * @include [SelectingColumns.ColumnAccessors.WithExample] {@include [SetFillNAOperationArg]}\n * @include [Update.ColumnAccessorsParam]\n */"} {"signature":"public fun < T > DataFrame < T > . dropNulls ( whereAllNull : Boolean = false , columns : ColumnsSelector < T , * > ) : DataFrame < T >","body":"{ val cols = this [ columns ] return if ( whereAllNull ) drop { row -> cols . all { col -> col [ row ] == null } } else drop { row -> cols . any { col -> col [ row ] == null } } }","docstring":"/**\n * @include [CommonDropNullsFunctionDoc]\n * @include [SelectingColumns.Dsl.WithExample] {@include [SetDropNullsOperationArg]}\n * `df.`[dropNulls][dropNulls]`(whereAllNull = true) { `[colsOf][colsOf]`<`[Double][Double]`>() }`\n * @include [DropNulls.WhereAllNullParam]\n * @include [DropDslParam]\n */"} {"signature":"public fun < T > DataFrame < T > . dropNulls ( whereAllNull : Boolean = false ) : DataFrame < T >","body":"= dropNulls ( whereAllNull ) { all ( ) }","docstring":"/**\n * @include [CommonDropNullsFunctionDoc]\n * This overload operates on all columns in the [DataFrame].\n * @include [DropNulls.WhereAllNullParam]\n */"} {"signature":"public fun < T > DataFrame < T > . dropNulls ( vararg columns : KProperty < * > , whereAllNull : Boolean = false ) : DataFrame < T >","body":"= dropNulls ( whereAllNull ) { columns . toColumnSet ( ) }","docstring":"/**\n * @include [CommonDropNullsFunctionDoc]\n * @include [SelectingColumns.KProperties.WithExample] {@include [SetDropNullsOperationArg]}\n * `df.`[dropNulls][dropNulls]`(Person::length, whereAllNull = true)`\n * @include [DropNulls.WhereAllNullParam]\n * @include [DropKPropertiesParam]\n */"} {"signature":"public fun < T > DataFrame < T > . dropNulls ( vararg columns : String , whereAllNull : Boolean = false ) : DataFrame < T >","body":"= dropNulls ( whereAllNull ) { columns . toColumnSet ( ) }","docstring":"/**\n * @include [CommonDropNullsFunctionDoc]\n * @include [SelectingColumns.ColumnNames.WithExample] {@include [SetDropNullsOperationArg]}\n * `df.`[dropNulls][dropNulls]`(\"length\", whereAllNull = true)`\n * @include [DropNulls.WhereAllNullParam]\n * @include [DropColumnNamesParam]\n */"} {"signature":"public fun < T > DataFrame < T > . dropNulls ( vararg columns : AnyColumnReference , whereAllNull : Boolean = false ) : DataFrame < T >","body":"= dropNulls ( whereAllNull ) { columns . toColumnSet ( ) }","docstring":"/**\n * @include [CommonDropNullsFunctionDoc]\n * @include [SelectingColumns.ColumnAccessors.WithExample] {@include [SetDropNullsOperationArg]}\n * `df.`[dropNulls][dropNulls]`(length, whereAllNull = true)`\n * @include [DropNulls.WhereAllNullParam]\n * @include [DropColumnAccessorsParam]\n */"} {"signature":"public fun < T > DataColumn < T ? > . dropNulls ( ) : DataColumn < T >","body":"= ( if ( ! hasNulls ( ) ) this else filter { it != null } ) as DataColumn < T >","docstring":"/**\n * ## The Drop Nulls Operation\n *\n * Removes `null` values from this [DataColumn], adjusting the type accordingly.\n */"} {"signature":"public fun < T > DataFrame < T > . dropNA ( whereAllNA : Boolean = false , columns : ColumnsSelector < T , * > ) : DataFrame < T >","body":"{ val cols = this [ columns ] return if ( whereAllNA ) drop { cols . all { this [ it ] . isNA } } else drop { cols . any { this [ it ] . isNA } } }","docstring":"/**\n * @include [CommonDropNAFunctionDoc]\n * @include [SelectingColumns.Dsl.WithExample] {@include [SetDropNAOperationArg]}\n * `df.`[dropNA][dropNA]`(whereAllNA = true) { `[colsOf][colsOf]`<`[Double][Double]`>() }`\n * @include [DropNA.WhereAllNAParam]\n * @include [DropDslParam]\n */"} {"signature":"public fun < T > DataFrame < T > . dropNA ( vararg columns : KProperty < * > , whereAllNA : Boolean = false ) : DataFrame < T >","body":"= dropNA ( whereAllNA ) { columns . toColumnSet ( ) }","docstring":"/**\n * @include [CommonDropNAFunctionDoc]\n * @include [SelectingColumns.KProperties.WithExample] {@include [SetDropNAOperationArg]}\n * `df.`[dropNA][dropNA]`(Person::length, whereAllNA = true)`\n * @include [DropNA.WhereAllNAParam]\n * @include [DropKPropertiesParam]\n */"} {"signature":"public fun < T > DataFrame < T > . dropNA ( vararg columns : String , whereAllNA : Boolean = false ) : DataFrame < T >","body":"= dropNA ( whereAllNA ) { columns . toColumnSet ( ) }","docstring":"/**\n * @include [CommonDropNAFunctionDoc]\n * @include [SelectingColumns.ColumnNames.WithExample] {@include [SetDropNAOperationArg]}\n * `df.`[dropNA][dropNA]`(\"length\", whereAllNA = true)`\n * @include [DropNA.WhereAllNAParam]\n * @include [DropColumnNamesParam]\n */"} {"signature":"public fun < T > DataFrame < T > . dropNA ( vararg columns : AnyColumnReference , whereAllNA : Boolean = false ) : DataFrame < T >","body":"= dropNA ( whereAllNA ) { columns . toColumnSet ( ) }","docstring":"/**\n * @include [CommonDropNAFunctionDoc]\n * @include [SelectingColumns.ColumnAccessors.WithExample] {@include [SetDropNAOperationArg]}\n * `df.`[dropNA][dropNA]`(length, whereAllNA = true)`\n * @include [DropNA.WhereAllNAParam]\n * @include [DropColumnAccessorsParam]\n */"} {"signature":"public fun < T > DataFrame < T > . dropNA ( whereAllNA : Boolean = false ) : DataFrame < T >","body":"= dropNA ( whereAllNA ) { all ( ) }","docstring":"/**\n * @include [CommonDropNAFunctionDoc]\n * This overload operates on all columns in the [DataFrame].\n * @include [DropNA.WhereAllNAParam]\n */"} {"signature":"public fun < T > DataColumn < T ? > . dropNA ( ) : DataColumn < T >","body":"= when ( typeClass ) { Double :: class , Float :: class -> filter { ! it . isNA } . cast ( ) else -> ( if ( ! hasNulls ( ) ) this else filter { it != null } ) as DataColumn < T > }","docstring":"/**\n * ## The Drop `NA` Operation\n *\n * Removes [`NA`][NA] values from this [DataColumn], adjusting the type accordingly.\n */"} {"signature":"public fun < T > DataFrame < T > . dropNaNs ( whereAllNaN : Boolean = false , columns : ColumnsSelector < T , * > ) : DataFrame < T >","body":"{ val cols = this [ columns ] return if ( whereAllNaN ) drop { cols . all { this [ it ] . isNaN } } else drop { cols . any { this [ it ] . isNaN } } }","docstring":"/**\n * @include [CommonDropNaNsFunctionDoc]\n * @include [SelectingColumns.Dsl.WithExample] {@include [SetDropNaNsOperationArg]}\n * `df.`[dropNaNs][dropNaNs]`(whereAllNaN = true) { `[colsOf][colsOf]`<`[Double][Double]`>() }`\n * @include [DropNaNs.WhereAllNaNParam]\n * @include [DropDslParam]\n */"} {"signature":"public fun < T > DataFrame < T > . dropNaNs ( vararg columns : KProperty < * > , whereAllNaN : Boolean = false ) : DataFrame < T >","body":"= dropNaNs ( whereAllNaN ) { columns . toColumnSet ( ) }","docstring":"/**\n * @include [CommonDropNaNsFunctionDoc]\n * @include [SelectingColumns.KProperties.WithExample] {@include [SetDropNaNsOperationArg]}\n * `df.`[dropNaNs][dropNaNs]`(Person::length, whereAllNaN = true)`\n * @include [DropNaNs.WhereAllNaNParam]\n * @include [DropKPropertiesParam]\n */"} {"signature":"public fun < T > DataFrame < T > . dropNaNs ( vararg columns : String , whereAllNaN : Boolean = false ) : DataFrame < T >","body":"= dropNaNs ( whereAllNaN ) { columns . toColumnSet ( ) }","docstring":"/**\n * @include [CommonDropNaNsFunctionDoc]\n * @include [SelectingColumns.ColumnNames.WithExample] {@include [SetDropNaNsOperationArg]}\n * `df.`[dropNaNs][dropNaNs]`(\"length\", whereAllNaN = true)`\n * @include [DropNaNs.WhereAllNaNParam]\n * @include [DropColumnNamesParam]\n */"} {"signature":"public fun < T > DataFrame < T > . dropNaNs ( vararg columns : AnyColumnReference , whereAllNaN : Boolean = false ) : DataFrame < T >","body":"= dropNaNs ( whereAllNaN ) { columns . toColumnSet ( ) }","docstring":"/**\n * @include [CommonDropNaNsFunctionDoc]\n * @include [SelectingColumns.ColumnAccessors.WithExample] {@include [SetDropNaNsOperationArg]}\n * `df.`[dropNaNs][dropNaNs]`(length, whereAllNaN = true)`\n * @include [DropNaNs.WhereAllNaNParam]\n * @include [DropColumnAccessorsParam]\n */"} {"signature":"public fun < T > DataFrame < T > . dropNaNs ( whereAllNaN : Boolean = false ) : DataFrame < T >","body":"= dropNaNs ( whereAllNaN ) { all ( ) }","docstring":"/**\n * @include [CommonDropNaNsFunctionDoc]\n * This overload operates on all columns in the [DataFrame].\n * @include [DropNaNs.WhereAllNaNParam]\n */"} {"signature":"public fun < T > DataColumn < T > . dropNaNs ( ) : DataColumn < T >","body":"= when ( typeClass ) { Double :: class , Float :: class -> filter { ! it . isNaN } . cast ( ) else -> this }","docstring":"/**\n * ## The Drop `NaN` Operation\n *\n * Removes [`NaN`][NaN] values from this [DataColumn], adjusting the type accordingly.\n */"} {"signature":"internal fun addClasspath ( paths : List < File > )","body":"{ if ( analysisPlatform == Platform . js || analysisPlatform == Platform . wasm ) { configuration . addAll ( JSConfigurationKeys . LIBRARIES , paths . map { it . absolutePath } ) } else { configuration . addJvmClasspathRoots ( paths ) } }","docstring":"/**\n * Adds list of paths to classpath.\n * $paths: collection of files to add\n */"} {"signature":"internal fun addClasspath ( path : File )","body":"{ if ( analysisPlatform == Platform . js || analysisPlatform == Platform . wasm ) { configuration . add ( JSConfigurationKeys . LIBRARIES , path . absolutePath ) } else { configuration . addJvmClasspathRoot ( path ) } }","docstring":"/**\n * Adds path to classpath.\n * $path: path to add\n */"} {"signature":"internal fun addSources ( sourceDirectories : Iterable < File > )","body":"{ sourceDirectories . forEach { directory -> configuration . addKotlinSourceRoot ( directory . path ) if ( directory . isDirectory || directory . extension == \"\" ) { configuration . addJavaSourceRoot ( directory ) } } }","docstring":"/**\n * Adds list of paths to source roots.\n * $list: collection of files to add\n */"} {"signature":"override fun dispose ( )","body":"{ Disposer . dispose ( this ) }","docstring":"/**\n * Disposes the environment and frees all associated resources.\n */"} {"signature":"inline fun < T , reified R > Dataset < T > . col ( colName : String ) : TypedColumn < T , R >","body":"= org . jetbrains . kotlinx . spark . api . col < T , R > ( colName )","docstring":"/**\n * Selects column based on the column name and returns it as a [TypedColumn].\n *\n * For example:\n * ```kotlin\n * dataset.col<_, Int>(\"a\")\n * ```\n *\n * @note The column name can also reference to a nested column like `a.b`.\n */"} {"signature":"inline operator fun < T , reified R > Dataset < T > . invoke ( colName : String ) : TypedColumn < T , R >","body":"= org . jetbrains . kotlinx . spark . api . col < T , R > ( colName )","docstring":"/**\n * Selects column based on the column name and returns it as a [TypedColumn].\n *\n * For example:\n * ```kotlin\n * dataset<_, Int>(\"a\")\n * ```\n * @note The column name can also reference to a nested column like `a.b`.\n */"} {"signature":"operator fun Dataset < * > . invoke ( colName : String ) : Column","body":"= apply ( colName )","docstring":"/**\n * Selects column based on the column name and returns it as a [Column].\n *\n * @note The column name can also reference to a nested column like `a.b`.\n *\n */"} {"signature":"@ Suppress ( \"\" ) inline fun < T , reified U > Dataset < T > . col ( column : KProperty1 < T , U > ) : TypedColumn < T , U >","body":"= col ( column . name ) . `as` ( )","docstring":"/**\n * Helper function to quickly get a [TypedColumn] (or [Column]) from a dataset in a refactor-safe manner.\n * ```kotlin\n * val dataset: Dataset = ...\n * val columnA: TypedColumn = dataset.col(YourClass::a)\n * ```\n * @see invoke\n */"} {"signature":"inline operator fun < T , reified U > Dataset < T > . invoke ( column : KProperty1 < T , U > ) : TypedColumn < T , U >","body":"= col ( column )","docstring":"/**\n * Helper function to quickly get a [TypedColumn] (or [Column]) from a dataset in a refactor-safe manner.\n * ```kotlin\n * val dataset: Dataset = ...\n * val columnA: TypedColumn = dataset(YourClass::a)\n * ```\n * @see col\n */"} {"signature":"inline fun < reified T > Dataset < T > . singleCol ( colName : String = \"\" ) : TypedColumn < T , T >","body":"{ require ( schema ( ) . fields ( ) . size == ) { \"\" } return org . jetbrains . kotlinx . spark . api . singleCol ( colName ) }","docstring":"/**\n * Can be used to create a [TypedColumn] for a simple [Dataset]\n * with just one single column called \"value\".\n */"} {"signature":"operator fun Column . unaryMinus ( ) : Column","body":"= `unary_$minus` ( )","docstring":"/**\n * Unary minus, i.e. negate the expression.\n * ```\n * // Scala: select the amount column and negates all values.\n * df.select( -df(\"amount\") )\n *\n * // Kotlin:\n * import org.jetbrains.kotlinx.spark.api.*\n * df.select( -df(\"amount\") )\n *\n * // Java:\n * import static org.apache.spark.sql.functions.*;\n * df.select( negate(col(\"amount\") );\n * ```\n */"} {"signature":"operator fun Column . not ( ) : Column","body":"= `unary_$bang` ( )","docstring":"/**\n * Inversion of boolean expression, i.e. NOT.\n * ```\n * // Scala: select rows that are not active (isActive === false)\n * df.filter( !df(\"isActive\") )\n *\n * // Kotlin:\n * import org.jetbrains.kotlinx.spark.api.*\n * df.filter( !df(\"amount\") )\n *\n * // Java:\n * import static org.apache.spark.sql.functions.*;\n * df.filter( not(df.col(\"isActive\")) );\n * ```\n */"} {"signature":"infix fun Column . eq ( other : Any ) : Column","body":"= `$eq$eq$eq` ( other )","docstring":"/**\n * Equality test.\n * ```\n * // Scala:\n * df.filter( df(\"colA\") === df(\"colB\") )\n *\n * // Kotlin:\n * import org.jetbrains.kotlinx.spark.api.*\n * df.filter( df(\"colA\") eq df(\"colB\") )\n * // or\n * df.filter( df(\"colA\") `===` df(\"colB\") )\n *\n * // Java\n * import static org.apache.spark.sql.functions.*;\n * df.filter( col(\"colA\").equalTo(col(\"colB\")) );\n * ```\n */"} {"signature":"infix fun Column . `===` ( other : Any ) : Column","body":"= `$eq$eq$eq` ( other )","docstring":"/**\n * Equality test.\n * ```\n * // Scala:\n * df.filter( df(\"colA\") === df(\"colB\") )\n *\n * // Kotlin:\n * import org.jetbrains.kotlinx.spark.api.*\n * df.filter( df(\"colA\") eq df(\"colB\") )\n * // or\n * df.filter( df(\"colA\") `===` df(\"colB\") )\n *\n * // Java\n * import static org.apache.spark.sql.functions.*;\n * df.filter( col(\"colA\").equalTo(col(\"colB\")) );\n * ```\n */"} {"signature":"infix fun Column . neq ( other : Any ) : Column","body":"= `$eq$bang$eq` ( other )","docstring":"/**\n * Inequality test.\n * ```\n * // Scala:\n * df.select( df(\"colA\") =!= df(\"colB\") )\n * df.select( !(df(\"colA\") === df(\"colB\")) )\n *\n * // Kotlin:\n * import org.jetbrains.kotlinx.spark.api.*\n * df.select( df(\"colA\") neq df(\"colB\") )\n * df.select( !(df(\"colA\") eq df(\"colB\")) )\n * // or\n * df.select( df(\"colA\") `=!=` df(\"colB\") )\n * df.select( !(df(\"colA\") `===` df(\"colB\")) )\n *\n * // Java:\n * import static org.apache.spark.sql.functions.*;\n * df.select( col(\"colA\").notEqual(col(\"colB\")) );\n * ```\n */"} {"signature":"infix fun Column . `=!=` ( other : Any ) : Column","body":"= `$eq$bang$eq` ( other )","docstring":"/**\n * Inequality test.\n * ```\n * // Scala:\n * df.select( df(\"colA\") =!= df(\"colB\") )\n * df.select( !(df(\"colA\") === df(\"colB\")) )\n *\n * // Kotlin:\n * import org.jetbrains.kotlinx.spark.api.*\n * df.select( df(\"colA\") neq df(\"colB\") )\n * df.select( !(df(\"colA\") eq df(\"colB\")) )\n * // or\n * df.select( df(\"colA\") `=!=` df(\"colB\") )\n * df.select( !(df(\"colA\") `===` df(\"colB\")) )\n *\n * // Java:\n * import static org.apache.spark.sql.functions.*;\n * df.select( col(\"colA\").notEqual(col(\"colB\")) );\n * ```\n */"} {"signature":"infix fun Column . gt ( other : Any ) : Column","body":"= `$greater` ( other )","docstring":"/**\n * Greater than.\n * ```\n * // Scala: The following selects people older than 21.\n * people.select( people(\"age\") > 21 )\n *\n * // Kotlin:\n * import org.jetbrains.kotlinx.spark.api.*\n * people.select( people(\"age\") gt 21 )\n *\n * // Java:\n * import static org.apache.spark.sql.functions.*;\n * people.select( people.col(\"age\").gt(21) );\n * ```\n */"} {"signature":"infix fun Column . lt ( other : Any ) : Column","body":"= `$less` ( other )","docstring":"/**\n * Less than.\n * ```\n * // Scala: The following selects people younger than 21.\n * people.select( people(\"age\") < 21 )\n *\n * // Kotlin:\n * import org.jetbrains.kotlinx.spark.api.*\n * people.select( people(\"age\") lt 21 )\n *\n * // Java:\n * import static org.apache.spark.sql.functions.*;\n * people.select( people.col(\"age\").lt(21) );\n * ```\n */"} {"signature":"infix fun Column . leq ( other : Any ) : Column","body":"= `$less$eq` ( other )","docstring":"/**\n * Less than or equal to.\n * ```\n * // Scala: The following selects people age 21 or younger than 21.\n * people.select( people(\"age\") <= 21 )\n *\n * // Kotlin:\n * import org.jetbrains.kotlinx.spark.api.*\n * people.select( people(\"age\") leq 21 )\n *\n * // Java:\n * import static org.apache.spark.sql.functions.*;\n * people.select( people.col(\"age\").leq(21) );\n * ```\n */"} {"signature":"infix fun Column . geq ( other : Any ) : Column","body":"= `$greater$eq` ( other )","docstring":"/**\n * Greater than or equal to an expression.\n * ```\n * // Scala: The following selects people age 21 or older than 21.\n * people.select( people(\"age\") >= 21 )\n *\n * // Kotlin:\n * import org.jetbrains.kotlinx.spark.api.*\n * people.select( people(\"age\") geq 21 )\n *\n * // Java:\n * import static org.apache.spark.sql.functions.*;\n * people.select( people.col(\"age\").geq(21) );\n * ```\n */"} {"signature":"infix fun Column . inRangeOf ( range : ClosedRange < * > ) : Column","body":"= between ( range . start , range . endInclusive )","docstring":"/**\n * True if the current column is in the given [range].\n * ```\n * // Scala:\n * df.where( df(\"colA\").between(1, 5) )\n *\n * // Kotlin:\n * import org.jetbrains.kotlinx.spark.api.*\n * df.where( df(\"colA\") inRangeOf 1..5 )\n *\n * // Java:\n * import static org.apache.spark.sql.functions.*;\n * df.where( df.col(\"colA\").between(1, 5) );\n * ```\n */"} {"signature":"infix fun Column . or ( other : Any ) : Column","body":"= `$bar$bar` ( other )","docstring":"/**\n * Boolean OR.\n * ```\n * // Scala: The following selects people that are in school or employed.\n * people.filter( people(\"inSchool\") || people(\"isEmployed\") )\n *\n * // Kotlin:\n * import org.jetbrains.kotlinx.spark.api.*\n * people.filter( people(\"inSchool\") or people(\"isEmployed\") )\n *\n * // Java:\n * import static org.apache.spark.sql.functions.*;\n * people.filter( people.col(\"inSchool\").or(people.col(\"isEmployed\")) );\n * ```\n */"} {"signature":"infix fun Column . and ( other : Any ) : Column","body":"= `$amp$amp` ( other )","docstring":"/**\n * Boolean AND.\n * ```\n * // Scala: The following selects people that are in school and employed at the same time.\n * people.select( people(\"inSchool\") && people(\"isEmployed\") )\n *\n * // Kotlin:\n * import org.jetbrains.kotlinx.spark.api.*\n * people.select( people(\"inSchool\") and people(\"isEmployed\") )\n * // or\n * people.select( people(\"inSchool\") `&&` people(\"isEmployed\") )\n *\n * // Java:\n * import static org.apache.spark.sql.functions.*;\n * people.select( people.col(\"inSchool\").and(people.col(\"isEmployed\")) );\n * ```\n */"} {"signature":"infix fun Column . `&&` ( other : Any ) : Column","body":"= `$amp$amp` ( other )","docstring":"/**\n * Boolean AND.\n * ```\n * // Scala: The following selects people that are in school and employed at the same time.\n * people.select( people(\"inSchool\") && people(\"isEmployed\") )\n *\n * // Kotlin:\n * import org.jetbrains.kotlinx.spark.api.*\n * people.select( people(\"inSchool\") and people(\"isEmployed\") )\n * // or\n * people.select( people(\"inSchool\") `&&` people(\"isEmployed\") )\n *\n * // Java:\n * import static org.apache.spark.sql.functions.*;\n * people.select( people.col(\"inSchool\").and(people.col(\"isEmployed\")) );\n * ```\n */"} {"signature":"operator fun Column . times ( other : Any ) : Column","body":"= `$times` ( other )","docstring":"/**\n * Multiplication of this expression and another expression.\n * ```\n * // Scala: The following multiplies a person's height by their weight.\n * people.select( people(\"height\") * people(\"weight\") )\n *\n * // Kotlin:\n * import org.jetbrains.kotlinx.spark.api.*\n * people.select( people(\"height\") * people(\"weight\") )\n *\n * // Java:\n * import static org.apache.spark.sql.functions.*;\n * people.select( people.col(\"height\").multiply(people.col(\"weight\")) );\n * ```\n */"} {"signature":"operator fun Column . div ( other : Any ) : Column","body":"= `$div` ( other )","docstring":"/**\n * Division this expression by another expression.\n * ```\n * // Scala: The following divides a person's height by their weight.\n * people.select( people(\"height\") / people(\"weight\") )\n *\n * // Kotlin\n * import org.jetbrains.kotlinx.spark.api.*\n * people.select( people(\"height\") / people(\"weight\") )\n *\n * // Java:\n * import static org.apache.spark.sql.functions.*;\n * people.select( people.col(\"height\").divide(people.col(\"weight\")) );\n * ```\n */"} {"signature":"operator fun Column . rem ( other : Any ) : Column","body":"= `$percent` ( other )","docstring":"/**\n * Modulo (a.k.a. remainder) expression.\n * ```\n * // Scala:\n * df.where( df(\"colA\") % 2 === 0 )\n *\n * // Kotlin:\n * import org.jetbrains.kotlinx.spark.api.*\n * df.where( df(\"colA\") % 2 eq 0 )\n *\n * // Java:\n * import static org.apache.spark.sql.functions.*;\n * df.where( df.col(\"colA\").mod(2).equalTo(0) );\n * ```\n */"} {"signature":"operator fun Column . get ( key : Any ) : Column","body":"= getItem ( key )","docstring":"/**\n * An expression that gets an item at position `ordinal` out of an array,\n * or gets a value by key `key` in a `MapType`.\n * ```\n * // Scala:\n * df.where( df(\"arrayColumn\").getItem(0) === 5 )\n *\n * // Kotlin\n * import org.jetbrains.kotlinx.spark.api.*\n * df.where( df(\"arrayColumn\")[0] eq 5 )\n *\n * // Java\n * import static org.apache.spark.sql.functions.*;\n * df.where( df.col(\"arrayColumn\").getItem(0).equalTo(5) );\n * ```\n */"} {"signature":"@ Suppress ( \"\" ) inline fun < DsType , reified U > Column . `as` ( ) : TypedColumn < DsType , U >","body":"= `as` ( encoder < U > ( ) ) as TypedColumn < DsType , U >","docstring":"/**\n * Provides a type hint about the expected return value of this column. This information can\n * be used by operations such as `select` on a [Dataset] to automatically convert the\n * results into the correct JVM types.\n *\n * ```\n * val df: Dataset = ...\n * val typedColumn: Dataset = df.select( col(\"a\").`as`<_, Int>() )\n * ```\n *\n * @see typed\n */"} {"signature":"@ Suppress ( \"\" ) inline fun < DsType , reified U > TypedColumn < DsType , * > . `as` ( ) : TypedColumn < DsType , U >","body":"= `as` ( encoder < U > ( ) ) as TypedColumn < DsType , U >","docstring":"/**\n * Provides a type hint about the expected return value of this column. This information can\n * be used by operations such as `select` on a [Dataset] to automatically convert the\n * results into the correct JVM types.\n *\n * ```\n * val df: Dataset = ...\n * val typedColumn: Dataset = df.select( col(\"a\").`as`<_, Int>() )\n * ```\n *\n * @see typed\n */"} {"signature":"@ Suppress ( \"\" ) inline fun < DsType , reified T > Column . typed ( ) : TypedColumn < DsType , T >","body":"= `as` ( )","docstring":"/**\n * Provides a type hint about the expected return value of this column. This information can\n * be used by operations such as `select` on a [Dataset] to automatically convert the\n * results into the correct JVM types.\n *\n * ```\n * val df: Dataset = ...\n * val typedColumn: Dataset = df.select( col(\"a\").typed<_, Int>() )\n * ```\n *\n * @see as\n */"} {"signature":"@ Suppress ( \"\" ) inline fun < DsType , reified T > TypedColumn < DsType , * > . typed ( ) : TypedColumn < DsType , T >","body":"= `as` ( )","docstring":"/**\n * Provides a type hint about the expected return value of this column. This information can\n * be used by operations such as `select` on a [Dataset] to automatically convert the\n * results into the correct JVM types.\n *\n * ```\n * val df: Dataset = ...\n * val typedColumn: Dataset = df.select( col(\"a\").typed<_, Int>() )\n * ```\n *\n * @see as\n */"} {"signature":"fun lit ( a : Any ) : Column","body":"= functions . lit ( a )","docstring":"/**\n * Creates a [Column] of literal value.\n *\n * The passed in object is returned directly if it is already a [Column].\n * If the object is a Scala Symbol, it is converted into a [Column] also.\n * Otherwise, a new [Column] is created to represent the literal value.\n *\n * This is just a shortcut to the function from [org.apache.spark.sql.functions].\n * For all the functions, simply add `import org.apache.spark.sql.functions.*` to your file.\n */"} {"signature":"inline fun < DsType , reified U > typedLit ( literal : U ) : TypedColumn < DsType , U >","body":"= functions . lit ( literal ) . typed ( )","docstring":"/**\n * Creates a [Column] of literal value.\n *\n * The passed in object is returned directly if it is already a [Column].\n * If the object is a Scala Symbol, it is converted into a [Column] also.\n * Otherwise, a new [Column] is created to represent the literal value.\n * The difference between this function and [lit] is that this function\n * can handle types and parameterized scala types e.g.: List, Seq and Map.\n *\n */"} {"signature":"inline fun < DsType , reified U > col ( colName : String ) : TypedColumn < DsType , U >","body":"= functions . col ( colName ) . `as` ( )","docstring":"/**\n * Returns a [TypedColumn] based on the given column name and type [DsType].\n *\n * This is just a shortcut to the function from [org.apache.spark.sql.functions] combined with an [as] call.\n * For all the functions, simply add `import org.apache.spark.sql.functions.*` to your file.\n *\n * @see col\n * @see as\n */"} {"signature":"inline fun < reified DsType > singleCol ( colName : String = \"\" ) : TypedColumn < DsType , DsType >","body":"= functions . col ( colName ) . `as` ( )","docstring":"/**\n * Can be used to create a [TypedColumn] for a simple [Dataset]\n * with just one single column called \"value\".\n */"} {"signature":"fun col ( colName : String ) : Column","body":"= functions . col ( colName )","docstring":"/**\n * Returns a [Column] based on the given column name.\n *\n */"} {"signature":"@ Suppress ( \"\" ) inline fun < DsType , reified U > col ( column : KProperty1 < DsType , U > ) : TypedColumn < DsType , U >","body":"= functions . col ( column . name ) . `as` ( )","docstring":"/**\n * Returns a [Column] based on the given class attribute, not connected to a dataset.\n * ```kotlin\n * val dataset: Dataset = ...\n * val new: Dataset> = dataset.select( col(YourClass::a), col(YourClass::b) )\n * ```\n * @see col\n */"} {"signature":"fun main ( )","body":"{ val ( train , test ) = fashionMnist ( ) val jsonConfigFile = getJSONConfigFileToyResNet ( ) val model = Functional . loadModelConfiguration ( jsonConfigFile ) model . use { it . compile ( optimizer = RMSProp ( ) , loss = Losses . SOFT_MAX_CROSS_ENTROPY_WITH_LOGITS , metric = Metrics . ACCURACY ) it . logSummary ( ) it . init ( ) var accuracy = it . evaluate ( dataset = test , batchSize = ) . metrics [ Metrics . ACCURACY ] println ( \"\" ) it . fit ( dataset = train , epochs = , batchSize = ) accuracy = it . evaluate ( dataset = test , batchSize = ) . metrics [ Metrics . ACCURACY ] println ( \"\" ) } }","docstring":"/**\n * We described ToyResNet in Keras and saved model configuration.\n *\n * It used simple initializers and training from zero is too long.\n *\n * It's better to load pretrained model.\n */"} {"signature":"internal fun getJSONConfigFileToyResNet ( ) : File","body":"{ val pathToConfig = \"\" val realPathToConfig = OnHeapDataset :: class . java . classLoader . getResource ( pathToConfig ) . path . toString ( ) return File ( realPathToConfig ) }","docstring":"/** Returns JSON file with model configuration, saved from Keras 2.x. */"} {"signature":"internal fun getWeightsFileToyResNet ( ) : HdfFile","body":"{ val pathToWeights = \"\" val realPathToWeights = OnHeapDataset :: class . java . classLoader . getResource ( pathToWeights ) . path . toString ( ) return HdfFile ( File ( realPathToWeights ) ) }","docstring":"/** Returns .h5 file with model weights, saved from Keras 2.x. */"} {"signature":"public fun < T : Number > inv ( mat : MultiArray < T , D2 > ) : NDArray < Double , D2 >","body":"public fun < T : Number > inv ( mat : MultiArray < T , D2 > ) : NDArray < Double , D2 >","docstring":"/**\n * Returns inverse of a double matrix from numeric matrix\n */"} {"signature":"public fun invF ( mat : MultiArray < Float , D2 > ) : NDArray < Float , D2 >","body":"public fun invF ( mat : MultiArray < Float , D2 > ) : NDArray < Float , D2 >","docstring":"/**\n * Returns inverse float matrix\n */"} {"signature":"public fun < T : Complex > invC ( mat : MultiArray < T , D2 > ) : NDArray < T , D2 >","body":"public fun < T : Complex > invC ( mat : MultiArray < T , D2 > ) : NDArray < T , D2 >","docstring":"/**\n * Returns inverse complex matrix\n */"} {"signature":"public fun < T : Number , D : Dim2 > solve ( a : MultiArray < T , D2 > , b : MultiArray < T , D > ) : NDArray < Double , D >","body":"public fun < T : Number , D : Dim2 > solve ( a : MultiArray < T , D2 > , b : MultiArray < T , D > ) : NDArray < Double , D >","docstring":"/**\n * Solve a linear matrix equation, or system of linear scalar equations.\n */"} {"signature":"public fun < D : Dim2 > solveF ( a : MultiArray < Float , D2 > , b : MultiArray < Float , D > ) : NDArray < Float , D >","body":"public fun < D : Dim2 > solveF ( a : MultiArray < Float , D2 > , b : MultiArray < Float , D > ) : NDArray < Float , D >","docstring":"/**\n * Solve a linear matrix equation, or system of linear scalar equations.\n */"} {"signature":"public fun < T : Complex , D : Dim2 > solveC ( a : MultiArray < T , D2 > , b : MultiArray < T , D > ) : NDArray < T , D >","body":"public fun < T : Complex , D : Dim2 > solveC ( a : MultiArray < T , D2 > , b : MultiArray < T , D > ) : NDArray < T , D >","docstring":"/**\n * Solve a linear matrix equation, or system of linear scalar equations.\n */"} {"signature":"public fun normF ( mat : MultiArray < Float , D2 > , norm : Norm = Norm . Fro ) : Float","body":"public fun normF ( mat : MultiArray < Float , D2 > , norm : Norm = Norm . Fro ) : Float","docstring":"/**\n * Returns norm of float matrix\n */"} {"signature":"public fun norm ( mat : MultiArray < Double , D2 > , norm : Norm = Norm . Fro ) : Double","body":"public fun norm ( mat : MultiArray < Double , D2 > , norm : Norm = Norm . Fro ) : Double","docstring":"/**\n * Returns norm of double matrix\n */"} {"signature":"public fun < T : Number > qr ( mat : MultiArray < T , D2 > ) : Pair < D2Array < Double > , D2Array < Double > >","body":"public fun < T : Number > qr ( mat : MultiArray < T , D2 > ) : Pair < D2Array < Double > , D2Array < Double > >","docstring":"/**\n * Returns QR decomposition of the numeric matrix\n */"} {"signature":"public fun qrF ( mat : MultiArray < Float , D2 > ) : Pair < D2Array < Float > , D2Array < Float > >","body":"public fun qrF ( mat : MultiArray < Float , D2 > ) : Pair < D2Array < Float > , D2Array < Float > >","docstring":"/**\n * Returns QR decomposition of the float matrix\n */"} {"signature":"public fun < T : Complex > qrC ( mat : MultiArray < T , D2 > ) : Pair < D2Array < T > , D2Array < T > >","body":"public fun < T : Complex > qrC ( mat : MultiArray < T , D2 > ) : Pair < D2Array < T > , D2Array < T > >","docstring":"/**\n * Returns QR decomposition of the complex matrix\n */"} {"signature":"public fun < T : Number > plu ( mat : MultiArray < T , D2 > ) : Triple < D2Array < Double > , D2Array < Double > , D2Array < Double > >","body":"public fun < T : Number > plu ( mat : MultiArray < T , D2 > ) : Triple < D2Array < Double > , D2Array < Double > , D2Array < Double > >","docstring":"/**\n * Returns PLU decomposition of the numeric matrix\n */"} {"signature":"public fun pluF ( mat : MultiArray < Float , D2 > ) : Triple < D2Array < Float > , D2Array < Float > , D2Array < Float > >","body":"public fun pluF ( mat : MultiArray < Float , D2 > ) : Triple < D2Array < Float > , D2Array < Float > , D2Array < Float > >","docstring":"/**\n * Returns PLU decomposition of the float matrix\n */"} {"signature":"public fun < T : Complex > pluC ( mat : MultiArray < T , D2 > ) : Triple < D2Array < T > , D2Array < T > , D2Array < T > >","body":"public fun < T : Complex > pluC ( mat : MultiArray < T , D2 > ) : Triple < D2Array < T > , D2Array < T > , D2Array < T > >","docstring":"/**\n * Returns PLU decomposition of the complex matrix\n */"} {"signature":"@ ExperimentalMultikApi public fun svdF ( mat : MultiArray < Float , D2 > ) : Triple < D2Array < Float > , D1Array < Float > , D2Array < Float > >","body":"@ ExperimentalMultikApi public fun svdF ( mat : MultiArray < Float , D2 > ) : Triple < D2Array < Float > , D1Array < Float > , D2Array < Float > >","docstring":"/**\n * Returns SVD decomposition of the float matrix\n */"} {"signature":"@ ExperimentalMultikApi public fun < T : Number > svd ( mat : MultiArray < T , D2 > ) : Triple < D2Array < Double > , D1Array < Double > , D2Array < Double > >","body":"@ ExperimentalMultikApi public fun < T : Number > svd ( mat : MultiArray < T , D2 > ) : Triple < D2Array < Double > , D1Array < Double > , D2Array < Double > >","docstring":"/**\n * Returns SVD decomposition of the numeric matrix\n */"} {"signature":"@ ExperimentalMultikApi public fun < T : Complex > svdC ( mat : MultiArray < T , D2 > ) : Triple < D2Array < T > , D1Array < T > , D2Array < T > >","body":"@ ExperimentalMultikApi public fun < T : Complex > svdC ( mat : MultiArray < T , D2 > ) : Triple < D2Array < T > , D1Array < T > , D2Array < T > >","docstring":"/**\n * Returns SVD decomposition of the complex matrix\n */"} {"signature":"public fun < T : Number > eig ( mat : MultiArray < T , D2 > ) : Pair < D1Array < ComplexDouble > , D2Array < ComplexDouble > >","body":"public fun < T : Number > eig ( mat : MultiArray < T , D2 > ) : Pair < D1Array < ComplexDouble > , D2Array < ComplexDouble > >","docstring":"/**\n * Calculates the eigenvalues and eigenvectors of a numeric matrix\n * @return a pair of a vector of eigenvalues and a matrix of eigenvectors\n */"} {"signature":"public fun eigF ( mat : MultiArray < Float , D2 > ) : Pair < D1Array < ComplexFloat > , D2Array < ComplexFloat > >","body":"public fun eigF ( mat : MultiArray < Float , D2 > ) : Pair < D1Array < ComplexFloat > , D2Array < ComplexFloat > >","docstring":"/**\n * Calculates the eigenvalues and eigenvectors of a float matrix\n * @return a pair of a vector of eigenvalues and a matrix of eigenvectors\n */"} {"signature":"public fun < T : Complex > eigC ( mat : MultiArray < T , D2 > ) : Pair < D1Array < T > , D2Array < T > >","body":"public fun < T : Complex > eigC ( mat : MultiArray < T , D2 > ) : Pair < D1Array < T > , D2Array < T > >","docstring":"/**\n * Calculates the eigenvalues and eigenvectors of a complex matrix\n * @return a pair of a vector of eigenvalues and a matrix of eigenvectors\n */"} {"signature":"public fun < T : Number > eigVals ( mat : MultiArray < T , D2 > ) : D1Array < ComplexDouble >","body":"public fun < T : Number > eigVals ( mat : MultiArray < T , D2 > ) : D1Array < ComplexDouble >","docstring":"/**\n * Calculates the eigenvalues of a numeric matrix.\n * @return [ComplexDouble] vector\n */"} {"signature":"public fun eigValsF ( mat : MultiArray < Float , D2 > ) : D1Array < ComplexFloat >","body":"public fun eigValsF ( mat : MultiArray < Float , D2 > ) : D1Array < ComplexFloat >","docstring":"/**\n * Calculates the eigenvalues of a float matrix\n * @return [ComplexFloat] vector\n */"} {"signature":"public fun < T : Complex > eigValsC ( mat : MultiArray < T , D2 > ) : D1Array < T >","body":"public fun < T : Complex > eigValsC ( mat : MultiArray < T , D2 > ) : D1Array < T >","docstring":"/**\n * Calculates the eigenvalues of a float matrix\n * @return complex vector\n */"} {"signature":"public fun < T : Number > dotMM ( a : MultiArray < T , D2 > , b : MultiArray < T , D2 > ) : NDArray < T , D2 >","body":"public fun < T : Number > dotMM ( a : MultiArray < T , D2 > , b : MultiArray < T , D2 > ) : NDArray < T , D2 >","docstring":"/**\n * Dot products of two number matrices.\n */"} {"signature":"public fun < T : Complex > dotMMComplex ( a : MultiArray < T , D2 > , b : MultiArray < T , D2 > ) : NDArray < T , D2 >","body":"public fun < T : Complex > dotMMComplex ( a : MultiArray < T , D2 > , b : MultiArray < T , D2 > ) : NDArray < T , D2 >","docstring":"/**\n * Dot products of two complex matrices.\n */"} {"signature":"public fun < T : Number > dotMV ( a : MultiArray < T , D2 > , b : MultiArray < T , D1 > ) : NDArray < T , D1 >","body":"public fun < T : Number > dotMV ( a : MultiArray < T , D2 > , b : MultiArray < T , D1 > ) : NDArray < T , D1 >","docstring":"/**\n * Dot products of number matrix and number vector.\n */"} {"signature":"public fun < T : Complex > dotMVComplex ( a : MultiArray < T , D2 > , b : MultiArray < T , D1 > ) : NDArray < T , D1 >","body":"public fun < T : Complex > dotMVComplex ( a : MultiArray < T , D2 > , b : MultiArray < T , D1 > ) : NDArray < T , D1 >","docstring":"/**\n * Dot products of complex matrix and complex vector.\n */"} {"signature":"public fun < T : Number > dotVV ( a : MultiArray < T , D1 > , b : MultiArray < T , D1 > ) : T","body":"public fun < T : Number > dotVV ( a : MultiArray < T , D1 > , b : MultiArray < T , D1 > ) : T","docstring":"/**\n * Dot products of two number vectors. Scalar product.\n */"} {"signature":"public fun < T : Complex > dotVVComplex ( a : MultiArray < T , D1 > , b : MultiArray < T , D1 > ) : T","body":"public fun < T : Complex > dotVVComplex ( a : MultiArray < T , D1 > , b : MultiArray < T , D1 > ) : T","docstring":"/**\n * Dot products of two complex vectors. Scalar product.\n */"} {"signature":"abstract fun convertAttributeToAnnotation ( attribute : ConeAttribute < * > ) : FirAnnotation ?","body":"abstract fun convertAttributeToAnnotation ( attribute : ConeAttribute < * > ) : FirAnnotation ?","docstring":"/**\n * Please don't convert attributes which you didn't create\n * If [attribute] came from compiler or another plugin just return null\n */"} {"signature":"public fun < T : Any > rxFlowable ( context : CoroutineContext = EmptyCoroutineContext , @ BuilderInference block : suspend ProducerScope < T > . ( ) -> Unit ) : Flowable < T >","body":"{ require ( context [ Job ] === null ) { \"\" + \"\" } return Flowable . fromPublisher ( publishInternal ( GlobalScope , context , RX_HANDLER , block ) ) }","docstring":"/**\n * Creates cold [flowable][Flowable] that will run a given [block] in a coroutine.\n * Every time the returned flowable is subscribed, it starts a new coroutine.\n *\n * Coroutine emits ([ObservableEmitter.onNext]) values with `send`, completes ([ObservableEmitter.onComplete])\n * when the coroutine completes or channel is explicitly closed and emits error ([ObservableEmitter.onError])\n * if coroutine throws an exception or closes channel with a cause.\n * Unsubscribing cancels running coroutine.\n *\n * Invocations of `send` are suspended appropriately when subscribers apply back-pressure and to ensure that\n * `onNext` is not invoked concurrently.\n *\n * Coroutine context can be specified with [context] argument.\n * If the context does not have any dispatcher nor any other [ContinuationInterceptor], then [Dispatchers.Default] is used.\n * Method throws [IllegalArgumentException] if provided [context] contains a [Job] instance.\n *\n * **Note: This is an experimental api.** Behaviour of publishers that work as children in a parent scope with respect\n */"} {"signature":"@ Deprecated ( message = \"\" , level = DeprecationLevel . HIDDEN , replaceWith = ReplaceWith ( \"\" ) ) @ LowPriorityInOverloadResolution public fun < T : Any > CoroutineScope . rxFlowable ( context : CoroutineContext = EmptyCoroutineContext , @ BuilderInference block : suspend ProducerScope < T > . ( ) -> Unit ) : Flowable < T >","body":"= Flowable . fromPublisher ( publishInternal ( this , context , RX_HANDLER , block ) )","docstring":"/** @suppress */"} {"signature":"private fun ensureCapacity ( minCapacity : Int )","body":"{ if ( minCapacity < ) throw IllegalStateException ( \"\" ) if ( minCapacity <= elementData . size ) return if ( elementData === emptyElementData ) { elementData = arrayOfNulls ( minCapacity . coerceAtLeast ( defaultMinCapacity ) ) return } val newCapacity = AbstractList . newCapacity ( elementData . size , minCapacity ) copyElements ( newCapacity ) }","docstring":"/**\n * Ensures that the capacity of this deque is at least equal to the specified [minCapacity].\n *\n * If the current capacity is less than the [minCapacity], a new backing storage is allocated with greater capacity.\n * Otherwise, this method takes no action and simply returns.\n */"} {"signature":"private fun copyElements ( newCapacity : Int )","body":"{ val newElements = arrayOfNulls < Any ? > ( newCapacity ) elementData . copyInto ( newElements , , head , elementData . size ) elementData . copyInto ( newElements , elementData . size - head , , head ) head = elementData = newElements }","docstring":"/**\n * Creates a new array with the specified [newCapacity] size and copies elements in the [elementData] array to it.\n */"} {"signature":"public fun first ( ) : E","body":"= if ( isEmpty ( ) ) throw NoSuchElementException ( \"\" ) else internalGet ( head )","docstring":"/**\n * Returns the first element, or throws [NoSuchElementException] if this deque is empty.\n */"} {"signature":"public fun firstOrNull ( ) : E ?","body":"= if ( isEmpty ( ) ) null else internalGet ( head )","docstring":"/**\n * Returns the first element, or `null` if this deque is empty.\n */"} {"signature":"public fun last ( ) : E","body":"= if ( isEmpty ( ) ) throw NoSuchElementException ( \"\" ) else internalGet ( internalIndex ( lastIndex ) )","docstring":"/**\n * Returns the last element, or throws [NoSuchElementException] if this deque is empty.\n */"} {"signature":"public fun lastOrNull ( ) : E ?","body":"= if ( isEmpty ( ) ) null else internalGet ( internalIndex ( lastIndex ) )","docstring":"/**\n * Returns the last element, or `null` if this deque is empty.\n */"} {"signature":"public fun addFirst ( element : E )","body":"{ registerModification ( ) ensureCapacity ( size + ) head = decremented ( head ) elementData [ head ] = element size += }","docstring":"/**\n * Prepends the specified [element] to this deque.\n */"} {"signature":"public fun addLast ( element : E )","body":"{ registerModification ( ) ensureCapacity ( size + ) elementData [ internalIndex ( size ) ] = element size += }","docstring":"/**\n * Appends the specified [element] to this deque.\n */"} {"signature":"public fun removeFirst ( ) : E","body":"{ if ( isEmpty ( ) ) throw NoSuchElementException ( \"\" ) registerModification ( ) val element = internalGet ( head ) elementData [ head ] = null head = incremented ( head ) size -= return element }","docstring":"/**\n * Removes the first element from this deque and returns that removed element, or throws [NoSuchElementException] if this deque is empty.\n */"} {"signature":"public fun removeFirstOrNull ( ) : E ?","body":"= if ( isEmpty ( ) ) null else removeFirst ( )","docstring":"/**\n * Removes the first element from this deque and returns that removed element, or returns `null` if this deque is empty.\n */"} {"signature":"public fun removeLast ( ) : E","body":"{ if ( isEmpty ( ) ) throw NoSuchElementException ( \"\" ) registerModification ( ) val internalLastIndex = internalIndex ( lastIndex ) val element = internalGet ( internalLastIndex ) elementData [ internalLastIndex ] = null size -= return element }","docstring":"/**\n * Removes the last element from this deque and returns that removed element, or throws [NoSuchElementException] if this deque is empty.\n */"} {"signature":"public fun removeLastOrNull ( ) : E ?","body":"= if ( isEmpty ( ) ) null else removeLast ( )","docstring":"/**\n * Removes the last element from this deque and returns that removed element, or returns `null` if this deque is empty.\n */"} {"signature":"private fun nullifyNonEmpty ( internalFromIndex : Int , internalToIndex : Int )","body":"{ if ( internalFromIndex < internalToIndex ) { elementData . fill ( null , internalFromIndex , internalToIndex ) } else { elementData . fill ( null , internalFromIndex , elementData . size ) elementData . fill ( null , , internalToIndex ) } }","docstring":"/** If `internalFromIndex == internalToIndex`, the buffer is considered full and all elements are nullified. */"} {"signature":"fun lenetOnFashionMnistExportImportToTxt ( )","body":"{ val ( train , test ) = fashionMnist ( ) val ( newTrain , validation ) = train . split ( ) lenet5 ( ) . use { it . compile ( optimizer = Adam ( ) , loss = Losses . SOFT_MAX_CROSS_ENTROPY_WITH_LOGITS , metric = Metrics . ACCURACY ) it . fit ( trainingDataset = newTrain , validationDataset = validation , epochs = EPOCHS , trainBatchSize = TRAINING_BATCH_SIZE , validationBatchSize = TEST_BATCH_SIZE ) val accuracy = it . evaluate ( dataset = test , batchSize = TEST_BATCH_SIZE ) . metrics [ Metrics . ACCURACY ] println ( \"\" ) it . save ( File ( PATH_TO_MODEL ) , writingMode = WritingMode . OVERRIDE ) } val inferenceModel = TensorFlowInferenceModel . load ( File ( PATH_TO_MODEL ) , loadOptimizerState = true ) inferenceModel . use { var accuracy = val amountOfTestSet = for ( imageId in .. amountOfTestSet ) { val prediction = it . predict ( train . getX ( imageId ) ) if ( prediction == train . getY ( imageId ) . toInt ( ) ) accuracy += ( / amountOfTestSet ) } println ( \"\" ) } }","docstring":"/**\n * This examples demonstrates model and model weights export and import back:\n * - Model is exported as graph in .pb format, weights are exported in custom (txt) format.\n * - Model is trained on FashionMnist dataset.\n * - It saves all the data to the project root directory.\n * - [TensorFlowInferenceModel] is created via graph and weights loading.\n * - [TensorFlowInferenceModel] is reshaped and evaluated on first 10'000 images.\n */"} {"signature":"fun main ( ) : Unit","body":"= lenetOnFashionMnistExportImportToTxt ( )","docstring":"/** */"} {"signature":"fun addMessageCallback ( callback : RawMessageCallback ) : RawMessageCallback","body":"fun addMessageCallback ( callback : RawMessageCallback ) : RawMessageCallback","docstring":"/**\n * Add callback for incoming message and return it\n */"} {"signature":"fun removeMessageCallback ( callback : RawMessageCallback )","body":"fun removeMessageCallback ( callback : RawMessageCallback )","docstring":"/**\n * Remove added message callback\n */"} {"signature":"fun send ( socketName : JupyterSocketType , message : RawMessage , )","body":"fun send ( socketName : JupyterSocketType , message : RawMessage , )","docstring":"/**\n * Send raw [message] to a given [socketName]\n */"} {"signature":"fun openComm ( target : String , data : JsonObject = Json . EMPTY , ) : Comm","body":"fun openComm ( target : String , data : JsonObject = Json . EMPTY , ) : Comm","docstring":"/**\n * Creates a comm with a given target, generates unique ID for it. Sends comm_open request to frontend\n *\n * @param target Target to create comm for. Should be registered on frontend side.\n * @param data Content of comm_open message\n * @return Created comm\n */"} {"signature":"fun closeComm ( id : String , data : JsonObject = Json . EMPTY , )","body":"fun closeComm ( id : String , data : JsonObject = Json . EMPTY , )","docstring":"/**\n * Closes a comm with a given ID. Sends comm_close request to frontend\n *\n * @param id ID of a comm to close\n * @param data Content of comm_close message\n */"} {"signature":"fun getComms ( target : String ? = null ) : Collection < Comm >","body":"fun getComms ( target : String ? = null ) : Collection < Comm >","docstring":"/**\n * Get all comms for a given target, or all opened comms if `target` is `null`\n */"} {"signature":"fun registerCommTarget ( target : String , callback : CommOpenCallback , )","body":"fun registerCommTarget ( target : String , callback : CommOpenCallback , )","docstring":"/**\n * Register a [callback] for `comm_open` with a specified [target]. Overrides already registered callback.\n *\n * @param target\n * @param callback\n */"} {"signature":"fun unregisterCommTarget ( target : String )","body":"fun unregisterCommTarget ( target : String )","docstring":"/**\n * Unregister target callback\n */"} {"signature":"fun send ( data : JsonObject )","body":"fun send ( data : JsonObject )","docstring":"/**\n * Send JSON data to this comm. Effectively sends `comm_msg` message to frontend\n */"} {"signature":"fun onMessage ( action : CommMsgCallback ) : CommMsgCallback","body":"fun onMessage ( action : CommMsgCallback ) : CommMsgCallback","docstring":"/**\n * Add [action] callback for `comm_msg` requests. Doesn't override existing callbacks\n *\n * @return Added callback\n */"} {"signature":"fun removeMessageCallback ( callback : CommMsgCallback )","body":"fun removeMessageCallback ( callback : CommMsgCallback )","docstring":"/**\n * Remove added [onMessage] callback\n */"} {"signature":"fun close ( data : JsonObject = Json . EMPTY , notifyClient : Boolean = true , )","body":"fun close ( data : JsonObject = Json . EMPTY , notifyClient : Boolean = true , )","docstring":"/**\n * Closes a comm. Sends comm_close request to frontend if [notifyClient] is `true`\n */"} {"signature":"fun onClose ( action : CommCloseCallback ) : CommCloseCallback","body":"fun onClose ( action : CommCloseCallback ) : CommCloseCallback","docstring":"/**\n * Adds [action] callback for `comm_close` requests. Does not override existing callbacks\n */"} {"signature":"fun removeCloseCallback ( callback : CommCloseCallback )","body":"fun removeCloseCallback ( callback : CommCloseCallback )","docstring":"/**\n * Remove added [onClose] callback\n */"} {"signature":"fun rawMessageCallback ( socket : JupyterSocketType , messageType : String ? , action : RawMessageAction , ) : RawMessageCallback","body":"{ return object : RawMessageCallback { override val socket : JupyterSocketType get ( ) = socket override val messageType : String ? get ( ) = messageType override val action : RawMessageAction get ( ) = action } }","docstring":"/**\n * Construct raw message callback\n */"} {"signature":"inline fun < reified T > Comm . sendData ( data : T )","body":"{ send ( Json . encodeToJsonElement ( data ) . jsonObject ) }","docstring":"/**\n * Send an object. `data` should be serializable to JSON object\n * (generally it means that the corresponding class should be marked with @Serializable)\n */"} {"signature":"public fun resolve ( dri : DRI ) : String ?","body":"public fun resolve ( dri : DRI ) : String ?","docstring":"/**\n * @return Path to the page containing the [dri] or null if the path cannot be created\n * (eg. when the package-list does not contain [dri]'s package)\n */"} {"signature":"private fun explicitVisibilityIsNotRequired ( declaration : FirMemberDeclaration , context : CheckerContext ) : Boolean","body":"{ return when ( declaration ) { is FirPrimaryConstructor , is FirPropertyAccessor , is FirValueParameter , is FirAnonymousFunction -> true is FirCallableDeclaration -> { val containingClass = context . containingDeclarations . lastOrNull ( ) as? FirRegularClass if ( declaration is FirProperty && containingClass != null && ( containingClass . isData || containingClass . classKind == ClassKind . ANNOTATION_CLASS ) ) { return true } declaration . isOverride || declaration . isLocalMember } else -> false } }","docstring":"/**\n * Exclusion list:\n * 1. Primary constructors of public API classes\n * 2. Properties of data classes in public API\n * 3. Overrides of public API. Effectively, this means 'no report on overrides at all'\n * 4. Getters and setters (because getters can't change visibility and setter-only explicit visibility looks ugly)\n * 5. Properties of annotations in public API\n * 6. Value parameter declaration\n * 7. An anonymous function\n * 8. A local named function\n */"} {"signature":"open fun getPackageNames ( ) : Set < String > ?","body":"= null","docstring":"/**\n * Returns the set of fully qualified package names which contain any top-level declaration within the provider's scope.\n *\n * [getPackageNames] is used as the default implementation for [getPackageNamesWithTopLevelClassifiers] and\n * [getPackageNamesWithTopLevelCallables]. It depends on the symbol names provider whether it's worth computing separate package sets\n * for classifiers and callables, or just one set containing all package names.\n */"} {"signature":"open fun getPackageNamesWithTopLevelClassifiers ( ) : Set < String > ?","body":"= getPackageNames ( )","docstring":"/**\n * Returns the set of fully qualified package names which contain a top-level classifier declaration within the provider's scope.\n */"} {"signature":"abstract fun getTopLevelClassifierNamesInPackage ( packageFqName : FqName ) : Set < Name > ?","body":"abstract fun getTopLevelClassifierNamesInPackage ( packageFqName : FqName ) : Set < Name > ?","docstring":"/**\n * Returns the set of top-level classifier names (classes, interfaces, objects, and type aliases) inside the [packageFqName] package\n * within the provider's scope.\n *\n * All usages must take into account that the result might not include `kotlin.FunctionN` (and others for which a [FunctionTypeKind]\n * exists).\n */"} {"signature":"open fun getPackageNamesWithTopLevelCallables ( ) : Set < String > ?","body":"= getPackageNames ( )","docstring":"/**\n * Returns the set of fully qualified package names which contain a top-level callable declaration within the provider's scope.\n */"} {"signature":"abstract fun getTopLevelCallableNamesInPackage ( packageFqName : FqName ) : Set < Name > ?","body":"abstract fun getTopLevelCallableNamesInPackage ( packageFqName : FqName ) : Set < Name > ?","docstring":"/**\n * Returns the set of top-level callable names (functions and properties) inside the [packageFqName] package within the provider's\n * scope.\n *\n * When implementing this function, [getPackageNamesWithTopLevelCallables] should be taken into account. Specifically, if a package name\n * is not in the set of package names with top-level callables, [getTopLevelCallableNamesInPackage] must return an empty set or `null`.\n */"} {"signature":"open fun mayHaveSyntheticFunctionType ( classId : ClassId ) : Boolean","body":"= mayHaveSyntheticFunctionTypes","docstring":"/**\n * Whether [classId] is considered a generated function type within the provider's scope and session.\n */"} {"signature":"open fun mayHaveTopLevelClassifier ( classId : ClassId ) : Boolean","body":"{ if ( mayHaveSyntheticFunctionTypes && mayHaveSyntheticFunctionType ( classId ) ) return true val names = getTopLevelClassifierNamesInPackage ( classId . packageFqName ) ? : return true if ( classId . outerClassId == null ) { if ( ! names . mayContainTopLevelClassifier ( classId . shortClassName ) ) return false } else { if ( ! names . mayContainTopLevelClassifier ( classId . outermostClassId . shortClassName ) ) return false } return true }","docstring":"/**\n * Checks if the provider's scope may contain a top-level classifier (class, interface, object, or type alias) with the given [classId].\n */"} {"signature":"open fun mayHaveTopLevelCallable ( packageFqName : FqName , name : Name ) : Boolean","body":"{ if ( name . isSpecial ) return true val names = getTopLevelCallableNamesInPackage ( packageFqName ) ? : return true return name in names }","docstring":"/**\n * Checks if the provider's scope may contain a top-level callable (function or property) called [name] inside the [packageFqName]\n * package.\n */"} {"signature":"public fun customFormat ( columnSeparator : String , lineSeparatorSymbol : Char , thickLineSeparatorSymbol : Char , inputsColumnHeader : String = \"\" , outputsColumnHeader : String = \"\" , typeColumnHeader : String = \"\" ) : List < String >","body":"{ val inputRows = inputsSummaries . map { ( name , summary ) -> TableRow ( name , summary . toSummaryRow ( ) ) } val outputRows = outputsSummaries . map { ( name , summary ) -> TableRow ( name , summary . toSummaryRow ( ) ) } val header = SimpleSection ( listOf ( \"\" ) ) val inputsSection = SectionWithColumns ( inputRows , listOf ( inputsColumnHeader , typeColumnHeader ) ) val outputsSection = SectionWithColumns ( outputRows , listOf ( outputsColumnHeader , typeColumnHeader ) ) return formatTable ( listOf ( header , inputsSection , outputsSection ) , columnSeparator , lineSeparatorSymbol , thickLineSeparatorSymbol ) }","docstring":"/**\n * Format function with customizable column names.\n * @param [inputsColumnHeader] title of the column with input variables\n * @param [outputsColumnHeader] title of the column with output variables\n * @param [typeColumnHeader] title of the column with variable types\n */"} {"signature":"public fun toSummaryRow ( ) : String","body":"public fun toSummaryRow ( ) : String","docstring":"/**\n * Returns text description of the variable.\n */"} {"signature":"@ Suppress ( \"\" , \"\" ) @ PublishedApi internal fun < T > ( suspend ( ) -> T ) . invokeSuspendSuperType ( completion : Continuation < T > ) : Any ?","body":"{ throw NotImplementedError ( \"\" ) }","docstring":"/**\n * Invoke 'invoke' method of suspend super type\n * Because callable references translated with local classes,\n * necessary to call it in special way, not in synamic way\n */"} {"signature":"@ Suppress ( \"\" , \"\" ) @ PublishedApi internal fun < R , T > ( suspend R . ( ) -> T ) . invokeSuspendSuperTypeWithReceiver ( receiver : R , completion : Continuation < T > ) : Any ?","body":"{ throw NotImplementedError ( \"\" ) }","docstring":"/**\n * Invoke 'invoke' method of suspend super type with receiver\n * Because callable references translated with local classes,\n * necessary to call it in special way, not in synamic way\n */"} {"signature":"@ Suppress ( \"\" , \"\" ) @ PublishedApi internal fun < R , P , T > ( suspend R . ( P ) -> T ) . invokeSuspendSuperTypeWithReceiverAndParam ( receiver : R , param : P , completion : Continuation < T > ) : Any ?","body":"{ throw NotImplementedError ( \"\" ) }","docstring":"/**\n * Invoke 'invoke' method of suspend super type with receiver and param\n * Because callable references translated with local classes,\n * necessary to call it in special way, not in synamic way\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ InlineOnly public actual inline fun < T > ( suspend ( ) -> T ) . startCoroutineUninterceptedOrReturn ( completion : Continuation < T > ) : Any ?","body":"{ val a = this . asDynamic ( ) return if ( jsTypeOf ( a ) == \"\" ) a ( completion ) else this . invokeSuspendSuperType ( completion ) }","docstring":"/**\n * Starts unintercepted coroutine without 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 coroutine completes with result or 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 a suspended\n * coroutine using a reference to the suspending function.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ InlineOnly public actual inline fun < R , T > ( suspend R . ( ) -> T ) . startCoroutineUninterceptedOrReturn ( receiver : R , completion : Continuation < T > ) : Any ?","body":"{ val a = this . asDynamic ( ) return if ( jsTypeOf ( a ) == \"\" ) a ( receiver , completion ) else this . invokeSuspendSuperTypeWithReceiver ( receiver , completion ) }","docstring":"/**\n * Starts 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 coroutine completes with result or 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 a suspended\n * coroutine using a reference to the suspending function.\n */"} {"signature":"@ SinceKotlin ( \"\" ) public actual fun < T > ( suspend ( ) -> T ) . createCoroutineUnintercepted ( completion : Continuation < T > ) : Continuation < Unit >","body":"= createCoroutineFromSuspendFunction ( completion ) { val a = this . asDynamic ( ) if ( jsTypeOf ( a ) == \"\" ) a ( completion ) else this . invokeSuspendSuperType ( completion ) }","docstring":"/**\n * Creates unintercepted coroutine without receiver and with result type [T].\n * This function creates a new, fresh instance of suspendable computation every time it is invoked.\n *\n * To start executing the created coroutine, invoke `resume(Unit)` on the returned [Continuation] instance.\n * The [completion] continuation is invoked when coroutine completes with result or exception.\n *\n * This function returns unintercepted continuation.\n * Invocation of `resume(Unit)` starts coroutine directly in the invoker's thread without going through the\n * [ContinuationInterceptor] that might be present in the completion's [CoroutineContext].\n * It is the invoker's responsibility to ensure that a proper invocation context is established.\n * [Continuation.intercepted] can be used to acquire the intercepted continuation.\n *\n * Repeated invocation of any resume function on the resulting continuation corrupts the\n * state machine of the coroutine and may result in arbitrary behaviour or exception.\n */"} {"signature":"@ SinceKotlin ( \"\" ) public actual fun < R , T > ( suspend R . ( ) -> T ) . createCoroutineUnintercepted ( receiver : R , completion : Continuation < T > ) : Continuation < Unit >","body":"= createCoroutineFromSuspendFunction ( completion ) { val a = this . asDynamic ( ) if ( jsTypeOf ( a ) == \"\" ) a ( receiver , completion ) else this . invokeSuspendSuperTypeWithReceiver ( receiver , completion ) }","docstring":"/**\n * Creates unintercepted coroutine with receiver type [R] and result type [T].\n * This function creates a new, fresh instance of suspendable computation every time it is invoked.\n *\n * To start executing the created coroutine, invoke `resume(Unit)` on the returned [Continuation] instance.\n * The [completion] continuation is invoked when coroutine completes with result or exception.\n *\n * This function returns unintercepted continuation.\n * Invocation of `resume(Unit)` starts coroutine directly in the invoker's thread without going through the\n * [ContinuationInterceptor] that might be present in the completion's [CoroutineContext].\n * It is the invoker's responsibility to ensure that a proper invocation context is established.\n * [Continuation.intercepted] can be used to acquire the intercepted continuation.\n *\n * Repeated invocation of any resume function on the resulting continuation corrupts the\n * state machine of the coroutine and may result in arbitrary behaviour or exception.\n */"} {"signature":"@ SinceKotlin ( \"\" ) public actual fun < T > Continuation < T > . intercepted ( ) : Continuation < T >","body":"= ( this as? InterceptedCoroutine ) ? . intercepted ( ) ? : this","docstring":"/**\n * Intercepts this continuation with [ContinuationInterceptor].\n */"} {"signature":"fun BuildOptions . withBundledKotlinNative ( )","body":"= copy ( nativeOptions = nativeOptions . copy ( version = null ) )","docstring":"/**\n * This wrapper erases k/n version from passing parameters,\n * because we should use Kotlin Native bundled in KGP instead of which built from current branch.\n *\n * In this case we will use k/n version, which declared in KGP.\n *\n * The most common case is when we override local konan dir for some reason.\n */"} {"signature":"@ Test fun testTrySendNotThrowing ( )","body":"= runTest { var producerScope : ProducerScope < Int > ? = null expect ( ) val flux = flux < Int > ( Dispatchers . Unconfined ) { producerScope = this expect ( ) delay ( Long . MAX_VALUE ) } val job = launch ( start = CoroutineStart . UNDISPATCHED ) { expect ( ) flux . awaitFirstOrNull ( ) expectUnreached ( ) } job . cancel ( ) expect ( ) val result = producerScope ! ! . trySend ( ) assertTrue ( result . isFailure ) finish ( ) }","docstring":"/** Tests that `trySend` doesn't throw in `flux`. */"} {"signature":"@ Test fun testEmittingNull ( )","body":"= runTest { val flux = flux { assertFailsWith < NullPointerException > { send ( null ) } assertFailsWith < NullPointerException > { trySend ( null ) } send ( \"\" ) } assertEquals ( \"\" , flux . awaitFirstOrNull ( ) ) }","docstring":"/** Tests that all methods on `flux` fail without closing the channel when attempting to emit `null`. */"} {"signature":"@ Throws ( KtCodeCompilationException :: class ) public fun compile ( file : KtFile , configuration : CompilerConfiguration , target : KtCompilerTarget , allowedErrorFilter : ( KtDiagnostic ) -> Boolean ) : KtCompilationResult","body":"{ return withValidityAssertion { try { analysisSession . compilerFacility . compile ( file , configuration , target , allowedErrorFilter ) } catch ( e : ProcessCanceledException ) { throw e } catch ( e : Throwable ) { throw KtCodeCompilationException ( e ) } } }","docstring":"/**\n * Compile the given [file] in-memory (without dumping the compiled binaries to a disk).\n *\n * @param file A file to compile.\n * The file must be either a source module file, or a [KtCodeFragment].\n * For a [KtCodeFragment], a source module context, a compiled library source context, or an empty context(`null`) are supported.\n *\n * @param configuration Compiler configuration.\n * It is recommended to submit at least the module name ([CommonConfigurationKeys.MODULE_NAME])\n * and language version settings ([CommonConfigurationKeys.LANGUAGE_VERSION_SETTINGS]).\n *\n * @param target Compilation target platform.\n *\n * @param allowedErrorFilter Filter for the allowed errors.\n * Compilation will be aborted if there are errors that this filter rejects.\n *\n * @return Compilation result.\n *\n * The function rethrows exceptions from the compiler, wrapped in [KtCodeCompilationException].\n * The implementation should wrap the `compile()` call into a `try`/`catch` block when necessary.\n */"} {"signature":"@ PublishedApi internal inline fun < T > unsafeFlow ( @ BuilderInference crossinline block : suspend FlowCollector < T > . ( ) -> Unit ) : Flow < T >","body":"{ return object : Flow < T > { override suspend fun collect ( collector : FlowCollector < T > ) { collector . block ( ) } } }","docstring":"/**\n * An analogue of the [flow] builder that does not check the context of execution of the resulting flow.\n * Used in our own operators where we trust the context of invocations.\n */"} {"signature":"override fun getReferenceName ( ) : String ?","body":"= referenceInformationProvider . referenceName","docstring":"/**\n * @see com.intellij.psi.impl.PsiImplUtil.findAnnotation\n */"} {"signature":"@ JvmName ( \"\" ) public fun < T1 , T2 , R > Flow < T1 > . combine ( flow : Flow < T2 > , transform : suspend ( a : T1 , b : T2 ) -> R ) : Flow < R >","body":"= flow { combineInternal ( arrayOf ( this @ combine , flow ) , nullArrayFactory ( ) , { emit ( transform ( it [ ] as T1 , it [ ] as T2 ) ) } ) }","docstring":"/**\n * Returns a [Flow] whose values are generated with [transform] function by combining\n * the most recently emitted values by each flow.\n *\n * It can be demonstrated with the following example:\n * ```\n * val flow = flowOf(1, 2).onEach { delay(10) }\n * val flow2 = flowOf(\"a\", \"b\", \"c\").onEach { delay(15) }\n * flow.combine(flow2) { i, s -> i.toString() + s }.collect {\n * println(it) // Will print \"1a 2a 2b 2c\"\n * }\n * ```\n *\n * This function is a shorthand for `flow.combineTransform(flow2) { a, b -> emit(transform(a, b)) }\n */"} {"signature":"public fun < T1 , T2 , R > combine ( flow : Flow < T1 > , flow2 : Flow < T2 > , transform : suspend ( a : T1 , b : T2 ) -> R ) : Flow < R >","body":"= flow . combine ( flow2 , transform )","docstring":"/**\n * Returns a [Flow] whose values are generated with [transform] function by combining\n * the most recently emitted values by each flow.\n *\n * It can be demonstrated with the following example:\n * ```\n * val flow = flowOf(1, 2).onEach { delay(10) }\n * val flow2 = flowOf(\"a\", \"b\", \"c\").onEach { delay(15) }\n * combine(flow, flow2) { i, s -> i.toString() + s }.collect {\n * println(it) // Will print \"1a 2a 2b 2c\"\n * }\n * ```\n *\n * This function is a shorthand for `combineTransform(flow, flow2) { a, b -> emit(transform(a, b)) }\n */"} {"signature":"@ JvmName ( \"\" ) public fun < T1 , T2 , R > Flow < T1 > . combineTransform ( flow : Flow < T2 > , @ BuilderInference transform : suspend FlowCollector < R > . ( a : T1 , b : T2 ) -> Unit ) : Flow < R >","body":"= combineTransformUnsafe ( this , flow ) { args : Array < * > -> transform ( args [ ] as T1 , args [ ] as T2 ) }","docstring":"/**\n * Returns a [Flow] whose values are generated by [transform] function that process the most recently emitted values by each flow.\n *\n * The receiver of the [transform] is [FlowCollector] and thus `transform` is a\n * generic function that may transform emitted element, skip it or emit it multiple times.\n *\n * Its usage can be demonstrated with the following example:\n * ```\n * val flow = requestFlow()\n * val flow2 = searchEngineFlow()\n * flow.combineTransform(flow2) { request, searchEngine ->\n * emit(\"Downloading in progress\")\n * val result = download(request, searchEngine)\n * emit(result)\n * }\n * ```\n */"} {"signature":"public fun < T1 , T2 , R > combineTransform ( flow : Flow < T1 > , flow2 : Flow < T2 > , @ BuilderInference transform : suspend FlowCollector < R > . ( a : T1 , b : T2 ) -> Unit ) : Flow < R >","body":"= combineTransformUnsafe ( flow , flow2 ) { args : Array < * > -> transform ( args [ ] as T1 , args [ ] as T2 ) }","docstring":"/**\n * Returns a [Flow] whose values are generated by [transform] function that process the most recently emitted values by each flow.\n *\n * The receiver of the [transform] is [FlowCollector] and thus `transform` is a\n * generic function that may transform emitted element, skip it or emit it multiple times.\n *\n * Its usage can be demonstrated with the following example:\n * ```\n * val flow = requestFlow()\n * val flow2 = searchEngineFlow()\n * combineTransform(flow, flow2) { request, searchEngine ->\n * emit(\"Downloading in progress\")\n * val result = download(request, searchEngine)\n * emit(result)\n * }\n * ```\n */"} {"signature":"public fun < T1 , T2 , T3 , R > combine ( flow : Flow < T1 > , flow2 : Flow < T2 > , flow3 : Flow < T3 > , @ BuilderInference transform : suspend ( T1 , T2 , T3 ) -> R ) : Flow < R >","body":"= combineUnsafe ( flow , flow2 , flow3 ) { args : Array < * > -> transform ( args [ ] as T1 , args [ ] as T2 , args [ ] as T3 ) }","docstring":"/**\n * Returns a [Flow] whose values are generated with [transform] function by combining\n * the most recently emitted values by each flow.\n */"} {"signature":"public fun < T1 , T2 , T3 , R > combineTransform ( flow : Flow < T1 > , flow2 : Flow < T2 > , flow3 : Flow < T3 > , @ BuilderInference transform : suspend FlowCollector < R > . ( T1 , T2 , T3 ) -> Unit ) : Flow < R >","body":"= combineTransformUnsafe ( flow , flow2 , flow3 ) { args : Array < * > -> transform ( args [ ] as T1 , args [ ] as T2 , args [ ] as T3 ) }","docstring":"/**\n * Returns a [Flow] whose values are generated by [transform] function that process the most recently emitted values by each flow.\n *\n * The receiver of the [transform] is [FlowCollector] and thus `transform` is a\n * generic function that may transform emitted element, skip it or emit it multiple times.\n */"} {"signature":"public fun < T1 , T2 , T3 , T4 , R > combine ( flow : Flow < T1 > , flow2 : Flow < T2 > , flow3 : Flow < T3 > , flow4 : Flow < T4 > , transform : suspend ( T1 , T2 , T3 , T4 ) -> R ) : Flow < R >","body":"= combineUnsafe ( flow , flow2 , flow3 , flow4 ) { args : Array < * > -> transform ( args [ ] as T1 , args [ ] as T2 , args [ ] as T3 , args [ ] as T4 ) }","docstring":"/**\n * Returns a [Flow] whose values are generated with [transform] function by combining\n * the most recently emitted values by each flow.\n */"} {"signature":"public fun < T1 , T2 , T3 , T4 , R > combineTransform ( flow : Flow < T1 > , flow2 : Flow < T2 > , flow3 : Flow < T3 > , flow4 : Flow < T4 > , @ BuilderInference transform : suspend FlowCollector < R > . ( T1 , T2 , T3 , T4 ) -> Unit ) : Flow < R >","body":"= combineTransformUnsafe ( flow , flow2 , flow3 , flow4 ) { args : Array < * > -> transform ( args [ ] as T1 , args [ ] as T2 , args [ ] as T3 , args [ ] as T4 ) }","docstring":"/**\n * Returns a [Flow] whose values are generated by [transform] function that process the most recently emitted values by each flow.\n *\n * The receiver of the [transform] is [FlowCollector] and thus `transform` is a\n * generic function that may transform emitted element, skip it or emit it multiple times.\n */"} {"signature":"public fun < T1 , T2 , T3 , T4 , T5 , R > combine ( flow : Flow < T1 > , flow2 : Flow < T2 > , flow3 : Flow < T3 > , flow4 : Flow < T4 > , flow5 : Flow < T5 > , transform : suspend ( T1 , T2 , T3 , T4 , T5 ) -> R ) : Flow < R >","body":"= combineUnsafe ( flow , flow2 , flow3 , flow4 , flow5 ) { args : Array < * > -> transform ( args [ ] as T1 , args [ ] as T2 , args [ ] as T3 , args [ ] as T4 , args [ ] as T5 ) }","docstring":"/**\n * Returns a [Flow] whose values are generated with [transform] function by combining\n * the most recently emitted values by each flow.\n */"} {"signature":"public fun < T1 , T2 , T3 , T4 , T5 , R > combineTransform ( flow : Flow < T1 > , flow2 : Flow < T2 > , flow3 : Flow < T3 > , flow4 : Flow < T4 > , flow5 : Flow < T5 > , @ BuilderInference transform : suspend FlowCollector < R > . ( T1 , T2 , T3 , T4 , T5 ) -> Unit ) : Flow < R >","body":"= combineTransformUnsafe ( flow , flow2 , flow3 , flow4 , flow5 ) { args : Array < * > -> transform ( args [ ] as T1 , args [ ] as T2 , args [ ] as T3 , args [ ] as T4 , args [ ] as T5 ) }","docstring":"/**\n * Returns a [Flow] whose values are generated by [transform] function that process the most recently emitted values by each flow.\n *\n * The receiver of the [transform] is [FlowCollector] and thus `transform` is a\n * generic function that may transform emitted element, skip it or emit it multiple times.\n */"} {"signature":"public inline fun < reified T , R > combine ( vararg flows : Flow < T > , crossinline transform : suspend ( Array < T > ) -> R ) : Flow < R >","body":"= flow { combineInternal ( flows , { arrayOfNulls ( flows . size ) } , { emit ( transform ( it ) ) } ) }","docstring":"/**\n * Returns a [Flow] whose values are generated with [transform] function by combining\n * the most recently emitted values by each flow.\n */"} {"signature":"public inline fun < reified T , R > combineTransform ( vararg flows : Flow < T > , @ BuilderInference crossinline transform : suspend FlowCollector < R > . ( Array < T > ) -> Unit ) : Flow < R >","body":"= safeFlow { combineInternal ( flows , { arrayOfNulls ( flows . size ) } , { transform ( it ) } ) }","docstring":"/**\n * Returns a [Flow] whose values are generated by [transform] function that process the most recently emitted values by each flow.\n *\n * The receiver of the [transform] is [FlowCollector] and thus `transform` is a\n * generic function that may transform emitted element, skip it or emit it multiple times.\n */"} {"signature":"public inline fun < reified T , R > combine ( flows : Iterable < Flow < T > > , crossinline transform : suspend ( Array < T > ) -> R ) : Flow < R >","body":"{ val flowArray = flows . toList ( ) . toTypedArray ( ) return flow { combineInternal ( flowArray , arrayFactory = { arrayOfNulls ( flowArray . size ) } , transform = { emit ( transform ( it ) ) } ) } }","docstring":"/**\n * Returns a [Flow] whose values are generated with [transform] function by combining\n * the most recently emitted values by each flow.\n */"} {"signature":"public inline fun < reified T , R > combineTransform ( flows : Iterable < Flow < T > > , @ BuilderInference crossinline transform : suspend FlowCollector < R > . ( Array < T > ) -> Unit ) : Flow < R >","body":"{ val flowArray = flows . toList ( ) . toTypedArray ( ) return safeFlow { combineInternal ( flowArray , { arrayOfNulls ( flowArray . size ) } , { transform ( it ) } ) } }","docstring":"/**\n * Returns a [Flow] whose values are generated by [transform] function that process the most recently emitted values by each flow.\n *\n * The receiver of the [transform] is [FlowCollector] and thus `transform` is a\n * generic function that may transform emitted element, skip it or emit it multiple times.\n */"} {"signature":"public fun < T1 , T2 , R > Flow < T1 > . zip ( other : Flow < T2 > , transform : suspend ( T1 , T2 ) -> R ) : Flow < R >","body":"= zipImpl ( this , other , transform )","docstring":"/**\n * Zips values from the current flow (`this`) with [other] flow using provided [transform] function applied to each pair of values.\n * The resulting flow completes as soon as one of the flows completes and cancel is called on the remaining flow.\n *\n * It can be demonstrated with the following example:\n * ```\n * val flow = flowOf(1, 2, 3).onEach { delay(10) }\n * val flow2 = flowOf(\"a\", \"b\", \"c\", \"d\").onEach { delay(15) }\n * flow.zip(flow2) { i, s -> i.toString() + s }.collect {\n * println(it) // Will print \"1a 2b 3c\"\n * }\n * ```\n *\n * ### Buffering\n *\n * The upstream flow is collected sequentially in the same coroutine without any buffering, while the\n * [other] flow is collected concurrently as if `buffer(0)` is used. See documentation in the [buffer] operator\n * for explanation. You can use additional calls to the [buffer] operator as needed for more concurrency.\n */"} {"signature":"internal inline fun < reified T : Any > ComponentManager . serviceOrNull ( ) : T ?","body":"{ return getService ( T :: class . java ) }","docstring":"/**\n * Returns `null` if the service cannot be found in [this] component manager,\n * otherwise initializes a service if not yet initialized, and returns the service instance.\n * @see ComponentManager.getService\n */"} {"signature":"fun findOrGenerateCEnum ( classDescriptor : ClassDescriptor , parent : IrDeclarationContainer ) : IrClass","body":"{ val irClassSymbol = symbolTable . descriptorExtension . referenceClass ( classDescriptor ) return if ( ! irClassSymbol . isBound ) { provideIrClassForCEnum ( classDescriptor ) . also { it . patchDeclarationParents ( parent ) parent . declarations += it } } else { irClassSymbol . owner } }","docstring":"/**\n * Searches for an IR class for [classDescriptor] in symbol table.\n * Generates one if absent.\n */"} {"signature":"private fun provideIrClassForCEnum ( descriptor : ClassDescriptor ) : IrClass","body":"= createClass ( descriptor ) { enumIrClass -> enumIrClass . addMember ( createEnumPrimaryConstructor ( descriptor ) ) enumIrClass . addMember ( createValueProperty ( enumIrClass ) ) descriptor . enumEntries . mapTo ( enumIrClass . declarations ) { entryDescriptor -> createEnumEntry ( descriptor , entryDescriptor ) } enumClassMembersGenerator . generateSpecialMembers ( enumIrClass ) enumIrClass . addChild ( cEnumCompanionGenerator . generate ( enumIrClass ) ) enumIrClass . addChild ( cEnumVarClassGenerator . generate ( enumIrClass ) ) }","docstring":"/**\n * The main function that for given [descriptor] of the enum generates the whole\n * IR tree including entries, CEnumVar class, and companion objects.\n */"} {"signature":"private fun createValueProperty ( irClass : IrClass ) : IrProperty","body":"{ val propertyDescriptor = irClass . descriptor . findDeclarationByName < PropertyDescriptor > ( \"\" ) ? : error ( \"\" ) val irProperty = createProperty ( propertyDescriptor ) symbolTable . withScope ( irProperty ) { irProperty . backingField = symbolTable . descriptorExtension . declareField ( SYNTHETIC_OFFSET , SYNTHETIC_OFFSET , IrDeclarationOrigin . PROPERTY_BACKING_FIELD , propertyDescriptor , propertyDescriptor . type . toIrType ( ) , DescriptorVisibilities . PRIVATE ) . also { postLinkageSteps . add { it . initializer = irBuiltIns . createIrBuilder ( it . symbol , SYNTHETIC_OFFSET , SYNTHETIC_OFFSET ) . run { irExprBody ( irGet ( irClass . primaryConstructor ! ! . valueParameters [ ] ) ) } } } } val getter = irProperty . getter ! ! getter . correspondingPropertySymbol = irProperty . symbol postLinkageSteps . add { getter . body = irBuiltIns . createIrBuilder ( getter . symbol , SYNTHETIC_OFFSET , SYNTHETIC_OFFSET ) . irBlockBody { + irReturn ( irGetField ( irGet ( getter . dispatchReceiverParameter ! ! ) , irProperty . backingField ! ! ) ) } } return irProperty }","docstring":"/**\n * Creates `value` property that stores integral value of the enum.\n */"} {"signature":"private fun extractEnumEntryValue ( entryDescriptor : ClassDescriptor ) : IrExpression","body":"= cEnumEntryValueTypes . firstNotNullOfOrNull { extractConstantValue ( entryDescriptor , it ) } ? . let { context . constantValueGenerator . generateConstantValueAsExpression ( SYNTHETIC_OFFSET , SYNTHETIC_OFFSET , it ) } ? : error ( \"\" )","docstring":"/**\n * Every enum entry that came from metadata-based interop library is annotated with\n * [kotlinx.cinterop.internal.ConstantValue] annotation that holds internal constant value of the\n * corresponding entry.\n *\n * This function extracts value from the annotation.\n */"} {"signature":"fun < K , V > JavaDStream < Tuple2 < K , V > > . groupByKey ( numPartitions : Int = dstream ( ) . ssc ( ) . sc ( ) . defaultParallelism ( ) , ) : JavaDStream < Tuple2 < K , Iterable < V > > >","body":"= toPairDStream ( ) . groupByKey ( numPartitions ) . toTupleDStream ( )","docstring":"/**\n * Return a new DStream by applying `groupByKey` to each RDD. Hash partitioning is used to\n * generate the RDDs with `numPartitions` partitions.\n */"} {"signature":"fun < K , V > JavaDStream < Tuple2 < K , V > > . groupByKey ( partitioner : Partitioner ) : JavaDStream < Tuple2 < K , Iterable < V > > >","body":"= toPairDStream ( ) . groupByKey ( partitioner ) . toTupleDStream ( )","docstring":"/**\n * Return a new DStream by applying `groupByKey` on each RDD. The supplied\n * org.apache.spark.Partitioner is used to control the partitioning of each RDD.\n */"} {"signature":"fun < K , V > JavaDStream < Tuple2 < K , V > > . reduceByKey ( numPartitions : Int = dstream ( ) . ssc ( ) . sc ( ) . defaultParallelism ( ) , reduceFunc : ( V , V ) -> V , ) : JavaDStream < Tuple2 < K , V > >","body":"= toPairDStream ( ) . reduceByKey ( reduceFunc , numPartitions ) . toTupleDStream ( )","docstring":"/**\n * Return a new DStream by applying `reduceByKey` to each RDD. The values for each key are\n * merged using the supplied reduce function. Hash partitioning is used to generate the RDDs\n * with `numPartitions` partitions.\n */"} {"signature":"fun < K , V > JavaDStream < Tuple2 < K , V > > . reduceByKey ( partitioner : Partitioner , reduceFunc : ( V , V ) -> V , ) : JavaDStream < Tuple2 < K , V > >","body":"= toPairDStream ( ) . reduceByKey ( reduceFunc , partitioner ) . toTupleDStream ( )","docstring":"/**\n * Return a new DStream by applying `reduceByKey` to each RDD. The values for each key are\n * merged using the supplied reduce function. org.apache.spark.Partitioner is used to control\n * the partitioning of each RDD.\n */"} {"signature":"fun < K , V , C > JavaDStream < Tuple2 < K , V > > . combineByKey ( createCombiner : ( V ) -> C , mergeValue : ( C , V ) -> C , mergeCombiner : ( C , C ) -> C , numPartitions : Int = dstream ( ) . ssc ( ) . sc ( ) . defaultParallelism ( ) , mapSideCombine : Boolean = true , ) : JavaDStream < Tuple2 < K , C > >","body":"= toPairDStream ( ) . combineByKey ( createCombiner , mergeValue , mergeCombiner , HashPartitioner ( numPartitions ) , mapSideCombine ) . toTupleDStream ( )","docstring":"/**\n * Combine elements of each key in DStream's RDDs using custom functions. This is similar to the\n * combineByKey for RDDs. Please refer to combineByKey in\n * org.apache.spark.rdd.PairRDDFunctions in the Spark core documentation for more information.\n */"} {"signature":"fun < K , V , C > JavaDStream < Tuple2 < K , V > > . combineByKey ( createCombiner : ( V ) -> C , mergeValue : ( C , V ) -> C , mergeCombiner : ( C , C ) -> C , partitioner : Partitioner , mapSideCombine : Boolean = true , ) : JavaDStream < Tuple2 < K , C > >","body":"= toPairDStream ( ) . combineByKey ( createCombiner , mergeValue , mergeCombiner , partitioner , mapSideCombine ) . toTupleDStream ( )","docstring":"/**\n * Combine elements of each key in DStream's RDDs using custom functions. This is similar to the\n * combineByKey for RDDs. Please refer to combineByKey in\n * org.apache.spark.rdd.PairRDDFunctions in the Spark core documentation for more information.\n */"} {"signature":"fun < K , V > JavaDStream < Tuple2 < K , V > > . groupByKeyAndWindow ( windowDuration : Duration , slideDuration : Duration = dstream ( ) . slideDuration ( ) , numPartitions : Int = dstream ( ) . ssc ( ) . sc ( ) . defaultParallelism ( ) , ) : JavaDStream < Tuple2 < K , Iterable < V > > >","body":"= toPairDStream ( ) . groupByKeyAndWindow ( windowDuration , slideDuration , numPartitions ) . toTupleDStream ( )","docstring":"/**\n * Return a new DStream by applying `groupByKey` over a sliding window on `this` DStream.\n * Similar to `DStream.groupByKey()`, but applies it over a sliding window.\n * Hash partitioning is used to generate the RDDs with `numPartitions` partitions.\n * @param windowDuration width of the window; must be a multiple of this DStream's\n * batching interval\n * @param slideDuration sliding interval of the window (i.e., the interval after which\n * the new DStream will generate RDDs); must be a multiple of this\n * DStream's batching interval\n * @param numPartitions number of partitions of each RDD in the new DStream; if not specified\n * then Spark's default number of partitions will be used\n */"} {"signature":"fun < K , V > JavaDStream < Tuple2 < K , V > > . groupByKeyAndWindow ( windowDuration : Duration , slideDuration : Duration = dstream ( ) . slideDuration ( ) , partitioner : Partitioner , ) : JavaDStream < Tuple2 < K , Iterable < V > > >","body":"= toPairDStream ( ) . groupByKeyAndWindow ( windowDuration , slideDuration , partitioner ) . toTupleDStream ( )","docstring":"/**\n * Create a new DStream by applying `groupByKey` over a sliding window on `this` DStream.\n * Similar to `DStream.groupByKey()`, but applies it over a sliding window.\n * @param windowDuration width of the window; must be a multiple of this DStream's\n * batching interval\n * @param slideDuration sliding interval of the window (i.e., the interval after which\n * the new DStream will generate RDDs); must be a multiple of this\n * DStream's batching interval\n * @param partitioner partitioner for controlling the partitioning of each RDD in the new\n * DStream.\n */"} {"signature":"fun < K , V > JavaDStream < Tuple2 < K , V > > . reduceByKeyAndWindow ( windowDuration : Duration , slideDuration : Duration = dstream ( ) . slideDuration ( ) , numPartitions : Int = dstream ( ) . ssc ( ) . sc ( ) . defaultParallelism ( ) , reduceFunc : ( V , V ) -> V , ) : JavaDStream < Tuple2 < K , V > >","body":"= toPairDStream ( ) . reduceByKeyAndWindow ( reduceFunc , windowDuration , slideDuration , numPartitions ) . toTupleDStream ( )","docstring":"/**\n * Return a new DStream by applying `reduceByKey` over a sliding window. This is similar to\n * `DStream.reduceByKey()` but applies it over a sliding window. Hash partitioning is used to\n * generate the RDDs with `numPartitions` partitions.\n * @param reduceFunc associative and commutative reduce function\n * @param windowDuration width of the window; must be a multiple of this DStream's\n * batching interval\n * @param slideDuration sliding interval of the window (i.e., the interval after which\n * the new DStream will generate RDDs); must be a multiple of this\n * DStream's batching interval\n * @param numPartitions number of partitions of each RDD in the new DStream.\n */"} {"signature":"fun < K , V > JavaDStream < Tuple2 < K , V > > . reduceByKeyAndWindow ( windowDuration : Duration , slideDuration : Duration = dstream ( ) . slideDuration ( ) , partitioner : Partitioner , reduceFunc : ( V , V ) -> V , ) : JavaDStream < Tuple2 < K , V > >","body":"= toPairDStream ( ) . reduceByKeyAndWindow ( reduceFunc , windowDuration , slideDuration , partitioner ) . toTupleDStream ( )","docstring":"/**\n * Return a new DStream by applying `reduceByKey` over a sliding window. Similar to\n * `DStream.reduceByKey()`, but applies it over a sliding window.\n * @param reduceFunc associative and commutative reduce function\n * @param windowDuration width of the window; must be a multiple of this DStream's\n * batching interval\n * @param slideDuration sliding interval of the window (i.e., the interval after which\n * the new DStream will generate RDDs); must be a multiple of this\n * DStream's batching interval\n * @param partitioner partitioner for controlling the partitioning of each RDD\n * in the new DStream.\n */"} {"signature":"fun < K , V > JavaDStream < Tuple2 < K , V > > . reduceByKeyAndWindow ( invReduceFunc : ( V , V ) -> V , windowDuration : Duration , slideDuration : Duration = dstream ( ) . slideDuration ( ) , numPartitions : Int = dstream ( ) . ssc ( ) . sc ( ) . defaultParallelism ( ) , filterFunc : ( ( Tuple2 < K , V > ) -> Boolean ) ? = null , reduceFunc : ( V , V ) -> V , ) : JavaDStream < Tuple2 < K , V > >","body":"= toPairDStream ( ) . reduceByKeyAndWindow ( reduceFunc , invReduceFunc , windowDuration , slideDuration , numPartitions , filterFunc ? . let { { tuple : Tuple2 < K , V > -> filterFunc ( tuple ) } } ) . toTupleDStream ( )","docstring":"/**\n * Return a new DStream by applying incremental `reduceByKey` over a sliding window.\n * The reduced value of over a new window is calculated using the old window's reduced value :\n * 1. reduce the new values that entered the window (e.g., adding new counts)\n *\n * 2. \"inverse reduce\" the old values that left the window (e.g., subtracting old counts)\n *\n * This is more efficient than reduceByKeyAndWindow without \"inverse reduce\" function.\n * However, it is applicable to only \"invertible reduce functions\".\n * Hash partitioning is used to generate the RDDs with Spark's default number of partitions.\n * @param reduceFunc associative and commutative reduce function\n * @param invReduceFunc inverse reduce function; such that for all y, invertible x:\n * `invReduceFunc(reduceFunc(x, y), x) = y`\n * @param windowDuration width of the window; must be a multiple of this DStream's\n * batching interval\n * @param slideDuration sliding interval of the window (i.e., the interval after which\n * the new DStream will generate RDDs); must be a multiple of this\n * DStream's batching interval\n * @param filterFunc Optional function to filter expired key-value pairs;\n * only pairs that satisfy the function are retained\n */"} {"signature":"fun < K , V > JavaDStream < Tuple2 < K , V > > . reduceByKeyAndWindow ( invReduceFunc : ( V , V ) -> V , windowDuration : Duration , slideDuration : Duration = dstream ( ) . slideDuration ( ) , partitioner : Partitioner , filterFunc : ( ( Tuple2 < K , V > ) -> Boolean ) ? = null , reduceFunc : ( V , V ) -> V , ) : JavaDStream < Tuple2 < K , V > >","body":"= toPairDStream ( ) . reduceByKeyAndWindow ( reduceFunc , invReduceFunc , windowDuration , slideDuration , partitioner , filterFunc ? . let { { tuple : Tuple2 < K , V > -> filterFunc ( tuple ) } } ) . toTupleDStream ( )","docstring":"/**\n * Return a new DStream by applying incremental `reduceByKey` over a sliding window.\n * The reduced value of over a new window is calculated using the old window's reduced value :\n * 1. reduce the new values that entered the window (e.g., adding new counts)\n * 2. \"inverse reduce\" the old values that left the window (e.g., subtracting old counts)\n * This is more efficient than reduceByKeyAndWindow without \"inverse reduce\" function.\n * However, it is applicable to only \"invertible reduce functions\".\n * @param reduceFunc associative and commutative reduce function\n * @param invReduceFunc inverse reduce function\n * @param windowDuration width of the window; must be a multiple of this DStream's\n * batching interval\n * @param slideDuration sliding interval of the window (i.e., the interval after which\n * the new DStream will generate RDDs); must be a multiple of this\n * DStream's batching interval\n * @param partitioner partitioner for controlling the partitioning of each RDD in the new\n * DStream.\n * @param filterFunc Optional function to filter expired key-value pairs;\n * only pairs that satisfy the function are retained\n */"} {"signature":"fun < K , V , StateType , MappedType > JavaDStream < Tuple2 < K , V > > . mapWithState ( spec : StateSpec < K , V , StateType , MappedType > , ) : JavaMapWithStateDStream < K , V , StateType , MappedType >","body":"= toPairDStream ( ) . mapWithState ( spec )","docstring":"/**\n * Return a [JavaMapWithStateDStream] by applying a function to every key-value element of\n * `this` stream, while maintaining some state data for each unique key. The mapping function\n * and other specification (e.g. partitioners, timeouts, initial state data, etc.) of this\n * transformation can be specified using `StateSpec` class. The state data is accessible in\n * as a parameter of type `State` in the mapping function.\n *\n * Example of using `mapWithState`:\n * ```kotlin\n * // A mapping function that maintains an integer state and return a String\n * fun mappingFunction(key: String, value: Optional, state: State): Optional {\n * // Use state.exists(), state.get(), state.update() and state.remove()\n * // to manage state, and return the necessary string\n * }\n *\n * val spec = StateSpec.function(::mappingFunction).numPartitions(10)\n *\n * val mapWithStateDStream = keyValueDStream.mapWithState(spec)\n * ```\n *\n * @param spec Specification of this transformation\n * @tparam StateType Class type of the state data\n * @tparam MappedType Class type of the mapped data\n */"} {"signature":"@ JvmName ( \"\" ) fun < K , V , S > JavaDStream < Tuple2 < K , V > > . updateStateByKey ( numPartitions : Int = dstream ( ) . ssc ( ) . sc ( ) . defaultParallelism ( ) , updateFunc : ( List < V > , S ? ) -> S ? , ) : JavaDStream < Tuple2 < K , S > >","body":"= toPairDStream ( ) . updateStateByKey ( { list : List < V > , s : Optional < S > -> updateFunc ( list , s . getOrNull ( ) ) . toOptional ( ) } , numPartitions , ) . toTupleDStream ( )","docstring":"/**\n * Return a new \"state\" DStream where the state for each key is updated by applying\n * the given function on the previous state of the key and the new values of each key.\n * In every batch the updateFunc will be called for each state even if there are no new values.\n * Hash partitioning is used to generate the RDDs with Spark's default number of partitions.\n * Note: Needs checkpoint directory to be set.\n * @param updateFunc State update function. If `this` function returns `null`, then\n * corresponding state key-value pair will be eliminated.\n * @tparam S State type\n */"} {"signature":"@ JvmName ( \"\" ) fun < K , V , S > JavaDStream < Tuple2 < K , V > > . updateStateByKey ( numPartitions : Int = dstream ( ) . ssc ( ) . sc ( ) . defaultParallelism ( ) , updateFunc : ( List < V > , Optional < S > ) -> Optional < S > , ) : JavaDStream < Tuple2 < K , S > >","body":"= toPairDStream ( ) . updateStateByKey ( updateFunc , numPartitions , ) . toTupleDStream ( )","docstring":"/**\n * Return a new \"state\" DStream where the state for each key is updated by applying\n * the given function on the previous state of the key and the new values of each key.\n * In every batch the updateFunc will be called for each state even if there are no new values.\n * Hash partitioning is used to generate the RDDs with Spark's default number of partitions.\n * Note: Needs checkpoint directory to be set.\n * @param updateFunc State update function. If `this` function returns `null`, then\n * corresponding state key-value pair will be eliminated.\n * @tparam S State type\n */"} {"signature":"@ JvmName ( \"\" ) fun < K , V , S > JavaDStream < Tuple2 < K , V > > . updateStateByKey ( partitioner : Partitioner , updateFunc : ( List < V > , S ? ) -> S ? , ) : JavaDStream < Tuple2 < K , S > >","body":"= toPairDStream ( ) . updateStateByKey ( { list : List < V > , s : Optional < S > -> updateFunc ( list , s . getOrNull ( ) ) . toOptional ( ) } , partitioner , ) . toTupleDStream ( )","docstring":"/**\n * Return a new \"state\" DStream where the state for each key is updated by applying\n * the given function on the previous state of the key and the new values of each key.\n * In every batch the updateFunc will be called for each state even if there are no new values.\n * [[org.apache.spark.Partitioner]] is used to control the partitioning of each RDD.\n * Note: Needs checkpoint directory to be set.\n * @param updateFunc State update function. Note, that this function may generate a different\n * tuple with a different key than the input key. Therefore keys may be removed\n * or added in this way. It is up to the developer to decide whether to\n * remember the partitioner despite the key being changed.\n * @param partitioner Partitioner for controlling the partitioning of each RDD in the new\n * DStream\n * @tparam S State type\n */"} {"signature":"fun < K , V , S > JavaDStream < Tuple2 < K , V > > . updateStateByKey ( partitioner : Partitioner , updateFunc : ( List < V > , Optional < S > ) -> Optional < S > , ) : JavaDStream < Tuple2 < K , S > >","body":"= toPairDStream ( ) . updateStateByKey ( updateFunc , partitioner , ) . toTupleDStream ( )","docstring":"/**\n * Return a new \"state\" DStream where the state for each key is updated by applying\n * the given function on the previous state of the key and the new values of each key.\n * In every batch the updateFunc will be called for each state even if there are no new values.\n * [[org.apache.spark.Partitioner]] is used to control the partitioning of each RDD.\n * Note: Needs checkpoint directory to be set.\n * @param updateFunc State update function. Note, that this function may generate a different\n * tuple with a different key than the input key. Therefore keys may be removed\n * or added in this way. It is up to the developer to decide whether to\n * remember the partitioner despite the key being changed.\n * @param partitioner Partitioner for controlling the partitioning of each RDD in the new\n * DStream\n * @tparam S State type\n */"} {"signature":"@ JvmName ( \"\" ) fun < K , V , S > JavaDStream < Tuple2 < K , V > > . updateStateByKey ( partitioner : Partitioner , initialRDD : JavaRDD < Tuple2 < K , S > > , updateFunc : ( List < V > , S ? ) -> S ? , ) : JavaDStream < Tuple2 < K , S > >","body":"= toPairDStream ( ) . updateStateByKey ( { list : List < V > , s : Optional < S > -> updateFunc ( list , s . getOrNull ( ) ) . toOptional ( ) } , partitioner , initialRDD . toJavaPairRDD ( ) , ) . toTupleDStream ( )","docstring":"/**\n * Return a new \"state\" DStream where the state for each key is updated by applying\n * the given function on the previous state of the key and the new values of the key.\n * org.apache.spark.Partitioner is used to control the partitioning of each RDD.\n * Note: Needs checkpoint directory to be set.\n * @param updateFunc State update function. If `this` function returns `null`, then\n * corresponding state key-value pair will be eliminated.\n * @param partitioner Partitioner for controlling the partitioning of each RDD in the new\n * DStream.\n * @param initialRDD initial state value of each key.\n * @tparam S State type\n */"} {"signature":"fun < K , V , S > JavaDStream < Tuple2 < K , V > > . updateStateByKey ( partitioner : Partitioner , initialRDD : JavaRDD < Tuple2 < K , S > > , updateFunc : ( List < V > , Optional < S > ) -> Optional < S > , ) : JavaDStream < Tuple2 < K , S > >","body":"= toPairDStream ( ) . updateStateByKey ( updateFunc , partitioner , initialRDD . toJavaPairRDD ( ) , ) . toTupleDStream ( )","docstring":"/**\n * Return a new \"state\" DStream where the state for each key is updated by applying\n * the given function on the previous state of the key and the new values of the key.\n * org.apache.spark.Partitioner is used to control the partitioning of each RDD.\n * Note: Needs checkpoint directory to be set.\n * @param updateFunc State update function. If `this` function returns `null`, then\n * corresponding state key-value pair will be eliminated.\n * @param partitioner Partitioner for controlling the partitioning of each RDD in the new\n * DStream.\n * @param initialRDD initial state value of each key.\n * @tparam S State type\n */"} {"signature":"fun < K , V , U > JavaDStream < Tuple2 < K , V > > . mapValues ( mapValuesFunc : ( V ) -> U , ) : JavaDStream < Tuple2 < K , U > >","body":"= toPairDStream ( ) . mapValues ( mapValuesFunc ) . toTupleDStream ( )","docstring":"/**\n * Return a new DStream by applying a map function to the value of each key-value pairs in\n * 'this' DStream without changing the key.\n */"} {"signature":"fun < K , V , U > JavaDStream < Tuple2 < K , V > > . flatMapValues ( flatMapValuesFunc : ( V ) -> Iterator < U > , ) : JavaDStream < Tuple2 < K , U > >","body":"= toPairDStream ( ) . flatMapValues ( flatMapValuesFunc ) . toTupleDStream ( )","docstring":"/**\n * Return a new DStream by applying a flatmap function to the value of each key-value pairs in\n * 'this' DStream without changing the key.\n */"} {"signature":"fun < K , V , W > JavaDStream < Tuple2 < K , V > > . cogroup ( other : JavaDStream < Tuple2 < K , W > > , numPartitions : Int = dstream ( ) . ssc ( ) . sc ( ) . defaultParallelism ( ) , ) : JavaDStream < Tuple2 < K , Tuple2 < Iterable < V > , Iterable < W > > > >","body":"= toPairDStream ( ) . cogroup ( other . toPairDStream ( ) , numPartitions , ) . toTupleDStream ( )","docstring":"/**\n * Return a new DStream by applying 'cogroup' between RDDs of `this` DStream and `other` DStream.\n * Hash partitioning is used to generate the RDDs with `numPartitions` partitions.\n */"} {"signature":"fun < K , V , W > JavaDStream < Tuple2 < K , V > > . cogroup ( other : JavaDStream < Tuple2 < K , W > > , partitioner : Partitioner , ) : JavaDStream < Tuple2 < K , Tuple2 < Iterable < V > , Iterable < W > > > >","body":"= toPairDStream ( ) . cogroup ( other . toPairDStream ( ) , partitioner , ) . toTupleDStream ( )","docstring":"/**\n * Return a new DStream by applying 'cogroup' between RDDs of `this` DStream and `other` DStream.\n * The supplied org.apache.spark.Partitioner is used to partition the generated RDDs.\n */"} {"signature":"fun < K , V , W > JavaDStream < Tuple2 < K , V > > . join ( other : JavaDStream < Tuple2 < K , W > > , numPartitions : Int = dstream ( ) . ssc ( ) . sc ( ) . defaultParallelism ( ) , ) : JavaDStream < Tuple2 < K , Tuple2 < V , W > > >","body":"= toPairDStream ( ) . join ( other . toPairDStream ( ) , numPartitions , ) . toTupleDStream ( )","docstring":"/**\n * Return a new DStream by applying 'join' between RDDs of `this` DStream and `other` DStream.\n * Hash partitioning is used to generate the RDDs with `numPartitions` partitions.\n */"} {"signature":"fun < K , V , W > JavaDStream < Tuple2 < K , V > > . join ( other : JavaDStream < Tuple2 < K , W > > , partitioner : Partitioner , ) : JavaDStream < Tuple2 < K , Tuple2 < V , W > > >","body":"= toPairDStream ( ) . join ( other . toPairDStream ( ) , partitioner , ) . toTupleDStream ( )","docstring":"/**\n * Return a new DStream by applying 'join' between RDDs of `this` DStream and `other` DStream.\n * The supplied org.apache.spark.Partitioner is used to control the partitioning of each RDD.\n */"} {"signature":"fun < K , V , W > JavaDStream < Tuple2 < K , V > > . leftOuterJoin ( other : JavaDStream < Tuple2 < K , W > > , numPartitions : Int = dstream ( ) . ssc ( ) . sc ( ) . defaultParallelism ( ) , ) : JavaDStream < Tuple2 < K , Tuple2 < V , Optional < W > > > >","body":"= toPairDStream ( ) . leftOuterJoin ( other . toPairDStream ( ) , numPartitions , ) . toTupleDStream ( )","docstring":"/**\n * Return a new DStream by applying 'left outer join' between RDDs of `this` DStream and\n * `other` DStream. Hash partitioning is used to generate the RDDs with `numPartitions`\n * partitions.\n */"} {"signature":"fun < K , V , W > JavaDStream < Tuple2 < K , V > > . leftOuterJoin ( other : JavaDStream < Tuple2 < K , W > > , partitioner : Partitioner , ) : JavaDStream < Tuple2 < K , Tuple2 < V , Optional < W > > > >","body":"= toPairDStream ( ) . leftOuterJoin ( other . toPairDStream ( ) , partitioner , ) . toTupleDStream ( )","docstring":"/**\n * Return a new DStream by applying 'left outer join' between RDDs of `this` DStream and\n * `other` DStream. The supplied org.apache.spark.Partitioner is used to control\n * the partitioning of each RDD.\n */"} {"signature":"fun < K , V , W > JavaDStream < Tuple2 < K , V > > . rightOuterJoin ( other : JavaDStream < Tuple2 < K , W > > , numPartitions : Int = dstream ( ) . ssc ( ) . sc ( ) . defaultParallelism ( ) , ) : JavaDStream < Tuple2 < K , Tuple2 < Optional < V > , W > > >","body":"= toPairDStream ( ) . rightOuterJoin ( other . toPairDStream ( ) , numPartitions , ) . toTupleDStream ( )","docstring":"/**\n * Return a new DStream by applying 'right outer join' between RDDs of `this` DStream and\n * `other` DStream. Hash partitioning is used to generate the RDDs with `numPartitions`\n * partitions.\n */"} {"signature":"fun < K , V , W > JavaDStream < Tuple2 < K , V > > . rightOuterJoin ( other : JavaDStream < Tuple2 < K , W > > , partitioner : Partitioner , ) : JavaDStream < Tuple2 < K , Tuple2 < Optional < V > , W > > >","body":"= toPairDStream ( ) . rightOuterJoin ( other . toPairDStream ( ) , partitioner , ) . toTupleDStream ( )","docstring":"/**\n * Return a new DStream by applying 'right outer join' between RDDs of `this` DStream and\n * `other` DStream. The supplied org.apache.spark.Partitioner is used to control\n * the partitioning of each RDD.\n */"} {"signature":"fun < K , V , W > JavaDStream < Tuple2 < K , V > > . fullOuterJoin ( other : JavaDStream < Tuple2 < K , W > > , numPartitions : Int = dstream ( ) . ssc ( ) . sc ( ) . defaultParallelism ( ) , ) : JavaDStream < Tuple2 < K , Tuple2 < Optional < V > , Optional < W > > > >","body":"= toPairDStream ( ) . fullOuterJoin ( other . toPairDStream ( ) , numPartitions , ) . toTupleDStream ( )","docstring":"/**\n * Return a new DStream by applying 'full outer join' between RDDs of `this` DStream and\n * `other` DStream. Hash partitioning is used to generate the RDDs with `numPartitions`\n * partitions.\n */"} {"signature":"fun < K , V , W > JavaDStream < Tuple2 < K , V > > . fullOuterJoin ( other : JavaDStream < Tuple2 < K , W > > , partitioner : Partitioner , ) : JavaDStream < Tuple2 < K , Tuple2 < Optional < V > , Optional < W > > > >","body":"= toPairDStream ( ) . fullOuterJoin ( other . toPairDStream ( ) , partitioner , ) . toTupleDStream ( )","docstring":"/**\n * Return a new DStream by applying 'full outer join' between RDDs of `this` DStream and\n * `other` DStream. The supplied org.apache.spark.Partitioner is used to control\n * the partitioning of each RDD.\n */"} {"signature":"fun < K , V > JavaDStream < Tuple2 < K , V > > . saveAsHadoopFiles ( prefix : String , suffix : String , ) : Unit","body":"= toPairDStream ( ) . saveAsHadoopFiles ( prefix , suffix )","docstring":"/**\n * Save each RDD in `this` DStream as a Hadoop file. The file name at each batch interval is\n * generated based on `prefix` and `suffix`: \"prefix-TIME_IN_MS.suffix\".\n */"} {"signature":"fun < K , V > JavaDStream < Tuple2 < K , V > > . saveAsNewAPIHadoopFiles ( prefix : String , suffix : String , ) : Unit","body":"= toPairDStream ( ) . saveAsNewAPIHadoopFiles ( prefix , suffix )","docstring":"/**\n * Save each RDD in `this` DStream as a Hadoop file. The file name at each batch interval is\n * generated based on `prefix` and `suffix`: \"prefix-TIME_IN_MS.suffix\".\n */"} {"signature":"fun require ( request : String ) : String","body":"{ return modules . require ( request ) }","docstring":"/**\n * Require [request] nodejs module and return canonical path to it's main js file.\n */"} {"signature":"internal fun resolve ( name : String ) : File ?","body":"= modules . resolve ( name )","docstring":"/**\n * Find node module according to https://nodejs.org/api/modules.html#modules_all_together,\n * with exception that instead of traversing parent folders, we are traversing parent projects\n */"} {"signature":"fun postponeForeignAnnotationResolution ( symbol : FirBasedSymbol < * > )","body":"{ val symbolToPostpone = symbol . symbolToPostponeIfCanBeResolvedOnDemand ( ) ? : return val currentSymbol = anchorForForeignAnnotations ? : errorWithAttachment ( \"\" ) { withFirSymbolEntry ( \"\" , symbolToPostpone ) } if ( currentSymbol == symbolToPostpone ) return postponedSymbols . put ( currentSymbol , symbolToPostpone ) }","docstring":"/**\n * Postpone the resolution request to [symbol] until [annotation arguments][FirResolvePhase.ANNOTATION_ARGUMENTS] phase\n * of the declaration which is used this foreign annotation.\n *\n * @see postponedSymbols\n */"} {"signature":"fun postponedSymbols ( target : FirCallableDeclaration ) : Collection < FirBasedSymbol < * > >","body":"{ return postponedSymbols [ target . symbol ] }","docstring":"/**\n * @return all symbols postponed with [postponeForeignAnnotationResolution] for the [target] element\n *\n * @see postponeForeignAnnotationResolution\n */"} {"signature":"fun pushCycledSymbol ( symbol : FirCallableSymbol < * > )","body":"{ requireWithAttachment ( cycledSymbol == null , { \"\" } ) cycledSymbol = symbol }","docstring":"/**\n * Push [symbol] with a recursion return type to be able to report it later\n *\n * @param symbol is a symbol with the recursion error in the return type\n *\n * @see popCycledSymbolIfExists\n * @see LLFirImplicitBodyTargetResolver.handleCycleInResolution\n */"} {"signature":"fun popCycledSymbolIfExists ( ) : FirCallableSymbol < * > ?","body":"= cycledSymbol ? . also { cycledSymbol = null }","docstring":"/**\n * Pop [FirCallableSymbol] with a recursion return type if it was [pushed][pushCycledSymbol]\n *\n * @see pushCycledSymbol\n * @see org.jetbrains.kotlin.analysis.low.level.api.fir.element.builder.LLFirReturnTypeCalculatorWithJump.resolveDeclaration\n */"} {"signature":"override fun handleCycleInResolution ( target : FirElementWithResolveState )","body":"{ requireWithAttachment ( target is FirCallableDeclaration , { \"\" } ) { withFirEntry ( \"\" , target ) } llImplicitBodyResolveComputationSession . pushCycledSymbol ( target . symbol ) }","docstring":"/**\n * @see org.jetbrains.kotlin.analysis.low.level.api.fir.element.builder.LLFirReturnTypeCalculatorWithJump.resolveDeclaration\n */"} {"signature":"fun < T , R , T1 : T > Tuple1 < T1 > . map ( func : ( T ) -> R ) : Tuple1 < R >","body":"= Tuple1 < R > ( func ( this . _1 ( ) ) )","docstring":"/**\n * This file provides map-functions to all Tuple variants.\n * Given a tuple `t(a1, ..., an)`, returns a new tuple `t(func(a1), ..., func(an))`.\n * Compared to Scala 3, no type mapping can occur in Kotlin, so to create a `TupleX`\n * the user will need to explicitly [cast] the result.\n *\n * For example:\n * ```kotlin\n * val myTuple: Tuple4 = t(1, \"3\", 2, \"4\")\n * val myStringTuple: Tuple4 = myTuple.map {\n * when (it) {\n * is Int -> it.toString()\n * is String -> it.toInt()\n * else -> error(\"\")\n * }\n * }.cast()\n * ```\n */"} {"signature":"@ ExperimentalSerializationApi public fun SerializersModule . getContextualDescriptor ( descriptor : SerialDescriptor ) : SerialDescriptor ?","body":"= descriptor . capturedKClass ? . let { klass -> getContextual ( klass ) ? . descriptor }","docstring":"/**\n * Looks up a descriptor of serializer registered for contextual serialization in [this],\n * using [SerialDescriptor.capturedKClass] as a key.\n *\n * @see SerializersModuleBuilder.contextual\n */"} {"signature":"@ ExperimentalSerializationApi public fun SerializersModule . getPolymorphicDescriptors ( descriptor : SerialDescriptor ) : List < SerialDescriptor >","body":"{ val kClass = descriptor . capturedKClass ? : return emptyList ( ) return ( this as SerialModuleImpl ) . polyBase2Serializers [ kClass ] ? . values . orEmpty ( ) . map { it . descriptor } }","docstring":"/**\n * Retrieves a collection of descriptors which serializers are registered for polymorphic serialization in [this]\n * with base class equal to [descriptor]'s [SerialDescriptor.capturedKClass].\n * This method does not retrieve serializers registered with [PolymorphicModuleBuilder.defaultDeserializer]\n * or [PolymorphicModuleBuilder.defaultSerializer].\n *\n * @see SerializersModule.getPolymorphic\n * @see SerializersModuleBuilder.polymorphic\n */"} {"signature":"internal fun SerialDescriptor . withContext ( context : KClass < * > ) : SerialDescriptor","body":"= ContextDescriptor ( this , context )","docstring":"/**\n * Wraps [this] in [ContextDescriptor].\n */"} {"signature":"public open fun decodeValue ( ) : Any","body":"= throw SerializationException ( \"\" )","docstring":"/**\n * Invoked to decode a value when specialized `decode*` method was not overridden.\n */"} {"signature":"fun existsSync ( path : String ) : Boolean","body":"fun existsSync ( path : String ) : Boolean","docstring":"/**\n * See https://nodejs.org/api/fs.html#fsexistssyncpath\n */"} {"signature":"fun mkdirSync ( path : String ) : Boolean","body":"fun mkdirSync ( path : String ) : Boolean","docstring":"/**\n * See https://nodejs.org/api/fs.html#fsmkdirsyncpath-options\n */"} {"signature":"fun renameSync ( from : String , to : String )","body":"fun renameSync ( from : String , to : String )","docstring":"/**\n * See https://nodejs.org/api/fs.html#fsrenamesyncoldpath-newpath\n */"} {"signature":"fun rmdirSync ( path : String )","body":"fun rmdirSync ( path : String )","docstring":"/**\n * See https://nodejs.org/api/fs.html#fsrmdirsyncpath-options\n */"} {"signature":"fun rmSync ( path : String )","body":"fun rmSync ( path : String )","docstring":"/**\n * See https://nodejs.org/api/fs.html#fsrmsyncpath-options\n */"} {"signature":"fun statSync ( path : String ) : Stats ?","body":"fun statSync ( path : String ) : Stats ?","docstring":"/**\n * See https://nodejs.org/api/fs.html#fsstatsyncpath-options\n */"} {"signature":"fun openSync ( path : String , mode : String ) : Int","body":"fun openSync ( path : String , mode : String ) : Int","docstring":"/**\n * See https://nodejs.org/api/fs.html#fsopensyncpath-flags-mode\n */"} {"signature":"fun closeSync ( fd : Int )","body":"fun closeSync ( fd : Int )","docstring":"/**\n * See https://nodejs.org/api/fs.html#fsclosesyncfd\n */"} {"signature":"fun readFileSync ( fd : Int , options : String ? ) : Buffer","body":"fun readFileSync ( fd : Int , options : String ? ) : Buffer","docstring":"/**\n * See https://nodejs.org/api/fs.html#fsreadfilesyncpath-options\n */"} {"signature":"fun writeFileSync ( fd : Int , buffer : Buffer )","body":"fun writeFileSync ( fd : Int , buffer : Buffer )","docstring":"/**\n * See https://nodejs.org/api/fs.html#fswritefilesyncfile-data-options\n */"} {"signature":"public fun assertHtmlEqualsIgnoringWhitespace ( expected : String , actual : String )","body":"{ val ignoreFormattingSettings = Document . OutputSettings ( ) . indentAmount ( ) . outline ( true ) assertEquals ( Jsoup . parse ( expected ) . outputSettings ( ignoreFormattingSettings ) . outerHtml ( ) . trimSpacesAtTheEndOfLine ( ) , Jsoup . parse ( actual ) . outputSettings ( ignoreFormattingSettings ) . outerHtml ( ) . trimSpacesAtTheEndOfLine ( ) ) }","docstring":"/**\n * Parses it using JSOUP, trims whitespace at the end of the line and asserts if they are equal\n * parsing is required to unify the formatting\n */"} {"signature":"final override fun addSubtypeConstraint ( subType : KotlinTypeMarker , superType : KotlinTypeMarker , isFromNullabilityConstraint : Boolean ) : Boolean ?","body":"{ val hasNoInfer = subType . isTypeVariableWithNoInfer ( ) || superType . isTypeVariableWithNoInfer ( ) if ( hasNoInfer ) return true val hasExact = subType . isTypeVariableWithExact ( ) || superType . isTypeVariableWithExact ( ) val mySubType = if ( hasExact ) extractTypeForProjectedType ( subType , out = true ) ? : with ( extensionTypeContext ) { subType . removeExactAnnotation ( ) } else subType val mySuperType = if ( hasExact ) extractTypeForProjectedType ( superType , out = false ) ? : with ( extensionTypeContext ) { superType . removeExactAnnotation ( ) } else superType val result = internalAddSubtypeConstraint ( mySubType , mySuperType , isFromNullabilityConstraint ) if ( ! hasExact ) return result val result2 = internalAddSubtypeConstraint ( mySuperType , mySubType , isFromNullabilityConstraint ) if ( result == null && result2 == null ) return null return ( result ? : true ) && ( result2 ? : true ) }","docstring":"/**\n * todo: possible we should override this method, because otherwise OR in subtyping transformed to AND in constraint system\n * Now we cannot do this, because sometimes we have proper intersection type as lower type and if we first supertype,\n * then we can get wrong result.\n * override val sameConstructorPolicy get() = SeveralSupertypesWithSameConstructorPolicy.TAKE_FIRST_FOR_SUBTYPING\n */"} {"signature":"private fun simplifyLowerConstraint ( typeVariable : KotlinTypeMarker , subType : KotlinTypeMarker , isFromNullabilityConstraint : Boolean = false ) : Boolean","body":"= with ( extensionTypeContext ) { val subTypeConstructor = subType . typeConstructor ( ) val lowerConstraint = when ( typeVariable ) { is SimpleTypeMarker -> when { isK2 && typeVariable . isDefinitelyNotNullType ( ) && ! subTypeConstructor . isTypeVariable ( ) && ! AbstractNullabilityChecker . isSubtypeOfAny ( extensionTypeContext , subType ) -> { return false } typeVariable . isMarkedNullable ( ) -> { val typeVariableTypeConstructor = typeVariable . typeConstructor ( ) val needToMakeDefNotNull = subTypeConstructor . isTypeVariable ( ) || typeVariableTypeConstructor !is TypeVariableTypeConstructorMarker || ! typeVariableTypeConstructor . isContainedInInvariantOrContravariantPositions ( ) val resultType = if ( needToMakeDefNotNull ) { subType . makeDefinitelyNotNullOrNotNull ( ) } else { if ( ! isInferenceCompatibilityEnabled && subType is CapturedTypeMarker ) { subType . withNotNullProjection ( ) } else { subType . withNullability ( false ) } } if ( isInferenceCompatibilityEnabled && resultType is CapturedTypeMarker ) resultType . withNotNullProjection ( ) else resultType } else -> subType } is FlexibleTypeMarker -> { assertFlexibleTypeVariable ( typeVariable ) when ( subType ) { is SimpleTypeMarker -> when { useRefinedBoundsForTypeVariableInFlexiblePosition ( ) -> createFlexibleType ( subType . makeSimpleTypeDefinitelyNotNullOrNotNull ( ) , subType . withNullability ( true ) ) subType . isMarkedNullable ( ) -> subType else -> createFlexibleType ( subType , subType . withNullability ( true ) ) } is FlexibleTypeMarker -> when { useRefinedBoundsForTypeVariableInFlexiblePosition ( ) -> createFlexibleType ( subType . lowerBound ( ) . makeSimpleTypeDefinitelyNotNullOrNotNull ( ) , subType . upperBound ( ) . withNullability ( true ) ) else -> createFlexibleType ( subType . lowerBound ( ) . makeSimpleTypeDefinitelyNotNullOrNotNull ( ) , subType . upperBound ( ) ) } else -> error ( \"\" ) } } else -> error ( \"\" ) } addLowerConstraint ( typeVariable . typeConstructor ( ) , lowerConstraint , isFromNullabilityConstraint ) return true }","docstring":"/**\n * Foo <: T -- leave as is\n *\n * T?\n *\n * Foo <: T? -- Foo & Any <: T\n * Foo? <: T? -- Foo? & Any <: T -- Foo & Any <: T\n * (Foo..Bar) <: T? -- (Foo..Bar) & Any <: T\n *\n * T!\n *\n * Foo <: T! --\n * assert T! == (T..T?)\n * Foo <: T?\n * Foo <: T (optional constraint, needs to preserve nullability)\n * =>\n * Foo & Any <: T\n * Foo <: T\n * =>\n * (Foo & Any .. Foo) <: T -- (Foo!! .. Foo) <: T\n *\n * => Foo <: T! -- (Foo!! .. Foo) <: T\n *\n * Foo? <: T! -- Foo? <: T\n *\n *\n * (Foo..Bar) <: T! --\n * assert T! == (T..T?)\n * (Foo..Bar) <: (T..T?)\n * =>\n * Foo <: T?\n * Bar <: T (optional constraint, needs to preserve nullability)\n * =>\n * (Foo & Any .. Bar) <: T -- (Foo!! .. Bar) <: T\n *\n * => (Foo..Bar) <: T! -- (Foo!! .. Bar) <: T\n *\n * T & Any\n *\n * Foo? <: T & Any => ERROR (for K2 only)\n *\n * Foo..Bar? <: T & Any => Foo..Bar? <: T\n * Foo <: T & Any => Foo <: T\n */"} {"signature":"private fun simplifyUpperConstraint ( typeVariable : KotlinTypeMarker , superType : KotlinTypeMarker ) : Boolean","body":"= with ( extensionTypeContext ) { val typeVariableLowerBound = typeVariable . lowerBoundIfFlexible ( ) val simplifiedSuperType = when { typeVariable . isFlexible ( ) && useRefinedBoundsForTypeVariableInFlexiblePosition ( ) -> createFlexibleType ( superType . lowerBoundIfFlexible ( ) . makeSimpleTypeDefinitelyNotNullOrNotNull ( ) , superType . upperBoundIfFlexible ( ) . withNullability ( true ) ) typeVariableLowerBound . isDefinitelyNotNullType ( ) -> { superType . withNullability ( true ) } typeVariable . isFlexible ( ) && superType is SimpleTypeMarker -> createFlexibleType ( superType , superType . withNullability ( true ) ) else -> superType } addUpperConstraint ( typeVariableLowerBound . typeConstructor ( ) , simplifiedSuperType ) if ( typeVariableLowerBound . isMarkedNullable ( ) ) { return simplifiedSuperType . anyBound ( :: isMyTypeVariable ) || isSubtypeOfByTypeChecker ( nullableNothingType ( ) , simplifiedSuperType ) } return true }","docstring":"/**\n * T! <: Foo <=> T <: Foo & Any..Foo?\n * T? <: Foo <=> T <: Foo && Nothing? <: Foo\n * T <: Foo -- leave as is\n * T & Any <: Foo <=> T <: Foo?\n */"} {"signature":"fun replaceVariables ( mapping : Map < String , String > ) : T","body":"fun replaceVariables ( mapping : Map < String , String > ) : T","docstring":"/**\n * Replace variables and return the result.\n *\n * @param mapping maps variables names to their values\n * @return instance with substituted variables\n */"} {"signature":"private fun getFunctionDefinitionImpl ( call : JsInvocation , scope : InliningScope ) : InlineFunctionDefinition ?","body":"{ assert ( scope . fragment in fragmentInfo ) return lookUpFunctionDirect ( call , scope ) ? : lookUpFunctionIndirect ( call , scope ) ? : lookUpFunctionExternal ( call , scope . fragment ) }","docstring":"/**\n * Gets function definition by invocation.\n *\n * Notes:\n * 1. Qualifier -- [()/.call()] part of invocation.\n * 2. Local functions are compiled like function literals,\n * but called not directly, but through variable.\n *\n * For example, local `fun f(a, b) = a + b; f(1, 2)` becomes `var f = _.foo.f$; f(1, 2)`\n *\n * Invocation properties:\n * 1. Ends with either [()/.call()].\n *\n * 2. Qualifier can be JsNameRef with static ref to JsFunction\n * in case of function literal without closure.\n *\n * For example, qualifier == _.foo.lambda$\n *\n * 3. Qualifier can be JsInvocation with static ref to JsFunction\n * in case of function literal with closure. In this case\n * qualifier arguments are captured in closure.\n *\n * For example, qualifier == _.foo.lambda(captured_1)\n *\n * 4. Qualifier can be JsNameRef with static ref to case [2]\n * in case of local function without closure.\n *\n * 5. Qualifier can be JsNameRef with ref to case [3]\n * in case of local function with closure.\n */"} {"signature":"public fun progress ( message : String )","body":"public fun progress ( message : String )","docstring":"/**\n * This level is for showing significant execution steps.\n *\n * What could be considered `progress`:\n * - Documentation generation started\n * - Documentation generation has successfully finished\n *\n * What could not be considered `progress`:\n * - Processing submodules\n * - Transforming pages\n *\n * These can be shown by default if there is no other way to track progress (like Gradle's progress bar),\n * and should be at the same level or one of the debug levels otherwise.\n *\n * Dokka's `progress` maps to:\n *\n * * CLI - shown by default\n * * Gradle - `info`\n * * Maven - `debug`\n */"} {"signature":"public fun debug ( message : String )","body":"public fun debug ( message : String )","docstring":"/**\n * This level is for logging non-user actionable messages,\n * like internal errors that cannot be fixed/worked around by users themselves or atomic generation steps.\n * These outputs could be attached to particular Dokka issues, so that the Dokka team could analyze them.\n *\n * What could be considered `debug`:\n * * Processing submodules\n * * Transforming\n *\n * What could not be considered `debug`:\n * * Cannot resolve a sample for $functionName: $fqLink\n *\n * Dokka's `debug` maps to:\n * * CLI - `debug`\n * * Gradle - `debug`\n * * Maven - `debug`\n */"} {"signature":"public fun info ( message : String )","body":"public fun info ( message : String )","docstring":"/**\n * This level is for logging useful messages about Dokka usage.\n *\n * What could be considered `info`:\n * * The HTML output is generated here: \n *\n * What could not be considered `info`:\n * * Cannot resolve a sample for $functionName: $fqLink\n *\n * Dokka's `info` maps to:\n * * CLI - shown by default\n * * Gradle - `info`\n * * Maven - `info`\n */"} {"signature":"public fun warn ( message : String )","body":"public fun warn ( message : String )","docstring":"/**\n * This level is for logging messages about issues during the documentation generation,\n * which do not stop the generation with an error but somehow affect the final result.\n * For example, if a particular source link could not be rendered.\n * It is mandatory for the messages of this level to be understandable to the user.\n *\n * What could be considered a `warn`:\n * * Cannot resolve a sample for $functionName: $fqLink. Please check the comments for the function.\n * The link should be formed according to the following rules:...\n *\n * What could not be considered a `warn`:\n * * Dokka is performing: $generationName\n *\n * Dokka's `warn` maps to:\n * * CLI - `warn`\n * * Gradle - `warn`\n * * Maven - `warn`\n */"} {"signature":"public fun error ( message : String )","body":"public fun error ( message : String )","docstring":"/**\n * This level is for logging error messages that describe what prevented Dokka from proceeding\n * with successful documentation generation. Likely, users will submit these error messages to Dokka's issues.\n *\n * What could be considered an `error`:\n * * Something went wrong, and the generation could not be performed. Please report it to the Dokka team.\n *\n * What could not be considered an `error`:\n * * Cannot resolve a sample for $functionName: $fqLink. Please check the comments for the function.\n * The link should be formed according to the following rules:...\n *\n * Dokka's `error` maps to:\n * * CLI - `error`\n * * Gradle - `error`\n * * Maven - `error`\n */"} {"signature":"@ Composable fun JetsnackSurface ( modifier : Modifier = Modifier , shape : Shape = RectangleShape , color : Color = JetsnackTheme . colors . uiBackground , contentColor : Color = JetsnackTheme . colors . textSecondary , border : BorderStroke ? = null , elevation : Dp = . dp , content : @ Composable ( ) -> Unit )","body":"{ Box ( modifier = modifier . shadow ( elevation = elevation , shape = shape , clip = false ) . zIndex ( elevation . value ) . then ( if ( border != null ) Modifier . border ( border , shape ) else Modifier ) . background ( color = getBackgroundColorForElevation ( color , elevation ) , shape = shape ) . clip ( shape ) ) { CompositionLocalProvider ( LocalContentColor provides contentColor , content = content ) } }","docstring":"/**\n * An alternative to [androidx.compose.material.Surface] utilizing\n * [com.example.jetsnack.ui.theme.JetsnackColors]\n */"} {"signature":"private fun Color . withElevation ( elevation : Dp ) : Color","body":"{ val foreground = calculateForeground ( elevation ) return foreground . compositeOver ( this ) }","docstring":"/**\n * Applies a [Color.White] overlay to this color based on the [elevation]. This increases visibility\n * of elevation for surfaces in a dark theme.\n *\n * TODO: Remove when public https://issuetracker.google.com/155181601\n */"} {"signature":"private fun calculateForeground ( elevation : Dp ) : Color","body":"{ val alpha = ( ( * ln ( elevation . value + ) ) + ) / return Color . White . copy ( alpha = alpha ) }","docstring":"/**\n * @return the alpha-modified [Color.White] to overlay on top of the surface color to produce\n * the resultant color.\n */"} {"signature":"@ kotlin . internal . InlineOnly public inline fun < T > Iterable ( crossinline iterator : ( ) -> Iterator < T > ) : Iterable < T >","body":"= object : Iterable < T > { override fun iterator ( ) : Iterator < T > = iterator ( ) }","docstring":"/**\n * Given an [iterator] function constructs an [Iterable] instance that returns values through the [Iterator]\n * provided by that function.\n * @sample samples.collections.Iterables.Building.iterable\n */"} {"signature":"@ PublishedApi internal fun < T > Iterable < T > . collectionSizeOrNull ( ) : Int ?","body":"= if ( this is Collection < * > ) this . size else null","docstring":"/**\n * Returns the size of this iterable if it is known, or `null` otherwise.\n */"} {"signature":"@ PublishedApi internal fun < T > Iterable < T > . collectionSizeOrDefault ( default : Int ) : Int","body":"= if ( this is Collection < * > ) this . size else default","docstring":"/**\n * Returns the size of this iterable if it is known, or the specified [default] value otherwise.\n */"} {"signature":"public fun < T > Iterable < Iterable < T > > . flatten ( ) : List < T >","body":"{ val result = ArrayList < T > ( ) for ( element in this ) { result . addAll ( element ) } return result }","docstring":"/**\n * Returns a single list of all elements from all collections in the given collection.\n * @sample samples.collections.Iterables.Operations.flattenIterable\n */"} {"signature":"public fun < T , R > Iterable < Pair < T , R > > . unzip ( ) : Pair < List < T > , List < R > >","body":"{ val expectedSize = collectionSizeOrDefault ( ) val listT = ArrayList < T > ( expectedSize ) val listR = ArrayList < R > ( expectedSize ) for ( pair in this ) { listT . add ( pair . first ) listR . add ( pair . second ) } return listT to listR }","docstring":"/**\n * Returns a pair of lists, where\n * *first* list is built from the first values of each pair from this collection,\n * *second* list is built from the second values of each pair from this collection.\n * @sample samples.collections.Iterables.Operations.unzipIterable\n */"} {"signature":"fun compilerOptions ( configure : CO . ( ) -> Unit )","body":"{ configure ( compilerOptions ) }","docstring":"/**\n * Configures the [compilerOptions] with the provided configuration.\n */"} {"signature":"fun compilerOptions ( configure : Action < in CO > )","body":"{ configure . execute ( compilerOptions ) }","docstring":"/**\n * Configures the [compilerOptions] with the provided configuration.\n */"} {"signature":"public fun PsiElement . canBeAnalysed ( ) : Boolean","body":"= withValidityAssertion { analysisSession . analysisScopeProvider . canBeAnalysed ( this ) }","docstring":"/**\n * Checks if [PsiElement] is inside analysis scope.\n * That means [org.jetbrains.kotlin.analysis.api.symbols.KtSymbol] can be built by this [PsiElement]\n *\n * @see analysisScope\n */"} {"signature":"public fun write ( ) : ByteArray","body":"{ val b = JvmModuleProtoBuf . Module . newBuilder ( ) kmModule . packageParts . forEach { ( fqName , packageParts ) -> PackageParts ( fqName ) . apply { for ( fileFacade in packageParts . fileFacades ) { addPart ( fileFacade , null ) } for ( ( multiFileClassPart , multiFileFacade ) in packageParts . multiFileClassParts ) { addPart ( multiFileClassPart , multiFileFacade ) } addTo ( b ) } } return b . build ( ) . serializeToByteArray ( CompilerMetadataVersion ( version . toIntArray ( ) , false ) , ) }","docstring":"/**\n * Encodes and writes this metadata of the Kotlin module file.\n *\n * This method encodes all available data, including [version].\n *\n * @throws IllegalArgumentException if [kmModule] is not correct and cannot be written or if [version] is not supported for writing.\n */"} {"signature":"@ JvmStatic @ UnstableMetadataApi public fun read ( bytes : ByteArray ) : KotlinModuleMetadata","body":"{ return wrapIntoMetadataExceptionWhenNeeded { val result = ModuleMapping . loadModuleMapping ( bytes , \"\" , skipMetadataVersionCheck = false , isJvmPackageNameSupported = true ) { throwIfNotCompatible ( it , lenient = false ) } when ( result ) { ModuleMapping . EMPTY , ModuleMapping . CORRUPTED -> throw IllegalArgumentException ( \"\" ) } val module = readModuleMetadataImpl ( result ) KotlinModuleMetadata ( module , JvmMetadataVersion ( result . version . toArray ( ) ) ) } }","docstring":"/**\n * Parses the given byte array with the .kotlin_module file content and returns the [KotlinModuleMetadata] instance,\n * or `null` if this byte array encodes a module with an unsupported metadata version.\n *\n * @throws IllegalArgumentException if an error happened while parsing the given byte array,\n * which means that it is either not the content of a `.kotlin_module` file, or it has been corrupted.\n */"} {"signature":"fun TestAnalysisContext . singleSourceSet ( ) : DokkaConfiguration . DokkaSourceSet","body":"{ return this . configuration . sourceSets . single ( ) }","docstring":"/**\n * @return the only existing source set or an exception\n */"} {"signature":"public actual fun < K , V > mapOf ( pair : Pair < K , V > ) : Map < K , V >","body":"= java . util . Collections . singletonMap ( pair . first , pair . second )","docstring":"/**\n * Returns a new read-only map, mapping only the specified key to the\n * specified value.\n *\n * The returned map is serializable.\n *\n * @sample samples.collections.Maps.Instantiation.mapFromPairs\n */"} {"signature":"public inline fun < K , V > ConcurrentMap < K , V > . getOrPut ( key : K , defaultValue : ( ) -> V ) : V","body":"{ return this . get ( key ) ? : defaultValue ( ) . let { default -> this . putIfAbsent ( key , default ) ? : default } }","docstring":"/**\n * Concurrent getOrPut, that is safe for concurrent maps.\n *\n * Returns the value for the given [key]. If the key is not found in the map, calls the [defaultValue] function,\n * puts its result into the map under the given key and returns it.\n *\n * This method guarantees not to put the value into the map if the key is already there,\n * but the [defaultValue] function may be invoked even if the key is already in the map.\n */"} {"signature":"public fun < K : Comparable < K > , V > Map < out K , V > . toSortedMap ( ) : SortedMap < K , V >","body":"= TreeMap ( this )","docstring":"/**\n * Converts this [Map] to a [SortedMap]. The resulting [SortedMap] determines the equality and order of keys according to their natural sorting order.\n *\n * Note that if the natural sorting order of keys considers any two keys of this map equal\n * (this could happen if the equality of keys according to [Comparable.compareTo] is inconsistent with the equality according to [Any.equals]),\n * only the value associated with the last of them gets into the resulting map.\n *\n * @sample samples.collections.Maps.Transformations.mapToSortedMap\n */"} {"signature":"public fun < K , V > Map < out K , V > . toSortedMap ( comparator : Comparator < in K > ) : SortedMap < K , V >","body":"= TreeMap < K , V > ( comparator ) . apply { putAll ( this @ toSortedMap ) }","docstring":"/**\n * Converts this [Map] to a [SortedMap]. The resulting [SortedMap] determines the equality and order of keys according to the sorting order provided by the given [comparator].\n *\n * Note that if the `comparator` considers any two keys of this map equal, only the value associated with the last of them gets into the resulting map.\n *\n * @sample samples.collections.Maps.Transformations.mapToSortedMapWithComparator\n */"} {"signature":"public fun < K : Comparable < K > , V > sortedMapOf ( vararg pairs : Pair < K , V > ) : SortedMap < K , V >","body":"= TreeMap < K , V > ( ) . apply { putAll ( pairs ) }","docstring":"/**\n * Returns a new [SortedMap] with the specified contents, given as a list of pairs\n * where the first value is the key and the second is the value.\n *\n * The resulting [SortedMap] determines the equality and order of keys according to their natural sorting order.\n *\n * @sample samples.collections.Maps.Instantiation.sortedMapFromPairs\n */"} {"signature":"@ SinceKotlin ( \"\" ) public fun < K , V > sortedMapOf ( comparator : Comparator < in K > , vararg pairs : Pair < K , V > ) : SortedMap < K , V >","body":"= TreeMap < K , V > ( comparator ) . apply { putAll ( pairs ) }","docstring":"/**\n * Returns a new [SortedMap] with the specified contents, given as a list of pairs\n * where the first value is the key and the second is the value.\n *\n * The resulting [SortedMap] determines the equality and order of keys according to the sorting order provided by the given [comparator].\n *\n * @sample samples.collections.Maps.Instantiation.sortedMapWithComparatorFromPairs\n */"} {"signature":"@ kotlin . internal . InlineOnly public inline fun Map < String , String > . toProperties ( ) : Properties","body":"= Properties ( ) . apply { putAll ( this @ toProperties ) }","docstring":"/**\n * Converts this [Map] to a [Properties] object.\n *\n * @sample samples.collections.Maps.Transformations.mapToProperties\n */"} {"signature":"@ PublishedApi internal actual fun mapCapacity ( expectedSize : Int ) : Int","body":"= when { expectedSize < -> expectedSize expectedSize < -> expectedSize + expectedSize < INT_MAX_POWER_OF_TWO -> ( ( expectedSize / ) + ) . toInt ( ) else -> Int . MAX_VALUE }","docstring":"/**\n * Calculate the initial capacity of a map, based on Guava's\n * [com.google.common.collect.Maps.capacity](https://github.com/google/guava/blob/v28.2/guava/src/com/google/common/collect/Maps.java#L325)\n * approach.\n */"} {"signature":"public fun < T > slope ( column : ColumnReference < T > , ) : PositionalMapping < T >","body":"{ return addPositionalMapping < T > ( SLOPE , column . name ( ) , null ) }","docstring":"/**\n * Maps the `slope` 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 > slope ( column : KProperty < T > , ) : PositionalMapping < T >","body":"{ return addPositionalMapping < T > ( SLOPE , column . name , null ) }","docstring":"/**\n * Maps the `slope` 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 slope ( column : String , ) : PositionalMapping < Any ? >","body":"{ return addPositionalMapping < Any ? > ( SLOPE , column , null ) }","docstring":"/**\n * Maps the `slope` 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 > slope ( values : Iterable < T > , ) : PositionalMapping < T >","body":"{ return addPositionalMapping < T > ( SLOPE , values . toList ( ) , null , null ) }","docstring":"/**\n * Maps the `slope` 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 > slope ( values : DataColumn < T > , ) : PositionalMapping < T >","body":"{ return addPositionalMapping < T > ( SLOPE , values , null ) }","docstring":"/**\n * Maps the `slope` 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":"fun poseDetectionMoveNetLightAPI ( )","body":"{ val modelHub = ONNXModelHub ( cacheDirectory = File ( \"\" ) ) val model = ONNXModels . PoseDetection . MoveNetSinglePoseLighting . pretrainedModel ( modelHub ) model . printSummary ( ) model . use { poseDetectionModel -> val result = mutableMapOf < BufferedImage , DetectedPose > ( ) for ( i in .. ) { val file = getFileFromResource ( \"\" ) val image = ImageConverter . toBufferedImage ( file ) val detectedPose = poseDetectionModel . detectPose ( image ) detectedPose . landmarks . forEach { println ( \"\" ) } detectedPose . edges . forEach { println ( \"\" ) } result [ image ] = detectedPose } val panel = JPanel ( FlowLayout ( FlowLayout . CENTER , , ) ) val height = for ( ( image , detectedPose ) in result ) { val displayedImage = pipeline < BufferedImage > ( ) . resize { outputWidth = ( height * image . width ) / image . height ; outputHeight = height } . apply ( image ) panel . add ( createDetectedPosePanel ( displayedImage , detectedPose ) ) } showFrame ( \"\" , panel ) } }","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":"= poseDetectionMoveNetLightAPI ( )","docstring":"/** */"} {"signature":"private fun FunctionDescriptor . getObjCMethodInfo ( onlyExternal : Boolean ) : ObjCMethodInfo ?","body":"{ if ( this . kind . isReal ) { this . decodeObjCMethodAnnotation ( ) ? . let { return it } if ( onlyExternal ) { return null } } return overriddenDescriptors . firstNotNullOfOrNull { it . getObjCMethodInfo ( onlyExternal ) } }","docstring":"/**\n * @param onlyExternal indicates whether to accept overriding methods from Kotlin classes\n */"} {"signature":"private fun IrSimpleFunction . getObjCMethodInfo ( onlyExternal : Boolean ) : ObjCMethodInfo ?","body":"{ if ( this . isFakeOverrideInProgressOfBuilding ( ) ) { decodeObjCMethodAnnotation ( ) ? . let { return it } } if ( this . isReal ) { this . decodeObjCMethodAnnotation ( ) ? . let { return it } if ( onlyExternal ) { return null } } return overriddenSymbols . firstNotNullOfOrNull { assert ( it . owner != this ) { \"\" } it . owner . getObjCMethodInfo ( onlyExternal ) } }","docstring":"/**\n * @param onlyExternal indicates whether to accept overriding methods from Kotlin classes\n */"} {"signature":"fun readByte ( ) : Byte","body":"= bytes [ position ++ ]","docstring":"/**\n * Reads a byte.\n */"} {"signature":"fun readUnsignedByte ( ) : UByte","body":"= readByte ( ) . toUByte ( )","docstring":"/**\n * Reads an unsigned byte.\n */"} {"signature":"fun readInt ( ) : Int","body":"= ( bytes [ position ] . toInt ( ) and shl ) or ( bytes [ position + ] . toInt ( ) and shl ) or ( bytes [ position + ] . toInt ( ) and shl ) or ( bytes [ position + ] . toInt ( ) and ) . also { position += }","docstring":"/**\n * Reads a big-endian (network byte order) 32-bit integer.\n */"} {"signature":"fun readLong ( ) : Long","body":"= ( bytes [ position ] . toLong ( ) and shl ) or ( bytes [ position + ] . toLong ( ) and shl ) or ( bytes [ position + ] . toLong ( ) and shl ) or ( bytes [ position + ] . toLong ( ) and shl ) or ( bytes [ position + ] . toLong ( ) and shl ) or ( bytes [ position + ] . toLong ( ) and shl ) or ( bytes [ position + ] . toLong ( ) and shl ) or ( bytes [ position + ] . toLong ( ) and ) . also { position += }","docstring":"/**\n * Reads a big-endian (network byte order) 64-bit integer.\n */"} {"signature":"public fun Plot . toSVG ( ) : String","body":"= PlotSvgExport . buildSvgImageFromRawSpecs ( toLetsPlot ( ) . toSpec ( ) )","docstring":"/**\n * Exports the plot to SVG format.\n *\n * @receiver [Plot] - the plot to export.\n *\n * @return A [String] in SVG format representing the exported plot.\n */"} {"signature":"public fun PlotGrid . toSVG ( ) : String","body":"= PlotSvgExport . buildSvgImageFromRawSpecs ( wrap ( ) . toSpec ( ) )","docstring":"/**\n * Exports the plot grid to SVG format.\n *\n * @receiver [PlotGrid] - the plot grid to export.\n *\n * @return A [String] in SVG format representing the exported plot.\n */"} {"signature":"public fun PlotBunch . toSVG ( ) : String","body":"= PlotSvgExport . buildSvgImageFromRawSpecs ( wrap ( ) . toSpec ( ) )","docstring":"/**\n * Exports the plot bunch to SVG format.\n *\n * @receiver [PlotBunch] - the plot bunch to export.\n *\n * @return A [String] in SVG format representing the exported plot.\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":"fun isEmpty ( ) : Boolean","body":"= currentChar == && lookAhead == && index >= pattern . size && ! isSpecial","docstring":"/** Checks if there are any characters in the pattern. */"} {"signature":"fun isLetter ( ) : Boolean","body":"= ! isEmpty ( ) && ! isSpecial && isLetter ( currentChar )","docstring":"/** Return true if the current character is letter, false otherwise .*/"} {"signature":"fun isHighSurrogate ( ) : Boolean","body":"= currentChar in .. ","docstring":"/** Check if the current char is high/low surrogate. */"} {"signature":"fun restoreFlags ( flags : Int )","body":"{ this . flags = flags lookAhead = currentChar lookAheadSpecialToken = curSpecialToken index = curTokenIndex + lookAheadTokenIndex = curTokenIndex movePointer ( ) }","docstring":"/**\n * Restores flags for Lexer\n * @param flags\n */"} {"signature":"operator fun next ( ) : Int","body":"{ movePointer ( ) return lookBack }","docstring":"/** Returns current character and moves string index to the next one. */"} {"signature":"fun nextSpecial ( ) : SpecialToken ?","body":"{ val res = curSpecialToken movePointer ( ) return res }","docstring":"/** Returns current special token and moves string index to the next one */"} {"signature":"private fun reread ( )","body":"{ lookAhead = currentChar lookAheadSpecialToken = curSpecialToken index = lookAheadTokenIndex lookAheadTokenIndex = curTokenIndex movePointer ( ) }","docstring":"/**\n * Reread current character. May be required if a previous token changes mode\n * to one with different character interpretation.\n */"} {"signature":"private fun nextIndex ( ) : Int","body":"{ prevNonWhitespaceIndex = index index ++ if ( mode != Mode . ESCAPE && flags and Pattern . COMMENTS != ) { skipComments ( ) } return prevNonWhitespaceIndex }","docstring":"/**\n * Returns the next character index to read and moves pointer to the next one.\n * If comments flag is on this method will skip comments and whitespaces.\n *\n * The following actions are equivalent if comments flag is off:\n * currentChar = pattern[index++] == currentChar = pattern[nextIndex]\n */"} {"signature":"private fun skipComments ( ) : Int","body":"{ val length = pattern . size - do { while ( index < length && pattern [ index ] . isWhitespace ( ) ) { index ++ } if ( index < length && pattern [ index ] == '' ) { index ++ while ( index < length && ! pattern [ index ] . isLineSeparator ( ) ) { index ++ } } else { return index } } while ( true ) }","docstring":"/** Skips comments and whitespaces */"} {"signature":"@ OptIn ( ExperimentalNativeApi :: class ) private fun nextCodePoint ( ) : Int","body":"{ val high = pattern [ nextIndex ( ) ] if ( high . isHighSurrogate ( ) ) { val lowExpectedIndex = prevNonWhitespaceIndex + if ( lowExpectedIndex < pattern . size ) { val low = pattern [ lowExpectedIndex ] if ( low . isLowSurrogate ( ) ) { nextIndex ( ) return Char . toCodePoint ( high , low ) } } } return high . toInt ( ) }","docstring":"/**\n * Returns the next code point in the pattern string.\n */"} {"signature":"private fun movePointer ( )","body":"{ lookBack = currentChar currentChar = lookAhead curSpecialToken = lookAheadSpecialToken curTokenIndex = lookAheadTokenIndex lookAheadTokenIndex = index var reread : Boolean do { lookAhead = if ( index < pattern . size ) nextCodePoint ( ) else lookAheadSpecialToken = null if ( mode == Mode . ESCAPE ) { processInEscapeMode ( ) } reread = when ( mode ) { Mode . PATTERN -> processInPatternMode ( ) Mode . RANGE -> processInRangeMode ( ) else -> false } } while ( reread ) }","docstring":"/**\n * Moves pointer one position right. Saves the current character to [lookBack],\n * [lookAhead] to the current one and finally read one more to [lookAhead].\n */"} {"signature":"private fun processInEscapeMode ( ) : Boolean","body":"{ if ( lookAhead == '' . toInt ( ) ) { val lookAheadChar : Char = if ( index < pattern . size ) pattern [ nextIndex ( ) ] else '' lookAhead = lookAheadChar . toInt ( ) if ( lookAheadChar == '' ) { mode = savedMode index = prevNonWhitespaceIndex nextIndex ( ) lookAhead = if ( index <= pattern . size - ) nextCodePoint ( ) else } else { lookAhead = '' . toInt ( ) index = prevNonWhitespaceIndex } } return false }","docstring":"/**\n * Processing an escaped sequence like \"\\Q foo \\E\". Just skip a character if it is not \\E.\n * Returns whether we need to reread the character or not\n */"} {"signature":"private fun processInPatternMode ( ) : Boolean","body":"{ if ( lookAhead . isSurrogatePair ( ) ) { return false } val lookAheadChar = lookAhead . toChar ( ) if ( lookAheadChar == '' ) { return processEscapedChar ( ) } when ( lookAheadChar ) { '' , '' , '' -> { val mode = if ( index < pattern . size ) pattern [ index ] else '' when ( mode ) { '' -> { lookAhead = lookAhead or Lexer . QMOD_POSSESSIVE ; nextIndex ( ) } '' -> { lookAhead = lookAhead or Lexer . QMOD_RELUCTANT ; nextIndex ( ) } else -> lookAhead = lookAhead or Lexer . QMOD_GREEDY } } '' -> lookAheadSpecialToken = processQuantifier ( ) '' -> lookAhead = CHAR_DOLLAR '' -> { if ( pattern [ index ] != '' ) { lookAhead = CHAR_LEFT_PARENTHESIS } else { nextIndex ( ) var char = pattern [ prevNonWhitespaceIndex + ] when ( char ) { '' -> { lookAhead = CHAR_NEG_LOOKAHEAD ; nextIndex ( ) } '' -> { lookAhead = CHAR_POS_LOOKAHEAD ; nextIndex ( ) } '' -> { lookAhead = CHAR_ATOMIC_GROUP ; nextIndex ( ) } '' -> { nextIndex ( ) char = pattern [ index ] when ( char ) { '' -> { lookAhead = CHAR_NEG_LOOKBEHIND ; nextIndex ( ) } '' -> { lookAhead = CHAR_POS_LOOKBEHIND ; nextIndex ( ) } else -> { val name = readGroupName ( ) lookAhead = CHAR_NAMED_GROUP lookAheadSpecialToken = NamedGroup ( name ) } } } else -> { lookAhead = readFlags ( ) if ( lookAhead >= ) { lookAhead = lookAhead and flags = lookAhead lookAhead = lookAhead shl lookAhead = CHAR_FLAGS or lookAhead } else { flags = lookAhead lookAhead = lookAhead shl lookAhead = CHAR_NONCAP_GROUP or lookAhead } } } } } '' -> lookAhead = CHAR_RIGHT_PARENTHESIS '' -> { lookAhead = CHAR_LEFT_SQUARE_BRACKET ; mode = Mode . RANGE } '' -> lookAhead = CHAR_CARET '' -> lookAhead = CHAR_VERTICAL_BAR '' -> lookAhead = CHAR_DOT } return false }","docstring":"/** Processes a next character in [Mode.PATTERN] mode. Returns whether we need to reread the character or not */"} {"signature":"private fun processInRangeMode ( ) : Boolean","body":"{ if ( lookAhead . isSurrogatePair ( ) ) { return false } val lookAheadChar = lookAhead . toChar ( ) when ( lookAheadChar ) { '' -> return processEscapedChar ( ) '' -> lookAhead = CHAR_LEFT_SQUARE_BRACKET '' -> lookAhead = CHAR_RIGHT_SQUARE_BRACKET '' -> lookAhead = CHAR_CARET '' -> lookAhead = CHAR_AMPERSAND '' -> lookAhead = CHAR_HYPHEN } return false }","docstring":"/** Processes a character inside a range. Returns whether we need to reread the character or not */"} {"signature":"private fun processEscapedChar ( ) : Boolean","body":"{ val escapedCharIndex = prevNonWhitespaceIndex + if ( escapedCharIndex >= pattern . size - ) { throw PatternSyntaxException ( \"\" , patternString , curTokenIndex ) } index = escapedCharIndex val lookAheadChar = pattern [ nextIndex ( ) ] lookAhead = lookAheadChar . toInt ( ) when ( lookAheadChar ) { '' , '' -> { val cs = parseCharClassName ( ) val negative = lookAheadChar == '' lookAheadSpecialToken = AbstractCharClass . getPredefinedClass ( cs , negative ) lookAhead = } '' , '' , '' , '' , '' , '' , '' , '' , '' , '' -> { lookAheadSpecialToken = AbstractCharClass . getPredefinedClass ( pattern . concatToString ( prevNonWhitespaceIndex , prevNonWhitespaceIndex + ) , false ) lookAhead = } '' -> { savedMode = mode mode = Mode . ESCAPE index = escapedCharIndex nextIndex ( ) return true } '' -> lookAhead = '' . toInt ( ) '' -> lookAhead = '' . toInt ( ) '' -> lookAhead = '' . toInt ( ) '' -> lookAhead = '' . toInt ( ) '' -> lookAhead = '' . toInt ( ) '' -> lookAhead = '' . toInt ( ) '' , '' , '' , '' , '' , '' , '' , '' , '' -> { if ( mode == Mode . PATTERN ) { lookAhead = . toInt ( ) or lookAhead } } '' -> { if ( pattern [ nextIndex ( ) ] != '' ) { throw PatternSyntaxException ( \"\" , patternString , curTokenIndex ) } val name = readGroupName ( ) lookAhead = CHAR_NAMED_GROUP_REF lookAheadSpecialToken = NamedGroup ( name ) } '' -> lookAhead = readOctals ( ) '' -> lookAhead = readHex ( \"\" , ) '' -> lookAhead = readHex ( \"\" , ) '' -> lookAhead = CHAR_WORD_BOUND '' -> lookAhead = CHAR_NONWORD_BOUND '' -> lookAhead = CHAR_START_OF_INPUT '' -> lookAhead = CHAR_PREVIOUS_MATCH '' -> lookAhead = CHAR_END_OF_LINE '' -> lookAhead = CHAR_END_OF_INPUT '' -> lookAhead = CHAR_LINEBREAK '' -> { if ( index < pattern . size - ) { lookAhead = pattern [ nextIndex ( ) ] . toInt ( ) and } else { throw PatternSyntaxException ( \"\" , patternString , curTokenIndex ) } } '' , '' , '' , '' , '' , '' , '' , '' , '' , '' , '' , '' , '' , '' , '' , '' , '' , '' , '' , '' , '' , '' -> throw PatternSyntaxException ( \"\" , patternString , curTokenIndex ) } return false }","docstring":"/** Processes an escaped (\\x) character in any mode. Returns whether we need to reread the character or not */"} {"signature":"private fun processQuantifier ( ) : Quantifier","body":"{ @ OptIn ( ExperimentalNativeApi :: class ) assert ( lookAhead == '' . toInt ( ) ) val sb = StringBuilder ( ) var min = - var max = - var char : Char = if ( index < pattern . size ) { pattern [ nextIndex ( ) ] } else { throw PatternSyntaxException ( \"\" , patternString , curTokenIndex ) } while ( char != '' ) { if ( char == '' && min < ) { try { val minParsed = sb . toString ( ) . toInt ( ) min = if ( minParsed >= ) minParsed else throw PatternSyntaxException ( \"\" , patternString , curTokenIndex ) sb . setLength ( ) } catch ( nfe : NumberFormatException ) { throw PatternSyntaxException ( \"\" , patternString , curTokenIndex ) } } else { sb . append ( char ) } char = if ( index < pattern . size ) pattern [ nextIndex ( ) ] else break } if ( char != '' ) { throw PatternSyntaxException ( \"\" , patternString , curTokenIndex ) } if ( sb . isNotEmpty ( ) ) { try { val maxParsed = sb . toString ( ) . toInt ( ) max = if ( maxParsed >= ) maxParsed else throw PatternSyntaxException ( \"\" , patternString , curTokenIndex ) if ( min < ) { min = max } } catch ( nfe : NumberFormatException ) { throw PatternSyntaxException ( \"\" , patternString , curTokenIndex ) } } if ( min < || max >= && max < min ) { throw PatternSyntaxException ( \"\" , patternString , curTokenIndex ) } val mod = if ( index < pattern . size ) pattern [ index ] else '' when ( mod ) { '' -> { lookAhead = Lexer . QUANT_COMP_P ; nextIndex ( ) } '' -> { lookAhead = Lexer . QUANT_COMP_R ; nextIndex ( ) } else -> lookAhead = Lexer . QUANT_COMP } return Quantifier ( min , max ) }","docstring":"/** Process [lookAhead] in assumption that it's quantifier. */"} {"signature":"private fun readFlags ( ) : Int","body":"{ var positive = true var result = flags while ( index < pattern . size ) { val char = pattern [ index ] when ( char ) { '' -> { if ( ! positive ) { throw PatternSyntaxException ( \"\" , patternString , curTokenIndex ) } positive = false } '' -> result = if ( positive ) result or Pattern . CANON_EQ else result xor Pattern . CANON_EQ and result '' -> result = if ( positive ) result or Pattern . CASE_INSENSITIVE else result xor Pattern . CASE_INSENSITIVE and result '' -> result = if ( positive ) result or Pattern . UNIX_LINES else result xor Pattern . UNIX_LINES and result '' -> result = if ( positive ) result or Pattern . MULTILINE else result xor Pattern . MULTILINE and result '' -> result = if ( positive ) result or Pattern . DOTALL else result xor Pattern . DOTALL and result '' -> { } '' -> { } '' -> result = if ( positive ) result or Pattern . COMMENTS else result xor Pattern . COMMENTS and result '' -> { nextIndex ( ) return result } '' -> { nextIndex ( ) return result or ( shl ) } else -> { throw PatternSyntaxException ( \"\" , patternString , curTokenIndex ) } } nextIndex ( ) } throw PatternSyntaxException ( \"\" , patternString , curTokenIndex ) }","docstring":"/** Process expression flags given with (?idmsux-idmsux). Returns the flags processed. */"} {"signature":"private fun parseCharClassName ( ) : String","body":"{ val sb = StringBuilder ( ) if ( index < pattern . size - ) { if ( pattern [ index ] != '' ) { return \"\" } nextIndex ( ) var char = pattern [ nextIndex ( ) ] while ( index < pattern . size - && char != '' ) { sb . append ( char ) char = pattern [ nextIndex ( ) ] } if ( char != '' ) throw PatternSyntaxException ( \"\" , patternString , curTokenIndex ) } if ( sb . isEmpty ( ) ) throw PatternSyntaxException ( \"\" , patternString , curTokenIndex ) val res = sb . toString ( ) return when { res . length == -> \"\" res . length > && ( res . startsWith ( \"\" ) || res . startsWith ( \"\" ) ) -> res . substring ( ) else -> res } }","docstring":"/** Parse character classes names and verifies correction of the syntax */"} {"signature":"private fun readHex ( radixName : String , max : Int ) : Int","body":"{ val builder = StringBuilder ( max ) val length = pattern . size - var i = while ( i < max && index < length ) { builder . append ( pattern [ nextIndex ( ) ] ) i ++ } if ( i == max ) { try { return builder . toString ( ) . toInt ( ) } catch ( e : NumberFormatException ) { } } throw PatternSyntaxException ( \"\" , patternString , curTokenIndex ) }","docstring":"/** Process hexadecimal integer. */"} {"signature":"private fun readOctals ( ) : Int","body":"{ val length = pattern . size - var result = var digit = digitOf ( pattern [ index ] , ) if ( digit == - ) { throw PatternSyntaxException ( \"\" , patternString , curTokenIndex ) } val max = if ( digit > ) else var i = while ( i < max && index < length && digit != - ) { result *= result += digit nextIndex ( ) digit = digitOf ( pattern [ index ] , ) i ++ } return result }","docstring":"/** Process octal integer. */"} {"signature":"fun isLetter ( ch : Int ) : Boolean","body":"{ return ch >= }","docstring":"/** Returns true if [ch] is a plain token. */"} {"signature":"fun getCanonicalClass ( ch : Int ) : Int","body":"= getCanonicalClassInternal ( ch )","docstring":"/** Gets canonical class for given codepoint from decomposition mappings table. */"} {"signature":"fun isDecomposedCharBoundary ( ch : Int ) : Boolean","body":"= getCanonicalClass ( ch ) == ","docstring":"/** Tests Unicode codepoint if it is a boundary of decomposed Unicode codepoint. */"} {"signature":"fun hasSingleCodepointDecomposition ( ch : Int ) : Boolean","body":"= hasSingleCodepointDecompositionInternal ( ch )","docstring":"/** Tests if given codepoint is a canonical decomposition of another codepoint. */"} {"signature":"fun hasDecompositionNonNullCanClass ( ch : Int ) : Boolean","body":"= ( ch == ) or ( ch == ) or ( ch == ) or ( ch == )","docstring":"/** Tests if given codepoint has canonical decomposition and given codepoint's canonical class is not 0. */"} {"signature":"@ OptIn ( ExperimentalNativeApi :: class ) fun normalize ( input : String ) : String","body":"{ val inputChars = input . toCharArray ( ) val inputLength = inputChars . size var inputCodePointsIndex = var decompHangulIndex = val inputCodePoints = IntArray ( inputLength ) var resCodePoints = IntArray ( inputLength * MAX_DECOMPOSITION_LENGTH ) var ch : Int var decomp : IntArray ? val decompHangul : IntArray val result = StringBuilder ( ) var i = while ( i < inputLength ) { ch = input . codePointAt ( i ) inputCodePoints [ inputCodePointsIndex ++ ] = ch i += if ( Char . isSupplementaryCodePoint ( ch ) ) else } var resCodePointsIndex = decomposeString ( inputCodePoints , inputCodePointsIndex , resCodePoints ) resCodePoints = Lexer . getCanonicalOrder ( resCodePoints , resCodePointsIndex ) decompHangul = IntArray ( resCodePoints . size ) @ Suppress ( \"\" ) for ( i in .. resCodePointsIndex - ) { val curSymb = resCodePoints [ i ] decomp = getHangulDecomposition ( curSymb ) if ( decomp == null ) { decompHangul [ decompHangulIndex ++ ] = curSymb } else { decompHangul [ decompHangulIndex ++ ] = decomp [ ] decompHangul [ decompHangulIndex ++ ] = decomp [ ] if ( decomp . size == ) { decompHangul [ decompHangulIndex ++ ] = decomp [ ] } } } @ Suppress ( \"\" ) for ( i in .. decompHangulIndex - ) { result . append ( Char . toChars ( decompHangul [ i ] ) ) } return result . toString ( ) }","docstring":"/**\n * Normalize given string.\n */"} {"signature":"fun getCanonicalOrder ( inputInts : IntArray , length : Int ) : IntArray","body":"{ val inputLength = if ( length < inputInts . size ) length else inputInts . size for ( i in .. inputLength - ) { var j = i - val iCanonicalClass = getCanonicalClass ( inputInts [ i ] ) val ch : Int if ( iCanonicalClass == ) { continue } while ( j > - ) { if ( getCanonicalClass ( inputInts [ j ] ) > iCanonicalClass ) { j = j - } else { break } } ch = inputInts [ i ] for ( k in i downTo j + + ) { inputInts [ k ] = inputInts [ k - ] } inputInts [ j + ] = ch } return inputInts }","docstring":"/**\n * Rearrange codepoints in [inputInts] according to canonical order. Return an array with rearranged codepoints.\n */"} {"signature":"fun getHangulDecomposition ( ch : Int ) : IntArray ?","body":"{ val SIndex = ch - SBase if ( SIndex < || SIndex >= SCount ) { return null } else { val L = LBase + SIndex / NCount val V = VBase + SIndex % NCount / TCount var T = SIndex % TCount val decomp : IntArray if ( T == ) { decomp = intArrayOf ( L , V ) } else { T = TBase + T decomp = intArrayOf ( L , V , T ) } return decomp } }","docstring":"/**\n * Gets decomposition for given Hangul syllable.\n * This is an implementation of Hangul decomposition algorithm\n * according to http://www.unicode.org/versions/Unicode4.0.0/ch03.pdf \"3.12 Conjoining Jamo Behavior\".\n */"} {"signature":"@ HtmlTagMarker inline fun RUBY . rt ( classes : String ? = null , crossinline block : RT . ( ) -> Unit = { } ) : Unit","body":"= RT ( attributesMapOf ( \"\" , classes ) , consumer ) . visit ( block )","docstring":"/**\n * Ruby annotation text\n */"} {"signature":"@ HtmlTagMarker inline fun RUBY . rp ( classes : String ? = null , crossinline block : RP . ( ) -> Unit = { } ) : Unit","body":"= RP ( attributesMapOf ( \"\" , classes ) , consumer ) . visit ( block )","docstring":"/**\n * Parenthesis for ruby annotation text\n */"} {"signature":"fun getAt ( name : String ) : NativeBinary","body":"= getByName ( name )","docstring":"/** Provide an access to binaries using the [] operator in Groovy DSL. */"} {"signature":"operator fun get ( name : String ) : NativeBinary","body":"= getByName ( name )","docstring":"/** Provide an access to binaries using the [] operator in Kotlin DSL. */"} {"signature":"abstract fun getByName ( name : String ) : NativeBinary","body":"abstract fun getByName ( name : String ) : NativeBinary","docstring":"/** Returns a binary with the given [name]. Throws an exception if there is no such binary. */"} {"signature":"abstract fun findByName ( name : String ) : NativeBinary ?","body":"abstract fun findByName ( name : String ) : NativeBinary ?","docstring":"/** Returns a binary with the given [name]. Returns null if there is no such binary. */"} {"signature":"abstract fun getExecutable ( namePrefix : String , buildType : NativeBuildType ) : Executable","body":"abstract fun getExecutable ( namePrefix : String , buildType : NativeBuildType ) : Executable","docstring":"/** Returns an executable with the given [namePrefix] and the given build type. Throws an exception if there is no such binary.*/"} {"signature":"fun getExecutable ( namePrefix : String , buildType : String ) : Executable","body":"= getExecutable ( namePrefix , NativeBuildType . valueOf ( buildType . toUpperCaseAsciiOnly ( ) ) )","docstring":"/** Returns an executable with the given [namePrefix] and the given build type. Throws an exception if there is no such binary.*/"} {"signature":"fun getExecutable ( buildType : NativeBuildType ) : Executable","body":"= getExecutable ( \"\" , buildType )","docstring":"/** Returns an executable with the empty name prefix and the given build type. Throws an exception if there is no such binary.*/"} {"signature":"fun getExecutable ( buildType : String ) : Executable","body":"= getExecutable ( \"\" , buildType )","docstring":"/** Returns an executable with the empty name prefix and the given build type. Throws an exception if there is no such binary.*/"} {"signature":"abstract fun findExecutable ( namePrefix : String , buildType : NativeBuildType ) : Executable ?","body":"abstract fun findExecutable ( namePrefix : String , buildType : NativeBuildType ) : Executable ?","docstring":"/** Returns an executable with the given [namePrefix] and the given build type. Returns null if there is no such binary. */"} {"signature":"fun findExecutable ( namePrefix : String , buildType : String ) : Executable ?","body":"= findExecutable ( namePrefix , NativeBuildType . valueOf ( buildType . toUpperCaseAsciiOnly ( ) ) )","docstring":"/** Returns an executable with the given [namePrefix] and the given build type. Returns null if there is no such binary. */"} {"signature":"fun findExecutable ( buildType : NativeBuildType ) : Executable ?","body":"= findExecutable ( \"\" , buildType )","docstring":"/** Returns an executable with the empty name prefix and the given build type. Returns null if there is no such binary. */"} {"signature":"fun findExecutable ( buildType : String ) : Executable ?","body":"= findExecutable ( \"\" , buildType )","docstring":"/** Returns an executable with the empty name prefix and the given build type. Returns null if there is no such binary. */"} {"signature":"abstract fun getStaticLib ( namePrefix : String , buildType : NativeBuildType ) : StaticLibrary","body":"abstract fun getStaticLib ( namePrefix : String , buildType : NativeBuildType ) : StaticLibrary","docstring":"/** Returns a static library with the given [namePrefix] and the given build type. Throws an exception if there is no such binary.*/"} {"signature":"fun getStaticLib ( namePrefix : String , buildType : String ) : StaticLibrary","body":"= getStaticLib ( namePrefix , NativeBuildType . valueOf ( buildType . toUpperCaseAsciiOnly ( ) ) )","docstring":"/** Returns a static library with the given [namePrefix] and the given build type. Throws an exception if there is no such binary.*/"} {"signature":"fun getStaticLib ( buildType : NativeBuildType ) : StaticLibrary","body":"= getStaticLib ( \"\" , buildType )","docstring":"/** Returns a static library with the empty name prefix and the given build type. Throws an exception if there is no such binary.*/"} {"signature":"fun getStaticLib ( buildType : String ) : StaticLibrary","body":"= getStaticLib ( \"\" , buildType )","docstring":"/** Returns a static library with the empty name prefix and the given build type. Throws an exception if there is no such binary.*/"} {"signature":"abstract fun findStaticLib ( namePrefix : String , buildType : NativeBuildType ) : StaticLibrary ?","body":"abstract fun findStaticLib ( namePrefix : String , buildType : NativeBuildType ) : StaticLibrary ?","docstring":"/** Returns a static library with the given [namePrefix] and the given build type. Returns null if there is no such binary. */"} {"signature":"fun findStaticLib ( namePrefix : String , buildType : String ) : StaticLibrary ?","body":"= findStaticLib ( namePrefix , NativeBuildType . valueOf ( buildType . toUpperCaseAsciiOnly ( ) ) )","docstring":"/** Returns a static library with the given [namePrefix] and the given build type. Returns null if there is no such binary. */"} {"signature":"fun findStaticLib ( buildType : NativeBuildType ) : StaticLibrary ?","body":"= findStaticLib ( \"\" , buildType )","docstring":"/** Returns a static library with the empty name prefix and the given build type. Returns null if there is no such binary. */"} {"signature":"fun findStaticLib ( buildType : String ) : StaticLibrary ?","body":"= findStaticLib ( \"\" , buildType )","docstring":"/** Returns a static library with the empty name prefix and the given build type. Returns null if there is no such binary. */"} {"signature":"abstract fun getSharedLib ( namePrefix : String , buildType : NativeBuildType ) : SharedLibrary","body":"abstract fun getSharedLib ( namePrefix : String , buildType : NativeBuildType ) : SharedLibrary","docstring":"/** Returns a shared library with the given [namePrefix] and the given build type. Throws an exception if there is no such binary.*/"} {"signature":"fun getSharedLib ( namePrefix : String , buildType : String ) : SharedLibrary","body":"= getSharedLib ( namePrefix , NativeBuildType . valueOf ( buildType . toUpperCaseAsciiOnly ( ) ) )","docstring":"/** Returns a shared library with the given [namePrefix] and the given build type. Throws an exception if there is no such binary.*/"} {"signature":"fun getSharedLib ( buildType : NativeBuildType ) : SharedLibrary","body":"= getSharedLib ( \"\" , buildType )","docstring":"/** Returns a shared library with the empty name prefix and the given build type. Throws an exception if there is no such binary.*/"} {"signature":"fun getSharedLib ( buildType : String ) : SharedLibrary","body":"= getSharedLib ( \"\" , buildType )","docstring":"/** Returns a shared library with the empty name prefix and the given build type. Throws an exception if there is no such binary.*/"} {"signature":"abstract fun findSharedLib ( namePrefix : String , buildType : NativeBuildType ) : SharedLibrary ?","body":"abstract fun findSharedLib ( namePrefix : String , buildType : NativeBuildType ) : SharedLibrary ?","docstring":"/** Returns a shared library with the given [namePrefix] and the given build type. Returns null if there is no such binary. */"} {"signature":"fun findSharedLib ( namePrefix : String , buildType : String ) : SharedLibrary ?","body":"= findSharedLib ( namePrefix , NativeBuildType . valueOf ( buildType . toUpperCaseAsciiOnly ( ) ) )","docstring":"/** Returns a shared library with the given [namePrefix] and the given build type. Returns null if there is no such binary. */"} {"signature":"fun findSharedLib ( buildType : NativeBuildType ) : SharedLibrary ?","body":"= findSharedLib ( \"\" , buildType )","docstring":"/** Returns a shared library with the empty name prefix and the given build type. Returns null if there is no such binary. */"} {"signature":"fun findSharedLib ( buildType : String ) : SharedLibrary ?","body":"= findSharedLib ( \"\" , buildType )","docstring":"/** Returns a shared library with the empty name prefix and the given build type. Returns null if there is no such binary. */"} {"signature":"abstract fun getFramework ( namePrefix : String , buildType : NativeBuildType ) : Framework","body":"abstract fun getFramework ( namePrefix : String , buildType : NativeBuildType ) : Framework","docstring":"/** Returns an Objective-C framework with the given [namePrefix] and the given build type. Throws an exception if there is no such binary.*/"} {"signature":"fun getFramework ( namePrefix : String , buildType : String ) : Framework","body":"= getFramework ( namePrefix , NativeBuildType . valueOf ( buildType . toUpperCaseAsciiOnly ( ) ) )","docstring":"/** Returns an Objective-C framework with the given [namePrefix] and the given build type. Throws an exception if there is no such binary.*/"} {"signature":"fun getFramework ( buildType : NativeBuildType ) : Framework","body":"= getFramework ( \"\" , buildType )","docstring":"/** Returns an Objective-C framework with the empty name prefix and the given build type. Throws an exception if there is no such binary.*/"} {"signature":"fun getFramework ( buildType : String ) : Framework","body":"= getFramework ( \"\" , buildType )","docstring":"/** Returns an Objective-C framework with the empty name prefix and the given build type. Throws an exception if there is no such binary.*/"} {"signature":"abstract fun findFramework ( namePrefix : String , buildType : NativeBuildType ) : Framework ?","body":"abstract fun findFramework ( namePrefix : String , buildType : NativeBuildType ) : Framework ?","docstring":"/** Returns an Objective-C framework with the given [namePrefix] and the given build type. Returns null if there is no such binary. */"} {"signature":"fun findFramework ( namePrefix : String , buildType : String ) : Framework ?","body":"= findFramework ( namePrefix , NativeBuildType . valueOf ( buildType . toUpperCaseAsciiOnly ( ) ) )","docstring":"/** Returns an Objective-C framework with the given [namePrefix] and the given build type. Returns null if there is no such binary. */"} {"signature":"fun findFramework ( buildType : NativeBuildType ) : Framework ?","body":"= findFramework ( \"\" , buildType )","docstring":"/** Returns an Objective-C framework with the empty name prefix and the given build type. Returns null if there is no such binary. */"} {"signature":"fun findFramework ( buildType : String ) : Framework ?","body":"= findFramework ( \"\" , buildType )","docstring":"/** Returns an Objective-C framework with the empty name prefix and the given build type. Returns null if there is no such binary. */"} {"signature":"abstract fun getTest ( namePrefix : String , buildType : NativeBuildType ) : TestExecutable","body":"abstract fun getTest ( namePrefix : String , buildType : NativeBuildType ) : TestExecutable","docstring":"/** Returns a test executable with the given [namePrefix] and the given build type. Throws an exception if there is no such binary.*/"} {"signature":"fun getTest ( namePrefix : String , buildType : String ) : TestExecutable","body":"= getTest ( namePrefix , NativeBuildType . valueOf ( buildType . toUpperCaseAsciiOnly ( ) ) )","docstring":"/** Returns a test executable with the given [namePrefix] and the given build type. Throws an exception if there is no such binary.*/"} {"signature":"fun getTest ( buildType : NativeBuildType ) : TestExecutable","body":"= getTest ( \"\" , buildType )","docstring":"/** Returns a test executable with the empty name prefix and the given build type. Throws an exception if there is no such binary.*/"} {"signature":"fun getTest ( buildType : String ) : TestExecutable","body":"= getTest ( \"\" , buildType )","docstring":"/** Returns a test executable with the empty name prefix and the given build type. Throws an exception if there is no such binary.*/"} {"signature":"abstract fun findTest ( namePrefix : String , buildType : NativeBuildType ) : TestExecutable ?","body":"abstract fun findTest ( namePrefix : String , buildType : NativeBuildType ) : TestExecutable ?","docstring":"/** Returns a test executable with the given [namePrefix] and the given build type. Returns null if there is no such binary. */"} {"signature":"fun findTest ( namePrefix : String , buildType : String ) : TestExecutable ?","body":"= findTest ( namePrefix , NativeBuildType . valueOf ( buildType . toUpperCaseAsciiOnly ( ) ) )","docstring":"/** Returns a test executable with the given [namePrefix] and the given build type. Returns null if there is no such binary. */"} {"signature":"fun findTest ( buildType : NativeBuildType ) : TestExecutable ?","body":"= findTest ( \"\" , buildType )","docstring":"/** Returns a test executable with the empty name prefix and the given build type. Returns null if there is no such binary. */"} {"signature":"fun findTest ( buildType : String ) : TestExecutable ?","body":"= findTest ( \"\" , buildType )","docstring":"/** Returns a test executable with the empty name prefix and the given build type. Returns null if there is no such binary. */"} {"signature":"@ JvmOverloads fun executable ( namePrefix : String , buildTypes : Collection < NativeBuildType > = NativeBuildType . DEFAULT_BUILD_TYPES , configure : Executable . ( ) -> Unit = { } )","body":"= createBinaries ( namePrefix , namePrefix , NativeOutputKind . EXECUTABLE , buildTypes , :: Executable , configure )","docstring":"/** Creates an executable with the given [namePrefix] for each build type and configures it. */"} {"signature":"@ JvmOverloads fun executable ( buildTypes : Collection < NativeBuildType > = NativeBuildType . DEFAULT_BUILD_TYPES , configure : Executable . ( ) -> Unit = { } )","body":"= createBinaries ( \"\" , project . name , NativeOutputKind . EXECUTABLE , buildTypes , :: Executable , configure )","docstring":"/** Creates an executable with the empty name prefix for each build type and configures it. */"} {"signature":"@ JvmOverloads fun executable ( namePrefix : String , buildTypes : Collection < NativeBuildType > = NativeBuildType . DEFAULT_BUILD_TYPES , configure : Action < Executable > )","body":"= executable ( namePrefix , buildTypes ) { configure . execute ( this ) }","docstring":"/** Creates an executable with the given [namePrefix] for each build type and configures it. */"} {"signature":"@ JvmOverloads fun executable ( buildTypes : Collection < NativeBuildType > = NativeBuildType . DEFAULT_BUILD_TYPES , configure : Action < Executable > )","body":"= executable ( buildTypes ) { configure . execute ( this ) }","docstring":"/** Creates an executable with the default name prefix for each build type and configures it. */"} {"signature":"@ JvmOverloads fun staticLib ( namePrefix : String , buildTypes : Collection < NativeBuildType > = NativeBuildType . DEFAULT_BUILD_TYPES , configure : StaticLibrary . ( ) -> Unit = { } )","body":"= createBinaries ( namePrefix , namePrefix , NativeOutputKind . STATIC , buildTypes , :: StaticLibrary , configure )","docstring":"/** Creates a static library with the given [namePrefix] for each build type and configures it. */"} {"signature":"@ JvmOverloads fun staticLib ( buildTypes : Collection < NativeBuildType > = NativeBuildType . DEFAULT_BUILD_TYPES , configure : StaticLibrary . ( ) -> Unit = { } )","body":"= createBinaries ( \"\" , project . name , NativeOutputKind . STATIC , buildTypes , :: StaticLibrary , configure )","docstring":"/** Creates a static library with the empty name prefix for each build type and configures it. */"} {"signature":"@ JvmOverloads fun staticLib ( namePrefix : String , buildTypes : Collection < NativeBuildType > = NativeBuildType . DEFAULT_BUILD_TYPES , configure : Action < StaticLibrary > )","body":"= staticLib ( namePrefix , buildTypes ) { configure . execute ( this ) }","docstring":"/** Creates a static library with the given [namePrefix] for each build type and configures it. */"} {"signature":"@ JvmOverloads fun staticLib ( buildTypes : Collection < NativeBuildType > = NativeBuildType . DEFAULT_BUILD_TYPES , configure : Action < StaticLibrary > )","body":"= staticLib ( buildTypes ) { configure . execute ( this ) }","docstring":"/** Creates a static library with the default name prefix for each build type and configures it. */"} {"signature":"@ JvmOverloads fun sharedLib ( namePrefix : String , buildTypes : Collection < NativeBuildType > = NativeBuildType . DEFAULT_BUILD_TYPES , configure : SharedLibrary . ( ) -> Unit = { } )","body":"= createBinaries ( namePrefix , namePrefix , NativeOutputKind . DYNAMIC , buildTypes , :: SharedLibrary , configure )","docstring":"/** Creates a shared library with the given [namePrefix] for each build type and configures it. */"} {"signature":"@ JvmOverloads fun sharedLib ( buildTypes : Collection < NativeBuildType > = NativeBuildType . DEFAULT_BUILD_TYPES , configure : SharedLibrary . ( ) -> Unit = { } )","body":"= createBinaries ( \"\" , project . name , NativeOutputKind . DYNAMIC , buildTypes , :: SharedLibrary , configure )","docstring":"/** Creates a shared library with the empty name prefix for each build type and configures it. */"} {"signature":"@ JvmOverloads fun sharedLib ( namePrefix : String , buildTypes : Collection < NativeBuildType > = NativeBuildType . DEFAULT_BUILD_TYPES , configure : Action < SharedLibrary > )","body":"= sharedLib ( namePrefix , buildTypes ) { configure . execute ( this ) }","docstring":"/** Creates a shared library with the given [namePrefix] for each build type and configures it. */"} {"signature":"@ JvmOverloads fun sharedLib ( buildTypes : Collection < NativeBuildType > = NativeBuildType . DEFAULT_BUILD_TYPES , configure : Action < SharedLibrary > )","body":"= sharedLib ( buildTypes ) { configure . execute ( this ) }","docstring":"/** Creates a shared library with the default name prefix for each build type and configures it. */"} {"signature":"@ JvmOverloads fun framework ( namePrefix : String , buildTypes : Collection < NativeBuildType > = NativeBuildType . DEFAULT_BUILD_TYPES , configure : Framework . ( ) -> Unit = { } )","body":"= createBinaries ( namePrefix , namePrefix , NativeOutputKind . FRAMEWORK , buildTypes , :: Framework , configure )","docstring":"/** Creates an Objective-C framework with the given [namePrefix] for each build type and configures it. */"} {"signature":"@ JvmOverloads fun framework ( buildTypes : Collection < NativeBuildType > = NativeBuildType . DEFAULT_BUILD_TYPES , configure : Framework . ( ) -> Unit = { } )","body":"= createBinaries ( \"\" , project . name , NativeOutputKind . FRAMEWORK , buildTypes , :: Framework , configure )","docstring":"/** Creates an Objective-C framework with the empty name prefix for each build type and configures it. */"} {"signature":"@ JvmOverloads fun framework ( namePrefix : String , buildTypes : Collection < NativeBuildType > = NativeBuildType . DEFAULT_BUILD_TYPES , configure : Action < Framework > )","body":"= framework ( namePrefix , buildTypes ) { configure . execute ( this ) }","docstring":"/** Creates an Objective-C framework with the given [namePrefix] for each build type and configures it. */"} {"signature":"@ JvmOverloads fun framework ( buildTypes : Collection < NativeBuildType > = NativeBuildType . DEFAULT_BUILD_TYPES , configure : Action < Framework > )","body":"= framework ( buildTypes ) { configure . execute ( this ) }","docstring":"/** Creates an Objective-C framework with the default name prefix for each build type and configures it. */"} {"signature":"@ JvmOverloads fun test ( namePrefix : String , buildTypes : Collection < NativeBuildType > = NativeBuildType . DEFAULT_BUILD_TYPES , configure : TestExecutable . ( ) -> Unit = { } )","body":"= createBinaries ( namePrefix , namePrefix , NativeOutputKind . TEST , buildTypes , :: TestExecutable , configure )","docstring":"/** Creates a test executable with the given [namePrefix] for each build type and configures it. */"} {"signature":"@ JvmOverloads fun test ( buildTypes : Collection < NativeBuildType > = NativeBuildType . DEFAULT_BUILD_TYPES , configure : TestExecutable . ( ) -> Unit = { } )","body":"= createBinaries ( \"\" , \"\" , NativeOutputKind . TEST , buildTypes , :: TestExecutable , configure )","docstring":"/** Creates a test executable with the empty name prefix for each build type and configures it. */"} {"signature":"@ JvmOverloads fun test ( namePrefix : String , buildTypes : Collection < NativeBuildType > = NativeBuildType . DEFAULT_BUILD_TYPES , configure : Action < TestExecutable > )","body":"= test ( namePrefix , buildTypes ) { configure . execute ( this ) }","docstring":"/** Creates a test executable with the given [namePrefix] for each build type and configures it. */"} {"signature":"@ JvmOverloads fun test ( buildTypes : Collection < NativeBuildType > = NativeBuildType . DEFAULT_BUILD_TYPES , configure : Action < TestExecutable > )","body":"= test ( buildTypes ) { configure . execute ( this ) }","docstring":"/** Creates a test executable with the default name prefix for each build type and configures it. */"} {"signature":"fun transformExternalFunction ( function : IrSimpleFunction ) : List < IrDeclaration > ?","body":"{ if ( function . valueParameters . any { it . defaultValue != null } ) return null function . returnType = doubleIfNumber ( function . returnType ) val valueParametersAdapters = function . valueParameters . map { parameter -> val varargElementType = parameter . varargElementType if ( varargElementType != null ) { CopyToJsArrayAdapter ( parameter . type , varargElementType ) } else { parameter . type . kotlinToJsAdapterIfNeeded ( isReturn = false ) } } val resultAdapter = function . returnType . jsToKotlinAdapterIfNeeded ( isReturn = true ) if ( resultAdapter == null && valueParametersAdapters . all { it == null } ) return null val newFun = context . irFactory . createStaticFunctionWithReceivers ( function . parent , name = Name . identifier ( function . name . asStringStripSpecialMarkers ( ) + \"\" ) , function , remapMultiFieldValueClassStructure = context :: remapMultiFieldValueClassStructure ) function . valueParameters . forEachIndexed { index , newParameter -> val adapter = valueParametersAdapters [ index ] if ( adapter != null ) { newParameter . type = adapter . toType } } resultAdapter ? . let { function . returnType = resultAdapter . fromType } val builder = context . createIrBuilder ( newFun . symbol ) newFun . body = createAdapterFunctionBody ( builder , newFun , function , valueParametersAdapters , resultAdapter ) newFun . annotations = emptyList ( ) context . mapping . wasmJsInteropFunctionToWrapper [ function ] = newFun return listOf ( function , newFun ) }","docstring":"/**\n * external fun foo(x: KotlinType): KotlinType\n *\n * ->\n *\n * external fun foo(x: JsType): JsType\n * fun foo__externalAdapter(x: KotlinType): KotlinType = adaptResult(foo(adaptParameter(x)));\n */"} {"signature":"fun transformExportFunction ( function : IrSimpleFunction ) : List < IrDeclaration > ?","body":"{ val valueParametersAdapters = function . valueParameters . map { it . type . jsToKotlinAdapterIfNeeded ( isReturn = false ) } val resultAdapter = function . returnType . kotlinToJsAdapterIfNeeded ( isReturn = true ) if ( resultAdapter == null && valueParametersAdapters . all { it == null } ) return null val newFun = context . irFactory . createStaticFunctionWithReceivers ( function . parent , name = Name . identifier ( function . name . asStringStripSpecialMarkers ( ) + \"\" ) , function , remapMultiFieldValueClassStructure = context :: remapMultiFieldValueClassStructure ) newFun . valueParameters . forEachIndexed { index , newParameter -> val adapter = valueParametersAdapters [ index ] if ( adapter != null ) { newParameter . type = adapter . fromType } } resultAdapter ? . let { newFun . returnType = resultAdapter . toType } val builder : DeclarationIrBuilder = context . createIrBuilder ( newFun . symbol ) newFun . body = createAdapterFunctionBody ( builder , newFun , function , valueParametersAdapters , resultAdapter ) newFun . annotations += builder . irCallConstructor ( jsRelatedSymbols . jsNameConstructor , typeArguments = emptyList ( ) ) . also { it . putValueArgument ( , builder . irString ( function . getJsNameOrKotlinName ( ) . identifier ) ) } function . annotations = function . annotations . filter { it . symbol != jsRelatedSymbols . jsExportConstructor } return listOf ( function , newFun ) }","docstring":"/**\n * @JsExport\n * fun foo(x: KotlinType): KotlinType { }\n *\n * ->\n *\n * @JsExport\n * @JsName(\"foo\")\n * fun foo__JsExportAdapter(x: JsType): JsType =\n * adaptResult(foo(adaptParameter(x)));\n *\n * fun foo(x: KotlinType): KotlinType { }\n */"} {"signature":"@ ExternalKotlinTargetApi fun IdeDependencyResolver . withEffect ( effect : IdeDependencyEffect )","body":"= IdeDependencyResolver { sourceSet -> this@withEffect . resolve ( sourceSet ) . also { dependencies -> effect ( sourceSet , dependencies ) } }","docstring":"/**\n * Wraps the given [IdeDependencyResolver] with the specified [effect]\n * The resulting resolver will first resolve the dependencies and then execute the effect on the result\n */"} {"signature":"internal fun Configuration . asTransitiveDependencies ( )","body":"{ isVisible = false isCanBeConsumed = false isTransitive = true isCanBeResolved = true }","docstring":"/**\n * Mark this [Configuration] as a transitive.\n *\n * Dependencies must be added to this configuration, as a result of its resolution, artifacts from these dependencies are returned.\n *\n * See: https://docs.gradle.org/7.5.1/userguide/declaring_dependencies.html\n */"} {"signature":"internal fun Configuration . asBucket ( )","body":"{ isVisible = true isCanBeResolved = false isCanBeConsumed = false }","docstring":"/**\n * Mark this [Configuration] as a bucket for declaring dependencies.\n *\n * Bucket combines artifacts from the specified dependencies,\n * and allows you to resolve in consumer configuration.\n *\n * See: https://docs.gradle.org/7.5.1/userguide/declaring_dependencies.html#sec:resolvable-consumable-configs\n */"} {"signature":"internal fun Configuration . asProducer ( )","body":"{ isVisible = false isCanBeResolved = false isCanBeConsumed = true }","docstring":"/**\n * Mark this [Configuration] as a 'producer' that exposes artifacts and their dependencies for consumption by other\n * projects\n *\n * See: https://docs.gradle.org/7.5.1/userguide/declaring_dependencies.html#sec:resolvable-consumable-configs\n */"} {"signature":"override fun add ( element : @ UnsafeVariance E ) : PersistentSet < E >","body":"override fun add ( element : @ UnsafeVariance E ) : PersistentSet < E >","docstring":"/**\n * Returns the result of adding the specified [element] to this set.\n *\n * @return a new persistent set with the specified [element] added;\n * or this instance if it already contains the element.\n */"} {"signature":"override fun addAll ( elements : Collection < @ UnsafeVariance E > ) : PersistentSet < E >","body":"override fun addAll ( elements : Collection < @ UnsafeVariance E > ) : PersistentSet < E >","docstring":"/**\n * Returns the result of adding all elements of the specified [elements] collection to this set.\n *\n * @return a new persistent set with elements of the specified [elements] collection added;\n * or this instance if it already contains every element of the specified collection.\n */"} {"signature":"override fun remove ( element : @ UnsafeVariance E ) : PersistentSet < E >","body":"override fun remove ( element : @ UnsafeVariance E ) : PersistentSet < E >","docstring":"/**\n * Returns the result of removing the specified [element] from this set.\n *\n * @return a new persistent set with the specified [element] removed;\n * or this instance if there is no such element in this set.\n */"} {"signature":"override fun removeAll ( elements : Collection < @ UnsafeVariance E > ) : PersistentSet < E >","body":"override fun removeAll ( elements : Collection < @ UnsafeVariance E > ) : PersistentSet < E >","docstring":"/**\n * Returns the result of removing all elements in this set that are also\n * contained in the specified [elements] collection.\n *\n * @return a new persistent set with elements in this set 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 ) : PersistentSet < E >","body":"override fun removeAll ( predicate : ( E ) -> Boolean ) : PersistentSet < E >","docstring":"/**\n * Returns the result of removing all elements in this set that match the specified [predicate].\n *\n * @return a new persistent set 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 > ) : PersistentSet < E >","body":"override fun retainAll ( elements : Collection < @ UnsafeVariance E > ) : PersistentSet < E >","docstring":"/**\n * Returns all elements in this set that are also\n * contained in the specified [elements] collection.\n *\n * @return a new persistent set with elements in this set 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 ( ) : PersistentSet < E >","body":"override fun clear ( ) : PersistentSet < E >","docstring":"/**\n * Returns an empty persistent set.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalUnsignedTypes :: class ) @ kotlin . internal . InlineOnly public inline fun min ( a : UInt , b : UInt ) : UInt","body":"{ return minOf ( a , b ) }","docstring":"/**\n * Returns the smaller of two values.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalUnsignedTypes :: class ) @ kotlin . internal . InlineOnly public inline fun min ( a : ULong , b : ULong ) : ULong","body":"{ return minOf ( a , b ) }","docstring":"/**\n * Returns the smaller of two values.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalUnsignedTypes :: class ) @ kotlin . internal . InlineOnly public inline fun max ( a : UInt , b : UInt ) : UInt","body":"{ return maxOf ( a , b ) }","docstring":"/**\n * Returns the greater of two values.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalUnsignedTypes :: class ) @ kotlin . internal . InlineOnly public inline fun max ( a : ULong , b : ULong ) : ULong","body":"{ return maxOf ( a , b ) }","docstring":"/**\n * Returns the greater of two values.\n */"} {"signature":"fun resolve ( path : String ) : File","body":"= if ( Paths . get ( path ) . isAbsolute ) File ( path ) else resolveRelative ( path )","docstring":"/**\n * If given [path] is relative, resolves it relative to dependecies directory.\n * In case of absolute path just wraps it into a [File].\n *\n * Support of both relative and absolute path kinds allows to substitute predefined\n * dependencies with system ones.\n *\n * TODO: It looks like DependencyProcessor have two split responsibilities:\n * * Dependency resolving\n * * Dependency downloading\n * Also it is tightly tied to KonanProperties.\n */"} {"signature":"public expect fun < T > atomic ( initial : T , trace : TraceBase = None ) : AtomicRef < T >","body":"public expect fun < T > atomic ( initial : T , trace : TraceBase = None ) : AtomicRef < T >","docstring":"/**\n * Creates atomic reference with a given [initial] value and a [trace] object to [trace modifications][Trace] of the value.\n *\n * It can only be used to initialize a private or internal read-only property, like this:\n *\n * ```\n * private val f = atomic(initial, trace)\n * ```\n */"} {"signature":"public expect fun < T > atomic ( initial : T ) : AtomicRef < T >","body":"public expect fun < T > atomic ( initial : T ) : AtomicRef < T >","docstring":"/**\n * Creates atomic reference with a given [initial] value.\n *\n * It can only be used to initialize a private or internal read-only property, like this:\n *\n * ```\n * private val f = atomic(initial)\n * ```\n */"} {"signature":"public expect fun atomic ( initial : Int , trace : TraceBase = None ) : AtomicInt","body":"public expect fun atomic ( initial : Int , trace : TraceBase = None ) : AtomicInt","docstring":"/**\n * Creates atomic [Int] with a given [initial] value and a [trace] object to [trace modifications][Trace] of the value.\n *\n * It can only be used to initialize a private or internal read-only property, like this:\n *\n * ```\n * private val f = atomic(initialInt, trace)\n * ```\n */"} {"signature":"public expect fun atomic ( initial : Int ) : AtomicInt","body":"public expect fun atomic ( initial : Int ) : AtomicInt","docstring":"/**\n * Creates atomic [Int] with a given [initial] value.\n *\n * It can only be used to initialize a private or internal read-only property, like this:\n *\n * ```\n * private val f = atomic(initialInt)\n * ```\n */"} {"signature":"public expect fun atomic ( initial : Long , trace : TraceBase = None ) : AtomicLong","body":"public expect fun atomic ( initial : Long , trace : TraceBase = None ) : AtomicLong","docstring":"/**\n * Creates atomic [Long] with a given [initial] value and a [trace] object to [trace modifications][Trace] of the value.\n *\n * It can only be used to initialize a private or internal read-only property, like this:\n *\n * ```\n * private val f = atomic(initialLong, trace)\n * ```\n */"} {"signature":"public expect fun atomic ( initial : Long ) : AtomicLong","body":"public expect fun atomic ( initial : Long ) : AtomicLong","docstring":"/**\n * Creates atomic [Long] with a given [initial] value.\n *\n * It can only be used to initialize a private or internal read-only property, like this:\n *\n * ```\n * private val f = atomic(initialLong)\n * ```\n */"} {"signature":"public expect fun atomic ( initial : Boolean , trace : TraceBase = None ) : AtomicBoolean","body":"public expect fun atomic ( initial : Boolean , trace : TraceBase = None ) : AtomicBoolean","docstring":"/**\n * Creates atomic [Boolean] with a given [initial] value and a [trace] object to [trace modifications][Trace] of the value.\n *\n * It can only be used to initialize a private or internal read-only property, like this:\n *\n * ```\n * private val f = atomic(initialBoolean, trace)\n * ```\n */"} {"signature":"public expect fun atomic ( initial : Boolean ) : AtomicBoolean","body":"public expect fun atomic ( initial : Boolean ) : AtomicBoolean","docstring":"/**\n * Creates atomic [Boolean] with a given [initial] value.\n *\n * It can only be used to initialize a private or internal read-only property, like this:\n *\n * ```\n * private val f = atomic(initialBoolean)\n * ```\n */"} {"signature":"@ OptionalJsName ( ATOMIC_ARRAY_OF_NULLS ) public fun < T > atomicArrayOfNulls ( size : Int ) : AtomicArray < T ? >","body":"= AtomicArray ( size )","docstring":"/**\n * Creates array of AtomicRef of specified size, where each element is initialised with null value\n */"} {"signature":"public fun lazySet ( value : T )","body":"public fun lazySet ( value : T )","docstring":"/**\n * Maps to [AtomicReferenceFieldUpdater.lazySet].\n */"} {"signature":"public fun compareAndSet ( expect : T , update : T ) : Boolean","body":"public fun compareAndSet ( expect : T , update : T ) : Boolean","docstring":"/**\n * Maps to [AtomicReferenceFieldUpdater.compareAndSet].\n */"} {"signature":"public fun getAndSet ( value : T ) : T","body":"public fun getAndSet ( value : T ) : T","docstring":"/**\n * Maps to [AtomicReferenceFieldUpdater.getAndSet].\n */"} {"signature":"public inline fun < T > AtomicRef < T > . loop ( action : ( T ) -> Unit ) : Nothing","body":"{ while ( true ) { action ( value ) } }","docstring":"/**\n * Infinite loop that reads this atomic variable and performs the specified [action] on its value.\n */"} {"signature":"public inline fun < T > AtomicRef < T > . update ( function : ( T ) -> T )","body":"{ while ( true ) { val cur = value val upd = function ( cur ) if ( compareAndSet ( cur , upd ) ) return } }","docstring":"/**\n * Updates variable atomically using the specified [function] of its value.\n */"} {"signature":"public inline fun < T > AtomicRef < T > . getAndUpdate ( function : ( T ) -> T ) : T","body":"{ while ( true ) { val cur = value val upd = function ( cur ) if ( compareAndSet ( cur , upd ) ) return cur } }","docstring":"/**\n * Updates variable atomically using the specified [function] of its value and returns its old value.\n */"} {"signature":"public inline fun < T > AtomicRef < T > . updateAndGet ( function : ( T ) -> T ) : T","body":"{ while ( true ) { val cur = value val upd = function ( cur ) if ( compareAndSet ( cur , upd ) ) return upd } }","docstring":"/**\n * Updates variable atomically using the specified [function] of its value and returns its new value.\n */"} {"signature":"public fun lazySet ( value : Boolean )","body":"public fun lazySet ( value : Boolean )","docstring":"/**\n * Maps to [AtomicIntegerFieldUpdater.lazySet].\n */"} {"signature":"public fun compareAndSet ( expect : Boolean , update : Boolean ) : Boolean","body":"public fun compareAndSet ( expect : Boolean , update : Boolean ) : Boolean","docstring":"/**\n * Maps to [AtomicIntegerFieldUpdater.compareAndSet].\n */"} {"signature":"public fun getAndSet ( value : Boolean ) : Boolean","body":"public fun getAndSet ( value : Boolean ) : Boolean","docstring":"/**\n * Maps to [AtomicIntegerFieldUpdater.getAndSet].\n */"} {"signature":"public inline fun AtomicBoolean . loop ( action : ( Boolean ) -> Unit ) : Nothing","body":"{ while ( true ) { action ( value ) } }","docstring":"/**\n * Infinite loop that reads this atomic variable and performs the specified [action] on its value.\n */"} {"signature":"public inline fun AtomicBoolean . update ( function : ( Boolean ) -> Boolean )","body":"{ while ( true ) { val cur = value val upd = function ( cur ) if ( compareAndSet ( cur , upd ) ) return } }","docstring":"/**\n * Updates variable atomically using the specified [function] of its value.\n */"} {"signature":"public inline fun AtomicBoolean . getAndUpdate ( function : ( Boolean ) -> Boolean ) : Boolean","body":"{ while ( true ) { val cur = value val upd = function ( cur ) if ( compareAndSet ( cur , upd ) ) return cur } }","docstring":"/**\n * Updates variable atomically using the specified [function] of its value and returns its old value.\n */"} {"signature":"public inline fun AtomicBoolean . updateAndGet ( function : ( Boolean ) -> Boolean ) : Boolean","body":"{ while ( true ) { val cur = value val upd = function ( cur ) if ( compareAndSet ( cur , upd ) ) return upd } }","docstring":"/**\n * Updates variable atomically using the specified [function] of its value and returns its new value.\n */"} {"signature":"public fun lazySet ( value : Int )","body":"public fun lazySet ( value : Int )","docstring":"/**\n * Maps to [AtomicIntegerFieldUpdater.lazySet].\n */"} {"signature":"public fun compareAndSet ( expect : Int , update : Int ) : Boolean","body":"public fun compareAndSet ( expect : Int , update : Int ) : Boolean","docstring":"/**\n * Maps to [AtomicIntegerFieldUpdater.compareAndSet].\n */"} {"signature":"public fun getAndSet ( value : Int ) : Int","body":"public fun getAndSet ( value : Int ) : Int","docstring":"/**\n * Maps to [AtomicIntegerFieldUpdater.getAndSet].\n */"} {"signature":"public fun getAndIncrement ( ) : Int","body":"public fun getAndIncrement ( ) : Int","docstring":"/**\n * Maps to [AtomicIntegerFieldUpdater.getAndIncrement].\n */"} {"signature":"public fun getAndDecrement ( ) : Int","body":"public fun getAndDecrement ( ) : Int","docstring":"/**\n * Maps to [AtomicIntegerFieldUpdater.getAndDecrement].\n */"} {"signature":"public fun getAndAdd ( delta : Int ) : Int","body":"public fun getAndAdd ( delta : Int ) : Int","docstring":"/**\n * Maps to [AtomicIntegerFieldUpdater.getAndAdd].\n */"} {"signature":"public fun addAndGet ( delta : Int ) : Int","body":"public fun addAndGet ( delta : Int ) : Int","docstring":"/**\n * Maps to [AtomicIntegerFieldUpdater.addAndGet].\n */"} {"signature":"public fun incrementAndGet ( ) : Int","body":"public fun incrementAndGet ( ) : Int","docstring":"/**\n * Maps to [AtomicIntegerFieldUpdater.incrementAndGet].\n */"} {"signature":"public fun decrementAndGet ( ) : Int","body":"public fun decrementAndGet ( ) : Int","docstring":"/**\n * Maps to [AtomicIntegerFieldUpdater.decrementAndGet].\n */"} {"signature":"public inline operator fun plusAssign ( delta : Int )","body":"public inline operator fun plusAssign ( delta : Int )","docstring":"/**\n * Performs atomic addition of [delta].\n */"} {"signature":"public inline operator fun minusAssign ( delta : Int )","body":"public inline operator fun minusAssign ( delta : Int )","docstring":"/**\n * Performs atomic subtraction of [delta].\n */"} {"signature":"public inline fun AtomicInt . loop ( action : ( Int ) -> Unit ) : Nothing","body":"{ while ( true ) { action ( value ) } }","docstring":"/**\n * Infinite loop that reads this atomic variable and performs the specified [action] on its value.\n */"} {"signature":"public inline fun AtomicInt . update ( function : ( Int ) -> Int )","body":"{ while ( true ) { val cur = value val upd = function ( cur ) if ( compareAndSet ( cur , upd ) ) return } }","docstring":"/**\n * Updates variable atomically using the specified [function] of its value.\n */"} {"signature":"public inline fun AtomicInt . getAndUpdate ( function : ( Int ) -> Int ) : Int","body":"{ while ( true ) { val cur = value val upd = function ( cur ) if ( compareAndSet ( cur , upd ) ) return cur } }","docstring":"/**\n * Updates variable atomically using the specified [function] of its value and returns its old value.\n */"} {"signature":"public inline fun AtomicInt . updateAndGet ( function : ( Int ) -> Int ) : Int","body":"{ while ( true ) { val cur = value val upd = function ( cur ) if ( compareAndSet ( cur , upd ) ) return upd } }","docstring":"/**\n * Updates variable atomically using the specified [function] of its value and returns its new value.\n */"} {"signature":"public fun lazySet ( value : Long )","body":"public fun lazySet ( value : Long )","docstring":"/**\n * Maps to [AtomicLongFieldUpdater.lazySet].\n */"} {"signature":"public fun compareAndSet ( expect : Long , update : Long ) : Boolean","body":"public fun compareAndSet ( expect : Long , update : Long ) : Boolean","docstring":"/**\n * Maps to [AtomicLongFieldUpdater.compareAndSet].\n */"} {"signature":"public fun getAndSet ( value : Long ) : Long","body":"public fun getAndSet ( value : Long ) : Long","docstring":"/**\n * Maps to [AtomicLongFieldUpdater.getAndSet].\n */"} {"signature":"public fun getAndIncrement ( ) : Long","body":"public fun getAndIncrement ( ) : Long","docstring":"/**\n * Maps to [AtomicLongFieldUpdater.getAndIncrement].\n */"} {"signature":"public fun getAndDecrement ( ) : Long","body":"public fun getAndDecrement ( ) : Long","docstring":"/**\n * Maps to [AtomicLongFieldUpdater.getAndDecrement].\n */"} {"signature":"public fun getAndAdd ( delta : Long ) : Long","body":"public fun getAndAdd ( delta : Long ) : Long","docstring":"/**\n * Maps to [AtomicLongFieldUpdater.getAndAdd].\n */"} {"signature":"public fun addAndGet ( delta : Long ) : Long","body":"public fun addAndGet ( delta : Long ) : Long","docstring":"/**\n * Maps to [AtomicLongFieldUpdater.addAndGet].\n */"} {"signature":"public fun incrementAndGet ( ) : Long","body":"public fun incrementAndGet ( ) : Long","docstring":"/**\n * Maps to [AtomicLongFieldUpdater.incrementAndGet].\n */"} {"signature":"public fun decrementAndGet ( ) : Long","body":"public fun decrementAndGet ( ) : Long","docstring":"/**\n * Maps to [AtomicLongFieldUpdater.decrementAndGet].\n */"} {"signature":"public inline operator fun plusAssign ( delta : Long )","body":"public inline operator fun plusAssign ( delta : Long )","docstring":"/**\n * Performs atomic addition of [delta].\n */"} {"signature":"public inline operator fun minusAssign ( delta : Long )","body":"public inline operator fun minusAssign ( delta : Long )","docstring":"/**\n * Performs atomic subtraction of [delta].\n */"} {"signature":"public inline fun AtomicLong . loop ( action : ( Long ) -> Unit ) : Nothing","body":"{ while ( true ) { action ( value ) } }","docstring":"/**\n * Infinite loop that reads this atomic variable and performs the specified [action] on its value.\n */"} {"signature":"public inline fun AtomicLong . update ( function : ( Long ) -> Long )","body":"{ while ( true ) { val cur = value val upd = function ( cur ) if ( compareAndSet ( cur , upd ) ) return } }","docstring":"/**\n * Updates variable atomically using the specified [function] of its value.\n */"} {"signature":"public inline fun AtomicLong . getAndUpdate ( function : ( Long ) -> Long ) : Long","body":"{ while ( true ) { val cur = value val upd = function ( cur ) if ( compareAndSet ( cur , upd ) ) return cur } }","docstring":"/**\n * Updates variable atomically using the specified [function] of its value and returns its old value.\n */"} {"signature":"public inline fun AtomicLong . updateAndGet ( function : ( Long ) -> Long ) : Long","body":"{ while ( true ) { val cur = value val upd = function ( cur ) if ( compareAndSet ( cur , upd ) ) return upd } }","docstring":"/**\n * Updates variable atomically using the specified [function] of its value and returns its new value.\n */"} {"signature":"fun sharedCopy ( ) : Segment","body":"{ shared = true return Segment ( data , pos , limit , true , false ) }","docstring":"/**\n * Returns a new segment that shares the underlying byte array with this. Adjusting pos and limit\n * are safe but writes are forbidden. This also marks the current segment as shared, which\n * prevents it from being pooled.\n */"} {"signature":"fun unsharedCopy ( )","body":"= Segment ( data . copyOf ( ) , pos , limit , false , true )","docstring":"/** Returns a new segment that its own private copy of the underlying byte array. */"} {"signature":"fun pop ( ) : Segment ?","body":"{ val result = if ( next !== this ) next else null prev ! ! . next = next next ! ! . prev = prev next = null prev = null return result }","docstring":"/**\n * Removes this segment of a circularly-linked list and returns its successor.\n * Returns null if the list is now empty.\n */"} {"signature":"fun push ( segment : Segment ) : Segment","body":"{ segment . prev = this segment . next = next next ! ! . prev = segment next = segment return segment }","docstring":"/**\n * Appends `segment` after this segment in the circularly-linked list. Returns the pushed segment.\n */"} {"signature":"fun split ( byteCount : Int ) : Segment","body":"{ require ( byteCount > && byteCount <= limit - pos ) { \"\" } val prefix : Segment if ( byteCount >= SHARE_MINIMUM ) { prefix = sharedCopy ( ) } else { prefix = SegmentPool . take ( ) data . copyInto ( prefix . data , startIndex = pos , endIndex = pos + byteCount ) } prefix . limit = prefix . pos + byteCount pos += byteCount prev ! ! . push ( prefix ) return prefix }","docstring":"/**\n * Splits this head of a circularly-linked list into two segments. The first segment contains the\n * data in `[pos..pos+byteCount)`. The second segment contains the data in\n * `[pos+byteCount..limit)`. This can be useful when moving partial segments from one buffer to\n * another.\n *\n * Returns the new head of the circularly-linked list.\n */"} {"signature":"fun compact ( )","body":"{ check ( prev !== this ) { \"\" } if ( ! prev ! ! . owner ) return val byteCount = limit - pos val availableByteCount = SIZE - prev ! ! . limit + if ( prev ! ! . shared ) else prev ! ! . pos if ( byteCount > availableByteCount ) return writeTo ( prev ! ! , byteCount ) pop ( ) SegmentPool . recycle ( this ) }","docstring":"/**\n * Call this when the tail and its predecessor may both be less than half full. This will copy\n * data so that segments can be recycled.\n */"} {"signature":"fun writeTo ( sink : Segment , byteCount : Int )","body":"{ check ( sink . owner ) { \"\" } if ( sink . limit + byteCount > SIZE ) { if ( sink . shared ) throw IllegalArgumentException ( ) if ( sink . limit + byteCount - sink . pos > SIZE ) throw IllegalArgumentException ( ) sink . data . copyInto ( sink . data , startIndex = sink . pos , endIndex = sink . limit ) sink . limit -= sink . pos sink . pos = } data . copyInto ( sink . data , destinationOffset = sink . limit , startIndex = pos , endIndex = pos + byteCount ) sink . limit += byteCount pos += byteCount }","docstring":"/** Moves `byteCount` bytes from this segment to `sink`. */"} {"signature":"internal fun Segment . indexOfBytesInbound ( bytes : ByteArray , startOffset : Int ) : Int","body":"{ var offset = startOffset val limit = size - bytes . size + val firstByte = bytes [ ] while ( offset < limit ) { val idx = indexOf ( firstByte , offset , limit ) if ( idx < ) { return - } var found = true for ( innerIdx in until bytes . size ) { if ( data [ pos + idx + innerIdx ] != bytes [ innerIdx ] ) { found = false break } } if ( found ) { return idx } else { offset ++ } } return - }","docstring":"/**\n * Searches for a `bytes` pattern within this segment starting at the offset `startOffset`.\n * `startOffset` is relative and should be within `[0, size)`.\n */"} {"signature":"internal fun Segment . indexOfBytesOutbound ( bytes : ByteArray , startOffset : Int , head : Segment ? ) : Int","body":"{ var offset = startOffset val firstByte = bytes [ ] while ( offset in until size ) { val idx = indexOf ( firstByte , offset , size ) if ( idx < ) { return - } var seg = this var scanOffset = offset var found = true for ( element in bytes ) { if ( scanOffset == seg . size ) { val next = seg . next if ( next === head ) return - seg = next ! ! scanOffset = } if ( element != seg . data [ seg . pos + scanOffset ] ) { found = false break } scanOffset ++ } if ( found ) { return offset } offset ++ } return - }","docstring":"/**\n * Searches for a `bytes` pattern starting in between offset `startOffset` and `size` within this segment\n * and continued in the following segments.\n * `startOffset` is relative and should be within `[0, size)`.\n */"} {"signature":"@ Test fun testExistingStorageIsProperlyModifiedOnSuccess ( )","body":"{ val storageRoot = workingDir . resolve ( \"\" ) val key1 = LookupSymbolKey ( \"\" , \"\" ) val key2 = LookupSymbolKey ( \"\" , \"\" ) val key3 = LookupSymbolKey ( \"\" , \"\" ) val key4 = LookupSymbolKey ( \"\" , \"\" ) val key5 = LookupSymbolKey ( \"\" , \"\" ) withLookupMapInTransaction ( storageRoot , useInMemoryWrapper = false , successful = true ) { it [ key1 ] = setOf ( , ) it [ key2 ] = setOf ( , ) it [ key3 ] = setOf ( ) } withLookupMapInTransaction ( storageRoot , useInMemoryWrapper = true , successful = true ) { it . append ( key1 , setOf ( ) ) it . remove ( key2 ) it [ key3 ] = setOf ( ) it . append ( key4 , setOf ( ) ) it . append ( key5 , setOf ( ) ) } withLookupMapInTransaction ( storageRoot , useInMemoryWrapper = false , successful = true ) { assertEquals ( setOf ( , , ) , it [ key1 ] ) assertNull ( it [ key2 ] ) assertEquals ( setOf ( ) , it [ key3 ] ) assertEquals ( setOf ( ) , it [ key4 ] ) assertEquals ( setOf ( ) , it [ key5 ] ) } withLookupMapInTransaction ( storageRoot , useInMemoryWrapper = true , successful = true ) { it . clear ( ) it . append ( key1 , setOf ( ) ) } withLookupMapInTransaction ( storageRoot , useInMemoryWrapper = false , successful = true ) { assertEquals ( setOf ( ) , it [ key1 ] ) assertNull ( it [ key2 ] ) assertNull ( it [ key3 ] ) assertNull ( it [ key4 ] ) assertNull ( it [ key5 ] ) } }","docstring":"/**\n * Covered scenarios:\n * - By existing key\n * - set (key3)\n * - append (key1)\n * - remove (key2)\n * - By non-existing key\n * - set (key5)\n * - append (key4)\n * - clean\n */"} {"signature":"fun resnet50additionalTrainingWithHelper ( )","body":"{ val modelHub = TFModelHub ( cacheDirectory = File ( \"\" ) ) val modelType = TFModels . CV . ResNet50 ( ) val model = modelHub . loadModel ( modelType ) val hdfFile = modelHub . loadWeights ( modelType ) val pretrainedModel = model . removeLastLayer ( ) val topModel = Sequential . of ( Dense ( name = \"\" , kernelInitializer = GlorotUniform ( ) , biasInitializer = GlorotUniform ( ) , outputSize = , activation = Activations . Relu ) , Dense ( name = \"\" , kernelInitializer = GlorotUniform ( ) , biasInitializer = GlorotUniform ( ) , outputSize = NUM_CLASSES , activation = Activations . Linear ) , noInput = true ) val model2 = Functional . of ( pretrainedModel = pretrainedModel , topModel = topModel ) val dataset = OnFlyImageDataset . create ( File ( dogsCatsSmallDatasetPath ( ) ) , FromFolders ( mapping = mapOf ( \"\" to , \"\" to ) ) , modelType . createPreprocessing ( model2 ) ) . shuffle ( ) val ( train , test ) = dataset . split ( TRAIN_TEST_SPLIT_RATIO ) model2 . use { it . compile ( optimizer = Adam ( ) , loss = Losses . SOFT_MAX_CROSS_ENTROPY_WITH_LOGITS , metric = Metrics . ACCURACY ) it . loadWeightsForFrozenLayers ( hdfFile ) val accuracyBeforeTraining = it . evaluate ( dataset = test , batchSize = TEST_BATCH_SIZE ) . metrics [ Metrics . ACCURACY ] println ( \"\" ) it . fit ( dataset = train , batchSize = TRAINING_BATCH_SIZE , epochs = EPOCHS ) val accuracyAfterTraining = it . evaluate ( dataset = test , batchSize = TEST_BATCH_SIZE ) . metrics [ Metrics . ACCURACY ] println ( \"\" ) } }","docstring":"/**\n * This example demonstrates the transfer learning concept on ResNet'50 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 * - All layers, excluding the last [Dense], are added to the new Neural Network, its weights are frozen.\n * - New Dense layers are added and initialized via defined initializers.\n * - Model is re-trained on [dogsCatsSmallDatasetPath] dataset.\n *\n * We use the preprocessing DSL to describe the dataset generation pipeline.\n * We demonstrate the workflow on the subset of Kaggle Cats vs Dogs binary classification dataset.\n */"} {"signature":"fun main ( ) : Unit","body":"= resnet50additionalTrainingWithHelper ( )","docstring":"/** */"} {"signature":"fun isVersionRequirementTableWrittenCorrectly ( version : BinaryVersion ) : Boolean","body":"= isKotlin1Dot4OrLater ( version )","docstring":"/**\n * Before metadata version 1.4, version requirements for nested classes were deserialized incorrectly: the version requirement table was\n * loaded from the outermost class and passed to the nested classes and their members, even though indices of their version requirements\n * were pointing to the other table stored in the nested class (which was not read by deserialization). See KT-25120 for more information.\n */"} {"signature":"@ Composable fun JetsnackSnackbar ( snackbarData : SnackbarData , modifier : Modifier = Modifier , actionOnNewLine : Boolean = false , shape : Shape = MaterialTheme . shapes . small , backgroundColor : Color = JetsnackTheme . colors . uiBackground , contentColor : Color = JetsnackTheme . colors . textSecondary , actionColor : Color = JetsnackTheme . colors . brand , elevation : Dp = . dp )","body":"{ Snackbar ( snackbarData = snackbarData , modifier = modifier , actionOnNewLine = actionOnNewLine , shape = shape , backgroundColor = backgroundColor , contentColor = contentColor , actionColor = actionColor , elevation = elevation ) }","docstring":"/**\n * An alternative to [androidx.compose.material.Snackbar] utilizing\n * [com.example.jetsnack.ui.theme.JetsnackColors]\n */"} {"signature":"internal fun Project . applyDebugKeystoreFix ( testFixesProperties : TestFixesProperties )","body":"{ plugins . withId ( \"\" , fix < AppExtension > ( testFixesProperties ) ) plugins . withId ( \"\" , fix < LibraryExtension > ( testFixesProperties ) ) plugins . withId ( \"\" , fix < FeatureExtension > ( testFixesProperties ) ) plugins . withId ( \"\" , fix < TestExtension > ( testFixesProperties ) ) }","docstring":"/**\n * AGP 7+ creates a keystore that is not compatible with lover versions of AGP,\n * but could consume keystores created by them.\n *\n * With this fix 'debug.keystore' could be checked in into the repo and shared\n * between test executions.\n */"} {"signature":"private fun IrConstructor . checkConstructorDelegation ( ) : InvalidConstructorDelegation ?","body":"{ if ( origin == PartiallyLinkedDeclarationOrigin . MISSING_DECLARATION ) return null val statements = ( body as? IrBlockBody ) ? . statements ? : return null val constructedClass = parentAsClass val constructedClassSymbol = constructedClass . symbol val actualSuperClassSymbol = constructedClass . superTypes . firstNotNullOfOrNull { superType -> val superClassSymbol = ( superType as? IrSimpleType ) ? . classifier as? IrClassSymbol ? : return@firstNotNullOfOrNull null if ( superClassSymbol . owner . isClass ) superClassSymbol else null } ? : builtIns . anyClass val actualSuperClass = actualSuperClassSymbol . owner statements . forEach { statement -> if ( statement !is IrDelegatingConstructorCall ) return@forEach val calledConstructorSymbol = statement . symbol val calledConstructor = calledConstructorSymbol . owner val invalidConstructorDelegationFound = if ( calledConstructor . origin != PartiallyLinkedDeclarationOrigin . MISSING_DECLARATION ) { val constructedSuperClassSymbol = calledConstructor . parentAsClass . symbol constructedSuperClassSymbol != constructedClassSymbol && constructedSuperClassSymbol != actualSuperClassSymbol && ( ! constructedClass . isExternal || constructedSuperClassSymbol != builtIns . anyClass ) } else { ( calledConstructorSymbol . signature as? IdSignature . CommonSignature ) ? . let { constructorSignature -> val constructedSuperClassId = DeclarationId ( constructorSignature . packageFqName , constructorSignature . declarationFqName . substringBeforeLast ( '' ) ) actualSuperClass . declarationId != constructedSuperClassId } ? : false } if ( invalidConstructorDelegationFound ) return InvalidConstructorDelegation ( constructorSymbol = symbol , superClassSymbol = actualSuperClassSymbol , unexpectedSuperClassConstructorSymbol = calledConstructorSymbol ) } return null }","docstring":"/**\n * Checks if there is an issue with constructor delegation.\n */"} {"signature":"private fun IrFunction . rewriteTypesInFunction ( ) : ExploredClassifier . Unusable ?","body":"{ var result : ExploredClassifier . Unusable ? by Delegates . vetoable ( null ) { _ , oldValue , _ -> oldValue == null } fun IrValueParameter . fixType ( ) { val newType = type . toPartiallyLinkedMarkerTypeOrNull ( ) ? : return type = newType if ( varargElementType != null ) varargElementType = newType defaultValue = null result = newType . unusableClassifier } dispatchReceiverParameter ? . fixType ( ) extensionReceiverParameter ? . fixType ( ) valueParameters . forEach { it . fixType ( ) } returnType . toPartiallyLinkedMarkerTypeOrNull ( ) ? . let { newReturnType -> returnType = newReturnType result = newReturnType . unusableClassifier } typeParameters . forEach { tp -> tp . superTypes . toPartiallyLinkedMarkerTypeOrNull ( ) ? . let { newSuperType -> tp . superTypes = listOf ( newSuperType ) result = newSuperType . unusableClassifier } } return result }","docstring":"/**\n * Returns the first encountered [ExploredClassifier.Unusable].\n */"} {"signature":"private fun MutableList < IrStatement > . eliminateDeadCodeStatements ( )","body":"{ var hasPartialLinkageRuntimeError = false removeIf { statement -> val needToRemove = when ( statement ) { is IrInstanceInitializerCall , is IrDelegatingConstructorCall , is IrEnumConstructorCall -> false else -> hasPartialLinkageRuntimeError } hasPartialLinkageRuntimeError = hasPartialLinkageRuntimeError || statement . isPartialLinkageRuntimeError ( ) needToRemove } }","docstring":"/**\n * Removes statements after the first IR p.l. error (everything after the IR p.l. error if effectively dead code and do not need\n * to be kept in the IR tree).\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ ExperimentalUnsignedTypes public actual fun UIntArray . elementAt ( index : Int ) : UInt","body":"{ 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 array.\n * \n * @sample samples.collections.Collections.Elements.elementAt\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ ExperimentalUnsignedTypes public actual fun ULongArray . elementAt ( index : Int ) : ULong","body":"{ 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 array.\n * \n * @sample samples.collections.Collections.Elements.elementAt\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ ExperimentalUnsignedTypes public actual fun UByteArray . elementAt ( index : Int ) : UByte","body":"{ 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 array.\n * \n * @sample samples.collections.Collections.Elements.elementAt\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ ExperimentalUnsignedTypes public actual fun UShortArray . elementAt ( index : Int ) : UShort","body":"{ 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 array.\n * \n * @sample samples.collections.Collections.Elements.elementAt\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ ExperimentalUnsignedTypes public actual fun UIntArray . asList ( ) : List < UInt >","body":"{ return object : AbstractList < UInt > ( ) , RandomAccess { override val size : Int get ( ) = this@asList . size override fun isEmpty ( ) : Boolean = this@asList . isEmpty ( ) override fun contains ( element : UInt ) : Boolean = this@asList . contains ( element ) override fun get ( index : Int ) : UInt { AbstractList . checkElementIndex ( index , size ) return this@asList [ index ] } override fun indexOf ( element : UInt ) : Int { @ Suppress ( \"\" ) if ( ( element as Any ? ) !is UInt ) return - return this@asList . indexOf ( element ) } override fun lastIndexOf ( element : UInt ) : Int { @ Suppress ( \"\" ) if ( ( element as Any ? ) !is UInt ) return - return this@asList . lastIndexOf ( element ) } } }","docstring":"/**\n * Returns a [List] that wraps the original array.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ ExperimentalUnsignedTypes public actual fun ULongArray . asList ( ) : List < ULong >","body":"{ return object : AbstractList < ULong > ( ) , RandomAccess { override val size : Int get ( ) = this@asList . size override fun isEmpty ( ) : Boolean = this@asList . isEmpty ( ) override fun contains ( element : ULong ) : Boolean = this@asList . contains ( element ) override fun get ( index : Int ) : ULong { AbstractList . checkElementIndex ( index , size ) return this@asList [ index ] } override fun indexOf ( element : ULong ) : Int { @ Suppress ( \"\" ) if ( ( element as Any ? ) !is ULong ) return - return this@asList . indexOf ( element ) } override fun lastIndexOf ( element : ULong ) : Int { @ Suppress ( \"\" ) if ( ( element as Any ? ) !is ULong ) return - return this@asList . lastIndexOf ( element ) } } }","docstring":"/**\n * Returns a [List] that wraps the original array.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ ExperimentalUnsignedTypes public actual fun UByteArray . asList ( ) : List < UByte >","body":"{ return object : AbstractList < UByte > ( ) , RandomAccess { override val size : Int get ( ) = this@asList . size override fun isEmpty ( ) : Boolean = this@asList . isEmpty ( ) override fun contains ( element : UByte ) : Boolean = this@asList . contains ( element ) override fun get ( index : Int ) : UByte { AbstractList . checkElementIndex ( index , size ) return this@asList [ index ] } override fun indexOf ( element : UByte ) : Int { @ Suppress ( \"\" ) if ( ( element as Any ? ) !is UByte ) return - return this@asList . indexOf ( element ) } override fun lastIndexOf ( element : UByte ) : Int { @ Suppress ( \"\" ) if ( ( element as Any ? ) !is UByte ) return - return this@asList . lastIndexOf ( element ) } } }","docstring":"/**\n * Returns a [List] that wraps the original array.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ ExperimentalUnsignedTypes public actual fun UShortArray . asList ( ) : List < UShort >","body":"{ return object : AbstractList < UShort > ( ) , RandomAccess { override val size : Int get ( ) = this@asList . size override fun isEmpty ( ) : Boolean = this@asList . isEmpty ( ) override fun contains ( element : UShort ) : Boolean = this@asList . contains ( element ) override fun get ( index : Int ) : UShort { AbstractList . checkElementIndex ( index , size ) return this@asList [ index ] } override fun indexOf ( element : UShort ) : Int { @ Suppress ( \"\" ) if ( ( element as Any ? ) !is UShort ) return - return this@asList . indexOf ( element ) } override fun lastIndexOf ( element : UShort ) : Int { @ Suppress ( \"\" ) if ( ( element as Any ? ) !is UShort ) return - return this@asList . lastIndexOf ( element ) } } }","docstring":"/**\n * Returns a [List] that wraps the original array.\n */"} {"signature":"public actual inline fun < reified T > Collection < T > . toTypedArray ( ) : Array < T >","body":"{ val result = arrayOfNulls < T > ( size ) var index = for ( element in this ) result [ index ++ ] = element @ Suppress ( \"\" ) return result as Array < T > }","docstring":"/**\n * Returns a *typed* array containing all the elements of this collection.\n *\n * Allocates an array of runtime type `T` having its size equal to the size of this collection\n * and populates the array with the elements of this collection.\n * @sample samples.collections.Collections.Collections.collectionToTypedArray\n */"} {"signature":"@ Test fun createZeroFilledByteArray ( )","body":"{ val dim1 = val dim2 = val dim3 = val a = mk . zeros < Byte > ( dim1 , dim2 , dim3 ) assertEquals ( dim1 * dim2 * dim3 , a . size ) assertEquals ( dim1 * dim2 * dim3 , a . data . size ) assertTrue { a . all { it == . toByte ( ) } } }","docstring":"/**\n * This method checks if a byte array of a given size is correctly created with all elements set to zero.\n */"} {"signature":"@ Test fun createByteArrayFilledWithOnes ( )","body":"{ val dim1 = val dim2 = val dim3 = val a = mk . ones < Byte > ( dim1 , dim2 , dim3 ) assertEquals ( dim1 * dim2 * dim3 , a . size ) assertEquals ( dim1 * dim2 * dim3 , a . data . size ) assertTrue { a . all { it == . toByte ( ) } } }","docstring":"/**\n * Creates a byte array filled with ones of a given size and checks if all elements are set to one.\n */"} {"signature":"@ Test fun createThreeDimensionalArrayFromByteList ( )","body":"{ val list = listOf ( listOf ( listOf < Byte > ( , ) , listOf < Byte > ( , ) ) , listOf ( listOf < Byte > ( , ) , listOf < Byte > ( , ) ) ) val a : D3Array < Byte > = mk . ndarray ( list ) assertEquals ( list , a . toListD3 ( ) ) }","docstring":"/**\n * Creates a three-dimensional array from a list of byte lists\n * and checks if the array's list representation matches the input list.\n */"} {"signature":"@ Test fun createThreeDimensionalArrayFromByteSet ( )","body":"{ val set = setOf < Byte > ( , , , , , , , , , , - , - ) val shape = intArrayOf ( , , ) val a : D3Array < Byte > = mk . ndarray ( set , shape = shape ) assertEquals ( set . size , a . size ) assertEquals ( set , a . toSet ( ) ) }","docstring":"/**\n * Creates a three-dimensional array from a set of bytes\n * and checks if the array's set representation matches the input set.\n */"} {"signature":"@ Test fun createThreeDimensionalArrayFromPrimitiveByteArray ( )","body":"{ val array = byteArrayOf ( , , , , , , , , , , , ) val a = mk . ndarray ( array , , , ) assertEquals ( array . size , a . size ) a . data . getByteArray ( ) shouldBe array }","docstring":"/**\n * Creates a three-dimensional array from a primitive ByteArray\n * and checks if the array's ByteArray representation matches the input ByteArray.\n */"} {"signature":"@ Test fun createByte3DArrayWithInitializationFunction ( )","body":"{ val a = mk . d3array < Byte > ( , , ) { ( it + ) . toByte ( ) } val expected = byteArrayOf ( , , , , , , , , , , , ) assertEquals ( expected . size , a . size ) a . data . getByteArray ( ) shouldBe expected }","docstring":"/**\n * Creates a three-dimensional array with a given size using an initialization function\n * and checks if the array's ByteArray representation matches the expected output.\n */"} {"signature":"@ Test fun createByte3DArrayWithInitAndIndices ( )","body":"{ val a = mk . d3arrayIndices ( , , ) { i , j , k -> ( i * j + k ) . toByte ( ) } val expected = byteArrayOf ( , , , , , , , , , , , ) assertEquals ( expected . size , a . size ) a . data . getByteArray ( ) shouldBe expected }","docstring":"/**\n * Creates a three-dimensional array with a given size using an initialization function and indices.\n * Checks if the array's ByteArray representation matches the expected output.\n */"} {"signature":"@ OptIn ( ExperimentalMultikApi :: class ) @ Test fun createAlignedByte3DArray ( )","body":"{ val list = listOf ( listOf ( listOf < Byte > ( , ) , listOf < Byte > ( ) ) , listOf ( listOf < Byte > ( , ) ) ) val expected = listOf ( listOf ( listOf < Byte > ( , ) , listOf < Byte > ( , ) ) , listOf ( listOf < Byte > ( , ) , listOf < Byte > ( , ) ) ) val a : D3Array < Byte > = mk . createAlignedNDArray ( list , filling = ) assertEquals ( expected , a . toListD3 ( ) ) }","docstring":"/**\n * Tests the function 'createAlignedNDArray' that creates a three-dimensional array from a list of number lists.\n * The test asserts that:\n * - The output array's size matches the size of the longest list in the input\n * and all lists are filled to match this length.\n * - The lists shorter than the longest one are filled with the specified filling value.\n */"} {"signature":"@ Test fun createZeroFilledShortArray ( )","body":"{ val dim1 = val dim2 = val dim3 = val a = mk . zeros < Short > ( dim1 , dim2 , dim3 ) assertEquals ( dim1 * dim2 * dim3 , a . size ) assertEquals ( dim1 * dim2 * dim3 , a . data . size ) assertTrue { a . all { it == . toShort ( ) } } }","docstring":"/**\n * This method checks if a short array of a given size is correctly created with all elements set to zero.\n */"} {"signature":"@ Test fun createShortArrayFilledWithOnes ( )","body":"{ val dim1 = val dim2 = val dim3 = val a = mk . ones < Short > ( dim1 , dim2 , dim3 ) assertEquals ( dim1 * dim2 * dim3 , a . size ) assertEquals ( dim1 * dim2 * dim3 , a . data . size ) assertTrue { a . all { it == . toShort ( ) } } }","docstring":"/**\n * Creates a short array filled with ones of a given size and checks if all elements are set to one.\n */"} {"signature":"@ Test fun createThreeDimensionalArrayFromShortList ( )","body":"{ val list = listOf ( listOf ( listOf < Short > ( , ) , listOf < Short > ( , ) ) , listOf ( listOf < Short > ( , ) , listOf < Short > ( , ) ) ) val a : D3Array < Short > = mk . ndarray ( list ) assertEquals ( list , a . toListD3 ( ) ) }","docstring":"/**\n * Creates a three-dimensional array from a list of short lists\n * and checks if the array's list representation matches the input list.\n */"} {"signature":"@ Test @ Ignore fun createThreeDimensionalArrayFromShortSet ( )","body":"{ val set = setOf < Short > ( , , , , , , , , , , - , - ) val shape = intArrayOf ( , , ) val a : D3Array < Short > = mk . ndarray ( set , shape = shape ) assertEquals ( set . size , a . size ) assertEquals ( set , a . toSet ( ) ) }","docstring":"/**\n * Creates a three-dimensional array from a set of shorts\n * and checks if the array's set representation matches the input set.\n */"} {"signature":"@ Test fun createThreeDimensionalArrayFromPrimitiveShortArray ( )","body":"{ val array = shortArrayOf ( , , , , , , , , , , , ) val a = mk . ndarray ( array , , , ) assertEquals ( array . size , a . size ) a . data . getShortArray ( ) shouldBe array }","docstring":"/**\n * Creates a three-dimensional array from a primitive ShortArray\n * and checks if the array's ShortArray representation matches the input ShortArray.\n */"} {"signature":"@ Test fun createShort3DArrayWithInitializationFunction ( )","body":"{ val a = mk . d3array < Short > ( , , ) { ( it + ) . toShort ( ) } val expected = shortArrayOf ( , , , , , , , , , , , ) assertEquals ( expected . size , a . size ) a . data . getShortArray ( ) shouldBe expected }","docstring":"/**\n * Creates a three-dimensional array with a given size using an initialization function\n * and checks if the array's ShortArray representation matches the expected output.\n */"} {"signature":"@ Test fun createShort3DArrayWithInitAndIndices ( )","body":"{ val a = mk . d3arrayIndices ( , , ) { i , j , k -> ( i * j + k ) . toShort ( ) } val expected = shortArrayOf ( , , , , , , , , , , , ) assertEquals ( expected . size , a . size ) a . data . getShortArray ( ) shouldBe expected }","docstring":"/**\n * Creates a three-dimensional array with a given size using an initialization function and indices.\n * Checks if the array's ShortArray representation matches the expected output.\n */"} {"signature":"@ OptIn ( ExperimentalMultikApi :: class ) @ Test fun createAlignedShort3DArray ( )","body":"{ val list = listOf ( listOf ( listOf < Short > ( , ) , listOf < Short > ( ) ) , listOf ( listOf < Short > ( , ) ) ) val expected = listOf ( listOf ( listOf < Short > ( , ) , listOf < Short > ( , ) ) , listOf ( listOf < Short > ( , ) , listOf < Short > ( , ) ) ) val a : D3Array < Short > = mk . createAlignedNDArray ( list , filling = ) assertEquals ( expected , a . toListD3 ( ) ) }","docstring":"/**\n * Tests the function 'createAlignedNDArray' that creates a three-dimensional array from a list of number lists.\n * The test asserts that:\n * - The output array's size matches the size of the longest list in the input\n * and all lists are filled to match this length.\n * - The lists shorter than the longest one are filled with the specified filling value.\n */"} {"signature":"@ Test fun createZeroFilledIntArray ( )","body":"{ val dim1 = val dim2 = val dim3 = val a = mk . zeros < Int > ( dim1 , dim2 , dim3 ) assertEquals ( dim1 * dim2 * dim3 , a . size ) assertEquals ( dim1 * dim2 * dim3 , a . data . size ) assertTrue { a . all { it == } } }","docstring":"/**\n * This method checks if an integer array of a given size is correctly created with all elements set to zero.\n */"} {"signature":"@ Test fun createIntArrayFilledWithOnes ( )","body":"{ val dim1 = val dim2 = val dim3 = val a = mk . ones < Int > ( dim1 , dim2 , dim3 ) assertEquals ( dim1 * dim2 * dim3 , a . size ) assertEquals ( dim1 * dim2 * dim3 , a . data . size ) assertTrue { a . all { it == } } }","docstring":"/**\n * Creates an integer array filled with ones of a given size and checks if all elements are set to one.\n */"} {"signature":"@ Test fun createThreeDimensionalArrayFromIntList ( )","body":"{ val list = listOf ( listOf ( listOf ( , ) , listOf ( , ) ) , listOf ( listOf ( , ) , listOf ( , ) ) ) val a : D3Array < Int > = mk . ndarray ( list ) assertEquals ( list , a . toListD3 ( ) ) }","docstring":"/**\n * Creates a three-dimensional array from a list of integer lists\n * and checks if the array's list representation matches the input list.\n */"} {"signature":"@ Test fun createThreeDimensionalArrayFromIntSet ( )","body":"{ val set = setOf ( , , , , , , , , , , - , - ) val shape = intArrayOf ( , , ) val a : D3Array < Int > = mk . ndarray ( set , shape = shape ) assertEquals ( set . size , a . size ) assertEquals ( set , a . toSet ( ) ) }","docstring":"/**\n * Creates a three-dimensional array from a set of integers\n * and checks if the array's set representation matches the input set.\n */"} {"signature":"@ Test fun createThreeDimensionalArrayFromPrimitiveIntArray ( )","body":"{ val array = intArrayOf ( , , , , , , , , , , , ) val a = mk . ndarray ( array , , , ) assertEquals ( array . size , a . size ) a . data . getIntArray ( ) shouldBe array }","docstring":"/**\n * Creates a three-dimensional array from a primitive IntArray\n * and checks if the array's IntArray representation matches the input IntArray.\n */"} {"signature":"@ Test fun createInt3DArrayWithInitializationFunction ( )","body":"{ val a = mk . d3array < Int > ( , , ) { ( it + ) } val expected = intArrayOf ( , , , , , , , , , , , ) assertEquals ( expected . size , a . size ) a . data . getIntArray ( ) shouldBe expected }","docstring":"/**\n * Creates a three-dimensional array with a given size using an initialization function\n * and checks if the array's IntArray representation matches the expected output.\n */"} {"signature":"@ Test fun createInt3DArrayWithInitAndIndices ( )","body":"{ val a = mk . d3arrayIndices ( , , ) { i , j , k -> i * j + k } val expected = intArrayOf ( , , , , , , , , , , , ) assertEquals ( expected . size , a . size ) a . data . getIntArray ( ) shouldBe expected }","docstring":"/**\n * Creates a three-dimensional array with a given size using an initialization function and indices.\n * Checks if the array's IntArray representation matches the expected output.\n */"} {"signature":"@ OptIn ( ExperimentalMultikApi :: class ) @ Test fun createAlignedInt3DArray ( )","body":"{ val list = listOf ( listOf ( listOf ( , ) , listOf ( ) ) , listOf ( listOf ( , ) ) ) val expected = listOf ( listOf ( listOf ( , ) , listOf ( , ) ) , listOf ( listOf ( , ) , listOf ( , ) ) ) val a : D3Array < Int > = mk . createAlignedNDArray ( list , filling = ) assertEquals ( expected , a . toListD3 ( ) ) }","docstring":"/**\n * Tests the function 'createAlignedNDArray' that creates a three-dimensional array from a list of number lists.\n * The test asserts that:\n * - The output array's size matches the size of the longest list in the input\n * and all lists are filled to match this length.\n * - The lists shorter than the longest one are filled with the specified filling value.\n */"} {"signature":"@ Test fun createZeroFilledLongArray ( )","body":"{ val dim1 = val dim2 = val dim3 = val a = mk . zeros < Long > ( dim1 , dim2 , dim3 ) assertEquals ( dim1 * dim2 * dim3 , a . size ) assertEquals ( dim1 * dim2 * dim3 , a . data . size ) assertTrue { a . all { it == } } }","docstring":"/**\n * This method checks if a long array of a given size is correctly created with all elements set to zero.\n */"} {"signature":"@ Test fun createLongArrayFilledWithOnes ( )","body":"{ val dim1 = val dim2 = val dim3 = val a = mk . ones < Long > ( dim1 , dim2 , dim3 ) assertEquals ( dim1 * dim2 * dim3 , a . size ) assertEquals ( dim1 * dim2 * dim3 , a . data . size ) assertTrue { a . all { it == } } }","docstring":"/**\n * Creates a long array filled with ones of a given size and checks if all elements are set to one.\n */"} {"signature":"@ Test fun createThreeDimensionalArrayFromLongList ( )","body":"{ val list = listOf ( listOf ( listOf ( , ) , listOf ( , ) ) , listOf ( listOf ( , ) , listOf ( , ) ) ) val a : D3Array < Long > = mk . ndarray ( list ) assertEquals ( list , a . toListD3 ( ) ) }","docstring":"/**\n * Creates a three-dimensional array from a list of long lists\n * and checks if the array's list representation matches the input list.\n */"} {"signature":"@ Test fun createThreeDimensionalArrayFromLongSet ( )","body":"{ val set = setOf ( , , , , , , , , , , - , - ) val shape = intArrayOf ( , , ) val a : D3Array < Long > = mk . ndarray ( set , shape = shape ) assertEquals ( set . size , a . size ) assertEquals ( set , a . toSet ( ) ) }","docstring":"/**\n * Creates a three-dimensional array from a set of longs\n * and checks if the array's set representation matches the input set.\n */"} {"signature":"@ Test fun createThreeDimensionalArrayFromPrimitiveLongArray ( )","body":"{ val array = longArrayOf ( , , , , , , , , , , , ) val a = mk . ndarray ( array , , , ) assertEquals ( array . size , a . size ) a . data . getLongArray ( ) shouldBe array }","docstring":"/**\n * Creates a three-dimensional array from a primitive LongArray\n * and checks if the array's LongArray representation matches the input LongArray.\n */"} {"signature":"@ Test fun createLong3DArrayWithInitializationFunction ( )","body":"{ val a = mk . d3array < Long > ( , , ) { it + } val expected = longArrayOf ( , , , , , , , , , , , ) assertEquals ( expected . size , a . size ) a . data . getLongArray ( ) shouldBe expected }","docstring":"/**\n * Creates a three-dimensional array with a given size using an initialization function\n * and checks if the array's LongArray representation matches the expected output.\n */"} {"signature":"@ Test fun createLong3DArrayWithInitAndIndices ( )","body":"{ val a = mk . d3arrayIndices < Long > ( , , ) { i , j , k -> i * j + k . toLong ( ) } val expected = longArrayOf ( , , , , , , , , , , , ) assertEquals ( expected . size , a . size ) a . data . getLongArray ( ) shouldBe expected }","docstring":"/**\n * Creates a three-dimensional array with a given size using an initialization function and indices.\n * Checks if the array's LongArray representation matches the expected output.\n */"} {"signature":"@ OptIn ( ExperimentalMultikApi :: class ) @ Test fun createAlignedLong3DArray ( )","body":"{ val list = listOf ( listOf ( listOf ( , ) , listOf ( ) ) , listOf ( listOf ( , ) ) ) val expected = listOf ( listOf ( listOf ( , ) , listOf ( , ) ) , listOf ( listOf ( , ) , listOf ( , ) ) ) val a : D3Array < Long > = mk . createAlignedNDArray ( list , filling = ) assertEquals ( expected , a . toListD3 ( ) ) }","docstring":"/**\n * Tests the function 'createAlignedNDArray' that creates a three-dimensional array from a list of number lists.\n * The test asserts that:\n * - The output array's size matches the size of the longest list in the input\n * and all lists are filled to match this length.\n * - The lists shorter than the longest one are filled with the specified filling value.\n */"} {"signature":"@ Test fun createZeroFilledFloatArray ( )","body":"{ val dim1 = val dim2 = val dim3 = val a = mk . zeros < Float > ( dim1 , dim2 , dim3 ) assertEquals ( dim1 * dim2 * dim3 , a . size ) assertEquals ( dim1 * dim2 * dim3 , a . data . size ) assertTrue { a . all { it == } } }","docstring":"/**\n * This method checks if a float array of a given size is correctly created with all elements set to zero.\n */"} {"signature":"@ Test fun createFloatArrayFilledWithOnes ( )","body":"{ val dim1 = val dim2 = val dim3 = val a = mk . ones < Float > ( dim1 , dim2 , dim3 ) assertEquals ( dim1 * dim2 * dim3 , a . size ) assertEquals ( dim1 * dim2 * dim3 , a . data . size ) assertTrue { a . all { it == } } }","docstring":"/**\n * Creates a float array filled with ones of a given size and checks if all elements are set to one.\n */"} {"signature":"@ Test fun createThreeDimensionalArrayFromFloatList ( )","body":"{ val list = listOf ( listOf ( listOf ( , ) , listOf ( , ) ) , listOf ( listOf ( , ) , listOf ( , ) ) ) val a : D3Array < Float > = mk . ndarray ( list ) assertEquals ( list , a . toListD3 ( ) ) }","docstring":"/**\n * Creates a three-dimensional array from a list of float lists\n * and checks if the array's list representation matches the input list.\n */"} {"signature":"@ Test fun createThreeDimensionalArrayFromFloatSet ( )","body":"{ val set = setOf ( , , , , , , , , , , - , - ) val shape = intArrayOf ( , , ) val a : D3Array < Float > = mk . ndarray ( set , shape = shape ) assertEquals ( set . size , a . size ) assertEquals ( set , a . toSet ( ) ) }","docstring":"/**\n * Creates a three-dimensional array from a set of floats\n * and checks if the array's set representation matches the input set.\n */"} {"signature":"@ Test fun createThreeDimensionalArrayFromPrimitiveFloatArray ( )","body":"{ val array = floatArrayOf ( , , , , , , , , , , , ) val a = mk . ndarray ( array , , , ) assertEquals ( array . size , a . size ) a . data . getFloatArray ( ) shouldBe array }","docstring":"/**\n * Creates a three-dimensional array from a primitive FloatArray\n * and checks if the array's FloatArray representation matches the input FloatArray.\n */"} {"signature":"@ Test fun createFloat3DArrayWithInitializationFunction ( )","body":"{ val a = mk . d3array < Float > ( , , ) { it + } val expected = floatArrayOf ( , , , , , , , , , , , ) assertEquals ( expected . size , a . size ) a . data . getFloatArray ( ) shouldBe expected }","docstring":"/**\n * Creates a three-dimensional array with a given size using an initialization function\n * and checks if the array's FloatArray representation matches the expected output.\n */"} {"signature":"@ Test fun createFloat3DArrayWithInitAndIndices ( )","body":"{ val a = mk . d3arrayIndices < Float > ( , , ) { i , j , k -> i * j + k . toFloat ( ) } val expected = floatArrayOf ( , , , , , , , , , , , ) assertEquals ( expected . size , a . size ) a . data . getFloatArray ( ) shouldBe expected }","docstring":"/**\n * Creates a three-dimensional array with a given size using an initialization function and indices.\n * Checks if the array's FloatArray representation matches the expected output.\n */"} {"signature":"@ OptIn ( ExperimentalMultikApi :: class ) @ Test fun createAlignedFloat3DArray ( )","body":"{ val list = listOf ( listOf ( listOf ( , ) , listOf ( ) ) , listOf ( listOf ( , ) , ) ) val expected = listOf ( listOf ( listOf ( , ) , listOf ( , ) ) , listOf ( listOf ( , ) , listOf ( , ) ) ) val a : D3Array < Float > = mk . createAlignedNDArray ( list , filling = ) assertEquals ( expected , a . toListD3 ( ) ) }","docstring":"/**\n * Tests the function 'createAlignedNDArray' that creates a three-dimensional array from a list of number lists.\n * The test asserts that:\n * - The output array's size matches the size of the longest list in the input\n * and all lists are filled to match this length.\n * - The lists shorter than the longest one are filled with the specified filling value.\n */"} {"signature":"@ Test fun createZeroFilledDoubleArray ( )","body":"{ val dim1 = val dim2 = val dim3 = val a = mk . zeros < Double > ( dim1 , dim2 , dim3 ) assertEquals ( dim1 * dim2 * dim3 , a . size ) assertEquals ( dim1 * dim2 * dim3 , a . data . size ) assertTrue { a . all { it == } } }","docstring":"/**\n * This method checks if a double array of a given size is correctly created with all elements set to zero.\n */"} {"signature":"@ Test fun createDoubleArrayFilledWithOnes ( )","body":"{ val dim1 = val dim2 = val dim3 = val a = mk . ones < Double > ( dim1 , dim2 , dim3 ) assertEquals ( dim1 * dim2 * dim3 , a . size ) assertEquals ( dim1 * dim2 * dim3 , a . data . size ) assertTrue { a . all { it == } } }","docstring":"/**\n * Creates a double array filled with ones of a given size and checks if all elements are set to one.\n */"} {"signature":"@ Test fun createThreeDimensionalArrayFromDoubleList ( )","body":"{ val list = listOf ( listOf ( listOf ( , ) , listOf ( , ) ) , listOf ( listOf ( , ) , listOf ( , ) ) ) val a : D3Array < Double > = mk . ndarray ( list ) assertEquals ( list , a . toListD3 ( ) ) }","docstring":"/**\n * Creates a three-dimensional array from a list of double lists\n * and checks if the array's list representation matches the input list.\n */"} {"signature":"@ Test fun createThreeDimensionalArrayFromDoubleSet ( )","body":"{ val set = setOf ( , , , , , , , , , , - , - ) val shape = intArrayOf ( , , ) val a : D3Array < Double > = mk . ndarray ( set , shape = shape ) assertEquals ( set . size , a . size ) assertEquals ( set , a . toSet ( ) ) }","docstring":"/**\n * Creates a three-dimensional array from a set of doubles\n * and checks if the array's set representation matches the input set.\n */"} {"signature":"@ Test fun createThreeDimensionalArrayFromPrimitiveDoubleArray ( )","body":"{ val array = doubleArrayOf ( , , , , , , , , , , , ) val a = mk . ndarray ( array , , , ) assertEquals ( array . size , a . size ) a . data . getDoubleArray ( ) shouldBe array }","docstring":"/**\n * Creates a three-dimensional array from a primitive DoubleArray\n * and checks if the array's DoubleArray representation matches the input DoubleArray.\n */"} {"signature":"@ Test fun createDouble3DArrayWithInitializationFunction ( )","body":"{ val a = mk . d3array < Double > ( , , ) { it + } val expected = doubleArrayOf ( , , , , , , , , , , , ) assertEquals ( expected . size , a . size ) a . data . getDoubleArray ( ) shouldBe expected }","docstring":"/**\n * Creates a three-dimensional array with a given size using an initialization function\n * and checks if the array's DoubleArray representation matches the expected output.\n */"} {"signature":"@ Test fun createDouble3DArrayWithInitAndIndices ( )","body":"{ val a = mk . d3arrayIndices < Double > ( , , ) { i , j , k -> i * j + k . toDouble ( ) } val expected = doubleArrayOf ( , , , , , , , , , , , ) assertEquals ( expected . size , a . size ) a . data . getDoubleArray ( ) shouldBe expected }","docstring":"/**\n * Creates a three-dimensional array with a given size using an initialization function and indices.\n * Checks if the array's DoubleArray representation matches the expected output.\n */"} {"signature":"@ OptIn ( ExperimentalMultikApi :: class ) @ Test fun createAlignedDouble3DArray ( )","body":"{ val list = listOf ( listOf ( listOf ( , ) , listOf ( ) ) , listOf ( listOf ( , ) , ) ) val expected = listOf ( listOf ( listOf ( , ) , listOf ( , ) ) , listOf ( listOf ( , ) , listOf ( , ) ) ) val a : D3Array < Double > = mk . createAlignedNDArray ( list , filling = ) assertEquals ( expected , a . toListD3 ( ) ) }","docstring":"/**\n * Tests the function 'createAlignedNDArray' that creates a three-dimensional array from a list of number lists.\n * The test asserts that:\n * - The output array's size matches the size of the longest list in the input\n * and all lists are filled to match this length.\n * - The lists shorter than the longest one are filled with the specified filling value.\n */"} {"signature":"@ Test fun createZeroFilledComplexFloatArray ( )","body":"{ val dim1 = val dim2 = val dim3 = val a = mk . zeros < ComplexFloat > ( dim1 , dim2 , dim3 ) assertEquals ( dim1 * dim2 * dim3 , a . size ) assertEquals ( dim1 * dim2 * dim3 , a . data . size ) assertTrue { a . all { it == ComplexFloat . zero } } }","docstring":"/**\n * This method checks if a ComplexFloat array of a given size is correctly created with all elements set to zero.\n */"} {"signature":"@ Test fun createComplexFloatArrayFilledWithOnes ( )","body":"{ val dim1 = val dim2 = val dim3 = val a = mk . ones < ComplexFloat > ( dim1 , dim2 , dim3 ) assertEquals ( dim1 * dim2 * dim3 , a . size ) assertEquals ( dim1 * dim2 * dim3 , a . data . size ) assertTrue { a . all { it == ComplexFloat . one } } }","docstring":"/**\n * Creates a ComplexFloat array filled with ones of a given size and checks if all elements are set to one.\n */"} {"signature":"@ Test fun createThreeDimensionalArrayFromComplexFloatList ( )","body":"{ val list = listOf ( listOf ( listOf ( + . i , + . i ) , listOf ( + . i , + . i ) ) , listOf ( listOf ( + . i , + . i ) , listOf ( + . i , + . i ) ) ) val a : D3Array < ComplexFloat > = mk . ndarray ( list ) assertEquals ( list , a . toListD3 ( ) ) }","docstring":"/**\n * Creates a three-dimensional array from a list of complex float lists\n * and checks if the array's list representation matches the input list.\n */"} {"signature":"@ Test fun createThreeDimensionalArrayFromComplexFloatSet ( )","body":"{ val set = setOf ( + . i , + . i , + . i , + . i , + . i , + . i , + . i , + . i , + . i , + . i , - + . i , - + . i ) val shape = intArrayOf ( , , ) val a : D3Array < ComplexFloat > = mk . ndarray ( set , shape = shape ) assertEquals ( set . size , a . size ) assertEquals ( set , a . toSet ( ) ) }","docstring":"/**\n * Creates a three-dimensional array from a set of complex floats\n * and checks if the array's set representation matches the input set.\n */"} {"signature":"@ Test fun createThreeDimensionalArrayFromPrimitiveComplexFloatArray ( )","body":"{ val array = complexFloatArrayOf ( + . i , + . i , + . i , + . i , + . i , + . i , + . i , + . i , + . i , + . i , + . i , + . i ) val a = mk . ndarray ( array , , , ) assertEquals ( array . size , a . size ) a . data . getComplexFloatArray ( ) shouldBe array }","docstring":"/**\n * Creates a three-dimensional array from a primitive ComplexFloatArray\n * and checks if the array's ComplexFloatArray representation matches the input ComplexFloatArray.\n */"} {"signature":"@ Test fun createComplexFloat3DArrayWithInitializationFunction ( )","body":"{ val a = mk . d3array < ComplexFloat > ( , , ) { ComplexFloat ( it + , round ( ( it - ) * ) / ) } val expected = complexFloatArrayOf ( - . i , + . i , + . i , + . i , + . i , + . i , + . i , + . i , + . i , + . i , + . i , + . i ) assertEquals ( expected . size , a . size ) a . data . getComplexFloatArray ( ) shouldBe expected }","docstring":"/**\n * Creates a three-dimensional array with a given size using an initialization function\n * and checks if the array's ComplexFloatArray representation matches the expected output.\n */"} {"signature":"@ Test fun createComplexFloat3DArrayWithInitAndIndices ( )","body":"{ val a = mk . d3arrayIndices < ComplexFloat > ( , , ) { i , j , k -> i * j + k + ComplexFloat ( ) } val expected = complexFloatArrayOf ( + . i , + . i , + . i , + . i , + . i , + . i , + . i , + . i , + . i , + . i , + . i , + . i ) assertEquals ( expected . size , a . size ) a . data . getComplexFloatArray ( ) shouldBe expected }","docstring":"/**\n * Creates a three-dimensional array with a given size using an initialization function and indices.\n * Checks if the array's ComplexFloatArray representation matches the expected output.\n */"} {"signature":"@ Test fun createZeroFilledComplexDoubleArray ( )","body":"{ val dim1 = val dim2 = val dim3 = val a = mk . zeros < ComplexDouble > ( dim1 , dim2 , dim3 ) assertEquals ( dim1 * dim2 * dim3 , a . size ) assertEquals ( dim1 * dim2 * dim3 , a . data . size ) assertTrue { a . all { it == ComplexDouble . zero } } }","docstring":"/**\n * This method checks if a ComplexDouble array of a given size is correctly created with all elements set to zero.\n */"} {"signature":"@ Test fun createComplexDoubleArrayFilledWithOnes ( )","body":"{ val dim1 = val dim2 = val dim3 = val a = mk . ones < ComplexDouble > ( dim1 , dim2 , dim3 ) assertEquals ( dim1 * dim2 * dim3 , a . size ) assertEquals ( dim1 * dim2 * dim3 , a . data . size ) assertTrue { a . all { it == ComplexDouble . one } } }","docstring":"/**\n * Creates a ComplexDouble array filled with ones of a given size and checks if all elements are set to one.\n */"} {"signature":"@ Test fun createThreeDimensionalArrayFromComplexDoubleList ( )","body":"{ val list = listOf ( listOf ( listOf ( + . i , + . i ) , listOf ( + . i , + . i ) ) , listOf ( listOf ( + . i , + . i ) , listOf ( + . i , + . i ) ) ) val a : D3Array < ComplexDouble > = mk . ndarray ( list ) assertEquals ( list , a . toListD3 ( ) ) }","docstring":"/**\n * Creates a three-dimensional array from a list of byte lists\n * and checks if the array's list representation matches the input list.\n */"} {"signature":"@ Test fun createThreeDimensionalArrayFromComplexDoubleSet ( )","body":"{ val set = setOf ( + . i , + . i , + . i , + . i , + . i , + . i , + . i , + . i , + . i , + . i , - + . i , - + . i ) val shape = intArrayOf ( , , ) val a : D3Array < ComplexDouble > = mk . ndarray ( set , shape = shape ) assertEquals ( set . size , a . size ) assertEquals ( set , a . toSet ( ) ) }","docstring":"/**\n * Creates a three-dimensional array from a set of complex doubles\n * and checks if the array's set representation matches the input set.\n */"} {"signature":"@ Test fun createThreeDimensionalArrayFromPrimitiveComplexDoubleArray ( )","body":"{ val array = complexDoubleArrayOf ( + . i , + . i , + . i , + . i , + . i , + . i , + . i , + . i , + . i , + . i , + . i , + . i ) val a = mk . ndarray ( array , , , ) assertEquals ( array . size , a . size ) a . data . getComplexDoubleArray ( ) shouldBe array }","docstring":"/**\n * Creates a three-dimensional array from a primitive ComplexDoubleArray\n * and checks if the array's ComplexDoubleArray representation matches the input ComplexDoubleArray.\n */"} {"signature":"@ Test fun createComplexDouble3DArrayWithInitializationFunction ( )","body":"{ val a = mk . d3array < ComplexDouble > ( , , ) { ComplexDouble ( it + , round ( ( it - ) * ) / ) } val expected = complexDoubleArrayOf ( - . i , + . i , + . i , + . i , + . i , + . i , + . i , + . i , + . i , + . i , + . i , + . i ) assertEquals ( expected . size , a . size ) a . data . getComplexDoubleArray ( ) shouldBe expected }","docstring":"/**\n * Creates a three-dimensional array with a given size using an initialization function\n * and checks if the array's ComplexDoubleArray representation matches the expected output.\n */"} {"signature":"@ Test fun createComplexDouble3DArrayWithInitAndIndices ( )","body":"{ val a = mk . d3arrayIndices < ComplexDouble > ( , , ) { i , j , k -> i * j + k + ComplexDouble ( ) } val expected = complexDoubleArrayOf ( + . i , + . i , + . i , + . i , + . i , + . i , + . i , + . i , + . i , + . i , + . i , + . i ) assertEquals ( expected . size , a . size ) a . data . getComplexDoubleArray ( ) shouldBe expected }","docstring":"/**\n * Creates a three-dimensional array with a given size using an initialization function and indices.\n * Checks if the array's ComplexDoubleArray representation matches the expected output.\n */"} {"signature":"fun foo ( )","body":"{ }","docstring":"/**\n * [A.toName.length]\n */"} {"signature":"private fun compressDirectoryToZip ( snapshotFile : File , outputPath : File )","body":"{ snapshotFile . parentFile . mkdirs ( ) snapshotFile . createNewFile ( ) ZipOutputStream ( snapshotFile . outputStream ( ) . buffered ( ) ) . use { zip -> zip . setLevel ( Deflater . NO_COMPRESSION ) outputPath . walkTopDown ( ) . filter { file -> ! file . isDirectory || file . isEmptyDirectory } . forEach { file -> val suffix = if ( file . isDirectory ) \"\" else \"\" val entry = ZipEntry ( file . relativeTo ( outputPath ) . invariantSeparatorsPath + suffix ) zip . putNextEntry ( entry ) if ( ! file . isDirectory ) { file . inputStream ( ) . buffered ( ) . use { it . copyTo ( zip ) } } zip . closeEntry ( ) } zip . flush ( ) } }","docstring":"/**\n * Kotlin's compilation in a \"fat\" project may contain a lot of small files that is slow to copy\n * So we speeding it up by archiving them into single zip file without compression. Such approach reduces snapshotting\n * time up to half ot the time needed to copy similar files.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ ExperimentalUnsignedTypes public fun Collection < UByte > . toUByteArray ( ) : UByteArray","body":"{ val result = UByteArray ( size ) var index = for ( element in this ) result [ index ++ ] = element return result }","docstring":"/**\n * Returns an array of UByte containing all of the elements of this collection.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ ExperimentalUnsignedTypes public fun Collection < UInt > . toUIntArray ( ) : UIntArray","body":"{ val result = UIntArray ( size ) var index = for ( element in this ) result [ index ++ ] = element return result }","docstring":"/**\n * Returns an array of UInt containing all of the elements of this collection.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ ExperimentalUnsignedTypes public fun Collection < ULong > . toULongArray ( ) : ULongArray","body":"{ val result = ULongArray ( size ) var index = for ( element in this ) result [ index ++ ] = element return result }","docstring":"/**\n * Returns an array of ULong containing all of the elements of this collection.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ ExperimentalUnsignedTypes public fun Collection < UShort > . toUShortArray ( ) : UShortArray","body":"{ val result = UShortArray ( size ) var index = for ( element in this ) result [ index ++ ] = element return result }","docstring":"/**\n * Returns an array of UShort containing all of the elements of this collection.\n */"} {"signature":"@ kotlin . jvm . JvmName ( \"\" ) @ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalUnsignedTypes :: class ) public fun Iterable < UInt > . sum ( ) : UInt","body":"{ var sum : UInt = for ( element in this ) { sum += element } return sum }","docstring":"/**\n * Returns the sum of all elements in the collection.\n */"} {"signature":"@ kotlin . jvm . JvmName ( \"\" ) @ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalUnsignedTypes :: class ) public fun Iterable < ULong > . sum ( ) : ULong","body":"{ var sum : ULong = for ( element in this ) { sum += element } return sum }","docstring":"/**\n * Returns the sum of all elements in the collection.\n */"} {"signature":"@ kotlin . jvm . JvmName ( \"\" ) @ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalUnsignedTypes :: class ) public fun Iterable < UByte > . sum ( ) : UInt","body":"{ var sum : UInt = for ( element in this ) { sum += element } return sum }","docstring":"/**\n * Returns the sum of all elements in the collection.\n */"} {"signature":"@ kotlin . jvm . JvmName ( \"\" ) @ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalUnsignedTypes :: class ) public fun Iterable < UShort > . sum ( ) : UInt","body":"{ var sum : UInt = for ( element in this ) { sum += element } return sum }","docstring":"/**\n * Returns the sum of all elements in the collection.\n */"} {"signature":"fun dispose ( )","body":"fun dispose ( )","docstring":"/**\n * Disposes all native resources owned by this class. This function must be invoked\n * exactly once as the last operation on the corresponding class.\n */"} {"signature":"fun getTopLevelCallableSymbols ( callableId : CallableId , callableFiles : Collection < KtFile > ? ) : List < FirCallableSymbol < * > >","body":"{ if ( ! allowKotlinPackage && callableId . packageName . isKotlinPackage ( ) ) return emptyList ( ) return callablesByCallableId . getValue ( callableId , callableFiles ) }","docstring":"/**\n * [callableFiles] are the [KtFile]s which contain callables of the given package and name. If already known, they can be provided to\n * avoid index accesses.\n */"} {"signature":"private fun KtAnalysisSession . getDokkaScopeFrom ( namedClassOrObjectSymbol : KtNamedClassOrObjectSymbol , dri : DRI , includeStaticScope : Boolean = true ) : DokkaScope","body":"{ val scope = if ( includeStaticScope ) namedClassOrObjectSymbol . getCombinedMemberScope ( ) else namedClassOrObjectSymbol . getMemberScope ( ) val constructors = scope . getConstructors ( ) . map { visitConstructorSymbol ( it ) } . toList ( ) val callables = scope . getCallableSymbols ( ) . toList ( ) val classifiers = if ( includeStaticScope ) namedClassOrObjectSymbol . getStaticMemberScope ( ) . getClassifierSymbols ( ) else emptySequence ( ) val syntheticJavaProperties = namedClassOrObjectSymbol . buildSelfClassType ( ) . getSyntheticJavaPropertiesScope ( ) ? . getCallableSignatures ( ) ? . map { it . symbol } ? . filterIsInstance < KtSyntheticJavaPropertySymbol > ( ) ? : emptySequence ( ) fun List < KtJavaFieldSymbol > . filterOutSyntheticJavaPropBackingField ( ) = filterNot { javaField -> syntheticJavaProperties . any { it . hasBackingField && javaField . name == it . name } } val javaFields = callables . filterIsInstance < KtJavaFieldSymbol > ( ) . filterOutSyntheticJavaPropBackingField ( ) fun List < KtFunctionSymbol > . filterOutSyntheticJavaPropAccessors ( ) = filterNot { fn -> if ( fn . origin == KtSymbolOrigin . JAVA && fn . callableIdIfNonLocal != null ) syntheticJavaProperties . any { fn . callableIdIfNonLocal == it . javaGetterSymbol . callableIdIfNonLocal || fn . callableIdIfNonLocal == it . javaSetterSymbol ? . callableIdIfNonLocal } else false } val functions = callables . filterIsInstance < KtFunctionSymbol > ( ) . filterOutSyntheticJavaPropAccessors ( ) . map { visitFunctionSymbol ( it , dri ) } val properties = callables . filterIsInstance < KtPropertySymbol > ( ) . map { visitPropertySymbol ( it , dri ) } + syntheticJavaProperties . map { visitPropertySymbol ( it , dri ) } + javaFields . map { visitJavaFieldSymbol ( it , dri ) } fun Sequence < KtNamedClassOrObjectSymbol > . filterOutCompanion ( ) = filterNot { it . classKind == KtClassKind . COMPANION_OBJECT } val classlikes = classifiers . filterIsInstance < KtNamedClassOrObjectSymbol > ( ) . filterOutCompanion ( ) . map { visitNamedClassOrObjectSymbol ( it , dri ) } return DokkaScope ( constructors = constructors , functions = functions , properties = properties , classlikesWithoutCompanion = classlikes . toList ( ) ) }","docstring":"/**\n * @return a scope [DokkaScope] consisting of:\n * - primary and secondary constructors\n * - member functions, including inherited ones\n * - member properties, including inherited ones and synthetic java properties\n * - classlikes (classes and objects **except a companion**) that are explicitly declared in [namedClassOrObjectSymbol]\n * only if [includeStaticScope] is enabled\n *\n * @param includeStaticScope a flag to add static members, e.g. `valueOf`, `values` and `entries` members for Enum.\n * See [org.jetbrains.kotlin.analysis.api.components.KtScopeProvider.getStaticDeclaredMemberScope] for what a static scope is.\n */"} {"signature":"private fun DRI . getInheritedFromDRI ( dri : DRI ) : DRI ?","body":"{ return this . copy ( callable = null ) . takeIf { dri . classNames != this . classNames || dri . packageName != this . packageName } }","docstring":"/**\n * `createDRI` returns the DRI of the exact element and potential DRI of an element that is overriding it\n * (It can be also FAKE_OVERRIDE which is in fact just inheritance of the symbol)\n *\n * Looking at what PSIs do, they give the DRI of the element within the classnames where it is actually\n * declared and inheritedFrom as the same DRI but truncated callable part.\n * Therefore, we set callable to null and take the DRI only if it is indeed coming from different class.\n */"} {"signature":"@ PublishedApi @ Suppress ( \"\" ) internal inline fun checkBounds ( value : Boolean , index : Int , axis : Int , size : Int )","body":"{ if ( ! value ) { throw IndexOutOfBoundsException ( \"\" ) } }","docstring":"/**\n * Checks if the given index is within the bounds of the given axis and the size of the shape.\n *\n * @param value the boolean value representing whether the index is within bounds\n * @param index the integer value representing the index to check\n * @param axis the integer value representing the axis dimension to check against\n * @param size the integer value representing the size of the shape on the given axis dimension\n *\n * @throws IndexOutOfBoundsException when the index is out of bounds for the given axis and size\n */"} {"signature":"@ PublishedApi @ Suppress ( \"\" ) internal inline fun requireDimension ( dim : Dimension , shapeSize : Int )","body":"{ require ( dim . d == shapeSize || ( dim . d > && shapeSize > ) ) { \"\" } }","docstring":"/**\n * Checks if the given dimension matches the provided shape size, or if the dimension is greater than 4\n * and shape size is greater than 4.\n *\n * @param dim the input dimension object to check.\n * @param shapeSize the size of the shape to compare with.\n * @throws IllegalArgumentException if the dimension doesn't match the size of the shape.\n */"} {"signature":"@ PublishedApi @ Suppress ( \"\" ) internal inline fun requireShapeEmpty ( shape : IntArray )","body":"{ require ( shape . isNotEmpty ( ) ) { \"\" } }","docstring":"/**\n * Check if the given shape is empty.\n *\n * @param shape An array of integers representing the shape to be checked.\n * @throws IllegalArgumentException if the given shape is empty.\n */"} {"signature":"@ Suppress ( \"\" ) internal inline fun requireElementsWithShape ( elementSize : Int , shapeSize : Int )","body":"{ require ( elementSize == shapeSize ) { \"\" } }","docstring":"/**\n * Checks if the number of elements matches the specified shape.\n *\n * @param elementSize the number of elements in the element list\n * @param shapeSize the size of the given shape\n * @throws IllegalArgumentException if the number of elements doesn't match the shape\n */"} {"signature":"@ Suppress ( \"\" ) internal inline fun requireArraySizes ( rightSize : Int , otherSize : Int )","body":"{ require ( rightSize == otherSize ) { \"\" } }","docstring":"/**\n * Asserts that two array sizes are equal.\n *\n * @param rightSize the size of the right operand array\n * @param otherSize the size of the left operand array\n *\n * @throws IllegalArgumentException if the two sizes don't match\n */"} {"signature":"@ Suppress ( \"\" ) internal inline fun requireEqualShape ( left : IntArray , right : IntArray )","body":"{ require ( left . contentEquals ( right ) ) { \"\" } }","docstring":"/**\n * Checks if two given integer arrays have equal shape.\n *\n * @param left the first integer array to compare\n * @param right the second integer array to compare\n * @throws IllegalArgumentException if the shapes of the arrays do not match\n */"} {"signature":"@ Suppress ( \"\" ) internal inline fun requirePositiveShape ( dim : Int )","body":"{ require ( dim > ) { \"\" } }","docstring":"/**\n * Checks if the given dimension is positive or not. Throws an IllegalArgumentException if the shape is not positive.\n *\n * @param dim an integer representing the dimension of the shape.\n * @throws IllegalArgumentException if the shape dimension is not positive.\n */"} {"signature":"internal fun computeStrides ( shape : IntArray ) : IntArray","body":"= shape . copyOf ( ) . apply { this [ this . lastIndex ] = for ( i in this . lastIndex - downTo ) { this [ i ] = this [ i + ] * shape [ i + ] } }","docstring":"/**\n * Computes the strides for a multidimensional array given the shape.\n *\n * @param shape an array representing the shape of the multidimensional array\n * @return an integer array containing the strides of the multidimensional array\n */"} {"signature":"internal fun MultiArray < * , * > . actualAxis ( axis : Int ) : Int","body":"{ return if ( axis < ) dim . d + axis else axis }","docstring":"/**\n * Returns the actual axis index by converting a negative index to positive index relative to the array dimensions\n *\n * @param axis the index of the axis to retrieve\n * @return the actual axis index\n */"} {"signature":"@ PublishedApi internal fun IntArray . remove ( pos : Int ) : IntArray","body":"= when ( pos ) { -> sliceArray ( .. lastIndex ) lastIndex -> sliceArray ( until lastIndex ) else -> sliceArray ( until pos ) + sliceArray ( pos + .. lastIndex ) }","docstring":"/**\n * Removes the element at the specified position in this IntArray.\n *\n * @param pos the position of the element to be removed\n * @return the new IntArray with the element removed\n */"} {"signature":"internal fun IntArray . removeAll ( indices : List < Int > ) : IntArray","body":"= when { indices . isEmpty ( ) -> this indices . size == -> remove ( indices . first ( ) ) else -> this . filterIndexed { index , _ -> index !in indices } . toIntArray ( ) }","docstring":"/**\n * Removes elements from the array with indices specified in the given list.\n *\n * @param indices the list of element indices to be removed from the array.\n * @return the new array with requested elements removed, or the original array if the list is empty.\n */"} {"signature":"@ SinceKotlin ( \"\" ) public fun isInstance ( value : Any ? ) : Boolean","body":"@ SinceKotlin ( \"\" ) public fun isInstance ( value : Any ? ) : Boolean","docstring":"/**\n * Returns `true` if [value] is an instance of this class on a given platform.\n */"} {"signature":"fun isAccessToUnstableLocalVariable ( expression : FirElement , targetType : ConeKotlinType ? ) : Boolean","body":"= context . variableAssignmentAnalyzer . isAccessToUnstableLocalVariable ( expression , targetType , components . session )","docstring":"/**\n * When variable access resolution encounters a variable access which has smartcast information, assignments associated with that\n * variable are checked to determine variable stability, and therefore smartcast stability. These assignments are tracked by\n * [FirLocalVariableAssignmentAnalyzer], which knows how each assignment may limit variable stability, like assignments within or after\n * a non-in-place lambda body. So for a given lexical scope (function body, lambda body, and even local class init) and a given\n * variable, [FirLocalVariableAssignmentAnalyzer] knows all associated assignments (past and/or future) which could limit stability.\n *\n * When a [targetType] is provided, all assignments are checked for the specified variable access expression:\n * 1. If there are no assignments, the variable is always considered **stable**.\n * 2. If there is an unresolved assignment type, the variable is considered **unstable**.\n * 3. If any resolved assignment type is not a subtype of the [targetType], the variable is considered **unstable**.\n * 4. If none of the previous conditions are true, the variable is considered **stable**.\n *\n * When a [targetType] is **not** provided, **any** assignments cause the variable to be considered **unstable**.\n *\n * @param expression The variable access expression.\n * @param targetType Smartcast target type (optional: see function description).\n *\n * @see [getTypeUsingSmartcastInfo]\n * @see [FirLocalVariableAssignmentAnalyzer.isAccessToUnstableLocalVariable]\n * @see [FirLocalVariableAssignmentAnalyzer.isStableType]\n */"} {"signature":"open fun getTypeUsingSmartcastInfo ( expression : FirExpression ) : Pair < PropertyStability , MutableList < ConeKotlinType > > ?","body":"{ val flow = currentSmartCastPosition ? : return null val variable = getRealVariableWithoutUnwrappingAlias ( flow , expression ) ? : return null val types = flow . getTypeStatement ( variable ) ? . exactType ? . ifEmpty { null } ? : return null return variable . stability to types . toMutableList ( ) }","docstring":"/**\n * Retrieve smartcast type information [FirDataFlowAnalyzer] may have for the specified variable access expression. Type information\n * is **stateful** and changes as the FIR tree is navigated by [FirDataFlowAnalyzer].\n *\n * @param expression The variable access expression.\n */"} {"signature":"private fun isSmartcastPrimitive ( classId : ClassId ? ) : Boolean","body":"{ return when ( classId ) { StandardClassIds . String , -> true else -> false } }","docstring":"/**\n * Determines if type smart-casting to the specified [ClassId] can be performed when values are\n * compared via equality. Because this is determined using the ClassId, only standard built-in\n * types are considered.\n */"} {"signature":"public fun horizontal ( name : String , yAxis : Number ) : MarkLine","body":"= MarkLine ( nameML = name , xAxis = yAxis . toDouble ( ) )","docstring":"/**\n * Returns a horizontal line along a point on the y-axis.\n */"} {"signature":"public fun vertical ( name : String , xAxis : Number ) : MarkLine","body":"= MarkLine ( nameML = name , xAxis = xAxis . toDouble ( ) )","docstring":"/**\n * Returns a horizontal line along a point on the x-axis.\n */"} {"signature":"@ ExperimentalKotlinGradlePluginApi fun KotlinHierarchyTemplate ( describe : KotlinHierarchyBuilder . Root . ( ) -> Unit , ) : KotlinHierarchyTemplate","body":"{ return KotlinHierarchyTemplateImpl ( describe ) }","docstring":"/**\n * @suppress TODO: KT-58858 add documentation\n */"} {"signature":"@ ExperimentalKotlinGradlePluginApi fun KotlinHierarchyTemplate . extend ( describe : KotlinHierarchyBuilder . Root . ( ) -> Unit ) : KotlinHierarchyTemplate","body":"{ return KotlinHierarchyTemplate { this@extend . impl . layout ( this ) describe ( ) } }","docstring":"/**\n * @suppress TODO: KT-58858 add documentation\n */"} {"signature":"@ InternalKotlinGradlePluginApi @ OptIn ( ExperimentalKotlinGradlePluginApi :: class ) fun KotlinHierarchyBuilder . Root . applyHierarchyTemplate ( template : KotlinHierarchyTemplate )","body":"{ template . impl . layout ( this ) }","docstring":"/**\n * @suppress TODO: KT-58858 add documentation\n */"} {"signature":"@ Benchmark fun addAndRemoveAll_All ( ) : Boolean","body":"{ val builder = persistentListBuilderAddIndexes ( ) val elementsToRemove = List ( size ) { it } return builder . removeAll ( elementsToRemove ) }","docstring":"/**\n * Adds [size] elements to an empty persistent list builder\n * and then removes all of them using `removeAll(elements)` operation.\n */"} {"signature":"@ Benchmark fun addAndRemoveAll_RandomHalf ( ) : Boolean","body":"{ val builder = persistentListBuilderAddIndexes ( ) val elementsToRemove = randomIndexes ( size / ) return builder . removeAll ( elementsToRemove ) }","docstring":"/**\n * Adds [size] elements to an empty persistent list builder\n * and then removes half of them using `removeAll(elements)` operation.\n */"} {"signature":"@ Benchmark fun addAndRemoveAll_RandomTen ( ) : Boolean","body":"{ val builder = persistentListBuilderAddIndexes ( ) val elementsToRemove = randomIndexes ( ) return builder . removeAll ( elementsToRemove ) }","docstring":"/**\n * Adds [size] elements to an empty persistent list builder\n * and then removes 10 of them using `removeAll(elements)` operation.\n */"} {"signature":"@ Benchmark fun addAndRemoveAll_Tail ( ) : Boolean","body":"{ val builder = persistentListBuilderAddIndexes ( ) val elementsToRemove = List ( tailSize ( ) ) { size - - it } return builder . removeAll ( elementsToRemove ) }","docstring":"/**\n * Adds [size] elements to an empty persistent list builder\n * and then removes last [tailSize] of them using `removeAll(elements)` operation.\n */"} {"signature":"@ Benchmark fun addAndRemoveAll_NonExisting ( ) : Boolean","body":"{ val builder = persistentListBuilderAddIndexes ( ) val elementsToRemove = randomIndexes ( ) . map { size + it } return builder . removeAll ( elementsToRemove ) }","docstring":"/**\n * Adds [size] elements to an empty persistent list builder\n * and then removes 10 non-existing elements using `removeAll(elements)` operation.\n */"} {"signature":"fun removeUnusedLocalFunctionDeclarations ( root : JsNode )","body":"{ val removable = with ( UnusedInstanceCollector ( ) ) { accept ( root ) removableDeclarations } NodeRemover ( JsStatement :: class . java ) { it in removable } . accept ( root ) }","docstring":"/**\n * Removes unused local function declarations like:\n * var inc = _.foo.f$inc(a)\n *\n * Declaration can become unused, if inlining happened.\n */"} {"signature":"inline fun < T , R > Iterable < T > . flatMapToNullableSet ( transform : ( T ) -> Iterable < R > ? ) : Set < R > ?","body":"= flatMapTo ( mutableSetOf ( ) ) { transform ( it ) ? : return null } . ifEmpty { emptySet ( ) }","docstring":"/**\n * Works almost as regular flatMap, but returns a set and returns null if any lambda call returned null\n */"} {"signature":"inline fun < T , R > Collection < T > . mapToSetOrEmpty ( transform : ( T ) -> R ) : Set < R >","body":"= if ( isNotEmpty ( ) ) mapTo ( mutableSetOf ( ) , transform ) else emptySet ( )","docstring":"/**\n * Maps all elements of this non-empty collection with the given [transform] function to a new mutable set, or returns [emptySet] if this\n * collection is empty.\n *\n * [mapToSetOrEmpty] should be preferred over `collection.mapTo(mutableSetOf()) { ... }` when `collection` may be empty and the resulting\n * set may be cached, because [mapToSetOrEmpty] saves memory by avoiding the creation of an empty mutable set.\n */"} {"signature":"fun foo ( )","body":"{ }","docstring":"/**\n * Doc\n * comment\n */"} {"signature":"public abstract fun findInternalFilesForFacade ( facadeFqName : FqName ) : Collection < KtFile >","body":"public abstract fun findInternalFilesForFacade ( facadeFqName : FqName ) : Collection < KtFile >","docstring":"/**\n * Currently we want only classes from libraries ([org.jetbrains.kotlin.analysis.decompiler.psi.file.KtClsFile])\n */"} {"signature":"public open fun computePackageNames ( ) : Set < String > ?","body":"= null","docstring":"/**\n * Calculates the set of package names which can be provided by this declaration provider.\n *\n * The set may contain false positives. `null` may be returned if the package set is too expensive or impossible to compute.\n *\n * [computePackageNames] is used as the default implementation for [computePackageNamesWithTopLevelClassifiers] and\n * [computePackageNamesWithTopLevelCallables] if either returns `null`. It depends on the declaration provider whether it's worth\n * computing separate package sets for classifiers and callables, or just one set containing all package names.\n */"} {"signature":"public open fun computePackageNamesWithTopLevelClassifiers ( ) : Set < String > ?","body":"= computePackageNames ( )","docstring":"/**\n * Calculates the set of package names which contain classifiers and can be provided by this declaration provider.\n *\n * The set may contain false positives. `null` may be returned if the package set is too expensive or impossible to compute.\n */"} {"signature":"public open fun computePackageNamesWithTopLevelCallables ( ) : Set < String > ?","body":"= computePackageNames ( )","docstring":"/**\n * Calculates the set of package names which contain callables and can be provided by this declaration provider.\n *\n * The set may contain false positives. `null` may be returned if the package set is too expensive or impossible to compute.\n */"} {"signature":"public fun Project . createDeclarationProvider ( scope : GlobalSearchScope , contextualModule : KtModule ? ) : KotlinDeclarationProvider","body":"= KotlinDeclarationProviderFactory . getInstance ( this ) . createDeclarationProvider ( scope , contextualModule )","docstring":"/**\n * Creates a [KotlinDeclarationProvider] providing symbols within the given [scope].\n *\n * The [contextualModule] is the module which contains the symbols to be provided, if applicable. The declaration provider may use the\n * contextual module to provide declarations differently, such as providing alternative declarations for an outsider module. Some\n * functionality such as package set computation may also depend on the contextual module, as the declaration provider may require\n * additional information not available in the [scope].\n */"} {"signature":"override fun getExternalAnnotationsRoots ( libraryFile : VirtualFile ) : List < VirtualFile >","body":"= externalAnnotationsRoots","docstring":"/**\n * We simply returns [externalAnnotationsRoots] because there is all our declared 'annotations.xml' files\n *\n * @param libraryFile is a file for which we want to find the corresponding external annotations file if it exists\n */"} {"signature":"fun KotlinPlatform . getRuntimeType ( name : String , nullable : Boolean = false ) : StubType","body":"{ val classifier = Classifier . topLevel ( cinteropPackage , name ) PredefinedTypesHandler . tryExpandPlatformDependentTypealias ( classifier , this , nullable ) ? . let { return it } return ClassifierStubType ( classifier , nullable = nullable ) }","docstring":"/**\n * @return type from kotlinx.cinterop package\n */"} {"signature":"private fun getVarOfTypeFor ( primitiveType : KotlinClassifierType , nullable : Boolean ) : ClassifierStubType","body":"{ val typeVarOf = \"\" val classifier = Classifier . topLevel ( cInteropPackage , typeVarOf ) return ClassifierStubType ( classifier , listOf ( TypeArgumentStub ( primitiveType . toStubIrType ( ) ) ) , nullable = nullable ) }","docstring":"/**\n * @param primitiveType primitive type from kotlin package.\n * @return kotlinx.cinterop.[primitiveType]VarOf<[primitiveType]>\n */"} {"signature":"private fun expandPrimitiveVarType ( primitiveVarClassifier : Classifier , nullable : Boolean ) : AbbreviatedType","body":"{ val primitiveType = primitiveVarClassifierToPrimitiveType . getValue ( primitiveVarClassifier ) val underlyingType = getVarOfTypeFor ( primitiveType , nullable ) return AbbreviatedType ( underlyingType , primitiveVarClassifier , listOf ( ) , nullable ) }","docstring":"/**\n * @param primitiveVarType one of kotlinx.cinterop.{primitive}Var types.\n * @return typealias in terms of StubIR types.\n */"} {"signature":"fun tryExpandPredefinedTypealias ( classifier : Classifier , nullable : Boolean , typeArguments : List < TypeArgument > ) : AbbreviatedType ?","body":"= when ( classifier ) { in primitiveVarClassifierToPrimitiveType . keys -> expandPrimitiveVarType ( classifier , nullable ) KotlinTypes . cOpaquePointer . classifier -> expandCOpaquePointer ( nullable ) KotlinTypes . cOpaquePointerVar . classifier -> expandCOpaquePointerVar ( nullable ) KotlinTypes . cPointerVar -> expandCPointerVar ( typeArguments , nullable ) KotlinTypes . objCObjectMeta -> expandObjCObjectMeta ( typeArguments , nullable ) KotlinTypes . cArrayPointer -> expandCArrayPointer ( typeArguments , nullable ) KotlinTypes . objCBlockVar -> expandObjCBlockVar ( typeArguments , nullable ) else -> null }","docstring":"/**\n * @return [ClassifierStubType] if [classifier] is a typealias from [kotlinx.cinterop] package.\n */"} {"signature":"fun tryExpandPlatformDependentTypealias ( classifier : Classifier , platform : KotlinPlatform , nullable : Boolean ) : StubType ?","body":"= when ( classifier ) { nativePtrClassifier -> expandNativePtr ( platform , nullable ) else -> null }","docstring":"/**\n * Variant of [tryExpandPredefinedTypealias] with [platform]-dependent result.\n */"} {"signature":"fun isAbstractOnJvmIgnoringActualModality ( descriptor : FunctionDescriptor , jvmDefaultMode : JvmDefaultMode ) : Boolean","body":"{ if ( ! DescriptorUtils . isInterface ( descriptor . containingDeclaration ) ) return false return ! descriptor . isJvmDefaultOrPlatformDependent ( jvmDefaultMode ) }","docstring":"/**\n * @return return true for interface method not annotated with @JvmDefault or @PlatformDependent\n */"} {"signature":"fun main ( )","body":"{ val ( train , _ ) = mnist ( ) val inferenceModel = TensorFlowInferenceModel . load ( File ( PATH_TO_MODEL ) , loadOptimizerState = true ) inferenceModel . use { var accuracy = val amountOfTestSet = for ( imageId in .. amountOfTestSet ) { val prediction = it . predict ( train . getX ( imageId ) ) if ( prediction == train . getY ( imageId ) . toInt ( ) ) accuracy += ( / amountOfTestSet ) } println ( \"\" ) } }","docstring":"/**\n * Inference model is used here, separately from model training code to illustrate the ability to load model graph and weights to start prediction process.\n *\n * NOTE: The example requires the saved model in the appropriate directory (run [lenetOnMnistDatasetExportImportToTxt] firstly).\n */"} {"signature":"private fun getMangledNameFor ( declarationName : String , parent : IrDeclarationParent ) : Name","body":"{ val prefix = parent . fqNameForIrSerialization return \"\" . synthesizedName }","docstring":"/**\n * Generate name for declaration that will be a part of internal ABI.\n */"} {"signature":"private inline fun < R : Any > dumpCoroutinesInfoImpl ( crossinline create : ( CoroutineOwner < * > , CoroutineContext ) -> R ) : List < R >","body":"{ check ( isInstalled ) { \"\" } return capturedCoroutines . asSequence ( ) . sortedBy { it . info . sequenceNumber } . mapNotNull { owner -> if ( owner . isFinished ( ) ) null else owner . info . context ? . let { context -> create ( owner , context ) } } . toList ( ) }","docstring":"/**\n * Private method that dumps coroutines so that different public-facing method can use\n * to produce different result types.\n */"} {"signature":"private fun enhanceStackTraceWithThreadDumpImpl ( state : String , thread : Thread ? , coroutineTrace : List < StackTraceElement > ) : List < StackTraceElement >","body":"{ if ( state != RUNNING || thread == null ) return coroutineTrace val actualTrace = runCatching { thread . stackTrace } . getOrNull ( ) ? : return coroutineTrace val indexOfResumeWith = actualTrace . indexOfFirst { it . className == \"\" && it . methodName == \"\" && it . fileName == \"\" } val ( continuationStartFrame , delta ) = findContinuationStartIndex ( indexOfResumeWith , actualTrace , coroutineTrace ) if ( continuationStartFrame == - ) return coroutineTrace val expectedSize = indexOfResumeWith + coroutineTrace . size - continuationStartFrame - - delta val result = ArrayList < StackTraceElement > ( expectedSize ) for ( index in until indexOfResumeWith - delta ) { result += actualTrace [ index ] } for ( index in continuationStartFrame + until coroutineTrace . size ) { result += coroutineTrace [ index ] } return result }","docstring":"/**\n * Tries to enhance [coroutineTrace] (obtained by call to [DebugCoroutineInfoImpl.lastObservedStackTrace]) with\n * thread dump of [DebugCoroutineInfoImpl.lastObservedThread].\n *\n * Returns [coroutineTrace] if enhancement was unsuccessful or the enhancement result.\n */"} {"signature":"private fun findContinuationStartIndex ( indexOfResumeWith : Int , actualTrace : Array < StackTraceElement > , coroutineTrace : List < StackTraceElement > ) : Pair < Int , Int >","body":"{ repeat ( ) { val result = findIndexOfFrame ( indexOfResumeWith - - it , actualTrace , coroutineTrace ) if ( result != - ) return result to it } return - to }","docstring":"/**\n * Tries to find the lowest meaningful frame above `resumeWith` in the real stacktrace and\n * its match in a coroutines stacktrace (steps 2-3 in heuristic).\n *\n * This method does more than just matching `realTrace.indexOf(resumeWith) - 1`:\n * If method above `resumeWith` has no line number (thus it is `stateMachine.invokeSuspend`),\n * it's skipped and attempt to match next one is made because state machine could have been missing in the original coroutine stacktrace.\n *\n * Returns index of such frame (or -1) and number of skipped frames (up to 2, for state machine and for access$).\n */"} {"signature":"fun getIncrementalProcessorsFromClasspath ( names : Set < String > , classpath : Iterable < File > ) : Map < String , DeclaredProcType >","body":"{ val finalValues = mutableMapOf < String , DeclaredProcType > ( ) classpath . forEach { entry -> val fromEntry = processSingleClasspathEntry ( entry ) fromEntry . filter { names . contains ( it . key ) } . forEach { finalValues [ it . key ] = it . value } if ( finalValues . size == names . size ) return finalValues } return finalValues }","docstring":"/** Checks the incremental annotation processor information for the annotation processor classpath. */"} {"signature":"internal expect fun withCaughtException ( block : ( ) -> Unit ) : Throwable ?","body":"internal expect fun withCaughtException ( block : ( ) -> Unit ) : Throwable ?","docstring":"/**\n * Kotlin/Wasm can't handle exceptions thrown by a JS runtime.\n * This function wraps a block that may potentially throw something and returns an exception if it was caught.\n */"} {"signature":"override fun clearValueInfo ( value : DataFlowValue , languageVersionSettings : LanguageVersionSettings ) : DataFlowInfo","body":"{ val resultNullabilityInfo = hashMapOf < DataFlowValue , Nullability > ( ) putNullabilityAndTypeInfo ( resultNullabilityInfo , value , value . immanentNullability , languageVersionSettings ) return create ( this , resultNullabilityInfo , EMPTY_TYPE_INFO , value ) }","docstring":"/**\n * Call this function to clear all data flow information about\n * the given data flow value.\n\n * @param value\n */"} {"signature":"fun getLambdaMetafactoryArguments ( reference : IrFunctionReference , samType : IrType , plainLambda : Boolean ) : MetafactoryArgumentsResult","body":"{ val samClass = samType . getClass ( ) ? : throw AssertionError ( \"\" ) var semanticsHazard = false var abiHazard = false var inliningHazard = false var shouldBeSerializable = false var functionHazard = false if ( ! reference . origin . isLambda && ( ! samClass . isFromJava ( ) || isJavaSamConversionWithEqualsHashCode ) ) { semanticsHazard = true } if ( samClass . isInheritedFromSerializable ( ) ) { shouldBeSerializable = true } val samMethod = samClass . getSingleAbstractMethod ( ) ? : throw AssertionError ( \"\" ) if ( samMethod . isSuspend ) { abiHazard = true } if ( samClass . requiresDelegationToDefaultImpls ( ) ) { abiHazard = true } val implFun = reference . symbol . owner if ( implFun . typeParameters . any { it . isReified } ) { functionHazard = true } if ( context . getIntrinsic ( implFun . symbol ) != null ) { functionHazard = true } if ( implFun . isInline ) { functionHazard = true } if ( isConstructorRequiringAccessor ( implFun ) ) { functionHazard = true } if ( implFun is IrSimpleFunction ) { val baseFun = findSuperDeclaration ( implFun , false , context . config . jvmDefaultMode ) val baseFunClass = baseFun . parent as? IrClass if ( baseFunClass != null && baseFunClass . visibility == JavaDescriptorVisibilities . PACKAGE_VISIBILITY ) { functionHazard = true } } val implFunParent = implFun . parent if ( implFunParent is IrClass && implFunParent . origin == IrDeclarationOrigin . JVM_MULTIFILE_CLASS ) { functionHazard = true } if ( reference . origin . isLambda && implFun . annotations . isNotEmpty ( ) ) { abiHazard = true } if ( plainLambda ) { var parametersCount = implFun . valueParameters . size if ( implFun . extensionReceiverParameter != null ) ++ parametersCount if ( parametersCount >= BuiltInFunctionArity . BIG_ARITY ) abiHazard = true } if ( implFun . parents . any { it . isInlineFunction ( ) || it . isCrossinlineLambda ( ) } ) { inliningHazard = true } if ( samType is IrSimpleType ) { if ( samType . arguments . any { it is IrStarProjection || it is IrTypeProjection && it . variance != Variance . INVARIANT } ) { abiHazard = true } } when { semanticsHazard -> return MetafactoryArgumentsResult . Failure . LambdaMetafactorySemanticsHazard abiHazard -> return MetafactoryArgumentsResult . Failure . LambdaMetafactoryAbiHazard inliningHazard -> return MetafactoryArgumentsResult . Failure . InliningHazard functionHazard -> return MetafactoryArgumentsResult . Failure . FunctionHazard } return getLambdaMetafactoryArgsOrNullInner ( reference , samMethod , samType , implFun , shouldBeSerializable ) ? : MetafactoryArgumentsResult . Failure . FunctionHazard }","docstring":"/**\n * @see java.lang.invoke.LambdaMetafactory\n */"} {"signature":"@ ParameterizedTest ( name = \"\" ) @ ArgumentsSource ( AllSupportedTestedVersionsArgumentsProvider :: class ) fun execute ( buildVersions : BuildVersions )","body":"{ val result = createGradleRunner ( buildVersions , \"\" , \"\" , \"\" ) . buildRelaxed ( ) assertEquals ( TaskOutcome . SUCCESS , assertNotNull ( result . task ( \"\" ) ) . outcome ) val outputDir = File ( projectDir , \"\" ) assertTrue ( outputDir . isDirectory , \"\" ) val result2 = createGradleRunner ( buildVersions , \"\" , \"\" , \"\" , \"\" ) . buildRelaxed ( ) assertEquals ( TaskOutcome . SUCCESS , assertNotNull ( result2 . task ( \"\" ) ) . outcome ) val outputDir2 = File ( projectDir , \"\" ) assertTrue ( outputDir2 . isDirectory , \"\" ) val result3 = createGradleRunner ( buildVersions , \"\" , \"\" , \"\" , \"\" ) . buildRelaxed ( ) assertEquals ( TaskOutcome . SUCCESS , assertNotNull ( result3 . task ( \"\" ) ) . outcome ) val outputDirMultiModule = File ( projectDir , \"\" ) assertTrue ( outputDirMultiModule . isDirectory , \"\" ) val version1_0 = outputDirMultiModule . resolve ( \"\" ) . resolve ( \"\" ) val version1_1 = outputDirMultiModule . resolve ( \"\" ) . resolve ( \"\" ) assertTrue ( version1_0 . isDirectory , \"\" ) assertTrue ( version1_1 . isDirectory , \"\" ) assertFalse ( version1_0 . resolve ( \"\" ) . exists ( ) , \"\" ) assertFalse ( version1_1 . resolve ( \"\" ) . exists ( ) , \"\" ) val parsedIndex = Jsoup . parse ( outputDirMultiModule . resolve ( \"\" ) . readText ( ) ) val dropdown = parsedIndex . select ( \"\" ) . firstOrNull ( ) assertNotNull ( dropdown ) val links = dropdown . select ( \"\" ) assertEquals ( , links . count ( ) , \"\" ) assertEquals ( listOf ( \"\" to \"\" , \"\" to \"\" , \"\" to \"\" ) , links . map { it . text ( ) to it . attr ( \"\" ) } ) }","docstring":"/**\n * This test runs versioning 3 times to simulate how users might use it in the real word\n *\n * Each version has a separate task that has a different version number from 1.0 to 1.2 and is placed under `buildDir/dokkas/`\n *\n * Output is produced in a standard build directory under `build/dokka/htmlMultiModule`\n */"} {"signature":"@ SinceKotlin ( \"\" ) public fun Random . asJavaRandom ( ) : java . util . Random","body":"= ( this as? AbstractPlatformRandom ) ? . impl ? : KotlinRandom ( this )","docstring":"/**\n * Creates a [java.util.Random][java.util.Random] instance that uses the specified Kotlin [Random] generator as a randomness source.\n */"} {"signature":"@ SinceKotlin ( \"\" ) public fun java . util . Random . asKotlinRandom ( ) : Random","body":"= ( this as? KotlinRandom ) ? . impl ? : PlatformRandom ( this )","docstring":"/**\n * Creates a Kotlin [Random] instance that uses the specified [java.util.Random][java.util.Random] generator as a randomness source.\n */"} {"signature":"protected fun assertPreprocessedTestDataAreEqual ( testServices : TestServices , baseFile : File , baseContent : String , customFile : File , customContent : String , message : ( ) -> String , )","body":"{ val processedBaseContent = testServices . sourceFileProvider . getContentOfSourceFile ( TestFile ( baseFile . path , baseContent , baseFile , startLineNumberInOriginalFile = , isAdditional = false , RegisteredDirectives . Empty , ) ) . replace ( \"\" , \"\" ) val processedLlContent = testServices . sourceFileProvider . getContentOfSourceFile ( TestFile ( customFile . path , customContent , customFile , startLineNumberInOriginalFile = , isAdditional = false , RegisteredDirectives . Empty , ) ) . replace ( \"\" , \"\" ) testServices . assertions . assertEquals ( processedBaseContent , processedLlContent , message ) }","docstring":"/**\n * Asserts that [baseFile] and [customFile] have the same content after preprocessing (which removes diagnostics and other meta info). This\n * prevents situations where one test data changes, but changes to the other test data are forgotten.\n */"} {"signature":"fun configureTask ( task : Task )","body":"{ task . inputs . files ( devMavenRepositoriesInputFiles ) . withPropertyName ( \"\" ) . withPathSensitivity ( RELATIVE ) task . dependsOn ( devMavenRepositories ) if ( task is JavaForkOptions ) { task . doFirst ( \"\" ) { task . systemProperty ( \"\" , devMavenRepositories . joinToString ( \"\" ) { it . canonicalFile . invariantSeparatorsPath } ) } } }","docstring":"/**\n * Configures [task] to register [devMavenRepositories] as a task input,\n * and (if possible) adds `devMavenRepository` as a [JavaForkOptions.systemProperty].\n */"} {"signature":"fun usage ( )","body":"{ }","docstring":"/**\n * [foo]\n *\n * [foo.foo]\n * [foo.foo]\n */"} {"signature":"fun main ( )","body":"{ val output = PrintWriter ( System . out , true ) RootCommand . commands . forEach { command -> MarkdownPrinter . printUsage ( command , output ) } }","docstring":"/**\n * Used for internal purposes to generate documentation.\n * Not an actual test\n */"} {"signature":"fun KtAnalysisSession . renderResolvedTo ( symbols : List < KtSymbol > , renderPsiClassName : Boolean = false , renderer : KtDeclarationRenderer = KtDeclarationRendererForDebug . WITH_QUALIFIED_NAMES , additionalInfo : KtAnalysisSession . ( KtSymbol ) -> String ? = { null } ) : String","body":"{ if ( symbols . isEmpty ( ) ) return UNRESOLVED_REFERENCE_RESULT return symbols . map { renderResolveResult ( it , renderPsiClassName , renderer , additionalInfo ) } . sorted ( ) . withIndex ( ) . joinToString ( separator = \"\" ) { \"\" } }","docstring":"/**\n * Empty [symbols] list equals to unresolved reference.\n */"} {"signature":"fun test1 ( )","body":"{ }","docstring":"/**\n * [Foo.ext]\n *\n * [Outer.Foo.ext]\n * [test.Outer.Foo.ext]\n *\n * [test.Foo.ext]\n */"} {"signature":"fun test2 ( )","body":"{ }","docstring":"/**\n * [Foo.ext]\n *\n * [Nested.Foo.ext]\n * [Outer.Nested.Foo.ext]\n * [test.Outer.Nested.Foo.ext]\n *\n * [test.Foo.ext]\n */"} {"signature":"fun resnet50easyPrediction ( )","body":"{ val modelHub = TFModelHub ( cacheDirectory = File ( \"\" ) ) val model = TFModels . CV . ResNet50 ( ) . pretrainedModel ( modelHub ) model . printSummary ( ) model . use { for ( i in .. ) { val imageFile = getFileFromResource ( \"\" ) val recognizedObject = it . predictObject ( imageFile = imageFile ) println ( recognizedObject ) val top5 = it . predictTopKObjects ( imageFile = imageFile , topK = ) println ( top5 . toString ( ) ) } } }","docstring":"/**\n * This example demonstrates the inference concept on ResNet'50 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 * - No additional training.\n * - No new layers are added.\n * - Special preprocessing (used in ResNet'50 during training on ImageNet dataset) is applied to each image before prediction.\n */"} {"signature":"fun main ( ) : Unit","body":"= resnet50easyPrediction ( )","docstring":"/** */"} {"signature":"private fun shouldDoReverseCheck ( overrideCandidate : FirSimpleFunction ) : Boolean","body":"{ return ! session . languageVersionSettings . supportsFeature ( LanguageFeature . JavaTypeParameterDefaultRepresentationWithDNN ) && overrideCandidate . typeParameters . isNotEmpty ( ) }","docstring":"/**\n * Without [LanguageFeature.JavaTypeParameterDefaultRepresentationWithDNN] enabled,\n * the check is unfortunately not symmetrical in a case when the declarations are generic, DNNs are used,\n * and one of them has a flexible upper bound while the other one doesn't.\n *\n * See compiler/testData/diagnostics/tests/j+k/overrideWithTypeParameter.kt\n */"} {"signature":"private fun KDoc . findSectionsContainingTag ( tag : KDocKnownTag ) : List < KDocSection >","body":"{ return getChildrenOfType < KDocSection > ( ) . filter { it . findTagByName ( tag . name . toLowerCaseAsciiOnly ( ) ) != null } }","docstring":"/**\n * Looks for sections that have a deeply nested [tag],\n * as opposed to [KDoc.findSectionByTag], which only looks among the top level\n */"} {"signature":"fun BuildResult . getOutputForTask ( taskPath : String , logLevel : LogLevel = LogLevel . DEBUG ) : String","body":"= getOutputForTask ( taskPath , output , logLevel )","docstring":"/**\n * Gets the output produced by a specific task during a Gradle build.\n *\n * @param taskPath The path of the task whose output should be retrieved.\n * @param logLevel The given output contains no more than the [logLevel] logs.\n *\n * @return The output produced by the specified task during the build.\n *\n * @throws IllegalStateException if the specified task path does not match any tasks in the build.\n */"} {"signature":"fun getOutputForTask ( taskPath : String , output : String , logLevel : LogLevel = LogLevel . DEBUG ) : String","body":"= ( when ( logLevel ) { LogLevel . INFO -> taskOutputRegexForInfoLog ( taskPath ) LogLevel . DEBUG -> taskOutputRegexForDebugLog ( taskPath ) else -> throw throw IllegalStateException ( \"\" ) } ) . findAll ( output ) . map { it . groupValues [ ] } . joinToString ( System . lineSeparator ( ) ) . ifEmpty { error ( \"\"\"\"\"\" . trimIndent ( ) ) }","docstring":"/**\n * Gets the output produced by a specific task during a Gradle build.\n *\n * @param taskPath The path of the task whose output should be retrieved.\n * @param output The output from which we should extract task's output\n * @param logLevel The given output contains no more than the [logLevel] logs.\n *\n * @return The output produced by the specified task during the build.\n *\n * @throws IllegalStateException if the specified task path does not match any tasks in the build.\n */"} {"signature":"fun BuildResult . extractNativeTasksCommandLineArgumentsFromOutput ( vararg tasksPaths : String , toolName : NativeToolKind = NativeToolKind . KONANC , logLevel : LogLevel = LogLevel . INFO , assertions : CommandLineArguments . ( ) -> Unit , )","body":"= tasksPaths . forEach { taskPath -> val taskOutput = getOutputForTask ( taskPath , logLevel ) val commandLineArguments = extractNativeCompilerCommandLineArguments ( taskOutput , toolName ) assertions ( CommandLineArguments ( commandLineArguments , this ) ) }","docstring":"/**\n * Asserts the command line arguments of the given Kotlin/Native (K/N) compiler for the specified tasks' paths.\n *\n * Note: The log level of the output must be set to [LogLevel.DEBUG].\n *\n * @param tasksPaths The paths of the tasks for which the command line arguments should be checked against the provided assertions.\n * @param toolName The name of the build tool used.\n * @param logLevel The given output contains no more than the [logLevel] logs.\n * @param assertions The assertions to be applied to each command line argument of each given task.\n * These assertions validate the expected properties of the command line arguments.\n * These assertions validate the expected properties of the command line arguments.\n */"} {"signature":"fun expanded ( maxCapacity : Int ) : RingBuffer < T >","body":"{ val newCapacity = ( capacity + ( capacity shr ) + ) . coerceAtMost ( maxCapacity ) val newBuffer = if ( startIndex == ) buffer . copyOf ( newCapacity ) else toArray ( arrayOfNulls ( newCapacity ) ) return RingBuffer ( newBuffer , size ) }","docstring":"/**\n * Creates a new ring buffer with the capacity equal to the minimum of [maxCapacity] and 1.5 * [capacity].\n * The returned ring buffer contains the same elements as this ring buffer.\n */"} {"signature":"fun add ( element : T )","body":"{ if ( isFull ( ) ) { throw IllegalStateException ( \"\" ) } buffer [ startIndex . forward ( size ) ] = element size ++ }","docstring":"/**\n * Add [element] to the buffer or fail with [IllegalStateException] if no free space available in the buffer\n */"} {"signature":"fun removeFirst ( n : Int )","body":"{ require ( n >= ) { \"\" } require ( n <= size ) { \"\" } if ( n > ) { val start = startIndex val end = start . forward ( n ) if ( start > end ) { buffer . fill ( null , start , capacity ) buffer . fill ( null , , end ) } else { buffer . fill ( null , start , end ) } startIndex = end size -= n } }","docstring":"/**\n * Removes [n] first elements from the buffer or fails with [IllegalArgumentException] if not enough elements in the buffer to remove\n */"} {"signature":"fun vgg19copyModelPrediction ( )","body":"{ val modelHub = TFModelHub ( cacheDirectory = File ( \"\" ) ) val modelType = TFModels . CV . VGG19 ( ) val model = modelHub . loadModel ( modelType ) val fileDataLoader = modelType . createPreprocessing ( model ) . fileLoader ( ) val imageNetClassLabels = modelHub . loadClassLabels ( ) var copiedModel : Sequential model . use { it . compile ( optimizer = Adam ( ) , loss = Losses . MAE , metric = Metrics . ACCURACY ) it . logSummary ( ) val hdfFile = modelHub . loadWeights ( modelType ) it . loadWeights ( hdfFile ) copiedModel = it . copy ( copyWeights = true ) for ( i in .. ) { val inputData = fileDataLoader . load ( getFileFromResource ( \"\" ) ) val res = it . predictLabel ( inputData ) println ( \"\" ) val top5 = it . predictTop5Labels ( inputData , imageNetClassLabels ) println ( top5 . toString ( ) ) } } copiedModel . use { for ( i in .. ) { val inputData = fileDataLoader . load ( getFileFromResource ( \"\" ) ) val res = it . predictLabel ( inputData ) println ( \"\" ) val top5 = it . predictTop5Labels ( inputData , imageNetClassLabels ) println ( top5 . toString ( ) ) } } }","docstring":"/**\n * This example demonstrates the inference concept on VGG'19 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 VGG'19 during training on ImageNet dataset) is applied to each image before prediction.\n * - No additional training.\n * - No new layers are added.\n * - Model copied and used for prediction.\n *\n * @see \n * Very Deep Convolutional Networks for Large-Scale Image Recognition (ICLR 2015).\n * @see \n * Detailed description of VGG'19 model and an approach to build it in Keras.\n */"} {"signature":"fun main ( ) : Unit","body":"= vgg19copyModelPrediction ( )","docstring":"/** */"} {"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":"@ Test fun testAwaitingRacingWithCompletion ( )","body":"= runTest { val mono = object : Mono < Int > ( ) { override fun subscribe ( s : CoreSubscriber < in Int > ) { s . onSubscribe ( object : Subscription { override fun request ( n : Long ) { thread = thread { s . onNext ( ) Thread . yield ( ) completed = true s . onComplete ( ) } } override fun cancel ( ) { } } ) } } repeat ( N_REPEATS ) { thread = null completed = false val value = mono . awaitSingleOrNull ( ) assertTrue ( completed , \"\" ) assertEquals ( , value ) thread ! ! . join ( ) } }","docstring":"/**\n * Tests that [Mono.awaitSingleOrNull] does await [CoreSubscriber.onComplete] and does not return\n * the value as soon as it has it.\n */"} {"signature":"@ OptIn ( ObsoleteDescriptorBasedAPI :: class ) fun IrProperty . analyzeIfFromAnotherModule ( ) : Pair < Boolean , Boolean >","body":"{ return if ( descriptor is DeserializedPropertyDescriptor ) { val hasDefault = descriptor . declaresDefaultValue ( ) hasDefault to ( descriptor . backingField != null || hasDefault ) } else if ( this is Fir2IrLazyProperty ) { val hasBackingField = fir . symbol . registeredInSerializationPluginMetadataExtension val matchingPrimaryConstructorParam = containingClass ? . declarations ? . filterIsInstance < FirPrimaryConstructor > ( ) ? . singleOrNull ( ) ? . valueParameters ? . find { it . name == this . name } if ( matchingPrimaryConstructorParam != null ) { ( matchingPrimaryConstructorParam . defaultValue != null ) to hasBackingField } else { ( fir . getter is FirDefaultPropertyGetter ) to hasBackingField } } else { false to false } }","docstring":"/**\n * This function checks if a deserialized property declares default value and has backing field.\n *\n * Returns (declaresDefaultValue, hasBackingField) boolean pair. Returns (false, false) for properties from current module.\n */"} {"signature":"@ OptIn ( ObsoleteDescriptorBasedAPI :: class ) internal fun serializablePropertiesForIrBackend ( irClass : IrClass , serializationDescriptorSerializer : SerializationDescriptorSerializerPlugin ? = null , typeReplacement : Map < IrProperty , IrSimpleType > ? = null ) : IrSerializableProperties","body":"{ val properties = irClass . properties . toList ( ) val primaryConstructorParams = irClass . primaryConstructor ? . valueParameters . orEmpty ( ) val primaryParamsAsProps = properties . associateBy { it . name } . let { namesMap -> primaryConstructorParams . mapNotNull { if ( it . name !in namesMap ) null else namesMap . getValue ( it . name ) to it . hasDefaultValue ( ) } . toMap ( ) } fun isPropSerializable ( it : IrProperty ) = if ( irClass . isInternalSerializable ) ! it . annotations . hasAnnotation ( SerializationAnnotations . serialTransientFqName ) else ! DescriptorVisibilities . isPrivate ( it . visibility ) && ( ( it . isVar && ! it . annotations . hasAnnotation ( SerializationAnnotations . serialTransientFqName ) ) || primaryParamsAsProps . contains ( it ) ) && it . getter ? . returnType != null val ( primaryCtorSerializableProps , bodySerializableProps ) = properties . asSequence ( ) . filter { ! it . isFakeOverride && ! it . isDelegated && it . origin != IrDeclarationOrigin . DELEGATED_MEMBER } . filter ( :: isPropSerializable ) . map { val isConstructorParameterWithDefault = primaryParamsAsProps [ it ] ? : false val ( isPropertyFromAnotherModuleDeclaresDefaultValue , isPropertyWithBackingFieldFromAnotherModule ) = it . analyzeIfFromAnotherModule ( ) val hasBackingField = when ( it . origin ) { IrDeclarationOrigin . IR_EXTERNAL_DECLARATION_STUB -> isPropertyWithBackingFieldFromAnotherModule else -> it . backingField != null } IrSerializableProperty ( it , isConstructorParameterWithDefault , hasBackingField , it . backingField ? . initializer . let { init -> init != null && ! init . expression . isInitializePropertyFromParameter ( ) } || isConstructorParameterWithDefault || isPropertyFromAnotherModuleDeclaresDefaultValue , typeReplacement ? . get ( it ) ? : it . getter ! ! . returnType as IrSimpleType ) } . filterNot { it . transient } . partition { primaryParamsAsProps . contains ( it . ir ) } var serializableProps = run { val supers = irClass . getSuperClassNotAny ( ) if ( supers == null || ! supers . isInternalSerializable ) { primaryCtorSerializableProps + bodySerializableProps } else { val originalToTypeFromFO = typeReplacement ? : buildMap < IrProperty , IrSimpleType > { irClass . properties . filter { it . isFakeOverride } . forEach { prop -> val orig = prop . resolveFakeOverride ( ) val type = prop . getter ? . returnType as? IrSimpleType if ( orig != null && type != null ) put ( orig , type ) } } serializablePropertiesForIrBackend ( supers , serializationDescriptorSerializer , originalToTypeFromFO ) . serializableProperties + primaryCtorSerializableProps + bodySerializableProps } } serializableProps = restoreCorrectOrderFromClassProtoExtension ( irClass . descriptor , serializableProps ) val isExternallySerializable = irClass . isInternallySerializableEnum ( ) || primaryConstructorParams . size == primaryParamsAsProps . size return IrSerializableProperties ( serializableProps , isExternallySerializable , primaryCtorSerializableProps , bodySerializableProps ) }","docstring":"/**\n * typeReplacement should be populated from FakeOverrides and is used when we want to determine the type for property\n * accounting for generic substitutions performed in subclasses:\n *\n * ```\n * @Serializable\n * sealed class TypedSealedClass(val a: T) {\n * @Serializable\n * data class Child(val y: Int) : TypedSealedClass(\"10\")\n * }\n * ```\n * In this case, serializableProperties for TypedSealedClass is a listOf(IrSerProp(val a: T)),\n * but for Child is a listOf(IrSerProp(val a: String), IrSerProp(val y: Int)).\n *\n * Using this approach, we can correctly deserialize parent's properties in Child.Companion.deserialize()\n */"} {"signature":"public actual fun addLast ( node : Node )","body":"{ while ( true ) { if ( prevNode . addNext ( node , this ) ) return } }","docstring":"/**\n * Adds last item to this list.\n */"} {"signature":"public actual inline fun addLastIf ( node : Node , crossinline condition : ( ) -> Boolean ) : Boolean","body":"{ val condAdd = makeCondAddOp ( node , condition ) while ( true ) { val prev = prevNode when ( prev . tryCondAddNext ( node , this , condAdd ) ) { SUCCESS -> return true FAILURE -> return false } } }","docstring":"/**\n * Adds last item to this list atomically if the [condition] is true.\n */"} {"signature":"@ PublishedApi internal fun addNext ( node : Node , next : Node ) : Boolean","body":"{ node . _prev . lazySet ( this ) node . _next . lazySet ( next ) if ( ! _next . compareAndSet ( next , node ) ) return false node . finishAdd ( next ) return true }","docstring":"/**\n * Given:\n * ```\n * +-----------------------+\n * this | node V next\n * +---+---+ +---+---+ +---+---+\n * ... <-- | P | N | | P | N | | P | N | --> ....\n * +---+---+ +---+---+ +---+---+\n * ^ |\n * +-----------------------+\n * ```\n * Produces:\n * ```\n * this node next\n * +---+---+ +---+---+ +---+---+\n * ... <-- | P | N | ==> | P | N | --> | P | N | --> ....\n * +---+---+ +---+---+ +---+---+\n * ^ | ^ |\n * +---------+ +---------+\n * ```\n * Where `==>` denotes linearization point.\n * Returns `false` if `next` was not following `this` node.\n */"} {"signature":"public actual open fun remove ( ) : Boolean","body":"= removeOrNext ( ) == null","docstring":"/**\n * Removes this node from the list. Returns `true` when removed successfully, or `false` if the node was already\n * removed or if it was not added to any list in the first place.\n *\n * **Note**: Invocation of this operation does not guarantee that remove was actually complete if result was `false`.\n * In particular, invoking [nextNode].[prevNode] might still return this node even though it is \"already removed\".\n */"} {"signature":"private fun finishAdd ( next : Node )","body":"{ next . _prev . loop { nextPrev -> if ( this . next !== next ) return if ( next . _prev . compareAndSet ( nextPrev , this ) ) { if ( isRemoved ) next . correctPrev ( null ) return } } }","docstring":"/**\n * Given:\n * ```\n *\n * prev this next\n * +---+---+ +---+---+ +---+---+\n * ... <-- | P | N | --> | P | N | --> | P | N | --> ....\n * +---+---+ +---+---+ +---+---+\n * ^ ^ | |\n * | +---------+ |\n * +-------------------------+\n * ```\n * Produces:\n * ```\n * prev this next\n * +---+---+ +---+---+ +---+---+\n * ... <-- | P | N | --> | P | N | --> | P | N | --> ....\n * +---+---+ +---+---+ +---+---+\n * ^ | ^ |\n * +---------+ +---------+\n * ```\n */"} {"signature":"private tailrec fun correctPrev ( op : OpDescriptor ? ) : Node ?","body":"{ val oldPrev = _prev . value var prev : Node = oldPrev var last : Node ? = null while ( true ) { val prevNext : Any = prev . _next . value when { prevNext === this -> { if ( oldPrev === prev ) return prev if ( ! this . _prev . compareAndSet ( oldPrev , prev ) ) { return correctPrev ( op ) } return prev } this . isRemoved -> return null prevNext === op -> return prev prevNext is OpDescriptor -> { prevNext . perform ( prev ) return correctPrev ( op ) } prevNext is Removed -> { if ( last !== null ) { if ( ! last . _next . compareAndSet ( prev , prevNext . ref ) ) { return correctPrev ( op ) } prev = last last = null } else { prev = prev . _prev . value } } else -> { last = prev prev = prevNext as Node } } } }","docstring":"/**\n * Returns the corrected value of the previous node while also correcting the `prev` pointer\n * (so that `this.prev.next === this`) and helps complete node removals to the left ot this node.\n *\n * It returns `null` in two special cases:\n *\n * - When this node is removed. In this case there is no need to waste time on corrections, because\n * remover of this node will ultimately call [correctPrev] on the next node and that will fix all\n * the links from this node, too.\n */"} {"signature":"public actual inline fun < reified T : Node > forEach ( block : ( T ) -> Unit )","body":"{ var cur : Node = next as Node while ( cur != this ) { if ( cur is T ) block ( cur ) cur = cur . nextNode } }","docstring":"/**\n * Iterates over all elements in this list of a specified type.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ ExperimentalStdlibApi public fun < E : Element > Element . getPolymorphicElement ( key : Key < E > ) : E ?","body":"{ if ( key is AbstractCoroutineContextKey < * , * > ) { @ Suppress ( \"\" ) return if ( key . isSubKey ( this . key ) ) key . tryCast ( this ) as? E else null } @ Suppress ( \"\" ) return if ( this . key === key ) this as E else null }","docstring":"/**\n * Returns the current element if it is associated with the given [key] in a polymorphic manner or `null` otherwise.\n * This method returns non-null value if either [Element.key] is equal to the given [key] or if the [key] is associated\n * with [Element.key] via [AbstractCoroutineContextKey].\n * See [AbstractCoroutineContextKey] for the example of usage.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ ExperimentalStdlibApi public fun Element . minusPolymorphicKey ( key : Key < * > ) : CoroutineContext","body":"{ if ( key is AbstractCoroutineContextKey < * , * > ) { return if ( key . isSubKey ( this . key ) && key . tryCast ( this ) != null ) EmptyCoroutineContext else this } return if ( this . key === key ) EmptyCoroutineContext else this }","docstring":"/**\n * Returns empty coroutine context if the element is associated with the given [key] in a polymorphic manner\n * or `null` otherwise.\n * This method returns empty context if either [Element.key] is equal to the given [key] or if the [key] is associated\n * with [Element.key] via [AbstractCoroutineContextKey].\n * See [AbstractCoroutineContextKey] for the example of usage.\n */"} {"signature":"private fun lowerHeader ( variable : IrVariable , loopHeader : ForLoopHeader ) : IrStatement","body":"{ return IrCompositeImpl ( variable . startOffset , variable . endOffset , context . irBuiltIns . unitType , null , loopHeader . loopInitStatements ) }","docstring":"/**\n * Lowers the \"header\" statement that stores the iterator into the loop variable\n * (e.g., `val it = someIterable.iterator()`) and gather information for building the for-loop\n * (as a [ForLoopHeader]).\n *\n * Returns null if the for-loop cannot be lowered.\n */"} {"signature":"private fun specializeIteratorIfPossible ( irForLoopBlock : IrContainerExpression )","body":"{ val statements = irForLoopBlock . statements val iterator = statements [ ] as IrVariable val initializer = iterator . initializer as? IrCall ? : return if ( ! initializer . symbol . owner . hasEqualFqName ( STDLIB_ITERATOR_FUNCTION_FQ_NAME ) ) return val receiverType = initializer . extensionReceiver ? . type ? : return if ( ! receiverType . isStrictSubtypeOfClass ( context . irBuiltIns . iteratorClass ) ) return val receiverClass = receiverType . getClass ( ) ? : return val next = receiverClass . functions . singleOrNull { it . name == OperatorNameConventions . NEXT && it . dispatchReceiverParameter != null && it . extensionReceiverParameter == null && it . valueParameters . isEmpty ( ) } ? : return iterator . apply { this . type = receiverType this . initializer = initializer . extensionReceiver } val loop = statements [ ] as IrWhileLoop val loopVariable = ( loop . body as? IrBlock ) ? . statements ? . firstOrNull ( ) as? IrVariable ? : return val loopCondition = loop . condition as? IrCall ? : return loopCondition . dispatchReceiver ? . type = receiverType val nextCall = loopVariable . initializer if ( nextCall is IrCall ) { nextCall . symbol = next . symbol nextCall . dispatchReceiver ? . type = receiverType } }","docstring":"/**\n * This optimization is for the stdlib extension function in package `kotlin.collections`:\n * ```\n * @kotlin.internal.InlineOnly\n * public inline operator fun Iterator.iterator(): Iterator = this\n * ```\n * Let's say we have an instance of `MyIterator`, which directly implements [kotlin.collections.Iterator],\n * when it is used in a for-loop like:\n *\n * ```\n * val iterator = MyIterator()\n * for (x in iterator)\n * println(x)\n * ```\n * Without this optimization, receiver type of call of `next` would be Iterator instead of MyIterator, which means that\n * a less specific method would be called, which could lead to unnecessary boxing of primitives or inline classes.\n */"} {"signature":"public fun getDirectKotlinInheritors ( ktClass : KtClass , scope : GlobalSearchScope , includeLocalInheritors : Boolean ) : Iterable < KtClassOrObject >","body":"public fun getDirectKotlinInheritors ( ktClass : KtClass , scope : GlobalSearchScope , includeLocalInheritors : Boolean ) : Iterable < KtClassOrObject >","docstring":"/**\n * Returns all direct inheritors of [ktClass] that can be found in the given [scope]. If [includeLocalInheritors] is `false`, only\n * non-local inheritors will be returned.\n *\n * The implementor of [getDirectKotlinInheritors] is allowed to lazy-resolve symbols up to the `SUPER_TYPES` phase. This is required to\n * check subtyping for potential inheritors. Hence, if [getDirectKotlinInheritors] is invoked during lazy resolution, it requires a\n * phase of `SEALED_CLASS_INHERITORS` or later.\n */"} {"signature":"public fun breaks ( breaks : List < DomainType > ? = null , format : String ? = null )","body":"{ this . breaks = breaks this . format = format }","docstring":"/**\n * Sets axis breaks with formatting.\n *\n * @param breaks list of breaks.\n * @param format format string.\n */"} {"signature":"public fun breaksLabeled ( vararg breaksToLabels : Pair < DomainType , String > )","body":"{ breaks = breaksToLabels . map { it . first } labels = breaksToLabels . map { it . second } }","docstring":"/**\n * Sets axis breaks with labels.\n *\n * @param breaksToLabels list of breaks with corresponding labels.\n */"} {"signature":"public fun breaksLabeled ( breaks : List < DomainType > , labels : List < String > )","body":"{ this . breaks = breaks this . labels = labels }","docstring":"/**\n * Sets legend breaks with labels.\n *\n * @param breaks list of breaks.\n * @param labels list of corresponding labels.\n */"} {"signature":"public fun expand ( multiplicative : Double = , additive : Double = )","body":"{ expand = listOf ( multiplicative , additive ) }","docstring":"/**\n * Sets multiplicative and additive expansion constants.\n */"} {"signature":"private fun isUsed ( psiElement : PsiElement ) : Boolean","body":"{ return when ( psiElement ) { is KtFunctionLiteral -> doesParentUseChild ( psiElement . parent , psiElement ) is KtNamedFunction -> doesParentUseChild ( psiElement . parent , psiElement ) is KtDeclaration -> false is KtThrowExpression -> false is KtReturnExpression -> false is KtBreakExpression -> false is KtContinueExpression -> false is KtLoopExpression -> false is KtConstructorDelegationReferenceExpression -> false is KtEnumEntrySuperclassReferenceExpression -> false is KtConstructorCalleeExpression -> false is KtLabelReferenceExpression -> false is KtOperationReferenceExpression -> false else -> doesParentUseChild ( psiElement . parent , psiElement ) } }","docstring":"/**\n * [isUsed] and [doesParentUseChild] are defined in mutual recursion,\n * climbing up the syntax tree, passing control back and forth between the\n * two.\n *\n * Whether an expression is used is defined by the context in which it\n * appears. E.g. a \"statement\" in a block is considered used if it is the\n * last expression in that block AND the block itself is used -- a\n * recursive call to `isUsed`, one level higher in the syntax tree.\n *\n * The methods are _conservative_, erring on the side of answering `true`.\n */"} {"signature":"private fun doesDoubleColonUseLHS ( lhs : PsiElement ) : Boolean","body":"{ val reference = when ( val inner = lhs . unwrapParenthesesLabelsAndAnnotations ( ) ) { is KtReferenceExpression -> inner . mainReference is KtDotQualifiedExpression -> ( inner . selectorExpression as? KtReferenceExpression ) ? . mainReference ? : return true else -> return true } val resolution = reference . resolve ( ) return resolution != null && resolution !is KtClass }","docstring":"/**\n * The left hand side of a `::` is regarded as used unless it refers to a type.\n * We decide that the LHS is a type reference by checking if the left hand\n * side is a (qualified) name, and, in case it _is_, resolving that name.\n *\n * If it resolves to a non-class declaration, it does _not_ refer to a type.\n */"} {"signature":"private fun doesCallExpressionUseCallee ( callee : PsiElement ) : Boolean","body":"{ return callee !is KtReferenceExpression || analyze ( callee ) { isSimpleVariableAccessCall ( callee ) } }","docstring":"/**\n * Invocations of _statically named_ callables is not considered a use. E.g.\n * consider\n *\n * 1) fun f() { 54 }; f()\n * 2) val f = { 54 }; f()\n *\n * in which the `f` in 2) is regarded as used and `f` in 1) is not.\n */"} {"signature":"private fun doesPropertyAccessorUseBody ( propertyAccessor : KtPropertyAccessor , body : PsiElement ) : Boolean","body":"{ return propertyAccessor . isSetter || ( propertyAccessor . isGetter && body !is KtBlockExpression ) }","docstring":"/**\n * The body of setters are always used. The body of getters are only used if they are expression bodies.\n */"} {"signature":"private fun doesNamedFunctionUseBody ( namedFunction : KtNamedFunction , body : PsiElement ) : Boolean","body":"= when { namedFunction . bodyBlockExpression == body -> false ! returnsUnit ( namedFunction ) -> true namedFunction . bodyExpression == body -> analyze ( namedFunction ) { ( body as KtExpression ) . getKtType ( ) ? . isUnit == true } else -> false }","docstring":"/**\n * Returns whether the function uses its body as an expression (i.e., the function uses the result value of the expression) or not.\n *\n * Named functions do not consider their bodies used if\n * - the function body is a block e.g., `fun foo(): Int { return bar }` or\n * - the function itself returns Unit\n */"} {"signature":"@ Test fun testNoAccessPrivateTopLevel ( )","body":"{ val javaClass = Class . forName ( \"\" ) checkDeclarations ( javaClass , listOf ( FieldDesc ( PRIVATE or STATIC or FINAL , true , \"\" , \"\" ) ) ) val refVolatileClass = Class . forName ( \"\" ) checkClassModifiers ( refVolatileClass , , true ) checkDeclarations ( refVolatileClass , listOf ( FieldDesc ( VOLATILE , false , \"\" , \"\" ) ) ) }","docstring":"/**\n * Test [bytecode_test.NoAccessPrivateTopLevel]\n */"} {"signature":"@ Test fun testPrivateTopLevel ( )","body":"{ val javaClass = Class . forName ( \"\" ) checkDeclarations ( javaClass , listOf ( FieldDesc ( STATIC or FINAL , true , \"\" , \"\" ) , FieldDesc ( STATIC or FINAL , true , AFU_TYPE , \"\" ) ) ) val refVolatileClass = Class . forName ( \"\" ) checkClassModifiers ( refVolatileClass , , true ) checkDeclarations ( refVolatileClass , listOf ( FieldDesc ( VOLATILE , false , \"\" , \"\" ) ) ) }","docstring":"/**\n * Test [bytecode_test.PrivateTopLevel]\n */"} {"signature":"@ Test fun testPublicTopLevelReflectionTest ( )","body":"{ val javaClass = Class . forName ( \"\" ) checkDeclarations ( javaClass , listOf ( FieldDesc ( PUBLIC or STATIC or FINAL , true , \"\" , \"\" ) , FieldDesc ( PUBLIC or STATIC or FINAL , true , AFU_TYPE , \"\" ) ) ) val refVolatileClass = Class . forName ( \"\" ) checkClassModifiers ( refVolatileClass , PUBLIC , true ) checkDeclarations ( refVolatileClass , listOf ( FieldDesc ( PUBLIC or VOLATILE , false , \"\" , \"\" ) ) ) }","docstring":"/**\n * Test [bytecode_test.PublicTopLevel]\n */"} {"signature":"@ Test fun testPackagePrivateTopLevelReflectionTest ( )","body":"{ val javaClass = Class . forName ( \"\" ) checkDeclarations ( javaClass , listOf ( FieldDesc ( STATIC or FINAL , true , \"\" , \"\" ) , FieldDesc ( STATIC or FINAL , true , AFU_TYPE , \"\" ) ) ) val refVolatileClass = Class . forName ( \"\" ) checkClassModifiers ( refVolatileClass , , true ) checkDeclarations ( refVolatileClass , listOf ( FieldDesc ( VOLATILE , false , \"\" , \"\" ) ) ) }","docstring":"/**\n * Test [bytecode_test.PackagePrivateTopLevel]\n */"} {"signature":"internal fun commonRelu ( tf : Ops , input : Operand < Float > , alpha : Float = , maxValue : Float ? = null , threshold : Float = ) : Operand < Float >","body":"{ var input2 = input var negativePart : Operand < Float > = tf . nn . relu ( input2 ) if ( alpha != ) { if ( maxValue == null && threshold == ) { val greaterThanZero = tf . math . greater ( input2 , tf . constant ( ) ) val negativeActivation = tf . math . mul ( tf . constant ( alpha ) , input2 ) return tf . where3 ( greaterThanZero , input2 , negativeActivation ) } negativePart = if ( threshold != ) tf . nn . relu ( tf . math . add ( tf . math . mul ( input2 , tf . constant ( - ) ) , tf . constant ( threshold ) ) ) else tf . nn . relu ( tf . math . mul ( input2 , tf . constant ( - ) ) ) } var clipMax = false if ( maxValue != null ) clipMax = true when { threshold != -> { input2 = tf . math . mul ( input2 , tf . dtypes . cast ( tf . math . greater ( input , tf . constant ( threshold ) ) , getDType ( ) ) ) } maxValue == -> { input2 = tf . nn . relu6 ( input2 ) clipMax = false } else -> input2 = tf . nn . relu ( input2 ) } if ( clipMax ) { input2 = tf . math . minimum ( tf . constant ( maxValue ! ! ) as Operand < Float > , tf . math . maximum ( input2 , tf . constant ( ) ) ) } if ( alpha != ) input2 = tf . math . sub ( input2 , tf . math . mul ( tf . constant ( alpha ) , negativePart ) ) return input2 }","docstring":"/**\n * Rectified linear unit.\n *\n * With default values, it returns element-wise `max(x, 0)`.\n * Otherwise, it follows:\n * `f(x) = max_value` for `x >= max_value`,\n * `f(x) = x` for `threshold <= x < max_value`,\n * `f(x) = alpha * (x - threshold)` otherwise.\n *\n * @param [tf] Namespace to build ops.\n * @param [input] A tensor or variable.\n * @param [alpha] A scalar, slope of negative section.\n * @param [maxValue] Saturation threshold.\n * @param [threshold] Threshold value for the activation.\n *\n * @return TensorFlow Operand.\n */"} {"signature":"internal fun CArrayPointer < ByteVar > . getBytes ( size : Long )","body":"= ( .. size - ) . map { this [ it ] } . toByteArray ( )","docstring":"/**\n * Reads [size] bytes contained in this array.\n */"} {"signature":"public fun detectPoses ( imageFile : File , confidence : Float = ) : MultiPoseDetectionResult","body":"{ return detectPoses ( ImageConverter . toBufferedImage ( imageFile ) , confidence ) }","docstring":"/**\n * Detects poses for the given [imageFile] with the given [confidence].\n * @param [imageFile] file containing an input image\n * @param [confidence] confidence value to use\n */"} {"signature":"public fun reshape ( vararg dims : Long )","body":"{ inputShape = longArrayOf ( * dims ) }","docstring":"/**\n * Setter for input shape of the internal model. Images are going to be resized to this shape.\n *\n * @param dims The input shape.\n */"} {"signature":"internal fun Type . isStret ( target : KonanTarget ) : Boolean","body":"{ val unwrappedType = this . unwrapTypedefs ( ) val abiInfo : ObjCAbiInfo = when ( target . architecture ) { Architecture . ARM64 -> DarwinArm64AbiInfo ( ) Architecture . X64 -> DarwinX64AbiInfo ( ) Architecture . X86 -> DarwinX86AbiInfo ( ) Architecture . ARM32 -> DarwinArm32AbiInfo ( target ) else -> error ( \"\" ) } return abiInfo . shouldUseStret ( unwrappedType ) }","docstring":"/**\n * objc_msgSend*_stret functions must be used when return value is returned through memory\n * pointed by implicit argument, which is passed on the register that would otherwise be used for receiver.\n *\n * The entire implementation is just the real ABI approximation which is enough for practical cases.\n */"} {"signature":"fun clear ( )","body":"fun clear ( )","docstring":"/**\n * Removes all recorded data except diagnostics.\n */"} {"signature":"inline fun < reified P : DokkaPlugin , reified T : ConfigurableBlock > pluginConfiguration ( block : T . ( ) -> Unit )","body":"{ val instance = T :: class . createInstance ( ) . apply ( block ) val pluginConfiguration = PluginConfigurationImpl ( fqPluginName = P :: class . qualifiedName ! ! , serializationFormat = DokkaConfiguration . SerializationFormat . JSON , values = instance . toCompactJsonString ( ) ) pluginsConfiguration . add ( pluginConfiguration ) }","docstring":"/**\n * Type-safe configuration for a Dokka plugin.\n *\n * Note: this is available in Kotlin DSL only, if Dokka Gradle plugin was applied through `plugins` block\n * and the configured plugin can be found on classpath, which may require adding a classpath dependency\n * to `buildscript` block in case of external plugins. Some Dokka plugins, such as\n * [org.jetbrains.dokka.base.DokkaBase], are on classpath by default.\n *\n * Example:\n *\n * ```kotlin\n * import org.jetbrains.dokka.base.DokkaBase\n * import org.jetbrains.dokka.base.DokkaBaseConfiguration\n *\n * tasks.dokkaHtml {\n * pluginConfiguration {\n * footerMessage = \"Test\"\n * }\n * }\n * ```\n *\n * @param P Plugin class that extends [DokkaPlugin]\n * @param T Plugin configuration class that extends [ConfigurableBlock]\n */"} {"signature":"private fun getClassSnapshotGranularity ( classpathEntryDirOrJar : File , gradleUserHomeDir : File ) : ClassSnapshotGranularity","body":"{ return if ( classpathEntryDirOrJar . startsWith ( gradleUserHomeDir ) || classpathEntryDirOrJar . name == \"\" ) CLASS_LEVEL else CLASS_MEMBER_LEVEL }","docstring":"/**\n * Determines the [ClassSnapshotGranularity] when taking a snapshot of the given [classpathEntryDirOrJar].\n *\n * As mentioned in [ClassSnapshotGranularity]'s kdoc, we will take [CLASS_LEVEL] snapshots for classes that are infrequently changed\n * (e.g., external libraries which are typically stored/transformed inside the Gradle user home, or a few hard-coded cases), and take\n * [CLASS_MEMBER_LEVEL] snapshots for the others.\n */"} {"signature":"fun getResolver ( allClasses : Iterable < AccessibleClassSnapshot > ) : ImpactedSymbolsResolver","body":"fun getResolver ( allClasses : Iterable < AccessibleClassSnapshot > ) : ImpactedSymbolsResolver","docstring":"/** Provides an [ImpactedSymbolsResolver] to compute the set of [ProgramSymbol]s impacted by a given set of [ProgramSymbol]s. */"} {"signature":"fun getReverseResolver ( allClasses : Iterable < AccessibleClassSnapshot > ) : ImpactingClassesResolver","body":"fun getReverseResolver ( allClasses : Iterable < AccessibleClassSnapshot > ) : ImpactingClassesResolver","docstring":"/**\n * Provides an [ImpactingClassesResolver] to compute the set of classes impacting a given set of classes (the reverse of [getResolver]).\n */"} {"signature":"fun < T > findReachableNodes ( nodes : Iterable < T > , edgesProvider : ( T ) -> Iterable < T > ) : Set < T >","body":"{ val visitedAndToVisitNodes = nodes . toMutableSet ( ) val nodesToVisit = ArrayDeque ( nodes . toSet ( ) ) while ( nodesToVisit . isNotEmpty ( ) ) { val nodeToVisit = nodesToVisit . removeFirst ( ) val nextNodesToVisit = edgesProvider . invoke ( nodeToVisit ) - visitedAndToVisitNodes visitedAndToVisitNodes . addAll ( nextNodesToVisit ) nodesToVisit . addAll ( nextNodesToVisit ) } return visitedAndToVisitNodes }","docstring":"/**\n * Finds the set of nodes that are *transitively* reachable from the given set of nodes.\n *\n * The returned set is *inclusive* (it contains the given set + the directly/transitively reachable ones).\n */"} {"signature":"protected fun buildFieldForSupertypeDelegate ( entry : KtDelegatedSuperTypeEntry , type : FirTypeRef ? , fieldOrd : Int , ) : FirField","body":"{ val delegateSource = entry . toFirSourceElement ( KtFakeSourceElementKind . ClassDelegationField ) val delegateExpression = buildOrLazyExpression ( delegateSource ) { { entry . delegateExpression } . toFirExpression ( \"\" ) } return buildField { source = delegateSource moduleData = baseModuleData origin = FirDeclarationOrigin . Synthetic . DelegateField name = NameUtils . delegateFieldName ( fieldOrd ) symbol = FirFieldSymbol ( CallableId ( this @ PsiRawFirBuilder . context . currentClassId , name ) ) returnTypeRef = type ? : withContainerSymbol ( symbol ) { entry . typeReference . toFirOrErrorType ( ) } isVar = false status = FirDeclarationStatusImpl ( Visibilities . Private , Modality . FINAL ) initializer = delegateExpression dispatchReceiverType = currentDispatchReceiverType ( ) } }","docstring":"/**\n * @param type the return type for new field.\n * In the case of null will be calculated inside [withContainerSymbol],\n * so it is crucial to decide to whom type annotation will be belonged\n */"} {"signature":"protected fun KtPrimaryConstructor ? . toFirConstructor ( superTypeCallEntry : KtSuperTypeCallEntry ? , delegatedSuperTypeRef : FirTypeRef ? , delegatedSelfTypeRef : FirTypeRef , owner : KtClassOrObject , ownerTypeParameters : List < FirTypeParameterRef > , allSuperTypeCallEntries : List < Pair < KtSuperTypeCallEntry , FirTypeRef > > , containingClassIsExpectClass : Boolean , copyConstructedTypeRefWithImplicitSource : Boolean , isErrorConstructor : Boolean = false , isImplicitlyActual : Boolean = false , isKotlinAny : Boolean = false , ) : FirConstructor","body":"{ val constructorSymbol = FirConstructorSymbol ( callableIdForClassConstructor ( ) ) withContainerSymbol ( constructorSymbol ) { val constructorSource = this ? . toFirSourceElement ( ) ? : owner . toKtPsiSourceElement ( KtFakeSourceElementKind . ImplicitConstructor ) fun buildDelegatedCall ( superTypeCallEntry : KtSuperTypeCallEntry ? , delegatedTypeRef : FirTypeRef , ) : FirDelegatedConstructorCall ? { val constructorCall = superTypeCallEntry ? . toFirSourceElement ( ) val constructedTypeRef = if ( copyConstructedTypeRefWithImplicitSource ) { delegatedTypeRef . copyWithNewSourceKind ( KtFakeSourceElementKind . ImplicitTypeRef ) } else { delegatedTypeRef } return buildOrLazyDelegatedConstructorCall ( isThis = false , constructedTypeRef ) { buildDelegatedConstructorCall { source = constructorCall ? : constructorSource . fakeElement ( KtFakeSourceElementKind . DelegatingConstructorCall ) this . constructedTypeRef = constructedTypeRef isThis = false calleeReference = buildExplicitSuperReference { source = superTypeCallEntry ? . calleeExpression ? . toFirSourceElement ( KtFakeSourceElementKind . DelegatingConstructorCall ) ? : this@buildDelegatedConstructorCall . source ? . fakeElement ( KtFakeSourceElementKind . DelegatingConstructorCall ) superTypeRef = this@buildDelegatedConstructorCall . constructedTypeRef } superTypeCallEntry ? . extractArgumentsTo ( this ) } } } val firDelegatedCall = runUnless ( containingClassIsExpectClass || isKotlinAny ) { if ( allSuperTypeCallEntries . size <= ) { buildDelegatedCall ( superTypeCallEntry , delegatedSuperTypeRef ! ! ) } else { buildMultiDelegatedConstructorCall { allSuperTypeCallEntries . mapTo ( delegatedConstructorCalls ) { ( superTypeCallEntry , delegatedTypeRef ) -> buildDelegatedCall ( superTypeCallEntry , delegatedTypeRef ) ! ! } } } } fun defaultVisibility ( ) = when { owner is KtObjectDeclaration || owner . hasModifier ( ENUM_KEYWORD ) || owner is KtEnumEntry -> Visibilities . Private owner . hasModifier ( SEALED_KEYWORD ) -> Visibilities . Protected else -> Visibilities . Unknown } val explicitVisibility = this ? . getVisibility ( ) ? . takeUnless { it == Visibilities . Unknown } val status = FirDeclarationStatusImpl ( explicitVisibility ? : defaultVisibility ( ) , Modality . FINAL ) . apply { isExpect = this@toFirConstructor ? . hasExpectModifier ( ) == true || this@PsiRawFirBuilder . context . containerIsExpect isActual = this@toFirConstructor ? . hasActualModifier ( ) == true || isImplicitlyActual isInner = owner . parent . parent !is KtScript && owner . hasModifier ( INNER_KEYWORD ) isFromSealedClass = owner . hasModifier ( SEALED_KEYWORD ) && explicitVisibility !== Visibilities . Private isFromEnumClass = owner . hasModifier ( ENUM_KEYWORD ) } val builder = when { this ? . modifierList != null && getConstructorKeyword ( ) == null -> createErrorConstructorBuilder ( ConeMissingConstructorKeyword ) isErrorConstructor -> createErrorConstructorBuilder ( ConeNoConstructorError ) else -> FirPrimaryConstructorBuilder ( ) } builder . apply { source = constructorSource moduleData = baseModuleData origin = FirDeclarationOrigin . Source returnTypeRef = delegatedSelfTypeRef this . status = status dispatchReceiverType = owner . obtainDispatchReceiverForConstructor ( ) symbol = constructorSymbol delegatedConstructor = firDelegatedCall typeParameters += constructorTypeParametersFromConstructedClass ( ownerTypeParameters ) this . contextReceivers . addAll ( convertContextReceivers ( owner . contextReceivers ) ) this@toFirConstructor ? . extractAnnotationsTo ( this ) this@toFirConstructor ? . extractValueParametersTo ( this , symbol , ValueParameterDeclaration . PRIMARY_CONSTRUCTOR ) this . body = null } return builder . build ( ) . apply { containingClassForStaticMemberAttr = currentDispatchReceiverType ( ) ! ! . lookupTag } } }","docstring":"/**\n * @param delegatedSuperTypeRef can be null if containingClassIsExpectClass is true\n */"} {"signature":"protected fun buildAnonymousInitializer ( initializer : KtAnonymousInitializer , containingDeclarationSymbol : FirBasedSymbol < * > ? , allowLazyBody : Boolean = true , isLocal : Boolean = false , )","body":"= buildAnonymousInitializer { withContainerSymbol ( symbol , isLocal ) { source = initializer . toFirSourceElement ( ) moduleData = baseModuleData origin = FirDeclarationOrigin . Source body = if ( allowLazyBody ) { buildOrLazyBlock { withForcedLocalContext { initializer . body . toFirBlock ( ) } } } else { withForcedLocalContext { initializer . body . toFirBlock ( ) } } this . containingDeclarationSymbol = containingDeclarationSymbol initializer . extractAnnotationsTo ( this ) } }","docstring":"/**\n * Builds [FirAnonymousInitializer] from [KtAnonymousInitializer]\n *\n * @param initializer Source [KtAnonymousInitializer]\n * @param containingDeclarationSymbol containing declaration symbol, if any\n * @param allowLazyBody if `true`, [FirLazyBlock] is used in the IDE mode\n * @param isLocal if `true`, the initializer is not used as a containing declaration for the contents of the initializer\n */"} {"signature":"@ ExperimentalBCVApi public fun klib ( block : KlibValidationSettings . ( ) -> Unit )","body":"{ block ( this . klib ) }","docstring":"/**\n * Configure KLib ABI validation settings.\n */"} {"signature":"public fun < C > frameCol ( frameCol : ColumnAccessor < DataFrame < C > > ) : ColumnAccessor < DataFrame < C > >","body":"= frameCol . ensureIsFrameColumn ( )","docstring":"/**\n * @include [FrameColReferenceDocs] {@set [CommonFrameColDocs.ReceiverArg]}\n */"} {"signature":"public fun < C > SingleColumn < DataRow < * > > . frameCol ( frameCol : ColumnAccessor < DataFrame < C > > ) : SingleColumn < DataFrame < C > >","body":"= this . ensureIsColumnGroup ( ) . transformSingle { val child = it . getCol ( frameCol ) ? : throw IllegalStateException ( \"\" ) child . data . ensureIsFrameColumn ( ) listOf ( child ) } . singleImpl ( )","docstring":"/**\n * @include [FrameColReferenceDocs] {@set [CommonFrameColDocs.ReceiverArg] myColumnGroup.}\n */"} {"signature":"public fun < C > AnyColumnGroupAccessor . frameCol ( frameCol : ColumnAccessor < DataFrame < C > > ) : ColumnAccessor < DataFrame < C > >","body":"= this . ensureIsColumnGroup ( ) . frameColumn < C > ( frameCol . path ( ) ) . ensureIsFrameColumn ( )","docstring":"/**\n * @include [FrameColReferenceDocs] {@set [CommonFrameColDocs.ReceiverArg] myColumnGroup.}\n */"} {"signature":"public fun < C > String . frameCol ( frameCol : ColumnAccessor < DataFrame < C > > ) : ColumnAccessor < DataFrame < C > >","body":"= columnGroup ( this ) . ensureIsColumnGroup ( ) . frameColumn < C > ( frameCol . path ( ) ) . ensureIsFrameColumn ( )","docstring":"/**\n * @include [FrameColReferenceDocs] {@set [CommonFrameColDocs.ReceiverArg] \"myColumnGroup\".}\n */"} {"signature":"public fun < C > KProperty < * > . frameCol ( frameCol : ColumnAccessor < DataFrame < C > > ) : ColumnAccessor < DataFrame < C > >","body":"= columnGroup ( this ) . ensureIsColumnGroup ( ) . frameColumn < C > ( frameCol . path ( ) ) . ensureIsFrameColumn ( )","docstring":"/**\n * @include [FrameColReferenceDocs] {@set [CommonFrameColDocs.ReceiverArg] Type::myColumnGroup.}\n */"} {"signature":"public fun < C > ColumnPath . frameCol ( frameCol : ColumnAccessor < DataFrame < C > > ) : ColumnAccessor < DataFrame < C > >","body":"= columnGroup ( this ) . ensureIsColumnGroup ( ) . frameColumn < C > ( frameCol . path ( ) ) . ensureIsFrameColumn ( )","docstring":"/**\n * @include [FrameColReferenceDocs] {@set [CommonFrameColDocs.ReceiverArg] \"pathTo\"[\"myColumnGroup\"].}\n */"} {"signature":"@ Suppress ( \"\" ) @ JvmName ( \"\" ) public fun frameCol ( name : String ) : ColumnAccessor < DataFrame < * > >","body":"= frameColumn < Any ? > ( name ) . ensureIsFrameColumn ( )","docstring":"/**\n * @include [FrameColNameDocs] {@set [CommonFrameColDocs.ReceiverArg]}\n */"} {"signature":"public fun < C > frameCol ( name : String ) : ColumnAccessor < DataFrame < C > >","body":"= frameColumn < C > ( name ) . ensureIsFrameColumn ( )","docstring":"/**\n * @include [FrameColNameDocs] {@set [CommonFrameColDocs.ReceiverArg]}\n * @include [CommonFrameColDocs.FrameColumnTypeParam]\n */"} {"signature":"@ Suppress ( \"\" ) @ JvmName ( \"\" ) public fun SingleColumn < DataRow < * > > . frameCol ( name : String ) : SingleColumn < DataFrame < * > >","body":"= frameCol < Any ? > ( name )","docstring":"/**\n * @include [FrameColNameDocs] {@set [CommonFrameColDocs.ReceiverArg] myColumnGroup.}\n */"} {"signature":"public fun < C > SingleColumn < DataRow < * > > . frameCol ( name : String ) : SingleColumn < DataFrame < C > >","body":"= this . ensureIsColumnGroup ( ) . transformSingle { val child = it . getCol ( name ) ? . cast < DataFrame < C > > ( ) ? : throw IllegalStateException ( \"\" ) child . data . ensureIsFrameColumn ( ) listOf ( child ) } . singleImpl ( )","docstring":"/**\n * @include [FrameColNameDocs] {@set [CommonFrameColDocs.ReceiverArg] myColumnGroup.}\n * @include [CommonFrameColDocs.FrameColumnTypeParam]\n */"} {"signature":"@ Suppress ( \"\" ) @ JvmName ( \"\" ) public fun AnyColumnGroupAccessor . frameCol ( name : String ) : ColumnAccessor < DataFrame < * > >","body":"= frameCol < Any ? > ( name )","docstring":"/**\n * @include [FrameColNameDocs] {@set [CommonFrameColDocs.ReceiverArg] myColumnGroup.}\n */"} {"signature":"public fun < C > AnyColumnGroupAccessor . frameCol ( name : String ) : ColumnAccessor < DataFrame < C > >","body":"= this . ensureIsColumnGroup ( ) . frameColumn < C > ( name ) . ensureIsFrameColumn ( )","docstring":"/**\n * @include [FrameColNameDocs] {@set [CommonFrameColDocs.ReceiverArg] myColumnGroup.}\n * @include [CommonFrameColDocs.FrameColumnTypeParam]\n */"} {"signature":"@ Suppress ( \"\" ) @ JvmName ( \"\" ) public fun String . frameCol ( name : String ) : ColumnAccessor < DataFrame < * > >","body":"= frameCol < Any ? > ( name )","docstring":"/**\n * @include [FrameColNameDocs] {@set [CommonFrameColDocs.ReceiverArg] \"myColumnGroup\".}\n */"} {"signature":"public fun < C > String . frameCol ( name : String ) : ColumnAccessor < DataFrame < C > >","body":"= columnGroup ( this ) . ensureIsColumnGroup ( ) . frameColumn < C > ( name ) . ensureIsFrameColumn ( )","docstring":"/**\n * @include [FrameColNameDocs] {@set [CommonFrameColDocs.ReceiverArg] \"myColumnGroup\".}\n * @include [CommonFrameColDocs.FrameColumnTypeParam]\n */"} {"signature":"@ Suppress ( \"\" ) @ JvmName ( \"\" ) public fun KProperty < * > . frameCol ( name : String ) : ColumnAccessor < DataFrame < * > >","body":"= frameCol < Any ? > ( name )","docstring":"/**\n * @include [FrameColNameDocs] {@set [CommonFrameColDocs.ReceiverArg] Type::myColumnGroup.}\n */"} {"signature":"public fun < C > KProperty < * > . frameCol ( name : String ) : ColumnAccessor < DataFrame < C > >","body":"= columnGroup ( this ) . ensureIsColumnGroup ( ) . frameColumn < C > ( name ) . ensureIsFrameColumn ( )","docstring":"/**\n * @include [FrameColNameDocs] {@set [CommonFrameColDocs.ReceiverArg] Type::myColumnGroup.}\n * @include [CommonFrameColDocs.FrameColumnTypeParam]\n */"} {"signature":"@ Suppress ( \"\" ) @ JvmName ( \"\" ) public fun ColumnPath . frameCol ( name : String ) : ColumnAccessor < DataFrame < * > >","body":"= frameCol < Any ? > ( name )","docstring":"/**\n * @include [FrameColNameDocs] {@set [CommonFrameColDocs.ReceiverArg] \"pathTo\"[\"myColumnGroup\"].}\n */"} {"signature":"public fun < C > ColumnPath . frameCol ( name : String ) : ColumnAccessor < DataFrame < C > >","body":"= columnGroup ( this ) . ensureIsColumnGroup ( ) . frameColumn < C > ( name ) . ensureIsFrameColumn ( )","docstring":"/**\n * @include [FrameColNameDocs] {@set [CommonFrameColDocs.ReceiverArg] \"pathTo\"[\"myColumnGroup\"].}\n * @include [CommonFrameColDocs.FrameColumnTypeParam]\n */"} {"signature":"@ Suppress ( \"\" ) @ JvmName ( \"\" ) public fun frameCol ( path : ColumnPath ) : ColumnAccessor < DataFrame < * > >","body":"= frameColumn < Any ? > ( path ) . ensureIsFrameColumn ( )","docstring":"/**\n * @include [FrameColPathDocs] {@set [CommonFrameColDocs.ReceiverArg]}\n */"} {"signature":"public fun < C > frameCol ( path : ColumnPath ) : ColumnAccessor < DataFrame < C > >","body":"= frameColumn < C > ( path ) . ensureIsFrameColumn ( )","docstring":"/**\n * @include [FrameColPathDocs] {@set [CommonFrameColDocs.ReceiverArg]}\n * @include [CommonFrameColDocs.FrameColumnTypeParam]\n */"} {"signature":"@ Suppress ( \"\" ) @ JvmName ( \"\" ) public fun SingleColumn < DataRow < * > > . frameCol ( path : ColumnPath ) : SingleColumn < DataFrame < * > >","body":"= frameCol < Any ? > ( path )","docstring":"/**\n * @include [FrameColPathDocs] {@set [CommonFrameColDocs.ReceiverArg] myColumnGroup.}\n */"} {"signature":"public fun < C > SingleColumn < DataRow < * > > . frameCol ( path : ColumnPath ) : SingleColumn < DataFrame < C > >","body":"= this . ensureIsColumnGroup ( ) . transformSingle { val child = it . getCol ( path ) ? . cast < DataFrame < C > > ( ) ? : throw IllegalStateException ( \"\" ) child . data . ensureIsFrameColumn ( ) listOf ( child ) } . singleImpl ( )","docstring":"/**\n * @include [FrameColPathDocs] {@set [CommonFrameColDocs.ReceiverArg] myColumnGroup.}\n * @include [CommonFrameColDocs.FrameColumnTypeParam]\n */"} {"signature":"@ Suppress ( \"\" ) @ JvmName ( \"\" ) public fun AnyColumnGroupAccessor . frameCol ( path : ColumnPath ) : ColumnAccessor < DataFrame < * > >","body":"= frameCol < Any ? > ( path )","docstring":"/**\n * @include [FrameColPathDocs] {@set [CommonFrameColDocs.ReceiverArg] myColumnGroup.}\n */"} {"signature":"public fun < C > AnyColumnGroupAccessor . frameCol ( path : ColumnPath ) : ColumnAccessor < DataFrame < C > >","body":"= this . ensureIsColumnGroup ( ) . frameColumn < C > ( path ) . ensureIsFrameColumn ( )","docstring":"/**\n * @include [FrameColPathDocs] {@set [CommonFrameColDocs.ReceiverArg] myColumnGroup.}\n * @include [CommonFrameColDocs.FrameColumnTypeParam]\n */"} {"signature":"@ Suppress ( \"\" ) @ JvmName ( \"\" ) public fun String . frameCol ( path : ColumnPath ) : ColumnAccessor < DataFrame < * > >","body":"= frameCol < Any ? > ( path )","docstring":"/**\n * @include [FrameColPathDocs] {@set [CommonFrameColDocs.ReceiverArg] \"myColumnGroup\".}\n */"} {"signature":"public fun < C > String . frameCol ( path : ColumnPath ) : ColumnAccessor < DataFrame < C > >","body":"= columnGroup ( this ) . ensureIsColumnGroup ( ) . frameColumn < C > ( path ) . ensureIsFrameColumn ( )","docstring":"/**\n * @include [FrameColPathDocs] {@set [CommonFrameColDocs.ReceiverArg] \"myColumnGroup\".}\n * @include [CommonFrameColDocs.FrameColumnTypeParam]\n */"} {"signature":"@ Suppress ( \"\" ) @ JvmName ( \"\" ) public fun KProperty < * > . frameCol ( path : ColumnPath ) : ColumnAccessor < DataFrame < * > >","body":"= frameCol < Any ? > ( path )","docstring":"/**\n * @include [FrameColPathDocs] {@set [CommonFrameColDocs.ReceiverArg] Type::myColumnGroup.}\n */"} {"signature":"public fun < C > KProperty < * > . frameCol ( path : ColumnPath ) : ColumnAccessor < DataFrame < C > >","body":"= columnGroup ( this ) . ensureIsColumnGroup ( ) . frameColumn < C > ( path ) . ensureIsFrameColumn ( )","docstring":"/**\n * @include [FrameColPathDocs] {@set [CommonFrameColDocs.ReceiverArg] Type::myColumnGroup.}\n * @include [CommonFrameColDocs.FrameColumnTypeParam]\n */"} {"signature":"@ Suppress ( \"\" ) @ JvmName ( \"\" ) public fun ColumnPath . frameCol ( path : ColumnPath ) : ColumnAccessor < DataFrame < * > >","body":"= frameCol < Any ? > ( path )","docstring":"/**\n * @include [FrameColPathDocs] {@set [CommonFrameColDocs.ReceiverArg] \"pathTo\"[\"myColumnGroup\"].}\n */"} {"signature":"public fun < C > ColumnPath . frameCol ( path : ColumnPath ) : ColumnAccessor < DataFrame < C > >","body":"= columnGroup ( this ) . ensureIsColumnGroup ( ) . frameColumn < C > ( path ) . ensureIsFrameColumn ( )","docstring":"/**\n * @include [FrameColPathDocs] {@set [CommonFrameColDocs.ReceiverArg] \"pathTo\"[\"myColumnGroup\"].}\n * @include [CommonFrameColDocs.FrameColumnTypeParam]\n */"} {"signature":"@ Suppress ( \"\" ) @ JvmName ( \"\" ) public fun < C > frameCol ( property : KProperty < DataFrame < C > > ) : SingleColumn < DataFrame < C > >","body":"= frameColumn ( property ) . ensureIsFrameColumn ( )","docstring":"/**\n * @include [FrameColKPropertyDocs] {@set [CommonFrameColDocs.ReceiverArg]}\n */"} {"signature":"public fun < C > frameCol ( property : KProperty < List < C > > ) : SingleColumn < DataFrame < C > >","body":"= frameColumn ( property ) . ensureIsFrameColumn ( )","docstring":"/**\n * @include [FrameColKPropertyDocs] {@set [CommonFrameColDocs.ReceiverArg]}\n */"} {"signature":"@ Suppress ( \"\" ) @ JvmName ( \"\" ) public fun < C > SingleColumn < DataRow < * > > . frameCol ( property : KProperty < DataFrame < C > > ) : SingleColumn < DataFrame < C > >","body":"= frameCol < C > ( property . name )","docstring":"/**\n * @include [FrameColKPropertyDocs] {@set [CommonFrameColDocs.ReceiverArg] myColumnGroup.}\n */"} {"signature":"public fun < C > SingleColumn < DataRow < * > > . frameCol ( property : KProperty < List < C > > ) : SingleColumn < DataFrame < C > >","body":"= frameCol < C > ( property . name )","docstring":"/**\n * @include [FrameColKPropertyDocs] {@set [CommonFrameColDocs.ReceiverArg] myColumnGroup.}\n */"} {"signature":"@ Suppress ( \"\" ) @ JvmName ( \"\" ) public fun < C > AnyColumnGroupAccessor . frameCol ( property : KProperty < DataFrame < C > > ) : ColumnAccessor < DataFrame < C > >","body":"= this . ensureIsColumnGroup ( ) . frameColumn ( property ) . ensureIsFrameColumn ( )","docstring":"/**\n * @include [FrameColKPropertyDocs] {@set [CommonFrameColDocs.ReceiverArg] myColumnGroup.}\n */"} {"signature":"public fun < C > AnyColumnGroupAccessor . frameCol ( property : KProperty < List < C > > ) : ColumnAccessor < DataFrame < C > >","body":"= this . ensureIsColumnGroup ( ) . frameColumn ( property ) . ensureIsFrameColumn ( )","docstring":"/**\n * @include [FrameColKPropertyDocs] {@set [CommonFrameColDocs.ReceiverArg] myColumnGroup.}\n */"} {"signature":"@ Suppress ( \"\" ) @ JvmName ( \"\" ) public fun < C > String . frameCol ( property : KProperty < DataFrame < C > > ) : ColumnAccessor < DataFrame < C > >","body":"= columnGroup ( this ) . ensureIsColumnGroup ( ) . frameColumn ( property ) . ensureIsFrameColumn ( )","docstring":"/**\n * @include [FrameColKPropertyDocs] {@set [CommonFrameColDocs.ReceiverArg] \"myColumnGroup\".}\n */"} {"signature":"public fun < C > String . frameCol ( property : KProperty < List < C > > ) : ColumnAccessor < DataFrame < C > >","body":"= columnGroup ( this ) . ensureIsColumnGroup ( ) . frameColumn ( property ) . ensureIsFrameColumn ( )","docstring":"/**\n * @include [FrameColKPropertyDocs] {@set [CommonFrameColDocs.ReceiverArg] \"myColumnGroup\".}\n */"} {"signature":"@ Suppress ( \"\" ) @ JvmName ( \"\" ) public fun < C > KProperty < * > . frameCol ( property : KProperty < DataFrame < C > > ) : ColumnAccessor < DataFrame < C > >","body":"= columnGroup ( this ) . ensureIsColumnGroup ( ) . frameColumn ( property ) . ensureIsFrameColumn ( )","docstring":"/**\n * @include [FrameColKPropertyDocs] {@set [CommonFrameColDocs.ReceiverArg] Type::myColumnGroup.}\n */"} {"signature":"public fun < C > KProperty < * > . frameCol ( property : KProperty < List < C > > ) : ColumnAccessor < DataFrame < C > >","body":"= columnGroup ( this ) . ensureIsColumnGroup ( ) . frameColumn ( property ) . ensureIsFrameColumn ( )","docstring":"/**\n * @include [FrameColKPropertyDocs] {@set [CommonFrameColDocs.ReceiverArg] Type::myColumnGroup.}\n */"} {"signature":"@ Suppress ( \"\" ) @ JvmName ( \"\" ) public fun < C > ColumnPath . frameCol ( property : KProperty < DataFrame < C > > ) : ColumnAccessor < DataFrame < C > >","body":"= columnGroup ( this ) . ensureIsColumnGroup ( ) . frameColumn ( property ) . ensureIsFrameColumn ( )","docstring":"/**\n * @include [FrameColKPropertyDocs] {@set [CommonFrameColDocs.ReceiverArg] \"pathTo\"[\"myColumnGroup\"].}\n */"} {"signature":"public fun < C > ColumnPath . frameCol ( property : KProperty < List < C > > ) : ColumnAccessor < DataFrame < C > >","body":"= columnGroup ( this ) . ensureIsColumnGroup ( ) . frameColumn ( property ) . ensureIsFrameColumn ( )","docstring":"/**\n * @include [FrameColKPropertyDocs] {@set [CommonFrameColDocs.ReceiverArg] \"pathTo\"[\"myColumnGroup\"].}\n */"} {"signature":"@ Suppress ( \"\" ) @ JvmName ( \"\" ) public fun < C > ColumnSet < DataFrame < C > > . frameCol ( index : Int ) : SingleColumn < DataFrame < C > >","body":"= getAt ( index ) . ensureIsFrameColumn ( )","docstring":"/**\n * @include [FrameColIndexDocs] {@set [CommonFrameColDocs.ReceiverArg] `[colsOf][ColumnsSelectionDsl.colsOf]`<`[Int][Int]`>().}\n * @include [CommonFrameColDocs.FrameColumnTypeParam]\n * {@set [CommonFrameColDocs.ExampleArg] {@include [CommonFrameColDocs.SingleExample]}}\n */"} {"signature":"public fun ColumnSet < * > . frameCol ( index : Int ) : SingleColumn < DataFrame < * > >","body":"= getAt ( index ) . cast < DataFrame < * > > ( ) . ensureIsFrameColumn ( )","docstring":"/**\n * @include [FrameColIndexDocs] {@set [CommonFrameColDocs.ReceiverArg] `[colsOf][ColumnsSelectionDsl.colsOf]`<`[Int][Int]`>().}\n * @include [CommonFrameColDocs.FrameColumnTypeParam]\n * {@set [CommonFrameColDocs.ExampleArg] {@include [CommonFrameColDocs.SingleExample]}}\n */"} {"signature":"@ Suppress ( \"\" ) @ JvmName ( \"\" ) public fun ColumnsSelectionDsl < * > . frameCol ( index : Int ) : SingleColumn < DataFrame < * > >","body":"= frameCol < Any ? > ( index )","docstring":"/**\n * @include [FrameColIndexDocs] {@set [CommonFrameColDocs.ReceiverArg]}\n */"} {"signature":"public fun < C > ColumnsSelectionDsl < * > . frameCol ( index : Int ) : SingleColumn < DataFrame < C > >","body":"= asSingleColumn ( ) . frameCol < C > ( index )","docstring":"/**\n * @include [FrameColIndexDocs] {@set [CommonFrameColDocs.ReceiverArg]}\n * @include [CommonFrameColDocs.FrameColumnTypeParam]\n */"} {"signature":"@ Suppress ( \"\" ) @ JvmName ( \"\" ) public fun SingleColumn < DataRow < * > > . frameCol ( index : Int ) : SingleColumn < DataFrame < * > >","body":"= frameCol < Any ? > ( index )","docstring":"/**\n * @include [FrameColIndexDocs] {@set [CommonFrameColDocs.ReceiverArg] myColumnGroup.}\n */"} {"signature":"public fun < C > SingleColumn < DataRow < * > > . frameCol ( index : Int ) : SingleColumn < DataFrame < C > >","body":"= this . ensureIsColumnGroup ( ) . allColumnsInternal ( ) . getAt ( index ) . cast < DataFrame < C > > ( ) . ensureIsFrameColumn ( )","docstring":"/**\n * @include [FrameColIndexDocs] {@set [CommonFrameColDocs.ReceiverArg] myColumnGroup.}\n * @include [CommonFrameColDocs.FrameColumnTypeParam]\n */"} {"signature":"@ Suppress ( \"\" ) @ JvmName ( \"\" ) public fun String . frameCol ( index : Int ) : SingleColumn < DataFrame < * > >","body":"= frameCol < Any ? > ( index )","docstring":"/**\n * @include [FrameColIndexDocs] {@set [CommonFrameColDocs.ReceiverArg] \"myColumnGroup\".}\n */"} {"signature":"public fun < C > String . frameCol ( index : Int ) : SingleColumn < DataFrame < C > >","body":"= columnGroup ( this ) . frameCol < C > ( index )","docstring":"/**\n * @include [FrameColIndexDocs] {@set [CommonFrameColDocs.ReceiverArg] \"myColumnGroup\".}\n * @include [CommonFrameColDocs.FrameColumnTypeParam]\n */"} {"signature":"@ Suppress ( \"\" ) @ JvmName ( \"\" ) public fun KProperty < * > . frameCol ( index : Int ) : SingleColumn < DataFrame < * > >","body":"= frameCol < Any ? > ( index )","docstring":"/**\n * @include [FrameColIndexDocs] {@set [CommonFrameColDocs.ReceiverArg] Type::myColumnGroup.}\n */"} {"signature":"public fun < C > KProperty < * > . frameCol ( index : Int ) : SingleColumn < DataFrame < C > >","body":"= columnGroup ( this ) . frameCol < C > ( index )","docstring":"/**\n * @include [FrameColIndexDocs] {@set [CommonFrameColDocs.ReceiverArg] Type::myColumnGroup.}\n * @include [CommonFrameColDocs.FrameColumnTypeParam]\n */"} {"signature":"@ Suppress ( \"\" ) @ JvmName ( \"\" ) public fun ColumnPath . frameCol ( index : Int ) : SingleColumn < DataFrame < * > >","body":"= frameCol < Any ? > ( index )","docstring":"/**\n * @include [FrameColIndexDocs] {@set [CommonFrameColDocs.ReceiverArg] \"pathTo\"[\"myColumnGroup\"].}\n */"} {"signature":"public fun < C > ColumnPath . frameCol ( index : Int ) : SingleColumn < DataFrame < C > >","body":"= columnGroup ( this ) . frameCol < C > ( index )","docstring":"/**\n * @include [FrameColIndexDocs] {@set [CommonFrameColDocs.ReceiverArg] \"pathTo\"[\"myColumnGroup\"].}\n * @include [CommonFrameColDocs.FrameColumnTypeParam]\n */"} {"signature":"internal fun < C > SingleColumn < DataFrame < C > > . ensureIsFrameColumn ( ) : SingleColumn < DataFrame < C > >","body":"= onResolve { col : ColumnWithPath < * > ? -> require ( col ? . isFrameColumn ( ) != false ) { \"\" } }","docstring":"/**\n * Checks the validity of this [SingleColumn],\n * by adding a check to see it's a [FrameColumn] (so, a [SingleColumn]<*>)\n * and throwing an [IllegalArgumentException] if it's not.\n */"} {"signature":"internal fun < C > ColumnAccessor < DataFrame < C > > . ensureIsFrameColumn ( ) : ColumnAccessor < DataFrame < C > >","body":"= onResolve { col : ColumnWithPath < * > ? -> require ( col ? . isFrameColumn ( ) != false ) { \"\" } }","docstring":"/** @include [SingleColumn.ensureIsFrameColumn] */"} {"signature":"fun FirElementWithResolveState . collectDesignationWithOptionalFile ( providedFile : FirFile ? = null ) : FirDesignation","body":"= tryCollectDesignationWithOptionalFile ( providedFile ) ? : errorWithAttachment ( \"\" ) { providedFile ? . let { withFirEntry ( \"\" , it ) } }","docstring":"/**\n * Consider using this function only if [collectDesignation] is not applicable.\n *\n * This extension function can be used in the case there your [FirElementWithResolveState] probably\n * doesn't have [getContainingFile] and it doesn't matter for your purposes.\n * Potentially, this function can become obsolete if we support all possible cases in [getContainingFile]\n *\n * @return [FirDesignation] where [FirDesignation.fileOrNull] can be null or throws an exception.\n *\n * @see collectDesignation\n * @see tryCollectDesignation\n * @see tryCollectDesignationWithOptionalFile\n */"} {"signature":"fun FirElementWithResolveState . collectDesignation ( providedFile : FirFile ? = null ) : FirDesignation","body":"= tryCollectDesignation ( providedFile ) ? : errorWithAttachment ( \"\" ) { withFirEntry ( \"\" , this @ collectDesignation ) }","docstring":"/**\n * @return [FirDesignation] where [FirDesignation.fileOrNull] not null or throws an exception.\n *\n * @see collectDesignationWithOptionalFile\n * @see tryCollectDesignation\n * @see tryCollectDesignationWithOptionalFile\n */"} {"signature":"fun FirElementWithResolveState . tryCollectDesignationWithOptionalFile ( providedFile : FirFile ? = null ) : FirDesignation ?","body":"= tryCollectDesignation ( providedFile = providedFile , target = this )","docstring":"/**\n * Consider using this function only if [tryCollectDesignation] is not applicable.\n *\n * This extension function can be used in the case there your [FirElementWithResolveState] probably\n * doesn't have [getContainingFile] and it doesn't matter for your purposes.\n * Potentially, this function can become obsolete if we support all possible cases in [getContainingFile]\n *\n * @return [FirDesignation] where [FirDesignation.fileOrNull] can be null or null.\n *\n * @see collectDesignationWithOptionalFile\n * @see collectDesignation\n * @see tryCollectDesignation\n */"} {"signature":"fun FirElementWithResolveState . tryCollectDesignation ( providedFile : FirFile ? = null ) : FirDesignation ?","body":"= when ( this ) { is FirSyntheticProperty , is FirSyntheticPropertyAccessor -> unexpectedElementError < FirElementWithResolveState > ( this ) is FirDeclaration -> { val designation = tryCollectDesignation ( providedFile = providedFile , target = this ) designation ? . takeIf { it . fileOrNull != null } } else -> unexpectedElementError < FirElementWithResolveState > ( this ) }","docstring":"/**\n * @return [FirDesignation] with not-null [FirDesignation.file] or null.\n *\n * @see collectDesignation\n * @see tryCollectDesignationWithOptionalFile\n * @see collectDesignationWithOptionalFile\n */"} {"signature":"fun printlnMultiLine ( s : String ) : SmartPrinter","body":"{ printer . printlnWithNoIndent ( s . replaceIndent ( currentIndent ) . lines ( ) . joinToString ( separator = \"\" ) { it . ifBlank { \"\" } } ) notFirstPrint = false return this }","docstring":"/**\n * Prints the multi-line string literal [s] while respecting [currentIndent].\n * Whitespace-only lines are made empty.\n */"} {"signature":"@ ExperimentalStdlibApi @ SinceKotlin ( \"\" ) @ ExperimentalUnsignedTypes @ InlineOnly public inline fun UByteArray . toHexString ( format : HexFormat = HexFormat . Default ) : String","body":"= storage . toHexString ( format )","docstring":"/**\n * Formats bytes in this array using the specified [format].\n *\n * Note that only [HexFormat.upperCase] and [HexFormat.BytesHexFormat] affect formatting.\n *\n * @param format the [HexFormat] to use for formatting, [HexFormat.Default] by default.\n *\n * @throws IllegalArgumentException if the result length is more than [String] maximum capacity.\n */"} {"signature":"@ ExperimentalStdlibApi @ SinceKotlin ( \"\" ) @ ExperimentalUnsignedTypes @ InlineOnly public inline fun UByteArray . toHexString ( startIndex : Int = , endIndex : Int = size , format : HexFormat = HexFormat . Default ) : String","body":"= storage . toHexString ( startIndex , endIndex , format )","docstring":"/**\n * Formats bytes in this array using the specified [HexFormat].\n *\n * Note that only [HexFormat.upperCase] and [HexFormat.BytesHexFormat] affect formatting.\n *\n * @param startIndex the beginning (inclusive) of the subrange to format, 0 by default.\n * @param endIndex the end (exclusive) of the subrange to format, size of this array by default.\n * @param format the [HexFormat] to use for formatting, [HexFormat.Default] by default.\n *\n * @throws IndexOutOfBoundsException when [startIndex] or [endIndex] is out of range of this array indices.\n * @throws IllegalArgumentException when `startIndex > endIndex`.\n * @throws IllegalArgumentException if the result length is more than [String] maximum capacity.\n */"} {"signature":"@ ExperimentalStdlibApi @ SinceKotlin ( \"\" ) @ ExperimentalUnsignedTypes @ InlineOnly public inline fun String . hexToUByteArray ( format : HexFormat = HexFormat . Default ) : UByteArray","body":"= hexToByteArray ( format ) . asUByteArray ( )","docstring":"/**\n * Parses bytes from this string using the specified [HexFormat].\n *\n * Note that only [HexFormat.BytesHexFormat] affects parsing,\n * and parsing is performed in case-insensitive manner.\n * Also, any of the char sequences CRLF, LF and CR is considered a valid line separator.\n *\n * @param format the [HexFormat] to use for parsing, [HexFormat.Default] by default.\n *\n * @throws IllegalArgumentException if this string does not comply with the specified [format].\n */"} {"signature":"@ ExperimentalStdlibApi @ SinceKotlin ( \"\" ) @ InlineOnly public inline fun UByte . toHexString ( format : HexFormat = HexFormat . Default ) : String","body":"= data . toHexString ( format )","docstring":"/**\n * Formats this `UByte` value using the specified [format].\n *\n * Note that only [HexFormat.upperCase] and [HexFormat.NumberHexFormat] affect formatting.\n *\n * @param format the [HexFormat] to use for formatting, [HexFormat.Default] by default.\n */"} {"signature":"@ ExperimentalStdlibApi @ SinceKotlin ( \"\" ) @ InlineOnly public inline fun String . hexToUByte ( format : HexFormat = HexFormat . Default ) : UByte","body":"= hexToByte ( format ) . toUByte ( )","docstring":"/**\n * Parses an `UByte` value from this string using the specified [format].\n *\n * Note that only [HexFormat.NumberHexFormat] affects parsing,\n * and parsing is performed in case-insensitive manner.\n *\n * @param format the [HexFormat] to use for parsing, [HexFormat.Default] by default.\n *\n * @throws IllegalArgumentException if this string does not comply with the specified [format].\n */"} {"signature":"@ ExperimentalStdlibApi @ SinceKotlin ( \"\" ) @ InlineOnly public inline fun UShort . toHexString ( format : HexFormat = HexFormat . Default ) : String","body":"= data . toHexString ( format )","docstring":"/**\n * Formats this `UShort` value using the specified [format].\n *\n * Note that only [HexFormat.upperCase] and [HexFormat.NumberHexFormat] affect formatting.\n *\n * @param format the [HexFormat] to use for formatting, [HexFormat.Default] by default.\n */"} {"signature":"@ ExperimentalStdlibApi @ SinceKotlin ( \"\" ) @ InlineOnly public inline fun String . hexToUShort ( format : HexFormat = HexFormat . Default ) : UShort","body":"= hexToShort ( format ) . toUShort ( )","docstring":"/**\n * Parses an `UShort` value from this string using the specified [format].\n *\n * Note that only [HexFormat.NumberHexFormat] affects parsing,\n * and parsing is performed in case-insensitive manner.\n *\n * @param format the [HexFormat] to use for parsing, [HexFormat.Default] by default.\n *\n * @throws IllegalArgumentException if this string does not comply with the specified [format].\n */"} {"signature":"@ ExperimentalStdlibApi @ SinceKotlin ( \"\" ) @ InlineOnly public inline fun UInt . toHexString ( format : HexFormat = HexFormat . Default ) : String","body":"= data . toHexString ( format )","docstring":"/**\n * Formats this `UInt` value using the specified [format].\n *\n * Note that only [HexFormat.upperCase] and [HexFormat.NumberHexFormat] affect formatting.\n *\n * @param format the [HexFormat] to use for formatting, [HexFormat.Default] by default.\n */"} {"signature":"@ ExperimentalStdlibApi @ SinceKotlin ( \"\" ) @ InlineOnly public inline fun String . hexToUInt ( format : HexFormat = HexFormat . Default ) : UInt","body":"= hexToInt ( format ) . toUInt ( )","docstring":"/**\n * Parses an `UInt` value from this string using the specified [format].\n *\n * Note that only [HexFormat.NumberHexFormat] affects parsing,\n * and parsing is performed in case-insensitive manner.\n *\n * @param format the [HexFormat] to use for parsing, [HexFormat.Default] by default.\n *\n * @throws IllegalArgumentException if this string does not comply with the specified [format].\n */"} {"signature":"@ ExperimentalStdlibApi @ SinceKotlin ( \"\" ) @ InlineOnly public inline fun ULong . toHexString ( format : HexFormat = HexFormat . Default ) : String","body":"= data . toHexString ( format )","docstring":"/**\n * Formats this `ULong` value using the specified [format].\n *\n * Note that only [HexFormat.upperCase] and [HexFormat.NumberHexFormat] affect formatting.\n *\n * @param format the [HexFormat] to use for formatting, [HexFormat.Default] by default.\n */"} {"signature":"@ ExperimentalStdlibApi @ SinceKotlin ( \"\" ) @ InlineOnly public inline fun String . hexToULong ( format : HexFormat = HexFormat . Default ) : ULong","body":"= hexToLong ( format ) . toULong ( )","docstring":"/**\n * Parses an `ULong` value from this string using the specified [format].\n *\n * Note that only [HexFormat.NumberHexFormat] affects parsing,\n * and parsing is performed in case-insensitive manner.\n *\n * @param format the [HexFormat] to use for parsing, [HexFormat.Default] by default.\n *\n * @throws IllegalArgumentException if this string does not comply with the specified [format].\n */"} {"signature":"@ Throws ( RemoteException :: class ) fun report ( category : Int , severity : Int , message : String ? , attachment : Serializable ? )","body":"@ Throws ( RemoteException :: class ) fun report ( category : Int , severity : Int , message : String ? , attachment : Serializable ? )","docstring":"/**\n * Reports different kind of diagnostic messages from compile daemon to compile daemon clients (jps, gradle, ...)\n */"} {"signature":"override fun toString ( ) : String","body":"override fun toString ( ) : String","docstring":"/**\n * Returns a string representation of this path.\n *\n * Note that the returned value will represent the same path as the value\n * passed to [Path], but it may not be identical to it.\n */"} {"signature":"override fun hashCode ( ) : Int","body":"override fun hashCode ( ) : Int","docstring":"/**\n * Returns hash code of this Path.\n * The hash code is calculated for the path's string representations ([toString]).\n */"} {"signature":"override fun equals ( other : Any ? ) : Boolean","body":"override fun equals ( other : Any ? ) : Boolean","docstring":"/**\n * Compares two paths for equality using its string representation ([toString]).\n */"} {"signature":"public expect fun Path ( path : String ) : Path","body":"public expect fun Path ( path : String ) : Path","docstring":"/**\n * Returns Path for the given string without much of a validation.\n */"} {"signature":"public fun Path ( base : String , vararg parts : String ) : Path","body":"{ return Path ( path = buildString { append ( base ) parts . forEach { if ( isNotEmpty ( ) && ! endsWith ( SystemPathSeparator ) ) { append ( SystemPathSeparator ) } append ( it ) } } ) }","docstring":"/**\n * Returns Path for the given [base] path concatenated with [parts] using [SystemPathSeparator].\n */"} {"signature":"public fun Path ( base : Path , vararg parts : String ) : Path","body":"{ return Path ( base . toString ( ) , * parts ) }","docstring":"/**\n * Returns Path for the given [base] path concatenated with [parts] using [SystemPathSeparator].\n */"} {"signature":"@ Deprecated ( message = \"\" , replaceWith = ReplaceWith ( expression = \"\" , imports = arrayOf ( \"\" ) ) , level = DeprecationLevel . WARNING ) @ JvmName ( \"\" ) public fun Path . source ( ) : Source","body":"= SystemFileSystem . source ( this ) . buffered ( )","docstring":"/**\n * Returns [RawSource] for the given file or throws if path is not a file or does not exist\n *\n * Use of this method is deprecated with warning since kotlinx-io 0.3.0. The method will be removed in 0.4.0.\n */"} {"signature":"@ Deprecated ( message = \"\" , replaceWith = ReplaceWith ( expression = \"\" , imports = arrayOf ( \"\" ) ) , level = DeprecationLevel . WARNING ) @ JvmName ( \"\" ) public fun Path . sink ( ) : Sink","body":"= SystemFileSystem . sink ( this ) . buffered ( )","docstring":"/**\n * Returns [RawSink] for the given path, creates file if it doesn't exist, throws if it's a directory,\n * overwrites contents.\n *\n * Use of this method is deprecated with warning since kotlinx-io 0.3.0. The method will be removed in 0.4.0.\n */"} {"signature":"abstract fun consume ( storage : Receiver , input : String ) : NumberConsumptionError ?","body":"abstract fun consume ( storage : Receiver , input : String ) : NumberConsumptionError ?","docstring":"/**\n * Wholly consumes the given [input]. Should be called with a string consisting of [length] digits, or,\n * if [length] is `null`, with a string consisting of any number of digits. [consume] itself does not\n * necessarily check the length of the input string, instead expecting to be passed a valid one.\n *\n * Returns `null` on success and a `NumberConsumptionError` on failure.\n */"} {"signature":"private fun retainOrRemoveAllInternal ( rangeOffset : Int , rangeLength : Int , elements : Collection < E > , retain : Boolean ) : Int","body":"{ var i = var j = while ( i < rangeLength ) { if ( elements . contains ( backing [ rangeOffset + i ] ) == retain ) { backing [ rangeOffset + j ++ ] = backing [ rangeOffset + i ++ ] } else { i ++ } } val removed = rangeLength - j backing . copyInto ( backing , startIndex = rangeOffset + rangeLength , endIndex = length , destinationOffset = rangeOffset + j ) backing . resetRange ( fromIndex = length - removed , toIndex = length ) if ( removed > ) registerModification ( ) length -= removed return removed }","docstring":"/** Retains elements if [retain] == true and removes them it [retain] == false. */"} {"signature":"private fun retainOrRemoveAllInternal ( rangeOffset : Int , rangeLength : Int , elements : Collection < E > , retain : Boolean ) : Int","body":"{ val removed = if ( parent != null ) { parent . retainOrRemoveAllInternal ( rangeOffset , rangeLength , elements , retain ) } else { root . retainOrRemoveAllInternal ( rangeOffset , rangeLength , elements , retain ) } if ( removed > ) registerModification ( ) length -= removed return removed }","docstring":"/** Retains elements if [retain] == true and removes them it [retain] == false. */"} {"signature":"private fun < T : DoubleColonLHS > tryResolveLHS ( doubleColonExpression : KtDoubleColonExpression , context : ExpressionTypingContext , criterion : ( KtDoubleColonExpression ) -> Boolean , resolve : ( KtExpression , ExpressionTypingContext ) -> T ? ) : LHSResolutionResult < T > ?","body":"{ val expression = doubleColonExpression . receiverExpression ? : return null if ( ! criterion ( doubleColonExpression ) ) return null val traceAndCache = TemporaryTraceAndCache . create ( context , \"\" , doubleColonExpression ) val c = context . replaceTraceAndCache ( traceAndCache ) . replaceExpectedType ( NO_EXPECTED_TYPE ) . replaceContextDependency ( ContextDependency . INDEPENDENT ) val lhs = resolve ( expression , c ) return LHSResolutionResult ( lhs , expression , traceAndCache ) }","docstring":"/**\n * Returns null if the LHS is definitely not an expression. Returns a non-null result if a resolution was attempted and led to\n * either a successful result or not.\n */"} {"signature":"public actual fun ComplexDouble ( re : Double , im : Double ) : ComplexDouble","body":"= if ( fitsInFloat ( re ) && fitsInFloat ( im ) ) ComplexDouble32 ( re , im ) else ComplexDouble64 ( re , im )","docstring":"/**\n * Creates a [ComplexDouble] with the given real and imaginary values in floating-point format.\n *\n * @param re the real value of the complex number in double format.\n * @param im the imaginary value of the complex number in double format.\n */"} {"signature":"public actual fun ComplexDouble ( re : Number , im : Number ) : ComplexDouble","body":"= ComplexDouble ( re . toDouble ( ) , im . toDouble ( ) )","docstring":"/**\n * Creates a [ComplexDouble] with the given real and imaginary values in number format.\n *\n * @param re the real value of the complex number in number format.\n * @param im the imaginary value of the complex number in number format.\n */"} {"signature":"private fun fitsInFloat ( d : Double ) : Boolean","body":"= d . toFloat ( ) . toDouble ( ) == d","docstring":"/**\n * Determines whether the given double value can be accurately represented as a float value or not.\n *\n * @param d is the double value to be checked.\n * @return this method returns a Boolean value,\n * true if the double value can be accurately represented as a float value, false otherwise.\n */"} {"signature":"private fun isComponentNMethod ( method : CallableMemberDescriptor ) : Boolean","body":"{ if ( ( method as? FunctionDescriptor ) ? . isOperator != true ) return false val parent = method . containingDeclaration if ( parent is ClassDescriptor && parent . isData && DataClassResolver . isComponentLike ( method . name ) ) { return true } return false }","docstring":"/**\n * Check that given [method] is a synthetic .componentN() method of a data class.\n */"} {"signature":"internal fun ClassDescriptor . isHiddenFromObjC ( ) : Boolean","body":"= when { ( this . containingDeclaration as? ClassDescriptor ) ? . isHiddenFromObjC ( ) == true -> true else -> annotations . any { annotation -> annotation . annotationClass ? . annotations ? . any { it . fqName == KonanFqNames . hidesFromObjC } == true } }","docstring":"/**\n * Check if the given class or its enclosing declaration is marked as @HiddenFromObjC.\n */"} {"signature":"@ InternalKotlinNativeApi fun ObjCExportMapper . isBaseMethod ( descriptor : FunctionDescriptor )","body":"= this . isBase ( descriptor )","docstring":"/**\n * Check that given [descriptor] is a so-called \"base method\", i.e. method\n * that doesn't override anything in a generated Objective-C interface.\n * Note that it does not mean that it has no \"override\" keyword.\n * Consider example:\n * ```kotlin\n * private interface I {\n * fun f()\n * }\n *\n * class C : I {\n * override fun f() {}\n * }\n * ```\n * Interface `I` is not exposed to the generated header, so C#f is considered to be a base method even though it has an \"override\" keyword.\n */"} {"signature":"fun String . extFun ( k : String , s : String = \"\" )","body":"= this + k + s","docstring":"/**\n * val sExtFun = \"O\"::extFun\n * sExtFun.callBy(mapOf(sExtFun.parameters[0] to \"K\"))\n */"} {"signature":"fun ssdCudaInference ( )","body":"{ val modelHub = ONNXModelHub ( cacheDirectory = File ( \"\" ) ) val modelType = ONNXModels . ObjectDetection . SSD val model = modelHub . loadModel ( modelType ) model . inferAndCloseUsing ( CUDA ( ) ) { val preprocessing = pipeline < BufferedImage > ( ) . resize { outputHeight = outputWidth = } . convert { colorMode = ColorMode . RGB } . toFloatArray { } . call ( modelType . preprocessor ) . fileLoader ( ) for ( i in .. ) { val inputData = preprocessing . load ( getFileFromResource ( \"\" ) ) val start = System . currentTimeMillis ( ) val yhat = it . predictRaw ( inputData ) val end = System . currentTimeMillis ( ) println ( \"\" ) println ( yhat . values . toTypedArray ( ) . contentDeepToString ( ) ) } } }","docstring":"/**\n * This example demonstrates how to infer SSD model using [inferAndCloseUsing] scope function:\n * - Model is obtained from [ONNXModelHub].\n * - Model performs classification of a few images located in resources using CUDA execution provider.\n * - Internal onnx session is closed automatically after inference lambda is executed.\n */"} {"signature":"fun take ( ) : Segment","body":"fun take ( ) : Segment","docstring":"/** Return a segment for the caller's use. */"} {"signature":"fun recycle ( segment : Segment )","body":"fun recycle ( segment : Segment )","docstring":"/** Recycle a segment that the caller no longer needs. */"} {"signature":"infix fun < T1 , T2 > T1 . X ( other : T2 ) : Tuple2 < T1 , T2 >","body":"= Tuple2 < T1 , T2 > ( this , other )","docstring":"/**\n * Returns a new Tuple2 of the given arguments.\n * @see tupleOf\n * @see t\n **/"} {"signature":"@ PublishedApi @ SinceKotlin ( \"\" ) internal fun getProgressionLastElement ( start : UInt , end : UInt , step : Int ) : UInt","body":"= when { step > -> if ( start >= end ) end else end - differenceModulo ( end , start , step . toUInt ( ) ) step < -> if ( start <= end ) end else end + differenceModulo ( start , end , ( - step ) . toUInt ( ) ) else -> throw kotlin . IllegalArgumentException ( \"\" ) }","docstring":"/**\n * Calculates the final element of a bounded arithmetic progression, i.e. the last element of the progression which is in the range\n * from [start] to [end] in case of a positive [step], or from [end] to [start] in case of a negative\n * [step].\n *\n * No validation on passed parameters is performed. The given parameters should satisfy the condition:\n *\n * - either `step > 0` and `start <= end`,\n * - or `step < 0` and `start >= end`.\n *\n * @param start first element of the progression\n * @param end ending bound for the progression\n * @param step increment, or difference of successive elements in the progression\n * @return the final element of the progression\n * @suppress\n */"} {"signature":"@ PublishedApi @ SinceKotlin ( \"\" ) internal fun getProgressionLastElement ( start : ULong , end : ULong , step : Long ) : ULong","body":"= when { step > -> if ( start >= end ) end else end - differenceModulo ( end , start , step . toULong ( ) ) step < -> if ( start <= end ) end else end + differenceModulo ( start , end , ( - step ) . toULong ( ) ) else -> throw kotlin . IllegalArgumentException ( \"\" ) }","docstring":"/**\n * Calculates the final element of a bounded arithmetic progression, i.e. the last element of the progression which is in the range\n * from [start] to [end] in case of a positive [step], or from [end] to [start] in case of a negative\n * [step].\n *\n * No validation on passed parameters is performed. The given parameters should satisfy the condition:\n *\n * - either `step > 0` and `start <= end`,\n * - or `step < 0` and `start >= end`.\n *\n * @param start first element of the progression\n * @param end ending bound for the progression\n * @param step increment, or difference of successive elements in the progression\n * @return the final element of the progression\n * @suppress\n */"} {"signature":"fun main ( )","body":"{ val jsonConfigFile = getVGG19JSONConfigFile ( ) val model = Sequential . loadModelConfiguration ( jsonConfigFile ) val imageNetClassLabels = Imagenet . V1k . labels ( ) model . use { it . compile ( optimizer = Adam ( ) , loss = Losses . MAE , metric = Metrics . ACCURACY ) it . logSummary ( ) val hdfFile = getVGG19WeightsFile ( ) it . loadWeights ( hdfFile ) val inputStreamLoader = pipeline < BufferedImage > ( ) . convert { colorMode = ColorMode . BGR } . toFloatArray { } . call ( InputType . CAFFE . preprocessing ( ) ) . inputStreamLoader ( ) for ( i in .. ) { val inputStream = OnHeapDataset :: class . java . classLoader . getResourceAsStream ( \"\" ) val inputData = inputStreamLoader . load ( inputStream ) val res = it . predictLabel ( inputData ) println ( \"\" ) val top5 = it . predictTop5Labels ( inputData , imageNetClassLabels ) println ( top5 . toString ( ) ) } } }","docstring":"/**\n * This example demonstrates the inference concept on VGG'19 model:\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 VGG'19 during training on ImageNet dataset) is applied to each image before prediction.\n * - No additional training.\n * - No new layers are added.\n *\n * @see \n * Very Deep Convolutional Networks for Large-Scale Image Recognition (ICLR 2015).\n * @see \n * Detailed description of VGG'19 model and an approach to build it in Keras.\n */"} {"signature":"private fun getVGG19JSONConfigFile ( ) : File","body":"{ val properties = Properties ( ) val reader = FileReader ( \"\" ) properties . load ( reader ) val vgg19JSONModelPath = properties [ \"\" ] as String return File ( vgg19JSONModelPath ) }","docstring":"/** Returns JSON file with model configuration, saved from Keras 2.x. */"} {"signature":"private fun getVGG19WeightsFile ( ) : HdfFile","body":"{ val properties = Properties ( ) val reader = FileReader ( \"\" ) properties . load ( reader ) val vgg19h5WeightsPath = properties [ \"\" ] as String return HdfFile ( File ( vgg19h5WeightsPath ) ) }","docstring":"/** Returns .h5 file with model weights, saved from Keras 2.x. */"} {"signature":"private fun FirFunctionSymbol < * > . isArrayLambdaConstructor ( ) : Boolean","body":"{ return this is FirConstructorSymbol && valueParameterSymbols . size == && resolvedReturnType . isArrayOrPrimitiveArray }","docstring":"/**\n * @return true if the symbol is the constructor of one of 9 array classes (`Array`,\n * `IntArray`, `FloatArray`, ...) which takes the size and an initializer lambda as parameters.\n * Such constructors are marked as `inline` but they are not loaded as such because the `inline`\n * flag is not stored for constructors in the binary metadata. Therefore, we pretend that they\n * are inline.\n */"} {"signature":"public actual operator fun contains ( char : Char ) : Boolean","body":"= Character . getType ( char ) == this . value","docstring":"/**\n * Returns `true` if [char] character belongs to this category.\n */"} {"signature":"public fun valueOf ( category : Int ) : CharCategory","body":"= when ( category ) { in .. -> entries [ category ] in .. -> entries [ category - ] else -> throw IllegalArgumentException ( \"\" ) }","docstring":"/**\n * Returns the [CharCategory] corresponding to the specified [category] that represents a Java general category constant.\n *\n * @throws IllegalArgumentException if the [category] does not represent a Java general category constant.\n */"} {"signature":"@ Suppress ( \"\" ) public actual fun String . startsWith ( prefix : String , ignoreCase : Boolean = false ) : Boolean","body":"{ if ( ! ignoreCase ) return nativeStartsWith ( prefix , ) else return regionMatches ( , prefix , , prefix . length , ignoreCase ) }","docstring":"/**\n * Returns `true` if this string starts with the specified prefix.\n */"} {"signature":"@ Suppress ( \"\" ) public actual fun String . startsWith ( prefix : String , startIndex : Int , ignoreCase : Boolean = false ) : Boolean","body":"{ if ( ! ignoreCase ) return nativeStartsWith ( prefix , startIndex ) else return regionMatches ( startIndex , prefix , , prefix . length , ignoreCase ) }","docstring":"/**\n * Returns `true` if a substring of this string starting at the specified offset [startIndex] starts with the specified prefix.\n */"} {"signature":"@ Suppress ( \"\" ) public actual fun String . endsWith ( suffix : String , ignoreCase : Boolean = false ) : Boolean","body":"{ if ( ! ignoreCase ) return nativeEndsWith ( suffix ) else return regionMatches ( length - suffix . length , suffix , , suffix . length , ignoreCase ) }","docstring":"/**\n * Returns `true` if this string ends with the specified suffix.\n */"} {"signature":"@ Suppress ( \"\" ) public actual fun String ? . equals ( other : String ? , ignoreCase : Boolean = false ) : Boolean","body":"{ if ( this == null ) return other == null if ( other == null ) return false if ( ! ignoreCase ) return this == other if ( this . length != other . length ) return false for ( index in until this . length ) { val thisChar = this [ index ] val otherChar = other [ index ] if ( ! thisChar . equals ( otherChar , ignoreCase ) ) { return false } } return true }","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":"@ Suppress ( \"\" ) public actual fun CharSequence . regionMatches ( thisOffset : Int , other : CharSequence , otherOffset : Int , length : Int , ignoreCase : Boolean = false ) : Boolean","body":"= regionMatchesImpl ( thisOffset , other , otherOffset , length , ignoreCase )","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 ( \"\" ) @ Suppress ( \"\" ) public actual fun String . regionMatches ( thisOffset : Int , other : String , otherOffset : Int , length : Int , ignoreCase : Boolean = false ) : Boolean","body":"= regionMatchesImpl ( thisOffset , other , otherOffset , length , ignoreCase )","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":"@ Deprecated ( \"\" , ReplaceWith ( \"\" ) ) @ DeprecatedSinceKotlin ( warningSince = \"\" ) public actual fun String . capitalize ( ) : String","body":"{ return if ( isNotEmpty ( ) ) substring ( , ) . uppercase ( ) + substring ( ) else this }","docstring":"/**\n * Returns a copy of this string having its first letter titlecased using the rules of the default locale,\n * or the original string if it's empty or already starts with a title case letter.\n *\n * The title case of a character is usually the same as its upper case with several exceptions.\n * The particular list of characters with the special title case form depends on the underlying platform.\n *\n * @sample samples.text.Strings.capitalize\n */"} {"signature":"@ Deprecated ( \"\" , ReplaceWith ( \"\" ) ) @ DeprecatedSinceKotlin ( warningSince = \"\" ) public actual fun String . decapitalize ( ) : String","body":"{ return if ( isNotEmpty ( ) ) substring ( , ) . lowercase ( ) + substring ( ) else this }","docstring":"/**\n * Returns a copy of this string having its first letter lowercased using the rules of the default locale,\n * or the original string if it's empty or already starts with a lower case letter.\n *\n * @sample samples.text.Strings.decapitalize\n */"} {"signature":"public actual fun CharSequence . repeat ( n : Int ) : String","body":"{ require ( n >= ) { \"\" } return when ( n ) { -> \"\" -> this . toString ( ) else -> { var result = \"\" if ( ! isEmpty ( ) ) { var s = this . toString ( ) var count = n while ( true ) { if ( ( count and ) == ) { result += s } count = count ushr if ( count == ) { break } s += s } } return result } } }","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":"@ Suppress ( \"\" ) public actual fun String . replace ( oldValue : String , newValue : String , ignoreCase : Boolean = false ) : String","body":"= nativeReplace ( RegExp ( Regex . escape ( oldValue ) , if ( ignoreCase ) \"\" else \"\" ) , Regex . nativeEscapeReplacement ( newValue ) )","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":"@ Suppress ( \"\" ) public actual fun String . replace ( oldChar : Char , newChar : Char , ignoreCase : Boolean = false ) : String","body":"= nativeReplace ( RegExp ( Regex . escape ( oldChar . toString ( ) ) , if ( ignoreCase ) \"\" else \"\" ) , newChar . toString ( ) )","docstring":"/**\n * Returns a new string with all occurrences of [oldChar] replaced with [newChar].\n *\n * @sample samples.text.Strings.replace\n */"} {"signature":"fun asyncFetch ( )","body":"fun asyncFetch ( )","docstring":"/**\n * Starts the async query to fetch the stats.\n */"} {"signature":"fun asyncTryClickAndFetch ( ) : Boolean","body":"fun asyncTryClickAndFetch ( ) : Boolean","docstring":"/**\n * Starts the async query to submit a click and fetch the stats.\n *\n * @return `true` on success, or `false` if the call should be retried later.\n */"} {"signature":"fun getMostRecentFetched ( ) : Stats ?","body":"fun getMostRecentFetched ( ) : Stats ?","docstring":"/**\n * @return the [Stats] fetched most recently.\n */"} {"signature":"fun explicitApi ( )","body":"fun explicitApi ( )","docstring":"/**\n * Sets [explicitApi] option to report issues as errors.\n */"} {"signature":"fun explicitApiWarning ( )","body":"fun explicitApiWarning ( )","docstring":"/**\n * Sets [explicitApi] option to report issues as warnings.\n */"} {"signature":"@ Deprecated ( \"\" , level = DeprecationLevel . ERROR ) @ Suppress ( \"\" ) fun toCompilerArg ( )","body":"= \"\"","docstring":"/**\n * @suppress\n */"} {"signature":"override fun dispatch ( context : CoroutineContext , block : Runnable ) : Unit","body":"= Platform . runLater ( block )","docstring":"/** @suppress */"} {"signature":"override fun scheduleResumeAfterDelay ( timeMillis : Long , continuation : CancellableContinuation < Unit > )","body":"{ val timeline = schedule ( timeMillis ) { with ( continuation ) { resumeUndispatched ( Unit ) } } continuation . invokeOnCancellation { timeline . stop ( ) } }","docstring":"/** @suppress */"} {"signature":"override fun invokeOnTimeout ( timeMillis : Long , block : Runnable , context : CoroutineContext ) : DisposableHandle","body":"{ val timeline = schedule ( timeMillis ) { block . run ( ) } return DisposableHandle { timeline . stop ( ) } }","docstring":"/** @suppress */"} {"signature":"public suspend fun awaitPulse ( ) : Long","body":"= suspendCancellableCoroutine { cont -> pulseTimer . onNext ( cont ) }","docstring":"/**\n * Suspends coroutine until next JavaFx pulse and returns time of the pulse on resumption.\n * If the [Job] of the current coroutine is completed while this suspending function is waiting, this function\n * immediately resumes with [CancellationException][kotlinx.coroutines.CancellationException].\n */"} {"signature":"internal fun initPlatform ( ) : Boolean","body":"= PlatformInitializer . success","docstring":"/** @return true if initialized successfully, and false if no display is detected */"} {"signature":"fun IrProperty . isJvmOptimizableDelegate ( ) : Boolean","body":"= isDelegated && ! isFakeOverride && backingField != null && ( getPropertyReferenceForOptimizableDelegatedProperty ( ) != null || getSingletonOrConstantForOptimizableDelegatedProperty ( ) != null )","docstring":"/** Returns true if a delegate is optimizable on the JVM, omitting a `$delegate` auxiliary property */"} {"signature":"internal fun addDefaultLlvmFunctionAttributes ( context : Context , llvmFunction : LLVMValueRef )","body":"{ if ( shouldEnforceFramePointer ( context ) ) { enforceFramePointer ( llvmFunction , context ) } }","docstring":"/**\n * Mimics parts of clang's `CodeGenModule::getDefaultFunctionAttributes`\n * that are required for Kotlin/Native compiler.\n */"} {"signature":"internal fun addTargetCpuAndFeaturesAttributes ( context : Context , llvmFunction : LLVMValueRef )","body":"{ context . config . platform . targetCpu ? . let { LLVMAddTargetDependentFunctionAttr ( llvmFunction , \"\" , it ) } context . config . platform . targetCpuFeatures ? . let { LLVMAddTargetDependentFunctionAttr ( llvmFunction , \"\" , it ) } }","docstring":"/**\n * Set target cpu and its features to make LLVM generate correct machine code.\n */"} {"signature":"fun main ( )","body":"{ gradleNoKeyValue ( ) gradleKeyValue ( ) kspNoKeyValue ( ) kspKeyValue ( ) }","docstring":"/**\n * In this file we'll demonstrate how to use the jsonOption `keyValuePaths`\n * both using the Gradle- and KSP plugin and what it does.\n */"} {"signature":"private fun gradleNoKeyValue ( )","body":"{ val df = MetricsNoKeyValue . readJson ( \"\" ) df . print ( columnTypes = true , title = true , borders = true ) }","docstring":"/**\n * Gradle example of reading a JSON file with no key-value pairs.\n * Ctrl+Click on [MetricsNoKeyValue] to see the generated code.\n */"} {"signature":"private fun gradleKeyValue ( )","body":"{ val df = MetricsKeyValue . readJson ( \"\" ) df . print ( columnTypes = true , title = true , borders = true ) }","docstring":"/**\n * Gradle example of reading a JSON file with key-value pairs.\n * Ctrl+Click on [MetricsKeyValue] to see the generated code.\n */"} {"signature":"private fun kspNoKeyValue ( )","body":"{ val df = APIsNoKeyValue . readJson ( \"\" ) df . print ( columnTypes = true , title = true , borders = true ) }","docstring":"/**\n * KSP example of reading a JSON file with no key-value pairs.\n * Ctrl+Click on [APIsNoKeyValue] to see the generated code.\n *\n * Note the many generated interfaces. You can imagine larger files crashing the code generator.\n */"} {"signature":"private fun kspKeyValue ( )","body":"{ val df = APIsKeyValue . readJson ( \"\" ) . value . first ( ) df . print ( columnTypes = true , title = true , borders = true ) }","docstring":"/**\n * KSP example of reading a JSON file with key-value pairs.\n * Ctrl+Click on [APIsKeyValue] to see the generated code.\n */"} {"signature":"fun < H : Any > Collection < H > . selectMostSpecificInEachOverridableGroup ( descriptorByHandle : H . ( ) -> CallableDescriptor ) : Collection < H >","body":"{ if ( size <= ) return this val queue = LinkedList < H > ( this ) val result = SmartSet . create < H > ( ) while ( queue . isNotEmpty ( ) ) { val nextHandle : H = queue . first ( ) val conflictedHandles = SmartSet . create < H > ( ) val overridableGroup = OverridingUtil . extractMembersOverridableInBothWays ( nextHandle , queue , descriptorByHandle ) { conflictedHandles . add ( it ) } if ( overridableGroup . size == && conflictedHandles . isEmpty ( ) ) { result . add ( overridableGroup . single ( ) ) continue } val mostSpecific = OverridingUtil . selectMostSpecificMember ( overridableGroup , descriptorByHandle ) val mostSpecificDescriptor = mostSpecific . descriptorByHandle ( ) overridableGroup . filterNotTo ( conflictedHandles ) { OverridingUtil . isMoreSpecific ( mostSpecificDescriptor , it . descriptorByHandle ( ) ) } if ( conflictedHandles . isNotEmpty ( ) ) { result . addAll ( conflictedHandles ) } result . add ( mostSpecific ) } return result }","docstring":"/**\n * @param is something that handles CallableDescriptor inside\n */"} {"signature":"actual fun < T > CoroutineScope . asyncWithDealy ( delay : Long , block : suspend ( ) -> T ) : Deferred < T >","body":"{ TODO ( \"\" ) }","docstring":"/**\n * MacOS actual implementation for `asyncWithDelay`\n */"} {"signature":"fun `test sample 3 - with dependencies` ( )","body":"{ fun InlineSourceBuilder . ModuleBuilder . commonDependencies ( ) { source ( \"\"\"\"\"\" . trimIndent ( ) , \"\" ) } fun InlineSourceBuilder . ModuleBuilder . targetDependencies ( ) { dependency { commonDependencies ( ) } source ( \"\"\"\"\"\" . trimIndent ( ) , \"\" ) } val root = createCirTreeRoot { dependency { commonDependencies ( ) } dependency { targetDependencies ( ) } source ( \"\"\"\"\"\" . trimIndent ( ) ) } val classifiers = CirKnownClassifiers ( classifierIndices = TargetDependent ( target to CirClassifierIndex ( root ) ) , commonDependencies = createCirProvidedClassifiers { commonDependencies ( ) } , targetDependencies = TargetDependent ( target to createCirProvidedClassifiers { targetDependencies ( ) } ) , commonizedNodes = CirCommonizedClassifierNodes . default ( ) ) val idOfX = CirEntityId . create ( \"\" ) val idOfY = CirEntityId . create ( \"\" ) val idOfZ = CirEntityId . create ( \"\" ) val idOfA = CirEntityId . create ( \"\" ) val idOfB = CirEntityId . create ( \"\" ) val idOfC = CirEntityId . create ( \"\" ) val idOfD = CirEntityId . create ( \"\" ) val idOfE = CirEntityId . create ( \"\" ) val typeX = mockClassType ( \"\" ) val typeY = mockClassType ( \"\" ) val typeZ = mockClassType ( \"\" ) val typeA = mockTAType ( \"\" ) { typeX } val typeB = mockTAType ( \"\" ) { typeY } val typeC = mockTAType ( \"\" ) { typeA } val typeD = mockTAType ( \"\" ) { typeC } val typeE = mockTAType ( \"\" ) { typeZ } assertEquals ( CirTypeDistance ( ) , typeDistance ( classifiers , target , typeA , idOfX ) ) assertEquals ( CirTypeDistance ( - ) , typeDistance ( classifiers , target , typeX , idOfA ) ) assertEquals ( CirTypeDistance ( ) , typeDistance ( classifiers , target , typeB , idOfY ) ) assertEquals ( CirTypeDistance ( - ) , typeDistance ( classifiers , target , typeY , idOfB ) ) assertEquals ( CirTypeDistance ( ) , typeDistance ( classifiers , target , typeC , idOfX ) ) assertEquals ( CirTypeDistance ( - ) , typeDistance ( classifiers , target , typeX , idOfC ) ) assertEquals ( CirTypeDistance ( ) , typeDistance ( classifiers , target , typeD , idOfX ) ) assertEquals ( CirTypeDistance ( - ) , typeDistance ( classifiers , target , typeX , idOfD ) ) assertEquals ( CirTypeDistance ( ) , typeDistance ( classifiers , target , typeD , idOfA ) ) assertEquals ( CirTypeDistance ( - ) , typeDistance ( classifiers , target , typeA , idOfD ) ) assertEquals ( CirTypeDistance ( ) , typeDistance ( classifiers , target , typeE , idOfZ ) ) assertEquals ( CirTypeDistance ( - ) , typeDistance ( classifiers , target , typeZ , idOfE ) ) }","docstring":"/**\n * Type Alias Chains:\n * E -> Z\n * B -> Y\n * D -> C -> A -> X\n */"} {"signature":"fun assertVersion ( message : String = \"\" , condition : ( Int ) -> Boolean , )","body":"fun assertVersion ( message : String = \"\" , condition : ( Int ) -> Boolean , )","docstring":"/**\n * Does nothing if [condition] returns true for current JRE version, throws [AssertionError] otherwise\n *\n * @param message Exception message\n * @param condition Condition to check\n */"} {"signature":"fun assertVersionAtLeast ( minVersion : Int )","body":"fun assertVersionAtLeast ( minVersion : Int )","docstring":"/**\n * Does nothing if current JRE version is higher or equal than [minVersion], throws [AssertionError] otherwise\n *\n * @param minVersion Minimal accepted version\n */"} {"signature":"fun assertVersionInRange ( minVersion : Int , maxVersion : Int , )","body":"fun assertVersionInRange ( minVersion : Int , maxVersion : Int , )","docstring":"/**\n * Does nothing if current JRE version is between [minVersion] and [maxVersion], throws [AssertionError] otherwise\n *\n * @param minVersion Minimal accepted version\n * @param maxVersion Maximal accepted version\n */"} {"signature":"fun use ( jdkHomeLocation : File , jdkVersion : JavaVersion )","body":"fun use ( jdkHomeLocation : File , jdkVersion : JavaVersion )","docstring":"/**\n * Configures the JVM toolchain to use the JDK located under the [jdkHomeLocation] absolute path.\n * The major JDK version from [javaVersion] is used as a task input so that Gradle avoids using task outputs\n * in the [build cache](https://docs.gradle.org/current/userguide/build_cache.html) that use different JDK versions.\n *\n * **Note**: The project build fails if the JRE version instead of the JDK version is provided.\n *\n * @param jdkHomeLocation The path to the JDK location on the machine\n * @param jdkVersion The JDK version located in the configured [jdkHomeLocation] path\n */"} {"signature":"fun use ( jdkHomeLocation : String , jdkVersion : Any )","body":"= use ( File ( jdkHomeLocation ) , JavaVersion . toVersion ( jdkVersion ) )","docstring":"/**\n * Configures the JVM toolchain to use the JDK located under the [jdkHomeLocation] absolute path.\n * The major JDK version from [javaVersion] is used as a task input so that Gradle avoids using task outputs\n * in the [build cache](https://docs.gradle.org/current/userguide/build_cache.html) that use different JDK versions.\n *\n * **Note**: The project build fails if the JRE version instead of the JDK version is provided.\n *\n * @param jdkHomeLocation The path to the JDK location on the machine\n * @param jdkVersion JDK version located in the configured [jdkHomeLocation] path.\n * Accepts any type that is accepted by [JavaVersion.toVersion].\n * @throws IllegalArgumentException if the given [jdkVersion] value cannot be converted\n */"} {"signature":"fun use ( javaLauncher : Provider < JavaLauncher > )","body":"fun use ( javaLauncher : Provider < JavaLauncher > )","docstring":"/**\n * Configures the JVM toolchain for a task using the [JavaLauncher] obtained from [org.gradle.jvm.toolchain.JavaToolchainService] via\n * the [org.gradle.api.plugins.JavaPluginExtension] extension.\n */"} {"signature":"private fun collectReturnExpressions ( ) : ReturnedExpressionsInfo","body":"{ val instructions = pseudocode . instructions . toHashSet ( ) val exitInstruction = pseudocode . exitInstruction val returnedExpressions = arrayListOf < KtElement > ( ) var hasReturnsInInlinedLambda = false for ( previousInstruction in exitInstruction . previousInstructions ) { previousInstruction . accept ( object : InstructionVisitor ( ) { override fun visitReturnValue ( instruction : ReturnValueInstruction ) { if ( instructions . contains ( instruction ) ) { returnedExpressions . add ( instruction . element ) } if ( instruction . owner . isInlined ) { hasReturnsInInlinedLambda = true } } override fun visitReturnNoValue ( instruction : ReturnNoValueInstruction ) { if ( instructions . contains ( instruction ) ) { returnedExpressions . add ( instruction . element ) } if ( instruction . owner . isInlined ) { hasReturnsInInlinedLambda = true } } override fun visitUnconditionalJump ( instruction : UnconditionalJumpInstruction ) { redirectToPrevInstructions ( instruction ) } override fun visitConditionalJump ( instruction : ConditionalJumpInstruction ) { redirectToPrevInstructions ( instruction ) } private fun redirectToPrevInstructions ( instruction : Instruction ) { for ( redirectInstruction in instruction . previousInstructions ) { redirectInstruction . accept ( this ) } } override fun visitNondeterministicJump ( instruction : NondeterministicJumpInstruction ) { redirectToPrevInstructions ( instruction ) } override fun visitMarkInstruction ( instruction : MarkInstruction ) { redirectToPrevInstructions ( instruction ) } override fun visitInstruction ( instruction : Instruction ) { if ( instruction is KtElementInstruction ) { returnedExpressions . add ( instruction . element ) } else { throw IllegalStateException ( \"\" ) } } } ) } return ReturnedExpressionsInfo ( returnedExpressions , hasReturnsInInlinedLambda ) }","docstring":"/**\n * Collects returned expressions from current pseudocode.\n *\n * \"Returned expression\" here == \"last expression\" in *control-flow terms*. Intuitively,\n * it considers all execution paths, takes last expression on each path and returns them.\n *\n * More specifically, this function starts from EXIT instruction, and performs DFS-search\n * on reversed control-flow edges in a following manner:\n * - if the current instruction is a Return-instruction, then add it's expression to result\n * - if the current instruction is a Element-instruction, then add it's element to result\n * - if the current instruction is a Jump-instruction, then process it's predecessors\n * recursively\n *\n * NB. The second case (Element-instruction) means that notion of \"returned expression\"\n * here differs from what the language treats as \"returned expression\" (notably in the\n * presence of Unit-coercion). Example:\n *\n * fun foo() {\n * val x = 42\n * x.inc() // This call will be in a [returnedExpressions], even though this expression\n * // isn't actually returned\n * }\n */"} {"signature":"private fun report ( diagnostic : Diagnostic , ctxt : VariableContext )","body":"{ val instruction = ctxt . instruction if ( instruction . copies . isEmpty ( ) ) { trace . report ( diagnostic ) return } val previouslyReported = ctxt . reportedDiagnosticMap previouslyReported [ instruction ] = diagnostic . factory var alreadyReported = false var sameErrorForAllCopies = true for ( copy in instruction . copies ) { val previouslyReportedErrorFactory = previouslyReported [ copy ] if ( previouslyReportedErrorFactory != null ) { alreadyReported = true } if ( previouslyReportedErrorFactory !== diagnostic . factory ) { sameErrorForAllCopies = false } } if ( mustBeReportedOnAllCopies ( diagnostic . factory ) ) { if ( sameErrorForAllCopies ) { trace . report ( diagnostic ) } } else { if ( ! alreadyReported ) { trace . report ( diagnostic ) } } }","docstring":"/**\n * The method provides reporting of the same diagnostic only once for copied instructions\n * (depends on whether it should be reported for all or only for one of the copies)\n */"} {"signature":"@ OptIn ( SymbolInternals :: class ) fun FirPropertySymbol . requiresInitialization ( isForInitialization : Boolean ) : Boolean","body":"{ val hasImplicitBackingField = ! hasExplicitBackingField && hasBackingField return when { this is FirSyntheticPropertySymbol -> false isForInitialization -> hasDelegate || hasImplicitBackingField else -> ! hasInitializer && hasImplicitBackingField && fir . isCatchParameter != true } }","docstring":"/**\n * [isForInitialization] means that caller is interested in member property in the scope\n * of file or class initialization section. In this case the fact that property has\n * initializer does not mean that it's safe to access this property in any place:\n *\n * ```\n * class A {\n * val b = a // a is not initialized here\n * val a = 10\n * val c = a // but initialized here\n * }\n * ```\n */"} {"signature":"private fun ControlFlowGraph . isInline ( until : FirBasedSymbol < * > ? ) : Boolean","body":"{ val declaration = declaration if ( declaration ? . symbol == until ) return true if ( declaration ? . evaluatedInline != true ) return false return enterNode . previousNodes . all { it . owner . isInline ( until ) } }","docstring":"/**\n * Checks that [ControlFlowGraph.declaration] is [evaluatedInline], and also recursively check all\n * parent [ControlFlowGraph]s.\n *\n * @param until will stop recursion if [ControlFlowGraph.declaration] matches the specified symbol.\n * This is used to stop recursion when there are nested declarations (like a local class), and we\n * only need to check until that nested declaration.\n */"} {"signature":"public abstract fun doesPackageExist ( packageFqName : FqName , platform : TargetPlatform ) : Boolean","body":"public abstract fun doesPackageExist ( packageFqName : FqName , platform : TargetPlatform ) : Boolean","docstring":"/**\n * Checks if a package with given [FqName] exists in current [GlobalSearchScope] with a view from a given [platform].\n *\n * This includes Kotlin packages as well as platform-specific (i.e., JVM packages) that match the [platform].\n * Generally, the result is equal to [doesKotlinOnlyPackageExist] || [doesPlatformSpecificPackageExist].\n */"} {"signature":"public abstract fun doesKotlinOnlyPackageExist ( packageFqName : FqName ) : Boolean","body":"public abstract fun doesKotlinOnlyPackageExist ( packageFqName : FqName ) : Boolean","docstring":"/**\n * Checks if a package with a given [FqName] exists in the current [GlobalSearchScope].\n *\n * The package should contain Kotlin declarations inside.\n *\n * Note that for Kotlin, a package doesn't need to correspond to a directory structure like in Java.\n * So, a package [FqName] is determined by a Kotlin file package directive.\n */"} {"signature":"public abstract fun doesPlatformSpecificPackageExist ( packageFqName : FqName , platform : TargetPlatform ) : Boolean","body":"public abstract fun doesPlatformSpecificPackageExist ( packageFqName : FqName , platform : TargetPlatform ) : Boolean","docstring":"/**\n * Checks if a platform-specific (e.g., Java packages for Kotlin/JVM) package with [FqName] exists in the current [GlobalSearchScope].\n */"} {"signature":"public abstract fun getSubPackageFqNames ( packageFqName : FqName , platform : TargetPlatform , nameFilter : ( Name ) -> Boolean ) : Set < Name >","body":"public abstract fun getSubPackageFqNames ( packageFqName : FqName , platform : TargetPlatform , nameFilter : ( Name ) -> Boolean ) : Set < Name >","docstring":"/**\n * Returns the list of subpackages for a given package, which satisfies [nameFilter].\n *\n * The returned sub-package list contains sub-packages visible to Kotlin. (e.g., for Kotlin/JVM, it should include Java packages)\n *\n * Generally, the result is equal to [getKotlinOnlySubPackagesFqNames] union with [getPlatformSpecificSubPackagesFqNames]\n */"} {"signature":"public abstract fun getKotlinOnlySubPackagesFqNames ( packageFqName : FqName , nameFilter : ( Name ) -> Boolean ) : Set < Name >","body":"public abstract fun getKotlinOnlySubPackagesFqNames ( packageFqName : FqName , nameFilter : ( Name ) -> Boolean ) : Set < Name >","docstring":"/**\n * Returns the list of subpackages for a given package, which satisfies [nameFilter].\n *\n * The returned sub-package list contains all packages with some Kotlin declarations inside.\n */"} {"signature":"public abstract fun getPlatformSpecificSubPackagesFqNames ( packageFqName : FqName , platform : TargetPlatform , nameFilter : ( Name ) -> Boolean ) : Set < Name >","body":"public abstract fun getPlatformSpecificSubPackagesFqNames ( packageFqName : FqName , platform : TargetPlatform , nameFilter : ( Name ) -> Boolean ) : Set < Name >","docstring":"/**\n * Returns the platform-specific (e.g., Java packages for Kotlin/JVM) list of subpackages for a given package, which satisfies [nameFilter].\n *\n * The returned sub-package list contains sub-packages visible to Kotlin. (e.g., for Kotlin/JVM, it should include Java packages)\n */"} {"signature":"protected open fun backendSpecificFileFilter ( file : IrFile ) : Boolean","body":"= true","docstring":"/**\n * Allows to skip [file] during serialization.\n *\n * For example, some files should be generated anew instead of deserialization.\n */"} {"signature":"public inline fun < reified T > body ( ) : T","body":"= runBlocking { ktorResponse . body ( ) }","docstring":"/**\n * Tries to receive the payload of the response as a specific type [T].\n *\n * @throws NoTransformationFoundException If no transformation is found for the type [T].\n * @throws DoubleReceiveException If already called [body].\n */"} {"signature":"public fun < T > body ( typeInfo : TypeInfo ) : T","body":"= runBlocking { ktorResponse . body ( typeInfo ) }","docstring":"/**\n * Tries to receive the payload of the response as a specific type [T] described in [typeInfo].\n *\n * @throws NoTransformationFoundException If no transformation is found for the type info [typeInfo].\n * @throws DoubleReceiveException If already called [body].\n */"} {"signature":"public fun bodyAsText ( fallbackCharset : Charset = Charsets . UTF_8 ) : String","body":"= runBlocking { ktorResponse . bodyAsText ( fallbackCharset ) }","docstring":"/**\n * Reads the [HttpResponse.content] as a String. You can pass an optional [fallbackCharset]\n * to specify a charset in the case no one is specified as part of the `Content-Type` response.\n * If no charset specified either as parameter or as part of the response,\n * [io.ktor.client.plugins.HttpPlainText] settings will be used.\n *\n * Note that [fallbackCharset] parameter will be ignored if the response already has a charset.\n * So it just acts as a fallback, honoring the server preference.\n */"} {"signature":"public fun readBytes ( ) : ByteArray","body":"= runBlocking { ktorResponse . readBytes ( ) }","docstring":"/**\n * Reads the whole [HttpResponse.content] if `Content-Length` is specified.\n * Otherwise, it just reads one byte.\n */"} {"signature":"public fun readBytes ( count : Int ) : ByteArray","body":"= runBlocking { ktorResponse . readBytes ( count ) }","docstring":"/**\n * Reads exactly [count] bytes of the [HttpResponse.content].\n */"} {"signature":"fun renderValue ( host : ExecutionHost , value : Any ? , ) : Any ?","body":"fun renderValue ( host : ExecutionHost , value : Any ? , ) : Any ?","docstring":"/**\n * Renders [value] in context of this execution [host]\n */"} {"signature":"fun registerWithoutOptimizing ( renderer : RendererFieldHandler )","body":"fun registerWithoutOptimizing ( renderer : RendererFieldHandler )","docstring":"/**\n * Adds new [renderer] for this notebook.\n * Don't turn on the optimizations for [PrecompiledRendererTypeHandler]\n */"} {"signature":"internal fun CallableMemberDescriptor . mustNotBeWrittenToDecompiledText ( ) : Boolean","body":"{ return when ( kind ) { CallableMemberDescriptor . Kind . DECLARATION , CallableMemberDescriptor . Kind . DELEGATION -> false CallableMemberDescriptor . Kind . FAKE_OVERRIDE -> true CallableMemberDescriptor . Kind . SYNTHESIZED -> syntheticMemberMustNotBeWrittenToDecompiledText ( ) } }","docstring":"/**\n * @see org.jetbrains.kotlin.analysis.decompiler.stub.mustNotBeWrittenToStubs\n */"} {"signature":"public fun < DomainType : Comparable < DomainType > > continuousColorViridis ( colormap : ViridisColormap = ViridisColormap . VIRIDIS , hueRange : ClosedRange < Double > = .. , direction : WheelDirection = WheelDirection . CLOCKWISE , domain : ClosedRange < DomainType > , nullValue : Color ? = null , transform : Transformation ? = null ) : ScaleContinuousColorViridis < DomainType >","body":"= ScaleContinuousColorViridis ( domain . let { listOf ( it . start , it . endInclusive ) } , colormap , hueRange , direction , nullValue , transform )","docstring":"/**\n * Creates color scale with viridis color maps, designed to be perceptually-uniform,\n * both in regular form and also when converted to black-and-white.\n *\n * @param colormap [ViridisColormap] colormap\n * @param DomainType scale domain type.\n * @param hueRange [ClosedRange] of color hue, in [0, 1]\n * @param direction colormap direction\n * @param domain [ClosedRange] defining the scale domain.\n * @param nullValue value which null is mapped to.\n * @param transform the transformation of scale.\n *\n * @return new continuous color scale.\n */"} {"signature":"public fun < DomainType > continuousColorViridis ( colormap : ViridisColormap = ViridisColormap . VIRIDIS , hueRange : ClosedRange < Double > = .. , direction : WheelDirection = WheelDirection . CLOCKWISE , domainMin : DomainType ? = null , domainMax : DomainType ? = null , nullValue : Color ? = null , transform : Transformation ? = null ) : ScaleContinuousColorViridis < DomainType >","body":"= ScaleContinuousColorViridis ( listOf ( domainMin , domainMax ) , colormap , hueRange , direction , nullValue , transform )","docstring":"/**\n * Color scale with viridis color maps, designed to be perceptually-uniform,\n * both in regular form and also when converted to black-and-white.\n *\n * @param colormap [ViridisColormap] colormap\n * @param DomainType scale domain type.\n * @param hueRange [ClosedRange] of color hue, in [0, 1]\n * @param direction colormap direction\n * @param domainMin scale domain minimum.\n * @param domainMax scale domain maximum.\n * @param nullValue value which null is mapped to.\n * @param transform scale transformation.\n *\n * @return new continuous color scale.\n */"} {"signature":"public fun < DomainType > categoricalColorViridis ( colormap : ViridisColormap = ViridisColormap . VIRIDIS , hueRange : ClosedRange < Double > = .. , direction : WheelDirection = WheelDirection . CLOCKWISE , domain : List < DomainType > ? = null , ) : ScaleCategoricalColorViridis < DomainType >","body":"= ScaleCategoricalColorViridis ( domain , colormap , hueRange , direction )","docstring":"/**\n * Color scale with viridis color maps, designed to be perceptually-uniform,\n * both in regular form and also when converted to black-and-white.\n *\n * @param colormap [ViridisColormap] colormap\n * @param DomainType scale domain type.\n * @param hueRange [ClosedRange] of color hue, in [0, 1]\n * @param direction colormap direction @param DomainType scale domain type.\n * @param domain [List] defining the scale domain.\n *\n * @return new categorical color scale.\n */"} {"signature":"fun captureFromTypeParameterUpperBoundIfNeeded ( argumentType : UnwrappedType , expectedType : UnwrappedType ) : UnwrappedType","body":"{ val expectedTypeConstructor = expectedType . upperIfFlexible ( ) . constructor if ( argumentType . lowerIfFlexible ( ) . constructor . declarationDescriptor is TypeParameterDescriptor ) { val chosenSupertype = argumentType . lowerIfFlexible ( ) . supertypes ( ) . singleOrNull { it . constructor . declarationDescriptor is ClassifierDescriptorWithTypeParameters && it . unwrap ( ) . hasSupertypeWithGivenTypeConstructor ( expectedTypeConstructor ) } if ( chosenSupertype != null ) { val capturedType = captureFromExpression ( chosenSupertype . unwrap ( ) ) return if ( capturedType != null && argumentType . isDefinitelyNotNullType ) capturedType . makeDefinitelyNotNullOrNotNull ( ) else capturedType ? : argumentType } } return argumentType }","docstring":"/**\n * interface Inv\n * fun bar(l: Inv): Y = ...\n *\n * fun > foo(x: X) {\n * val xr = bar(x)\n * }\n * Here we try to capture from upper bound from type parameter.\n * We replace type of `x` to `Inv`(we chose supertype which contains supertype with expectedTypeConstructor) and capture from this type.\n * It is correct, because it is like this code:\n * fun > foo(x: X) {\n * val inv: Inv = x\n * val xr = bar(inv)\n * }\n *\n */"} {"signature":"private fun Project . appleFrameworkDir ( frameworkTaskName : String ) : Provider < File >","body":"{ return if ( project . kotlinPropertiesProvider . appleCopyFrameworkToBuiltProductsDir ) { project . provider { XcodeEnvironment . builtProductsDir ? : fireEnvException ( frameworkTaskName ) } } else { layout . buildDirectory . dir ( \"\" ) . map { it . asFile . resolve ( XcodeEnvironment . frameworkSearchDir ? : fireEnvException ( frameworkTaskName ) ) } } }","docstring":"/**\n * [XcodeEnvironment.builtProductsDir] if not disabled.\n *\n * Or if [XcodeEnvironment.frameworkSearchDir] is absolute use it, otherwise make it relative to buildDir/xcode-frameworks\n */"} {"signature":"@ ExperimentalSerializationApi public fun generateSchemaText ( rootDescriptor : SerialDescriptor , packageName : String ? = null , options : Map < String , String > = emptyMap ( ) ) : String","body":"= generateSchemaText ( listOf ( rootDescriptor ) , packageName , options )","docstring":"/**\n * Generate text of protocol buffers schema version 2 for the given [rootDescriptor].\n * The resulting schema will contain all types referred by [rootDescriptor].\n *\n * [packageName] define common protobuf package for all messages and enum in the schema, it may contain `'a'`..`'z'`\n * letters in upper and lower case, decimal digits, `'.'` or `'_'` chars, but must be started only by a letter and\n * not finished by a dot.\n *\n * [options] define values for protobuf options. Option value (map value) is an any string, option name (map key)\n * should be the same format as [packageName].\n *\n * The method throws [IllegalArgumentException] if any of the restrictions imposed by [ProtoBufSchemaGenerator] is violated.\n */"} {"signature":"@ ExperimentalSerializationApi public fun generateSchemaText ( descriptors : List < SerialDescriptor > , packageName : String ? = null , options : Map < String , String > = emptyMap ( ) ) : String","body":"{ packageName ? . let { p -> p . checkIsValidFullIdentifier { \"\" } } checkDoubles ( descriptors ) val builder = StringBuilder ( ) builder . generateProto2SchemaText ( descriptors , packageName , options ) return builder . toString ( ) }","docstring":"/**\n * Generate text of protocol buffers schema version 2 for the given serializable [descriptors].\n * [packageName] define common protobuf package for all messages and enum in the schema, it may contain `'a'`..`'z'`\n * letters in upper and lower case, decimal digits, `'.'` or `'_'` chars, but started only from a letter and\n * not finished by dot.\n *\n * [options] define values for protobuf options. Option value (map value) is an any string, option name (map key)\n * should be the same format as [packageName].\n *\n * The method throws [IllegalArgumentException] if any of the restrictions imposed by [ProtoBufSchemaGenerator] is violated.\n */"} {"signature":"fun dirtySetTouchesNonLeafFragments ( dirtySet : Iterable < File > ) : Boolean","body":"{ return dirtySet . any { file -> ! leafFragments . contains ( fileToFragment [ file . absolutePath ] ) } }","docstring":"/**\n * Returns true, if any file from dirtySet is a part of refined fragment (for example: common, apple, linux).\n * It is relevant to KT-62686, because in k2 \"refined\" fragments aren't supposed to see symbols from \"refining\" fragments,\n * but they do.\n *\n * Use of `absolutePath` is coordinated with K2MultiplatformStructure.fragmentSourcesCompilerArgs\n */"} {"signature":"fun main ( )","body":"{ val ( _ , test ) = fashionMnist ( ) val jsonConfigFile = getJSONConfigFileToyResNet ( ) val model = Functional . loadModelConfiguration ( jsonConfigFile ) model . use { it . compile ( optimizer = Adam ( ) , loss = Losses . SOFT_MAX_CROSS_ENTROPY_WITH_LOGITS , metric = Metrics . ACCURACY ) it . logSummary ( ) val hdfFile = getWeightsFileToyResNet ( ) it . loadWeights ( hdfFile ) println ( it . kGraph ) val accuracy = it . evaluate ( dataset = test , batchSize = ) . metrics [ Metrics . ACCURACY ] println ( \"\" ) } }","docstring":"/** Just loading ToyResNet trained in Keras. */"} {"signature":"internal fun getKotlinJvmStdlibJarPath ( ) : String","body":"{ return lazyKotlinJvmStdlibJar }","docstring":"/**\n * Returns an absolute path to the JAR file of Kotlin's standard library for the JVM platform.\n *\n * Example: `~/.gradle/caches/modules-2/files-2.1/org.jetbrains.kotlin/kotlin-stdlib/1.9.10/xx/kotlin-stdlib-1.9.10.jar`\n */"} {"signature":"override fun isAccessorWithExplicitImplementation ( accessor : IrSimpleFunction ) : Boolean","body":"{ if ( accessor is AbstractFir2IrLazyDeclaration < * > ) { val fir = accessor . fir if ( fir is FirFunction && fir . hasBody ) { return true } } return false }","docstring":"/**\n * This method is used from [org.jetbrains.kotlin.backend.jvm.lower.ReflectiveAccessLowering.visitCall]\n * (via generateReflectiveAccessForGetter) and it is called for the private access member lowered to the getter/setter call.\n * If a private property has no getter/setter (the typical situation for simple private properties without explicitly defined\n * getter/setter) then this method is not used at all. Instead\n * [org.jetbrains.kotlin.backend.jvm.lower.ReflectiveAccessLowering.visitGetField] (or visitSetField) generates the access without\n * asking.\n */"} {"signature":"private fun ConeTypeProjection . removeOutProjection ( isCovariant : Boolean ) : ConeTypeProjection","body":"{ return when ( this ) { is ConeKotlinTypeProjectionOut -> if ( isCovariant ) type else this is ConeKotlinTypeProjectionIn -> ConeKotlinTypeProjectionIn ( type . removeOutProjection ( ! isCovariant ) ) is ConeStarProjection -> if ( isCovariant ) StandardTypes . NullableAny else this is ConeKotlinTypeConflictingProjection , is ConeKotlinType -> this } }","docstring":"/**\n * @param isCovariant true if the current context is covariant and false if contravariant.\n *\n * This function only remove out projections in covariant context.\n * 'in' projections are never removed, nor would an out projection in a contravariant context.\n */"} {"signature":"@ Suppress ( \"\" ) public operator fun < T , D : Dimension > MultiArray < T , D > . unaryMinus ( ) : NDArray < T , D >","body":"= when ( dtype ) { DataType . DoubleDataType -> ( this as NDArray < Double , D > ) . map { - it } DataType . FloatDataType -> ( this as NDArray < Float , D > ) . map { - it } DataType . IntDataType -> ( this as NDArray < Int , D > ) . map { - it } DataType . LongDataType -> ( this as NDArray < Long , D > ) . map { - it } DataType . ComplexFloatDataType -> ( this as NDArray < ComplexFloat , D > ) . map { - it } DataType . ComplexDoubleDataType -> ( this as NDArray < ComplexDouble , D > ) . map { - it } DataType . ShortDataType -> ( this as NDArray < Short , D > ) . map { - it } DataType . ByteDataType -> ( this as NDArray < Byte , D > ) . map { - it } } as NDArray < T , D >","docstring":"/**\n * Returns a new NDArray object with all elements negated for the given MultiArray object.\n *\n * @return The NDArray object with all elements negated.\n */"} {"signature":"public operator fun < T , D : Dimension > MultiArray < T , D > . plus ( other : MultiArray < T , D > ) : NDArray < T , D >","body":"{ requireEqualShape ( this . shape , other . shape ) val ret = if ( this . consistent ) ( this as NDArray ) . copy ( ) else ( this as NDArray ) . deepCopy ( ) ret += other return ret }","docstring":"/**\n * Calculates the sum of [this] MultiArray and [other] MultiArray, resulting in a new NDArray with the same\n * Dimension type as the input arrays.\n *\n * @param other MultiArray to be added to [this] MultiArray\n * @return NDArray, the sum of [this] MultiArray and [other] MultiArray\n * @throws IllegalArgumentException if the shape of [this] and [other] [MultiArray] are not equal.\n */"} {"signature":"public operator fun < T , D : Dimension > MultiArray < T , D > . plus ( other : T ) : NDArray < T , D >","body":"{ val ret = if ( this . consistent ) ( this as NDArray ) . copy ( ) else ( this as NDArray ) . deepCopy ( ) ret += other return ret }","docstring":"/**\n * Returns a new NDArray with the elements of this MultiArray added with the given element value\n *\n * @param other the element to be added. Must be of the same type as the elements in MultiArray\n * @return a new NDArray object with the same dimensions as this MultiArray but with passed element added to each element\n */"} {"signature":"@ Suppress ( \"\" ) public operator fun < T , D : Dimension > MutableMultiArray < T , D > . plusAssign ( other : MultiArray < T , D > )","body":"{ requireEqualShape ( this . shape , other . shape ) if ( this . consistent && other . consistent ) { this . data += ( other . data as MemoryView ) } else { when ( dtype ) { DataType . DoubleDataType -> ( this as NDArray < Double , D > ) . commonAssignOp ( other . iterator ( ) as Iterator < Double > ) { a , b -> a + b } DataType . FloatDataType -> ( this as NDArray < Float , D > ) . commonAssignOp ( other . iterator ( ) as Iterator < Float > ) { a , b -> a + b } DataType . IntDataType -> ( this as NDArray < Int , D > ) . commonAssignOp ( other . iterator ( ) as Iterator < Int > ) { a , b -> a + b } DataType . LongDataType -> ( this as NDArray < Long , D > ) . commonAssignOp ( other . iterator ( ) as Iterator < Long > ) { a , b -> a + b } DataType . ComplexFloatDataType -> ( this as NDArray < ComplexFloat , D > ) . commonAssignOp ( other . iterator ( ) as Iterator < ComplexFloat > ) { a , b -> a + b } DataType . ComplexDoubleDataType -> ( this as NDArray < ComplexDouble , D > ) . commonAssignOp ( other . iterator ( ) as Iterator < ComplexDouble > ) { a , b -> a + b } DataType . ShortDataType -> ( this as NDArray < Short , D > ) . commonAssignOp ( other . iterator ( ) as Iterator < Short > ) { a , b -> ( a + b ) . toShort ( ) } DataType . ByteDataType -> ( this as NDArray < Byte , D > ) . commonAssignOp ( other . iterator ( ) as Iterator < Byte > ) { a , b -> ( a + b ) . toByte ( ) } } } }","docstring":"/**\n * Adds the elements of [other] to [this] MultiArray instance and returns this instance.\n * This is an in-place operation.\n *\n * @param other the MultiArray instance to add\n * @throws IllegalArgumentException if the shapes of both arrays are not equal\n */"} {"signature":"@ Suppress ( \"\" ) public operator fun < T , D : Dimension > MutableMultiArray < T , D > . plusAssign ( other : T )","body":"{ if ( this . consistent ) { this . data += other } else { when ( other ) { is Double -> ( this as NDArray < Double , D > ) . commonAssignOp ( other ) { a , b -> a + b } is Float -> ( this as NDArray < Float , D > ) . commonAssignOp ( other ) { a , b -> a + b } is Int -> ( this as NDArray < Int , D > ) . commonAssignOp ( other ) { a , b -> a + b } is Long -> ( this as NDArray < Long , D > ) . commonAssignOp ( other ) { a , b -> a + b } is ComplexFloat -> ( this as NDArray < ComplexFloat , D > ) . commonAssignOp ( other ) { a , b -> a + b } is ComplexDouble -> ( this as NDArray < ComplexDouble , D > ) . commonAssignOp ( other ) { a , b -> a + b } is Short -> ( this as NDArray < Short , D > ) . commonAssignOp ( other ) { a , b -> ( a + b ) . toShort ( ) } is Byte -> ( this as NDArray < Byte , D > ) . commonAssignOp ( other ) { a , b -> ( a + b ) . toByte ( ) } } } }","docstring":"/**\n * Adds an element [other] element-wise to the current [MutableMultiArray], modifying it in-place.\n *\n * @param other The element to be added to the [MutableMultiArray].\n * @throws ClassCastException If [other] is not one of the following types: Double, Float,\n * Int, Long, ComplexFloat, ComplexDouble, Short, or Byte.\n */"} {"signature":"public operator fun < T , D : Dimension > MultiArray < T , D > . minus ( other : MultiArray < T , D > ) : NDArray < T , D >","body":"{ requireEqualShape ( this . shape , other . shape ) val ret = if ( this . consistent ) ( this as NDArray ) . copy ( ) else ( this as NDArray ) . deepCopy ( ) ret -= other return ret }","docstring":"/**\n * Calculates the difference of [this] MultiArray and [other] MultiArray, resulting in a new NDArray with the same\n * Dimension type as the input arrays.\n *\n * @param other MultiArray to be subtracted from [this] [MultiArray].\n * @return Returns a new [NDArray] object which is the difference between [this] and [other] [MultiArray].\n * @throws IllegalArgumentException if the shape of [this] and [other] [MultiArray] are not equal.\n */"} {"signature":"public operator fun < T , D : Dimension > MultiArray < T , D > . minus ( other : T ) : NDArray < T , D >","body":"{ val ret = if ( this . consistent ) ( this as NDArray ) . copy ( ) else ( this as NDArray ) . deepCopy ( ) ret -= other return ret }","docstring":"/**\n * Returns a new NDArray resulting from the subtraction of the given value from all the elements of the MultiArray.\n *\n * @param other the value to subtract from the elements of the MultiArray\n * @return a new NDArray representing the result of the subtraction\n */"} {"signature":"@ Suppress ( \"\" ) public operator fun < T , D : Dimension > MutableMultiArray < T , D > . minusAssign ( other : MultiArray < T , D > )","body":"{ requireEqualShape ( this . shape , other . shape ) if ( this . consistent && other . consistent ) { this . data -= ( other . data as MemoryView ) } else { when ( dtype ) { DataType . DoubleDataType -> ( this as NDArray < Double , D > ) . commonAssignOp ( other . iterator ( ) as Iterator < Double > ) { a , b -> a - b } DataType . FloatDataType -> ( this as NDArray < Float , D > ) . commonAssignOp ( other . iterator ( ) as Iterator < Float > ) { a , b -> a - b } DataType . IntDataType -> ( this as NDArray < Int , D > ) . commonAssignOp ( other . iterator ( ) as Iterator < Int > ) { a , b -> a - b } DataType . LongDataType -> ( this as NDArray < Long , D > ) . commonAssignOp ( other . iterator ( ) as Iterator < Long > ) { a , b -> a - b } DataType . ComplexFloatDataType -> ( this as NDArray < ComplexFloat , D > ) . commonAssignOp ( other . iterator ( ) as Iterator < ComplexFloat > ) { a , b -> a - b } DataType . ComplexDoubleDataType -> ( this as NDArray < ComplexDouble , D > ) . commonAssignOp ( other . iterator ( ) as Iterator < ComplexDouble > ) { a , b -> a - b } DataType . ShortDataType -> ( this as NDArray < Short , D > ) . commonAssignOp ( other . iterator ( ) as Iterator < Short > ) { a , b -> ( a - b ) . toShort ( ) } DataType . ByteDataType -> ( this as NDArray < Byte , D > ) . commonAssignOp ( other . iterator ( ) as Iterator < Byte > ) { a , b -> ( a - b ) . toByte ( ) } } } }","docstring":"/**\n * Subtract [other] from [this] element-wise in place.\n *\n * * If both the arrays have the same shape, this method performs an in-place subtract operation and assigns the\n * * result to this [MutableMultiArray].\n * * Otherwise, it performs element-wise subtraction of this array and [other] array,\n * * and assigns the result to this [MutableMultiArray].\n *\n * @param other The array to subtract from this.\n * @throws IllegalArgumentException If the shapes of [this] and [other] are not equal.\n */"} {"signature":"@ Suppress ( \"\" ) public operator fun < T , D : Dimension > MutableMultiArray < T , D > . minusAssign ( other : T )","body":"{ if ( this . consistent ) { this . data -= other } else { when ( other ) { is Double -> ( this as NDArray < Double , D > ) . commonAssignOp ( other ) { a , b -> a - b } is Float -> ( this as NDArray < Float , D > ) . commonAssignOp ( other ) { a , b -> a - b } is Int -> ( this as NDArray < Int , D > ) . commonAssignOp ( other ) { a , b -> a - b } is Long -> ( this as NDArray < Long , D > ) . commonAssignOp ( other ) { a , b -> a - b } is ComplexFloat -> ( this as NDArray < ComplexFloat , D > ) . commonAssignOp ( other ) { a , b -> a - b } is ComplexDouble -> ( this as NDArray < ComplexDouble , D > ) . commonAssignOp ( other ) { a , b -> a - b } is Short -> ( this as NDArray < Short , D > ) . commonAssignOp ( other ) { a , b -> ( a - b ) . toShort ( ) } is Byte -> ( this as NDArray < Byte , D > ) . commonAssignOp ( other ) { a , b -> ( a - b ) . toByte ( ) } } } }","docstring":"/**\n * Subtract [other] element-wise from the current array. This is an inplace operator.\n *\n * @param other The element to subtract from the current array.\n */"} {"signature":"public operator fun < T , D : Dimension > MultiArray < T , D > . times ( other : MultiArray < T , D > ) : NDArray < T , D >","body":"{ requireEqualShape ( this . shape , other . shape ) val ret = if ( this . consistent ) ( this as NDArray ) . copy ( ) else ( this as NDArray ) . deepCopy ( ) ret *= other return ret }","docstring":"/**\n * Multiplies this [MultiArray] with [other] [MultiArray] element-wise to produce a new [NDArray].\n *\n * @param other the [MultiArray] to be multiplied with [this]\n * @return an [NDArray] formed by the element-wise multiplication of [this] and [other] [MultiArray]\n * @throws IllegalArgumentException in case the shapes of [this] and [other] [MultiArray] do not match.\n */"} {"signature":"public operator fun < T , D : Dimension > MultiArray < T , D > . times ( other : T ) : NDArray < T , D >","body":"{ val ret = if ( this . consistent ) ( this as NDArray ) . copy ( ) else ( this as NDArray ) . deepCopy ( ) ret *= other return ret }","docstring":"/**\n * Performs multiplication operation between MultiArray and scalar value.\n * @param other The scalar value of type T to be multiplied.\n * @return NDArray object of type T and dimension D after performing multiplication operation.\n */"} {"signature":"@ Suppress ( \"\" ) public operator fun < T , D : Dimension > MutableMultiArray < T , D > . timesAssign ( other : MultiArray < T , D > )","body":"{ requireEqualShape ( this . shape , other . shape ) if ( this . consistent && other . consistent ) { this . data *= ( other . data as MemoryView ) } else { when ( dtype ) { DataType . DoubleDataType -> ( this as NDArray < Double , D > ) . commonAssignOp ( other . iterator ( ) as Iterator < Double > ) { a , b -> a * b } DataType . FloatDataType -> ( this as NDArray < Float , D > ) . commonAssignOp ( other . iterator ( ) as Iterator < Float > ) { a , b -> a * b } DataType . IntDataType -> ( this as NDArray < Int , D > ) . commonAssignOp ( other . iterator ( ) as Iterator < Int > ) { a , b -> a * b } DataType . LongDataType -> ( this as NDArray < Long , D > ) . commonAssignOp ( other . iterator ( ) as Iterator < Long > ) { a , b -> a * b } DataType . ComplexFloatDataType -> ( this as NDArray < ComplexFloat , D > ) . commonAssignOp ( other . iterator ( ) as Iterator < ComplexFloat > ) { a , b -> a * b } DataType . ComplexDoubleDataType -> ( this as NDArray < ComplexDouble , D > ) . commonAssignOp ( other . iterator ( ) as Iterator < ComplexDouble > ) { a , b -> a * b } DataType . ShortDataType -> ( this as NDArray < Short , D > ) . commonAssignOp ( other . iterator ( ) as Iterator < Short > ) { a , b -> ( a * b ) . toShort ( ) } DataType . ByteDataType -> ( this as NDArray < Byte , D > ) . commonAssignOp ( other . iterator ( ) as Iterator < Byte > ) { a , b -> ( a * b ) . toByte ( ) } } } }","docstring":"/**\n * Multiplies this [MutableMultiArray] by the [other] [MultiArray] element-wise in place.\n *\n * If both the arrays have the same shape, this method performs an in-place multiplication operation and assigns the\n * result to this [MutableMultiArray].\n * Otherwise, it performs element-wise multiplication of this array and [other] array,\n * and assigns the result to this [MutableMultiArray].\n *\n * @param other the [MultiArray] to be multiplied element-wise with this [MutableMultiArray]\n * @throws IllegalArgumentException if both arrays do not have the same shape.\n */"} {"signature":"@ Suppress ( \"\" ) public operator fun < T , D : Dimension > MutableMultiArray < T , D > . timesAssign ( other : T )","body":"{ if ( this . consistent ) { this . data *= other } else { when ( other ) { is Double -> ( this as NDArray < Double , D > ) . commonAssignOp ( other ) { a , b -> a * b } is Float -> ( this as NDArray < Float , D > ) . commonAssignOp ( other ) { a , b -> a * b } is Int -> ( this as NDArray < Int , D > ) . commonAssignOp ( other ) { a , b -> a * b } is Long -> ( this as NDArray < Long , D > ) . commonAssignOp ( other ) { a , b -> a * b } is ComplexFloat -> ( this as NDArray < ComplexFloat , D > ) . commonAssignOp ( other ) { a , b -> a * b } is ComplexDouble -> ( this as NDArray < ComplexDouble , D > ) . commonAssignOp ( other ) { a , b -> a * b } is Short -> ( this as NDArray < Short , D > ) . commonAssignOp ( other ) { a , b -> ( a * b ) . toShort ( ) } is Byte -> ( this as NDArray < Byte , D > ) . commonAssignOp ( other ) { a , b -> ( a * b ) . toByte ( ) } } } }","docstring":"/**\n * Multiplies the [other] element-wise with the current [MutableMultiArray] and updates the current array in place.\n *\n * @param other the value to be multiplied element-wise with [MutableMultiArray]\n * @throws ClassCastException if [other] is not a compatible data type for the operation\n */"} {"signature":"public operator fun < T , D : Dimension > MultiArray < T , D > . div ( other : MultiArray < T , D > ) : NDArray < T , D >","body":"{ requireEqualShape ( this . shape , other . shape ) val ret = if ( this . consistent ) ( this as NDArray ) . copy ( ) else ( this as NDArray ) . deepCopy ( ) ret /= other return ret }","docstring":"/**\n * Creates a new NDArray as a division of [this] MultiArray object by [other] MultiArray.\n *\n * @param other The MultiArray object to be divided by.\n * @return A new NDArray object containing the result of the division operation.\n * @throws IllegalArgumentException if the shape of [this] and [other] are not equal.\n */"} {"signature":"public operator fun < T , D : Dimension > MultiArray < T , D > . div ( other : T ) : NDArray < T , D >","body":"{ val ret = if ( this . consistent ) ( this as NDArray ) . copy ( ) else ( this as NDArray ) . deepCopy ( ) ret /= other return ret }","docstring":"/**\n * Returns a new NDArray resulting from each element of the MultiArray\n * being divided by the specified `other` element.\n *\n * @param other The element to divide each element of the MultiArray by.\n * @return A new NDArray with the result of the division operation.\n */"} {"signature":"@ Suppress ( \"\" ) public operator fun < T , D : Dimension > MutableMultiArray < T , D > . divAssign ( other : MultiArray < T , D > )","body":"{ requireEqualShape ( this . shape , other . shape ) if ( this . consistent && other . consistent ) { this . data /= ( other . data as MemoryView ) } else { when ( dtype ) { DataType . DoubleDataType -> ( this as NDArray < Double , D > ) . commonAssignOp ( other . iterator ( ) as Iterator < Double > ) { a , b -> a / b } DataType . FloatDataType -> ( this as NDArray < Float , D > ) . commonAssignOp ( other . iterator ( ) as Iterator < Float > ) { a , b -> a / b } DataType . IntDataType -> ( this as NDArray < Int , D > ) . commonAssignOp ( other . iterator ( ) as Iterator < Int > ) { a , b -> a / b } DataType . LongDataType -> ( this as NDArray < Long , D > ) . commonAssignOp ( other . iterator ( ) as Iterator < Long > ) { a , b -> a / b } DataType . ComplexFloatDataType -> ( this as NDArray < ComplexFloat , D > ) . commonAssignOp ( other . iterator ( ) as Iterator < ComplexFloat > ) { a , b -> a / b } DataType . ComplexDoubleDataType -> ( this as NDArray < ComplexDouble , D > ) . commonAssignOp ( other . iterator ( ) as Iterator < ComplexDouble > ) { a , b -> a / b } DataType . ShortDataType -> ( this as NDArray < Short , D > ) . commonAssignOp ( other . iterator ( ) as Iterator < Short > ) { a , b -> ( a / b ) . toShort ( ) } DataType . ByteDataType -> ( this as NDArray < Byte , D > ) . commonAssignOp ( other . iterator ( ) as Iterator < Byte > ) { a , b -> ( a / b ) . toByte ( ) } } } }","docstring":"/**\n * Divide this [MutableMultiArray] by another [MultiArray] element-wise.\n * This method performs the division operation in place, and modifies the original array.\n *\n * If both the arrays have the same shape, this method performs an in-place division operation and assigns the\n * result to this [MutableMultiArray].\n * Otherwise, it performs element-wise division of this array and [other] array,\n * and assigns the result to this [MutableMultiArray].\n *\n * @param other the MultiArray to divide by\n * @throws IllegalArgumentException if [this] and [other] have different shapes\n */"} {"signature":"@ Suppress ( \"\" ) public operator fun < T , D : Dimension > MutableMultiArray < T , D > . divAssign ( other : T )","body":"{ if ( this . consistent ) { this . data /= other } else { when ( other ) { is Double -> ( this as NDArray < Double , D > ) . commonAssignOp ( other ) { a , b -> a / b } is Float -> ( this as NDArray < Float , D > ) . commonAssignOp ( other ) { a , b -> a / b } is Int -> ( this as NDArray < Int , D > ) . commonAssignOp ( other ) { a , b -> a / b } is Long -> ( this as NDArray < Long , D > ) . commonAssignOp ( other ) { a , b -> a / b } is ComplexFloat -> ( this as NDArray < ComplexFloat , D > ) . commonAssignOp ( other ) { a , b -> a / b } is ComplexDouble -> ( this as NDArray < ComplexDouble , D > ) . commonAssignOp ( other ) { a , b -> a / b } is Short -> ( this as NDArray < Short , D > ) . commonAssignOp ( other ) { a , b -> ( a / b ) . toShort ( ) } is Byte -> ( this as NDArray < Byte , D > ) . commonAssignOp ( other ) { a , b -> ( a / b ) . toByte ( ) } } } }","docstring":"/**\n * Divide each element of the multi-dimensional array in place by another element [other].\n *\n * @param other The element to divide by.\n * @throws ArithmeticException if [other] is zero or causes an overflow during the division\n */"} {"signature":"internal inline fun < T : Any , D : Dimension > MutableMultiArray < T , D > . commonAssignOp ( other : Iterator < T > , op : ( T , T ) -> T )","body":"{ if ( this . consistent ) { for ( i in this . indices ) this . data [ i ] = op ( this . data [ i ] , other . next ( ) ) } else { this . multiIndices . forEach { index -> this [ index ] = op ( this [ index ] , other . next ( ) ) } } }","docstring":"/**\n * Performs a common assignment operation on a MutableMultiArray.\n *\n * @param other An iterator of data is the same type as the MutableMultiArray.\n * @param op A lambda function that takes two arguments of type T and returns a value of the same type.\n * This function is used to perform the common assignment operation.\n * @throws NoSuchElementException If the iterator passed as `other` does not contain enough elements.\n */"} {"signature":"@ Suppress ( \"\" ) private inline fun < T : Any , D : Dimension > MutableMultiArray < T , D > . commonAssignOp ( other : T , op : ( T , T ) -> T )","body":"{ if ( dim . d == ) { this as MutableMultiArray < T , D1 > for ( i in this . indices ) this [ i ] = op ( this [ i ] , other ) } else { this . multiIndices . forEach { index -> this [ index ] = op ( this [ index ] , other ) } } }","docstring":"/**\n * Applies the given operator `op` to each element of `this` and `other` and\n * stores the result in `this`.\n *\n * @param other The element to apply the operator to.\n * @param op The operator function to apply.\n * @throws IndexOutOfBoundsException If `this` and `other` are not the same size.\n */"} {"signature":"actual fun getCurrentDate ( ) : String","body":"{ TODO ( \"\" ) }","docstring":"/**\n * MacOS actual implementation for `getCurrentDate`\n */"} {"signature":"@ Suppress ( \"\" ) public fun < C > ColumnSet < C > . simplify ( ) : ColumnSet < C >","body":"= simplifyInternal ( ) as ColumnSet < C >","docstring":"/**\n * ## Simplify [ColumnSet]\n *\n * Given a [this] [ColumnSet], [simplify] simplifies the structure by removing columns that are already present in\n * column groups, returning only these groups plus columns not belonging in any of the groups.\n *\n * In other words, this means that if a column in [this] is inside another column group in [this],\n * it will not be included in the result.\n *\n * ### Check out: [Grammar]\n *\n * ## For example:\n *\n * [cols][ColumnsSelectionDsl.cols]`(a, a.b, d.c).`[simplify][SimplifyColumnsSelectionDsl.simplify]`() == `[cols][ColumnsSelectionDsl.cols]`(a, d.c)`\n * {@include [LineBreak]}\n * `df.`[select][DataFrame.select]` { `[colsAtAnyDepth][ColumnsSelectionDsl.colsAtAnyDepth]` { \"e\" `[in][String.contains]` it.`[name][DataColumn.name]` }.`[simplify][ColumnSet.simplify]`() }`\n *\n * @return A [ColumnSet][ColumnSet]`<`[C][C]`>` containing only the columns that are not inside any column group in [this].\n */"} {"signature":"internal fun ColumnsResolver < * > . simplifyInternal ( ) : ColumnSet < * >","body":"= allColumnsInternal ( ) . transform { it . simplify ( ) }","docstring":"/**\n * Simplifies structure by removing columns that are already present in\n * column groups in [this].\n *\n * A.k.a. it gets a sub-list of columns that are roots of the trees of columns.\n */"} {"signature":"public fun KtElement . collectCallCandidates ( ) : List < KtCallCandidateInfo >","body":"= withValidityAssertion { analysisSession . callResolver . collectCallCandidates ( this ) }","docstring":"/**\n * Returns all the candidates considered during [overload resolution](https://kotlinlang.org/spec/overload-resolution.html) for the call\n * corresponding to this [KtElement].\n *\n * [resolveCall] only returns the final result of overload resolution, i.e., the selected callable after considering candidate\n * applicability and choosing the most specific candidate.\n */"} {"signature":"fun ScriptEvaluationConfiguration ? . with ( body : ScriptEvaluationConfiguration . Builder . ( ) -> Unit ) : ScriptEvaluationConfiguration","body":"{ val newConfiguration = if ( this == null ) ScriptEvaluationConfiguration ( body = body ) else ScriptEvaluationConfiguration ( this , body = body ) return if ( newConfiguration != this ) newConfiguration else this }","docstring":"/**\n * An alternative to the constructor with base configuration, which returns a new configuration only if [body] adds anything\n * to the original one, otherwise returns original\n */"} {"signature":"fun < T > ScriptEvaluationConfiguration . Builder . scriptExecutionWrapper ( wrapper : ( ( ) -> T ) -> T )","body":"{ ScriptEvaluationConfiguration . scriptExecutionWrapper . put ( object : ScriptExecutionWrapper < T > { override fun invoke ( block : ( ) -> T ) : T = wrapper ( block ) } ) }","docstring":"/**\n * A helper to enable passing lambda directly to the scriptExecutionWrapper \"keyword\"\n */"} {"signature":"fun ScriptEvaluationConfiguration . Builder . enableScriptsInstancesSharing ( )","body":"{ this { scriptsInstancesSharing ( true ) } }","docstring":"/**\n * A helper to enable scriptsInstancesSharingMap with default implementation\n */"} {"signature":"fun ScriptEvaluationConfiguration . Builder . refineConfigurationBeforeEvaluate ( handler : RefineScriptEvaluationConfigurationHandler )","body":"{ ScriptEvaluationConfiguration . refineConfigurationBeforeEvaluate . append ( RefineEvaluationConfigurationData ( handler ) ) }","docstring":"/**\n * A helper to enable passing lambda directly to the refinement \"keyword\"\n */"} {"signature":"suspend operator fun invoke ( compiledScript : CompiledScript , scriptEvaluationConfiguration : ScriptEvaluationConfiguration = ScriptEvaluationConfiguration . Default ) : ResultWithDiagnostics < EvaluationResult >","body":"suspend operator fun invoke ( compiledScript : CompiledScript , scriptEvaluationConfiguration : ScriptEvaluationConfiguration = ScriptEvaluationConfiguration . Default ) : ResultWithDiagnostics < EvaluationResult >","docstring":"/**\n * Evaluates [compiledScript] using the data from [scriptEvaluationConfiguration]\n * @param compiledScript the compiled script class\n * @param scriptEvaluationConfiguration evaluation configuration\n */"} {"signature":"public fun KtReference . isImplicitReferenceToCompanion ( ) : Boolean","body":"= withValidityAssertion { analysisSession . referenceResolveProvider . isImplicitReferenceToCompanion ( this ) }","docstring":"/**\n * Checks if the reference is an implicit reference to a companion object via the containing class.\n *\n * Example:\n * ```\n * class A {\n * companion object {\n * fun foo() {}\n * }\n * }\n * ```\n *\n * For the case provided, inside the call `A.foo()`,\n * the `A` is an implicit reference to the companion object, so `isImplicitReferenceToCompanion` returns `true`\n *\n * @return `true` if the reference is an implicit reference to a companion object, `false` otherwise.\n */"} {"signature":"public fun merge ( dumpFile : File , configurableTargetName : String ? = null )","body":"{ if ( ! dumpFile . exists ( ) ) { throw FileNotFoundException ( \"\" ) } require ( dumpFile . isFile ) { \"\" } merger . merge ( dumpFile , configurableTargetName ) }","docstring":"/**\n * Loads a textual KLib dump and merges it into this dump.\n *\n * If a dump contains only a single target, it's possible to specify a custom configurable target name.\n * Please refer to [KlibTarget.configurableName] for more details on the meaning of that name.\n *\n * By default, [configurableTargetName] is null and information about a target will be taken directly from\n * the loaded dump.\n *\n * It's an error to specify non-null [configurableTargetName] for a dump containing multiple targets.\n * It's also an error to merge dumps having some targets in common.\n *\n * @throws IllegalArgumentException if this dump and [dumpFile] shares same targets.\n * @throws IllegalArgumentException if [dumpFile] contains multiple targets\n * and [configurableTargetName] is not null.\n * @throws IllegalArgumentException if [dumpFile] is not a file.\n * @throws FileNotFoundException if [dumpFile] does not exist.\n *\n * @sample samples.KlibDumpSamples.mergeDumps\n */"} {"signature":"public fun merge ( other : KlibDump )","body":"{ val intersection = targets . intersect ( other . targets ) require ( intersection . isEmpty ( ) ) { \"\" } merger . merge ( other . merger ) }","docstring":"/**\n * Merges [other] dump with this one.\n *\n * It's also an error to merge dumps having some targets in common.\n *\n * The operation does not modify [other].\n *\n * @throws IllegalArgumentException if this dump and [other] shares same targets.\n *\n * @sample samples.KlibDumpSamples.mergeDumpObjects\n */"} {"signature":"public fun retain ( targets : Iterable < KlibTarget > )","body":"{ val toRemove = merger . targets . subtract ( targets . toSet ( ) ) remove ( toRemove ) }","docstring":"/**\n * Removes all declarations that do not belong to specified targets and removes these targets from the dump.\n *\n * All targets in the [targets] collection not contained within this dump will be ignored.\n *\n * @sample samples.KlibDumpSamples.extractTargets\n */"} {"signature":"public fun remove ( targets : Iterable < KlibTarget > )","body":"{ targets . forEach { merger . remove ( it ) } }","docstring":"/**\n * Remove all declarations that do belong to specified targets and remove these targets from the dump.\n *\n * All targets in the [targets] collection not contained within this dump will be ignored.\n *\n * @sample samples.KlibDumpSamples.mergeDumpObjects\n */"} {"signature":"public fun copy ( ) : KlibDump","body":"= KlibDump ( ) . also { it . merge ( this ) }","docstring":"/**\n * Creates a copy of this dump.\n */"} {"signature":"public fun saveTo ( to : Appendable )","body":"{ merger . dump ( to ) }","docstring":"/**\n * Serializes the dump and writes it to [to].\n *\n * @sample samples.KlibDumpSamples.mergeDumps\n */"} {"signature":"public fun from ( dumpFile : File , configurableTargetName : String ? = null ) : KlibDump","body":"{ if ( ! dumpFile . exists ( ) ) { throw FileNotFoundException ( \"\" ) } require ( dumpFile . isFile ) { \"\" } return KlibDump ( ) . apply { merge ( dumpFile , configurableTargetName ) } }","docstring":"/**\n * Loads a dump from a textual form.\n *\n * If a dump contains only a single target, it's possible to specify a custom configurable target name.\n * Please refer to [KlibTarget.configurableName] for more details on the meaning of that name.\n *\n * By default, [configurableTargetName] is null and information about a target will be taken directly from\n * the loaded dump.\n *\n * It's an error to specify non-null [configurableTargetName] for a dump containing multiple targets.\n *\n * @throws IllegalArgumentException if [dumpFile] contains multiple targets\n * and [configurableTargetName] is not null.\n * @throws IllegalArgumentException if [dumpFile] is empty.\n * @throws IllegalArgumentException if [dumpFile] is not a file.\n * @throws FileNotFoundException if [dumpFile] does not exist.\n *\n * @sample samples.KlibDumpSamples.mergeDumpObjects\n */"} {"signature":"public fun fromKlib ( klibFile : File , configurableTargetName : String ? = null , filters : KlibDumpFilters = KlibDumpFilters . DEFAULT ) : KlibDump","body":"{ val dump = buildString { dumpTo ( this , klibFile , filters ) } return KlibDump ( ) . apply { merger . merge ( dump . splitToSequence ( '' ) . iterator ( ) , configurableTargetName ) } }","docstring":"/**\n * Dumps a public ABI of a klib represented by [klibFile] using [filters]\n * and returns a [KlibDump] representing it.\n *\n * To control which declarations are dumped, [filters] could be used. By default, no filters will be applied.\n *\n * If a klib contains only a single target, it's possible to specify a custom configurable target name.\n * Please refer to [KlibTarget.configurableName] for more details on the meaning of that name.\n *\n * By default, [configurableTargetName] is null and information about a target will be taken directly from\n * the klib.\n *\n * It's an error to specify non-null [configurableTargetName] for a klib containing multiple targets.\n *\n * @throws IllegalArgumentException if [klibFile] contains multiple targets\n * and [configurableTargetName] is not null.\n * @throws IllegalStateException if a klib could not be loaded from [klibFile].\n * @throws FileNotFoundException if [klibFile] does not exist.\n */"} {"signature":"@ ExperimentalBCVApi public fun inferAbi ( unsupportedTarget : KlibTarget , supportedTargetDumps : Iterable < KlibDump > , oldMergedDump : KlibDump ? = null ) : KlibDump","body":"{ require ( supportedTargetDumps . iterator ( ) . hasNext ( ) || oldMergedDump != null ) { \"\" } supportedTargetDumps . asSequence ( ) . flatMap { it . targets } . toSet ( ) . also { require ( ! it . contains ( unsupportedTarget ) ) { \"\" } } val retainedDump = KlibDump ( ) . apply { if ( oldMergedDump != null ) { merge ( oldMergedDump ) merger . retainTargetSpecificAbi ( unsupportedTarget ) } } val commonDump = KlibDump ( ) . apply { supportedTargetDumps . forEach { merge ( it ) } merger . retainCommonAbi ( ) } commonDump . merge ( retainedDump ) commonDump . merger . overrideTargets ( setOf ( unsupportedTarget ) ) return commonDump }","docstring":"/**\n * Infer a possible public ABI for [unsupportedTarget] as an ABI common across all [supportedTargetDumps].\n * If there's an [oldMergedDump] consisting of declarations of multiple targets, including [unsupportedTarget],\n * a portion of that dump specific to the [unsupportedTarget] will be extracted and merged to the common ABI\n * build from [supportedTargetDumps].\n *\n * Returned dump contains only declarations for [unsupportedTarget].\n *\n * The function aimed to facilitate ABI dumps generation for targets that are not supported by a host compiler.\n * In practice, it means generating dumps for Apple targets on non-Apple hosts.\n *\n * @throws IllegalArgumentException when one of [supportedTargetDumps] contains [unsupportedTarget]\n * @throws IllegalArgumentException when [supportedTargetDumps] are empty and [oldMergedDump] is null\n *\n * @sample samples.KlibDumpSamples.inferDump\n */"} {"signature":"@ ExperimentalBCVApi public fun KlibDump . mergeFromKlib ( klibFile : File , configurableTargetName : String ? = null , filters : KlibDumpFilters = KlibDumpFilters . DEFAULT )","body":"{ this . merge ( KlibDump . fromKlib ( klibFile , configurableTargetName , filters ) ) }","docstring":"/**\n * Dumps a public ABI of a klib represented by [klibFile] using [filters] and merges it into this dump.\n *\n * To control which declarations are dumped, [filters] could be used. By default, no filters will be applied.\n *\n * If a klib contains only a single target, it's possible to specify a custom configurable target name.\n * Please refer to [KlibTarget.configurableName] for more details on the meaning of that name.\n *\n * By default, [configurableTargetName] is null and information about a target will be taken directly from\n * the klib.\n *\n * It's an error to specify non-null [configurableTargetName] for a klib containing multiple targets.\n * It's also an error to merge dumps having some targets in common.\n *\n * @throws IllegalArgumentException if this dump and [klibFile] shares same targets.\n * @throws IllegalArgumentException if [klibFile] contains multiple targets\n * and [configurableTargetName] is not null.\n * @throws IllegalStateException if a klib could not be loaded from [klibFile].\n * @throws FileNotFoundException if [klibFile] does not exist.\n */"} {"signature":"@ ExperimentalBCVApi public fun KlibDump . saveTo ( file : File ) : Unit","body":"= file . bufferedWriter ( ) . use { saveTo ( it ) }","docstring":"/**\n * Serializes the dump and writes it to [file].\n */"} {"signature":"public fun initializeWith ( vararg executionProviders : ExecutionProvider = arrayOf ( CPU ( true ) ) )","body":"public fun initializeWith ( vararg executionProviders : ExecutionProvider = arrayOf ( CPU ( true ) ) )","docstring":"/**\n * Initialize the model with the specified executions providers.\n */"} {"signature":"private fun BaseKotlinScope . createProjectHierarchyWithPluginOnRoot ( )","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 (with the plugin)\n * settings.gradle.kts (including refs to 4 subprojects)\n * sub1/\n * build.gradle.kts\n * subsub1/build.gradle.kts\n * subsub2/build.gradle.kts\n * sub2/build.gradle.kts\n * ```\n */"} {"signature":"@ InternalCoroutinesApi public actual inline fun < T > synchronizedImpl ( lock : SynchronizedObject , block : ( ) -> T ) : T","body":"= kotlin . synchronized ( lock , block )","docstring":"/**\n * @suppress **This an internal API and should not be used from general code.**\n */"} {"signature":"fun explicitVisibilityIsNotRequired ( descriptor : DeclarationDescriptor ) : Boolean","body":"{ if ( ( descriptor as? ClassConstructorDescriptor ) ? . isPrimary == true ) return true if ( descriptor is PropertyDescriptor && ( descriptor . containingDeclaration as? ClassDescriptor ) ? . isData == true ) return true if ( ( descriptor as? CallableDescriptor ) ? . overriddenDescriptors ? . isNotEmpty ( ) == true ) return true if ( descriptor is PropertyAccessorDescriptor ) return true if ( descriptor is PropertyDescriptor && ( descriptor . containingDeclaration as? ClassDescriptor ) ? . kind == ClassKind . ANNOTATION_CLASS ) return true return false }","docstring":"/**\n * Exclusion list:\n * 1. Primary constructors of public API classes\n * 2. Properties of data classes in public API\n * 3. Overrides of public API. Effectively, this means 'no report on overrides at all'\n * 4. Getters and setters (because getters can't change visibility and setter-only explicit visibility looks ugly)\n * 5. Properties of annotations in public API\n *\n * Do we need something like @PublicApiFile to disable (or invert) this inspection per-file?\n */"} {"signature":"@ HtmlTagMarker inline fun FlowOrMetaDataOrPhrasingContent . link ( href : String ? = null , rel : String ? = null , type : String ? = null , crossinline block : LINK . ( ) -> Unit = { } ) : Unit","body":"= LINK ( attributesMapOf ( \"\" , href , \"\" , rel , \"\" , type ) , consumer ) . visit ( block )","docstring":"/**\n * A media-independent link\n */"} {"signature":"@ HtmlTagMarker inline fun FlowOrMetaDataOrPhrasingContent . meta ( name : String ? = null , content : String ? = null , charset : String ? = null , crossinline block : META . ( ) -> Unit = { } ) : Unit","body":"= META ( attributesMapOf ( \"\" , name , \"\" , content , \"\" , charset ) , consumer ) . visit ( block )","docstring":"/**\n * Generic metainformation\n */"} {"signature":"@ HtmlTagMarker inline fun FlowOrMetaDataOrPhrasingContent . noScript ( classes : String ? = null , crossinline block : NOSCRIPT . ( ) -> Unit = { } ) : Unit","body":"= NOSCRIPT ( attributesMapOf ( \"\" , classes ) , consumer ) . visit ( block )","docstring":"/**\n * Generic metainformation\n */"} {"signature":"@ HtmlTagMarker inline fun FlowOrMetaDataOrPhrasingContent . script ( type : String ? = null , src : String ? = null , crossorigin : ScriptCrossorigin ? = null , crossinline block : SCRIPT . ( ) -> Unit = { } ) : Unit","body":"= SCRIPT ( attributesMapOf ( \"\" , type , \"\" , src , \"\" , crossorigin ? . enumEncode ( ) ) , consumer ) . visit ( block )","docstring":"/**\n * Script statements\n */"} {"signature":"@ HtmlTagMarker inline fun FlowOrHeadingContent . h1 ( classes : String ? = null , crossinline block : H1 . ( ) -> Unit = { } ) : Unit","body":"= H1 ( attributesMapOf ( \"\" , classes ) , consumer ) . visit ( block )","docstring":"/**\n * Heading\n */"} {"signature":"@ HtmlTagMarker inline fun FlowOrHeadingContent . h2 ( classes : String ? = null , crossinline block : H2 . ( ) -> Unit = { } ) : Unit","body":"= H2 ( attributesMapOf ( \"\" , classes ) , consumer ) . visit ( block )","docstring":"/**\n * Heading\n */"} {"signature":"@ HtmlTagMarker inline fun FlowOrHeadingContent . h3 ( classes : String ? = null , crossinline block : H3 . ( ) -> Unit = { } ) : Unit","body":"= H3 ( attributesMapOf ( \"\" , classes ) , consumer ) . visit ( block )","docstring":"/**\n * Heading\n */"} {"signature":"@ HtmlTagMarker inline fun FlowOrHeadingContent . h4 ( classes : String ? = null , crossinline block : H4 . ( ) -> Unit = { } ) : Unit","body":"= H4 ( attributesMapOf ( \"\" , classes ) , consumer ) . visit ( block )","docstring":"/**\n * Heading\n */"} {"signature":"@ HtmlTagMarker inline fun FlowOrHeadingContent . h5 ( classes : String ? = null , crossinline block : H5 . ( ) -> Unit = { } ) : Unit","body":"= H5 ( attributesMapOf ( \"\" , classes ) , consumer ) . visit ( block )","docstring":"/**\n * Heading\n */"} {"signature":"@ HtmlTagMarker inline fun FlowOrHeadingContent . h6 ( classes : String ? = null , crossinline block : H6 . ( ) -> Unit = { } ) : Unit","body":"= H6 ( attributesMapOf ( \"\" , classes ) , consumer ) . visit ( block )","docstring":"/**\n * Heading\n */"} {"signature":"@ HtmlTagMarker inline fun FlowOrMetaDataContent . style ( type : String ? = null , crossinline block : STYLE . ( ) -> Unit = { } ) : Unit","body":"= STYLE ( attributesMapOf ( \"\" , type ) , consumer ) . visit ( block )","docstring":"/**\n * Style info\n */"} {"signature":"@ HtmlTagMarker inline fun FlowOrInteractiveContent . details ( classes : String ? = null , crossinline block : DETAILS . ( ) -> Unit = { } ) : Unit","body":"= DETAILS ( attributesMapOf ( \"\" , classes ) , consumer ) . visit ( block )","docstring":"/**\n * Disclosure control for hiding details\n */"} {"signature":"@ HtmlTagMarker inline fun FlowOrPhrasingContent . abbr ( classes : String ? = null , crossinline block : ABBR . ( ) -> Unit = { } ) : Unit","body":"= ABBR ( attributesMapOf ( \"\" , classes ) , consumer ) . visit ( block )","docstring":"/**\n * Abbreviated form (e.g., WWW, HTTP,etc.)\n */"} {"signature":"@ HtmlTagMarker inline fun FlowOrPhrasingContent . area ( shape : AreaShape ? = null , alt : String ? = null , classes : String ? = null , crossinline block : AREA . ( ) -> Unit = { } ) : Unit","body":"= AREA ( attributesMapOf ( \"\" , shape ? . enumEncode ( ) , \"\" , alt , \"\" , classes ) , consumer ) . visit ( block )","docstring":"/**\n * Client-side image map area\n */"} {"signature":"@ HtmlTagMarker inline fun FlowOrPhrasingContent . b ( classes : String ? = null , crossinline block : B . ( ) -> Unit = { } ) : Unit","body":"= B ( attributesMapOf ( \"\" , classes ) , consumer ) . visit ( block )","docstring":"/**\n * Bold text style\n */"} {"signature":"@ HtmlTagMarker inline fun FlowOrPhrasingContent . bdi ( classes : String ? = null , crossinline block : BDI . ( ) -> Unit = { } ) : Unit","body":"= BDI ( attributesMapOf ( \"\" , classes ) , consumer ) . visit ( block )","docstring":"/**\n * Text directionality isolation\n */"} {"signature":"@ HtmlTagMarker inline fun FlowOrPhrasingContent . bdo ( classes : String ? = null , crossinline block : BDO . ( ) -> Unit = { } ) : Unit","body":"= BDO ( attributesMapOf ( \"\" , classes ) , consumer ) . visit ( block )","docstring":"/**\n * I18N BiDi over-ride\n */"} {"signature":"@ HtmlTagMarker inline fun FlowOrPhrasingContent . br ( classes : String ? = null , crossinline block : BR . ( ) -> Unit = { } ) : Unit","body":"= BR ( attributesMapOf ( \"\" , classes ) , consumer ) . visit ( block )","docstring":"/**\n * Forced line break\n */"} {"signature":"@ HtmlTagMarker inline fun FlowOrPhrasingContent . canvas ( classes : String ? = null , crossinline block : CANVAS . ( ) -> Unit = { } ) : Unit","body":"= CANVAS ( attributesMapOf ( \"\" , classes ) , consumer ) . visit ( block )","docstring":"/**\n * Scriptable bitmap canvas\n */"} {"signature":"@ HtmlTagMarker fun FlowOrPhrasingContent . canvas ( classes : String ? = null , content : String = \"\" ) : Unit","body":"= CANVAS ( attributesMapOf ( \"\" , classes ) , consumer ) . visit ( { + content } )","docstring":"/**\n * Scriptable bitmap canvas\n */"} {"signature":"@ HtmlTagMarker inline fun FlowOrPhrasingContent . cite ( classes : String ? = null , crossinline block : CITE . ( ) -> Unit = { } ) : Unit","body":"= CITE ( attributesMapOf ( \"\" , classes ) , consumer ) . visit ( block )","docstring":"/**\n * Citation\n */"} {"signature":"@ HtmlTagMarker inline fun FlowOrPhrasingContent . code ( classes : String ? = null , crossinline block : CODE . ( ) -> Unit = { } ) : Unit","body":"= CODE ( attributesMapOf ( \"\" , classes ) , consumer ) . visit ( block )","docstring":"/**\n * Computer code fragment\n */"} {"signature":"@ HtmlTagMarker inline fun FlowOrPhrasingContent . dataList ( classes : String ? = null , crossinline block : DATALIST . ( ) -> Unit = { } ) : Unit","body":"= DATALIST ( attributesMapOf ( \"\" , classes ) , consumer ) . visit ( block )","docstring":"/**\n * Container for options for \n */"} {"signature":"@ HtmlTagMarker inline fun FlowOrPhrasingContent . del ( classes : String ? = null , crossinline block : DEL . ( ) -> Unit = { } ) : Unit","body":"= DEL ( attributesMapOf ( \"\" , classes ) , consumer ) . visit ( block )","docstring":"/**\n * Deleted text\n */"} {"signature":"@ HtmlTagMarker inline fun FlowOrPhrasingContent . dfn ( classes : String ? = null , crossinline block : DFN . ( ) -> Unit = { } ) : Unit","body":"= DFN ( attributesMapOf ( \"\" , classes ) , consumer ) . visit ( block )","docstring":"/**\n * Instance definition\n */"} {"signature":"@ HtmlTagMarker inline fun FlowOrPhrasingContent . em ( classes : String ? = null , crossinline block : EM . ( ) -> Unit = { } ) : Unit","body":"= EM ( attributesMapOf ( \"\" , classes ) , consumer ) . visit ( block )","docstring":"/**\n * Emphasis\n */"} {"signature":"@ HtmlTagMarker inline fun FlowOrPhrasingContent . i ( classes : String ? = null , crossinline block : I . ( ) -> Unit = { } ) : Unit","body":"= I ( attributesMapOf ( \"\" , classes ) , consumer ) . visit ( block )","docstring":"/**\n * Italic text style\n */"} {"signature":"@ HtmlTagMarker inline fun FlowOrPhrasingContent . ins ( classes : String ? = null , crossinline block : INS . ( ) -> Unit = { } ) : Unit","body":"= INS ( attributesMapOf ( \"\" , classes ) , consumer ) . visit ( block )","docstring":"/**\n * Inserted text\n */"} {"signature":"@ HtmlTagMarker inline fun FlowOrPhrasingContent . kbd ( classes : String ? = null , crossinline block : KBD . ( ) -> Unit = { } ) : Unit","body":"= KBD ( attributesMapOf ( \"\" , classes ) , consumer ) . visit ( block )","docstring":"/**\n * Text to be entered by the user\n */"} {"signature":"@ HtmlTagMarker inline fun FlowOrPhrasingContent . map ( name : String ? = null , classes : String ? = null , crossinline block : MAP . ( ) -> Unit = { } ) : Unit","body":"= MAP ( attributesMapOf ( \"\" , name , \"\" , classes ) , consumer ) . visit ( block )","docstring":"/**\n * Client-side image map\n */"} {"signature":"@ HtmlTagMarker inline fun FlowOrPhrasingContent . mark ( classes : String ? = null , crossinline block : MARK . ( ) -> Unit = { } ) : Unit","body":"= MARK ( attributesMapOf ( \"\" , classes ) , consumer ) . visit ( block )","docstring":"/**\n * Highlight\n */"} {"signature":"@ HtmlTagMarker inline fun FlowOrPhrasingContent . meter ( classes : String ? = null , crossinline block : METER . ( ) -> Unit = { } ) : Unit","body":"= METER ( attributesMapOf ( \"\" , classes ) , consumer ) . visit ( block )","docstring":"/**\n * Gauge\n */"} {"signature":"@ HtmlTagMarker inline fun FlowOrPhrasingContent . output ( classes : String ? = null , crossinline block : OUTPUT . ( ) -> Unit = { } ) : Unit","body":"= OUTPUT ( attributesMapOf ( \"\" , classes ) , consumer ) . visit ( block )","docstring":"/**\n * Calculated output value\n */"} {"signature":"@ HtmlTagMarker inline fun FlowOrPhrasingContent . progress ( classes : String ? = null , crossinline block : PROGRESS . ( ) -> Unit = { } ) : Unit","body":"= PROGRESS ( attributesMapOf ( \"\" , classes ) , consumer ) . visit ( block )","docstring":"/**\n * Progress bar\n */"} {"signature":"@ HtmlTagMarker inline fun FlowOrPhrasingContent . q ( classes : String ? = null , crossinline block : Q . ( ) -> Unit = { } ) : Unit","body":"= Q ( attributesMapOf ( \"\" , classes ) , consumer ) . visit ( block )","docstring":"/**\n * Short inline quotation\n */"} {"signature":"@ HtmlTagMarker inline fun FlowOrPhrasingContent . ruby ( classes : String ? = null , crossinline block : RUBY . ( ) -> Unit = { } ) : Unit","body":"= RUBY ( attributesMapOf ( \"\" , classes ) , consumer ) . visit ( block )","docstring":"/**\n * Ruby annotation(s)\n */"} {"signature":"@ HtmlTagMarker inline fun FlowOrPhrasingContent . samp ( classes : String ? = null , crossinline block : SAMP . ( ) -> Unit = { } ) : Unit","body":"= SAMP ( attributesMapOf ( \"\" , classes ) , consumer ) . visit ( block )","docstring":"/**\n * Sample or quote text style\n */"} {"signature":"@ HtmlTagMarker inline fun FlowOrPhrasingContent . small ( classes : String ? = null , crossinline block : SMALL . ( ) -> Unit = { } ) : Unit","body":"= SMALL ( attributesMapOf ( \"\" , classes ) , consumer ) . visit ( block )","docstring":"/**\n * Small text style\n */"} {"signature":"@ HtmlTagMarker inline fun FlowOrPhrasingContent . span ( classes : String ? = null , crossinline block : SPAN . ( ) -> Unit = { } ) : Unit","body":"= SPAN ( attributesMapOf ( \"\" , classes ) , consumer ) . visit ( block )","docstring":"/**\n * Generic language/style container\n */"} {"signature":"@ HtmlTagMarker inline fun FlowOrPhrasingContent . strong ( classes : String ? = null , crossinline block : STRONG . ( ) -> Unit = { } ) : Unit","body":"= STRONG ( attributesMapOf ( \"\" , classes ) , consumer ) . visit ( block )","docstring":"/**\n * Strong emphasis\n */"} {"signature":"@ HtmlTagMarker inline fun FlowOrPhrasingContent . sub ( classes : String ? = null , crossinline block : SUB . ( ) -> Unit = { } ) : Unit","body":"= SUB ( attributesMapOf ( \"\" , classes ) , consumer ) . visit ( block )","docstring":"/**\n * Subscript\n */"} {"signature":"@ HtmlTagMarker inline fun FlowOrPhrasingContent . sup ( classes : String ? = null , crossinline block : SUP . ( ) -> Unit = { } ) : Unit","body":"= SUP ( attributesMapOf ( \"\" , classes ) , consumer ) . visit ( block )","docstring":"/**\n * Superscript\n */"} {"signature":"@ HtmlTagMarker inline fun FlowOrPhrasingContent . time ( classes : String ? = null , crossinline block : TIME . ( ) -> Unit = { } ) : Unit","body":"= TIME ( attributesMapOf ( \"\" , classes ) , consumer ) . visit ( block )","docstring":"/**\n * Machine-readable equivalent of date- or time-related data\n */"} {"signature":"@ HtmlTagMarker inline fun FlowOrPhrasingContent . htmlVar ( classes : String ? = null , crossinline block : VAR . ( ) -> Unit = { } ) : Unit","body":"= VAR ( attributesMapOf ( \"\" , classes ) , consumer ) . visit ( block )","docstring":"/**\n * Unordered list\n */"} {"signature":"@ HtmlTagMarker inline fun SectioningOrFlowContent . article ( classes : String ? = null , crossinline block : ARTICLE . ( ) -> Unit = { } ) : Unit","body":"= ARTICLE ( attributesMapOf ( \"\" , classes ) , consumer ) . visit ( block )","docstring":"/**\n * Self-contained syndicatable or reusable composition\n */"} {"signature":"@ HtmlTagMarker inline fun SectioningOrFlowContent . aside ( classes : String ? = null , crossinline block : ASIDE . ( ) -> Unit = { } ) : Unit","body":"= ASIDE ( attributesMapOf ( \"\" , classes ) , consumer ) . visit ( block )","docstring":"/**\n * Sidebar for tangentially related content\n */"} {"signature":"@ HtmlTagMarker inline fun SectioningOrFlowContent . main ( classes : String ? = null , crossinline block : MAIN . ( ) -> Unit = { } ) : Unit","body":"= MAIN ( attributesMapOf ( \"\" , classes ) , consumer ) . visit ( block )","docstring":"/**\n * Container for the dominant contents of another element\n */"} {"signature":"@ HtmlTagMarker inline fun SectioningOrFlowContent . nav ( classes : String ? = null , crossinline block : NAV . ( ) -> Unit = { } ) : Unit","body":"= NAV ( attributesMapOf ( \"\" , classes ) , consumer ) . visit ( block )","docstring":"/**\n * Section with navigational links\n */"} {"signature":"@ HtmlTagMarker inline fun SectioningOrFlowContent . section ( classes : String ? = null , crossinline block : SECTION . ( ) -> Unit = { } ) : Unit","body":"= SECTION ( attributesMapOf ( \"\" , classes ) , consumer ) . visit ( block )","docstring":"/**\n * Generic document or application section\n */"} {"signature":"@ HtmlTagMarker inline fun FlowOrInteractiveOrPhrasingContent . a ( href : String ? = null , target : String ? = null , classes : String ? = null , crossinline block : A . ( ) -> Unit = { } ) : Unit","body":"= A ( attributesMapOf ( \"\" , href , \"\" , target , \"\" , classes ) , consumer ) . visit ( block )","docstring":"/**\n * Anchor\n */"} {"signature":"@ HtmlTagMarker inline fun FlowOrInteractiveOrPhrasingContent . audio ( classes : String ? = null , crossinline block : AUDIO . ( ) -> Unit = { } ) : Unit","body":"= AUDIO ( attributesMapOf ( \"\" , classes ) , consumer ) . visit ( block )","docstring":"/**\n * Audio player\n */"} {"signature":"@ HtmlTagMarker inline fun FlowOrInteractiveOrPhrasingContent . button ( formEncType : ButtonFormEncType ? = null , formMethod : ButtonFormMethod ? = null , name : String ? = null , type : ButtonType ? = null , classes : String ? = null , crossinline block : BUTTON . ( ) -> Unit = { } ) : Unit","body":"= BUTTON ( attributesMapOf ( \"\" , formEncType ? . enumEncode ( ) , \"\" , formMethod ? . enumEncode ( ) , \"\" , name , \"\" , type ? . enumEncode ( ) , \"\" , classes ) , consumer ) . visit ( block )","docstring":"/**\n * Push button\n */"} {"signature":"@ HtmlTagMarker inline fun FlowOrInteractiveOrPhrasingContent . embed ( classes : String ? = null , crossinline block : EMBED . ( ) -> Unit = { } ) : Unit","body":"= EMBED ( attributesMapOf ( \"\" , classes ) , consumer ) . visit ( block )","docstring":"/**\n * Plugin\n */"} {"signature":"@ HtmlTagMarker inline fun FlowOrInteractiveOrPhrasingContent . iframe ( sandbox : IframeSandbox ? = null , classes : String ? = null , crossinline block : IFRAME . ( ) -> Unit = { } ) : Unit","body":"= IFRAME ( attributesMapOf ( \"\" , sandbox ? . enumEncode ( ) , \"\" , classes ) , consumer ) . visit ( block )","docstring":"/**\n * Inline subwindow\n */"} {"signature":"@ HtmlTagMarker fun FlowOrInteractiveOrPhrasingContent . iframe ( sandbox : IframeSandbox ? = null , classes : String ? = null , content : String = \"\" ) : Unit","body":"= IFRAME ( attributesMapOf ( \"\" , sandbox ? . enumEncode ( ) , \"\" , classes ) , consumer ) . visit ( { + content } )","docstring":"/**\n * Inline subwindow\n */"} {"signature":"@ HtmlTagMarker inline fun FlowOrInteractiveOrPhrasingContent . img ( alt : String ? = null , src : String ? = null , loading : ImgLoading ? = null , classes : String ? = null , crossinline block : IMG . ( ) -> Unit = { } ) : Unit","body":"= IMG ( attributesMapOf ( \"\" , alt , \"\" , src , \"\" , loading ? . enumEncode ( ) , \"\" , classes ) , consumer ) . visit ( block )","docstring":"/**\n * Embedded image\n */"} {"signature":"@ HtmlTagMarker inline fun FlowOrInteractiveOrPhrasingContent . picture ( crossinline block : PICTURE . ( ) -> Unit = { } ) : Unit","body":"= PICTURE ( emptyMap , consumer ) . visit ( block )","docstring":"/**\n * Pictures container\n */"} {"signature":"@ HtmlTagMarker inline fun FlowOrInteractiveOrPhrasingContent . input ( type : InputType ? = null , formEncType : InputFormEncType ? = null , formMethod : InputFormMethod ? = null , name : String ? = null , classes : String ? = null , crossinline block : INPUT . ( ) -> Unit = { } ) : Unit","body":"= INPUT ( attributesMapOf ( \"\" , type ? . enumEncode ( ) , \"\" , formEncType ? . enumEncode ( ) , \"\" , formMethod ? . enumEncode ( ) , \"\" , name , \"\" , classes ) , consumer ) . visit ( block )","docstring":"/**\n * Form control\n */"} {"signature":"@ HtmlTagMarker inline fun FlowOrInteractiveOrPhrasingContent . keyGen ( keyType : KeyGenKeyType ? = null , classes : String ? = null , crossinline block : KEYGEN . ( ) -> Unit = { } ) : Unit","body":"= KEYGEN ( attributesMapOf ( \"\" , keyType ? . enumEncode ( ) , \"\" , classes ) , consumer ) . visit ( block )","docstring":"/**\n * Cryptographic key-pair generator form control\n */"} {"signature":"@ HtmlTagMarker inline fun FlowOrInteractiveOrPhrasingContent . label ( classes : String ? = null , crossinline block : LABEL . ( ) -> Unit = { } ) : Unit","body":"= LABEL ( attributesMapOf ( \"\" , classes ) , consumer ) . visit ( block )","docstring":"/**\n * Form field label text\n */"} {"signature":"@ HtmlTagMarker inline fun FlowOrInteractiveOrPhrasingContent . htmlObject ( classes : String ? = null , crossinline block : OBJECT . ( ) -> Unit = { } ) : Unit","body":"= OBJECT ( attributesMapOf ( \"\" , classes ) , consumer ) . visit ( block )","docstring":"/**\n * Generic embedded object\n */"} {"signature":"@ HtmlTagMarker inline fun FlowOrInteractiveOrPhrasingContent . select ( classes : String ? = null , crossinline block : SELECT . ( ) -> Unit = { } ) : Unit","body":"= SELECT ( attributesMapOf ( \"\" , classes ) , consumer ) . visit ( block )","docstring":"/**\n * Option selector\n */"} {"signature":"@ HtmlTagMarker inline fun FlowOrInteractiveOrPhrasingContent . textArea ( rows : String ? = null , cols : String ? = null , wrap : TextAreaWrap ? = null , classes : String ? = null , crossinline block : TEXTAREA . ( ) -> Unit = { } ) : Unit","body":"= TEXTAREA ( attributesMapOf ( \"\" , rows , \"\" , cols , \"\" , wrap ? . enumEncode ( ) , \"\" , classes ) , consumer ) . visit ( block )","docstring":"/**\n * Multi-line text field\n */"} {"signature":"@ HtmlTagMarker fun FlowOrInteractiveOrPhrasingContent . textArea ( rows : String ? = null , cols : String ? = null , wrap : TextAreaWrap ? = null , classes : String ? = null , content : String = \"\" ) : Unit","body":"= TEXTAREA ( attributesMapOf ( \"\" , rows , \"\" , cols , \"\" , wrap ? . enumEncode ( ) , \"\" , classes ) , consumer ) . visit ( { + content } )","docstring":"/**\n * Multi-line text field\n */"} {"signature":"@ HtmlTagMarker inline fun FlowOrInteractiveOrPhrasingContent . video ( classes : String ? = null , crossinline block : VIDEO . ( ) -> Unit = { } ) : Unit","body":"= VIDEO ( attributesMapOf ( \"\" , classes ) , consumer ) . visit ( block )","docstring":"/**\n * Video player\n */"} {"signature":"public fun findAsJava ( kotlinDri : DRI ) : DRI ?","body":"public fun findAsJava ( kotlinDri : DRI ) : DRI ?","docstring":"/**\n * E.g.\n * kotlin.Throwable -> java.lang.Throwable\n * kotlin.Int -> java.lang.Integer\n * kotlin.Int.Companion -> kotlin.jvm.internal.IntCompanionObject\n * kotlin.Nothing -> java.lang.Void\n * kotlin.IntArray -> null\n * kotlin.Function3 -> kotlin.jvm.functions.Function3\n * kotlin.coroutines.SuspendFunction3 -> kotlin.jvm.functions.Function4\n * kotlin.Function42 -> kotlin.jvm.functions.FunctionN\n * kotlin.coroutines.SuspendFunction42 -> kotlin.jvm.functions.FunctionN\n * kotlin.reflect.KFunction3 -> kotlin.reflect.KFunction\n * kotlin.reflect.KSuspendFunction3 -> kotlin.reflect.KFunction\n * kotlin.reflect.KFunction42 -> kotlin.reflect.KFunction\n * kotlin.reflect.KSuspendFunction42 -> kotlin.reflect.KFunction\n */"} {"signature":"@ ExperimentalSerializationApi public fun getElementName ( index : Int ) : String","body":"@ ExperimentalSerializationApi public fun getElementName ( index : Int ) : String","docstring":"/**\n * Returns a positional name of the child at the given [index].\n * Positional name represents a corresponding property name in the class, associated with\n * the current descriptor.\n *\n * @throws IndexOutOfBoundsException for an illegal [index] values.\n * @throws IllegalStateException if the current descriptor does not support children elements (e.g. is a primitive)\n */"} {"signature":"@ ExperimentalSerializationApi public fun getElementIndex ( name : String ) : Int","body":"@ ExperimentalSerializationApi public fun getElementIndex ( name : String ) : Int","docstring":"/**\n * Returns an index in the children list of the given element by its name or [CompositeDecoder.UNKNOWN_NAME]\n * if there is no such element.\n * The resulting index, if it is not [CompositeDecoder.UNKNOWN_NAME], is guaranteed to be usable with [getElementName].\n */"} {"signature":"@ ExperimentalSerializationApi public fun getElementAnnotations ( index : Int ) : List < Annotation >","body":"@ ExperimentalSerializationApi public fun getElementAnnotations ( index : Int ) : List < Annotation >","docstring":"/**\n * Returns serial annotations of the child element at the given [index].\n * This method differs from `getElementDescriptor(index).annotations` by reporting only\n * declaration-specific annotations:\n * ```\n * @Serializable\n * @SomeSerialAnnotation\n * class Nested(...)\n *\n * @Serializable\n * class Outer(@AnotherSerialAnnotation val nested: Nested)\n *\n * outerDescriptor.getElementAnnotations(0) // Returns [@AnotherSerialAnnotation]\n * outerDescriptor.getElementDescriptor(0).annotations // Returns [@SomeSerialAnnotation]\n * ```\n * Only annotations marked with [SerialInfo] are added to the resulting list.\n *\n * @throws IndexOutOfBoundsException for an illegal [index] values.\n * @throws IllegalStateException if the current descriptor does not support children elements (e.g. is a primitive).\n */"} {"signature":"@ ExperimentalSerializationApi public fun getElementDescriptor ( index : Int ) : SerialDescriptor","body":"@ ExperimentalSerializationApi public fun getElementDescriptor ( index : Int ) : SerialDescriptor","docstring":"/**\n * Retrieves the descriptor of the child element for the given [index].\n * For the property of type `T` on the position `i`, `getElementDescriptor(i)` yields the same result\n * as for `T.serializer().descriptor`, if the serializer for this property is not explicitly overridden\n * with `@Serializable(with = ...`)`, [Polymorphic] or [Contextual].\n * This method can be used to completely introspect the type that the current descriptor describes.\n *\n * @throws IndexOutOfBoundsException for illegal [index] values.\n * @throws IllegalStateException if the current descriptor does not support children elements (e.g. is a primitive).\n */"} {"signature":"@ ExperimentalSerializationApi public fun isElementOptional ( index : Int ) : Boolean","body":"@ ExperimentalSerializationApi public fun isElementOptional ( index : Int ) : Boolean","docstring":"/**\n * Whether the element at the given [index] is optional (can be absent in serialized form).\n * For generated descriptors, all elements that have a corresponding default parameter value are\n * marked as optional. Custom serializers can treat optional values in a serialization-specific manner\n * without default parameters constraint.\n *\n * Example of optionality:\n * ```\n * @Serializable\n * class Holder(\n * val a: Int, // Optional == false\n * val b: Int?, // Optional == false\n * val c: Int? = null, // Optional == true\n * val d: List, // Optional == false\n * val e: List = listOf(1), // Optional == true\n * )\n * ```\n * Returns `false` for valid indices of collections, maps and enums.\n *\n * @throws IndexOutOfBoundsException for an illegal [index] values.\n * @throws IllegalStateException if the current descriptor does not support children elements (e.g. is a primitive).\n */"} {"signature":"override fun createPointer ( ) : KtSymbolPointer < KtFirEnumEntryInitializerSymbol >","body":"= withValidityAssertion { KtPsiBasedSymbolPointer . createForSymbolFromSource < KtFirEnumEntryInitializerSymbol > ( this ) ? : KtFirEnumEntryInitializerSymbolPointer ( analysisSession . createOwnerPointer ( this ) ) }","docstring":"/**\n * [KtFirEnumEntryInitializerSymbol] is the required return type instead of [KtEnumEntryInitializerSymbol] to fulfill return type\n * subtyping requirements, as [KtEnumEntryInitializerSymbol] is not a subtype of\n * [org.jetbrains.kotlin.analysis.api.symbols.KtAnonymousObjectSymbol]. (It cannot be a subtype in the general Analysis API because enum\n * entry initializers are classes in FE10.)\n */"} {"signature":"@ Test fun testObservableCollectThrowingObservable ( )","body":"= runTest { expect ( ) var sum = try { rxObservable { for ( i in .. ) { send ( i ) } throw TestException ( ) } . collect { sum += it } } catch ( e : TestException ) { assertTrue ( sum > ) finish ( ) } }","docstring":"/** Tests the behavior of [collect] when the publisher raises an error. */"} {"signature":"@ Test fun testObservableCollectThrowingAction ( )","body":"= runTest { expect ( ) var sum = val expectedSum = try { var disposed = false ObservableSource < Int > { observer -> launch ( Dispatchers . Default ) { observer . onSubscribe ( object : Disposable { override fun dispose ( ) { disposed = true expect ( expectedSum + ) } override fun isDisposed ( ) : Boolean = disposed } ) while ( ! disposed ) { observer . onNext ( ) } } } . collect { expect ( sum + ) sum += it if ( sum == expectedSum ) { throw TestException ( ) } } } catch ( e : TestException ) { assertEquals ( expectedSum , sum ) finish ( expectedSum + ) } }","docstring":"/** Tests the behavior of [collect] when the action throws. */"} {"signature":"@ Test fun testChannelClosing ( )","body":"= runTest { expect ( ) val publisher = publish < Int > ( Dispatchers . Unconfined ) { expect ( ) close ( ) assert ( isClosedForSend ) expect ( ) } try { expect ( ) publisher . awaitFirstOrNull ( ) } catch ( e : CancellationException ) { expect ( ) } finish ( ) }","docstring":"/** Tests that, as soon as `ProducerScope.close` is called, `isClosedForSend` starts returning `true`. */"} {"signature":"@ Test fun testOnNextErrorAfterCancellation ( )","body":"= runTest { assertCallsExceptionHandlerWith < TestException > { handler -> var producerScope : ProducerScope < Int > ? = null CompletableDeferred < Unit > ( ) expect ( ) var job : Job ? = null val publisher = publish < Int > ( handler + Dispatchers . Unconfined ) { producerScope = this expect ( ) job = launch { delay ( Long . MAX_VALUE ) } } expect ( ) publisher . subscribe ( object : Subscriber < Int > { override fun onSubscribe ( s : Subscription ) { expect ( ) s . request ( Long . MAX_VALUE ) } override fun onNext ( t : Int ) { expect ( ) assertEquals ( , t ) job ! ! . cancel ( ) throw TestException ( ) } override fun onError ( t : Throwable ? ) { assertIs < CancellationException > ( t ) } override fun onComplete ( ) { expectUnreached ( ) } } ) expect ( ) val result : ChannelResult < Unit > = producerScope ! ! . trySend ( ) val e = result . exceptionOrNull ( ) ! ! assertIs < CancellationException > ( e , \"\" ) assertTrue ( producerScope ! ! . isClosedForSend ) assertTrue ( result . isFailure ) } finish ( ) }","docstring":"/** Tests the behavior when a call to `onNext` fails after the channel is already closed. */"} {"signature":"@ Test fun testTrySendNotThrowing ( )","body":"= runTest { var producerScope : ProducerScope < Int > ? = null expect ( ) val publisher = publish < Int > ( Dispatchers . Unconfined ) { producerScope = this expect ( ) delay ( Long . MAX_VALUE ) } val job = launch ( start = CoroutineStart . UNDISPATCHED ) { expect ( ) publisher . awaitFirstOrNull ( ) expectUnreached ( ) } job . cancel ( ) expect ( ) val result = producerScope ! ! . trySend ( ) assertTrue ( result . isFailure ) finish ( ) }","docstring":"/** Tests that `trySend` doesn't throw in `publish`. */"} {"signature":"@ Test fun testEmittingNull ( )","body":"= runTest { val publisher = publish { assertFailsWith < NullPointerException > { send ( null ) } assertFailsWith < NullPointerException > { trySend ( null ) } send ( \"\" ) } assertEquals ( \"\" , publisher . awaitFirstOrNull ( ) ) }","docstring":"/** Tests that all methods on `publish` fail without closing the channel when attempting to emit `null`. */"} {"signature":"fun runTest ( swiftFilePath : String , )","body":"{ Assumptions . assumeTrue ( targets . hostTarget . family . isAppleFamily && targets . testTarget . family . isAppleFamily ) val testDirectory = getAbsoluteFile ( swiftFilePath ) . resolve ( \"\" ) require ( testDirectory . exists ( ) && testDirectory . isDirectory ( ) ) val swiftFile = testDirectory . walk ( ) . find { it . extension == \"\" } ? : error ( \"\" ) val cHeader = testDirectory . walk ( ) . find { it . extension == \"\" } ? : error ( \"\" ) val configs = testRunSettings . configurables as AppleConfigurables val swiftTarget = configs . targetTriple . withOSVersion ( configs . osVersionMin ) . toString ( ) val bridgeModuleFile = createModuleMap ( buildDir , cHeader ) val kotlinRuntimeModuleMapFile = Distribution ( KotlinNativePaths . homePath . absolutePath ) . kotlinRuntimeForSwiftModuleMap val args = listOf ( \"\" , swiftFile . absolutePath , \"\" , \"\" , \"\" , \"\" , \"\" , \"\" , configs . absoluteTargetSysRoot , \"\" , swiftTarget ) val ( exitCode , swiftcOutput , _ , _ ) = invokeSwiftC ( testRunSettings , args ) assertEquals ( ExitCode . OK , exitCode , \"\" ) }","docstring":"/**\n This test is the simplest possible solutions for task KT-65559\n\n One reading this test could find themselves confused, with following questions:\n 1/ what does it do\n 2/ why it is placed in native-test infra\n 3/ what actually we do test\n\n This comment wil try to answer all those questions.\n\n What we are trying to achieve:\n There is a SwiftExport artefact, and we have some integration tests for it.\n But our integration tests check only one thing - that our current implementation generates expected source files.\n But we do not compile that resulted files, as that actions requires macOS agents with swift installed,\n and we want to keep our day2day tests as quick as possible.\n\n So, we have construct this test - it will take golden data that we are expecting to receive from SwiftExport,\n and verify with swift compiler that we expect valid code. This way we have separated tests that verify code generation\n from tests that verify code validity. That separation may not be desired, but that separation allows us to keep tests for\n code generation fast and TeamCity agent agnostic.\n\n We do plan to refactor this, and extract infra for running swiftc and xcode into separate module, that will be shared\n between SwiftExport, ObjectiveCExport, Kotlin/Native and KGP tests. But currently - the following solution is the simplest one.\n */"} {"signature":"internal fun KoverContext . finalizing ( origins : AllVariantOrigins )","body":"{ projectExtension . finalizeActions . forEach { action -> try { action ( ) } catch ( e : Exception ) { throw KoverCriticalException ( \"\" , e ) } } val jvmVariant = origins . jvm ? . createVariant ( this , variantConfig ( JVM_VARIANT_NAME ) ) if ( jvmVariant != null ) { VariantReportsSet ( project , JVM_VARIANT_NAME , ReportVariantType . JVM , toolProvider , reportsConfig ( JVM_VARIANT_NAME , project . path ) , reporterClasspath , projectExtension . koverDisabled ) . assign ( jvmVariant ) } val androidVariants = origins . android . map { providedDetails -> providedDetails . createVariant ( this , variantConfig ( providedDetails . buildVariant . buildVariant ) ) } val variantArtifacts = mutableMapOf < String , AbstractVariantArtifacts > ( ) jvmVariant ? . let { variantArtifacts [ JVM_VARIANT_NAME ] = it } androidVariants . forEach { variantArtifacts [ it . variantName ] = it } val availableVariants = variantArtifacts . keys + projectExtension . current . customVariants . keys projectExtension . reports . byName . forEach { ( requestedVariant , _ ) -> if ( requestedVariant !in availableVariants ) { throw KoverIllegalConfigException ( \"\" ) } } val totalVariant = TotalVariantArtifacts ( project , toolProvider , koverBucketConfiguration , variantConfig ( TOTAL_VARIANT_NAME ) , projectExtension ) variantArtifacts . values . forEach { totalVariant . mergeWith ( it ) } totalReports . assign ( totalVariant ) projectExtension . current . providedVariants . forEach { ( name , _ ) -> if ( name !in variantArtifacts ) { throw KoverIllegalConfigException ( \"\" ) } } projectExtension . current . customVariants . forEach { ( name , config ) -> if ( name == JVM_VARIANT_NAME ) { throw KoverIllegalConfigException ( \"\" ) } if ( name in variantArtifacts ) { throw KoverIllegalConfigException ( \"\" ) } val customVariant = CustomVariantArtifacts ( project , name , toolProvider , koverBucketConfiguration , config , projectExtension ) config . variantsByName . forEach { ( mergedName , optionality ) -> val mergedVariant = variantArtifacts [ mergedName ] if ( mergedVariant != null ) { if ( optionality . withDependencies ) { customVariant . mergeWithDependencies ( mergedVariant ) } else { customVariant . mergeWith ( mergedVariant ) } } else { if ( ! optionality . optional ) { throw KoverIllegalConfigException ( \"\" ) } } } VariantReportsSet ( project , name , ReportVariantType . CUSTOM , toolProvider , reportsConfig ( name , project . path ) , reporterClasspath , projectExtension . koverDisabled ) . assign ( customVariant ) } androidVariants . forEach { androidVariant -> VariantReportsSet ( project , androidVariant . variantName , ReportVariantType . ANDROID , toolProvider , reportsConfig ( androidVariant . variantName , project . path ) , reporterClasspath , projectExtension . koverDisabled ) . assign ( androidVariant ) } }","docstring":"/**\n * The second stage of applying the Kover plugin.\n *\n * Objects are created that depend on the full configuration of the project: the availability of Kotlin plugins,\n * the availability and settings of the Android plugin, the user settings of the Kover plugin itself.\n */"} {"signature":"fun processHeader ( headerMetadata : ByteArray )","body":"fun processHeader ( headerMetadata : ByteArray )","docstring":"/** processes new header metadata (serialized [JsProtoBuf.Header]) */"} {"signature":"fun processPackagePart ( sourceFile : File , packagePartMetadata : ByteArray , binaryAst : ByteArray , inlineData : ByteArray )","body":"fun processPackagePart ( sourceFile : File , packagePartMetadata : ByteArray , binaryAst : ByteArray , inlineData : ByteArray )","docstring":"/** processes new package part metadata and binary tree for compiled source file */"} {"signature":"fun processInlineFunction ( sourceFile : File , fqName : String , inlineFunction : Any , line : Int , column : Int )","body":"fun processInlineFunction ( sourceFile : File , fqName : String , inlineFunction : Any , line : Int , column : Int )","docstring":"/**\n * [inlineFunction] is expected to be a body of inline function (an instance of [JsNode]),\n * but [Any] is used to avoid classloader conflicts in tests where the compiler is isolated\n * (such as [JsProtoComparisonTestGenerated]).\n */"} {"signature":"fun processInlineFunctions ( functions : Collection < JsInlineFunctionHash > )","body":"fun processInlineFunctions ( functions : Collection < JsInlineFunctionHash > )","docstring":"/**\n * Alternative to [processInlineFunction]: record all inline functions after it was processed.\n * Used in daemon RPC.\n */"} {"signature":"fun main ( )","body":"{ val jsonConfigFile = getVGG16JSONConfigFile ( ) val model = Sequential . loadModelConfiguration ( jsonConfigFile ) val imageNetClassLabels = Imagenet . V1k . labels ( ) model . use { it . compile ( optimizer = Adam ( ) , loss = Losses . MAE , metric = Metrics . ACCURACY ) println ( it . kGraph ) it . logSummary ( ) val hdfFile = getVGG16WeightsFile ( ) it . loadWeights ( hdfFile ) val fileLoader = pipeline < BufferedImage > ( ) . convert { colorMode = ColorMode . BGR } . toFloatArray { } . call ( InputType . CAFFE . preprocessing ( ) ) . fileLoader ( ) for ( i in .. ) { val inputData = fileLoader . load ( getFileFromResource ( \"\" ) ) val res = it . predict ( inputData , \"\" ) println ( \"\" ) val top5 = it . predictTop5Labels ( inputData , imageNetClassLabels ) println ( top5 . toString ( ) ) } } }","docstring":"/**\n * This example demonstrates the inference concept on VGG'16 model:\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 VGG'16 during training on ImageNet dataset) is applied to each image before prediction.\n * - No additional training.\n * - No new layers are added.\n *\n * @see \n * Very Deep Convolutional Networks for Large-Scale Image Recognition (ICLR 2015).\n * @see \n * Detailed description of VGG'16 model and an approach to build it in Keras.\n */"} {"signature":"private fun getVGG16JSONConfigFile ( ) : File","body":"{ val properties = Properties ( ) val reader = FileReader ( \"\" ) properties . load ( reader ) val vgg16JSONModelPath = properties [ \"\" ] as String return File ( vgg16JSONModelPath ) }","docstring":"/** Returns JSON file with model configuration, saved from Keras 2.x. */"} {"signature":"private fun getVGG16WeightsFile ( ) : HdfFile","body":"{ val properties = Properties ( ) val reader = FileReader ( \"\" ) properties . load ( reader ) val vgg16h5WeightsPath = properties [ \"\" ] as String return HdfFile ( File ( vgg16h5WeightsPath ) ) }","docstring":"/** Returns .h5 file with model weights, saved from Keras 2.x. */"} {"signature":"@ Test fun testConsumeJsMiscompilation ( )","body":"= runTest { val channel = Channel < Int > ( ) assertFailsWith < IndexOutOfBoundsException > { try { channel . consume { null } ? : throw IndexOutOfBoundsException ( ) } catch ( e : Exception ) { throw e } } }","docstring":"/** Check that [ReceiveChannel.consume] does not suffer from KT-58685 */"} {"signature":"@ Test fun testConsumeClosesOnSuccess ( )","body":"= runTest { val channel = Channel < Int > ( ) channel . consume { } assertTrue ( channel . isClosedForReceive ) }","docstring":"/** Checks that [ReceiveChannel.consume] closes the channel when the block executes successfully. */"} {"signature":"@ Test fun testConsumeClosesOnFailure ( )","body":"= runTest { val channel = Channel < Int > ( ) try { channel . consume { throw TestException ( ) } } catch ( e : TestException ) { } assertTrue ( channel . isClosedForReceive ) }","docstring":"/** Checks that [ReceiveChannel.consume] closes the channel when the block executes successfully. */"} {"signature":"@ Test fun testConsumeClosesOnEarlyReturn ( )","body":"= runTest { val channel = Channel < Int > ( ) fun f ( ) { try { channel . consume { return } } catch ( e : TestException ) { } } f ( ) assertTrue ( channel . isClosedForReceive ) }","docstring":"/** Checks that [ReceiveChannel.consume] closes the channel when the block does an early return. */"} {"signature":"@ Test fun testConsumeEachClosesOnSuccess ( )","body":"= runTest { val channel = Channel < Int > ( Channel . UNLIMITED ) launch { channel . close ( ) } channel . consumeEach { fail ( \"\" ) } assertTrue ( channel . isClosedForReceive ) }","docstring":"/** Checks that [ReceiveChannel.consume] closes the channel when the block executes successfully. */"} {"signature":"@ Test fun testConsumeEachClosesOnFailure ( )","body":"= runTest { val channel = Channel < Unit > ( Channel . UNLIMITED ) channel . send ( Unit ) try { channel . consumeEach { throw TestException ( ) } } catch ( e : TestException ) { } assertTrue ( channel . isClosedForReceive ) }","docstring":"/** Checks that [ReceiveChannel.consume] closes the channel when the block executes successfully. */"} {"signature":"@ Test fun testConsumeEachClosesOnEarlyReturn ( )","body":"= runTest { val channel = Channel < Unit > ( Channel . UNLIMITED ) channel . send ( Unit ) suspend fun f ( ) { channel . consumeEach { return@f } } f ( ) assertTrue ( channel . isClosedForReceive ) }","docstring":"/** Checks that [ReceiveChannel.consume] closes the channel when the block does an early return. */"} {"signature":"@ Suppress ( \"\" , \"\" ) @ Test fun testBroadcastChannelConsumeJsMiscompilation ( )","body":"= runTest { val channel = BroadcastChannel < Int > ( ) assertFailsWith < IndexOutOfBoundsException > { try { channel . consume { null } ? : throw IndexOutOfBoundsException ( ) } catch ( e : Exception ) { throw e } } }","docstring":"/** Check that [BroadcastChannel.consume] does not suffer from KT-58685 */"} {"signature":"@ JvmName ( \"\" ) public fun LinAlg . eig ( mat : MultiArray < Float , D2 > ) : Pair < D1Array < ComplexFloat > , D2Array < ComplexFloat > >","body":"= this . linAlgEx . eigF ( mat )","docstring":"/**\n * Calculates the eigenvalues and eigenvectors of a float matrix\n * @return a pair of a vector of eigenvalues and a matrix of eigenvectors\n */"} {"signature":"@ JvmName ( \"\" ) public fun < T : Number > LinAlg . eig ( mat : MultiArray < T , D2 > ) : Pair < D1Array < ComplexDouble > , D2Array < ComplexDouble > >","body":"= this . linAlgEx . eig ( mat )","docstring":"/**\n * Calculates the eigenvalues and eigenvectors of a numeric matrix\n * @return a pair of a vector of eigenvalues and a matrix of eigenvectors\n */"} {"signature":"@ JvmName ( \"\" ) public fun < T : Complex > LinAlg . eig ( mat : MultiArray < T , D2 > ) : Pair < D1Array < T > , D2Array < T > >","body":"= this . linAlgEx . eigC ( mat )","docstring":"/**\n * Calculates the eigenvalues and eigenvectors of a complex matrix\n * @return a pair of a vector of eigenvalues and a matrix of eigenvectors\n */"} {"signature":"@ JvmName ( \"\" ) public fun LinAlg . eigVals ( mat : MultiArray < Float , D2 > ) : D1Array < ComplexFloat >","body":"= this . linAlgEx . eigValsF ( mat )","docstring":"/**\n * Calculates the eigenvalues of a float matrix\n * @return [ComplexFloat] vector\n */"} {"signature":"@ JvmName ( \"\" ) public fun < T : Number > LinAlg . eigVals ( mat : MultiArray < T , D2 > ) : D1Array < ComplexDouble >","body":"= this . linAlgEx . eigVals ( mat )","docstring":"/**\n * Calculates the eigenvalues of a numeric matrix.\n * @return [ComplexDouble] vector\n */"} {"signature":"@ JvmName ( \"\" ) public fun < T : Complex > LinAlg . eigVals ( mat : MultiArray < T , D2 > ) : D1Array < T >","body":"= this . linAlgEx . eigValsC ( mat )","docstring":"/**\n * Calculates the eigenvalues of a float matrix\n * @return complex vector\n */"} {"signature":"fun getVisibleSourceSets ( visibleFromSourceSet : KotlinSourceSetName , resolvedRootMppDependency : ResolvedDependencyResult , dependencyProjectStructureMetadata : KotlinProjectStructureMetadata , resolvedToOtherProject : Boolean , ) : SourceSetVisibilityResult","body":"{ val resolvedRootMppDependencyId = resolvedRootMppDependency . selected . id val platformCompilationsByResolvedVariantName = mutableMapOf < String , PlatformCompilationData > ( ) val visiblePlatformVariantNames : List < Set < String > > = platformCompilations . filter { visibleFromSourceSet in it . allSourceSets } . mapNotNull { platformCompilationData -> val resolvedPlatformDependencies = platformCompilationData . resolvedDependenciesConfiguration . allResolvedDependencies . filter { it . selected . id isEqualsIgnoringVersion resolvedRootMppDependencyId } . ifEmpty { return@mapNotNull null } resolvedPlatformDependencies . map { resolvedPlatformDependency -> val resolvedVariant = kotlinVariantNameFromPublishedVariantName ( resolvedPlatformDependency . resolvedVariant . displayName ) if ( resolvedVariant !in platformCompilationsByResolvedVariantName ) { platformCompilationsByResolvedVariantName [ resolvedVariant ] = platformCompilationData } resolvedVariant } . toSet ( ) } if ( visiblePlatformVariantNames . isEmpty ( ) ) { return SourceSetVisibilityResult ( emptySet ( ) , emptyMap ( ) ) } val visibleSourceSetNames = visiblePlatformVariantNames . mapNotNull { platformVariants -> platformVariants . map { dependencyProjectStructureMetadata . sourceSetNamesByVariantName [ it ] . orEmpty ( ) } . fold ( emptySet < String > ( ) ) { acc , item -> acc union item } . ifEmpty { null } } . ifEmpty { listOf ( emptySet ( ) ) } . reduce { acc , item -> acc intersect item } val hostSpecificArtifactBySourceSet : Map < String , File > = if ( resolvedToOtherProject ) { emptyMap ( ) } else { val hostSpecificSourceSets = visibleSourceSetNames . intersect ( dependencyProjectStructureMetadata . hostSpecificSourceSets ) val someVariantByHostSpecificSourceSet = hostSpecificSourceSets . associate { sourceSetName -> sourceSetName to dependencyProjectStructureMetadata . sourceSetNamesByVariantName . filterKeys { it in platformCompilationsByResolvedVariantName } . filterValues { sourceSetName in it } . keys . first ( ) } someVariantByHostSpecificSourceSet . entries . mapNotNull { ( sourceSetName , variantName ) -> val resolvedHostSpecificMetadataConfiguration = platformCompilationsByResolvedVariantName . getValue ( variantName ) . hostSpecificMetadataConfiguration ? : return@mapNotNull null val dependency = resolvedHostSpecificMetadataConfiguration . allResolvedDependencies . find { it . selected . id == resolvedRootMppDependencyId } ? : return@mapNotNull null val metadataArtifact = resolvedHostSpecificMetadataConfiguration . dependencyArtifactsOrNull ( dependency ) ? . singleOrNull ( ) ? : return@mapNotNull null val metadataArtifactFile = metadataArtifact . file if ( ! metadataArtifactFile . exists ( ) ) return@mapNotNull null sourceSetName to metadataArtifact . file } . toMap ( ) } return SourceSetVisibilityResult ( visibleSourceSetNames , hostSpecificArtifactBySourceSet ) }","docstring":"/**\n * Determine which source sets of the [resolvedRootMppDependency] are visible in the [visibleFromSourceSet] source set.\n *\n * This requires resolving dependencies of the compilations which [visibleFromSourceSet] takes part in, in order to find which variants the\n * [resolvedRootMppDependency] got resolved to for those compilations.\n *\n * Once the variants are known, they are checked against the [dependencyProjectStructureMetadata], and the\n * source sets of the dependency are determined that are compiled for all those variants and thus should be visible here.\n *\n * If the [resolvedRootMppDependency] is a project dependency, its project should be passed as [resolvedToOtherProject], as\n * the Gradle API for dependency variants behaves differently for project dependencies and published ones.\n */"} {"signature":"private infix fun ComponentIdentifier . isEqualsIgnoringVersion ( that : ComponentIdentifier ) : Boolean","body":"{ if ( this is ProjectComponentIdentifier && that is ProjectComponentIdentifier ) return this == that if ( this is ModuleComponentIdentifier && that is ModuleComponentIdentifier ) return this . moduleIdentifier == that . moduleIdentifier return false }","docstring":"/**\n * Returns true when two components identifiers are from the same maven module (group + name)\n * Gradle projects can't be resolved into multiple versions since there is only one version of a project in gradle build\n */"} {"signature":"private fun needSuspendConversion ( type : IrSimpleType , function : FirFunction ) : Boolean","body":"{ return type . isSuspendFunction ( ) && ! function . isSuspend }","docstring":"/**\n * For example,\n * fun referenceConsumer(f: suspend () -> Unit) = ...\n * fun nonSuspendFunction(...) = ...\n * fun useSite(...) = { ... referenceConsumer(::nonSuspendFunction) ... }\n *\n * At the use site, instead of referenced, we can put the suspend lambda as an adapter.\n */"} {"signature":"private fun needCoercionToUnit ( type : IrSimpleType , function : FirFunction ) : Boolean","body":"{ val expectedReturnType = type . arguments . last ( ) . typeOrNull val actualReturnType = function . returnTypeRef . coneType return expectedReturnType ? . isUnit ( ) == true && ! actualReturnType . isUnit && actualReturnType . toSymbol ( c . session ) !is FirTypeParameterSymbol }","docstring":"/**\n * For example,\n * fun referenceConsumer(f: () -> Unit) = f()\n * fun referenced(...): Any { ... }\n * fun useSite(...) = { ... referenceConsumer(::referenced) ... }\n *\n * At the use site, instead of referenced, we can put the adapter: { ... -> referenced(...) }\n */"} {"signature":"private fun hasVarargOrDefaultArguments ( callableReferenceAccess : FirCallableReferenceAccess ) : Boolean","body":"{ val calleeReference = callableReferenceAccess . calleeReference as? FirResolvedCallableReference ? : return false return calleeReference . mappedArguments . any { ( _ , value ) -> value is ResolvedCallArgument . VarargArgument || value is ResolvedCallArgument . DefaultArgument } }","docstring":"/**\n * For example,\n * fun referenceConsumer(f: (Char, Char) -> String): String = ... // e.g., f(char1, char2)\n * fun referenced(vararg xs: Char) = ...\n * fun useSite(...) = { ... referenceConsumer(::referenced) ... }\n *\n * At the use site, instead of referenced, we can put the adapter: { a, b -> referenced(a, b) }\n */"} {"signature":"internal fun IrExpression . applySuspendConversionIfNeeded ( argument : FirExpression , parameterType : ConeKotlinType ) : IrExpression","body":"{ if ( this is IrBlock && origin == IrStatementOrigin . ADAPTED_FUNCTION_REFERENCE ) { return this } if ( ! parameterType . isSuspendOrKSuspendFunctionType ( session ) ) { return this } val expectedFunctionalType = parameterType . customFunctionTypeToSimpleFunctionType ( session ) if ( this is IrVararg ) { return applyConversionOnVararg ( argument ) { firVarargArgument -> applySuspendConversionIfNeeded ( firVarargArgument , parameterType ) } } val invokeSymbol = findInvokeSymbol ( expectedFunctionalType , argument ) ? : return this val suspendConvertedType = parameterType . toIrType ( c ) as IrSimpleType return argument . convertWithOffsets { startOffset , endOffset -> val irAdapterFunction = createAdapterFunctionForArgument ( startOffset , endOffset , suspendConvertedType , type , invokeSymbol ) val irAdapterRef = IrFunctionReferenceImpl ( startOffset , endOffset , suspendConvertedType , irAdapterFunction . symbol , irAdapterFunction . typeParameters . size , irAdapterFunction . valueParameters . size , null , IrStatementOrigin . SUSPEND_CONVERSION ) IrBlockImpl ( startOffset , endOffset , suspendConvertedType , IrStatementOrigin . SUSPEND_CONVERSION ) . apply { statements . add ( irAdapterFunction ) statements . add ( irAdapterRef . apply { extensionReceiver = this@applySuspendConversionIfNeeded } ) } } }","docstring":"/**\n * For example,\n * fun consumer(f: suspend () -> Unit) = ...\n * fun nonSuspendFunction = { ... }\n * fun useSite(...) = { ... consumer(nonSuspendFunction) ... }\n *\n * At the use site, instead of the argument, we can put the suspend lambda as an adapter.\n *\n * Instead of functions, a subtype of functional type can be used too:\n * class Foo {\n * override fun invoke() = ...\n * }\n * fun useSite(...) = { ... consumer(Foo()) ... }\n */"} {"signature":"inline fun < reified T : Number > amin ( a : KtNDArray < T > ) : T","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( a ) , kClass = T :: class )","docstring":"/**\n * Return the minimum of an array or minimum along an axis.\n */"} {"signature":"inline fun < reified T : Number > amax ( a : KtNDArray < T > ) : T","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( a ) , kClass = T :: class )","docstring":"/**\n * Return the maximum of an array or maximum along an axis.\n */"} {"signature":"fun < T : Number > nanmin ( a : KtNDArray < T > ) : Double","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( a ) , kClass = Double :: class )","docstring":"/**\n * Return minimum of an array or minimum along an axis, ignoring any NaNs.\n */"} {"signature":"fun < T : Number > nanmax ( a : KtNDArray < T > ) : Double","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( a ) , kClass = Double :: class )","docstring":"/**\n * Return the maximum of an array or maximum along an axis, ignoring any NaNs.\n */"} {"signature":"fun < T : Number > ptp ( a : KtNDArray < T > , axis : Int ) : KtNDArray < T >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( a , axis ) )","docstring":"/**\n * Range of values (maximum - minimum) along an axis.\n */"} {"signature":"fun < T : Number > percentile ( a : KtNDArray < T > , q : Double ) : Double","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( a , q ) , kClass = Double :: class )","docstring":"/**\n * Compute the q-th percentile of the data along the specified axis.\n */"} {"signature":"fun < T : Number > nanPercentile ( a : KtNDArray < T > , q : Double ) : Double","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( a , q ) , kClass = Double :: class )","docstring":"/**\n *\n */"} {"signature":"fun < T : Number > nanPercentile ( a : KtNDArray < T > , q : Double , axis : Int ) : KtNDArray < Double >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( a , q , axis ) )","docstring":"/**\n * Compute the qth percentile of the data along the specified axis, while ignoring nan values.\n */"} {"signature":"fun < T : Number > quantile ( a : KtNDArray < T > , q : Double ) : Double","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( a , q ) , kClass = Double :: class )","docstring":"/**\n * Compute the q-th quantile of the data along the specified axis.\n */"} {"signature":"fun < T : Number > nanQuantile ( a : KtNDArray < T > , q : Double ) : Double","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( a , q ) , kClass = Double :: class )","docstring":"/**\n * Compute the qth quantile of the data along the specified axis, while ignoring nan values.\n */"} {"signature":"public fun < T > intercept ( column : ColumnReference < T > , ) : PositionalMapping < T >","body":"{ return addPositionalMapping < T > ( INTERCEPT , column . name ( ) , null ) }","docstring":"/**\n * Maps the `intercept` 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 > intercept ( column : KProperty < T > , ) : PositionalMapping < T >","body":"{ return addPositionalMapping < T > ( INTERCEPT , column . name , null ) }","docstring":"/**\n * Maps the `intercept` 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 intercept ( column : String , ) : PositionalMapping < Any ? >","body":"{ return addPositionalMapping < Any ? > ( INTERCEPT , column , null ) }","docstring":"/**\n * Maps the `intercept` 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 > intercept ( values : Iterable < T > , ) : PositionalMapping < T >","body":"{ return addPositionalMapping < T > ( INTERCEPT , values . toList ( ) , null , null ) }","docstring":"/**\n * Maps the `intercept` 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 > intercept ( values : DataColumn < T > , ) : PositionalMapping < T >","body":"{ return addPositionalMapping < T > ( INTERCEPT , values , null ) }","docstring":"/**\n * Maps the `intercept` 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 abstract fun substitute ( substitutor : KtSubstitutor ) : KtCallableSignature < S >","body":"public abstract fun substitute ( substitutor : KtSubstitutor ) : KtCallableSignature < S >","docstring":"/**\n * Applies a [substitutor] to the given signature and return a new signature with substituted types.\n *\n * @see KtSubstitutor.substitute\n */"} {"signature":"public abstract override fun close ( )","body":"public abstract override fun close ( )","docstring":"/**\n * Closes this coroutine dispatcher and shuts down its executor.\n *\n * It may throw an exception if this dispatcher is global and cannot be closed.\n */"} {"signature":"@ JvmName ( \"\" ) public fun ExecutorService . asCoroutineDispatcher ( ) : ExecutorCoroutineDispatcher","body":"= ExecutorCoroutineDispatcherImpl ( this )","docstring":"/**\n * Converts an instance of [ExecutorService] to an implementation of [ExecutorCoroutineDispatcher].\n *\n * ## Interaction with [delay] and time-based coroutines.\n *\n * If the given [ExecutorService] is an instance of [ScheduledExecutorService], then all time-related\n * coroutine operations such as [delay], [withTimeout] and time-based [Flow] operators will be scheduled\n * on this executor using [schedule][ScheduledExecutorService.schedule] method. If the corresponding\n * coroutine is cancelled, [ScheduledFuture.cancel] will be invoked on the corresponding future.\n *\n * If the given [ExecutorService] is an instance of [ScheduledThreadPoolExecutor], then prior to any scheduling,\n * remove on cancel policy will be set via [ScheduledThreadPoolExecutor.setRemoveOnCancelPolicy] in order\n * to reduce the memory pressure of cancelled coroutines.\n *\n * If the executor service is neither of this types, the separate internal thread will be used to\n * _track_ the delay and time-related executions, but the coroutine itself will still be executed\n * on top of the given executor.\n *\n * ## Rejected execution\n * If the underlying executor throws [RejectedExecutionException] on\n * attempt to submit a continuation task (it happens when [closing][ExecutorCoroutineDispatcher.close] the\n * resulting dispatcher, on underlying executor [shutdown][ExecutorService.shutdown], or when it uses limited queues),\n * then the [Job] of the affected task is [cancelled][Job.cancel] and the task is submitted to the\n * [Dispatchers.IO], so that the affected coroutine can cleanup its resources and promptly complete.\n */"} {"signature":"@ JvmName ( \"\" ) public fun Executor . asCoroutineDispatcher ( ) : CoroutineDispatcher","body":"= ( this as? DispatcherExecutor ) ? . dispatcher ? : ExecutorCoroutineDispatcherImpl ( this )","docstring":"/**\n * Converts an instance of [Executor] to an implementation of [CoroutineDispatcher].\n *\n * ## Interaction with [delay] and time-based coroutines.\n *\n * If the given [Executor] is an instance of [ScheduledExecutorService], then all time-related\n * coroutine operations such as [delay], [withTimeout] and time-based [Flow] operators will be scheduled\n * on this executor using [schedule][ScheduledExecutorService.schedule] method. If the corresponding\n * coroutine is cancelled, [ScheduledFuture.cancel] will be invoked on the corresponding future.\n *\n * If the given [Executor] is an instance of [ScheduledThreadPoolExecutor], then prior to any scheduling,\n * remove on cancel policy will be set via [ScheduledThreadPoolExecutor.setRemoveOnCancelPolicy] in order\n * to reduce the memory pressure of cancelled coroutines.\n *\n * If the executor is neither of this types, the separate internal thread will be used to\n * _track_ the delay and time-related executions, but the coroutine itself will still be executed\n * on top of the given executor.\n *\n * ## Rejected execution\n *\n * If the underlying executor throws [RejectedExecutionException] on\n * attempt to submit a continuation task (it happens when [closing][ExecutorCoroutineDispatcher.close] the\n * resulting dispatcher, on underlying executor [shutdown][ExecutorService.shutdown], or when it uses limited queues),\n * then the [Job] of the affected task is [cancelled][Job.cancel] and the task is submitted to the\n * [Dispatchers.IO], so that the affected coroutine can cleanup its resources and promptly complete.\n */"} {"signature":"public fun CoroutineDispatcher . asExecutor ( ) : Executor","body":"= ( this as? ExecutorCoroutineDispatcher ) ? . executor ? : DispatcherExecutor ( this )","docstring":"/**\n * Converts an instance of [CoroutineDispatcher] to an implementation of [Executor].\n *\n * It returns the original executor when used on the result of [Executor.asCoroutineDispatcher] extensions.\n */"} {"signature":"@ JvmName ( \"\" ) internal fun resetStateReusable ( ) : Boolean","body":"{ assert { resumeMode == MODE_CANCELLABLE_REUSABLE } assert { parentHandle !== NonDisposableHandle } val state = _state . value assert { state !is NotCompleted } if ( state is CompletedContinuation && state . idempotentResume != null ) { detachChild ( ) return false } _decisionAndIndex . value = decisionAndIndex ( UNDECIDED , NO_INDEX ) _state . value = Active return true }","docstring":"/**\n * Resets cancellability state in order to [suspendCancellableCoroutineReusable] to work.\n * Invariant: used only by [suspendCancellableCoroutineReusable] in [REUSABLE_CLAIMED] state.\n */"} {"signature":"open fun getContinuationCancellationCause ( parent : Job ) : Throwable","body":"= parent . getCancellationException ( )","docstring":"/**\n * It is used when parent is cancelled to get the cancellation cause for this continuation.\n */"} {"signature":"internal fun releaseClaimedReusableContinuation ( )","body":"{ val cancellationCause = ( delegate as? DispatchedContinuation < * > ) ? . tryReleaseClaimedContinuation ( this ) ? : return detachChild ( ) cancel ( cancellationCause ) }","docstring":"/**\n * Tries to release reusable continuation. It can fail is there was an asynchronous cancellation,\n * in which case it detaches from the parent and cancels this continuation.\n */"} {"signature":"override fun invokeOnCancellation ( segment : Segment < * > , index : Int )","body":"{ _decisionAndIndex . update { check ( it . index == NO_INDEX ) { \"\" } decisionAndIndex ( it . decision , index ) } invokeOnCancellationImpl ( segment ) }","docstring":"/**\n * An optimized version for the code below that does not allocate\n * a cancellation handler object and efficiently stores the specified\n * [segment] and [index] in this [CancellableContinuationImpl].\n *\n * The only difference is that `segment.onCancellation(..)` is never\n * called if this continuation is already completed;\n *\n * ```\n * invokeOnCancellation { cause ->\n * segment.onCancellation(index, cause)\n * }\n * ```\n */"} {"signature":"private fun tryResumeImpl ( proposedUpdate : Any ? , idempotent : Any ? , onCancellation : ( ( cause : Throwable ) -> Unit ) ? ) : Symbol ?","body":"{ _state . loop { state -> when ( state ) { is NotCompleted -> { val update = resumedState ( state , proposedUpdate , resumeMode , onCancellation , idempotent ) if ( ! _state . compareAndSet ( state , update ) ) return@loop detachChildIfNonResuable ( ) return RESUME_TOKEN } is CompletedContinuation -> { return if ( idempotent != null && state . idempotentResume === idempotent ) { assert { state . result == proposedUpdate } RESUME_TOKEN } else { null } } else -> return null } } }","docstring":"/**\n * Similar to [tryResume], but does not actually completes resume (needs [completeResume] call).\n * Returns [RESUME_TOKEN] when resumed, `null` when it was already resumed or cancelled.\n */"} {"signature":"internal fun detachChild ( )","body":"{ val handle = parentHandle ? : return handle . dispose ( ) _parentHandle . value = NonDisposableHandle }","docstring":"/**\n * Detaches from the parent.\n */"} {"signature":"fun invoke ( cause : Throwable ? )","body":"fun invoke ( cause : Throwable ? )","docstring":"/**\n * Signals cancellation.\n *\n * This function:\n * - Does not throw any exceptions.\n * Violating this rule in an implementation leads to [handleUncaughtCoroutineException] being called with a\n * [CompletionHandlerException] wrapping the thrown exception.\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 continuation was cancelled directly via [CancellableContinuation.cancel] without a `cause`.\n * - It is an instance of [CancellationException] if the continuation was _normally_ cancelled from the outside.\n * **It should not be treated as an error**. In particular, it should not be reported to error logs.\n * - Otherwise, the continuation had cancelled with an _error_.\n */"} {"signature":"override fun invoke ( cause : Throwable ? )","body":"{ handler ( cause ) }","docstring":"/** @suppress */"} {"signature":"internal fun List < SerialDescriptor > ? . compactArray ( ) : Array < SerialDescriptor >","body":"= takeUnless { it . isNullOrEmpty ( ) } ? . toTypedArray ( ) ? : EMPTY_DESCRIPTOR_ARRAY","docstring":"/**\n * Same as [toTypedArray], but uses special empty array constant, if [this]\n * is null or empty.\n */"} {"signature":"internal expect fun < T : Any > KClass < T > . constructSerializerForGivenTypeArgs ( vararg args : KSerializer < Any ? > ) : KSerializer < T > ?","body":"internal expect fun < T : Any > KClass < T > . constructSerializerForGivenTypeArgs ( vararg args : KSerializer < Any ? > ) : KSerializer < T > ?","docstring":"/**\n * Constructs KSerializer> by given KSerializer, KSerializer, ...\n * via reflection (on JVM) or compiler+plugin intrinsic `SerializerFactory` (on Native)\n */"} {"signature":"internal expect fun isReferenceArray ( rootClass : KClass < Any > ) : Boolean","body":"internal expect fun isReferenceArray ( rootClass : KClass < Any > ) : Boolean","docstring":"/**\n * Checks whether given KType and its corresponding KClass represent a reference array\n */"} {"signature":"internal expect fun < T > Array < T > . getChecked ( index : Int ) : T","body":"internal expect fun < T > Array < T > . getChecked ( index : Int ) : T","docstring":"/**\n * Array.get that checks indices on JS\n */"} {"signature":"internal expect fun BooleanArray . getChecked ( index : Int ) : Boolean","body":"internal expect fun BooleanArray . getChecked ( index : Int ) : Boolean","docstring":"/**\n * Array.get that checks indices on JS\n */"} {"signature":"internal expect fun < T > createCache ( factory : ( KClass < * > ) -> KSerializer < T > ? ) : SerializerCache < T >","body":"internal expect fun < T > createCache ( factory : ( KClass < * > ) -> KSerializer < T > ? ) : SerializerCache < T >","docstring":"/**\n * Create serializers cache for non-parametrized and non-contextual serializers.\n * The activity and type of cache is determined for a specific platform and a specific environment.\n */"} {"signature":"internal expect fun < T > createParametrizedCache ( factory : ( KClass < Any > , List < KType > ) -> KSerializer < T > ? ) : ParametrizedSerializerCache < T >","body":"internal expect fun < T > createParametrizedCache ( factory : ( KClass < Any > , List < KType > ) -> KSerializer < T > ? ) : ParametrizedSerializerCache < T >","docstring":"/**\n * Create serializers cache for parametrized and non-contextual serializers. Parameters also non-contextual.\n * The activity and type of cache is determined for a specific platform and a specific environment.\n */"} {"signature":"fun get ( key : KClass < Any > ) : KSerializer < T > ?","body":"fun get ( key : KClass < Any > ) : KSerializer < T > ?","docstring":"/**\n * Returns cached serializer or `null` if serializer not found.\n */"} {"signature":"fun get ( key : KClass < Any > , types : List < KType > = emptyList ( ) ) : Result < KSerializer < T > ? >","body":"fun get ( key : KClass < Any > , types : List < KType > = emptyList ( ) ) : Result < KSerializer < T > ? >","docstring":"/**\n * Returns successful result with cached serializer or `null` if root serializer not found.\n * If no serializer was found for the parameters, then result contains an exception.\n */"} {"signature":"fun getClassId ( ) : ClassId ?","body":"fun getClassId ( ) : ClassId ?","docstring":"/**\n * Return [ClassId], if the class is not local (E.e, if a class can be accessed by that [ClassId] from another context)\n *\n * For classes that itself local (are declared inside a function or other local scope), returns `null`.\n * For nested classes in local classes returns `null`.\n * For KtEnumEntry returns null as enum entry is not a class semantically. And so, for nested classes in enum entry, returns `null`.\n * Otherwise, returns non-null [ClassId].\n *\n * For returned ClassId, the [ClassId.isLocal] is always `false`.\n */"} {"signature":"fun initIdeaConfiguration ( )","body":"{ System . setProperty ( \"\" , computeHomeDirectory ( ) ) System . setProperty ( \"\" , \"\" ) }","docstring":"/**\n * For proper initialization of idea services those two properties should\n * be set in environment of test. You can setup them manually via build\n * system of run configurations or just `initIdeaConfiguration` before\n * running tests using abilities of core test framework you use\n */"} {"signature":"internal fun Scale . wrap ( aes : Aesthetic , domainType : KType , scaleParameters : ScaleParameters ? , isGroupKey : Boolean , ) : org . jetbrains . letsPlot . intern . Scale","body":"{ return when ( this ) { is PositionalScale < * > -> { val naValue = if ( this is ContinuousScale < * > ) { wrapValue ( nullValue ) } else { null } val axis = scaleParameters as? Axis < * > ? val name = axis ? . name val breaks = axis ? . breaks val labels = axis ? . labels val format = axis ? . format val expand = axis ? . expand val position = axis ? . position ? . let { when ( it ) { AxisPosition . DEFAULT -> null AxisPosition . OPPOSITE -> when ( aes ) { X -> \"\" Y -> \"\" else -> null } AxisPosition . BOTH -> \"\" } } when ( this ) { is PositionalCategoricalScale < * > -> { when ( aes ) { X -> scaleXDiscrete ( limits = categories ? . wrap ( ) , name = name , breaks = breaks ? . wrap ( ) , labels = labels , format = format , expand = expand , position = position ) Y -> scaleYDiscrete ( limits = categories ? . wrap ( ) , name = name , breaks = breaks ? . wrap ( ) , labels = labels , format = format , expand = expand , position = position ) else -> TODO ( \"\" ) } } is PositionalContinuousScale < * > -> { when ( aes ) { X -> if ( domainType in dateTimeTypes ) { scaleXDateTime ( limits = ( min to max ) . wrap ( ) , name = name , breaks = breaks ? . filterNotNull ( ) , labels = labels , format = format , expand = expand , position = position ) } else if ( domainType in timeTypes ) { scaleXTime ( limits = ( min to max ) . wrap ( ) , name = name , breaks = breaks ? . filterNotNull ( ) , labels = labels , expand = expand , position = position ) } else { scaleXContinuous ( limits = ( min to max ) . wrap ( ) , name = name , breaks = breaks ? . map { it as Number } , labels = labels , trans = ( transform as? Transformation ) ? . name , format = format , expand = expand , naValue = naValue as? Number , position = position ) } Y -> if ( domainType in dateTimeTypes ) { scaleYDateTime ( limits = ( min to max ) . wrap ( ) , name = name , breaks = breaks ? . wrap ( ) , labels = labels , format = format , expand = expand , naValue = naValue , position = position ) } else if ( domainType in timeTypes ) { scaleYTime ( limits = ( min to max ) . wrap ( ) , name = name , breaks = breaks ? . filterNotNull ( ) , labels = labels , expand = expand , position = position ) } else { scaleYContinuous ( limits = ( min to max ) . wrap ( ) , name = name , breaks = breaks ? . map { it as Number } , labels = labels , trans = ( transform as? Transformation ) ? . name , format = format , expand = expand , naValue = naValue as? Number , position = position ) } else -> TODO ( ) } } is PositionalDefaultScale < * > -> if ( domainType . isCategoricalType ( ) || isGroupKey ) { PositionalCategoricalScale < String > ( null ) . wrap ( aes , domainType , scaleParameters , isGroupKey ) } else { PositionalContinuousScale < Double > ( null , null , null , null ) . wrap ( aes , domainType , scaleParameters , isGroupKey ) } } } is NonPositionalScale < * , * > -> { val naValue = if ( this is ContinuousScale < * > ) { wrapValue ( nullValue ) } else { ( this as? NonPositionalCategoricalScale < * , * > ) ? . domainCategories ? . indexOf ( null ) ? . let { if ( it == - ) { null } else rangeValues ? . get ( it ) ? . let { wrapValue ( it ) } } } val legend = scaleParameters as? Legend < * , * > ? val name = legend ? . name val breaks = legend ? . breaks val labels = legend ? . labels val format = legend ? . format val legendType = legend ? . type ? . let { when ( it ) { is LegendType . None -> \"\" is LegendType . ColorBar -> guideColorbar ( barHeight = it . barHeight , barWidth = it . barWidth , nbin = it . nBin ) is LegendType . DiscreteLegend -> guideLegend ( nrow = it . nRow , ncol = it . nCol , byRow = it . byRow ) } } when ( this ) { is NonPositionalDefaultScale < * , * > -> if ( this is NonPositionalDefaultCategoricalScale < * , * > || domainType . isCategoricalType ( ) || aes in discreteAes || isGroupKey ) { NonPositionalCategoricalScale < String , String > ( null , null ) . wrap ( aes , domainType , scaleParameters , isGroupKey ) } else { NonPositionalContinuousScale < Double , Double > ( null , null , null , null , null , null ) . wrap ( aes , domainType , scaleParameters , isGroupKey ) } is NonPositionalCategoricalScale < * , * > -> { when ( aes ) { SIZE -> if ( rangeValues != null ) { scaleSizeManual ( values = rangeValues ! ! . map { it as Number } , limits = domainCategories ? . wrap ( ) , name = name , breaks = breaks ? . wrap ( ) , labels = labels , guide = legendType , format = format , naValue = naValue as? Number ) } else { org . jetbrains . letsPlot . intern . Scale ( Aes . SIZE , limits = domainCategories ? . wrap ( ) , name = name , breaks = breaks ? . wrap ( ) , labels = labels , guide = legendType , format = format , ) } COLOR -> { if ( rangeValues == null ) { scaleColorDiscrete ( limits = domainCategories ? . wrap ( ) , name = name , breaks = breaks ? . wrap ( ) , labels = labels , guide = legendType , format = format , naValue = naValue ) } else { scaleColorManual ( limits = domainCategories ? . wrap ( ) , values = rangeValues ! ! . map { ( it as Color ) . wrap ( ) } , name = name , breaks = breaks ? . wrap ( ) , labels = labels , guide = legendType , format = format , naValue = naValue ) } } FILL -> { if ( rangeValues == null ) { scaleFillDiscrete ( limits = domainCategories ? . wrap ( ) , name = name , breaks = breaks ? . wrap ( ) , labels = labels , guide = legendType , format = format , naValue = naValue ) } else { scaleFillManual ( limits = domainCategories ? . wrap ( ) , values = rangeValues ! ! . map { ( it as Color ) . wrap ( ) } , name = name , breaks = breaks ? . wrap ( ) , labels = labels , guide = legendType , format = format , naValue = naValue ) } } ALPHA -> if ( rangeValues != null ) { scaleAlphaManual ( limits = domainCategories ? . wrap ( ) , values = rangeValues ! ! . map { it as Double } , name = name , breaks = breaks ? . wrap ( ) , labels = labels , guide = legendType , format = format , naValue = naValue as? Number ) } else { org . jetbrains . letsPlot . intern . Scale ( Aes . ALPHA , limits = domainCategories ? . wrap ( ) , name = name , breaks = breaks ? . wrap ( ) , labels = labels , guide = legendType , format = format , naValue = naValue ) } LINE_TYPE -> if ( rangeValues != null ) { scaleLinetypeManual ( limits = domainCategories ? . wrap ( ) , values = rangeValues ! ! . map { ( it as LineType ) . codeNumber } , name = name , breaks = breaks ? . wrap ( ) , labels = labels , guide = legendType , format = format , naValue = naValue ) } else { org . jetbrains . letsPlot . intern . Scale ( Aes . LINETYPE , limits = domainCategories ? . wrap ( ) , name = name , breaks = breaks ? . wrap ( ) , labels = labels , guide = legendType , format = format , naValue = naValue ) } SHAPE -> if ( rangeValues == null ) { scaleShape ( limits = domainCategories ? . wrap ( ) , name = name , breaks = breaks ? . wrap ( ) , labels = labels , guide = legendType , format = format , naValue = naValue ) } else { scaleShapeManual ( limits = domainCategories ? . wrap ( ) , values = rangeValues ! ! . map { ( it as Symbol ) . shape } , name = name , breaks = breaks ? . wrap ( ) , labels = labels , guide = legendType , format = format , naValue = naValue ) } else -> TODO ( ) } } is NonPositionalContinuousScale < * , * > -> { when ( aes ) { SIZE -> scaleSize ( limits = ( domainMin to domainMax ) . wrap ( ) , range = ( rangeMin to rangeMax ) . computeRange ( ) , name = name , breaks = breaks ? . map { it as Number } , labels = labels , guide = legendType , trans = ( transform as Transformation ? ) ? . name , format = format , naValue = naValue as? Number ) STROKE -> scaleStroke ( range = ( rangeMin to rangeMax ) . computeRange ( ) , name = name , breaks = breaks ? . map { it as? Number } , labels = labels , limits = ( domainMin to domainMax ) . wrap ( ) , naValue = naValue as? Number , format = format , guide = legendType , trans = ( transform as? Transformation ) ? . name ) COLOR -> { val lowColor = ( rangeMin as? Color ) ? . wrap ( ) val highColor = ( rangeMax as? Color ) ? . wrap ( ) val limits = ( domainMin to domainMax ) . wrap ( ) org . jetbrains . letsPlot . intern . Scale ( aesthetic = Aes . COLOR , name = name , breaks = breaks ? . map { it . toString ( ) } , labels = labels , limits = limits , naValue = naValue , format = format , guide = legendType , trans = ( transform as Transformation ? ) ? . name , otherOptions = Options ( mapOf ( Option . Scale . LOW to lowColor , Option . Scale . HIGH to highColor , Option . Scale . SCALE_MAPPER_KIND to Option . Scale . MapperKind . COLOR_GRADIENT ) ) ) } FILL -> { val lowColor = ( rangeMin as? Color ) ? . wrap ( ) val highColor = ( rangeMax as? Color ) ? . wrap ( ) val limits = ( domainMin to domainMax ) . wrap ( ) org . jetbrains . letsPlot . intern . Scale ( aesthetic = Aes . FILL , name = name , breaks = breaks ? . map { it . toString ( ) } , labels = labels , limits = limits , naValue = naValue , format = format , guide = legendType , trans = ( transform as Transformation ? ) ? . name , otherOptions = Options ( mapOf ( Option . Scale . LOW to lowColor , Option . Scale . HIGH to highColor , Option . Scale . SCALE_MAPPER_KIND to Option . Scale . MapperKind . COLOR_GRADIENT ) ) ) } ALPHA -> scaleAlpha ( limits = ( domainMin to domainMax ) . wrap ( ) , range = ( rangeMin to rangeMax ) . wrap ( ) as Pair < Number , Number > ? , name = name , breaks = breaks ? . map { it as Number } , labels = labels , guide = legendType , trans = ( transform as Transformation ? ) ? . name , format = format , naValue = naValue as? Number ) else -> TODO ( ) } } is CustomScale -> when ( this ) { is ScaleColorGrey < * > -> when ( aes ) { COLOR -> scaleColorGrey ( paletteRange ? . first , paletteRange ? . second , name = name , breaks = breaks ? . map { it as Number } , labels = labels , guide = legendType , limits = domainLimits . wrap ( ) , trans = transform ? . name , format = format , naValue = naValue ) FILL -> scaleFillGrey ( paletteRange ? . first , paletteRange ? . second , name = name , breaks = breaks ? . map { it as Number } , labels = labels , guide = legendType , limits = domainLimits . wrap ( ) , trans = transform ? . name , format = format , naValue = naValue ) else -> TODO ( ) } is ScaleColorHue < * > -> when ( aes ) { COLOR -> scaleColorHue ( huesRange , chroma , luminance , hueStart , direction ? . value , name = name , breaks = breaks ? . map { it as Number } , labels = labels , guide = legendType , limits = domainLimits . wrap ( ) , trans = transform ? . name , format = format , naValue = naValue ) FILL -> scaleFillHue ( huesRange , chroma , luminance , hueStart , direction ? . value , name = name , breaks = breaks ? . map { it as Number } , labels = labels , guide = legendType , limits = domainLimits . wrap ( ) , trans = transform ? . name , format = format , naValue = naValue ) else -> TODO ( ) } is ScaleColorBrewer < * > -> when ( aes ) { COLOR -> scaleColorBrewer ( type = null , palette = palette ? . name , name = name , breaks = breaks ? . map { it as Number } , labels = labels , guide = legendType , limits = limits , trans = transform ? . name , format = format , naValue = naValue ) FILL -> scaleFillBrewer ( type = null , palette = palette ? . name , name = name , breaks = breaks ? . map { it as Number } , labels = labels , guide = legendType , limits = limits , trans = transform ? . name , format = format , naValue = naValue ) else -> TODO ( ) } is ScaleColorViridis < * > -> { val option = colormap . name . lowercase ( ) val begin = hueRange . start val end = hueRange . endInclusive val direction = direction . value val trans = ( this as? ScaleContinuousColorViridis < * > ) ? . transform ? . name when ( aes ) { COLOR -> scaleColorViridis ( option = option , alpha = null , begin = begin , end = end , direction = direction , name = name , breaks = breaks ? . map { it as Number } , labels = labels , guide = legendType , limits = limits , trans = trans , format = format , naValue = naValue ) FILL -> scaleFillViridis ( option = option , alpha = null , begin = begin , end = end , direction = direction , name = name , breaks = breaks ? . map { it as Number } , labels = labels , guide = legendType , limits = limits , trans = trans , format = format , naValue = naValue ) else -> TODO ( ) } } is ScaleContinuousColorGradient2 < * > -> when ( aes ) { COLOR -> scaleColorGradient2 ( low . wrap ( ) , mid . wrap ( ) , high . wrap ( ) , midpoint , name = name , breaks = breaks ? . map { it as Number } , labels = labels , guide = legendType , limits = domainLimits . wrap ( ) , trans = transform ? . name , format = format , naValue = naValue ) FILL -> scaleFillGradient2 ( low . wrap ( ) , mid . wrap ( ) , high . wrap ( ) , midpoint , name = name , breaks = breaks ? . map { it as Number } , labels = labels , guide = legendType , limits = domainLimits . wrap ( ) , trans = transform ? . name , format = format , naValue = naValue ) else -> TODO ( ) } is ScaleContinuousColorGradientN < * > -> when ( aes ) { COLOR -> scaleColorGradientN ( rangeColors . map { it . wrap ( ) } , name = name , breaks = breaks ? . map { it as Number } , labels = labels , guide = legendType , limits = domainLimits . wrap ( ) , trans = transform ? . name , format = format , naValue = naValue ) FILL -> scaleFillGradientN ( rangeColors . map { it . wrap ( ) } , name = name , breaks = breaks ? . map { it as Number } , labels = labels , guide = legendType , limits = domainLimits . wrap ( ) , trans = transform ? . name , format = format , naValue = naValue ) else -> TODO ( ) } else -> TODO ( ) } else -> TODO ( ) } } else -> TODO ( \"\" ) } }","docstring":"/**\n * TODO datetime\n */"} {"signature":"@ ExperimentalCoroutinesApi @ DelicateCoroutinesApi public fun newSingleThreadContext ( name : String ) : CloseableCoroutineDispatcher","body":"= newFixedThreadPoolContext ( , name )","docstring":"/**\n * Creates a coroutine execution context using a single thread with built-in [yield] support.\n * **NOTE: The resulting [CloseableCoroutineDispatcher] owns native resources (its thread).\n * Resources are reclaimed by [CloseableCoroutineDispatcher.close].**\n *\n * If the resulting dispatcher is [closed][CloseableCoroutineDispatcher.close] and\n * attempt to submit a task is made, then:\n * - On the JVM, the [Job] of the affected task is [cancelled][Job.cancel] and the task is submitted to the\n * [Dispatchers.IO], so that the affected coroutine can clean up its resources and promptly complete.\n * - On Native, the attempt to submit a task throws an exception.\n *\n * This is a **delicate** API. The result of this method is a closeable resource with the\n * associated native resources (threads or native workers). It should not be allocated in place,\n * should be closed at the end of its lifecycle, and has non-trivial memory and CPU footprint.\n * If you do not need a separate thread pool, but only have to limit effective parallelism of the dispatcher,\n * it is recommended to use [CoroutineDispatcher.limitedParallelism] instead.\n *\n * If you need a completely separate thread pool with scheduling policy that is based on the standard\n * JDK executors, use the following expression:\n * `Executors.newSingleThreadExecutor().asCoroutineDispatcher()`.\n * See `Executor.asCoroutineDispatcher` for details.\n *\n * @param name the base name of the created thread.\n */"} {"signature":"@ ExperimentalCoroutinesApi public expect fun newFixedThreadPoolContext ( nThreads : Int , name : String ) : CloseableCoroutineDispatcher","body":"@ ExperimentalCoroutinesApi public expect fun newFixedThreadPoolContext ( nThreads : Int , name : String ) : CloseableCoroutineDispatcher","docstring":"/**\n * Creates a coroutine execution context with the fixed-size thread-pool and built-in [yield] support.\n * **NOTE: The resulting [CoroutineDispatcher] owns native resources (its threads).\n * Resources are reclaimed by [CloseableCoroutineDispatcher.close].**\n *\n * If the resulting dispatcher is [closed][CloseableCoroutineDispatcher.close] and\n * attempt to submit a continuation task is made,\n * - On the JVM, the [Job] of the affected task is [cancelled][Job.cancel] and the task is submitted to the\n * [Dispatchers.IO], so that the affected coroutine can clean up its resources and promptly complete.\n * - On Native, the attempt to submit a task throws an exception.\n *\n * This is a **delicate** API. The result of this method is a closeable resource with the\n * associated native resources (threads or native workers). It should not be allocated in place,\n * should be closed at the end of its lifecycle, and has non-trivial memory and CPU footprint.\n * If you do not need a separate thread pool, but only have to limit effective parallelism of the dispatcher,\n * it is recommended to use [CoroutineDispatcher.limitedParallelism] instead.\n *\n * If you need a completely separate thread pool with scheduling policy that is based on the standard\n * JDK executors, use the following expression:\n * `Executors.newFixedThreadPool().asCoroutineDispatcher()`.\n * See `Executor.asCoroutineDispatcher` for details.\n *\n * @param nThreads the number of threads.\n * @param name the base name of the created threads.\n */"} {"signature":"public operator fun get ( index : Int ) : ULong","body":"= storage [ index ] . toULong ( )","docstring":"/**\n * Returns the array element at the given [index]. This method can be called using the index operator.\n *\n * If the [index] is out of bounds of this array, throws an [IndexOutOfBoundsException] except in Kotlin/JS\n * where the behavior is unspecified.\n */"} {"signature":"public operator fun set ( index : Int , value : ULong )","body":"{ storage [ index ] = value . toLong ( ) }","docstring":"/**\n * Sets the element at the given [index] to the given [value]. This method can be called using the index operator.\n *\n * If the [index] is out of bounds of this array, throws an [IndexOutOfBoundsException] except in Kotlin/JS\n * where the behavior is unspecified.\n */"} {"signature":"public override operator fun iterator ( ) : kotlin . collections . Iterator < ULong >","body":"= Iterator ( storage )","docstring":"/** Creates an iterator over the elements of the array. */"} {"signature":"@ SinceKotlin ( \"\" ) @ ExperimentalUnsignedTypes @ kotlin . internal . InlineOnly public inline fun ULongArray ( size : Int , init : ( Int ) -> ULong ) : ULongArray","body":"{ return ULongArray ( LongArray ( size ) { index -> init ( index ) . toLong ( ) } ) }","docstring":"/**\n * Creates a new array of the specified [size], where each element is calculated by calling the specified\n * [init] function.\n *\n * The function [init] is called for each array element sequentially starting from the first one.\n * It should return the value for an array element given its index.\n */"} {"signature":"public fun < T : Any > contextual ( kClass : KClass < T > , serializer : KSerializer < T > ) : Unit","body":"= contextual ( kClass ) { serializer }","docstring":"/**\n * Accept a serializer, associated with [kClass] for contextual serialization.\n */"} {"signature":"public fun < T : Any > contextual ( kClass : KClass < T > , provider : ( typeArgumentsSerializers : List < KSerializer < * > > ) -> KSerializer < * > )","body":"public fun < T : Any > contextual ( kClass : KClass < T > , provider : ( typeArgumentsSerializers : List < KSerializer < * > > ) -> KSerializer < * > )","docstring":"/**\n * Accept a provider, associated with generic [kClass] for contextual serialization.\n */"} {"signature":"public fun < Base : Any , Sub : Base > polymorphic ( baseClass : KClass < Base > , actualClass : KClass < Sub > , actualSerializer : KSerializer < Sub > )","body":"public fun < Base : Any , Sub : Base > polymorphic ( baseClass : KClass < Base > , actualClass : KClass < Sub > , actualSerializer : KSerializer < Sub > )","docstring":"/**\n * Accept a serializer, associated with [actualClass] for polymorphic serialization.\n */"} {"signature":"public fun < Base : Any > polymorphicDefaultSerializer ( baseClass : KClass < Base > , defaultSerializerProvider : ( value : Base ) -> SerializationStrategy < Base > ? )","body":"public fun < Base : Any > polymorphicDefaultSerializer ( baseClass : KClass < Base > , defaultSerializerProvider : ( value : Base ) -> SerializationStrategy < Base > ? )","docstring":"/**\n * Accept a default serializer provider, associated with the [baseClass] for polymorphic serialization.\n * [defaultSerializerProvider] is invoked when no polymorphic serializers for `value` in the scope of [baseClass] were found.\n *\n * Default serializers provider affects only serialization process. Deserializers are accepted in the\n * [SerializersModuleCollector.polymorphicDefaultDeserializer] method.\n *\n * [defaultSerializerProvider] can be stateful and lookup a serializer for the missing type dynamically.\n */"} {"signature":"public fun < Base : Any > polymorphicDefaultDeserializer ( baseClass : KClass < Base > , defaultDeserializerProvider : ( className : String ? ) -> DeserializationStrategy < Base > ? )","body":"public fun < Base : Any > polymorphicDefaultDeserializer ( baseClass : KClass < Base > , defaultDeserializerProvider : ( className : String ? ) -> DeserializationStrategy < Base > ? )","docstring":"/**\n * Accept a default deserializer provider, associated with the [baseClass] for polymorphic deserialization.\n * [defaultDeserializerProvider] is invoked when no polymorphic serializers associated with the `className`\n * in the scope of [baseClass] were found. `className` could be `null` for formats that support nullable class discriminators\n * (currently only `Json` with `useArrayPolymorphism` set to `false`).\n *\n * Default deserializers provider affects only deserialization process. Serializers are accepted in the\n * [SerializersModuleCollector.polymorphicDefaultSerializer] method.\n *\n * [defaultDeserializerProvider] can be stateful and lookup a serializer for the missing type dynamically.\n */"} {"signature":"@ Deprecated ( \"\" , ReplaceWith ( \"\" ) , DeprecationLevel . WARNING ) public fun < Base : Any > polymorphicDefault ( baseClass : KClass < Base > , defaultDeserializerProvider : ( className : String ? ) -> DeserializationStrategy < Base > ? )","body":"{ polymorphicDefaultDeserializer ( baseClass , defaultDeserializerProvider ) }","docstring":"/**\n * Accept a default deserializer provider, associated with the [baseClass] for polymorphic deserialization.\n *\n * This function affect only deserialization process. To avoid confusion, it was deprecated and replaced with [polymorphicDefaultDeserializer].\n * To affect serialization process, use [SerializersModuleCollector.polymorphicDefaultSerializer].\n *\n * [defaultDeserializerProvider] is invoked when no polymorphic serializers associated with the `className`\n * in the scope of [baseClass] were found. `className` could be `null` for formats that support nullable class discriminators\n * (currently only `Json` with `useArrayPolymorphism` set to `false`).\n *\n * [defaultDeserializerProvider] can be stateful and lookup a serializer for the missing type dynamically.\n *\n * @see SerializersModuleCollector.polymorphicDefaultDeserializer\n * @see SerializersModuleCollector.polymorphicDefaultSerializer\n */"} {"signature":"public fun Layer . freeze ( )","body":"{ if ( this is TrainableLayer ) isTrainable = false }","docstring":"/**\n * Freezes layer weights, so they won't be changed during training.\n */"} {"signature":"public fun Layer . unfreeze ( )","body":"{ require ( this is TrainableLayer ) { \"\" } isTrainable = true }","docstring":"/**\n * Unfreezes layer weights, allowing to change them during training.\n */"} {"signature":"fun < T > systemProperty ( convert : ( String ) -> T ) : ReadOnlyProperty < Any ? , T >","body":"= ReadOnlyProperty { _ , property -> val value = requireNotNull ( System . getProperty ( property . name ) ) { \"\" } convert ( value ) }","docstring":"/**\n * Delegated accessor for a system property.\n *\n * @see System.getProperty\n */"} {"signature":"private inline fun enqueueResolveForExplicitReceiver ( originalCallInfo : CallInfo , crossinline invokeAction : suspend ( FirTowerResolveTask , CallInfo ) -> Unit )","body":"{ val invokeReceiverVariableInfo = originalCallInfo . replaceWithVariableAccess ( ) val towerDataElementsForName = TowerDataElementsForName ( invokeReceiverVariableInfo . name , components . towerDataContext ) enqueueInvokeReceiverTask ( originalCallInfo , invokeReceiverVariableInfo , towerDataElementsForName = towerDataElementsForName , invokeBuiltinExtensionMode = false ) { invokeAction ( it , invokeReceiverVariableInfo ) } val invokeReceiverVariableWithNoReceiverInfo = invokeReceiverVariableInfo . replaceExplicitReceiver ( null ) enqueueInvokeReceiverTask ( originalCallInfo , invokeReceiverVariableWithNoReceiverInfo , towerDataElementsForName = towerDataElementsForName , invokeBuiltinExtensionMode = true ) { it . runResolverForNoReceiver ( invokeReceiverVariableWithNoReceiverInfo , skipSynthetics = true ) } }","docstring":"/**\n * It's whether Qualifier.f() or expressionReceiver.f(), later we name it as \"x.f()\"\n *\n * @param originalCallInfo describes whole \"x.f()\"\n * @param invokeAction runs the process of looking for the receiver \"x.f\" depending on the kind of \"x\" (qualifier or expression)\n */"} {"signature":"private inline fun enqueueInvokeReceiverTask ( info : CallInfo , invokeReceiverInfo : CallInfo , towerDataElementsForName : TowerDataElementsForName = TowerDataElementsForName ( invokeReceiverInfo . name , components . towerDataContext ) , invokeBuiltinExtensionMode : Boolean , crossinline runResolutionForInvokeReceiverVariable : suspend ( FirTowerResolveTask ) -> Unit )","body":"{ val collector = CandidateCollector ( components , components . resolutionStageRunner ) val invokeReceiverProcessor = InvokeReceiverResolveTask ( components , manager , towerDataElementsForName , collector , CandidateFactory ( context , invokeReceiverInfo ) , onSuccessfulLevel = { towerGroup -> enqueueResolverTasksForInvokeReceiverCandidates ( invokeBuiltinExtensionMode , info , receiverGroup = towerGroup , collector ) collector . newDataSet ( ) } ) manager . enqueueResolverTask { runResolutionForInvokeReceiverVariable ( invokeReceiverProcessor ) } }","docstring":"/**\n * Let we have a call if a form of \"x.f()\" or \"f()\"\n *\n * This method enqueues a task (based on runResolutionForInvokeReceiverVariable) that for each successful property enqueues another task\n * that tries to resolve \"f()\" call itself\n *\n * @param info describes whole \"x.f()\" or \"f()\"\n * @param invokeReceiverInfo describes \"x.f\" or \"f\" variable (in case of no-receiver call or in case of resolving invokeExtension with \"x\")\n * @param invokeBuiltinExtensionMode is true only when the original call has a form \"x.f()\" and invokeReceiverInfo is \"f\"\n * @param runResolutionForInvokeReceiverVariable runs the process of looking for the receiver (\"x.f\" or \"f\") on the given FirTowerResolveTask\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < Element > . a ( href : String ? = null , target : String ? = null , classes : String ? = null , crossinline block : A . ( ) -> Unit = { } , ) : HTMLAnchorElement","body":"= A ( attributesMapOf ( \"\" , href , \"\" , target , \"\" , classes ) , this ) . visitAndFinalize ( this , block ) as HTMLAnchorElement","docstring":"/**\n * Anchor\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < Element > . abbr ( classes : String ? = null , crossinline block : ABBR . ( ) -> Unit = { } ) : Element","body":"= ABBR ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block )","docstring":"/**\n * Abbreviated form (e.g., WWW, HTTP,etc.)\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < Element > . address ( classes : String ? = null , crossinline block : ADDRESS . ( ) -> Unit = { } ) : Element","body":"= ADDRESS ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block )","docstring":"/**\n * Information on author\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < Element > . area ( shape : AreaShape ? = null , alt : String ? = null , classes : String ? = null , crossinline block : AREA . ( ) -> Unit = { } , ) : HTMLAreaElement","body":"= AREA ( attributesMapOf ( \"\" , shape ? . enumEncode ( ) , \"\" , alt , \"\" , classes ) , this ) . visitAndFinalize ( this , block ) as HTMLAreaElement","docstring":"/**\n * Client-side image map area\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < Element > . article ( classes : String ? = null , crossinline block : ARTICLE . ( ) -> Unit = { } ) : Element","body":"= ARTICLE ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block )","docstring":"/**\n * Self-contained syndicatable or reusable composition\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < Element > . aside ( classes : String ? = null , crossinline block : ASIDE . ( ) -> Unit = { } ) : Element","body":"= ASIDE ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block )","docstring":"/**\n * Sidebar for tangentially related content\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < Element > . audio ( classes : String ? = null , crossinline block : AUDIO . ( ) -> Unit = { } ) : HTMLAudioElement","body":"= AUDIO ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block ) as HTMLAudioElement","docstring":"/**\n * Audio player\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < Element > . b ( classes : String ? = null , crossinline block : B . ( ) -> Unit = { } ) : Element","body":"= B ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block )","docstring":"/**\n * Bold text style\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < Element > . base ( classes : String ? = null , crossinline block : BASE . ( ) -> Unit = { } ) : HTMLBaseElement","body":"= BASE ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block ) as HTMLBaseElement","docstring":"/**\n * Document base URI\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < Element > . bdi ( classes : String ? = null , crossinline block : BDI . ( ) -> Unit = { } ) : Element","body":"= BDI ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block )","docstring":"/**\n * Text directionality isolation\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < Element > . bdo ( classes : String ? = null , crossinline block : BDO . ( ) -> Unit = { } ) : Element","body":"= BDO ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block )","docstring":"/**\n * I18N BiDi over-ride\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < Element > . blockQuote ( classes : String ? = null , crossinline block : BLOCKQUOTE . ( ) -> Unit = { } ) : Element","body":"= BLOCKQUOTE ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block )","docstring":"/**\n * Long quotation\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < Element > . body ( classes : String ? = null , crossinline block : BODY . ( ) -> Unit = { } ) : HTMLBodyElement","body":"= BODY ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block ) as HTMLBodyElement","docstring":"/**\n * Document body\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < Element > . br ( classes : String ? = null , crossinline block : BR . ( ) -> Unit = { } ) : HTMLBRElement","body":"= BR ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block ) as HTMLBRElement","docstring":"/**\n * Forced line break\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < Element > . button ( formEncType : ButtonFormEncType ? = null , formMethod : ButtonFormMethod ? = null , name : String ? = null , type : ButtonType ? = null , classes : String ? = null , crossinline block : BUTTON . ( ) -> Unit = { } , ) : HTMLButtonElement","body":"= BUTTON ( attributesMapOf ( \"\" , formEncType ? . enumEncode ( ) , \"\" , formMethod ? . enumEncode ( ) , \"\" , name , \"\" , type ? . enumEncode ( ) , \"\" , classes ) , this ) . visitAndFinalize ( this , block ) as HTMLButtonElement","docstring":"/**\n * Push button\n */"} {"signature":"@ HtmlTagMarker public fun TagConsumer < Element > . canvas ( classes : String ? = null , content : String = \"\" ) : HTMLCanvasElement","body":"= CANVAS ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , { + content } ) as HTMLCanvasElement","docstring":"/**\n * Scriptable bitmap canvas\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < Element > . canvas ( classes : String ? = null , crossinline block : CANVAS . ( ) -> Unit = { } ) : HTMLCanvasElement","body":"= CANVAS ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block ) as HTMLCanvasElement","docstring":"/**\n * Scriptable bitmap canvas\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < Element > . caption ( classes : String ? = null , crossinline block : CAPTION . ( ) -> Unit = { } ) : Element","body":"= CAPTION ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block )","docstring":"/**\n * Table caption\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < Element > . cite ( classes : String ? = null , crossinline block : CITE . ( ) -> Unit = { } ) : Element","body":"= CITE ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block )","docstring":"/**\n * Citation\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < Element > . code ( classes : String ? = null , crossinline block : CODE . ( ) -> Unit = { } ) : Element","body":"= CODE ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block )","docstring":"/**\n * Computer code fragment\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < Element > . col ( classes : String ? = null , crossinline block : COL . ( ) -> Unit = { } ) : HTMLTableColElement","body":"= COL ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block ) as HTMLTableColElement","docstring":"/**\n * Table column\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < Element > . colGroup ( classes : String ? = null , crossinline block : COLGROUP . ( ) -> Unit = { } ) : HTMLTableColElement","body":"= COLGROUP ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block ) as HTMLTableColElement","docstring":"/**\n * Table column group\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < Element > . dataList ( classes : String ? = null , crossinline block : DATALIST . ( ) -> Unit = { } ) : HTMLDataListElement","body":"= DATALIST ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block ) as HTMLDataListElement","docstring":"/**\n * Container for options for \n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < Element > . dd ( classes : String ? = null , crossinline block : DD . ( ) -> Unit = { } ) : Element","body":"= DD ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block )","docstring":"/**\n * Definition description\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < Element > . del ( classes : String ? = null , crossinline block : DEL . ( ) -> Unit = { } ) : Element","body":"= DEL ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block )","docstring":"/**\n * Deleted text\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < Element > . details ( classes : String ? = null , crossinline block : DETAILS . ( ) -> Unit = { } ) : HTMLDetailsElement","body":"= DETAILS ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block ) as HTMLDetailsElement","docstring":"/**\n * Disclosure control for hiding details\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < Element > . dfn ( classes : String ? = null , crossinline block : DFN . ( ) -> Unit = { } ) : Element","body":"= DFN ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block )","docstring":"/**\n * Instance definition\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < Element > . dialog ( classes : String ? = null , crossinline block : DIALOG . ( ) -> Unit = { } ) : HTMLDialogElement","body":"= DIALOG ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block ) as HTMLDialogElement","docstring":"/**\n * Dialog box or window\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < Element > . div ( classes : String ? = null , crossinline block : DIV . ( ) -> Unit = { } ) : HTMLDivElement","body":"= DIV ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block ) as HTMLDivElement","docstring":"/**\n * Generic language/style container\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < Element > . dl ( classes : String ? = null , crossinline block : DL . ( ) -> Unit = { } ) : Element","body":"= DL ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block )","docstring":"/**\n * Definition list\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < Element > . dt ( classes : String ? = null , crossinline block : DT . ( ) -> Unit = { } ) : Element","body":"= DT ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block )","docstring":"/**\n * Definition term\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < Element > . em ( classes : String ? = null , crossinline block : EM . ( ) -> Unit = { } ) : Element","body":"= EM ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block )","docstring":"/**\n * Emphasis\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < Element > . embed ( classes : String ? = null , crossinline block : EMBED . ( ) -> Unit = { } ) : HTMLEmbedElement","body":"= EMBED ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block ) as HTMLEmbedElement","docstring":"/**\n * Plugin\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < Element > . fieldSet ( classes : String ? = null , crossinline block : FIELDSET . ( ) -> Unit = { } ) : HTMLFieldSetElement","body":"= FIELDSET ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block ) as HTMLFieldSetElement","docstring":"/**\n * Form control group\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < Element > . figcaption ( classes : String ? = null , crossinline block : FIGCAPTION . ( ) -> Unit = { } ) : Element","body":"= FIGCAPTION ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block )","docstring":"/**\n * Caption for \n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < Element > . figure ( classes : String ? = null , crossinline block : FIGURE . ( ) -> Unit = { } ) : Element","body":"= FIGURE ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block )","docstring":"/**\n * Figure with optional caption\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < Element > . footer ( classes : String ? = null , crossinline block : FOOTER . ( ) -> Unit = { } ) : Element","body":"= FOOTER ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block )","docstring":"/**\n * Footer for a page or section\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < Element > . form ( action : String ? = null , encType : FormEncType ? = null , method : FormMethod ? = null , classes : String ? = null , crossinline block : FORM . ( ) -> Unit = { } , ) : HTMLFormElement","body":"= FORM ( attributesMapOf ( \"\" , action , \"\" , encType ? . enumEncode ( ) , \"\" , method ? . enumEncode ( ) , \"\" , classes ) , this ) . visitAndFinalize ( this , block ) as HTMLFormElement","docstring":"/**\n * Interactive form\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < Element > . h1 ( classes : String ? = null , crossinline block : H1 . ( ) -> Unit = { } ) : HTMLHeadingElement","body":"= H1 ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block ) as HTMLHeadingElement","docstring":"/**\n * Heading\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < Element > . h2 ( classes : String ? = null , crossinline block : H2 . ( ) -> Unit = { } ) : HTMLHeadingElement","body":"= H2 ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block ) as HTMLHeadingElement","docstring":"/**\n * Heading\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < Element > . h3 ( classes : String ? = null , crossinline block : H3 . ( ) -> Unit = { } ) : HTMLHeadingElement","body":"= H3 ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block ) as HTMLHeadingElement","docstring":"/**\n * Heading\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < Element > . h4 ( classes : String ? = null , crossinline block : H4 . ( ) -> Unit = { } ) : HTMLHeadingElement","body":"= H4 ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block ) as HTMLHeadingElement","docstring":"/**\n * Heading\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < Element > . h5 ( classes : String ? = null , crossinline block : H5 . ( ) -> Unit = { } ) : HTMLHeadingElement","body":"= H5 ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block ) as HTMLHeadingElement","docstring":"/**\n * Heading\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < Element > . h6 ( classes : String ? = null , crossinline block : H6 . ( ) -> Unit = { } ) : HTMLHeadingElement","body":"= H6 ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block ) as HTMLHeadingElement","docstring":"/**\n * Heading\n */"} {"signature":"@ HtmlTagMarker @ Suppress ( \"\" ) @ Deprecated ( \"\" ) public fun TagConsumer < Element > . head ( content : String = \"\" ) : HTMLHeadElement","body":"= HEAD ( emptyMap , this ) . visitAndFinalize ( this , { + content } ) as HTMLHeadElement","docstring":"/**\n * Document head\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < Element > . head ( crossinline block : HEAD . ( ) -> Unit = { } ) : HTMLHeadElement","body":"= HEAD ( emptyMap , this ) . visitAndFinalize ( this , block ) as HTMLHeadElement","docstring":"/**\n * Document head\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < Element > . `header` ( classes : String ? = null , crossinline block : HEADER . ( ) -> Unit = { } ) : Element","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 TagConsumer < Element > . hr ( classes : String ? = null , crossinline block : HR . ( ) -> Unit = { } ) : HTMLHRElement","body":"= HR ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block ) as HTMLHRElement","docstring":"/**\n * Horizontal rule\n */"} {"signature":"@ HtmlTagMarker @ Suppress ( \"\" ) @ Deprecated ( \"\" ) public fun TagConsumer < Element > . html ( content : String = \"\" , namespace : String ? = null ) : HTMLHtmlElement","body":"= HTML ( emptyMap , this , namespace ) . visitAndFinalize ( this , { + content } ) as HTMLHtmlElement","docstring":"/**\n * Document root element\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < Element > . html ( namespace : String ? = null , crossinline block : HTML . ( ) -> Unit = { } ) : HTMLHtmlElement","body":"= HTML ( emptyMap , this , namespace ) . visitAndFinalize ( this , block ) as HTMLHtmlElement","docstring":"/**\n * Document root element\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < Element > . i ( classes : String ? = null , crossinline block : I . ( ) -> Unit = { } ) : Element","body":"= I ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block )","docstring":"/**\n * Italic text style\n */"} {"signature":"@ HtmlTagMarker public fun TagConsumer < Element > . iframe ( sandbox : IframeSandbox ? = null , classes : String ? = null , content : String = \"\" , ) : Element","body":"= IFRAME ( attributesMapOf ( \"\" , sandbox ? . enumEncode ( ) , \"\" , classes ) , this ) . visitAndFinalize ( this , { + content } )","docstring":"/**\n * Inline subwindow\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < Element > . iframe ( sandbox : IframeSandbox ? = null , classes : String ? = null , crossinline block : IFRAME . ( ) -> Unit = { } , ) : Element","body":"= IFRAME ( attributesMapOf ( \"\" , sandbox ? . enumEncode ( ) , \"\" , classes ) , this ) . visitAndFinalize ( this , block )","docstring":"/**\n * Inline subwindow\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < Element > . img ( alt : String ? = null , src : String ? = null , loading : ImgLoading ? = null , classes : String ? = null , crossinline block : IMG . ( ) -> Unit = { } , ) : HTMLImageElement","body":"= IMG ( attributesMapOf ( \"\" , alt , \"\" , src , \"\" , loading ? . enumEncode ( ) , \"\" , classes ) , this ) . visitAndFinalize ( this , block ) as HTMLImageElement","docstring":"/**\n * Embedded image\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < Element > . input ( type : InputType ? = null , formEncType : InputFormEncType ? = null , formMethod : InputFormMethod ? = null , name : String ? = null , classes : String ? = null , crossinline block : INPUT . ( ) -> Unit = { } , ) : HTMLInputElement","body":"= INPUT ( attributesMapOf ( \"\" , type ? . enumEncode ( ) , \"\" , formEncType ? . enumEncode ( ) , \"\" , formMethod ? . enumEncode ( ) , \"\" , name , \"\" , classes ) , this ) . visitAndFinalize ( this , block ) as HTMLInputElement","docstring":"/**\n * Form control\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < Element > . ins ( classes : String ? = null , crossinline block : INS . ( ) -> Unit = { } ) : Element","body":"= INS ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block )","docstring":"/**\n * Inserted text\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < Element > . kbd ( classes : String ? = null , crossinline block : KBD . ( ) -> Unit = { } ) : Element","body":"= KBD ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block )","docstring":"/**\n * Text to be entered by the user\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < Element > . keyGen ( keyType : KeyGenKeyType ? = null , classes : String ? = null , crossinline block : KEYGEN . ( ) -> Unit = { } , ) : Element","body":"= KEYGEN ( attributesMapOf ( \"\" , keyType ? . enumEncode ( ) , \"\" , classes ) , this ) . visitAndFinalize ( this , block )","docstring":"/**\n * Cryptographic key-pair generator form control\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < Element > . label ( classes : String ? = null , crossinline block : LABEL . ( ) -> Unit = { } ) : HTMLLabelElement","body":"= LABEL ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block ) as HTMLLabelElement","docstring":"/**\n * Form field label text\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < Element > . legend ( classes : String ? = null , crossinline block : LEGEND . ( ) -> Unit = { } ) : HTMLLegendElement","body":"= LEGEND ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block ) as HTMLLegendElement","docstring":"/**\n * Fieldset legend\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < Element > . li ( classes : String ? = null , crossinline block : LI . ( ) -> Unit = { } ) : HTMLLIElement","body":"= LI ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block ) as HTMLLIElement","docstring":"/**\n * List item\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < Element > . link ( href : String ? = null , rel : String ? = null , type : String ? = null , crossinline block : LINK . ( ) -> Unit = { } , ) : HTMLLinkElement","body":"= LINK ( attributesMapOf ( \"\" , href , \"\" , rel , \"\" , type ) , this ) . visitAndFinalize ( this , block ) as HTMLLinkElement","docstring":"/**\n * A media-independent link\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < Element > . main ( classes : String ? = null , crossinline block : MAIN . ( ) -> Unit = { } ) : Element","body":"= MAIN ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block )","docstring":"/**\n * Container for the dominant contents of another element\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < Element > . map ( name : String ? = null , classes : String ? = null , crossinline block : MAP . ( ) -> Unit = { } , ) : HTMLMapElement","body":"= MAP ( attributesMapOf ( \"\" , name , \"\" , classes ) , this ) . visitAndFinalize ( this , block ) as HTMLMapElement","docstring":"/**\n * Client-side image map\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < Element > . mark ( classes : String ? = null , crossinline block : MARK . ( ) -> Unit = { } ) : Element","body":"= MARK ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block )","docstring":"/**\n * Highlight\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < Element > . meta ( name : String ? = null , content : String ? = null , charset : String ? = null , crossinline block : META . ( ) -> Unit = { } , ) : HTMLMetaElement","body":"= META ( attributesMapOf ( \"\" , name , \"\" , content , \"\" , charset ) , this ) . visitAndFinalize ( this , block ) as HTMLMetaElement","docstring":"/**\n * Generic metainformation\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < Element > . meter ( classes : String ? = null , crossinline block : METER . ( ) -> Unit = { } ) : HTMLMeterElement","body":"= METER ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block ) as HTMLMeterElement","docstring":"/**\n * Gauge\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < Element > . nav ( classes : String ? = null , crossinline block : NAV . ( ) -> Unit = { } ) : Element","body":"= NAV ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block )","docstring":"/**\n * Section with navigational links\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < Element > . noScript ( classes : String ? = null , crossinline block : NOSCRIPT . ( ) -> Unit = { } ) : Element","body":"= NOSCRIPT ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block )","docstring":"/**\n * Generic metainformation\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < Element > . htmlObject ( classes : String ? = null , crossinline block : OBJECT . ( ) -> Unit = { } ) : Element","body":"= OBJECT ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block )","docstring":"/**\n * Generic embedded object\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < Element > . ol ( classes : String ? = null , crossinline block : OL . ( ) -> Unit = { } ) : Element","body":"= OL ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block )","docstring":"/**\n * Ordered list\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < Element > . optGroup ( label : String ? = null , classes : String ? = null , crossinline block : OPTGROUP . ( ) -> Unit = { } , ) : HTMLOptGroupElement","body":"= OPTGROUP ( attributesMapOf ( \"\" , label , \"\" , classes ) , this ) . visitAndFinalize ( this , block ) as HTMLOptGroupElement","docstring":"/**\n * Option group\n */"} {"signature":"@ HtmlTagMarker public fun TagConsumer < Element > . option ( classes : String ? = null , content : String = \"\" ) : HTMLOptionElement","body":"= OPTION ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , { + content } ) as HTMLOptionElement","docstring":"/**\n * Selectable choice\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < Element > . option ( classes : String ? = null , crossinline block : OPTION . ( ) -> Unit = { } ) : HTMLOptionElement","body":"= OPTION ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block ) as HTMLOptionElement","docstring":"/**\n * Selectable choice\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < Element > . output ( classes : String ? = null , crossinline block : OUTPUT . ( ) -> Unit = { } ) : HTMLOutputElement","body":"= OUTPUT ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block ) as HTMLOutputElement","docstring":"/**\n * Calculated output value\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < Element > . p ( classes : String ? = null , crossinline block : P . ( ) -> Unit = { } ) : HTMLParagraphElement","body":"= P ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block ) as HTMLParagraphElement","docstring":"/**\n * Paragraph\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < Element > . `param` ( name : String ? = null , `value` : String ? = null , crossinline block : PARAM . ( ) -> Unit = { } , ) : HTMLParamElement","body":"= PARAM ( attributesMapOf ( \"\" , name , \"\" , value ) , this ) . visitAndFinalize ( this , block ) as HTMLParamElement","docstring":"/**\n * Named property value\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < Element > . picture ( crossinline block : PICTURE . ( ) -> Unit = { } ) : HTMLPictureElement","body":"= PICTURE ( emptyMap , this ) . visitAndFinalize ( this , block ) as HTMLPictureElement","docstring":"/**\n * Pictures container\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < Element > . pre ( classes : String ? = null , crossinline block : PRE . ( ) -> Unit = { } ) : HTMLPreElement","body":"= PRE ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block ) as HTMLPreElement","docstring":"/**\n * Preformatted text\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < Element > . progress ( classes : String ? = null , crossinline block : PROGRESS . ( ) -> Unit = { } ) : HTMLProgressElement","body":"= PROGRESS ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block ) as HTMLProgressElement","docstring":"/**\n * Progress bar\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < Element > . q ( classes : String ? = null , crossinline block : Q . ( ) -> Unit = { } ) : Element","body":"= Q ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block )","docstring":"/**\n * Short inline quotation\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < Element > . rp ( classes : String ? = null , crossinline block : RP . ( ) -> Unit = { } ) : Element","body":"= RP ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block )","docstring":"/**\n * Parenthesis for ruby annotation text\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < Element > . rt ( classes : String ? = null , crossinline block : RT . ( ) -> Unit = { } ) : Element","body":"= RT ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block )","docstring":"/**\n * Ruby annotation text\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < Element > . ruby ( classes : String ? = null , crossinline block : RUBY . ( ) -> Unit = { } ) : Element","body":"= RUBY ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block )","docstring":"/**\n * Ruby annotation(s)\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < Element > . s ( classes : String ? = null , crossinline block : S . ( ) -> Unit = { } ) : Element","body":"= S ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block )","docstring":"/**\n * Strike-through text style\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < Element > . samp ( classes : String ? = null , crossinline block : SAMP . ( ) -> Unit = { } ) : Element","body":"= SAMP ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block )","docstring":"/**\n * Sample or quote text style\n */"} {"signature":"@ HtmlTagMarker @ Suppress ( \"\" ) @ Deprecated ( \"\" ) public fun TagConsumer < Element > . script ( type : String ? = null , src : String ? = null , crossorigin : ScriptCrossorigin ? = null , content : String = \"\" , ) : HTMLScriptElement","body":"= SCRIPT ( attributesMapOf ( \"\" , type , \"\" , src , \"\" , crossorigin ? . enumEncode ( ) ) , this ) . visitAndFinalize ( this , { + content } ) as HTMLScriptElement","docstring":"/**\n * Script statements\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < Element > . script ( type : String ? = null , src : String ? = null , crossorigin : ScriptCrossorigin ? = null , crossinline block : SCRIPT . ( ) -> Unit = { } , ) : HTMLScriptElement","body":"= SCRIPT ( attributesMapOf ( \"\" , type , \"\" , src , \"\" , crossorigin ? . enumEncode ( ) ) , this ) . visitAndFinalize ( this , block ) as HTMLScriptElement","docstring":"/**\n * Script statements\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < Element > . section ( classes : String ? = null , crossinline block : SECTION . ( ) -> Unit = { } ) : Element","body":"= SECTION ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block )","docstring":"/**\n * Generic document or application section\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < Element > . select ( classes : String ? = null , crossinline block : SELECT . ( ) -> Unit = { } ) : HTMLSelectElement","body":"= SELECT ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block ) as HTMLSelectElement","docstring":"/**\n * Option selector\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < Element > . small ( classes : String ? = null , crossinline block : SMALL . ( ) -> Unit = { } ) : Element","body":"= SMALL ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block )","docstring":"/**\n * Small text style\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < Element > . source ( classes : String ? = null , crossinline block : SOURCE . ( ) -> Unit = { } ) : HTMLSourceElement","body":"= SOURCE ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block ) as HTMLSourceElement","docstring":"/**\n * Media source for \n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < Element > . span ( classes : String ? = null , crossinline block : SPAN . ( ) -> Unit = { } ) : HTMLSpanElement","body":"= SPAN ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block ) as HTMLSpanElement","docstring":"/**\n * Generic language/style container\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < Element > . strong ( classes : String ? = null , crossinline block : STRONG . ( ) -> Unit = { } ) : Element","body":"= STRONG ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block )","docstring":"/**\n * Strong emphasis\n */"} {"signature":"@ HtmlTagMarker @ Suppress ( \"\" ) @ Deprecated ( \"\" ) public fun TagConsumer < Element > . style ( type : String ? = null , content : String = \"\" ) : HTMLStyleElement ","body":"= STYLE ( attributesMapOf ( \"\" , type ) , this ) . visitAndFinalize ( this , { + content } ) as HTMLStyleElement","docstring":"/**\n * Style info\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < Element > . style ( type : String ? = null , crossinline block : STYLE . ( ) -> Unit = { } ) : HTMLStyleElement","body":"= STYLE ( attributesMapOf ( \"\" , type ) , this ) . visitAndFinalize ( this , block ) as HTMLStyleElement","docstring":"/**\n * Style info\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < Element > . sub ( classes : String ? = null , crossinline block : SUB . ( ) -> Unit = { } ) : Element","body":"= SUB ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block )","docstring":"/**\n * Subscript\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < Element > . summary ( classes : String ? = null , crossinline block : SUMMARY . ( ) -> Unit = { } ) : Element","body":"= SUMMARY ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block )","docstring":"/**\n * Caption for \n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < Element > . sup ( classes : String ? = null , crossinline block : SUP . ( ) -> Unit = { } ) : Element","body":"= SUP ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block )","docstring":"/**\n * Superscript\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < Element > . table ( classes : String ? = null , crossinline block : TABLE . ( ) -> Unit = { } ) : HTMLTableElement","body":"= TABLE ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block ) as HTMLTableElement","docstring":"/**\n *\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < Element > . tbody ( classes : String ? = null , crossinline block : TBODY . ( ) -> Unit = { } ) : HTMLTableSectionElement","body":"= TBODY ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block ) as HTMLTableSectionElement","docstring":"/**\n * Table body\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < Element > . td ( classes : String ? = null , crossinline block : TD . ( ) -> Unit = { } ) : HTMLTableCellElement","body":"= TD ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block ) as HTMLTableCellElement","docstring":"/**\n * Table data cell\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < Element > . template ( classes : String ? = null , crossinline block : TEMPLATE . ( ) -> Unit = { } ) : HTMLTemplateElement","body":"= TEMPLATE ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block ) as HTMLTemplateElement","docstring":"/**\n * Template\n */"} {"signature":"@ HtmlTagMarker public fun TagConsumer < Element > . textArea ( rows : String ? = null , cols : String ? = null , wrap : TextAreaWrap ? = null , classes : String ? = null , content : String = \"\" , ) : HTMLTextAreaElement","body":"= TEXTAREA ( attributesMapOf ( \"\" , rows , \"\" , cols , \"\" , wrap ? . enumEncode ( ) , \"\" , classes ) , this ) . visitAndFinalize ( this , { + content } ) as HTMLTextAreaElement","docstring":"/**\n * Multi-line text field\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < Element > . textArea ( rows : String ? = null , cols : String ? = null , wrap : TextAreaWrap ? = null , classes : String ? = null , crossinline block : TEXTAREA . ( ) -> Unit = { } , ) : HTMLTextAreaElement","body":"= TEXTAREA ( attributesMapOf ( \"\" , rows , \"\" , cols , \"\" , wrap ? . enumEncode ( ) , \"\" , classes ) , this ) . visitAndFinalize ( this , block ) as HTMLTextAreaElement","docstring":"/**\n * Multi-line text field\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < Element > . tfoot ( classes : String ? = null , crossinline block : TFOOT . ( ) -> Unit = { } ) : HTMLTableSectionElement","body":"= TFOOT ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block ) as HTMLTableSectionElement","docstring":"/**\n * Table footer\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < Element > . th ( scope : ThScope ? = null , classes : String ? = null , crossinline block : TH . ( ) -> Unit = { } , ) : HTMLTableCellElement","body":"= TH ( attributesMapOf ( \"\" , scope ? . enumEncode ( ) , \"\" , classes ) , this ) . visitAndFinalize ( this , block ) as HTMLTableCellElement","docstring":"/**\n * Table header cell\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < Element > . thead ( classes : String ? = null , crossinline block : THEAD . ( ) -> Unit = { } ) : HTMLTableSectionElement","body":"= THEAD ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block ) as HTMLTableSectionElement","docstring":"/**\n * Table header\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < Element > . time ( classes : String ? = null , crossinline block : TIME . ( ) -> Unit = { } ) : HTMLTimeElement","body":"= TIME ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block ) as HTMLTimeElement","docstring":"/**\n * Machine-readable equivalent of date- or time-related data\n */"} {"signature":"@ HtmlTagMarker public fun TagConsumer < Element > . title ( content : String = \"\" ) : HTMLTitleElement","body":"= TITLE ( emptyMap , this ) . visitAndFinalize ( this , { + content } ) as HTMLTitleElement","docstring":"/**\n * Document title\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < Element > . title ( crossinline block : TITLE . ( ) -> Unit = { } ) : HTMLTitleElement","body":"= TITLE ( emptyMap , this ) . visitAndFinalize ( this , block ) as HTMLTitleElement","docstring":"/**\n * Document title\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < Element > . tr ( classes : String ? = null , crossinline block : TR . ( ) -> Unit = { } ) : HTMLTableRowElement","body":"= TR ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block ) as HTMLTableRowElement","docstring":"/**\n * Table row\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < Element > . u ( classes : String ? = null , crossinline block : U . ( ) -> Unit = { } ) : Element","body":"= U ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block )","docstring":"/**\n * Underlined text style\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < Element > . ul ( classes : String ? = null , crossinline block : UL . ( ) -> Unit = { } ) : Element","body":"= UL ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block )","docstring":"/**\n * Unordered list\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < Element > . htmlVar ( classes : String ? = null , crossinline block : VAR . ( ) -> Unit = { } ) : Element","body":"= VAR ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block )","docstring":"/**\n * Unordered list\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < Element > . video ( classes : String ? = null , crossinline block : VIDEO . ( ) -> Unit = { } ) : HTMLVideoElement","body":"= VIDEO ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block ) as HTMLVideoElement","docstring":"/**\n * Video player\n */"} {"signature":"@ TypeRefinement override fun refineType ( type : KotlinTypeMarker ) : KotlinType","body":"{ require ( type is KotlinType ) if ( type . constructor . declarationDescriptor ? . module == moduleDescriptor ) return type return when { type . needsRefinementHackForKtij24195 ( ) -> doRefineType ( ( type as AbbreviatedType ) . abbreviation ) type . needsRefinement ( ) -> doRefineType ( type ) else -> type } }","docstring":"/**\n * IMPORTANT: that function has not obvious contract: it refines only supertypes,\n * and don't refines type arguments, so return type is \"partly refined\".\n *\n * It's fine for subtyping, because we refine type arguments inside type checker when it needs to\n * It's fine for scopes, because we refine type of every expression:\n *\n * // common module\n * expect interface A\n * class Inv(val value: T)\n * fun getA(): Inv = ...\n *\n * // platform module\n *\n * actual interface A {\n * val x: Int\n * }\n *\n * fun foo() {\n * getA().value.x\n * }\n *\n * Let's call type of `actual interface A` A'\n *\n * expression `getA()` has not refined type Inv and same refined type\n * expression `getA().value` has not refined type A that refines into type A', so there is a\n * field `x` in it's member scope\n */"} {"signature":"private fun KotlinType . needsRefinementHackForKtij24195 ( ) : Boolean","body":"{ if ( this !is AbbreviatedType ) return false if ( abbreviation . constructor . declarationDescriptor !is TypeAliasDescriptor ) return false val expansionDescriptorClassId = expandedType . constructor . declarationDescriptor . classId ? : return false return moduleDescriptor . findClassifierAcrossModuleDependencies ( expansionDescriptorClassId ) == null }","docstring":"/**\n * This is a hack for https://youtrack.jetbrains.com/issue/KTIJ-24195\n *\n * The rough idea is that if:\n * - we see a typealias pointing to a classifier\n * - ideally, we'd consider only `actual typealias`es, but we don't write `actual`-flag in metadata :(\n * - and that classifier isn't visible from our module\n * - then we should re-refine the abbreviation\n *\n * Read KTIJ-24195 comments for detailed explanation and reasoning why this hack is sufficient.\n *\n * Performance note: this hack amounts to running an additional `findClassAcrossModuleDependencies` on all `typealias`\n * abbreviations. In most cases, the resolution of abbreviation should've happened before, so this call will just hit the cache.\n * It is possible to construct a case where this call will actually have to do some non-trivial work, but:\n * a) it's quite hard to write such case even knowing how our caches work, so the probability of a real-life user' code hitting that\n * case is minuscule\n * b) even if we somehow manage to hit that case in real code, this is just one more `getContributedClassifier` per used\n * `typealias`, as all subsequent calls will be cached.\n */"} {"signature":"fun createStandaloneInstanceFor ( moduleDescriptor : ModuleDescriptor ) : KotlinTypeRefinerImpl","body":"= KotlinTypeRefinerImpl ( moduleDescriptor , LockBasedStorageManager . NO_LOCKS , isStandalone = true )","docstring":"/**\n * Create a new *thread unsafe* type refiner instance for the specified module.\n * Note, that module's type refiner capability won't be changed.\n */"} {"signature":"@ Test fun failWithModulesNotInAnyScope ( )","body":"{ val json = Json { serializersModule = BaseAndDerivedModule } checkNotRegisteredMessage ( assertFailsWith < SerializationException > { json . encodeToString ( MyPolyData . serializer ( ) , MyPolyData ( mapOf ( \"\" to PolyDerived ( \"\" ) ) ) ) } ) }","docstring":"/**\n * This test should fail because PolyDerived registered in the scope of PolyBase, not kotlin.Any\n */"} {"signature":"@ Test fun failWithModulesNotInParticularScope ( )","body":"{ val json = Json { serializersModule = baseAndDerivedModuleAtAny } checkNotRegisteredMessage ( assertFailsWith < SerializationException > { json . encodeToString ( MyPolyDataWithPolyBase . serializer ( ) , MyPolyDataWithPolyBase ( mapOf ( \"\" to PolyDerived ( \"\" ) ) , PolyDerived ( \"\" ) ) ) } ) }","docstring":"/**\n * This test should fail because PolyDerived registered in the scope of kotlin.Any, not PolyBase\n */"} {"signature":"public fun load ( pathToModel : String ) : SavedModel","body":"{ return SavedModel ( SavedModelBundle . load ( pathToModel , \"\" ) ) }","docstring":"/**\n * Loads model from SavedModelBundle format.\n */"} {"signature":"fun multiPoseCudaInference ( )","body":"{ val modelHub = ONNXModelHub ( cacheDirectory = File ( \"\" ) ) val modelType = ONNXModels . PoseDetection . MoveNetMultiPoseLighting val model = modelHub . loadModel ( modelType , CPU ( ) ) val inputData = prepareInputData ( modelType ) val cpuInferenceTime = cpuInference ( model , inputData ) println ( \"\" ) val cudaInferenceTime = cudaInference ( model , inputData ) println ( \"\" ) model . close ( ) }","docstring":"/**\n * This example compares the inference speed of different execution providers:\n * - [inferUsing] scope function is used for CUDA inference. That's why the underlying session should be closed manually.\n */"} {"signature":"@ Deprecated ( message = \"\" , replaceWith = ReplaceWith ( \"\" , \"\" ) , level = DeprecationLevel . WARNING ) internal fun Project . setupNativeCompiler ( konanTarget : KonanTarget )","body":"{ val isKonanHomeOverridden = kotlinPropertiesProvider . nativeHome != null if ( ! isKonanHomeOverridden ) { val downloader = NativeCompilerDownloader ( this ) if ( kotlinPropertiesProvider . nativeReinstall ) { logger . info ( \"\" ) downloader . compilerDirectory . deleteRecursively ( ) } downloader . downloadIfNeeded ( ) logger . info ( \"\" ) } else { logger . info ( \"\" ) } val distributionType = NativeDistributionTypeProvider ( project ) . getDistributionType ( ) if ( distributionType . mustGeneratePlatformLibs ) { PlatformLibrariesGenerator ( project , konanTarget ) . generatePlatformLibsIfNeeded ( ) } }","docstring":"/**\n * Sets up the Kotlin/Native compiler for the given project.\n *\n * @param konanTarget The target platform for the Kotlin/Native compiler.\n */"} {"signature":"public inline fun < R > analyze ( useSiteKtElement : KtElement , action : KtAnalysisSession . ( ) -> R ) : R","body":"= KtAnalysisSessionProvider . getInstance ( useSiteKtElement . project ) . analyse ( useSiteKtElement , action )","docstring":"/**\n * Executes the given [action] in a [KtAnalysisSession] context.\n *\n * The project will be analyzed from the perspective of [useSiteKtElement]'s module, also called the use-site module.\n *\n * @see KtAnalysisSession\n */"} {"signature":"public inline fun < R > analyze ( useSiteKtModule : KtModule , crossinline action : KtAnalysisSession . ( ) -> R ) : R","body":"{ val sessionProvider = KtAnalysisSessionProvider . getInstance ( useSiteKtModule . project ) return sessionProvider . analyze ( useSiteKtModule , action ) }","docstring":"/**\n * Executes the given [action] in a [KtAnalysisSession] context.\n *\n * The project will be analyzed from the perspective of the given [useSiteKtModule].\n *\n * @see KtAnalysisSession\n * @see KtLifetimeTokenFactory\n */"} {"signature":"@ OptIn ( KtModuleStructureInternals :: class ) public inline fun < R > analyzeCopy ( useSiteKtElement : KtElement , resolutionMode : DanglingFileResolutionMode , crossinline action : KtAnalysisSession . ( ) -> R , ) : R","body":"{ val containingFile = useSiteKtElement . containingKtFile return withDanglingFileResolutionMode ( containingFile , resolutionMode ) { analyze ( containingFile , action ) } }","docstring":"/**\n * Executes the given [action] in a [KtAnalysisSession] context.\n * Depending on the passed [resolutionMode], declarations inside a file copy will be treated in a specific way.\n *\n * Note that the [useSiteKtElement] must be inside a dangling file copy.\n * Specifically, [PsiFile.getOriginalFile] must point to the copy source.\n *\n * The project will be analyzed from the perspective of [useSiteKtElement]'s module, also called the use-site module.\n */"} {"signature":"@ Suppress ( \"\" ) public fun < C > ColumnSet < C > . last ( condition : ColumnFilter < C > = { true } ) : TransformableSingleColumn < C >","body":"= ( allColumnsInternal ( ) as TransformableColumnSet < C > ) . transform { listOf ( it . last ( condition ) ) } . singleOrNullWithTransformerImpl ( )","docstring":"/**\n * @include [CommonLastDocs]\n * @set [CommonLastDocs.Examples]\n * `df.`[select][DataFrame.select]` { `[colsOf][SingleColumn.colsOf]`<`[String][String]`>().`[last][ColumnSet.last]` { it.`[name][ColumnReference.name]`().`[startsWith][String.startsWith]`(\"year\") } }`\n *\n * `df.`[select][DataFrame.select]` { `[colsOf][SingleColumn.colsOf]`<`[Int][Int]`>().`[last][ColumnSet.last]`() }`\n */"} {"signature":"public fun ColumnsSelectionDsl < * > . last ( condition : ColumnFilter < * > = { true } ) : TransformableSingleColumn < * >","body":"= asSingleColumn ( ) . lastCol ( condition )","docstring":"/**\n * @include [CommonLastDocs]\n * @set [CommonLastDocs.Examples]\n *\n * `df.`[select][DataFrame.select]` { `[last][ColumnsSelectionDsl.last]` { it.`[name][ColumnReference.name]`().`[startsWith][String.startsWith]`(\"year\") } }`\n */"} {"signature":"public fun SingleColumn < DataRow < * > > . lastCol ( condition : ColumnFilter < * > = { true } ) : TransformableSingleColumn < * >","body":"= this . ensureIsColumnGroup ( ) . asColumnSet ( ) . last ( condition )","docstring":"/**\n * @include [CommonLastDocs]\n * @set [CommonLastDocs.Examples]\n *\n * `df.`[select][DataFrame.select]` { myColumnGroup.`[lastCol][SingleColumn.lastCol]`() }`\n */"} {"signature":"public fun String . lastCol ( condition : ColumnFilter < * > = { true } ) : TransformableSingleColumn < * >","body":"= columnGroup ( this ) . lastCol ( condition )","docstring":"/**\n * @include [CommonLastDocs]\n * @set [CommonLastDocs.Examples]\n * `df.`[select][DataFrame.select]` { \"myColumnGroup\".`[lastCol][String.lastCol]` { it.`[name][ColumnReference.name]`().`[startsWith][String.startsWith]`(\"year\") } }`\n */"} {"signature":"public fun KProperty < * > . lastCol ( condition : ColumnFilter < * > = { true } ) : TransformableSingleColumn < * >","body":"= columnGroup ( this ) . lastCol ( condition )","docstring":"/**\n * @include [CommonLastDocs]\n * @set [CommonLastDocs.Examples]\n * `df.`[select][DataFrame.select]` { Type::myColumnGroup.`[lastCol][SingleColumn.lastCol]` { it.`[name][ColumnReference.name]`().`[startsWith][String.startsWith]`(\"year\") } }`\n *\n * `df.`[select][DataFrame.select]` { DataSchemaType::myColumnGroup.`[lastCol][KProperty.lastCol]`() }`\n */"} {"signature":"public fun ColumnPath . lastCol ( condition : ColumnFilter < * > = { true } ) : TransformableSingleColumn < * >","body":"= columnGroup ( this ) . lastCol ( condition )","docstring":"/**\n * @include [CommonLastDocs]\n * @set [CommonLastDocs.Examples]\n * `df.`[select][DataFrame.select]` { \"pathTo\"[\"myColumnGroup\"].`[lastCol][ColumnPath.lastCol]` { it.`[name][ColumnReference.name]`().`[startsWith][String.startsWith]`(\"year\") } }`\n */"} {"signature":"fun ChangesCollector . getChangedSymbols ( reporter : ICReporter ) : DirtyData","body":"{ return changes ( ) . getChangedAndImpactedSymbols ( caches = emptyList ( ) , reporter ) }","docstring":"/**\n * Returns changed symbols from the changes collected by this [ChangesCollector].\n *\n * If impacted symbols are also needed, use [getChangedAndImpactedSymbols].\n */"} {"signature":"fun ChangesCollector . getChangedAndImpactedSymbols ( caches : Iterable < IncrementalCacheCommon > , reporter : ICReporter ) : DirtyData","body":"{ return changes ( ) . getChangedAndImpactedSymbols ( caches , reporter ) }","docstring":"/**\n * Returns changed and impacted symbols from the changes collected by this [ChangesCollector].\n *\n * For example, if `Subclass` extends `Superclass` and `Superclass` has changed, `Subclass` will be impacted.\n */"} {"signature":"fun List < ChangeInfo > . getChangedAndImpactedSymbols ( caches : Iterable < IncrementalCacheCommon > , reporter : ICReporter ) : DirtyData","body":"{ val dirtyLookupSymbols = HashSet < LookupSymbol > ( ) val dirtyClassesFqNames = HashSet < FqName > ( ) val sealedParents = HashSet < FqName > ( ) for ( change in this ) { reporter . debug { \"\" } if ( change is ChangeInfo . SignatureChanged ) { val fqNames = if ( ! change . areSubclassesAffected ) listOf ( change . fqName ) else withSubtypes ( change . fqName , caches ) dirtyClassesFqNames . addAll ( fqNames ) for ( classFqName in fqNames ) { assert ( ! classFqName . isRoot ) { \"\" } val scope = classFqName . parent ( ) . asString ( ) val name = classFqName . shortName ( ) . identifier dirtyLookupSymbols . add ( LookupSymbol ( name , scope ) ) } } else if ( change is ChangeInfo . MembersChanged ) { val fqNames = withSubtypes ( change . fqName , caches ) dirtyClassesFqNames . addAll ( fqNames ) for ( name in change . names ) { fqNames . mapTo ( dirtyLookupSymbols ) { LookupSymbol ( name , it . asString ( ) ) } } fqNames . mapTo ( dirtyLookupSymbols ) { LookupSymbol ( SAM_LOOKUP_NAME . asString ( ) , it . asString ( ) ) } } else if ( change is ChangeInfo . ParentsChanged ) { change . parentsChanged . forEach { parent -> sealedParents . addAll ( findSealedSupertypes ( parent , caches ) ) } } } return DirtyData ( dirtyLookupSymbols , dirtyClassesFqNames , sealedParents ) }","docstring":"/**\n * Returns changed and impacted symbols from this list of changes.\n *\n * For example, if `Subclass` extends `Superclass` and `Superclass` has changed, `Subclass` will be impacted.\n */"} {"signature":"fun findSealedSupertypes ( fqName : FqName , caches : Iterable < IncrementalCacheCommon > ) : Collection < FqName >","body":"{ if ( isSealed ( fqName , caches ) ) { return listOf ( fqName ) } return caches . flatMap { cache -> cache . getSupertypesOf ( fqName ) . filter { cache . isSealed ( it ) ? : false } } }","docstring":"/**\n * Finds sealed supertypes of class in same module.\n * This method should be used for processing freedomOsSealedClasses feature, because\n * mutually declared list of sealed subclasses could be declared only in the same module.\n */"} {"signature":"public abstract fun createPackagePartProvider ( scope : GlobalSearchScope ) : PackagePartProvider","body":"public abstract fun createPackagePartProvider ( scope : GlobalSearchScope ) : PackagePartProvider","docstring":"/**\n * Create a [PackagePartProvider] for a given scope. [PackagePartProvider] is responsible for searching sub packages in a library.\n */"} {"signature":"public fun Project . createPackagePartProvider ( scope : GlobalSearchScope ) : PackagePartProvider","body":"= getService ( PackagePartProviderFactory :: class . java ) . createPackagePartProvider ( scope )","docstring":"/**\n * Create a [PackagePartProvider] for a given scope. [PackagePartProvider] is responsible for searching sub packages in a library.\n */"} {"signature":"@ HtmlTagMarker inline fun FIELDSET . legend ( classes : String ? = null , crossinline block : LEGEND . ( ) -> Unit = { } ) : Unit","body":"= LEGEND ( attributesMapOf ( \"\" , classes ) , consumer ) . visit ( block )","docstring":"/**\n * Fieldset legend\n */"} {"signature":"@ HtmlTagMarker inline fun FIGURE . legend ( classes : String ? = null , crossinline block : LEGEND . ( ) -> Unit = { } ) : Unit","body":"= LEGEND ( attributesMapOf ( \"\" , classes ) , consumer ) . visit ( block )","docstring":"/**\n * Fieldset legend\n */"} {"signature":"@ HtmlTagMarker inline fun FIGURE . figcaption ( classes : String ? = null , crossinline block : FIGCAPTION . ( ) -> Unit = { } ) : Unit","body":"= FIGCAPTION ( attributesMapOf ( \"\" , classes ) , consumer ) . visit ( block )","docstring":"/**\n * Caption for \n */"} {"signature":"private fun runConsumerTest ( dependencyProject : Project , withKotlinVersion : String ? )","body":"{ if ( producerGradleVersion != consumerGradleVersion && ! isPublishedLibrary ) { println ( \"\" ) return } val repositoryLinesIfNeeded = if ( isPublishedLibrary ) \"\"\"\"\"\" . trimIndent ( ) else \"\" val dependencyNotation = if ( isPublishedLibrary ) \"\"\"\"\"\" else \"\" val usedConsumerGradleVersion : String val consumerProject = Project ( \"\" , consumerGradleVersion , minLogLevel = LogLevel . INFO ) . apply { usedConsumerGradleVersion = chooseWrapperVersionOrFinishTest ( ) projectDir . deleteRecursively ( ) if ( ! isPublishedLibrary ) { embedProject ( dependencyProject ) gradleSettingsScript ( ) . appendText ( \"\" ) } setupWorkingDir ( applyLanguageVersion = withKotlinVersion != oldKotlinVersion ) gradleBuildScript ( \"\" ) . apply { writeText ( readText ( ) . let { if ( withKotlinVersion != null ) it else it . checkedReplace ( \"\" , \"\" ) } . let { text -> if ( useFlavors ) text else text . lines ( ) . filter { ! it . trim ( ) . startsWith ( \"\" ) } . joinToString ( \"\" ) } + \"\" + \"\"\"\"\"\" . trimIndent ( ) ) } } val variantNamePublishedSuffix = if ( isPublishedLibrary ) \"\" else \"\" val variantForReleaseAndStaging = if ( isAndroidPublishDebugOnly && isPublishedLibrary ) \"\" else \"\" fun nameWithFlavorIfNeeded ( name : String ) = if ( useFlavors ) \"\" else name val configurationToExpectedVariant = listOf ( nameWithFlavorIfNeeded ( \"\" ) to nameWithFlavorIfNeeded ( \"\" ) , nameWithFlavorIfNeeded ( \"\" ) to nameWithFlavorIfNeeded ( variantForReleaseAndStaging ) , nameWithFlavorIfNeeded ( \"\" ) to if ( isPublishedLibrary ) nameWithFlavorIfNeeded ( variantForReleaseAndStaging ) else \"\" ) val dependencyInsightModuleName = if ( isPublishedLibrary ) \"\" else \"\" val consumerBuildOptions = defaultBuildOptions ( ) . copy ( javaHome = File ( System . getProperty ( \"\" ) ) , androidHome = KtTestUtil . findAndroidSdk ( ) , androidGradlePluginVersion = consumerAgpVersion , kotlinVersion = withKotlinVersion ? : defaultBuildOptions ( ) . kotlinVersion ) . suppressDeprecationWarningsOn ( \"\" ) { options -> ( ! isPublishedLibrary && ( withKotlinVersion != null || options . safeAndroidGradlePluginVersion >= AGPVersion . v7_1_0 ) || isPublishedLibrary && withKotlinVersion == oldKotlinVersion ) && GradleVersion . version ( usedConsumerGradleVersion ) >= GradleVersion . version ( TestVersions . Gradle . G_7_5 ) && options . safeAndroidGradlePluginVersion < AGPVersion . v7_3_0 } val variantCheckRequests = mutableMapOf < ResolvedVariantRequest , String > ( ) configurationToExpectedVariant . forEach { ( configuration , expected ) -> val expectedVariant = if ( withKotlinVersion == null && ! isPublishedLibrary ) { \"\" } else expected val resolvedVariantRequest = ResolvedVariantRequest ( \"\" , configuration , dependencyInsightModuleName ) variantCheckRequests [ resolvedVariantRequest ] = expectedVariant } consumerProject . apply { gradleSettingsScript ( ) . appendText ( \"\" ) projectDir . resolve ( \"\" ) . also { it . parentFile . mkdirs ( ) } . writeText ( \"\"\"\"\"\" . trimIndent ( ) ) val resolvedVariantRequest = ResolvedVariantRequest ( \"\" , \"\" , dependencyInsightModuleName ) variantCheckRequests [ resolvedVariantRequest ] = \"\" } try { ResolvedVariantChecker ( ) . assertResolvedSingleVariantsBatch ( consumerProject , variantCheckRequests , consumerBuildOptions ) } catch ( e : AssertionError ) { collector . addError ( AssertionError ( \"\" , e ) ) } }","docstring":"/** Use [withKotlinVersion] = null for testing without Kotlin Gradle plugin */"} {"signature":"public fun dropLast ( size : Int = ) : ColumnPath","body":"= ColumnPath ( path . dropLast ( size ) )","docstring":"/**\n * Returns a shortened [ColumnPath] without the last [size] elements.\n *\n * NOTE: If called from the [ColumnsSelectionDsl], you might be looking for [ColumnsSelectionDsl.dropLastChildren]\n * instead.\n */"} {"signature":"public fun dropFirst ( size : Int = ) : ColumnPath","body":"= ColumnPath ( path . drop ( size ) )","docstring":"/**\n * Returns a shortened [ColumnPath] without the first [size] elements.\n *\n * NOTE: If called from the [ColumnsSelectionDsl], you might be looking for [ColumnsSelectionDsl.dropChildren]\n * instead.\n */"} {"signature":"public fun take ( first : Int ) : ColumnPath","body":"= ColumnPath ( path . take ( first ) )","docstring":"/**\n * Returns a shortened [ColumnPath] containing just the first [first] elements.\n *\n * NOTE: If called from the [ColumnsSelectionDsl], you might be looking for [ColumnsSelectionDsl.takeCols]\n * instead.\n */"} {"signature":"public fun takeLast ( last : Int ) : ColumnPath","body":"= ColumnPath ( path . takeLast ( last ) )","docstring":"/**\n * Returns a shortened [ColumnPath] containing just the last [last] elements.\n *\n * NOTE: If called from the [ColumnsSelectionDsl], you might be looking for [ColumnsSelectionDsl.takeLast]\n * instead.\n */"} {"signature":"internal fun ColumnPath . dropStartWrt ( otherPath : ColumnPath ) : ColumnPath","body":"{ val first = dropOverlappingStartOfChild ( parent = otherPath , child = this ) return ColumnPath ( first ) }","docstring":"/**\n * Drops the overlapping start of the child path with respect to the parent path, and returns the resulting ColumnPath.\n *\n * For example:\n * ```kt\n * val parentPath = pathOf(\"a\", \"b\", \"c\")\n * val childPath = pathOf(\"a\", \"b\", \"c\", \"d\", \"e\")\n *\n * childPath.dropStartWrt(parentPath) // returns pathOf(\"d\", \"e\")\n * ```\n *\n * @param otherPath The parent path to compare against.\n * @return The resulting ColumnPath after dropping the overlapping start.\n */"} {"signature":"public fun GraphTrainableModel . loadWeights ( hdfFile : HdfFile ) : Unit","body":"= loadWeights ( hdfFile , layers )","docstring":"/**\n * Loads weights from hdf5 file created in Keras TensorFlow framework.\n *\n * @param [hdfFile] File in hdf5 file format containing weights of the model.\n */"} {"signature":"public fun GraphTrainableModel . loadWeightsForFrozenLayers ( hdfFile : HdfFile )","body":"{ loadWeights ( hdfFile , layers . filterNot ( Layer :: isTrainable ) ) }","docstring":"/**\n * Loads weights from hdf5 file created in Keras TensorFlow framework for non-trainable (or frozen) layers only.\n *\n * NOTE: Weights for trainable layers will not be loaded and will be initialized via default initializers.\n *\n * @param [hdfFile] File in hdf5 file format containing weights of Sequential model.\n */"} {"signature":"public fun GraphTrainableModel . loadWeights ( hdfFile : HdfFile , layerList : List < Layer > )","body":"{ val group = when { hdfFile . attributes . containsKey ( \"\" ) -> hdfFile hdfFile . children . containsKey ( \"\" ) -> ( hdfFile as Group ) . getChild ( \"\" ) as Group else -> null } if ( group == null ) { logger . error { \"\" + \"\" } return } if ( group . getKerasVersion ( ) == ) { throw UnsupportedOperationException ( \"\" + \"\" ) } loadWeights ( layerList ) { layer -> fillLayerWeights ( layer , group , this ) } }","docstring":"/**\n * Loads weights from hdf5 file created in Keras TensorFlow framework for pre-defined list of layers.\n *\n * NOTE: Weights for another layers will not be loaded (should be initialized manually).\n *\n * @param [hdfFile] File in hdf5 file format containing weights of Sequential model.\n * @param [layerList] List of layers to load weights. Weights for other layers will be initialized by initializer later.\n */"} {"signature":"public fun GraphTrainableModel . loadWeightsByPathTemplates ( hdfFile : HdfFile , kernelDataPathTemplate : String = KERNEL_DATA_PATH_TEMPLATE , biasDataPathTemplate : String = BIAS_DATA_PATH_TEMPLATE ) : Unit","body":"= loadWeightsByPathTemplates ( hdfFile , layers , kernelDataPathTemplate , biasDataPathTemplate )","docstring":"/**\n * Loads weights from hdf5 file created in Keras TensorFlow framework.\n *\n * @param [hdfFile] File in hdf5 file format containing weights of Sequential model.\n * @param [kernelDataPathTemplate] Template path to kernel weights of the specific layer.\n * @param [biasDataPathTemplate] Template path to bias weights of the specific layer.\n */"} {"signature":"public fun GraphTrainableModel . loadWeightsForFrozenLayersByPathTemplates ( hdfFile : HdfFile , kernelDataPathTemplate : String = KERNEL_DATA_PATH_TEMPLATE , biasDataPathTemplate : String = BIAS_DATA_PATH_TEMPLATE )","body":"{ loadWeightsByPathTemplates ( hdfFile , layers . filterNot ( Layer :: isTrainable ) , kernelDataPathTemplate , biasDataPathTemplate ) }","docstring":"/**\n * Loads weights from hdf5 file created in Keras TensorFlow framework for non-trainable (or frozen) layers only.\n *\n * NOTE: Weights for trainable layers will not be loaded and will be initialized via default initializers.\n *\n * @param [hdfFile] File in hdf5 file format containing weights of Sequential model.\n * @param [kernelDataPathTemplate] Template path to kernel weights of the specific layer.\n * @param [biasDataPathTemplate] Template path to bias weights of the specific layer.\n */"} {"signature":"public fun GraphTrainableModel . loadWeightsByPathTemplates ( hdfFile : HdfFile , layerList : List < Layer > , kernelDataPathTemplate : String = KERNEL_DATA_PATH_TEMPLATE , biasDataPathTemplate : String = BIAS_DATA_PATH_TEMPLATE )","body":"{ val layerPaths = LayerConvOrDensePaths ( \"\" , kernelDataPathTemplate , biasDataPathTemplate ) loadWeights ( layerList ) { layer -> fillLayerWeights ( layer , hdfFile , layerPaths , this ) } }","docstring":"/**\n * Loads weights from hdf5 file created in Keras TensorFlow framework for pre-defined list of layers.\n *\n * NOTE: Weights for another layers will not be loaded (should be initialized manually).\n *\n * @param [hdfFile] File in hdf5 file format containing weights of Sequential model.\n * @param [layerList] List of layers to load weights. Weights for other layers will be initialized by initializer later.\n * @param [kernelDataPathTemplate] Template path to kernel weights of the specific layer.\n * @param [biasDataPathTemplate] Template path to bias weights of the specific layer.\n */"} {"signature":"public fun GraphTrainableModel . loadWeightsByPaths ( hdfFile : HdfFile , weightPaths : List < LayerPaths > , missedWeights : MissedWeightsStrategy = MissedWeightsStrategy . INITIALIZE , forFrozenLayersOnly : Boolean = false )","body":"{ val layersToLoad = if ( forFrozenLayersOnly ) layers . filterNot ( Layer :: isTrainable ) else layers val layersToWeightPaths = layersToLoad . mapNotNull { layer -> val layerPaths = weightPaths . find { layer . name == it . layerName } if ( layerPaths == null && missedWeights == MissedWeightsStrategy . INITIALIZE ) { logger . warn { \"\" + \"\" } return@mapNotNull null } layer to layerPaths } . toMap ( ) loadWeights ( layersToWeightPaths . keys ) { layer -> fillLayerWeights ( layer , hdfFile , layersToWeightPaths [ layer ] , this ) } }","docstring":"/**\n * Loads weights from hdf5 file created in Keras TensorFlow framework.\n *\n * @param [hdfFile] File in hdf5 file format containing weights of Sequential model.\n * @param [weightPaths] Fully-specified paths to kernel and bias weights of each layer.\n *\n * NOTE: Kernel and bias will be initialized by default initializers if they are missed in [weightPaths] object.\n */"} {"signature":"public fun GraphTrainableModel . loadWeightsByPaths ( hdfFile : HdfFile , layerList : List < Layer > , kernelDataPathTemplate : String = KERNEL_DATA_PATH_TEMPLATE , biasDataPathTemplate : String = BIAS_DATA_PATH_TEMPLATE )","body":"{ val layerConvOrDensePaths = LayerConvOrDensePaths ( \"\" , kernelDataPathTemplate , biasDataPathTemplate ) loadWeights ( layerList ) { layer -> fillLayerWeights ( layer , hdfFile , layerConvOrDensePaths , this ) } }","docstring":"/**\n * Loads weights from hdf5 file created in Keras TensorFlow framework for pre-defined list of layers.\n *\n * NOTE: Weights for another layers will not be loaded (should be initialized manually).\n *\n * @param [hdfFile] File in hdf5 file format containing weights of Sequential model.\n * @param [layerList] List of layers to load weights. Weights for other layers will be initialized by initializer later.\n * @param [kernelDataPathTemplate] Template path to kernel weights of the specific layer.\n * @param [biasDataPathTemplate] Template path to bias weights of the specific layer.\n */"} {"signature":"fun vgg16prediction ( )","body":"{ val modelHub = TFModelHub ( cacheDirectory = File ( \"\" ) ) val modelType = TFModels . CV . VGG16 ( ) val model = modelHub . loadModel ( modelType ) val imageNetClassLabels = modelHub . loadClassLabels ( ) model . use { it . compile ( optimizer = Adam ( ) , loss = Losses . MAE , metric = Metrics . ACCURACY ) it . logSummary ( ) val hdfFile = modelHub . loadWeights ( modelType ) it . loadWeights ( hdfFile ) val fileDataLoader = modelType . createPreprocessing ( it ) . fileLoader ( ) for ( i in .. ) { val inputData = fileDataLoader . load ( getFileFromResource ( \"\" ) ) val res = it . predict ( inputData , \"\" ) println ( \"\" ) val top5 = it . predictTop5Labels ( inputData , imageNetClassLabels ) println ( top5 . toString ( ) ) } } }","docstring":"/**\n * This example demonstrates the inference concept on VGG'16 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 VGG'16 during training on ImageNet dataset) is applied to each image before prediction.\n * - No additional training.\n * - No new layers are added.\n *\n * @see \n * Very Deep Convolutional Networks for Large-Scale Image Recognition (ICLR 2015).\n * @see \n * Detailed description of VGG'16 model and an approach to build it in Keras.\n */"} {"signature":"fun main ( ) : Unit","body":"= vgg16prediction ( )","docstring":"/** */"} {"signature":"private fun tryToMapLibrarySourceFile ( dependencies : Iterable < ModuleDescriptor > , sourceMapPath : String ) : String ?","body":"{ for ( dependency in dependencies ) { val libraryFile = try { File ( testServices . libraryProvider . getPathByDescriptor ( dependency ) ) } catch ( e : NoSuchElementException ) { continue } val sourceRoot : File = libraryFile . parentFile ? . parentFile ? . parentFile ? . parentFile ? . parentFile ? : continue val searchPaths = listOf ( sourceRoot , sourceRoot . resolve ( \"\" ) ) for ( searchPath in searchPaths ) { val resolved = searchPath . resolve ( sourceMapPath ) if ( resolved . exists ( ) ) { return resolved . absolutePath } } } return null }","docstring":"/**\n * Some heuristics to find the library source file that this [sourceMapPath] should point to.\n * May not work in 100% of cases, but should be good enough for our tests.\n */"} {"signature":"public fun pretrainedModel ( modelHub : ModelHub ) : U","body":"public fun pretrainedModel ( modelHub : ModelHub ) : U","docstring":"/** Returns the specially prepared pre-trained model of the type U. */"} {"signature":"public fun model ( modelHub : ModelHub ) : T","body":"{ return modelHub . loadModel ( this ) }","docstring":"/** Loads the model, identified by this name, from the [modelHub]. */"} {"signature":"@ Suppress ( \"\" ) public actual inline fun Runnable ( crossinline block : ( ) -> Unit ) : Runnable","body":"= java . lang . Runnable { block ( ) }","docstring":"/**\n * Creates [Runnable] task instance.\n */"} {"signature":"@ JvmName ( \"\" ) @ JvmOverloads public fun Handler . asCoroutineDispatcher ( name : String ? = null ) : HandlerDispatcher","body":"= HandlerContext ( this , name )","docstring":"/**\n * Represents an arbitrary [Handler] as an implementation of [CoroutineDispatcher]\n * with an optional [name] for nicer debugging\n *\n * ## Rejected execution\n *\n * If the underlying handler is closed and its message-scheduling methods start to return `false` on\n * an attempt to submit a continuation task to the resulting dispatcher,\n * then the [Job] of the affected task is [cancelled][Job.cancel] and the task is submitted to the\n * [Dispatchers.IO], so that the affected coroutine can cleanup its resources and promptly complete.\n */"} {"signature":"public suspend fun awaitFrame ( ) : Long","body":"{ val choreographer = choreographer return if ( choreographer != null ) { suspendCancellableCoroutine { cont -> postFrameCallback ( choreographer , cont ) } } else { awaitFrameSlowPath ( ) } }","docstring":"/**\n * Awaits the next animation frame and returns frame time in nanoseconds.\n */"} {"signature":"public fun < T > xMax ( column : ColumnReference < T > ) : PositionalMapping < T >","body":"{ return addPositionalMapping < T > ( X_MAX , column . name ( ) , null ) }","docstring":"/**\n * Maps the `xMax` aesthetic to a data column specified by a [ColumnReference].\n *\n * @param column the data column to be mapped.\n * @return a [PositionalMapping] object representing the mapping.\n */"} {"signature":"public fun < T > xMax ( column : KProperty < T > ) : PositionalMapping < T >","body":"{ return addPositionalMapping < T > ( X_MAX , column . name , null ) }","docstring":"/**\n * Maps the `xMax` aesthetic to a data column specified by a [KProperty].\n *\n * @param column the data column to be mapped.\n * @return a [PositionalMapping] object representing the mapping.\n */"} {"signature":"public fun xMax ( column : String ) : PositionalMapping < Any ? >","body":"{ return addPositionalMapping ( X_MAX , column , null ) }","docstring":"/**\n * Maps the `xMax` aesthetic to a data column specified by a [String].\n *\n * @param column the data column to be mapped.\n * @return a [PositionalMapping] object representing the mapping.\n */"} {"signature":"public fun < T > xMax ( values : Iterable < T > ) : PositionalMapping < T >","body":"{ return addPositionalMapping < T > ( X_MAX , values . toList ( ) , null , null ) }","docstring":"/**\n * Maps the `xMax` 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 > xMax ( values : DataColumn < T > ) : PositionalMapping < T >","body":"{ return addPositionalMapping < T > ( X_MAX , values , null ) }","docstring":"/**\n * Maps the `xMax` 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":"internal fun KonanTarget . enabledOnCurrentHostForKlibCompilation ( provider : PropertiesProvider )","body":"= HostManager ( ) . isEnabled ( this ) || provider . enableKlibsCrossCompilation","docstring":"/**\n * Returns whether klib compilation is allowed for [this]-target on the current host.\n * [enabledOnCurrentHostForBinariesCompilation] returns 'true' only if [enabledOnCurrentHostForKlibCompilation]\n * returns 'true'\n *\n * [enabledOnCurrentHostForKlibCompilation] might return 'true' in some cases where [enabledOnCurrentHostForBinariesCompilation]\n * returns 'false' (e.g.: compile a klib for iOS target on Linux when the code depends only on Kotlin Stdlib)\n *\n * Ideally, these APIs should be in [HostManager] instead of KGP-side wrappers. Refer to KT-64512 for that\n */"} {"signature":"protected fun isCompatibleTo ( ourVersion : BinaryVersion ) : Boolean","body":"{ return if ( major == ) ourVersion . major == && minor == ourVersion . minor else major == ourVersion . major && minor <= ourVersion . minor }","docstring":"/**\n * Returns true if this version of some format loaded from some binaries is compatible\n * to the expected version of that format in the current compiler.\n *\n * @param ourVersion the version of this format in the current compiler\n */"} {"signature":"fun lerp ( start : Int , stop : Int , fraction : Float ) : Int","body":"{ return start + ( ( stop - start ) * fraction . toDouble ( ) ) . roundToInt ( ) }","docstring":"/**\n * Linearly interpolate between [start] and [stop] with [fraction] fraction between them.\n */"} {"signature":"fun lerp ( start : Long , stop : Long , fraction : Float ) : Long","body":"{ return start + ( ( stop - start ) * fraction . toDouble ( ) ) . roundToLong ( ) }","docstring":"/**\n * Linearly interpolate between [start] and [stop] with [fraction] fraction between them.\n */"} {"signature":"fun libraryDefinition ( buildAction : ( LibraryDefinitionImpl ) -> Unit ) : LibraryDefinition","body":"{ return LibraryDefinitionImpl . build ( buildAction ) }","docstring":"/**\n * Builds an instance of [LibraryDefinition].\n * Build action receives [LibraryDefinitionImpl] as an explicit argument\n * because of problems with names clashing that may arise.\n */"} {"signature":"actual fun getCurrentDate ( ) : String","body":"{ return \"\" }","docstring":"/**\n * JVM actual implementation for `getCurrentDate`\n */"} {"signature":"override fun beforeEach ( extensionContext : ExtensionContext ) : Unit","body":"= with ( extensionContext ) { val settings = createTestRunSettings ( ) with ( settings . get < BlackBoxTestInstances > ( ) . enclosingTestInstance ) { testRunSettings = settings testRunProvider = getOrCreateTestRunProvider ( ) } }","docstring":"/**\n * Note: [BeforeEachCallback.beforeEach] allows accessing test instances while [BeforeAllCallback.beforeAll] which may look\n * more preferable here does not allow it because it is called at the time when test instances are not created yet.\n * Also, [TestInstancePostProcessor.postProcessTestInstance] allows accessing only the currently created test instance and does\n * not allow accessing its parent test instance in case there are inner test classes in the generated test suite.\n */"} {"signature":"override fun beforeEach ( extensionContext : ExtensionContext ) : Unit","body":"= with ( extensionContext ) { val settings = createSimpleTestRunSettings ( ) with ( settings . get < SimpleTestInstances > ( ) . enclosingTestInstance ) { testRunSettings = settings testRunProvider = getOrCreateSimpleTestRunProvider ( ) } }","docstring":"/**\n * Note: [BeforeEachCallback.beforeEach] allows accessing test instances while [BeforeAllCallback.beforeAll] which may look\n * more preferable here does not allow it because it is called at the time when test instances are not created yet.\n * Also, [TestInstancePostProcessor.postProcessTestInstance] allows accessing only the currently created test instance and does\n * not allow accessing its parent test instance in case there are inner test classes in the generated test suite.\n */"} {"signature":"fun ExtensionContext . getOrCreateTestProcessSettings ( ) : TestProcessSettings","body":"= root . getStore ( NAMESPACE ) . getOrComputeIfAbsent ( TestProcessSettings :: class . java . name ) { val nativeHome = computeNativeHome ( ) System . setProperty ( \"\" , nativeHome . dir . path ) setUpMemoryTracking ( ) TestProcessSettings ( nativeHome , computeNativeClassLoader ( ) , computeBaseDirs ( ) , LLDB ( nativeHome ) ) } as TestProcessSettings","docstring":"/*************** Test process settings ***************/"} {"signature":"fun computeNativeClassLoader ( parent : ClassLoader ? = null ) : KotlinNativeClassLoader","body":"= KotlinNativeClassLoader ( lazy { val nativeClassPath = ProcessLevelProperty . COMPILER_CLASSPATH . readValue ( ) . split ( File . pathSeparatorChar ) . map { File ( it ) . toURI ( ) . toURL ( ) } . toTypedArray ( ) URLClassLoader ( nativeClassPath , parent ) . apply { setDefaultAssertionStatus ( true ) } } )","docstring":"/**\n * - For Codegen native tests, no parent classloader should be provided,\n * since compiler `class K2Native: CLICompiler` is invoked via reflection with kotlinNativeClassLoader,\n * so both classes K2Native and CLICompiler need to be loaded with same nativeclassloader.\n * This way, `K2Native.doExecute()` method would define abstract method `CLICompiler.doExecute()`.\n * With parent classloader, these two classes would be loaded by different classloaders and AbstractMethodError is thrown\n * - For irText tests, classloaded mangler instance is passed to generate mangles to IR dumps files.\n * For this, a cast of mangler object(within K/N classloader) to mangler interface(within app classloader) is needed,\n * which is possible when app classloader is provided as parent.\n */"} {"signature":"private fun ExtensionContext . addCommonTestClassSettingsTo ( enclosingTestClass : Class < * > , output : MutableCollection < Any > ) : KotlinNativeTargets","body":"{ val enforcedProperties = EnforcedProperties ( enclosingTestClass ) val optimizationMode = computeOptimizationMode ( enforcedProperties ) val threadStateChecker = computeThreadStateChecker ( enforcedProperties ) if ( threadStateChecker == ThreadStateChecker . ENABLED ) { assertEquals ( OptimizationMode . DEBUG , optimizationMode ) { \"\" } } val sanitizer = computeSanitizer ( enforcedProperties ) val gcType = computeGCType ( enforcedProperties ) val gcScheduler = computeGCScheduler ( enforcedProperties ) val allocator = computeAllocator ( enforcedProperties ) val nativeHome = getOrCreateTestProcessSettings ( ) . get < KotlinNativeHome > ( ) val distribution = Distribution ( nativeHome . dir . path ) val hostManager = HostManager ( ) val nativeTargets = computeNativeTargets ( enforcedProperties , hostManager ) val cacheMode = computeCacheMode ( enforcedProperties , distribution , nativeTargets , optimizationMode ) if ( cacheMode != CacheMode . WithoutCache ) { assertEquals ( ThreadStateChecker . DISABLED , threadStateChecker ) { \"\" } assertEquals ( Sanitizer . NONE , sanitizer ) { \"\" } } output += optimizationMode output += threadStateChecker output += gcType output += gcScheduler output += allocator output += nativeTargets output += sanitizer output += CacheMode :: class to cacheMode output += computeTestMode ( enforcedProperties ) output += computeCompilerPlugins ( enforcedProperties ) output += computeCustomKlibs ( enforcedProperties ) output += computeTestKind ( enforcedProperties ) output += computeForcedNoopTestRunner ( enforcedProperties ) output += computeSharedExecutionTestRunner ( enforcedProperties ) output += computeTimeouts ( enforcedProperties ) output += computePipelineType ( enforcedProperties , testClass . get ( ) ) output += computeUsedPartialLinkageConfig ( enclosingTestClass ) output += computeCompilerOutputInterceptor ( enforcedProperties ) output += computeBinaryLibraryKind ( enforcedProperties ) output += computeCInterfaceMode ( enforcedProperties ) return nativeTargets }","docstring":"/*************** Test class settings (common part) ***************/"} {"signature":"private fun ExtensionContext . getOrCreateTestClassSettings ( ) : TestClassSettings","body":"= root . getStore ( NAMESPACE ) . getOrComputeIfAbsent ( testClassKeyFor < TestClassSettings > ( ) ) { val enclosingTestClass = enclosingTestClass val testProcessSettings = getOrCreateTestProcessSettings ( ) val computedTestConfiguration = computeTestConfiguration ( enclosingTestClass ) . run { if ( TestGroupCreation . getFromProperty ( ) == TestGroupCreation . EAGER && configuration . providerClass == ExtTestCaseGroupProvider :: class ) { val annotation = UseEagerExtTestCaseGroupProvider ( ) val testConfiguration = annotation . annotationClass . findAnnotation < TestConfiguration > ( ) ? : error ( \"\" ) ComputedTestConfiguration ( testConfiguration , annotation ) } else { this } } val settings = buildList { val nativeTargets = addCommonTestClassSettingsTo ( enclosingTestClass , this ) this += computedTestConfiguration this += computeBinariesForBlackBoxTests ( testProcessSettings . get ( ) , nativeTargets , enclosingTestClass ) computedTestConfiguration . configuration . requiredSettings . forEach { clazz -> this += when ( clazz ) { TestRoots :: class -> computeTestRoots ( enclosingTestClass ) GeneratedSources :: class -> computeGeneratedSourceDirs ( testProcessSettings . get ( ) , nativeTargets , enclosingTestClass ) DisabledTestDataFiles :: class -> computeDisabledTestDataFiles ( enclosingTestClass ) else -> fail { \"\" } } } } TestClassSettings ( parent = testProcessSettings , settings ) } as TestClassSettings","docstring":"/*************** Test class settings (for black box tests only) ***************/"} {"signature":"private fun computeBinariesForBlackBoxTests ( baseDirs : BaseDirs , targets : KotlinNativeTargets , enclosingTestClass : Class < * > ) : Binaries","body":"{ val testBinariesDir = baseDirs . testBuildDir . resolve ( \"\" ) . resolve ( \"\" ) . ensureExistsAndIsEmptyDirectory ( ) return Binaries ( testBinariesDir = testBinariesDir , lazySharedBinariesDir = { testBinariesDir . resolve ( SHARED_MODULES_DIR_NAME ) . ensureExistsAndIsEmptyDirectory ( ) } , lazyGivenBinariesDir = { testBinariesDir . resolve ( GIVEN_MODULES_DIR_NAME ) . ensureExistsAndIsEmptyDirectory ( ) } ) }","docstring":"/** See also [computeBinariesForSimpleTests] */"} {"signature":"private fun ExtensionContext . getOrCreateSimpleTestClassSettings ( ) : SimpleTestClassSettings","body":"= root . getStore ( NAMESPACE ) . getOrComputeIfAbsent ( testClassKeyFor < SimpleTestClassSettings > ( ) ) { SimpleTestClassSettings ( parent = getOrCreateTestProcessSettings ( ) , buildList { addCommonTestClassSettingsTo ( enclosingTestClass , this ) } ) } as SimpleTestClassSettings","docstring":"/*************** Test class settings (simplified) ***************/"} {"signature":"fun ExtensionContext . createTestRunSettings ( ) : TestRunSettings","body":"{ val testInstances = computeBlackBoxTestInstances ( ) return TestRunSettings ( parent = getOrCreateTestClassSettings ( ) , listOfNotNull ( testInstances , ( testInstances . enclosingTestInstance as? ExternalSourceTransformersProvider ) ? . let { ExternalSourceTransformersProvider :: class to it } ) ) }","docstring":"/*************** Test run settings (for black box tests only) ***************/"} {"signature":"fun ExtensionContext . createSimpleTestRunSettings ( ) : SimpleTestRunSettings","body":"{ val testClassSettings = getOrCreateSimpleTestClassSettings ( ) return SimpleTestRunSettings ( parent = testClassSettings , listOf ( computeSimpleTestInstances ( ) , computeBinariesForSimpleTests ( testClassSettings . get ( ) , testClassSettings . get ( ) ) ) ) }","docstring":"/*************** Test run settings (simplified) ***************/"} {"signature":"private fun ExtensionContext . computeBinariesForSimpleTests ( baseDirs : BaseDirs , targets : KotlinNativeTargets ) : Binaries","body":"{ val compressedClassNames = testClasses . map ( Class < * > :: compressedSimpleName ) . joinToString ( separator = \"\" ) val testBinariesDir = baseDirs . testBuildDir . resolve ( \"\" ) . resolve ( \"\" ) . resolve ( requiredTestMethod . name ) . ensureExistsAndIsEmptyDirectory ( ) return Binaries ( testBinariesDir = testBinariesDir , lazySharedBinariesDir = { testBinariesDir . resolve ( SHARED_MODULES_DIR_NAME ) . ensureExistsAndIsEmptyDirectory ( ) } , lazyGivenBinariesDir = { testBinariesDir . resolve ( GIVEN_MODULES_DIR_NAME ) . ensureExistsAndIsEmptyDirectory ( ) } ) }","docstring":"/** See also [computeBinariesForBlackBoxTests] */"} {"signature":"fun ExtensionContext . getOrCreateTestRunProvider ( ) : TestRunProvider","body":"= root . getStore ( NAMESPACE ) . getOrComputeIfAbsent ( testClassKeyFor < TestRunProvider > ( ) ) { val testCaseGroupProvider = createTestCaseGroupProvider ( getOrCreateTestClassSettings ( ) . get ( ) ) TestRunProvider ( testCaseGroupProvider ) } as TestRunProvider","docstring":"/*************** Test run provider (for black box tests only) ***************/"} {"signature":"fun getOrCreateSimpleTestRunProvider ( ) : SimpleTestRunProvider","body":"= SimpleTestRunProvider","docstring":"/*************** Test run provider (for black box tests only) ***************/"} {"signature":"fun compile ( allModules : Collection < IrModuleFragment > , dirtyFiles : Collection < IrFile > ) : List < ( ) -> JsIrProgramFragments >","body":"fun compile ( allModules : Collection < IrModuleFragment > , dirtyFiles : Collection < IrFile > ) : List < ( ) -> JsIrProgramFragments >","docstring":"/**\n * It is expected that the method implementation runs a lowering pipeline\n * and produces a list of generators capable of generating JS AST fragments.\n */"} {"signature":"fun createCompilerForIC ( mainModule : IrModuleFragment , configuration : CompilerConfiguration ) : JsIrCompilerICInterface","body":"fun createCompilerForIC ( mainModule : IrModuleFragment , configuration : CompilerConfiguration ) : JsIrCompilerICInterface","docstring":"/**\n * It is expected that the method implementation creates a backend context and initializes all builtins and intrinsics.\n */"} {"signature":"fun actualizeCaches ( ) : List < ModuleArtifact >","body":"{ stopwatch . clear ( ) dirtyFileStats . clear ( ) val ( incrementalCachesArtifacts , moduleNames , generators ) = loadIrAndMakeIrFragmentGenerators ( ) val rebuiltFragments = generateIrFragments ( generators ) return commitCacheAndBuildModuleArtifacts ( incrementalCachesArtifacts , moduleNames , rebuiltFragments ) }","docstring":"/**\n * This method performs the following routine:\n * - Estimates dirty files that must be relowered;\n * - Creates a compiler instance by calling [compilerInterfaceFactory];\n * - Runs the compiler (lowering pipeline) for the dirty files (see [JsIrCompilerICInterface]);\n * - Transforms lowered IR to JS AST fragments [JsIrProgramFragments];\n * - Saves the cache data on the disk.\n *\n * @return A module artifact list, where [ModuleArtifact] represents a compiled klib.\n * It contains either paths to files with serialized JS AST or the deserialized [JsIrProgramFragments] objects themselves\n * for every file in the generating JS module. The list should be used for building the final JS module in [JsExecutableProducer]\n */"} {"signature":"fun KtModule . getFirResolveSession ( project : Project ) : LLFirResolveSession","body":"= LLFirResolveSessionService . getInstance ( project ) . getFirResolveSession ( this )","docstring":"/**\n * Returns [LLFirResolveSession] which corresponds to containing module\n */"} {"signature":"fun KtDeclaration . resolveToFirSymbol ( firResolveSession : LLFirResolveSession , phase : FirResolvePhase = FirResolvePhase . RAW_FIR , ) : FirBasedSymbol < * >","body":"{ return firResolveSession . resolveToFirSymbol ( this , phase ) }","docstring":"/**\n * Creates [FirBasedSymbol] by [KtDeclaration] .\n * returned [FirDeclaration] will be resolved at least to [phase]\n *\n */"} {"signature":"@ Suppress ( \"\" , \"\" ) inline fun < reified S : FirBasedSymbol < * > > KtDeclaration . resolveToFirSymbolOfType ( firResolveSession : LLFirResolveSession , phase : FirResolvePhase = FirResolvePhase . RAW_FIR , ) : @ kotlin . internal . NoInfer S","body":"{ val symbol = resolveToFirSymbol ( firResolveSession , phase ) if ( symbol !is S ) { throwUnexpectedFirElementError ( symbol , this , S :: class ) } return symbol }","docstring":"/**\n * Creates [FirBasedSymbol] by [KtDeclaration] .\n * returned [FirDeclaration] will be resolved at least to [phase]\n *\n * If resulted [FirBasedSymbol] is not subtype of [S], throws [InvalidFirElementTypeException]\n */"} {"signature":"@ Suppress ( \"\" , \"\" ) inline fun < reified S : FirBasedSymbol < * > > KtDeclaration . resolveToFirSymbolOfTypeSafe ( firResolveSession : LLFirResolveSession , phase : FirResolvePhase = FirResolvePhase . RAW_FIR , ) : @ kotlin . internal . NoInfer S ?","body":"{ return resolveToFirSymbol ( firResolveSession , phase ) as? S }","docstring":"/**\n * Creates [FirBasedSymbol] by [KtDeclaration] .\n * returned [FirDeclaration] will be resolved at least to [phase]\n *\n * If resulted [FirBasedSymbol] is not subtype of [S], returns `null`\n */"} {"signature":"fun KtElement . getDiagnostics ( firResolveSession : LLFirResolveSession , filter : DiagnosticCheckerFilter ) : Collection < KtPsiDiagnostic >","body":"= firResolveSession . getDiagnostics ( this , filter )","docstring":"/**\n * Returns a list of Diagnostics compiler finds for given [KtElement]\n * This operation could be performance affective because it create FIleStructureElement and resolve non-local declaration into BODY phase\n */"} {"signature":"fun KtFile . collectDiagnosticsForFile ( firResolveSession : LLFirResolveSession , filter : DiagnosticCheckerFilter ) : Collection < KtPsiDiagnostic >","body":"= firResolveSession . collectDiagnosticsForFile ( this , filter )","docstring":"/**\n * Returns a list of Diagnostics compiler finds for given [KtFile]\n * This operation could be performance affective because it create FIleStructureElement and resolve non-local declaration into BODY phase\n */"} {"signature":"fun KtElement . getOrBuildFir ( firResolveSession : LLFirResolveSession , ) : FirElement ?","body":"= firResolveSession . getOrBuildFirFor ( this )","docstring":"/**\n * Build [FirElement] node in its final resolved state for a requested element.\n *\n * Note: that it isn't always [BODY_RESOLVE][FirResolvePhase.BODY_RESOLVE]\n * as not all declarations have types/bodies/etc. to resolve.\n *\n * This operation could be time-consuming because it creates\n * [FileStructureElement][org.jetbrains.kotlin.analysis.low.level.api.fir.file.structure.FileStructureElement]\n * and may resolve non-local declarations into [BODY_RESOLVE][FirResolvePhase.BODY_RESOLVE] phase.\n *\n * Please use [getOrBuildFirFile] to get [FirFile] in undefined phase.\n *\n * @return associated [FirElement] in final resolved state if it exists.\n *\n * @see getOrBuildFirFile\n * @see LLFirResolveSession.getOrBuildFirFor\n */"} {"signature":"inline fun < reified E : FirElement > KtElement . getOrBuildFirSafe ( firResolveSession : LLFirResolveSession , )","body":"= getOrBuildFir ( firResolveSession ) as? E","docstring":"/**\n * Get a [FirElement] which was created by [KtElement], but only if it is subtype of [E], `null` otherwise\n * Returned [FirElement] is guaranteed to be resolved to [FirResolvePhase.BODY_RESOLVE] phase\n * This operation could be performance affective because it create FIleStructureElement and resolve non-local declaration into BODY phase\n */"} {"signature":"inline fun < reified E : FirElement > KtElement . getOrBuildFirOfType ( firResolveSession : LLFirResolveSession , ) : E","body":"{ val fir = getOrBuildFir ( firResolveSession ) if ( fir is E ) return fir throwUnexpectedFirElementError ( fir , this , E :: class ) }","docstring":"/**\n * Get a [FirElement] which was created by [KtElement], but only if it is subtype of [E], throws [InvalidFirElementTypeException] otherwise\n * Returned [FirElement] is guaranteed to be resolved to [FirResolvePhase.BODY_RESOLVE] phase\n * This operation could be performance affective because it create FIleStructureElement and resolve non-local declaration into BODY phase\n */"} {"signature":"fun KtFile . getOrBuildFirFile ( firResolveSession : LLFirResolveSession ) : FirFile","body":"= firResolveSession . getOrBuildFirFile ( this )","docstring":"/**\n * Get a [FirFile] which was created by [KtElement]\n * Returned [FirFile] can be resolved to any phase from [FirResolvePhase.RAW_FIR] to [FirResolvePhase.BODY_RESOLVE]\n */"} {"signature":"public actual fun CharSequence . elementAt ( index : Int ) : Char","body":"{ return elementAtOrElse ( index ) { throw IndexOutOfBoundsException ( \"\" ) } }","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":"override fun visitFunctionExpression ( expression : IrFunctionExpression )","body":"{ if ( expression . type . isSyntheticComposableFunction ( ) ) { expression . function . mark ( ) } super . visitFunctionExpression ( expression ) }","docstring":"/**\n * This function propagates the special function type kind for composable to function expressions like lambda expression.\n */"} {"signature":"override fun visitFunctionReference ( expression : IrFunctionReference )","body":"{ if ( expression . type . isSyntheticComposableFunction ( ) ) { expression . symbol . owner . mark ( ) } super . visitFunctionReference ( expression ) }","docstring":"/**\n * This function propagates the special function type kind for composable to function references.\n */"} {"signature":"public inline fun < P : KotlinComposableProvider , reified T : P > List < P > . mergeSpecificProviders ( factory : KotlinCompositeProviderFactory < P > , crossinline mergeTargets : ( List < T > ) -> P , ) : P","body":"{ return factory . createFlattened ( factory . flatten ( this ) . mergeOnly < _ , T > { mergeTargets ( it ) } ) }","docstring":"/**\n * Uses the given [factory] to merge all providers of type [T] with the given [mergeTargets] strategy. Other providers (not of type [T]) are\n * added to the resulting composite provider unmerged.\n */"} {"signature":"fun KotlinLibraryLayoutImpl . extract ( file : File ) : File","body":"= extract ( this . klib , file )","docstring":"/**\n * This class and its children automatically extracts pieces of the library on first access. Use it if you need\n * to pass extracted files to an external tool. Otherwise, stick to [FromZipBaseLibraryImpl].\n */"} {"signature":"fun multiPoseDetectionMoveNetLightAPI ( )","body":"{ val modelHub = ONNXModelHub ( cacheDirectory = File ( \"\" ) ) val model = ONNXModels . PoseDetection . MoveNetMultiPoseLighting . pretrainedModel ( modelHub ) model . printSummary ( ) model . use { poseDetectionModel -> val result = mutableMapOf < BufferedImage , MultiPoseDetectionResult > ( ) for ( i in .. ) { val image = ImageConverter . toBufferedImage ( getFileFromResource ( \"\" ) ) val detectedPoses = poseDetectionModel . detectPoses ( image = image , confidence = ) detectedPoses . poses . forEach { ( bbox , pose ) -> println ( \"\" ) pose . landmarks . forEach { println ( \"\" ) } pose . edges . forEach { println ( \"\" ) } } result [ image ] = detectedPoses } val panel = JPanel ( ) panel . layout = BoxLayout ( panel , BoxLayout . PAGE_AXIS ) val width = for ( ( image , detectedPoses ) in result ) { val displayedImage = pipeline < BufferedImage > ( ) . resize { outputWidth = width ; outputHeight = width * image . height / image . width } . apply ( image ) panel . add ( createMultipleDetectedPosesPanel ( displayedImage , detectedPoses ) ) } showFrame ( \"\" , panel ) } }","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":"= multiPoseDetectionMoveNetLightAPI ( )","docstring":"/** */"} {"signature":"@ JvmStatic fun ScriptHandler . configureBuildScript ( rootProject : Project )","body":"{ rootProject . checkRedirect ( repositories , \"\" ) }","docstring":"/**\n * Substitutes repositories in buildScript { } block.\n */"} {"signature":"@ JvmStatic fun configureJsPackageManagers ( project : Project )","body":"{ project . configureYarnAndNodeRedirects ( ) }","docstring":"/**\n * Configures JS-specific extensions to use\n */"} {"signature":"@ JvmStatic fun configureWasmNodeRepositories ( project : Project )","body":"{ val extension = project . extensions . findByType < NodeJsRootExtension > ( ) if ( extension != null ) { extension . nodeVersion = \"\" extension . nodeDownloadBaseUrl = \"\" } project . tasks . withType < KotlinNpmInstallTask > ( ) . configureEach { args . add ( \"\" ) } }","docstring":"/**\n * Temporary repositories to depend on until GC milestone 4 in KGP\n * and stable Node release. Safe to remove when its removal does not break WASM tests.\n */"} {"signature":"fun FunctionSymbolMarker . allOverriddenDeclarationsRecursive ( ) : Sequence < CallableSymbolMarker >","body":"fun FunctionSymbolMarker . allOverriddenDeclarationsRecursive ( ) : Sequence < CallableSymbolMarker >","docstring":"/**\n * Returns all symbols that are overridden by [this] symbol\n */"} {"signature":"fun skipCheckingAnnotationsOfActualClassMember ( actualMember : DeclarationSymbolMarker ) : Boolean","body":"fun skipCheckingAnnotationsOfActualClassMember ( actualMember : DeclarationSymbolMarker ) : Boolean","docstring":"/**\n * Determines whether it is needed to skip checking annotations on class member in [AbstractExpectActualAnnotationMatchChecker].\n *\n * This is needed to prevent checking member twice if it is real `actual` member (not fake override or member of\n * class being typealiased).\n * Example:\n * ```\n * actual class A {\n * actual fun foo() {} // 1: checked itself, 2: checked as member of A\n * }\n * ```\n */"} {"signature":"@ SinceKotlin ( \"\" ) fun KCallable < * > . findParameterByName ( name : String ) : KParameter ?","body":"{ return parameters . singleOrNull { it . name == name } }","docstring":"/**\n * Returns the parameter of this callable with the given name, or `null` if there's no such parameter.\n */"} {"signature":"@ SinceKotlin ( \"\" ) suspend fun < R > KCallable < R > . callSuspend ( vararg args : Any ? ) : R","body":"{ if ( ! this . isSuspend ) return call ( * args ) if ( this !is KFunction < * > ) throw IllegalArgumentException ( \"\" ) val result = suspendCoroutineUninterceptedOrReturn < R > { call ( * args , it ) } @ Suppress ( \"\" ) if ( returnType . classifier == Unit :: class && ! returnType . isMarkedNullable ) return ( Unit as R ) return result }","docstring":"/**\n * Calls a callable in the current suspend context. If the callable is not a suspend function, behaves as [KCallable.call].\n * Otherwise, calls the suspend function with current continuation.\n */"} {"signature":"@ SinceKotlin ( \"\" ) suspend fun < R > KCallable < R > . callSuspendBy ( args : Map < KParameter , Any ? > ) : R","body":"{ if ( ! this . isSuspend ) return callBy ( args ) if ( this !is KFunction < * > ) throw IllegalArgumentException ( \"\" ) val kCallable = asKCallableImpl ( ) ? : throw KotlinReflectionInternalError ( \"\" ) val result = suspendCoroutineUninterceptedOrReturn < R > { kCallable . callDefaultMethod ( args , it ) } @ Suppress ( \"\" ) if ( returnType . classifier == Unit :: class && ! returnType . isMarkedNullable ) return ( Unit as R ) return result }","docstring":"/**\n * Calls a callable in the current suspend context. If the callable is not a suspend function, behaves as [KCallable.callBy].\n * Otherwise, calls the suspend function with current continuation.\n */"} {"signature":"@ Test fun testSchedulerDisposed ( ) : Unit","body":"= runTest { val dispatcher = currentDispatcher ( ) as CoroutineDispatcher val scheduler = dispatcher . asScheduler ( ) testRunnableDisposed ( scheduler :: scheduleDirect ) }","docstring":"/**\n * Test that we don't get an OOM if we schedule many jobs at once.\n * It's expected that if you don't dispose you'd see an OOM error.\n */"} {"signature":"private fun keepMe ( a : ByteArray )","body":"{ Thread . sleep ( a . size / ( a . size + ) + ) }","docstring":"/**\n * Test function that holds a reference. Used for testing OOM situations\n */"} {"signature":"@ Test fun testSchedulerDisposedDuringDelay ( ) : Unit","body":"= runTest { val dispatcher = currentDispatcher ( ) as CoroutineDispatcher val scheduler = dispatcher . asScheduler ( ) testRunnableDisposedDuringDelay ( scheduler :: scheduleDirect ) }","docstring":"/**\n * Test that we don't get an OOM if we schedule many delayed jobs at once. It's expected that if you don't dispose that you'd\n * see a OOM error.\n */"} {"signature":"@ JvmName ( \"\" ) public fun < T : Number , D : Dimension > Math . cos ( a : MultiArray < T , D > ) : NDArray < Double , D >","body":"= this . mathEx . cos ( a )","docstring":"/**\n * Returns a ndarray of Double from the given ndarray to each element of which a cos function has been applied.\n */"} {"signature":"@ JvmName ( \"\" ) public fun < D : Dimension > Math . cos ( a : MultiArray < Float , D > ) : NDArray < Float , D >","body":"= this . mathEx . cosF ( a )","docstring":"/**\n * Returns a ndarray of Float from the given ndarray to each element of which a cos function has been applied.\n */"} {"signature":"@ JvmName ( \"\" ) public fun < D : Dimension > Math . cos ( a : MultiArray < ComplexFloat , D > ) : NDArray < ComplexFloat , D >","body":"= this . mathEx . cosCF ( a )","docstring":"/**\n * Returns a ndarray of [ComplexFloat] from the given ndarray to each element of which a cos function has been applied.\n */"} {"signature":"@ JvmName ( \"\" ) public fun < D : Dimension > Math . cos ( a : MultiArray < ComplexDouble , D > ) : NDArray < ComplexDouble , D >","body":"= this . mathEx . cosCD ( a )","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 usage ( )","body":"{ }","docstring":"/**\n * [test.function]\n * [function]\n * \n * [Base.function]\n * [test.Base.function]\n */"} {"signature":"@ kotlin . internal . InlineOnly public inline fun < T > java . util . Enumeration < T > . asSequence ( ) : Sequence < T >","body":"= this . iterator ( ) . asSequence ( )","docstring":"/**\n * Creates a sequence that returns all values from this enumeration. The sequence is constrained to be iterated only once.\n * @sample samples.collections.Sequences.Building.sequenceFromEnumeration\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalTime :: class ) @ kotlin . internal . InlineOnly public inline fun Duration . toJavaDuration ( ) : java . time . Duration","body":"= toComponents { seconds , nanoseconds -> java . time . Duration . ofSeconds ( seconds , nanoseconds . toLong ( ) ) }","docstring":"/**\n * Converts [kotlin.time.Duration][Duration] value to [java.time.Duration][java.time.Duration] value.\n *\n * An infinite duration is converted to either [Long.MAX_VALUE], or [Long.MIN_VALUE] seconds, depending on its sign.\n */"} {"signature":"@ Test fun testOperatorFusion ( )","body":"= runTest { val sh = emptyFlow < Int > ( ) . shareIn ( this , SharingStarted . Eagerly ) assertTrue ( sh !is MutableSharedFlow < * > ) assertSame ( sh , ( sh as Flow < * > ) . cancellable ( ) ) assertSame ( sh , ( sh as Flow < * > ) . flowOn ( Dispatchers . Default ) ) assertSame ( sh , sh . buffer ( Channel . RENDEZVOUS ) ) coroutineContext . cancelChildren ( ) }","docstring":"/**\n * Test perfect fusion for operators **after** [shareIn].\n */"} {"signature":"@ Test fun testChannelFlowBufferShareIn ( )","body":"= runTest { expect ( ) val flow = channelFlow { for ( i in .. ) { assertTrue ( trySend ( i ) . isSuccess ) } send ( ) } . buffer ( ) val shared = flow . shareIn ( this , SharingStarted . Eagerly ) shared . takeWhile { it > } . collect { i -> expect ( i + ) } finish ( ) }","docstring":"/**\n * Tests that `channelFlow { ... }.buffer(x)` works according to the [channelFlow] docs, and subsequent\n * application of [shareIn] does not leak upstream.\n */"} {"signature":"private fun < T > T . annotationsForTransformationTo ( map : MutableMap < FirElementWithResolveState , List < FirAnnotation > > , ) where T : FirAnnotationContainer , T : FirElementWithResolveState","body":"{ when ( this ) { is FirFunction -> { valueParameters . forEach { it . annotationsForTransformationTo ( map ) } } is FirProperty -> { getter ? . annotationsForTransformationTo ( map ) setter ? . annotationsForTransformationTo ( map ) backingField ? . annotationsForTransformationTo ( map ) } } if ( annotations . isEmpty ( ) ) return var hasApplicableAnnotation = false val containerForAnnotations = ArrayList < FirAnnotation > ( annotations . size ) for ( annotation in annotations ) { val userTypeRef = ( annotation as? FirAnnotationCall ) ? . annotationTypeRef as? FirUserTypeRef containerForAnnotations += if ( userTypeRef != null && transformer . annotationTransformer . shouldRunAnnotationResolve ( userTypeRef ) ) { hasApplicableAnnotation = true buildAnnotationCallCopy ( annotation ) { annotationTypeRef = transformer . annotationTransformer . createDeepCopyOfTypeRef ( userTypeRef ) if ( FirLazyBodiesCalculator . needCalculatingAnnotationCall ( annotation ) ) { argumentList = FirLazyBodiesCalculator . calculateLazyArgumentsForAnnotation ( annotation , llFirSession ) } } } else { annotation } } if ( hasApplicableAnnotation ) { map [ this ] = containerForAnnotations } }","docstring":"/**\n * @return true if at least one applicable annotation is present\n */"} {"signature":"public abstract fun KtAnalysisSession . getNavigationTargets ( element : KtElement ) : Collection < PsiElement >","body":"public abstract fun KtAnalysisSession . getNavigationTargets ( element : KtElement ) : Collection < PsiElement >","docstring":"/**\n * Provides a [PsiElement] which will be opened on a navigation request for [element].\n *\n * Usually returns a single result. Might return an empty collection if there is no navigation target.\n * Also, might multiple targets in a case of ambiguity or multiple targets for a [symbol]\n *\n * Returned [PsiElement] will be used as a navigation target inside the IDE.\n */"} {"signature":"internal fun IrModuleFragment . stubOrphanedExpectSymbols ( stubGenerator : DeclarationStubGenerator )","body":"{ val transformer = StubOrphanedExpectSymbolTransformer ( stubGenerator ) files . forEach ( transformer :: visitFile ) }","docstring":"/**\n * Replaces `expect` symbols for which no `actual` counterpart exists with an `actual` stub in all files of the [IrModuleFragment]. The\n * implementation keeps track of generated stubs and only generates a single stub for each unique `expect` symbol.\n *\n * [stubOrphanedExpectSymbols] is used by the IDE bytecode tool window to allow compiling source files with `expect` declarations for which\n * the compiled module has no `actual` declaration. (The `actual` declaration would be defined in a module dependent on the compiled\n * module, but choosing this module is non-trivial due to possibly multiple implementations of the same `expect` symbol. In addition, when\n * generating bytecode for a single source file, the number of source files to compile should be kept low. Stubbing helps with that.)\n */"} {"signature":"override fun isTargetDeclaration ( declaration : IrDeclaration ) : Boolean","body":"= super . isTargetDeclaration ( declaration ) || declaration is IrSimpleFunction && declaration . correspondingPropertySymbol ? . owner ? . isExpect == true","docstring":"/**\n * Property getters and setters are not marked as `isExpect` even if the corresponding property is. However, we still need to stub such\n * getters and setters, so [isTargetDeclaration] allows it.\n */"} {"signature":"private fun MemberDescriptor . isOrphanedExpect ( ) : Boolean","body":"= findCompatibleActualsForExpected ( module ) . isEmpty ( )","docstring":"/**\n * If an `actual` symbol exists, we shouldn't stub the `expect` symbol. This will be performed by\n * [org.jetbrains.kotlin.backend.common.lower.ExpectDeclarationsRemoveLowering] during lowering.\n */"} {"signature":"private fun IrDeclaration . ensureClassParent ( descriptor : MemberDescriptor )","body":"{ if ( parent !is IrClass ) { parent = stubGenerator . generateOrGetFacadeClass ( descriptor ) ? : return } }","docstring":"/**\n * [descriptor] should be the original descriptor, because the copied `actual` descriptor has no source.\n */"} {"signature":"override fun isEmpty ( ) : Boolean","body":"= first > last","docstring":"/** \n * Checks if the range is empty.\n \n * The range is empty if its start value is greater than the end value.\n */"} {"signature":"public open fun isEmpty ( ) : Boolean","body":"= if ( step > ) first > last else first < last","docstring":"/** \n * Checks if the progression is empty.\n \n * Progression with a positive step is empty if its first element is greater than the last element.\n * Progression with a negative step is empty if its first element is less than the last element.\n */"} {"signature":"public fun fromClosedRange ( rangeStart : UInt , rangeEnd : UInt , step : Int ) : UIntProgression","body":"= UIntProgression ( rangeStart , rangeEnd , step )","docstring":"/**\n * Creates UIntProgression within the specified bounds of a closed range.\n\n * The progression starts with the [rangeStart] value and goes toward the [rangeEnd] value not excluding it, with the specified [step].\n * In order to go backwards the [step] must be negative.\n *\n * [step] must be greater than `Int.MIN_VALUE` and not equal to zero.\n */"} {"signature":"internal fun addBuildEventsListenerRegistryMock ( project : Project )","body":"{ val executedExtensionKey = \"\" try { if ( project . findExtension < Boolean > ( executedExtensionKey ) == true ) return val projectScopeServices = ( project as DefaultProject ) . services as ProjectScopeServices val state : Field = ProjectScopeServices :: class . java . superclass . getDeclaredField ( \"\" ) state . isAccessible = true @ Suppress ( \"\" ) val stateValue : AtomicReference < Any > = state . get ( projectScopeServices ) as AtomicReference < Any > val enumClass = Class . forName ( DefaultServiceRegistry :: class . java . name + \"\" ) stateValue . set ( enumClass . enumConstants [ ] ) projectScopeServices . add ( BuildEventsListenerRegistry :: class . java , BuildEventsListenerRegistryMock ) stateValue . set ( enumClass . enumConstants [ ] ) project . addExtension ( executedExtensionKey , true ) } catch ( e : Throwable ) { throw RuntimeException ( e ) } }","docstring":"/**\n * In Gradle 6.7-rc-1 BuildEventsListenerRegistry service is not created in we need it in order\n * to instantiate AGP. This creates a fake one and injects it - http://b/168630734.\n * https://github.com/gradle/gradle/issues/16774 (Waiting for Gradle 7.5)\n */"} {"signature":"internal expect fun < K , V > createMapForCache ( initialCapacity : Int ) : MutableMap < K , V >","body":"internal expect fun < K , V > createMapForCache ( initialCapacity : Int ) : MutableMap < K , V >","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":"public fun ColumnSet < * > . colsAtAnyDepth ( predicate : ColumnFilter < * > = { true } ) : ColumnSet < * >","body":"= colsAtAnyDepthInternal ( predicate )","docstring":"/**\n * @include [CommonAtAnyDepthDocs]\n * @set [CommonAtAnyDepthDocs.Examples]\n *\n * `df.`[select][DataFrame.select]` { `[colGroups][ColumnsSelectionDsl.colGroups]`().`[colsAtAnyDepth][ColumnsSelectionDsl.colsAtAnyDepth]` { \"Alice\" `[in][Iterable.contains]` it.`[values][DataColumn.values]`() } }`\n */"} {"signature":"public fun ColumnsSelectionDsl < * > . colsAtAnyDepth ( predicate : ColumnFilter < * > = { true } ) : ColumnSet < * >","body":"= asSingleColumn ( ) . colsAtAnyDepthInternal ( predicate )","docstring":"/**\n * @include [CommonAtAnyDepthDocs]\n * @set [CommonAtAnyDepthDocs.Examples]\n *\n * `df.`[select][DataFrame.select]` { `[colsAtAnyDepth][ColumnsSelectionDsl.colsAtAnyDepth]` { \"Alice\" `[in][Iterable.contains]` it.`[values][DataColumn.values]`() }.`[first][ColumnsSelectionDsl.first]`() }`\n *\n * `df.`[select][DataFrame.select]` { `[colsAtAnyDepth][ColumnsSelectionDsl.colsAtAnyDepth]` { !it.`[isColumnGroup][DataColumn.isColumnGroup]` } }`\n */"} {"signature":"public fun SingleColumn < DataRow < * > > . colsAtAnyDepth ( predicate : ColumnFilter < * > = { true } ) : ColumnSet < * >","body":"= ensureIsColumnGroup ( ) . colsAtAnyDepthInternal ( predicate )","docstring":"/**\n * @include [CommonAtAnyDepthDocs]\n * @set [CommonAtAnyDepthDocs.Examples]\n *\n * `df.`[select][DataFrame.select]` { myColGroup.`[colsAtAnyDepth][SingleColumn.colsAtAnyDepth]` { \"Alice\" `[in][Iterable.contains]` it.`[values][DataColumn.values]`() } }`\n */"} {"signature":"public fun String . colsAtAnyDepth ( predicate : ColumnFilter < * > = { true } ) : ColumnSet < * >","body":"= columnGroup ( this ) . colsAtAnyDepth ( predicate )","docstring":"/**\n * @include [CommonAtAnyDepthDocs]\n * @set [CommonAtAnyDepthDocs.Examples]\n *\n * `df.`[select][DataFrame.select]` { \"myColumnGroup\".`[colsAtAnyDepth][String.colsAtAnyDepth]` { \"Alice\" `[in][Iterable.contains]` it.`[values][DataColumn.values]`() } }`\n */"} {"signature":"public fun KProperty < * > . colsAtAnyDepth ( predicate : ColumnFilter < * > = { true } ) : ColumnSet < * >","body":"= columnGroup ( this ) . colsAtAnyDepth ( predicate )","docstring":"/**\n * @include [CommonAtAnyDepthDocs]\n * @set [CommonAtAnyDepthDocs.Examples]\n *\n * `df.`[select][DataFrame.select]` { Type::myColumnGroup.`[colsAtAnyDepth][KProperty.colsAtAnyDepth]` { \"Alice\" `[in][Iterable.contains]` it.`[values][DataColumn.values]`() } }`\n */"} {"signature":"public fun ColumnPath . colsAtAnyDepth ( predicate : ColumnFilter < * > = { true } ) : ColumnSet < * >","body":"= columnGroup ( this ) . colsAtAnyDepth ( predicate )","docstring":"/**\n * @include [CommonAtAnyDepthDocs]\n * @set [CommonAtAnyDepthDocs.Examples]\n *\n * `df.`[select][DataFrame.select]` { \"pathTo\"[\"myGroupCol\"].`[colsAtAnyDepth][ColumnsSelectionDsl.colsAtAnyDepth]` { \"Alice\" `[in][Iterable.contains]` it.`[values][DataColumn.values]`() } }`\n */"} {"signature":"internal fun ColumnsResolver < * > . colsAtAnyDepthInternal ( predicate : ColumnFilter < * > ) : ColumnSet < * >","body":"= colsInternal ( predicate ) . atAnyDepthImpl ( includeTopLevel = true , includeGroups = true )","docstring":"/**\n * Returns all columns inside this [ColumnsResolver] at any depth if they satisfy the\n * given predicate.\n */"} {"signature":"fun kotlinxImmutable ( name : String ? = null ) : String","body":"{ return listOfNotNull ( \"\" , \"\" , \"\" , name ) . joinToString ( \"\" ) }","docstring":"/**\n * Required because :kotlin-compiler-embeddable performs package relocation\n * If there's a \"kotlinx.collections.immutable\" string literal in bytecode\n * it becomes \"org.jetbrains.kotlin.kotlinx.collections.immutable\" thus\n * breaking target project class name matching\n */"} {"signature":"internal fun collectGeneralConfigurationTimeMetrics ( project : Project , gradle : Gradle , buildReportOutputs : List < BuildReportType > , useClasspathSnapshot : Boolean , pluginVersion : String , isProjectIsolationEnabled : Boolean , isProjectIsolationRequested : Boolean , isConfigurationCacheRequested : Boolean ) : MetricContainer","body":"{ val configurationTimeMetrics = MetricContainer ( ) val statisticOverhead = measureTimeMillis { configurationTimeMetrics . put ( StringMetrics . KOTLIN_COMPILER_VERSION , pluginVersion ) configurationTimeMetrics . put ( StringMetrics . USE_CLASSPATH_SNAPSHOT , useClasspathSnapshot . toString ( ) ) buildReportOutputs . forEach { when ( it ) { BuildReportType . BUILD_SCAN -> configurationTimeMetrics . put ( BooleanMetrics . BUILD_SCAN_BUILD_REPORT , true ) BuildReportType . FILE -> configurationTimeMetrics . put ( BooleanMetrics . FILE_BUILD_REPORT , true ) BuildReportType . HTTP -> configurationTimeMetrics . put ( BooleanMetrics . HTTP_BUILD_REPORT , true ) BuildReportType . SINGLE_FILE -> configurationTimeMetrics . put ( BooleanMetrics . SINGLE_FILE_BUILD_REPORT , true ) BuildReportType . TRY_NEXT_CONSOLE -> { } BuildReportType . JSON -> configurationTimeMetrics . put ( BooleanMetrics . JSON_BUILD_REPORT , true ) } } configurationTimeMetrics . put ( StringMetrics . PROJECT_PATH , project . rootDir . absolutePath ) configurationTimeMetrics . put ( StringMetrics . GRADLE_VERSION , gradle . gradleVersion ) if ( ! isProjectIsolationEnabled ) { gradle . taskGraph . whenReady { taskExecutionGraph -> val executedTaskNames = taskExecutionGraph . allTasks . map { it . name } . distinct ( ) configurationTimeMetrics . put ( BooleanMetrics . MAVEN_PUBLISH_EXECUTED , executedTaskNames . contains ( \"\" ) ) } } configurationTimeMetrics . put ( BooleanMetrics . GRADLE_CONFIGURATION_CACHE_ENABLED , isConfigurationCacheRequested ) configurationTimeMetrics . put ( BooleanMetrics . GRADLE_PROJECT_ISOLATION_ENABLED , isProjectIsolationRequested ) } configurationTimeMetrics . put ( NumericalMetrics . STATISTICS_VISIT_ALL_PROJECTS_OVERHEAD , statisticOverhead ) return configurationTimeMetrics }","docstring":"/**\n * Collect general configuration metrics\n **/"} {"signature":"internal fun collectProjectConfigurationTimeMetrics ( project : Project , ) : MetricContainer","body":"{ val configurationTimeMetrics = MetricContainer ( ) val statisticOverhead = measureTimeMillis { collectAppliedPluginsStatistics ( project , configurationTimeMetrics ) val configurations = project . configurations . asMap . values for ( configuration in configurations ) { try { val configurationName = configuration . name val dependencies = configuration . dependencies when ( configurationName ) { \"\" -> { configurationTimeMetrics . put ( BooleanMetrics . ENABLED_KOVER , true ) } \"\" -> { configurationTimeMetrics . put ( BooleanMetrics . ENABLED_KAPT , true ) for ( dependency in dependencies ) { when ( dependency . group ) { \"\" -> configurationTimeMetrics . put ( BooleanMetrics . ENABLED_DAGGER , true ) \"\" -> configurationTimeMetrics . put ( BooleanMetrics . ENABLED_DATABINDING , true ) } } } API -> { configurationTimeMetrics . put ( NumericalMetrics . CONFIGURATION_API_COUNT , ) reportLibrariesVersions ( configurationTimeMetrics , dependencies ) } IMPLEMENTATION -> { configurationTimeMetrics . put ( NumericalMetrics . CONFIGURATION_IMPLEMENTATION_COUNT , ) reportLibrariesVersions ( configurationTimeMetrics , dependencies ) } COMPILE -> { configurationTimeMetrics . put ( NumericalMetrics . CONFIGURATION_COMPILE_COUNT , ) reportLibrariesVersions ( configurationTimeMetrics , dependencies ) } COMPILE_ONLY -> { configurationTimeMetrics . put ( NumericalMetrics . CONFIGURATION_COMPILE_ONLY_COUNT , ) reportLibrariesVersions ( configurationTimeMetrics , dependencies ) } RUNTIME -> { configurationTimeMetrics . put ( NumericalMetrics . CONFIGURATION_RUNTIME_COUNT , ) reportLibrariesVersions ( configurationTimeMetrics , dependencies ) } RUNTIME_ONLY -> { configurationTimeMetrics . put ( NumericalMetrics . CONFIGURATION_RUNTIME_ONLY_COUNT , ) reportLibrariesVersions ( configurationTimeMetrics , dependencies ) } } } catch ( e : Throwable ) { } } configurationTimeMetrics . put ( NumericalMetrics . NUMBER_OF_SUBPROJECTS , ) configurationTimeMetrics . put ( BooleanMetrics . KOTLIN_KTS_USED , project . buildscript . sourceFile ? . name ? . endsWith ( \"\" ) ? : false ) addTaskMetrics ( project , configurationTimeMetrics ) if ( project . name == \"\" ) { configurationTimeMetrics . put ( NumericalMetrics . BUILD_SRC_COUNT , ) configurationTimeMetrics . put ( BooleanMetrics . BUILD_SRC_EXISTS , true ) } } configurationTimeMetrics . put ( NumericalMetrics . STATISTICS_VISIT_ALL_PROJECTS_OVERHEAD , statisticOverhead ) return configurationTimeMetrics }","docstring":"/**\n * Collect project's configuration metrics including applied plugins. It should be called inside afterEvaluate block.\n */"} {"signature":"@ KtAllowAnalysisOnEdt public inline fun < T > allowAnalysisOnEdt ( action : ( ) -> T ) : T","body":"{ if ( KtReadActionConfinementLifetimeToken . allowOnEdt . get ( ) ) return action ( ) KtReadActionConfinementLifetimeToken . allowOnEdt . set ( true ) try { return action ( ) } finally { KtReadActionConfinementLifetimeToken . allowOnEdt . set ( false ) } }","docstring":"/**\n * @see KtAnalysisSession\n * @see KtReadActionConfinementLifetimeToken\n */"} {"signature":"@ KtAllowAnalysisFromWriteAction @ KtAllowProhibitedAnalyzeFromWriteAction public inline fun < T > allowAnalysisFromWriteAction ( action : ( ) -> T ) : T","body":"{ if ( KtReadActionConfinementLifetimeToken . allowFromWriteAction . get ( ) ) return action ( ) KtReadActionConfinementLifetimeToken . allowFromWriteAction . set ( true ) try { return action ( ) } finally { KtReadActionConfinementLifetimeToken . allowFromWriteAction . set ( false ) } }","docstring":"/**\n * Analysis is not supposed to be called from write action.\n * Such actions can lead to IDE freezes and incorrect behavior in some cases.\n *\n * There is no guarantee that PSI changes will be reflected in an Analysis API world inside\n * one [analyze] session.\n * Example:\n * ```\n * // code to be analyzed\n * fun foo(): Int = 0\n *\n * // use case code\n * fun useCase() {\n * analyse(function) {\n * // 'getConstantFromExpressionBody' is an imaginary function\n * val valueBefore = function.getConstantFromExpressionBody() // valueBefore is 0\n *\n * changeExpressionBodyTo(1) // now function will looks like `fun foo(): Int = 1`\n * val valueAfter = function.getConstantFromExpressionBody() // Wrong way: valueAfter is not guarantied to be '1'\n * }\n *\n * analyse(function) {\n * val valueAfter = function.getConstantFromExpressionBody() // OK: valueAfter is guarantied to be '1'\n * }\n * }\n * ```\n *\n * @see KtAnalysisSession\n * @see KtReadActionConfinementLifetimeToken\n */"} {"signature":"fun runJvmCompilerAsync ( args : K2JVMCompilerArguments , environment : GradleCompilerEnvironment , jdkHome : File , taskOutputsBackup : TaskOutputsBackup ? , ) : WorkQueue ?","body":"{ if ( args . jdkHome == null && ! args . noJdk ) args . jdkHome = jdkHome . absolutePath loggerProvider . kotlinInfo ( \"\" ) return runCompilerAsync ( KotlinCompilerClass . JVM , args , environment , 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":"fun runJsCompilerAsync ( args : K2JSCompilerArguments , environment : GradleCompilerEnvironment , taskOutputsBackup : TaskOutputsBackup ? , ) : WorkQueue ?","body":"{ return runCompilerAsync ( KotlinCompilerClass . JS , args , environment , 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":"fun runMetadataCompilerAsync ( args : K2MetadataCompilerArguments , environment : GradleCompilerEnvironment , ) : WorkQueue ?","body":"{ return runCompilerAsync ( KotlinCompilerClass . METADATA , args , environment ) }","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":"internal fun setupAttributesMatchingStrategy ( attributesSchema : AttributesSchema )","body":"{ attributesSchema . attribute ( attribute ) }","docstring":"/**\n * Sets up the attributes matching strategy for the given attributes schema.\n *\n * @param attributesSchema The attributes schema to set up the matching strategy for.\n */"} {"signature":"internal fun setupTransform ( project : Project )","body":"{ project . dependencies . artifactTypes . maybeCreate ( \"\" ) . also { artifactType -> artifactType . attributes . setAttribute ( attribute , KotlinNativeBundleArtifactsTypes . ARCHIVE ) } project . dependencies . artifactTypes . maybeCreate ( \"\" ) . also { artifactType -> artifactType . attributes . setAttribute ( attribute , KotlinNativeBundleArtifactsTypes . ARCHIVE ) } project . dependencies . registerTransform ( UnzipTransformationAction :: class . java ) { transform -> transform . from . setAttribute ( attribute , KotlinNativeBundleArtifactsTypes . ARCHIVE ) transform . to . setAttribute ( attribute , KotlinNativeBundleArtifactsTypes . DIRECTORY ) } }","docstring":"/**\n * Sets up the necessary transformations for handling artifact types \"tar.gz\" and \"zip\" in the given project.\n *\n * @param project The project in which to set up the transformations.\n */"} {"signature":"@ Test fun shouldAssertEnumDocumentationHasNotChanged ( )","body":"{ val sourcesLink = \"\" val sources = URL ( sourcesLink ) . readText ( ) val expectedValuesDoc = \"\" + \"\" + \"\" + \"\" + \"\" check ( sources . contains ( expectedValuesDoc ) ) val expectedValueOfDoc = \"\" + \"\" + \"\" + \"\" + \"\" + \"\" check ( sources . contains ( expectedValueOfDoc ) ) }","docstring":"/**\n * Documentation for Enum's synthetic values() and valueOf() functions is only present in source code,\n * but not present in the descriptors. However, Dokka needs to generate documentation for these functions,\n * so it ships with hardcoded kdoc templates.\n *\n * This test exists to make sure documentation for these hardcoded synthetic functions does not change,\n * and fails if it does, indicating that it needs to be updated.\n */"} {"signature":"fun bind ( owner : Owner )","body":"fun bind ( owner : Owner )","docstring":"/**\n * Sets this symbol's owner.\n *\n * Throws [IllegalStateException] if this symbol has already been bound.\n */"} {"signature":"public fun sourceIterator ( ) : Iterator < T >","body":"public fun sourceIterator ( ) : Iterator < T >","docstring":"/** Returns an [Iterator] over the elements of the source of this grouping. */"} {"signature":"public fun keyOf ( element : T ) : K","body":"public fun keyOf ( element : T ) : K","docstring":"/** Extracts the key of an [element]. */"} {"signature":"@ SinceKotlin ( \"\" ) public inline fun < T , K , R > Grouping < T , K > . aggregate ( operation : ( key : K , accumulator : R ? , element : T , first : Boolean ) -> R ) : Map < K , R >","body":"{ return aggregateTo ( mutableMapOf < K , R > ( ) , operation ) }","docstring":"/**\n * Groups elements from the [Grouping] source by key and applies [operation] to the elements of each group sequentially,\n * passing the previously accumulated value and the current element as arguments, and stores the results in a new map.\n *\n * The key for each element is provided by the [Grouping.keyOf] function.\n *\n * @param operation function is invoked on each element with the following parameters:\n * - `key`: the key of the group this element belongs to;\n * - `accumulator`: the current value of the accumulator of the group, can be `null` if it's the first `element` encountered in the group;\n * - `element`: the element from the source being aggregated;\n * - `first`: indicates whether it's the first `element` encountered in the group.\n *\n * @return a [Map] associating the key of each group with the result of aggregation of the group elements.\n * @sample samples.collections.Grouping.aggregateByRadix\n */"} {"signature":"@ SinceKotlin ( \"\" ) public inline fun < T , K , R , M : MutableMap < in K , R > > Grouping < T , K > . aggregateTo ( destination : M , operation : ( key : K , accumulator : R ? , element : T , first : Boolean ) -> R ) : M","body":"{ for ( e in this . sourceIterator ( ) ) { val key = keyOf ( e ) val accumulator = destination [ key ] destination [ key ] = operation ( key , accumulator , e , accumulator == null && ! destination . containsKey ( key ) ) } return destination }","docstring":"/**\n * Groups elements from the [Grouping] source by key and applies [operation] to the elements of each group sequentially,\n * passing the previously accumulated value and the current element as arguments,\n * and stores the results in the given [destination] map.\n *\n * The key for each element is provided by the [Grouping.keyOf] function.\n *\n * @param operation a function that is invoked on each element with the following parameters:\n * - `key`: the key of the group this element belongs to;\n * - `accumulator`: the current value of the accumulator of the group, can be `null` if it's the first `element` encountered in the group;\n * - `element`: the element from the source being aggregated;\n * - `first`: indicates whether it's the first `element` encountered in the group.\n *\n * If the [destination] map already has a value corresponding to some key,\n * then the elements being aggregated for that key are never considered as `first`.\n *\n * @return the [destination] map associating the key of each group with the result of aggregation of the group elements.\n * @sample samples.collections.Grouping.aggregateByRadixTo\n */"} {"signature":"@ SinceKotlin ( \"\" ) public inline fun < T , K , R > Grouping < T , K > . fold ( initialValueSelector : ( key : K , element : T ) -> R , operation : ( key : K , accumulator : R , element : T ) -> R ) : Map < K , R >","body":"= @ Suppress ( \"\" ) aggregate { key , acc , e , first -> operation ( key , if ( first ) initialValueSelector ( key , e ) else acc as R , e ) }","docstring":"/**\n * Groups elements from the [Grouping] source by key and applies [operation] to the elements of each group sequentially,\n * passing the previously accumulated value and the current element as arguments, and stores the results in a new map.\n * An initial value of accumulator is provided by [initialValueSelector] function.\n *\n * @param initialValueSelector a function that provides an initial value of accumulator for each group.\n * It's invoked with parameters:\n * - `key`: the key of the group;\n * - `element`: the first element being encountered in that group.\n *\n * @param operation a function that is invoked on each element with the following parameters:\n * - `key`: the key of the group this element belongs to;\n * - `accumulator`: the current value of the accumulator of the group;\n * - `element`: the element from the source being accumulated.\n *\n * @return a [Map] associating the key of each group with the result of accumulating the group elements.\n * @sample samples.collections.Grouping.foldByEvenLengthWithComputedInitialValue\n */"} {"signature":"@ SinceKotlin ( \"\" ) public inline fun < T , K , R , M : MutableMap < in K , R > > Grouping < T , K > . foldTo ( destination : M , initialValueSelector : ( key : K , element : T ) -> R , operation : ( key : K , accumulator : R , element : T ) -> R ) : M","body":"= @ Suppress ( \"\" ) aggregateTo ( destination ) { key , acc , e , first -> operation ( key , if ( first ) initialValueSelector ( key , e ) else acc as R , e ) }","docstring":"/**\n * Groups elements from the [Grouping] source by key and applies [operation] to the elements of each group sequentially,\n * passing the previously accumulated value and the current element as arguments,\n * and stores the results in the given [destination] map.\n * An initial value of accumulator is provided by [initialValueSelector] function.\n *\n * @param initialValueSelector a function that provides an initial value of accumulator for each group.\n * It's invoked with parameters:\n * - `key`: the key of the group;\n * - `element`: the first element being encountered in that group.\n *\n * If the [destination] map already has a value corresponding to some key, that value is used as an initial value of\n * the accumulator for that group and the [initialValueSelector] function is not called for that group.\n *\n * @param operation a function that is invoked on each element with the following parameters:\n * - `key`: the key of the group this element belongs to;\n * - `accumulator`: the current value of the accumulator of the group;\n * - `element`: the element from the source being accumulated.\n *\n * @return the [destination] map associating the key of each group with the result of accumulating the group elements.\n * @sample samples.collections.Grouping.foldByEvenLengthWithComputedInitialValueTo\n */"} {"signature":"@ SinceKotlin ( \"\" ) public inline fun < T , K , R > Grouping < T , K > . fold ( initialValue : R , operation : ( accumulator : R , element : T ) -> R ) : Map < K , R >","body":"= @ Suppress ( \"\" ) aggregate { _ , acc , e , first -> operation ( if ( first ) initialValue else acc as R , e ) }","docstring":"/**\n * Groups elements from the [Grouping] source by key and applies [operation] to the elements of each group sequentially,\n * passing the previously accumulated value and the current element as arguments, and stores the results in a new map.\n * An initial value of accumulator is the same [initialValue] for each group.\n *\n * @param operation a function that is invoked on each element with the following parameters:\n * - `accumulator`: the current value of the accumulator of the group;\n * - `element`: the element from the source being accumulated.\n *\n * @return a [Map] associating the key of each group with the result of accumulating the group elements.\n * @sample samples.collections.Grouping.foldByEvenLengthWithConstantInitialValue\n */"} {"signature":"@ SinceKotlin ( \"\" ) public inline fun < T , K , R , M : MutableMap < in K , R > > Grouping < T , K > . foldTo ( destination : M , initialValue : R , operation : ( accumulator : R , element : T ) -> R ) : M","body":"= @ Suppress ( \"\" ) aggregateTo ( destination ) { _ , acc , e , first -> operation ( if ( first ) initialValue else acc as R , e ) }","docstring":"/**\n * Groups elements from the [Grouping] source by key and applies [operation] to the elements of each group sequentially,\n * passing the previously accumulated value and the current element as arguments,\n * and stores the results in the given [destination] map.\n * An initial value of accumulator is the same [initialValue] for each group.\n *\n * If the [destination] map already has a value corresponding to the key of some group,\n * that value is used as an initial value of the accumulator for that group.\n *\n * @param operation a function that is invoked on each element with the following parameters:\n * - `accumulator`: the current value of the accumulator of the group;\n * - `element`: the element from the source being accumulated.\n *\n * @return the [destination] map associating the key of each group with the result of accumulating the group elements.\n * @sample samples.collections.Grouping.foldByEvenLengthWithConstantInitialValueTo\n */"} {"signature":"@ SinceKotlin ( \"\" ) public inline fun < S , T : S , K > Grouping < T , K > . reduce ( operation : ( key : K , accumulator : S , element : T ) -> S ) : Map < K , S >","body":"= aggregate { key , acc , e , first -> @ Suppress ( \"\" ) if ( first ) e else operation ( key , acc as S , e ) }","docstring":"/**\n * Groups elements from the [Grouping] source by key and applies the reducing [operation] to the elements of each group\n * sequentially starting from the second element of the group,\n * passing the previously accumulated value and the current element as arguments,\n * and stores the results in a new map.\n * An initial value of accumulator is the first element of the group.\n *\n * @param operation a function that is invoked on each subsequent element of the group with the following parameters:\n * - `key`: the key of the group this element belongs to;\n * - `accumulator`: the current value of the accumulator of the group;\n * - `element`: the element from the source being accumulated.\n *\n * @return a [Map] associating the key of each group with the result of accumulating the group elements.\n * @sample samples.collections.Grouping.reduceByMaxVowels\n */"} {"signature":"@ SinceKotlin ( \"\" ) public inline fun < S , T : S , K , M : MutableMap < in K , S > > Grouping < T , K > . reduceTo ( destination : M , operation : ( key : K , accumulator : S , element : T ) -> S ) : M","body":"= aggregateTo ( destination ) { key , acc , e , first -> @ Suppress ( \"\" ) if ( first ) e else operation ( key , acc as S , e ) }","docstring":"/**\n * Groups elements from the [Grouping] source by key and applies the reducing [operation] to the elements of each group\n * sequentially starting from the second element of the group,\n * passing the previously accumulated value and the current element as arguments,\n * and stores the results in the given [destination] map.\n * An initial value of accumulator is the first element of the group.\n *\n * If the [destination] map already has a value corresponding to the key of some group,\n * that value is used as an initial value of the accumulator for that group and the first element of that group is also\n * subjected to the [operation].\n\n * @param operation a function that is invoked on each subsequent element of the group with the following parameters:\n * - `accumulator`: the current value of the accumulator of the group;\n * - `element`: the element from the source being folded;\n *\n * @return the [destination] map associating the key of each group with the result of accumulating the group elements.\n * @sample samples.collections.Grouping.reduceByMaxVowelsTo\n */"} {"signature":"@ SinceKotlin ( \"\" ) public fun < T , K , M : MutableMap < in K , Int > > Grouping < T , K > . eachCountTo ( destination : M ) : M","body":"= foldTo ( destination , ) { acc , _ -> acc + }","docstring":"/**\n * Groups elements from the [Grouping] source by key and counts elements in each group to the given [destination] map.\n *\n * If the [destination] map already has a value corresponding to the key of some group,\n * that value is used as an initial value of the counter for that group.\n *\n * @return the [destination] map associating the key of each group with the count of elements in the group.\n *\n * @sample samples.collections.Grouping.groupingByEachCount\n */"} {"signature":"@ kotlin . internal . InlineOnly public inline operator fun BigDecimal . plus ( other : BigDecimal ) : BigDecimal","body":"= this . add ( other )","docstring":"/**\n * Enables the use of the `+` operator for [BigDecimal] instances.\n */"} {"signature":"@ kotlin . internal . InlineOnly public inline operator fun BigDecimal . minus ( other : BigDecimal ) : BigDecimal","body":"= this . subtract ( other )","docstring":"/**\n * Enables the use of the `-` operator for [BigDecimal] instances.\n */"} {"signature":"@ kotlin . internal . InlineOnly public inline operator fun BigDecimal . times ( other : BigDecimal ) : BigDecimal","body":"= this . multiply ( other )","docstring":"/**\n * Enables the use of the `*` operator for [BigDecimal] instances.\n */"} {"signature":"@ kotlin . internal . InlineOnly public inline operator fun BigDecimal . div ( other : BigDecimal ) : BigDecimal","body":"= this . divide ( other , RoundingMode . HALF_EVEN )","docstring":"/**\n * Enables the use of the `/` operator for [BigDecimal] instances.\n *\n * The scale of the result is the same as the scale of `this` (divident), and for rounding the [RoundingMode.HALF_EVEN]\n * rounding mode is used.\n */"} {"signature":"@ kotlin . internal . InlineOnly public inline operator fun BigDecimal . rem ( other : BigDecimal ) : BigDecimal","body":"= this . remainder ( other )","docstring":"/**\n * Enables the use of the `%` operator for [BigDecimal] instances.\n */"} {"signature":"@ kotlin . internal . InlineOnly public inline operator fun BigDecimal . unaryMinus ( ) : BigDecimal","body":"= this . negate ( )","docstring":"/**\n * Enables the use of the unary `-` operator for [BigDecimal] instances.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . internal . InlineOnly public inline operator fun BigDecimal . inc ( ) : BigDecimal","body":"= this . add ( BigDecimal . ONE )","docstring":"/**\n * Enables the use of the unary `++` operator for [BigDecimal] instances.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . internal . InlineOnly public inline operator fun BigDecimal . dec ( ) : BigDecimal","body":"= this . subtract ( BigDecimal . ONE )","docstring":"/**\n * Enables the use of the unary `--` operator for [BigDecimal] instances.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . internal . InlineOnly public inline fun Int . toBigDecimal ( ) : BigDecimal","body":"= BigDecimal . valueOf ( this . toLong ( ) )","docstring":"/**\n * Returns the value of this [Int] number as a [BigDecimal].\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . internal . InlineOnly public inline fun Int . toBigDecimal ( mathContext : MathContext ) : BigDecimal","body":"= BigDecimal ( this , mathContext )","docstring":"/**\n * Returns the value of this [Int] number as a [BigDecimal].\n * @param mathContext specifies the precision and the rounding mode.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . internal . InlineOnly public inline fun Long . toBigDecimal ( ) : BigDecimal","body":"= BigDecimal . valueOf ( this )","docstring":"/**\n * Returns the value of this [Long] number as a [BigDecimal].\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . internal . InlineOnly public inline fun Long . toBigDecimal ( mathContext : MathContext ) : BigDecimal","body":"= BigDecimal ( this , mathContext )","docstring":"/**\n * Returns the value of this [Long] number as a [BigDecimal].\n * @param mathContext specifies the precision and the rounding mode.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . internal . InlineOnly public inline fun Float . toBigDecimal ( ) : BigDecimal","body":"= BigDecimal ( this . toString ( ) )","docstring":"/**\n * Returns the value of this [Float] number as a [BigDecimal].\n *\n * The number is converted to a string and then the string is converted to a [BigDecimal].\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . internal . InlineOnly public inline fun Float . toBigDecimal ( mathContext : MathContext ) : BigDecimal","body":"= BigDecimal ( this . toString ( ) , mathContext )","docstring":"/**\n * Returns the value of this [Float] number as a [BigDecimal].\n *\n * The number is converted to a string and then the string is converted to a [BigDecimal].\n *\n * @param mathContext specifies the precision and the rounding mode.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . internal . InlineOnly public inline fun Double . toBigDecimal ( ) : BigDecimal","body":"= BigDecimal ( this . toString ( ) )","docstring":"/**\n * Returns the value of this [Double] number as a [BigDecimal].\n *\n * The number is converted to a string and then the string is converted to a [BigDecimal].\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . internal . InlineOnly public inline fun Double . toBigDecimal ( mathContext : MathContext ) : BigDecimal","body":"= BigDecimal ( this . toString ( ) , mathContext )","docstring":"/**\n * Returns the value of this [Double] number as a [BigDecimal].\n *\n * The number is converted to a string and then the string is converted to a [BigDecimal].\n *\n * @param mathContext specifies the precision and the rounding mode.\n */"} {"signature":"fun loadTypeAlias ( proto : ProtoBuf . TypeAlias , preComputedSymbol : FirTypeAliasSymbol ? = null ) : FirTypeAlias","body":"{ val flags = proto . flags val name = c . nameResolver . getName ( proto . name ) val classId = ClassId ( c . packageFqName , name ) val symbol = preComputedSymbol ? : FirTypeAliasSymbol ( classId ) val local = c . childContext ( proto . typeParameterList , containingDeclarationSymbol = symbol ) val versionRequirements = VersionRequirement . create ( proto , c ) return buildTypeAlias { moduleData = c . moduleData origin = FirDeclarationOrigin . Library this . name = name val visibility = ProtoEnumFlags . visibility ( Flags . VISIBILITY . get ( flags ) ) status = FirResolvedDeclarationStatusImpl ( visibility , Modality . FINAL , visibility . toEffectiveVisibility ( owner = null ) ) . apply { isExpect = Flags . IS_EXPECT_CLASS . get ( flags ) isActual = false } annotations += c . annotationDeserializer . loadTypeAliasAnnotations ( proto , local . nameResolver ) this . symbol = symbol expandedTypeRef = proto . underlyingType ( c . typeTable ) . toTypeRef ( local ) resolvePhase = FirResolvePhase . ANALYZED_DEPENDENCIES typeParameters += local . typeDeserializer . ownTypeParameters . map { it . fir } deprecationsProvider = annotations . getDeprecationsProviderFromAnnotations ( c . session , fromJava = false , versionRequirements ) } . apply { this . versionRequirements = versionRequirements sourceElement = c . containerSource } }","docstring":"/**\n * If loading happens in post-compute, then symbol for type alias is already computed and should be provided in [preComputedSymbol]\n * @See AbstractFirDeserializedSymbolProvider.findAndDeserializeTypeAlias\n */"} {"signature":"private fun isStatic ( function : Function < * > ) : Boolean","body":"{ try { with ( function . javaClass . getDeclaredField ( \"\" ) ) { if ( ! java . lang . reflect . Modifier . isStatic ( modifiers ) || ! java . lang . reflect . Modifier . isFinal ( modifiers ) ) { return false } isAccessible = true return get ( null ) == function } } catch ( e : NoSuchFieldException ) { return false } }","docstring":"/**\n * Returns `true` if given function is *static* as defined in [staticCFunction].\n */"} {"signature":"private fun ffiTypeStruct ( elementTypes : List < ffi_type > ) : ffi_type","body":"{ val elements = nativeHeap . allocArrayOfPointersTo ( * elementTypes . toTypedArray ( ) , null ) val res = ffiTypeStruct0 ( elements . rawValue ) if ( res == ) { throw OutOfMemoryError ( ) } caches . addTypeStruct ( res ) return interpretPointed ( res ) }","docstring":"/**\n * Allocates and initializes `ffi_type` describing the struct.\n *\n * @param elements types of the struct elements\n */"} {"signature":"private fun ffiCreateCif ( returnType : ffi_type , paramTypes : List < ffi_type > ) : ffi_cif","body":"{ val nArgs = paramTypes . size val argTypes = nativeHeap . allocArrayOfPointersTo ( * paramTypes . toTypedArray ( ) , null ) val res = ffiCreateCif0 ( nArgs , returnType . rawPtr , argTypes . rawValue ) when ( res ) { -> throw OutOfMemoryError ( ) - -> throw Error ( \"\" ) - -> throw Error ( \"\" ) - -> throw Error ( \"\" ) } caches . addCif ( res ) return interpretPointed ( res ) }","docstring":"/**\n * Creates and prepares an `ffi_cif`.\n *\n * @param returnType native function return value type\n * @param paramTypes native function parameter types\n *\n * @return the initialized `ffi_cif`\n */"} {"signature":"private fun ffiCreateClosure ( ffiCif : ffi_cif , impl : FfiClosureImpl ) : NativePtr","body":"{ val ffiClosure = nativeHeap . alloc ( Long . SIZE_BYTES , ) try { val res = ffiCreateClosure0 ( ffiCif . rawPtr , ffiClosure . rawPtr , userData = impl ) when ( res ) { -> throw OutOfMemoryError ( ) - -> throw Error ( \"\" ) } caches . addClosure ( unsafe . getLong ( ffiClosure . rawPtr ) ) return res } finally { nativeHeap . free ( ffiClosure ) } }","docstring":"/**\n * Uses libffi to allocate a native function which will call [impl] when invoked.\n *\n * @param ffiCif describes the type of the function to create\n */"} {"signature":"override fun get ( fir : FirElement , unwrapAlias : ( RealVariable , FirElement ) -> RealVariable ? ) : DataFlowVariable ?","body":"{ return get ( fir . unwrapElement ( ) , createReal = false , createSynthetic = false , unwrapAlias ) }","docstring":"/**\n * Get an existing [DataFlowVariable] for the specified [fir] [FirElement].\n *\n * @param unwrapAlias lambda used to transform a [RealVariable] if it represents an alias for another [RealVariable], or return the same\n * variable. If the alias is unstable, `null` can be returned. This will cause the function to also return `null`.\n */"} {"signature":"fun getOrCreateIfReal ( fir : FirElement , unwrapAlias : ( RealVariable , FirElement ) -> RealVariable ? ) : DataFlowVariable ?","body":"{ return get ( fir . unwrapElement ( ) , createReal = true , createSynthetic = false , unwrapAlias ) }","docstring":"/**\n * Get an existing [DataFlowVariable], or create a [RealVariable] for the specified [fir] [FirElement] if possible.\n * If the variable does not already exist and cannot be represented by a [RealVariable], the function will return `null`.\n *\n * @param unwrapAlias lambda used to transform a [RealVariable] if it represents an alias for another [RealVariable], or return the same\n * variable. If the alias is unstable, `null` can be returned. This will cause the function to also return `null`.\n */"} {"signature":"fun getOrCreate ( fir : FirElement , unwrapAlias : ( RealVariable , FirElement ) -> RealVariable ? ) : DataFlowVariable ?","body":"{ return get ( fir . unwrapElement ( ) , createReal = true , createSynthetic = true , unwrapAlias ) }","docstring":"/**\n * Get an existing [DataFlowVariable], or create a [DataFlowVariable] for the specified [fir] [FirElement].\n *\n * @param unwrapAlias lambda used to transform a [RealVariable] if it represents an alias for another [RealVariable], or return the same\n * variable. If the alias is unstable, `null` can be returned. This will cause the function to also return `null`.\n */"} {"signature":"public fun createCopy ( ) : T ?","body":"public fun createCopy ( ) : T ?","docstring":"/**\n * Creates a copy of the current instance.\n *\n * For better debuggability, it is recommended to use original exception as [cause][Throwable.cause] of the resulting one.\n * Stacktrace of copied exception will be overwritten by stacktrace recovery machinery by [Throwable.setStackTrace] call.\n * An exception can opt-out of copying by returning `null` from this function.\n * Suppressed exceptions of the original exception should not be copied in order to avoid circular exceptions.\n *\n * This function is allowed to create a copy with a modified [message][Throwable.message], but it should be noted\n * that the copy can be later recovered as well and message modification code should handle this situation correctly\n * (e.g. by also storing the original message and checking it) to produce a human-readable result.\n */"} {"signature":"public fun < T > flow ( @ BuilderInference block : suspend FlowCollector < T > . ( ) -> Unit ) : Flow < T >","body":"= SafeFlow ( block )","docstring":"/**\n * Creates a _cold_ flow from the given suspendable [block].\n * The flow being _cold_ means that the [block] is called every time a terminal operator is applied to the resulting flow.\n *\n * Example of usage:\n *\n * ```\n * fun fibonacci(): Flow = flow {\n * var x = BigInteger.ZERO\n * var y = BigInteger.ONE\n * while (true) {\n * emit(x)\n * x = y.also {\n * y += x\n * }\n * }\n * }\n *\n * fibonacci().take(100).collect { println(it) }\n * ```\n *\n * Emissions from [flow] builder are [cancellable] by default — each call to [emit][FlowCollector.emit]\n * also calls [ensureActive][CoroutineContext.ensureActive].\n *\n * `emit` should happen strictly in the dispatchers of the [block] in order to preserve the flow context.\n * For example, the following code will result in an [IllegalStateException]:\n *\n * ```\n * flow {\n * emit(1) // Ok\n * withContext(Dispatcher.IO) {\n * emit(2) // Will fail with ISE\n * }\n * }\n * ```\n *\n * If you want to switch the context of execution of a flow, use the [flowOn] operator.\n */"} {"signature":"public fun < T > ( ( ) -> T ) . asFlow ( ) : Flow < T >","body":"= flow { emit ( invoke ( ) ) }","docstring":"/**\n * Creates a _cold_ flow that produces a single value from the given functional type.\n */"} {"signature":"public fun < T > ( suspend ( ) -> T ) . asFlow ( ) : Flow < T >","body":"= flow { emit ( invoke ( ) ) }","docstring":"/**\n * Creates a _cold_ flow that produces a single value from the given functional type.\n *\n * Example of usage:\n *\n * ```\n * suspend fun remoteCall(): R = ...\n * fun remoteCallFlow(): Flow = ::remoteCall.asFlow()\n * ```\n */"} {"signature":"public fun < T > Iterable < T > . asFlow ( ) : Flow < T >","body":"= flow { forEach { value -> emit ( value ) } }","docstring":"/**\n * Creates a _cold_ flow that produces values from the given iterable.\n */"} {"signature":"public fun < T > Iterator < T > . asFlow ( ) : Flow < T >","body":"= flow { forEach { value -> emit ( value ) } }","docstring":"/**\n * Creates a _cold_ flow that produces values from the given iterator.\n */"} {"signature":"public fun < T > Sequence < T > . asFlow ( ) : Flow < T >","body":"= flow { forEach { value -> emit ( value ) } }","docstring":"/**\n * Creates a _cold_ flow that produces values from the given sequence.\n */"} {"signature":"public fun < T > flowOf ( vararg elements : T ) : Flow < T >","body":"= flow { for ( element in elements ) { emit ( element ) } }","docstring":"/**\n * Creates a flow that produces values from the specified `vararg`-arguments.\n *\n * Example of usage:\n *\n * ```\n * flowOf(1, 2, 3)\n * ```\n */"} {"signature":"public fun < T > flowOf ( value : T ) : Flow < T >","body":"= flow { emit ( value ) }","docstring":"/**\n * Creates a flow that produces the given [value].\n */"} {"signature":"public fun < T > emptyFlow ( ) : Flow < T >","body":"= EmptyFlow","docstring":"/**\n * Returns an empty flow.\n */"} {"signature":"public fun < T > Array < T > . asFlow ( ) : Flow < T >","body":"= flow { forEach { value -> emit ( value ) } }","docstring":"/**\n * Creates a _cold_ flow that produces values from the given array.\n * The flow being _cold_ means that the array components are read every time a terminal operator is applied\n * to the resulting flow.\n */"} {"signature":"public fun IntArray . asFlow ( ) : Flow < Int >","body":"= flow { forEach { value -> emit ( value ) } }","docstring":"/**\n * Creates a _cold_ flow that produces values from the array.\n * The flow being _cold_ means that the array components are read every time a terminal operator is applied\n * to the resulting flow.\n */"} {"signature":"public fun LongArray . asFlow ( ) : Flow < Long >","body":"= flow { forEach { value -> emit ( value ) } }","docstring":"/**\n * Creates a _cold_ flow that produces values from the given array.\n * The flow being _cold_ means that the array components are read every time a terminal operator is applied\n * to the resulting flow.\n */"} {"signature":"public fun IntRange . asFlow ( ) : Flow < Int >","body":"= flow { forEach { value -> emit ( value ) } }","docstring":"/**\n * Creates a flow that produces values from the range.\n */"} {"signature":"public fun LongRange . asFlow ( ) : Flow < Long >","body":"= flow { forEach { value -> emit ( value ) } }","docstring":"/**\n * Creates a flow that produces values from the range.\n */"} {"signature":"public fun < T > channelFlow ( @ BuilderInference block : suspend ProducerScope < T > . ( ) -> Unit ) : Flow < T >","body":"= ChannelFlowBuilder ( block )","docstring":"/**\n * Creates an instance of a _cold_ [Flow] with elements that are sent to a [SendChannel]\n * provided to the builder's [block] of code via [ProducerScope]. It allows elements to be\n * produced by code that is running in a different context or concurrently.\n * The resulting flow is _cold_, which means that [block] is called every time a terminal operator\n * is applied to the resulting flow.\n *\n * This builder ensures thread-safety and context preservation, thus the provided [ProducerScope] can be used\n * concurrently from different contexts.\n * The resulting flow completes as soon as the code in the [block] and all its children completes.\n * Use [awaitClose] as the last statement to keep it running.\n * A more detailed example is provided in the documentation of [callbackFlow].\n *\n * A channel with the [default][Channel.BUFFERED] buffer size is used. Use the [buffer] operator on the\n * resulting flow to specify a user-defined value and to control what happens when data is produced faster\n * than consumed, i.e. to control the back-pressure behavior.\n *\n * Adjacent applications of [channelFlow], [flowOn], [buffer], and [produceIn] are\n * always fused so that only one properly configured channel is used for execution.\n *\n * Examples of usage:\n *\n * ```\n * fun Flow.merge(other: Flow): Flow = channelFlow {\n * // collect from one coroutine and send it\n * launch {\n * collect { send(it) }\n * }\n * // collect and send from this coroutine, too, concurrently\n * other.collect { send(it) }\n * }\n *\n * fun contextualFlow(): Flow = channelFlow {\n * // send from one coroutine\n * launch(Dispatchers.IO) {\n * send(computeIoValue())\n * }\n * // send from another coroutine, concurrently\n * launch(Dispatchers.Default) {\n * send(computeCpuValue())\n * }\n * }\n * ```\n */"} {"signature":"public fun < T > callbackFlow ( @ BuilderInference block : suspend ProducerScope < T > . ( ) -> Unit ) : Flow < T >","body":"= CallbackFlowBuilder ( block )","docstring":"/**\n * Creates an instance of a _cold_ [Flow] with elements that are sent to a [SendChannel]\n * provided to the builder's [block] of code via [ProducerScope]. It allows elements to be\n * produced by code that is running in a different context or concurrently.\n *\n * The resulting flow is _cold_, which means that [block] is called every time a terminal operator\n * is applied to the resulting flow.\n *\n * This builder ensures thread-safety and context preservation, thus the provided [ProducerScope] can be used\n * from any context, e.g. from a callback-based API.\n * The resulting flow completes as soon as the code in the [block] completes.\n * [awaitClose] should be used to keep the flow running, otherwise the channel will be closed immediately\n * when block completes.\n * [awaitClose] argument is called either when a flow consumer cancels the flow collection\n * or when a callback-based API invokes [SendChannel.close] manually and is typically used\n * to cleanup the resources after the completion, e.g. unregister a callback.\n * Using [awaitClose] is mandatory in order to prevent memory leaks when the flow collection is cancelled,\n * otherwise the callback may keep running even when the flow collector is already completed.\n * To avoid such leaks, this method throws [IllegalStateException] if block returns, but the channel\n * is not closed yet.\n *\n * A channel with the [default][Channel.BUFFERED] buffer size is used. Use the [buffer] operator on the\n * resulting flow to specify a user-defined value and to control what happens when data is produced faster\n * than consumed, i.e. to control the back-pressure behavior.\n *\n * Adjacent applications of [callbackFlow], [flowOn], [buffer], and [produceIn] are\n * always fused so that only one properly configured channel is used for execution.\n *\n * Example of usage that converts a multi-shot callback API to a flow.\n * For single-shot callbacks use [suspendCancellableCoroutine].\n *\n * ```\n * fun flowFrom(api: CallbackBasedApi): Flow = callbackFlow {\n * val callback = object : Callback { // Implementation of some callback interface\n * override fun onNextValue(value: T) {\n * // To avoid blocking you can configure channel capacity using\n * // either buffer(Channel.CONFLATED) or buffer(Channel.UNLIMITED) to avoid overfill\n * trySendBlocking(value)\n * .onFailure { throwable ->\n * // Downstream has been cancelled or failed, can log here\n * }\n * }\n * override fun onApiError(cause: Throwable) {\n * cancel(CancellationException(\"API Error\", cause))\n * }\n * override fun onCompleted() = channel.close()\n * }\n * api.register(callback)\n * /*\n * * Suspends until either 'onCompleted'/'onApiError' from the callback is invoked\n * * or flow collector is cancelled (e.g. by 'take(1)' or because a collector's coroutine was cancelled).\n * * In both cases, callback will be properly unregistered.\n * */\n * awaitClose { api.unregister(callback) }\n * }\n * ```\n *\n * > The callback `register`/`unregister` methods provided by an external API must be thread-safe, because\n * > `awaitClose` block can be called at any time due to asynchronous nature of cancellation, even\n * > concurrently with the call of the callback.\n */"} {"signature":"override fun printBuildReport ( data : ReadableFileReportData < B , P > , outputFile : File )","body":"{ outputFile . bufferedWriter ( ) . use { writer -> Printer ( writer ) . printBuildReport ( data , printMetrics ) { compileStatisticsData -> printCustomTaskMetrics ( compileStatisticsData , this ) } } }","docstring":"/**\n * Prints general build information, sum up compile metrics and detailed task and transform information.\n *\n * BuildExecutionData / BuildOperationRecord contains data for both tasks and transforms.\n * We still use the term \"tasks\" because saying \"tasks/transforms\" is a bit verbose and \"build operations\" may sound a bit unfamiliar.\n */"} {"signature":"public fun Sink . asNSOutputStream ( ) : NSOutputStream","body":"= SinkNSOutputStream ( this )","docstring":"/**\n * Returns an output stream that writes to this sink. Closing the stream will also close this sink.\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 * ([NSOutputStream.initToBuffer](https://developer.apple.com/documentation/foundation/nsoutputstream/1410805-inittobuffer),\n * [NSOutputStream.initToMemory](https://developer.apple.com/documentation/foundation/nsoutputstream/1409909-inittomemory),\n * [NSOutputStream.initWithURL](https://developer.apple.com/documentation/foundation/nsoutputstream/1414446-initwithurl),\n * [NSOutputStream.initToFileAtPath](https://developer.apple.com/documentation/foundation/nsoutputstream/1416367-inittofileatpath)),\n * their use will result in a runtime error.\n *\n * @sample kotlinx.io.samples.KotlinxIoSamplesApple.asStream\n */"} {"signature":"inline fun < reified T : Any > empty ( vararg shape : Int , order : Order = Order . C ) : KtNDArray < T >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( shape , T :: class . javaObjectType , order ) )","docstring":"/**\n * Return a new array of given shape and T type, without initializing entries.\n *\n * @param shape of the empty array.\n * @param order see [Order].\n * @return [KtNDArray] of uninitialized data of the given [shape], [T], [order].\n */"} {"signature":"inline fun < reified T : Any > emptyLike ( prototype : KtNDArray < T > , order : Order = Order . K , subok : Boolean = true , shape : IntArray ? = null ) : KtNDArray < T >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( prototype , T :: class . javaObjectType ) , order = order , subok = subok , shape = shape )","docstring":"/**\n * Return a new array with the same shape and T type as a given array.\n *\n * @param prototype the shape and type of prototype define same attributes of the returned array.\n * @param order see [Order].\n * @param subok if *true*, then sub-classes will be passed-through,\n * otherwise the returned array will be forced to be a base-class array (default).\n * @param shape overrides the shape of the result.\n * @return [KtNDArray] of uninitialized data with the same shape and type as prototype.\n */"} {"signature":"inline fun < reified T : Any > eye ( n : Int , m : Int ? = null , k : Int = , order : Order = Order . C ) : KtNDArray < T >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( n , m ? : none , k , T :: class . javaObjectType ) , order = order )","docstring":"/**\n * Return a 2-D array with ones on the diagonal and zeros elsewhere.\n *\n * @param n number of rows in the output.\n * @param m number of columns in the output. If null, defaults to [n].\n * @param k index of the diagonal.\n * @param order see [Order]\n * @return [KtNDArray] where all elements are equal to zero, except for the k-th diagonal,\n * whose values are equal to one.\n * @see identity\n * @see diag\n */"} {"signature":"inline fun < reified T : Any > identity ( n : Int ) : KtNDArray < T >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( n , T :: class . javaObjectType ) )","docstring":"/**\n * Return the identity array.\n *\n * @param n number of rows and columns in *n*x*n* output.\n * @return 2-D [KtNDArray] *n*x*n* with its main diagonal set to one, and all other elements 0.\n */"} {"signature":"inline fun < reified T : Any > ones ( vararg shape : Int , order : Order = Order . C ) : KtNDArray < T >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( shape , T :: class . javaObjectType ) , order = order )","docstring":"/**\n * Return a new array of given shape and T type, filled with ones.\n *\n * @param shape of the new array.\n * @param order see [Order]\n * @return [KtNDArray] of ones with the given [shape], type [T] and [order].\n * @see onesLike\n * @see empty\n * @see zeros\n * @see full\n */"} {"signature":"inline fun < reified T : Any > onesLike ( prototype : KtNDArray < T > , order : Order = Order . K , subok : Boolean = true , shape : IntArray ? = null ) : KtNDArray < T >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( prototype , T :: class . javaObjectType ) , order = order , subok = subok , shape = shape )","docstring":"/**\n * Return an array of ones with the same shape and T type as a given array.\n *\n * @param prototype the shape and type of prototype define same attributes of the returned array.\n * @param order see [Order]\n * @param subok if *true*, then sub-classes will be passed-through,\n * otherwise the returned array will be forced to be a base-class array (default).\n * @param shape overrides the shape of the result.\n * @return [KtNDArray] of ones with the same shape and type as prototype.\n * @see emptyLike\n * @see zerosLike\n * @see fullLike\n * @see ones\n */"} {"signature":"inline fun < reified T : Any > zeros ( vararg shape : Int , order : Order = Order . C ) : KtNDArray < T >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( shape , T :: class . javaObjectType ) , order = order )","docstring":"/**\n * Return a new array of given shape and T type, filled with zeros.\n *\n * @param shape shape of the new array.\n * @param order see [Order]\n * @return Array of zeros with the given [shape], type [T] and [order].\n * @see zerosLike\n * @see empty\n * @see ones\n * @see full\n */"} {"signature":"inline fun < reified T : Any > zerosLike ( prototype : KtNDArray < T > , order : Order = Order . K , subok : Boolean = true , shape : IntArray ? = null ) : KtNDArray < T >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( prototype , T :: class . javaObjectType ) , order = order , subok = subok , shape = shape )","docstring":"/**\n * Return an array of zeros with the same shape and T type as a given array.\n *\n * @param prototype the shape and type of prototype define same attributes of the returned array.\n * @param order see [Order]\n * @param subok if *true*, then sub-classes will be passed-through,\n * otherwise the returned array will be forced to be a base-class array (default).\n * @param shape overrides the shape of the result.\n * @return Array of zeros with the same shape and type as [prototype].\n * @see emptyLike\n * @see onesLike\n * @see fullLike\n * @see zeros\n */"} {"signature":"inline fun < reified T : Any > full ( shape : IntArray , fillValue : T , order : Order = Order . C ) : KtNDArray < T >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( shape , fillValue , T :: class . javaObjectType ) , order = order )","docstring":"/**\n * Return a new array of given shape and T type, filled with fill_value.\n *\n * @param shape of the new array.\n * @param order see [Order]\n * @return [KtNDArray] of [fillValue] the given [shape], [T] and [order].\n * @see fullLike\n * @see empty\n * @see ones\n * @see zeros\n */"} {"signature":"inline fun < reified T : Any > fullLike ( prototype : KtNDArray < T > , fillValue : T , order : Order = Order . K , subok : Boolean = true , shape : IntArray ? = null ) : KtNDArray < T >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( prototype , fillValue , T :: class . javaObjectType ) , order = order , subok = subok , shape = shape )","docstring":"/**\n * Return a full array with the same shape and T type as a given array.\n *\n * @param prototype the shape and type of prototype define same attributes of the returned array.\n * @param fillValue fill value.\n * @param order see [Order]\n * @return [KtNDArray] of [fillValue] with the same [shape] and type [T] as [prototype].\n * @see emptyLike\n * @see onesLike\n * @see zerosLike\n * @see full\n */"} {"signature":"inline fun < reified T : Any > array ( arr : Array < T > , order : Order = Order . K , subok : Boolean = false , ndmin : Int = ) : KtNDArray < T >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( arr , T :: class . javaObjectType ) , order = order , subok = subok , ndmin = ndmin )","docstring":"/**\n * Create an flattened array.\n *\n * @param arr any [Array].\n * @param order specify the memory layout of the array.\n * @param subok if *true*, then sub-classes will be passed-through,\n * otherwise the returned array will be forced to be a base-class array (default).\n * @param ndmin specifies the minimum number of dimensions that the resulting array should have.\n * @return [KtNDArray]\n * @see emptyLike\n * @see onesLike\n * @see zerosLike\n * @see fullLike\n * @see empty\n * @see ones\n * @see zeros\n * @see full\n */"} {"signature":"inline fun < reified T : Any > array ( arr : List < Any > , order : Order = Order . K , subok : Boolean = false , ndmin : Int = ) : KtNDArray < T >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( arr , T :: class . javaObjectType ) , order = order , subok = subok , ndmin = ndmin )","docstring":"/**\n * Create an array.\n * Dimension is set by nesting lists.\n * > Note that the [List] type is [Any]; use the same type everywhere.\n *\n * @param arr list of any.\n * @param order specify the memory layout of the array.\n * @param subok if *true*, then sub-classes will be passed-through,\n * otherwise the returned array will be forced to be a base-class array (default).\n * @param ndmin specifies the minimum number of dimensions that the resulting array should have.\n * @return [KtNDArray]\n * @see emptyLike\n * @see onesLike\n * @see zerosLike\n * @see fullLike\n * @see empty\n * @see ones\n * @see zeros\n * @see full\n */"} {"signature":"fun < T : Any > copy ( a : KtNDArray < T > , order : Order = Order . K ) : KtNDArray < T >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( a ) , order = order )","docstring":"/**\n * Return an array copy of the given object.\n *\n * @param a input data.\n * @param order see [Order]\n * @return Array interpretation of [a].\n */"} {"signature":"inline fun < reified T : Any > fromfile ( file : File , count : Int = - , sep : String = \"\" , offset : Int = ) : KtNDArray < T >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( file . absolutePath , T :: class . javaObjectType , count , sep , offset ) )","docstring":"/**\n * Construct an array from data in a text or binary file.\n *\n * @param file open file object.\n * @param count number of items to read. -1 means all items.\n * @param sep separator between items if file is a text file.\n * @param offset (in bytes) from the file's current position.\n * @see loadtxt\n */"} {"signature":"inline fun < reified T : Any > fromfile ( file : String , count : Int = - , sep : String = \"\" , offset : Int = ) : KtNDArray < T >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( file , T :: class . javaObjectType , count , sep , offset ) )","docstring":"/**\n * @param file filename.\n */"} {"signature":"inline fun < reified T : Any > fromstring ( string : String , count : Int = - , sep : String ) : KtNDArray < T >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( string , T :: class . javaObjectType , count , sep ) )","docstring":"/**\n * A new 1-D array initialized from text data in a string.\n *\n * @param string containing the data.\n * @param count number of items to read. -1 means all items.\n * @param sep separatoring numbers in the data.\n * @see fromfile\n */"} {"signature":"inline fun < reified T : Any > loadtxt ( fname : String , comments : String = \"\" , delimiter : String ? = null , converters : Map < Any , Any > ? = null , skiprows : Int = , usecols : IntArray ? = null , unpack : Boolean = false , ndmin : Int = , encoding : String = \"\" , max_rows : Int ? = null ) : KtNDArray < T >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( fname , T :: class . javaObjectType , comments , delimiter ? : none ) )","docstring":"/**\n * Load data from a text file.\n *\n * @param fname filename.\n * @param comments the characters used to indicate the start of a comment.\n * @param delimiter the string used to separate values.\n * @param converters A [Map] mapping column number to a function that will parse the column string in the desired value.\n * Not impl.\n * @param skiprows skip the first lines.\n * @param usecols which columns to read.\n * @return [KtNDArray] from the text file.\n * @see fromstring\n */"} {"signature":"inline fun < reified T : Number > arange ( start : Number , stop : Number , step : Number ) : KtNDArray < T >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( start , stop , step , T :: class . javaObjectType ) )","docstring":"/**\n * Return evenly spaced values within a given interval.\n * @param start start of interval.\n * @param stop end of interval.\n * @param step spacing between values.\n * @return new [KtNDArray] of type [T].\n */"} {"signature":"inline fun < reified T : Number > linspace ( start : Number , stop : Number , num : Int = , endpoint : Boolean = true , retstep : Boolean = false , axis : Int = ) : KtNDArray < T >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( start , stop , num , endpoint , retstep , T :: class . javaObjectType , axis ) )","docstring":"/**\n * Return evenly spaced numbers over a specified interval.\n *\n * @param start the starting value of the sequence.\n * @param stop the end value of the sequence.\n * @param num number of samples to generate. Default is 50.\n * @param endpoint if *true*, [stop] is the last sample.\n * @param retstep if *true*, return (samples, step).\n * @param axis the axis in the result to store the samples.\n * @return There are [num] equally spaced samples in the closed interval ```[start, stop]```.\n */"} {"signature":"inline fun < reified T : Number > geomspace ( start : Number , stop : Number , num : Int = , endpoint : Boolean = true , axis : Int = ) : KtNDArray < T >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( start , stop , num , endpoint , T :: class . javaObjectType , axis ) )","docstring":"/**\n * Return numbers spaced evenly on a geometric progression.\n *\n * @param start the starting value of the sequence.\n * @param stop the final value of the sequence.\n * @param num number of samples to generate. Default is 50.\n * @param endpoint if *true*, [stop] is the las sample.\n * @param axis in the result to store the samples.\n * @return [num] samples, equally spaced on a log scale.\n * @see logspace\n * @see linspace\n * @see arange\n */"} {"signature":"fun < T : Number > diag ( vararg v : T , k : Int = ) : KtNDArray < T >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( v , k ) )","docstring":"/**\n * Extract a diagonal or construct a diagonal array.\n * @param v values.\n * @param k diagonal\n * @return [KtNDArray]\n * @see diagflat\n * @see triu\n * @see tril\n */"} {"signature":"fun < T : Number > diag ( v : KtNDArray < T > , k : Int = ) : KtNDArray < T >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( v , k ) )","docstring":"/**\n * @param v if [v] a 2-D array, return a copy of its k-th diagonal. If [v] is a 1-D array, return a 2-D array\n * with [v] on the [k]-th diagonal\n */"} {"signature":"fun < T : Number > diagflat ( v : KtNDArray < T > , k : Int = ) : KtNDArray < T >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( v , k ) )","docstring":"/**\n * Create a 2-D array with the flattened input as a diagonal.\n * @param v input data.\n * @param k diagonal.\n * @return 2-D output [KtNDArray]\n * @see diag\n */"} {"signature":"inline fun < reified T : Any > tri ( n : Int , m : Int ? = null , k : Int = ) : KtNDArray < T >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( n , m ? : none , k , T :: class . javaObjectType ) )","docstring":"/**\n * An array with ones at and below the given diagonal and zeros elsewhere.\n *\n * @param n number of rows in the array.\n * @param m number of columns in the array. By default, [m] is taken equal to [n].\n * @param k the sub-diagonal at and below which the array is filled.\n * @return Array with its lower triangle filled with ones and zero elsewhere.\n */"} {"signature":"@ JvmName ( \"\" ) fun tril ( m : List < List < Byte > > , k : Int = ) : KtNDArray < Long >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( m , k ) )","docstring":"/**\n * Lower triangle of an array.\n *\n * @param m input array.\n * @param k diagonal above which to zero elements.\n * @return Return a copy of an array with elements above the k-th diagonal zeroed.\n * @see triu\n */"} {"signature":"@ JvmName ( \"\" ) fun triu ( m : List < List < Byte > > , k : Int = ) : KtNDArray < Long >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( m , k ) )","docstring":"/**\n * Upper triangle of an array.\n *\n * @param m input array.\n * @param k diagonal above which to zeros elements.\n * @return Return a copy of a matrix with elements below the k-th diagonal zeroed.\n * @see tril\n */"} {"signature":"fun < T : Number > vander ( x : KtNDArray < T > , n : Int ? = null , increasing : Boolean = false ) : KtNDArray < T >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( x , n ? : none , increasing ) )","docstring":"/**\n * Generate a Vandermonde matrix.\n *\n * @param x 1-D input array.\n * @param n number of columns in the output.\n * @param increasing order of the powers if the columns.\n * @return Vendermonde matrix.\n */"} {"signature":"@ JvmName ( \"\" ) inline fun < reified T : Any > mat ( data : List < T > ) : KtNDArray < T >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( data , T :: class . javaObjectType ) )","docstring":"/**\n * Interpret the input as a matrix (2-D [KtNDArray]).\n *\n * @param data input data.\n * @return 2-D [KtNDArray]\n */"} {"signature":"@ JvmName ( \"\" ) inline fun < reified T : Any > bmat ( data : List < KtNDArray < T > > ) : KtNDArray < T >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( data , T :: class . javaObjectType ) )","docstring":"/**\n * Build a matrix object from a [List].\n *\n * @param data input data.\n * @return a 2-D [KtNDArray].\n * @see block\n */"} {"signature":"@ JvmName ( \"\" ) inline fun < reified T : Any > bmat ( data : List < List < KtNDArray < T > > > ) : KtNDArray < T >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( data , T :: class . javaObjectType ) )","docstring":"/**\n * Build a matrix object from a [List] of [List].\n * @param data input data.\n * @return a 2-D [KtNDArray].\n * @see block\n */"} {"signature":"fun < T : Number > meshgrid ( vararg xi : KtNDArray < T > ) : List < KtNDArray < T > >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( * xi ) , kClass = List :: class ) as List < KtNDArray < T > >","docstring":"/**\n * Return coordinate matrices from coordinate vectors.\n *\n * @param xi 1-D arrays representing the coordinates of a grid.\n */"} {"signature":"inline fun < reified T : Any > type ( l : KtNDArray < T > )","body":"= T :: class . java","docstring":"/**\n * Return [KtNDArray] type.\n */"} {"signature":"@ Test fun sample ( )","body":"{ val testProject = javaTestProject { dokkaConfiguration { moduleName = \"\" javaSourceSet { } } javaFile ( pathFromSrc = \"\" ) { + \"\"\"\"\"\" } } val module = testProject . parse ( ) assertEquals ( \"\" , module . name ) assertEquals ( , module . packages . size ) val pckg = module . packages [ ] assertEquals ( \"\" , pckg . name ) assertEquals ( , pckg . classlikes . size ) val fooClass = pckg . classlikes [ ] assertEquals ( \"\" , fooClass . name ) }","docstring":"/**\n * Used as a sample for [javaTestProject]\n */"} {"signature":"private fun getEffectivePropertyInitializer ( property : FirProperty , resolveIfNeeded : Boolean ) : FirExpression ?","body":"{ val initializer = property . backingField ? . initializer ? : property . initializer if ( resolveIfNeeded && initializer is FirLiteralExpression < * > ) { property . lazyResolveToPhase ( FirResolvePhase . BODY_RESOLVE ) return getEffectivePropertyInitializer ( property , resolveIfNeeded = false ) } return initializer }","docstring":"/**\n * In partial module compilation (see [org.jetbrains.kotlin.analysis.api.fir.components.KtFirCompilerFacility]),\n * referenced properties might be resolved only up to [FirResolvePhase.CONTRACTS],\n * however the backend requires the exact initializer type.\n */"} {"signature":"internal fun computeDispatchReceiverType ( irFunction : IrSimpleFunction , firCallable : FirCallableDeclaration ? , parent : IrDeclarationParent ? , c : Fir2IrComponents ) : IrType ?","body":"{ if ( firCallable is FirProperty && firCallable . isLocal ) return null val containingClass = computeContainingClass ( parent ) ? : return null val defaultType = containingClass . defaultType if ( firCallable == null ) return defaultType if ( ! irFunction . isFakeOverride ) return defaultType val originalCallable = firCallable . unwrapFakeOverrides ( ) val containerOfOriginalCallable = originalCallable . containingClassLookupTag ( ) ? : return defaultType val containerOfFakeOverride = firCallable . dispatchReceiverType ? : return defaultType val correspondingSupertype = AbstractTypeChecker . findCorrespondingSupertypes ( c . session . typeContext . newTypeCheckerState ( errorTypesEqualToAnything = false , stubTypesEqualToAnything = false ) , containerOfFakeOverride , containerOfOriginalCallable ) . firstOrNull ( ) as ConeKotlinType ? ? : return defaultType return correspondingSupertype . toIrType ( c ) }","docstring":"/**\n * [firCallable] is function or property (if [irFunction] is a property accessor) for\n * which [irFunction] was build\n *\n * It is needed to determine proper dispatch receiver type if this declaration is fake-override\n */"} {"signature":"@ OptIn ( UnsafeDuringIrConstructionAPI :: class ) internal fun addDeclarationToParent ( declaration : IrDeclaration , irParent : IrDeclarationParent ? )","body":"{ if ( irParent == null ) return when ( irParent ) { is Fir2IrLazyClass -> { } is IrClass -> irParent . declarations += declaration is IrFile -> irParent . declarations += declaration is IrExternalPackageFragment -> irParent . declarations += declaration is IrScript -> { } else -> error ( \"\" ) } }","docstring":"/**\n * We should not try to add declaration to list of parents declarations in two cases:\n * 1. getters, setters, and backing fields are not stored in parent directly. They are stored in IrProperty instead,\n * which is stored in parent\n * 2. if a declaration is declared in a local scope (in some body) then it will have contained class/function as a parent. But the declaration\n * should be listed in statements list of the corresponding IrBlock instead of IrClass.declarations\n * Note that IrClass will be a parent if some declaration is declared inside anonymous initializer, because IrAnonymousInitializer\n * is not a IrDeclarationParent\n */"} {"signature":"fun g ( )","body":"{ }","docstring":"/**\n * [X.YY.aa]\n */"} {"signature":"public fun DataFrame . Companion . readArrowIPC ( channel : ReadableByteChannel , allocator : RootAllocator = Allocator . ROOT , nullability : NullabilityOptions = NullabilityOptions . Infer , ) : AnyFrame","body":"= readArrowIPCImpl ( channel , allocator , nullability )","docstring":"/**\n * Read [Arrow interprocess streaming format](https://arrow.apache.org/docs/java/ipc.html#writing-and-reading-streaming-format) data from existing [channel]\n */"} {"signature":"public fun DataFrame . Companion . readArrowFeather ( channel : SeekableByteChannel , allocator : RootAllocator = Allocator . ROOT , nullability : NullabilityOptions = NullabilityOptions . Infer , ) : AnyFrame","body":"= readArrowFeatherImpl ( channel , allocator , nullability )","docstring":"/**\n * Read [Arrow random access format](https://arrow.apache.org/docs/java/ipc.html#writing-and-reading-random-access-files) data from existing [channel]\n */"} {"signature":"public fun DataFrame . Companion . readArrowIPC ( file : File , nullability : NullabilityOptions = NullabilityOptions . Infer , ) : AnyFrame","body":"= Files . newByteChannel ( file . toPath ( ) ) . use { readArrowIPC ( it , nullability = nullability ) }","docstring":"/**\n * Read [Arrow interprocess streaming format](https://arrow.apache.org/docs/java/ipc.html#writing-and-reading-streaming-format) data from existing [file]\n */"} {"signature":"public fun DataFrame . Companion . readArrowIPC ( byteArray : ByteArray , nullability : NullabilityOptions = NullabilityOptions . Infer , ) : AnyFrame","body":"= SeekableInMemoryByteChannel ( byteArray ) . use { readArrowIPC ( it , nullability = nullability ) }","docstring":"/**\n * Read [Arrow interprocess streaming format](https://arrow.apache.org/docs/java/ipc.html#writing-and-reading-streaming-format) data from existing [byteArray]\n */"} {"signature":"public fun DataFrame . Companion . readArrowIPC ( stream : InputStream , nullability : NullabilityOptions = NullabilityOptions . Infer , ) : AnyFrame","body":"= Channels . newChannel ( stream ) . use { readArrowIPC ( it , nullability = nullability ) }","docstring":"/**\n * Read [Arrow interprocess streaming format](https://arrow.apache.org/docs/java/ipc.html#writing-and-reading-streaming-format) data from existing [stream]\n */"} {"signature":"public fun DataFrame . Companion . readArrowIPC ( url : URL , nullability : NullabilityOptions = NullabilityOptions . Infer , ) : AnyFrame","body":"= when { isFile ( url ) -> readArrowIPC ( urlAsFile ( url ) , nullability ) isProtocolSupported ( url ) -> url . openStream ( ) . use { readArrowIPC ( it , nullability ) } else -> { throw IllegalArgumentException ( \"\" ) } }","docstring":"/**\n * Read [Arrow interprocess streaming format](https://arrow.apache.org/docs/java/ipc.html#writing-and-reading-streaming-format) data from existing [url]\n */"} {"signature":"public fun DataFrame . Companion . readArrowFeather ( file : File , nullability : NullabilityOptions = NullabilityOptions . Infer , ) : AnyFrame","body":"= Files . newByteChannel ( file . toPath ( ) ) . use { readArrowFeather ( it , nullability = nullability ) }","docstring":"/**\n * Read [Arrow random access format](https://arrow.apache.org/docs/java/ipc.html#writing-and-reading-random-access-files) data from existing [file]\n */"} {"signature":"public fun DataFrame . Companion . readArrowFeather ( byteArray : ByteArray , nullability : NullabilityOptions = NullabilityOptions . Infer , ) : AnyFrame","body":"= SeekableInMemoryByteChannel ( byteArray ) . use { readArrowFeather ( it , nullability = nullability ) }","docstring":"/**\n * Read [Arrow random access format](https://arrow.apache.org/docs/java/ipc.html#writing-and-reading-random-access-files) data from existing [byteArray]\n */"} {"signature":"public fun DataFrame . Companion . readArrowFeather ( stream : InputStream , nullability : NullabilityOptions = NullabilityOptions . Infer , ) : AnyFrame","body":"= readArrowFeather ( stream . readBytes ( ) , nullability )","docstring":"/**\n * Read [Arrow random access format](https://arrow.apache.org/docs/java/ipc.html#writing-and-reading-random-access-files) data from existing [stream]\n */"} {"signature":"public fun DataFrame . Companion . readArrowFeather ( url : URL , nullability : NullabilityOptions = NullabilityOptions . Infer , ) : AnyFrame","body":"= when { isFile ( url ) -> readArrowFeather ( urlAsFile ( url ) , nullability ) isProtocolSupported ( url ) -> readArrowFeather ( url . readBytes ( ) , nullability ) else -> { throw IllegalArgumentException ( \"\" ) } }","docstring":"/**\n * Read [Arrow random access format](https://arrow.apache.org/docs/java/ipc.html#writing-and-reading-random-access-files) data from existing [url]\n */"} {"signature":"public fun DataFrame . Companion . readArrowFeather ( path : String , nullability : NullabilityOptions = NullabilityOptions . Infer , ) : AnyFrame","body":"= if ( isURL ( path ) ) { readArrowFeather ( URL ( path ) , nullability ) } else { readArrowFeather ( File ( path ) , nullability ) }","docstring":"/**\n * Read [Arrow random access format](https://arrow.apache.org/docs/java/ipc.html#writing-and-reading-random-access-files) data from existing [path]\n */"} {"signature":"public fun DataFrame . Companion . readArrow ( reader : ArrowReader , nullability : NullabilityOptions = NullabilityOptions . Infer ) : AnyFrame","body":"= readArrowImpl ( reader , nullability )","docstring":"/**\n * Read [Arrow any format](https://arrow.apache.org/docs/java/ipc.html#reading-writing-ipc-formats) data from existing [reader]\n */"} {"signature":"public fun ArrowReader . toDataFrame ( nullability : NullabilityOptions = NullabilityOptions . Infer ) : AnyFrame","body":"= DataFrame . Companion . readArrowImpl ( this , nullability )","docstring":"/**\n * Read [Arrow any format](https://arrow.apache.org/docs/java/ipc.html#reading-writing-ipc-formats) data from existing [ArrowReader]\n */"} {"signature":"@ Test fun testSuspensionsUndoingMdcContextUpdates ( )","body":"= runTest { MDC . put ( \"\" , \"\" ) withContext ( MDCContext ( ) ) { MDC . put ( \"\" , \"\" ) assertEquals ( \"\" , MDC . get ( \"\" ) ) yield ( ) assertNull ( MDC . get ( \"\" ) ) assertEquals ( \"\" , MDC . get ( \"\" ) ) } }","docstring":"/** Tests that the initially captured MDC context gets restored after suspension. */"} {"signature":"@ Test fun testRestoringMdcContext ( )","body":"= runTest { MDC . put ( \"\" , \"\" ) val contextMap = withContext ( MDCContext ( ) ) { MDC . put ( \"\" , \"\" ) assertEquals ( \"\" , MDC . get ( \"\" ) ) withContext ( MDCContext ( ) ) { assertEquals ( \"\" , MDC . get ( \"\" ) ) MDC . put ( \"\" , \"\" ) assertEquals ( \"\" , MDC . get ( \"\" ) ) withContext ( MDCContext ( ) ) { yield ( ) MDC . getCopyOfContextMap ( ) } } } MDC . setContextMap ( contextMap ) assertEquals ( \"\" , MDC . get ( \"\" ) ) assertEquals ( \"\" , MDC . get ( \"\" ) ) assertEquals ( \"\" , MDC . get ( \"\" ) ) }","docstring":"/** Tests capturing and restoring the MDC context. */"} {"signature":"abstract fun convert ( value : kotlin . String , name : kotlin . String ) : T","body":"abstract fun convert ( value : kotlin . String , name : kotlin . String ) : T","docstring":"/**\n * Function to convert string argument value to its type.\n * In case of error during conversion also provides help message.\n *\n * @param value value\n */"} {"signature":"inline fun < reified T : Enum < T > > Choice ( noinline toVariant : ( ( kotlin . String ) -> T ) ? = null , noinline toString : ( T ) -> kotlin . String = { it . toString ( ) . lowercase ( ) } ) : Choice < T >","body":"{ return Choice ( enumValues < T > ( ) . toList ( ) , toVariant ? : { enumValues < T > ( ) . find { e -> toString ( e ) . equals ( it , ignoreCase = true ) } ? : throw IllegalArgumentException ( \"\" ) } , toString ) }","docstring":"/**\n * Helper for arguments that have limited set of possible values represented as enumeration constants.\n */"} {"signature":"private fun forceBoxedReturnType ( descriptor : FunctionDescriptor ) : Boolean","body":"{ if ( isBoxMethodForInlineClass ( descriptor ) ) return true val returnType = descriptor . returnType ! ! if ( ( isFunctionExpression ( descriptor ) || isFunctionLiteral ( descriptor ) ) && returnType . isInlineClassType ( ) ) return true return isJvmPrimitive ( returnType ) && getAllOverriddenDescriptors ( descriptor ) . any { ! isJvmPrimitive ( it . returnType ! ! ) } || returnType . isInlineClassType ( ) && descriptor is JavaMethodDescriptor }","docstring":"/**\n * @return true iff a given function descriptor should be compiled to a method with boxed return type regardless of whether return type\n * of that descriptor is nullable or not. This happens in two cases:\n * - when a target function is a synthetic box method of erased inline class;\n * - when a function returning a value of a primitive type overrides another function with a non-primitive return type.\n * In that case the generated method's return type should be boxed: otherwise it's not possible to use\n * this class from Java since javac issues errors when loading the class (incompatible return types)\n */"} {"signature":"fun computeClasspathChanges ( classpathSnapshotFiles : ClasspathSnapshotFiles , lookupStorage : LookupStorage , storeCurrentClasspathSnapshotForReuse : ( currentClasspathSnapshot : List < AccessibleClassSnapshot > , shrunkCurrentClasspathAgainstPreviousLookups : List < AccessibleClassSnapshot > ) -> Unit , reporter : ClasspathSnapshotBuildReporter ) : ProgramSymbolSet","body":"{ val currentClasspathSnapshot = reporter . measure ( GradleBuildTime . LOAD_CURRENT_CLASSPATH_SNAPSHOT ) { val classpathSnapshot = CachedClasspathSnapshotSerializer . load ( classpathSnapshotFiles . currentClasspathEntrySnapshotFiles , reporter ) reporter . measure ( GradleBuildTime . REMOVE_DUPLICATE_CLASSES ) { classpathSnapshot . removeDuplicateAndInaccessibleClasses ( ) } } val shrunkCurrentClasspathAgainstPreviousLookups = reporter . measure ( GradleBuildTime . SHRINK_CURRENT_CLASSPATH_SNAPSHOT ) { shrinkClasspath ( currentClasspathSnapshot , lookupStorage , ClasspathSnapshotShrinker . MetricsReporter ( reporter , GradleBuildTime . GET_LOOKUP_SYMBOLS , GradleBuildTime . FIND_REFERENCED_CLASSES , GradleBuildTime . FIND_TRANSITIVELY_REFERENCED_CLASSES ) ) } reporter . debug { \"\" + \"\" } storeCurrentClasspathSnapshotForReuse ( currentClasspathSnapshot , shrunkCurrentClasspathAgainstPreviousLookups ) val shrunkPreviousClasspathSnapshot = reporter . measure ( GradleBuildTime . LOAD_SHRUNK_PREVIOUS_CLASSPATH_SNAPSHOT ) { ListExternalizer ( AccessibleClassSnapshotExternalizer ) . loadFromFile ( classpathSnapshotFiles . shrunkPreviousClasspathSnapshotFile ) } reporter . debug { \"\" } return reporter . measure ( GradleBuildTime . COMPUTE_CHANGED_AND_IMPACTED_SET ) { computeChangedAndImpactedSet ( shrunkCurrentClasspathAgainstPreviousLookups , shrunkPreviousClasspathSnapshot , reporter ) } }","docstring":"/**\n * Computes changes between the current and previous classpath, plus unchanged elements that are impacted by the changes.\n *\n * NOTE: We shrink the classpath first before comparing them. The original classpath may contain duplicate classes, but the shrunk\n * classpath must not contain duplicate classes.\n */"} {"signature":"fun computeChangedAndImpactedSet ( currentClassSnapshots : List < AccessibleClassSnapshot > , previousClassSnapshots : List < AccessibleClassSnapshot > , reporter : ClasspathSnapshotBuildReporter ) : ProgramSymbolSet","body":"{ val currentClasses : Map < ClassId , AccessibleClassSnapshot > = currentClassSnapshots . associateBy { it . classId } val previousClasses : Map < ClassId , AccessibleClassSnapshot > = previousClassSnapshots . associateBy { it . classId } val changedCurrentClasses : List < AccessibleClassSnapshot > = currentClasses . mapNotNull { ( classId , currentClass ) -> val previousClass = previousClasses [ classId ] if ( previousClass == null || currentClass . classAbiHash != previousClass . classAbiHash ) { currentClass } else null } val changedPreviousClasses : List < AccessibleClassSnapshot > = previousClasses . mapNotNull { ( classId , previousClass ) -> val currentClass = currentClasses [ classId ] if ( currentClass == null || currentClass . classAbiHash != previousClass . classAbiHash ) { previousClass } else null } val changedSet = reporter . measure ( GradleBuildTime . COMPUTE_CLASS_CHANGES ) { computeClassChanges ( changedCurrentClasses , changedPreviousClasses , reporter ) } reporter . reportVerboseWithLimit { \"\" } if ( changedSet . isEmpty ( ) ) { return changedSet } val changedAndImpactedSet = reporter . measure ( GradleBuildTime . COMPUTE_IMPACTED_SET ) { computeImpactedSymbols ( changes = changedSet , allClasses = ( previousClassSnapshots . asSequence ( ) + changedCurrentClasses . asSequence ( ) ) . asIterable ( ) ) } reporter . reportVerboseWithLimit { \"\" + ( changedAndImpactedSet . run { classes + classMembers . keys } - changedSet . run { classes + classMembers . keys } ) } return changedAndImpactedSet }","docstring":"/**\n * Computes changes between the current and previous lists of classes, plus unchanged elements that are impacted by the changes.\n *\n * NOTE: Each list of classes must not contain duplicates.\n */"} {"signature":"private fun computeClassChanges ( currentClassSnapshots : List < AccessibleClassSnapshot > , previousClassSnapshots : List < AccessibleClassSnapshot > , metrics : BuildMetricsReporter < GradleBuildTime , GradleBuildPerformanceMetric > ) : ProgramSymbolSet","body":"{ val ( currentKotlinClassSnapshots , currentJavaClassSnapshots ) = currentClassSnapshots . partition { it is KotlinClassSnapshot } val ( previousKotlinClassSnapshots , previousJavaClassSnapshots ) = previousClassSnapshots . partition { it is KotlinClassSnapshot } @ Suppress ( \"\" ) val kotlinClassChanges = metrics . measure ( GradleBuildTime . COMPUTE_KOTLIN_CLASS_CHANGES ) { computeKotlinClassChanges ( currentKotlinClassSnapshots as List < KotlinClassSnapshot > , previousKotlinClassSnapshots as List < KotlinClassSnapshot > ) } @ Suppress ( \"\" ) val javaClassChanges = metrics . measure ( GradleBuildTime . COMPUTE_JAVA_CLASS_CHANGES ) { JavaClassChangesComputer . compute ( currentJavaClassSnapshots as List < JavaClassSnapshot > , previousJavaClassSnapshots as List < JavaClassSnapshot > ) } return kotlinClassChanges + javaClassChanges }","docstring":"/**\n * Computes changes between the current and previous lists of classes. The returned result does not need to include elements that are\n * impacted by the changes.\n *\n * NOTE: Each list of classes must not contain duplicates.\n */"} {"signature":"private fun DirtyData . toProgramSymbols ( allClasses : Iterable < AccessibleClassSnapshot > ) : ProgramSymbolSet","body":"{ val changedProgramSymbols = dirtyLookupSymbols . toProgramSymbolSet ( allClasses ) val ( changedLookupSymbols , changedFqNames ) = changedProgramSymbols . toChangesEither ( ) . let { it . lookupSymbols . toSet ( ) to it . fqNames . toSet ( ) } val unmatchedLookupSymbols = this . dirtyLookupSymbols . toMutableSet ( ) . also { it . removeAll ( changedLookupSymbols ) } val unmatchedFqNames = this . dirtyClassesFqNames . toMutableSet ( ) . also { it . addAll ( this . dirtyClassesFqNamesForceRecompile ) it . removeAll ( changedFqNames ) } if ( unmatchedLookupSymbols . isEmpty ( ) && unmatchedFqNames . isEmpty ( ) ) { return changedProgramSymbols } val changedClassesFqNames = changedProgramSymbols . classes . mapTo ( mutableSetOf ( ) ) { it . asSingleFqName ( ) } unmatchedLookupSymbols . removeAll { FqName ( it . scope ) in changedClassesFqNames } val companionObjectFqNames = allClasses . mapNotNullTo ( mutableSetOf ( ) ) { clazz -> ( clazz as? RegularKotlinClassSnapshot ) ? . companionObjectName ? . let { it -> clazz . classId . createNestedClassId ( Name . identifier ( it ) ) . asSingleFqName ( ) } } unmatchedLookupSymbols . removeAll { FqName ( it . scope ) in companionObjectFqNames } unmatchedFqNames . removeAll ( companionObjectFqNames ) val classesFqNames = allClasses . filter { it is RegularKotlinClassSnapshot || it is JavaClassSnapshot } . mapTo ( mutableSetOf ( ) ) { it . classId . asSingleFqName ( ) } unmatchedLookupSymbols . removeAll { it . name == SAM_LOOKUP_NAME . asString ( ) && FqName ( it . scope ) !in classesFqNames } val packageFacadeFqNames = allClasses . filter { it is KotlinClassSnapshot && it !is RegularKotlinClassSnapshot } . mapTo ( mutableSetOf ( ) ) { it . classId . asSingleFqName ( ) } unmatchedLookupSymbols . removeAll { FqName ( it . scope ) . child ( Name . identifier ( it . name ) ) in packageFacadeFqNames } unmatchedFqNames . removeAll ( packageFacadeFqNames ) check ( unmatchedLookupSymbols . isEmpty ( ) ) { \"\" } check ( unmatchedFqNames . isEmpty ( ) ) { \"\" + \"\" } return changedProgramSymbols }","docstring":"/**\n * Converts this [DirtyData] to [ProgramSymbol]s.\n *\n * Specifically, [DirtyData] consists of:\n * - dirtyLookupSymbols (Collection)\n * - dirtyClassesFqNamesForceRecompile (Collection)\n *\n * First, we will convert `dirtyLookupSymbols` to [ProgramSymbol]s as `dirtyLookupSymbols` should contain all the changes.\n *\n * Then, we will check that:\n * 1. There are no items in `dirtyLookupSymbols` that have not yet been converted to [ProgramSymbol]s.\n * 2. `dirtyClassesFqNames` and `dirtyClassesFqNamesForceRecompile` must not contain new information that can't be derived from\n * `dirtyLookupSymbols`.\n */"} {"signature":"fun computeImpactedSymbols ( changes : ProgramSymbolSet , allClasses : Iterable < AccessibleClassSnapshot > ) : ProgramSymbolSet","body":"{ val impactedSymbolsResolver = AllImpacts . getResolver ( allClasses ) return ProgramSymbolSet . Collector ( ) . apply { val impactedClasses = findReachableNodes ( changes . classes , impactedSymbolsResolver :: getImpactedClasses ) addClasses ( impactedClasses ) val classMembers = changes . classMembers . map { ClassMembers ( it . key , it . value ) } val impactedClassMembers = findReachableNodes ( classMembers , impactedSymbolsResolver :: getImpactedClassMembers ) impactedClassMembers . forEach { addClassMembers ( it . classId , it . memberNames ) } changes . packageMembers . forEach { ( packageFqName , memberNames ) -> addPackageMembers ( packageFqName , memberNames ) } } . getResult ( ) }","docstring":"/**\n * Computes the set of [ProgramSymbol]s that are *transitively* impacted by the given set of [ProgramSymbol]s. For example, if a\n * superclass has changed/been impacted, its subclasses will be impacted.\n *\n * The returned set is *inclusive* (it contains the given set + the directly/transitively impacted ones).\n */"} {"signature":"inline fun < reified P : KtElement > getElementOfTypeAtCaretOrNull ( file : KtFile , caretTag : String ? = null ) : P ?","body":"{ val offset = getCaretPositionOrNull ( file , caretTag ) ? : return null return file . findElementAt ( offset ) ? . parentOfType ( ) ? : error ( \"\" ) }","docstring":"/**\n * Returns an element of type [P] at the specified caret, or returns `null` if no such caret exists. If the caret can be found but the\n * element has the wrong type, an error will be raised.\n */"} {"signature":"private fun < T : PsiElement > getBottommostElementOfTypeInRange ( file : KtFile , range : TextRange , elementType : Class < T > ) : T","body":"{ var candidate = PsiTreeUtil . findElementOfClassAtOffset ( file , range . startOffset , elementType , true ) while ( candidate != null && candidate . endOffset < range . endOffset ) { candidate = PsiTreeUtil . getParentOfType ( candidate , elementType ) ? . takeIf { it . startOffset == range . startOffset } } return candidate ? . takeIf { it . endOffset == range . endOffset } ? : error ( \"\" ) }","docstring":"/**\n * Find the bottommost element of an [elementType] or its subtype located precisely in the [range].\n */"} {"signature":"fun < E : KtElement > getBottommostSelectedElementOfType ( file : KtFile , elementType : Class < E > ) : E","body":"{ val range = getSelectedRange ( file ) return getBottommostElementOfTypeInRange ( file , range , elementType ) }","docstring":"/**\n * Find the bottommost element of [E] or its subtype wrapped in an '' selection tag.\n */"} {"signature":"public suspend fun send ( element : E )","body":"public suspend fun send ( element : E )","docstring":"/**\n * Sends the specified [element] to this channel, suspending the caller while the buffer of this channel is full\n * or if it does not exist, or throws an exception if the channel [is closed for `send`][isClosedForSend] (see [close] for details).\n *\n * [Closing][close] a channel _after_ this function has suspended does not cause this suspended [send] invocation\n * to abort, because closing a channel is conceptually like sending a special \"close token\" over this channel.\n * All elements sent over the channel are delivered in first-in first-out order. The sent element\n * will be delivered to receivers before the close token.\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 [send] managed to send the element, but was cancelled\n * while suspended, [CancellationException] will be thrown. See [suspendCancellableCoroutine] for low-level details.\n *\n * Because of the prompt cancellation guarantee, an exception does not always mean a failure to deliver the element.\n * See \"Undelivered elements\" section in [Channel] documentation for details on handling undelivered elements.\n *\n * Note that this function does not check for cancellation when it is not suspended.\n * Use [yield] or [CoroutineScope.isActive] to periodically check for cancellation in tight loops if needed.\n *\n * This function can be used in [select] invocations with the [onSend] clause.\n * Use [trySend] to try sending to this channel without waiting.\n */"} {"signature":"public fun trySend ( element : E ) : ChannelResult < Unit >","body":"public fun trySend ( element : E ) : ChannelResult < Unit >","docstring":"/**\n * Immediately adds the specified [element] to this channel, if this doesn't violate its capacity restrictions,\n * and returns the successful result. Otherwise, returns failed or closed result.\n * This is synchronous variant of [send], which backs off in situations when `send` suspends or throws.\n *\n * When `trySend` call returns a non-successful result, it guarantees that the element was not delivered to the consumer, and\n * it does not call `onUndeliveredElement` that was installed for this channel.\n * See \"Undelivered elements\" section in [Channel] documentation for details on handling undelivered elements.\n */"} {"signature":"public fun close ( cause : Throwable ? = null ) : Boolean","body":"public fun close ( cause : Throwable ? = null ) : Boolean","docstring":"/**\n * Closes this channel.\n * This is an idempotent operation — subsequent invocations of this function have no effect and return `false`.\n * Conceptually, it sends a special \"close token\" over this channel.\n *\n * Immediately after invocation of this function,\n * [isClosedForSend] starts returning `true`. However, [isClosedForReceive][ReceiveChannel.isClosedForReceive]\n * on the side of [ReceiveChannel] starts returning `true` only after all previously sent elements\n * are received.\n *\n * A channel that was closed without a [cause] throws a [ClosedSendChannelException] on attempts to [send]\n * and [ClosedReceiveChannelException] on attempts to [receive][ReceiveChannel.receive].\n * A channel that was closed with non-null [cause] is called a _failed_ channel. Attempts to send or\n * receive on a failed channel throw the specified [cause] exception.\n */"} {"signature":"public fun invokeOnClose ( handler : ( cause : Throwable ? ) -> Unit )","body":"public fun invokeOnClose ( handler : ( cause : Throwable ? ) -> Unit )","docstring":"/**\n * Registers a [handler] which is synchronously invoked once the channel is [closed][close]\n * or the receiving side of this channel is [cancelled][ReceiveChannel.cancel].\n * Only one handler can be attached to a channel during its lifetime.\n * The `handler` is invoked when [isClosedForSend] starts to return `true`.\n * If the channel is closed already, the handler is invoked immediately.\n *\n * The meaning of `cause` that is passed to the handler:\n * - `null` if the channel was closed normally without the corresponding argument.\n * - Instance of [CancellationException] if the channel was cancelled normally without the corresponding argument.\n * - The cause of `close` or `cancel` otherwise.\n *\n * ### Execution context and exception safety\n *\n * The [handler] is executed as part of the closing or cancelling operation, and only after the channel reaches its final state.\n * This means that if the handler throws an exception or hangs, the channel will still be successfully closed or cancelled.\n * Unhandled exceptions from [handler] are propagated to the closing or cancelling operation's caller.\n *\n * Example of usage:\n * ```\n * val events = Channel(UNLIMITED)\n * callbackBasedApi.registerCallback { event ->\n * events.trySend(event)\n * .onClosed { /* channel is already closed, but the callback hasn't stopped yet */ }\n * }\n *\n * val uiUpdater = uiScope.launch(Dispatchers.Main) {\n * events.consume { /* handle events */ }\n * }\n * // Stop the callback after the channel is closed or cancelled\n * events.invokeOnClose { callbackBasedApi.stop() }\n * ```\n *\n * **Stability note.** This function constitutes a stable API surface, with the only exception being\n * that an [IllegalStateException] is thrown when multiple handlers are registered.\n * This restriction could be lifted in the future.\n *\n * @throws UnsupportedOperationException if the underlying channel does not support [invokeOnClose].\n * Implementation note: currently, [invokeOnClose] is unsupported only by Rx-like integrations\n *\n * @throws IllegalStateException if another handler was already registered\n */"} {"signature":"@ Deprecated ( level = DeprecationLevel . ERROR , message = \"\" , replaceWith = ReplaceWith ( \"\" ) ) public fun offer ( element : E ) : Boolean","body":"{ val result = trySend ( element ) if ( result . isSuccess ) return true throw recoverStackTrace ( result . exceptionOrNull ( ) ? : return false ) }","docstring":"/**\n * **Deprecated** offer method.\n *\n * This method was deprecated in the favour of [trySend].\n * It has proven itself as the most error-prone method in Channel API:\n *\n * - `Boolean` return type creates the false sense of security, implying that `false`\n * is returned instead of throwing an exception.\n * - It was used mostly from non-suspending APIs where CancellationException triggered\n * internal failures in the application (the most common source of bugs).\n * - Due to signature and explicit `if (ch.offer(...))` checks it was easy to\n * oversee such error during code review.\n * - Its name was not aligned with the rest of the API and tried to mimic Java's queue instead.\n *\n * **NB** Automatic migration provides best-effort for the user experience, but requires removal\n * or adjusting of the code that relied on the exception handling.\n * The complete replacement has a more verbose form:\n * ```\n * channel.trySend(element)\n * .onClosed { throw it ?: ClosedSendChannelException(\"Channel was closed normally\") }\n * .isSuccess\n * ```\n *\n * See https://github.com/Kotlin/kotlinx.coroutines/issues/974 for more context.\n *\n * @suppress **Deprecated**.\n */"} {"signature":"public suspend fun receive ( ) : E","body":"public suspend fun receive ( ) : E","docstring":"/**\n * Retrieves and removes an element from this channel if it's not empty, or suspends the caller while the channel is empty,\n * or throws a [ClosedReceiveChannelException] if the channel [is closed for `receive`][isClosedForReceive].\n * If the channel was closed because of an exception, it is called a _failed_ channel and this function\n * will throw the original [close][SendChannel.close] cause exception.\n *\n * This suspending function is cancellable. If the [Job] of the current coroutine is cancelled while this\n * function is suspended, this function immediately resumes with a [CancellationException].\n * There is a **prompt cancellation guarantee**. If the job was cancelled while this function was\n * suspended, it will not resume successfully. The `receive` call can retrieve the element from the channel,\n * but then throw [CancellationException], thus failing to deliver the element.\n * See \"Undelivered elements\" section in [Channel] documentation for details on handling undelivered elements.\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 [receive] managed to retrieve the element from the channel,\n * but was cancelled while suspended, [CancellationException] will be thrown.\n * See [suspendCancellableCoroutine] for low-level details.\n *\n * Because of the prompt cancellation guarantee, some values retrieved from the channel can become lost.\n * See \"Undelivered elements\" section in [Channel] documentation for details on handling undelivered elements.\n *\n * Note that this function does not check for cancellation when it is not suspended.\n * Use [yield] or [CoroutineScope.isActive] to periodically check for cancellation in tight loops if needed.\n *\n * This function can be used in [select] invocations with the [onReceive] clause.\n * Use [tryReceive] to try receiving from this channel without waiting.\n */"} {"signature":"public suspend fun receiveCatching ( ) : ChannelResult < E >","body":"public suspend fun receiveCatching ( ) : ChannelResult < E >","docstring":"/**\n * Retrieves and removes an element from this channel if it's not empty, or suspends the caller while this channel is empty.\n * This method returns [ChannelResult] with the value of an element successfully retrieved from the channel\n * or the close cause if the channel was closed. Closed cause may be `null` if the channel was closed normally.\n * The result cannot be [failed][ChannelResult.isFailure] without being [closed][ChannelResult.isClosed].\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 [receiveCatching] managed to retrieve the element from the\n * channel, but was cancelled while suspended, [CancellationException] will be thrown.\n * See [suspendCancellableCoroutine] for low-level details.\n *\n * Because of the prompt cancellation guarantee, some values retrieved from the channel can become lost.\n * See \"Undelivered elements\" section in [Channel] documentation for details on handling undelivered elements.\n *\n * Note that this function does not check for cancellation when it is not suspended.\n * Use [yield] or [CoroutineScope.isActive] to periodically check for cancellation in tight loops if needed.\n *\n * This function can be used in [select] invocations with the [onReceiveCatching] clause.\n * Use [tryReceive] to try receiving from this channel without waiting.\n */"} {"signature":"public fun tryReceive ( ) : ChannelResult < E >","body":"public fun tryReceive ( ) : ChannelResult < E >","docstring":"/**\n * Retrieves and removes an element from this channel if it's not empty, returning a [successful][ChannelResult.success]\n * result, returns [failed][ChannelResult.failed] result if the channel is empty, and [closed][ChannelResult.closed]\n * result if the channel is closed.\n */"} {"signature":"public operator fun iterator ( ) : ChannelIterator < E >","body":"public operator fun iterator ( ) : ChannelIterator < E >","docstring":"/**\n * Returns a new iterator to receive elements from this channel using a `for` loop.\n * Iteration completes normally when the channel [is closed for `receive`][isClosedForReceive] without a cause and\n * throws the original [close][SendChannel.close] cause exception if the channel has _failed_.\n */"} {"signature":"public fun cancel ( cause : CancellationException ? = null )","body":"public fun cancel ( cause : CancellationException ? = null )","docstring":"/**\n * Cancels reception of remaining elements from this channel with an optional [cause].\n * This function closes the channel and removes all buffered sent elements from it.\n *\n * A cause can be used to specify an error message or to provide other details on\n * the cancellation reason for debugging purposes.\n * If the cause is not specified, then an instance of [CancellationException] with a\n * default message is created to [close][SendChannel.close] the channel.\n *\n * Immediately after invocation of this function [isClosedForReceive] and\n * [isClosedForSend][SendChannel.isClosedForSend]\n * on the side of [SendChannel] start returning `true`. Any attempt to send to or receive from this channel\n * will lead to a [CancellationException].\n */"} {"signature":"@ Deprecated ( level = DeprecationLevel . HIDDEN , message = \"\" ) public fun cancel ( ) : Unit","body":"= cancel ( null )","docstring":"/**\n * @suppress This method implements old version of JVM ABI. Use [cancel].\n */"} {"signature":"@ Deprecated ( level = DeprecationLevel . HIDDEN , message = \"\" ) public fun cancel ( cause : Throwable ? = null ) : Boolean","body":"@ Deprecated ( level = DeprecationLevel . HIDDEN , message = \"\" ) public fun cancel ( cause : Throwable ? = null ) : Boolean","docstring":"/**\n * @suppress This method has bad semantics when cause is not a [CancellationException]. Use [cancel].\n */"} {"signature":"@ Deprecated ( level = DeprecationLevel . ERROR , message = \"\" + \"\" + \"\" , replaceWith = ReplaceWith ( \"\" ) ) public fun poll ( ) : E ?","body":"{ val result = tryReceive ( ) if ( result . isSuccess ) return result . getOrThrow ( ) throw recoverStackTrace ( result . exceptionOrNull ( ) ? : return null ) }","docstring":"/**\n * **Deprecated** poll method.\n *\n * This method was deprecated in the favour of [tryReceive].\n * It has proven itself as error-prone method in Channel API:\n *\n * - Nullable return type creates the false sense of security, implying that `null`\n * is returned instead of throwing an exception.\n * - It was used mostly from non-suspending APIs where CancellationException triggered\n * internal failures in the application (the most common source of bugs).\n * - Its name was not aligned with the rest of the API and tried to mimic Java's queue instead.\n *\n * See https://github.com/Kotlin/kotlinx.coroutines/issues/974 for more context.\n *\n * ### Replacement note\n *\n * The replacement `tryReceive().getOrNull()` is a default that ignores all close exceptions and\n * proceeds with `null`, while `poll` throws an exception if the channel was closed with an exception.\n * Replacement with the very same 'poll' semantics is `tryReceive().onClosed { if (it != null) throw it }.getOrNull()`\n *\n * @suppress **Deprecated**.\n */"} {"signature":"@ Suppress ( \"\" , \"\" ) @ LowPriorityInOverloadResolution @ Deprecated ( message = \"\" + \"\" + \"\" , level = DeprecationLevel . ERROR , replaceWith = ReplaceWith ( \"\" ) ) public suspend fun receiveOrNull ( ) : E ?","body":"= receiveCatching ( ) . getOrNull ( )","docstring":"/**\n * This function was deprecated since 1.3.0 and is no longer recommended to use\n * or to implement in subclasses.\n *\n * It had the following pitfalls:\n * - Didn't allow to distinguish 'null' as \"closed channel\" from \"null as a value\"\n * - Was throwing if the channel has failed even though its signature may suggest it returns 'null'\n * - It didn't really belong to core channel API and can be exposed as an extension instead.\n *\n * ### Replacement note\n *\n * The replacement `receiveCatching().getOrNull()` is a safe default that ignores all close exceptions and\n * proceeds with `null`, while `receiveOrNull` throws an exception if the channel was closed with an exception.\n * Replacement with the very same `receiveOrNull` semantics is `receiveCatching().onClosed { if (it != null) throw it }.getOrNull()`.\n *\n * @suppress **Deprecated**\n */"} {"signature":"@ Suppress ( \"\" ) public fun getOrNull ( ) : T ?","body":"= if ( holder !is Failed ) holder as T else null","docstring":"/**\n * Returns the encapsulated value if this instance represents success or `null` if it represents failed result.\n */"} {"signature":"public fun getOrThrow ( ) : T","body":"{ @ Suppress ( \"\" ) if ( holder !is Failed ) return holder as T if ( holder is Closed && holder . cause != null ) throw holder . cause error ( \"\" ) }","docstring":"/**\n * Returns the encapsulated value if this instance represents success or throws an exception if it is closed or failed.\n */"} {"signature":"public fun exceptionOrNull ( ) : Throwable ?","body":"= ( holder as? Closed ) ? . cause","docstring":"/**\n * Returns the encapsulated exception if this instance represents failure or `null` if it is success\n * or unsuccessful operation to closed channel.\n */"} {"signature":"@ OptIn ( ExperimentalContracts :: class ) public inline fun < T > ChannelResult < T > . getOrElse ( onFailure : ( exception : Throwable ? ) -> T ) : T","body":"{ contract { callsInPlace ( onFailure , InvocationKind . AT_MOST_ONCE ) } @ Suppress ( \"\" ) return if ( holder is ChannelResult . Failed ) onFailure ( exceptionOrNull ( ) ) else holder as T }","docstring":"/**\n * Returns the encapsulated value if this instance represents [success][ChannelResult.isSuccess] or the\n * result of [onFailure] function for the encapsulated [Throwable] exception if it is failed or closed\n * result.\n */"} {"signature":"@ OptIn ( ExperimentalContracts :: class ) public inline fun < T > ChannelResult < T > . onSuccess ( action : ( value : T ) -> Unit ) : ChannelResult < T >","body":"{ contract { callsInPlace ( action , InvocationKind . AT_MOST_ONCE ) } @ Suppress ( \"\" ) if ( holder !is ChannelResult . Failed ) action ( holder as T ) return this }","docstring":"/**\n * Performs the given [action] on the encapsulated value if this instance represents [success][ChannelResult.isSuccess].\n * Returns the original `ChannelResult` unchanged.\n */"} {"signature":"@ OptIn ( ExperimentalContracts :: class ) public inline fun < T > ChannelResult < T > . onFailure ( action : ( exception : Throwable ? ) -> Unit ) : ChannelResult < T >","body":"{ contract { callsInPlace ( action , InvocationKind . AT_MOST_ONCE ) } if ( holder is ChannelResult . Failed ) action ( exceptionOrNull ( ) ) return this }","docstring":"/**\n * Performs the given [action] on the encapsulated [Throwable] exception if this instance represents [failure][ChannelResult.isFailure].\n * The result of [ChannelResult.exceptionOrNull] is passed to the [action] parameter.\n *\n * Returns the original `ChannelResult` unchanged.\n */"} {"signature":"@ OptIn ( ExperimentalContracts :: class ) public inline fun < T > ChannelResult < T > . onClosed ( action : ( exception : Throwable ? ) -> Unit ) : ChannelResult < T >","body":"{ contract { callsInPlace ( action , InvocationKind . AT_MOST_ONCE ) } if ( holder is ChannelResult . Closed ) action ( exceptionOrNull ( ) ) return this }","docstring":"/**\n * Performs the given [action] on the encapsulated [Throwable] exception if this instance represents [failure][ChannelResult.isFailure]\n * due to channel being [closed][Channel.close].\n * The result of [ChannelResult.exceptionOrNull] is passed to the [action] parameter.\n * It is guaranteed that if action is invoked, then the channel is either [closed for send][Channel.isClosedForSend]\n * or is [closed for receive][Channel.isClosedForReceive] depending on the failed operation.\n *\n * Returns the original `ChannelResult` unchanged.\n */"} {"signature":"public suspend operator fun hasNext ( ) : Boolean","body":"public suspend operator fun hasNext ( ) : Boolean","docstring":"/**\n * Returns `true` if the channel has more elements, suspending the caller while this channel is empty,\n * or returns `false` if the channel [is closed for `receive`][ReceiveChannel.isClosedForReceive] without a cause.\n * It throws the original [close][SendChannel.close] cause exception if the channel has _failed_.\n *\n * This function retrieves and removes an element from this channel for the subsequent invocation\n * of [next].\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 [hasNext] retrieves the element from the channel during\n * its operation, but was cancelled while suspended, [CancellationException] will be thrown.\n * See [suspendCancellableCoroutine] for low-level details.\n *\n * Because of the prompt cancellation guarantee, some values retrieved from the channel can become lost.\n * See \"Undelivered elements\" section in [Channel] documentation for details on handling undelivered elements.\n *\n * Note that this function does not check for cancellation when it is not suspended.\n * Use [yield] or [CoroutineScope.isActive] to periodically check for cancellation in tight loops if needed.\n */"} {"signature":"public operator fun next ( ) : E","body":"public operator fun next ( ) : E","docstring":"/**\n * Retrieves the element removed from the channel by a preceding call to [hasNext], or\n * throws an [IllegalStateException] if [hasNext] was not invoked.\n * This method should only be used in pair with [hasNext]:\n * ```\n * while (iterator.hasNext()) {\n * val element = iterator.next()\n * // ... handle element ...\n * }\n * ```\n *\n * This method throws a [ClosedReceiveChannelException] if the channel [is closed for `receive`][ReceiveChannel.isClosedForReceive] without a cause.\n * It throws the original [close][SendChannel.close] cause exception if the channel has _failed_.\n */"} {"signature":"public fun < E > Channel ( capacity : Int = RENDEZVOUS , onBufferOverflow : BufferOverflow = BufferOverflow . SUSPEND , onUndeliveredElement : ( ( E ) -> Unit ) ? = null ) : Channel < E >","body":"= when ( capacity ) { RENDEZVOUS -> { if ( onBufferOverflow == BufferOverflow . SUSPEND ) BufferedChannel ( RENDEZVOUS , onUndeliveredElement ) else ConflatedBufferedChannel ( , onBufferOverflow , onUndeliveredElement ) } CONFLATED -> { require ( onBufferOverflow == BufferOverflow . SUSPEND ) { \"\" } ConflatedBufferedChannel ( , BufferOverflow . DROP_OLDEST , onUndeliveredElement ) } UNLIMITED -> BufferedChannel ( UNLIMITED , onUndeliveredElement ) BUFFERED -> { if ( onBufferOverflow == BufferOverflow . SUSPEND ) BufferedChannel ( CHANNEL_DEFAULT_CAPACITY , onUndeliveredElement ) else ConflatedBufferedChannel ( , onBufferOverflow , onUndeliveredElement ) } else -> { if ( onBufferOverflow === BufferOverflow . SUSPEND ) BufferedChannel ( capacity , onUndeliveredElement ) else ConflatedBufferedChannel ( capacity , onBufferOverflow , onUndeliveredElement ) } }","docstring":"/**\n * Creates a channel with the specified buffer capacity (or without a buffer by default).\n * See [Channel] interface documentation for details.\n *\n * @param capacity either a positive channel capacity or one of the constants defined in [Channel.Factory].\n * @param onBufferOverflow configures an action on buffer overflow (optional, defaults to\n * a [suspending][BufferOverflow.SUSPEND] attempt to [send][Channel.send] a value,\n * supported only when `capacity >= 0` or `capacity == Channel.BUFFERED`,\n * implicitly creates a channel with at least one buffered element).\n * @param onUndeliveredElement an optional function that is called when element was sent but was not delivered to the consumer.\n * See \"Undelivered elements\" section in [Channel] documentation.\n * @throws IllegalArgumentException when [capacity] < -2\n */"} {"signature":"public fun < T > rxMaybe ( context : CoroutineContext = EmptyCoroutineContext , block : suspend CoroutineScope . ( ) -> T ? ) : Maybe < T >","body":"{ require ( context [ Job ] === null ) { \"\" + \"\" } return rxMaybeInternal ( GlobalScope , context , block ) }","docstring":"/**\n * Creates cold [maybe][Maybe] that will run a given [block] in a coroutine and emits its result.\n * If [block] result is `null`, [onComplete][MaybeObserver.onComplete] is invoked without a value.\n * Every time the returned observable is subscribed, it starts a new coroutine.\n * Unsubscribing cancels running coroutine.\n * Coroutine context can be specified with [context] argument.\n * If the context does not have any dispatcher nor any other [ContinuationInterceptor], then [Dispatchers.Default] is used.\n * Method throws [IllegalArgumentException] if provided [context] contains a [Job] instance.\n */"} {"signature":"@ Deprecated ( message = \"\" , level = DeprecationLevel . HIDDEN , replaceWith = ReplaceWith ( \"\" ) ) public fun < T > CoroutineScope . rxMaybe ( context : CoroutineContext = EmptyCoroutineContext , block : suspend CoroutineScope . ( ) -> T ? ) : Maybe < T >","body":"= rxMaybeInternal ( this , context , block )","docstring":"/** @suppress */"} {"signature":"fun EditText . afterTextChanged ( afterTextChanged : ( String ) -> Unit )","body":"{ this . addTextChangedListener ( object : TextWatcher { override fun afterTextChanged ( editable : Editable ? ) { afterTextChanged . invoke ( editable . toString ( ) ) } override fun beforeTextChanged ( s : CharSequence , start : Int , count : Int , after : Int ) { } override fun onTextChanged ( s : CharSequence , start : Int , before : Int , count : Int ) { } } ) }","docstring":"/**\n * Extension function to simplify setting an afterTextChanged action to EditText components.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . internal . InlineOnly public inline fun < K , V , R : Any > Map < out K , V > . firstNotNullOf ( transform : ( Map . Entry < K , V > ) -> R ? ) : R","body":"{ return firstNotNullOfOrNull ( transform ) ? : throw NoSuchElementException ( \"\" ) }","docstring":"/**\n * Returns the first non-null value produced by [transform] function being applied to entries of this map 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 < K , V , R : Any > Map < out K , V > . firstNotNullOfOrNull ( transform : ( Map . Entry < K , V > ) -> 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 entries of this map 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 < K , V > Map < out K , V > . toList ( ) : List < Pair < K , V > >","body":"{ if ( size == ) return emptyList ( ) val iterator = entries . iterator ( ) if ( ! iterator . hasNext ( ) ) return emptyList ( ) val first = iterator . next ( ) if ( ! iterator . hasNext ( ) ) return listOf ( first . toPair ( ) ) val result = ArrayList < Pair < K , V > > ( size ) result . add ( first . toPair ( ) ) do { result . add ( iterator . next ( ) . toPair ( ) ) } while ( iterator . hasNext ( ) ) return result }","docstring":"/**\n * Returns a [List] containing all key-value pairs.\n */"} {"signature":"public inline fun < K , V , R > Map < out K , V > . flatMap ( transform : ( Map . Entry < K , V > ) -> 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 entry of original map.\n * \n * @sample samples.collections.Maps.Transformations.flatMap\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ OptIn ( kotlin . experimental . ExperimentalTypeInference :: class ) @ OverloadResolutionByLambdaReturnType @ kotlin . jvm . JvmName ( \"\" ) public inline fun < K , V , R > Map < out K , V > . flatMap ( transform : ( Map . Entry < K , V > ) -> 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 entry of original map.\n * \n * @sample samples.collections.Collections.Transformations.flatMap\n */"} {"signature":"public inline fun < K , V , R , C : MutableCollection < in R > > Map < out K , V > . flatMapTo ( destination : C , transform : ( Map . Entry < K , V > ) -> 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 entry of original map, to the given [destination].\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ OptIn ( kotlin . experimental . ExperimentalTypeInference :: class ) @ OverloadResolutionByLambdaReturnType @ kotlin . jvm . JvmName ( \"\" ) public inline fun < K , V , R , C : MutableCollection < in R > > Map < out K , V > . flatMapTo ( destination : C , transform : ( Map . Entry < K , V > ) -> 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 entry of original map, to the given [destination].\n */"} {"signature":"public inline fun < K , V , R > Map < out K , V > . map ( transform : ( Map . Entry < K , V > ) -> R ) : List < R >","body":"{ return mapTo ( ArrayList < R > ( size ) , transform ) }","docstring":"/**\n * Returns a list containing the results of applying the given [transform] function\n * to each entry in the original map.\n * \n * @sample samples.collections.Maps.Transformations.mapToList\n */"} {"signature":"public inline fun < K , V , R : Any > Map < out K , V > . mapNotNull ( transform : ( Map . Entry < K , V > ) -> 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 entry in the original map.\n * \n * @sample samples.collections.Maps.Transformations.mapNotNull\n */"} {"signature":"public inline fun < K , V , R : Any , C : MutableCollection < in R > > Map < out K , V > . mapNotNullTo ( destination : C , transform : ( Map . Entry < K , V > ) -> R ? ) : C","body":"{ forEach { element -> transform ( element ) ? . let { destination . add ( it ) } } return destination }","docstring":"/**\n * Applies the given [transform] function to each entry in the original map\n * and appends only the non-null results to the given [destination].\n */"} {"signature":"public inline fun < K , V , R , C : MutableCollection < in R > > Map < out K , V > . mapTo ( destination : C , transform : ( Map . Entry < K , V > ) -> R ) : C","body":"{ for ( item in this ) destination . add ( transform ( item ) ) return destination }","docstring":"/**\n * Applies the given [transform] function to each entry of the original map\n * and appends the results to the given [destination].\n */"} {"signature":"public inline fun < K , V > Map < out K , V > . all ( predicate : ( Map . Entry < K , V > ) -> Boolean ) : Boolean","body":"{ if ( isEmpty ( ) ) return true for ( element in this ) if ( ! predicate ( element ) ) return false return true }","docstring":"/**\n * Returns `true` if all entries match the given [predicate].\n * \n * Note that if the map contains no entries, the function returns `true`\n * because there are no entries 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 < K , V > Map < out K , V > . any ( ) : Boolean","body":"{ return ! isEmpty ( ) }","docstring":"/**\n * Returns `true` if map has at least one entry.\n * \n * @sample samples.collections.Collections.Aggregates.any\n */"} {"signature":"public inline fun < K , V > Map < out K , V > . any ( predicate : ( Map . Entry < K , V > ) -> Boolean ) : Boolean","body":"{ if ( isEmpty ( ) ) return false for ( element in this ) if ( predicate ( element ) ) return true return false }","docstring":"/**\n * Returns `true` if at least one entry matches the given [predicate].\n * \n * @sample samples.collections.Collections.Aggregates.anyWithPredicate\n */"} {"signature":"@ kotlin . internal . InlineOnly public inline fun < K , V > Map < out K , V > . count ( ) : Int","body":"{ return size }","docstring":"/**\n * Returns the number of entries in this map.\n */"} {"signature":"public inline fun < K , V > Map < out K , V > . count ( predicate : ( Map . Entry < K , V > ) -> Boolean ) : Int","body":"{ if ( isEmpty ( ) ) return var count = for ( element in this ) if ( predicate ( element ) ) ++ count return count }","docstring":"/**\n * Returns the number of entries matching the given [predicate].\n */"} {"signature":"@ kotlin . internal . HidesMembers public inline fun < K , V > Map < out K , V > . forEach ( action : ( Map . Entry < K , V > ) -> Unit ) : Unit","body":"{ for ( element in this ) action ( element ) }","docstring":"/**\n * Performs the given [action] on each entry.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . jvm . JvmName ( \"\" ) @ kotlin . internal . InlineOnly @ Suppress ( \"\" ) public inline fun < K , V , R : Comparable < R > > Map < out K , V > . maxBy ( selector : ( Map . Entry < K , V > ) -> R ) : Map . Entry < K , V >","body":"{ return entries . maxBy ( selector ) }","docstring":"/**\n * Returns the first entry yielding the largest value of the given function.\n * \n * @throws NoSuchElementException if the map is empty.\n * \n * @sample samples.collections.Collections.Aggregates.maxBy\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . internal . InlineOnly public inline fun < K , V , R : Comparable < R > > Map < out K , V > . maxByOrNull ( selector : ( Map . Entry < K , V > ) -> R ) : Map . Entry < K , V > ?","body":"{ return entries . maxByOrNull ( selector ) }","docstring":"/**\n * Returns the first entry yielding the largest value of the given function or `null` if there are no entries.\n * \n * @sample samples.collections.Collections.Aggregates.maxByOrNull\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ OptIn ( kotlin . experimental . ExperimentalTypeInference :: class ) @ OverloadResolutionByLambdaReturnType @ kotlin . internal . InlineOnly public inline fun < K , V > Map < out K , V > . maxOf ( selector : ( Map . Entry < K , V > ) -> Double ) : Double","body":"{ return entries . maxOf ( selector ) }","docstring":"/**\n * Returns the largest value among all values produced by [selector] function\n * applied to each entry in the map.\n * \n * If any of values produced by [selector] function is `NaN`, the returned result is `NaN`.\n * \n * @throws NoSuchElementException if the map is empty.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ OptIn ( kotlin . experimental . ExperimentalTypeInference :: class ) @ OverloadResolutionByLambdaReturnType @ kotlin . internal . InlineOnly public inline fun < K , V > Map < out K , V > . maxOf ( selector : ( Map . Entry < K , V > ) -> Float ) : Float","body":"{ return entries . maxOf ( selector ) }","docstring":"/**\n * Returns the largest value among all values produced by [selector] function\n * applied to each entry in the map.\n * \n * If any of values produced by [selector] function is `NaN`, the returned result is `NaN`.\n * \n * @throws NoSuchElementException if the map is empty.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ OptIn ( kotlin . experimental . ExperimentalTypeInference :: class ) @ OverloadResolutionByLambdaReturnType @ kotlin . internal . InlineOnly public inline fun < K , V , R : Comparable < R > > Map < out K , V > . maxOf ( selector : ( Map . Entry < K , V > ) -> R ) : R","body":"{ return entries . maxOf ( selector ) }","docstring":"/**\n * Returns the largest value among all values produced by [selector] function\n * applied to each entry in the map.\n * \n * @throws NoSuchElementException if the map is empty.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ OptIn ( kotlin . experimental . ExperimentalTypeInference :: class ) @ OverloadResolutionByLambdaReturnType @ kotlin . internal . InlineOnly public inline fun < K , V > Map < out K , V > . maxOfOrNull ( selector : ( Map . Entry < K , V > ) -> Double ) : Double ?","body":"{ return entries . maxOfOrNull ( selector ) }","docstring":"/**\n * Returns the largest value among all values produced by [selector] function\n * applied to each entry in the map or `null` if there are no entries.\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 < K , V > Map < out K , V > . maxOfOrNull ( selector : ( Map . Entry < K , V > ) -> Float ) : Float ?","body":"{ return entries . maxOfOrNull ( selector ) }","docstring":"/**\n * Returns the largest value among all values produced by [selector] function\n * applied to each entry in the map or `null` if there are no entries.\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 < K , V , R : Comparable < R > > Map < out K , V > . maxOfOrNull ( selector : ( Map . Entry < K , V > ) -> R ) : R ?","body":"{ return entries . maxOfOrNull ( selector ) }","docstring":"/**\n * Returns the largest value among all values produced by [selector] function\n * applied to each entry in the map or `null` if there are no entries.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ OptIn ( kotlin . experimental . ExperimentalTypeInference :: class ) @ OverloadResolutionByLambdaReturnType @ kotlin . internal . InlineOnly public inline fun < K , V , R > Map < out K , V > . maxOfWith ( comparator : Comparator < in R > , selector : ( Map . Entry < K , V > ) -> R ) : R","body":"{ return entries . maxOfWith ( comparator , selector ) }","docstring":"/**\n * Returns the largest value according to the provided [comparator]\n * among all values produced by [selector] function applied to each entry in the map.\n * \n * @throws NoSuchElementException if the map is empty.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ OptIn ( kotlin . experimental . ExperimentalTypeInference :: class ) @ OverloadResolutionByLambdaReturnType @ kotlin . internal . InlineOnly public inline fun < K , V , R > Map < out K , V > . maxOfWithOrNull ( comparator : Comparator < in R > , selector : ( Map . Entry < K , V > ) -> R ) : R ?","body":"{ return entries . maxOfWithOrNull ( comparator , selector ) }","docstring":"/**\n * Returns the largest value according to the provided [comparator]\n * among all values produced by [selector] function applied to each entry in the map or `null` if there are no entries.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . jvm . JvmName ( \"\" ) @ kotlin . internal . InlineOnly @ Suppress ( \"\" ) public inline fun < K , V > Map < out K , V > . maxWith ( comparator : Comparator < in Map . Entry < K , V > > ) : Map . Entry < K , V >","body":"{ return entries . maxWith ( comparator ) }","docstring":"/**\n * Returns the first entry having the largest value according to the provided [comparator].\n * \n * @throws NoSuchElementException if the map is empty.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . internal . InlineOnly public inline fun < K , V > Map < out K , V > . maxWithOrNull ( comparator : Comparator < in Map . Entry < K , V > > ) : Map . Entry < K , V > ?","body":"{ return entries . maxWithOrNull ( comparator ) }","docstring":"/**\n * Returns the first entry having the largest value according to the provided [comparator] or `null` if there are no entries.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . jvm . JvmName ( \"\" ) @ kotlin . internal . InlineOnly @ Suppress ( \"\" ) public inline fun < K , V , R : Comparable < R > > Map < out K , V > . minBy ( selector : ( Map . Entry < K , V > ) -> R ) : Map . Entry < K , V >","body":"{ return entries . minBy ( selector ) }","docstring":"/**\n * Returns the first entry yielding the smallest value of the given function.\n * \n * @throws NoSuchElementException if the map is empty.\n * \n * @sample samples.collections.Collections.Aggregates.minBy\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . internal . InlineOnly public inline fun < K , V , R : Comparable < R > > Map < out K , V > . minByOrNull ( selector : ( Map . Entry < K , V > ) -> R ) : Map . Entry < K , V > ?","body":"{ return entries . minByOrNull ( selector ) }","docstring":"/**\n * Returns the first entry yielding the smallest value of the given function or `null` if there are no entries.\n * \n * @sample samples.collections.Collections.Aggregates.minByOrNull\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ OptIn ( kotlin . experimental . ExperimentalTypeInference :: class ) @ OverloadResolutionByLambdaReturnType @ kotlin . internal . InlineOnly public inline fun < K , V > Map < out K , V > . minOf ( selector : ( Map . Entry < K , V > ) -> Double ) : Double","body":"{ return entries . minOf ( selector ) }","docstring":"/**\n * Returns the smallest value among all values produced by [selector] function\n * applied to each entry in the map.\n * \n * If any of values produced by [selector] function is `NaN`, the returned result is `NaN`.\n * \n * @throws NoSuchElementException if the map is empty.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ OptIn ( kotlin . experimental . ExperimentalTypeInference :: class ) @ OverloadResolutionByLambdaReturnType @ kotlin . internal . InlineOnly public inline fun < K , V > Map < out K , V > . minOf ( selector : ( Map . Entry < K , V > ) -> Float ) : Float","body":"{ return entries . minOf ( selector ) }","docstring":"/**\n * Returns the smallest value among all values produced by [selector] function\n * applied to each entry in the map.\n * \n * If any of values produced by [selector] function is `NaN`, the returned result is `NaN`.\n * \n * @throws NoSuchElementException if the map is empty.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ OptIn ( kotlin . experimental . ExperimentalTypeInference :: class ) @ OverloadResolutionByLambdaReturnType @ kotlin . internal . InlineOnly public inline fun < K , V , R : Comparable < R > > Map < out K , V > . minOf ( selector : ( Map . Entry < K , V > ) -> R ) : R","body":"{ return entries . minOf ( selector ) }","docstring":"/**\n * Returns the smallest value among all values produced by [selector] function\n * applied to each entry in the map.\n * \n * @throws NoSuchElementException if the map is empty.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ OptIn ( kotlin . experimental . ExperimentalTypeInference :: class ) @ OverloadResolutionByLambdaReturnType @ kotlin . internal . InlineOnly public inline fun < K , V > Map < out K , V > . minOfOrNull ( selector : ( Map . Entry < K , V > ) -> Double ) : Double ?","body":"{ return entries . minOfOrNull ( selector ) }","docstring":"/**\n * Returns the smallest value among all values produced by [selector] function\n * applied to each entry in the map or `null` if there are no entries.\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 < K , V > Map < out K , V > . minOfOrNull ( selector : ( Map . Entry < K , V > ) -> Float ) : Float ?","body":"{ return entries . minOfOrNull ( selector ) }","docstring":"/**\n * Returns the smallest value among all values produced by [selector] function\n * applied to each entry in the map or `null` if there are no entries.\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 < K , V , R : Comparable < R > > Map < out K , V > . minOfOrNull ( selector : ( Map . Entry < K , V > ) -> R ) : R ?","body":"{ return entries . minOfOrNull ( selector ) }","docstring":"/**\n * Returns the smallest value among all values produced by [selector] function\n * applied to each entry in the map or `null` if there are no entries.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ OptIn ( kotlin . experimental . ExperimentalTypeInference :: class ) @ OverloadResolutionByLambdaReturnType @ kotlin . internal . InlineOnly public inline fun < K , V , R > Map < out K , V > . minOfWith ( comparator : Comparator < in R > , selector : ( Map . Entry < K , V > ) -> R ) : R","body":"{ return entries . minOfWith ( comparator , selector ) }","docstring":"/**\n * Returns the smallest value according to the provided [comparator]\n * among all values produced by [selector] function applied to each entry in the map.\n * \n * @throws NoSuchElementException if the map is empty.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ OptIn ( kotlin . experimental . ExperimentalTypeInference :: class ) @ OverloadResolutionByLambdaReturnType @ kotlin . internal . InlineOnly public inline fun < K , V , R > Map < out K , V > . minOfWithOrNull ( comparator : Comparator < in R > , selector : ( Map . Entry < K , V > ) -> R ) : R ?","body":"{ return entries . minOfWithOrNull ( comparator , selector ) }","docstring":"/**\n * Returns the smallest value according to the provided [comparator]\n * among all values produced by [selector] function applied to each entry in the map or `null` if there are no entries.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . jvm . JvmName ( \"\" ) @ kotlin . internal . InlineOnly @ Suppress ( \"\" ) public inline fun < K , V > Map < out K , V > . minWith ( comparator : Comparator < in Map . Entry < K , V > > ) : Map . Entry < K , V >","body":"{ return entries . minWith ( comparator ) }","docstring":"/**\n * Returns the first entry having the smallest value according to the provided [comparator].\n * \n * @throws NoSuchElementException if the map is empty.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . internal . InlineOnly public inline fun < K , V > Map < out K , V > . minWithOrNull ( comparator : Comparator < in Map . Entry < K , V > > ) : Map . Entry < K , V > ?","body":"{ return entries . minWithOrNull ( comparator ) }","docstring":"/**\n * Returns the first entry having the smallest value according to the provided [comparator] or `null` if there are no entries.\n */"} {"signature":"public fun < K , V > Map < out K , V > . none ( ) : Boolean","body":"{ return isEmpty ( ) }","docstring":"/**\n * Returns `true` if the map has no entries.\n * \n * @sample samples.collections.Collections.Aggregates.none\n */"} {"signature":"public inline fun < K , V > Map < out K , V > . none ( predicate : ( Map . Entry < K , V > ) -> Boolean ) : Boolean","body":"{ if ( isEmpty ( ) ) return true for ( element in this ) if ( predicate ( element ) ) return false return true }","docstring":"/**\n * Returns `true` if no entries match the given [predicate].\n * \n * @sample samples.collections.Collections.Aggregates.noneWithPredicate\n */"} {"signature":"@ SinceKotlin ( \"\" ) public inline fun < K , V , M : Map < out K , V > > M . onEach ( action : ( Map . Entry < K , V > ) -> Unit ) : M","body":"{ return apply { for ( element in this ) action ( element ) } }","docstring":"/**\n * Performs the given [action] on each entry and returns the map itself afterwards.\n */"} {"signature":"@ SinceKotlin ( \"\" ) public inline fun < K , V , M : Map < out K , V > > M . onEachIndexed ( action : ( index : Int , Map . Entry < K , V > ) -> Unit ) : M","body":"{ return apply { entries . forEachIndexed ( action ) } }","docstring":"/**\n * Performs the given [action] on each entry, providing sequential index with the entry,\n * and returns the map itself afterwards.\n * @param [action] function that takes the index of an entry and the entry itself\n * and performs the action on the entry.\n */"} {"signature":"@ kotlin . internal . InlineOnly public inline fun < K , V > Map < out K , V > . asIterable ( ) : Iterable < Map . Entry < K , V > >","body":"{ return entries }","docstring":"/**\n * Creates an [Iterable] instance that wraps the original map returning its entries when being iterated.\n */"} {"signature":"public fun < K , V > Map < out K , V > . asSequence ( ) : Sequence < Map . Entry < K , V > >","body":"{ return entries . asSequence ( ) }","docstring":"/**\n * Creates a [Sequence] instance that wraps the original map returning its entries when being iterated.\n * \n * @sample samples.collections.Sequences.Building.sequenceFromMap\n */"} {"signature":"fun clearExtras ( )","body":"{ _builder . clearExtras ( ) }","docstring":"/**\n * optional .org.jetbrains.kotlin.gradle.idea.proto.generated.IdeaExtrasProto extras = 1;\n */"} {"signature":"fun hasExtras ( ) : kotlin . Boolean","body":"{ return _builder . hasExtras ( ) }","docstring":"/**\n * optional .org.jetbrains.kotlin.gradle.idea.proto.generated.IdeaExtrasProto extras = 1;\n * @return Whether the extras field is set.\n */"} {"signature":"fun clearCoordinates ( )","body":"{ _builder . clearCoordinates ( ) }","docstring":"/**\n * optional .org.jetbrains.kotlin.gradle.idea.proto.generated.tcs.IdeaKotlinBinaryCoordinatesProto coordinates = 2;\n */"} {"signature":"fun hasCoordinates ( ) : kotlin . Boolean","body":"{ return _builder . hasCoordinates ( ) }","docstring":"/**\n * optional .org.jetbrains.kotlin.gradle.idea.proto.generated.tcs.IdeaKotlinBinaryCoordinatesProto coordinates = 2;\n * @return Whether the coordinates field is set.\n */"} {"signature":"fun clearBinaryType ( )","body":"{ _builder . clearBinaryType ( ) }","docstring":"/**\n * optional string binary_type = 3;\n */"} {"signature":"fun hasBinaryType ( ) : kotlin . Boolean","body":"{ return _builder . hasBinaryType ( ) }","docstring":"/**\n * optional string binary_type = 3;\n * @return Whether the binaryType field is set.\n */"} {"signature":"fun clearClasspath ( )","body":"{ _builder . clearClasspath ( ) }","docstring":"/**\n * optional .org.jetbrains.kotlin.gradle.idea.proto.generated.tcs.IdeaKotlinClasspathProto classpath = 4;\n */"} {"signature":"fun hasClasspath ( ) : kotlin . Boolean","body":"{ return _builder . hasClasspath ( ) }","docstring":"/**\n * optional .org.jetbrains.kotlin.gradle.idea.proto.generated.tcs.IdeaKotlinClasspathProto classpath = 4;\n * @return Whether the classpath field is set.\n */"} {"signature":"suspend fun syncMutedTestsOnTeamCityWithDatabase ( )","body":"{ val remotelyMutedTests = RemotelyMutedTests ( ) val locallyMutedTests = LocallyMutedTests ( ) syncMutedTests ( remotelyMutedTests . projectTests , locallyMutedTests . projectTests ) }","docstring":"/**\n * Synchronize muted tests on teamcity with flaky tests in database\n *\n * Purpose: possibility to run flaky tests on teamcity that will not affect on build status\n */"} {"signature":"override fun shouldSkipValidityCheck ( session : KtAnalysisSession ) : Boolean","body":"= when ( modificationEventKind ) { ModificationEventKind . GLOBAL_SOURCE_MODULE_STATE_MODIFICATION , ModificationEventKind . GLOBAL_SOURCE_OUT_OF_BLOCK_MODIFICATION -> { session . useSiteModule is KtBinaryModule || session . useSiteModule is KtLibrarySourceModule } else -> false }","docstring":"/**\n * The analysis session cache disregards whether libraries were invalidated during global invalidation, so some valid library analysis\n * sessions may have been evicted from the cache and should not be checked for validity.\n */"} {"signature":"@ ExperimentalSerializationApi public fun ProtoBuf ( from : ProtoBuf = ProtoBuf , builderAction : ProtoBufBuilder . ( ) -> Unit ) : ProtoBuf","body":"{ val b = ProtoBufBuilder ( from ) b . builderAction ( ) return ProtoBufImpl ( b . encodeDefaults , b . serializersModule ) }","docstring":"/**\n * Creates an instance of [ProtoBuf] configured from the optionally given [ProtoBuf instance][from]\n * and adjusted with [builderAction].\n */"} {"signature":"inline fun < T , R > Collection < T > . memoryOptimizedMap ( transform : ( T ) -> R ) : List < R >","body":"{ return mapTo ( ArrayList < R > ( size ) , transform ) . compactIfPossible ( ) }","docstring":"/**\n * A memory-optimized version of [Iterable.map].\n * @see Iterable.map\n */"} {"signature":"inline fun < T , R > Collection < T > . memoryOptimizedMapIndexed ( transform : ( index : Int , T ) -> R ) : List < R >","body":"{ return mapIndexedTo ( ArrayList < R > ( size ) , transform ) . compactIfPossible ( ) }","docstring":"/**\n * A memory-optimized version of [Iterable.mapIndexed].\n * @see Iterable.mapIndexed\n */"} {"signature":"inline fun < T , R : Any > Collection < T > . memoryOptimizedMapNotNull ( transform : ( T ) -> R ? ) : List < R >","body":"{ return mapNotNullTo ( ArrayList ( ) , transform ) . compactIfPossible ( ) }","docstring":"/**\n * A memory-optimized version of [Iterable.mapNotNull].\n * @see Iterable.mapNotNull\n */"} {"signature":"inline fun < T , R > Collection < T > . memoryOptimizedFlatMap ( transform : ( T ) -> Iterable < R > ) : List < R >","body":"{ return flatMapTo ( ArrayList < R > ( ) , transform ) . compactIfPossible ( ) }","docstring":"/**\n * A memory-optimized version of [Iterable.flatMap].\n * @see Iterable.flatMap\n */"} {"signature":"inline fun < T > Collection < T > . memoryOptimizedFilter ( predicate : ( T ) -> Boolean ) : List < T >","body":"{ return filterTo ( ArrayList ( ) , predicate ) . compactIfPossible ( ) }","docstring":"/**\n * A memory-optimized version of [Iterable.filter].\n * @see Iterable.filter\n */"} {"signature":"inline fun < T > Collection < T > . memoryOptimizedFilterNot ( predicate : ( T ) -> Boolean ) : List < T >","body":"{ return filterNotTo ( ArrayList ( ) , predicate ) . compactIfPossible ( ) }","docstring":"/**\n * A memory-optimized version of [Iterable.filterNot].\n * @see Iterable.filterNot\n */"} {"signature":"inline fun < reified T > Collection < * > . memoryOptimizedFilterIsInstance ( ) : List < T >","body":"{ return filterIsInstanceTo ( ArrayList < T > ( ) ) . compactIfPossible ( ) }","docstring":"/**\n * A memory-optimized version of [Iterable.filterIsInstance].\n * @see Iterable.filterIsInstance\n */"} {"signature":"infix fun < T > List < T > . memoryOptimizedPlus ( elements : List < T > ) : List < T >","body":"= when ( val resultSize = size + elements . size ) { -> emptyList ( ) -> Collections . singletonList ( if ( isEmpty ( ) ) elements . first ( ) else first ( ) ) else -> ArrayList < T > ( resultSize ) . also { it . addAll ( this ) it . addAll ( elements ) } }","docstring":"/**\n * A memory-optimized version of [Iterable.plus].\n * @see Iterable.plus\n */"} {"signature":"infix fun < T > List < T > . memoryOptimizedPlus ( element : T ) : List < T >","body":"= when ( size ) { -> Collections . singletonList ( element ) else -> ArrayList < T > ( size + ) . also { it . addAll ( this ) it . add ( element ) } }","docstring":"/**\n * A memory-optimized version of [Iterable.plus].\n * @see Iterable.plus\n */"} {"signature":"infix fun < T , R > Collection < T > . memoryOptimizedZip ( other : Collection < R > ) : List < Pair < T , R > >","body":"{ return when { isEmpty ( ) || other . isEmpty ( ) -> emptyList ( ) min ( size , other . size ) == -> listOf ( first ( ) to other . first ( ) ) else -> zip ( other ) { t1 , t2 -> t1 to t2 } } }","docstring":"/**\n * A memory-optimized version of [Iterable.zip].\n * @see Iterable.zip\n */"} {"signature":"fun < T > Sequence < T > . atMostOne ( ) : T ?","body":"{ val iterator = iterator ( ) if ( ! iterator . hasNext ( ) ) return null val single = iterator . next ( ) if ( iterator . hasNext ( ) ) { throw IllegalArgumentException ( \"\" ) } return single }","docstring":"/**\n * [Sequence] variant of [org.jetbrains.kotlin.utils.atMostOne]\n *\n * So, when:\n * - there is no element then `null` will be returned\n * - there is a single element then the element will be returned\n * - there is more than one element then the error will be thrown\n * @see org.jetbrains.kotlin.utils.atMostOne\n */"} {"signature":"inline fun < reified T > Iterable < * > . findIsInstanceAnd ( predicate : ( T ) -> Boolean ) : T ?","body":"{ for ( element in this ) { if ( element is T && predicate ( element ) ) { return element } } return null }","docstring":"/**\n * The variant of [org.jetbrains.kotlin.util.collectionUtils.filterIsInstanceAnd] extension function but to find the first element\n * which is an instance of type [T] and satisfies [predicate] condition\n * @see org.jetbrains.kotlin.util.collectionUtils.filterIsInstanceAnd\n */"} {"signature":"fun < T > Collection < T > . toSmartList ( ) : List < T >","body":"= SmartList < T > ( this )","docstring":"/**\n * The same as [Collection.toMutableList] extension function, but it returns a SmartList which is better with in sense of memory consumption\n * @see Collection.toMutableList\n */"} {"signature":"@ OptIn ( FrontendInternals :: class ) fun ResolutionFacade . getLanguageVersionSettings ( ) : LanguageVersionSettings","body":"= frontendService < LanguageVersionSettings > ( )","docstring":"/**\n * Helper methods for commonly used frontend components.\n * Use them to avoid explicit opt-ins.\n * Before adding a new helper method please make sure component doesn't have fragile invariants that can be violated by external use.\n */"} {"signature":"@ ExperimentalStdlibApi @ SinceKotlin ( \"\" ) public fun ByteArray . toHexString ( format : HexFormat = HexFormat . Default ) : String","body":"= toHexString ( , size , format )","docstring":"/**\n * Formats bytes in this array using the specified [format].\n *\n * Note that only [HexFormat.upperCase] and [HexFormat.BytesHexFormat] affect formatting.\n *\n * @param format the [HexFormat] to use for formatting, [HexFormat.Default] by default.\n *\n * @throws IllegalArgumentException if the result length is more than [String] maximum capacity.\n */"} {"signature":"@ ExperimentalStdlibApi @ SinceKotlin ( \"\" ) public fun ByteArray . toHexString ( startIndex : Int = , endIndex : Int = size , format : HexFormat = HexFormat . Default ) : String","body":"{ AbstractList . checkBoundsIndexes ( startIndex , endIndex , size ) if ( startIndex == endIndex ) { return \"\" } val byteToDigits = if ( format . upperCase ) BYTE_TO_UPPER_CASE_HEX_DIGITS else BYTE_TO_LOWER_CASE_HEX_DIGITS val bytesFormat = format . bytes if ( bytesFormat . noLineAndGroupSeparator ) { return toHexStringNoLineAndGroupSeparator ( startIndex , endIndex , bytesFormat , byteToDigits ) } return toHexStringSlowPath ( startIndex , endIndex , bytesFormat , byteToDigits ) }","docstring":"/**\n * Formats bytes in this array using the specified [HexFormat].\n *\n * Note that only [HexFormat.upperCase] and [HexFormat.BytesHexFormat] affect formatting.\n *\n * @param startIndex the beginning (inclusive) of the subrange to format, 0 by default.\n * @param endIndex the end (exclusive) of the subrange to format, size of this array by default.\n * @param format the [HexFormat] to use for formatting, [HexFormat.Default] by default.\n *\n * @throws IndexOutOfBoundsException when [startIndex] or [endIndex] is out of range of this array indices.\n * @throws IllegalArgumentException when `startIndex > endIndex`.\n * @throws IllegalArgumentException if the result length is more than [String] maximum capacity.\n */"} {"signature":"@ ExperimentalStdlibApi @ SinceKotlin ( \"\" ) public fun String . hexToByteArray ( format : HexFormat = HexFormat . Default ) : ByteArray","body":"= hexToByteArray ( , length , format )","docstring":"/**\n * Parses bytes from this string using the specified [HexFormat].\n *\n * Note that only [HexFormat.BytesHexFormat] affects parsing,\n * and parsing is performed in case-insensitive manner.\n * Also, any of the char sequences CRLF, LF and CR is considered a valid line separator.\n *\n * @param format the [HexFormat] to use for parsing, [HexFormat.Default] by default.\n *\n * @throws IllegalArgumentException if this string does not comply with the specified [format].\n */"} {"signature":"@ ExperimentalStdlibApi private fun String . hexToByteArray ( startIndex : Int = , endIndex : Int = length , format : HexFormat = HexFormat . Default ) : ByteArray","body":"{ AbstractList . checkBoundsIndexes ( startIndex , endIndex , length ) if ( startIndex == endIndex ) { return byteArrayOf ( ) } val bytesFormat = format . bytes if ( bytesFormat . noLineAndGroupSeparator ) { hexToByteArrayNoLineAndGroupSeparator ( startIndex , endIndex , bytesFormat ) ? . let { return it } } return hexToByteArraySlowPath ( startIndex , endIndex , bytesFormat ) }","docstring":"/**\n * Parses bytes from this string using the specified [HexFormat].\n *\n * Note that only [HexFormat.BytesHexFormat] affects parsing,\n * and parsing is performed in case-insensitive manner.\n * Also, any of the char sequences CRLF, LF and CR is considered a valid line separator.\n *\n * @param startIndex the beginning (inclusive) of the substring to parse, 0 by default.\n * @param endIndex the end (exclusive) of the substring to parse, length of this string by default.\n * @param format the [HexFormat] to use for parsing, [HexFormat.Default] by default.\n *\n * @throws IndexOutOfBoundsException when [startIndex] or [endIndex] is out of range of this string indices.\n * @throws IllegalArgumentException when `startIndex > endIndex`.\n * @throws IllegalArgumentException if the substring does not comply with the specified [format].\n */"} {"signature":"@ ExperimentalStdlibApi @ SinceKotlin ( \"\" ) public fun Byte . toHexString ( format : HexFormat = HexFormat . Default ) : String","body":"{ val digits = if ( format . upperCase ) UPPER_CASE_HEX_DIGITS else LOWER_CASE_HEX_DIGITS val numberFormat = format . number if ( numberFormat . isDigitsOnly ) { val charArray = CharArray ( ) val value = this . toInt ( ) charArray [ ] = digits [ ( value shr ) and ] charArray [ ] = digits [ value and ] return if ( numberFormat . removeLeadingZeros ) charArray . concatToString ( startIndex = ( countLeadingZeroBits ( ) shr ) . coerceAtMost ( ) ) else charArray . concatToString ( ) } return toLong ( ) . toHexStringImpl ( numberFormat , digits , bits = ) }","docstring":"/**\n * Formats this `Byte` value using the specified [format].\n *\n * Note that only [HexFormat.upperCase] and [HexFormat.NumberHexFormat] affect formatting.\n *\n * @param format the [HexFormat] to use for formatting, [HexFormat.Default] by default.\n */"} {"signature":"@ ExperimentalStdlibApi @ SinceKotlin ( \"\" ) public fun String . hexToByte ( format : HexFormat = HexFormat . Default ) : Byte","body":"= hexToByte ( , length , format )","docstring":"/**\n * Parses a `Byte` value from this string using the specified [format].\n *\n * Note that only [HexFormat.NumberHexFormat] affects parsing,\n * and parsing is performed in case-insensitive manner.\n *\n * @param format the [HexFormat] to use for parsing, [HexFormat.Default] by default.\n *\n * @throws IllegalArgumentException if this string does not comply with the specified [format].\n */"} {"signature":"@ ExperimentalStdlibApi private fun String . hexToByte ( startIndex : Int = , endIndex : Int = length , format : HexFormat = HexFormat . Default ) : Byte","body":"= hexToIntImpl ( startIndex , endIndex , format , maxDigits = ) . toByte ( )","docstring":"/**\n * Parses a `Byte` value from this string using the specified [format].\n *\n * Note that only [HexFormat.NumberHexFormat] affects parsing,\n * and parsing is performed in case-insensitive manner.\n *\n * @param startIndex the beginning (inclusive) of the substring to parse, 0 by default.\n * @param endIndex the end (exclusive) of the substring to parse, length of this string by default.\n * @param format the [HexFormat] to use for parsing, [HexFormat.Default] by default.\n *\n * @throws IndexOutOfBoundsException when [startIndex] or [endIndex] is out of range of this string indices.\n * @throws IllegalArgumentException when `startIndex > endIndex`.\n * @throws IllegalArgumentException if the substring does not comply with the specified [format].\n */"} {"signature":"@ ExperimentalStdlibApi @ SinceKotlin ( \"\" ) public fun Short . toHexString ( format : HexFormat = HexFormat . Default ) : String","body":"{ val digits = if ( format . upperCase ) UPPER_CASE_HEX_DIGITS else LOWER_CASE_HEX_DIGITS val numberFormat = format . number if ( numberFormat . isDigitsOnly ) { val charArray = CharArray ( ) val value = this . toInt ( ) charArray [ ] = digits [ ( value shr ) and ] charArray [ ] = digits [ ( value shr ) and ] charArray [ ] = digits [ ( value shr ) and ] charArray [ ] = digits [ value and ] return if ( numberFormat . removeLeadingZeros ) charArray . concatToString ( startIndex = ( countLeadingZeroBits ( ) shr ) . coerceAtMost ( ) ) else charArray . concatToString ( ) } return toLong ( ) . toHexStringImpl ( numberFormat , digits , bits = ) }","docstring":"/**\n * Formats this `Short` value using the specified [format].\n *\n * Note that only [HexFormat.upperCase] and [HexFormat.NumberHexFormat] affect formatting.\n *\n * @param format the [HexFormat] to use for formatting, [HexFormat.Default] by default.\n */"} {"signature":"@ ExperimentalStdlibApi @ SinceKotlin ( \"\" ) public fun String . hexToShort ( format : HexFormat = HexFormat . Default ) : Short","body":"= hexToShort ( , length , format )","docstring":"/**\n * Parses a `Short` value from this string using the specified [format].\n *\n * Note that only [HexFormat.NumberHexFormat] affects parsing,\n * and parsing is performed in case-insensitive manner.\n *\n * @param format the [HexFormat] to use for parsing, [HexFormat.Default] by default.\n *\n * @throws IllegalArgumentException if this string does not comply with the specified [format].\n */"} {"signature":"@ ExperimentalStdlibApi private fun String . hexToShort ( startIndex : Int = , endIndex : Int = length , format : HexFormat = HexFormat . Default ) : Short","body":"= hexToIntImpl ( startIndex , endIndex , format , maxDigits = ) . toShort ( )","docstring":"/**\n * Parses a `Short` value from this string using the specified [format].\n *\n * Note that only [HexFormat.NumberHexFormat] affects parsing,\n * and parsing is performed in case-insensitive manner.\n *\n * @param startIndex the beginning (inclusive) of the substring to parse, 0 by default.\n * @param endIndex the end (exclusive) of the substring to parse, length of this string by default.\n * @param format the [HexFormat] to use for parsing, [HexFormat.Default] by default.\n *\n * @throws IndexOutOfBoundsException when [startIndex] or [endIndex] is out of range of this string indices.\n * @throws IllegalArgumentException when `startIndex > endIndex`.\n * @throws IllegalArgumentException if the substring does not comply with the specified [format].\n */"} {"signature":"@ ExperimentalStdlibApi @ SinceKotlin ( \"\" ) public fun Int . toHexString ( format : HexFormat = HexFormat . Default ) : String","body":"{ val digits = if ( format . upperCase ) UPPER_CASE_HEX_DIGITS else LOWER_CASE_HEX_DIGITS val numberFormat = format . number if ( numberFormat . isDigitsOnly ) { val charArray = CharArray ( ) val value = this charArray [ ] = digits [ ( value shr ) and ] charArray [ ] = digits [ ( value shr ) and ] charArray [ ] = digits [ ( value shr ) and ] charArray [ ] = digits [ ( value shr ) and ] charArray [ ] = digits [ ( value shr ) and ] charArray [ ] = digits [ ( value shr ) and ] charArray [ ] = digits [ ( value shr ) and ] charArray [ ] = digits [ value and ] return if ( numberFormat . removeLeadingZeros ) charArray . concatToString ( startIndex = ( countLeadingZeroBits ( ) shr ) . coerceAtMost ( ) ) else charArray . concatToString ( ) } return toLong ( ) . toHexStringImpl ( numberFormat , digits , bits = ) }","docstring":"/**\n * Formats this `Int` value using the specified [format].\n *\n * Note that only [HexFormat.upperCase] and [HexFormat.NumberHexFormat] affect formatting.\n *\n * @param format the [HexFormat] to use for formatting, [HexFormat.Default] by default.\n */"} {"signature":"@ ExperimentalStdlibApi @ SinceKotlin ( \"\" ) public fun String . hexToInt ( format : HexFormat = HexFormat . Default ) : Int","body":"= hexToInt ( , length , format )","docstring":"/**\n * Parses an `Int` value from this string using the specified [format].\n *\n * Note that only [HexFormat.NumberHexFormat] affects parsing,\n * and parsing is performed in case-insensitive manner.\n *\n * @param format the [HexFormat] to use for parsing, [HexFormat.Default] by default.\n *\n * @throws IllegalArgumentException if this string does not comply with the specified [format].\n */"} {"signature":"@ ExperimentalStdlibApi private fun String . hexToInt ( startIndex : Int = , endIndex : Int = length , format : HexFormat = HexFormat . Default ) : Int","body":"= hexToIntImpl ( startIndex , endIndex , format , maxDigits = )","docstring":"/**\n * Parses an `Int` value from this string using the specified [format].\n *\n * Note that only [HexFormat.NumberHexFormat] affects parsing,\n * and parsing is performed in case-insensitive manner.\n *\n * @param startIndex the beginning (inclusive) of the substring to parse, 0 by default.\n * @param endIndex the end (exclusive) of the substring to parse, length of this string by default.\n * @param format the [HexFormat] to use for parsing, [HexFormat.Default] by default.\n *\n * @throws IndexOutOfBoundsException when [startIndex] or [endIndex] is out of range of this string indices.\n * @throws IllegalArgumentException when `startIndex > endIndex`.\n * @throws IllegalArgumentException if the substring does not comply with the specified [format].\n */"} {"signature":"@ ExperimentalStdlibApi @ SinceKotlin ( \"\" ) public fun Long . toHexString ( format : HexFormat = HexFormat . Default ) : String","body":"{ val digits = if ( format . upperCase ) UPPER_CASE_HEX_DIGITS else LOWER_CASE_HEX_DIGITS val numberFormat = format . number if ( numberFormat . isDigitsOnly ) { val charArray = CharArray ( ) val value = this charArray [ ] = digits [ ( ( value shr ) and ) . toInt ( ) ] charArray [ ] = digits [ ( ( value shr ) and ) . toInt ( ) ] charArray [ ] = digits [ ( ( value shr ) and ) . toInt ( ) ] charArray [ ] = digits [ ( ( value shr ) and ) . toInt ( ) ] charArray [ ] = digits [ ( ( value shr ) and ) . toInt ( ) ] charArray [ ] = digits [ ( ( value shr ) and ) . toInt ( ) ] charArray [ ] = digits [ ( ( value shr ) and ) . toInt ( ) ] charArray [ ] = digits [ ( ( value shr ) and ) . toInt ( ) ] charArray [ ] = digits [ ( ( value shr ) and ) . toInt ( ) ] charArray [ ] = digits [ ( ( value shr ) and ) . toInt ( ) ] charArray [ ] = digits [ ( ( value shr ) and ) . toInt ( ) ] charArray [ ] = digits [ ( ( value shr ) and ) . toInt ( ) ] charArray [ ] = digits [ ( ( value shr ) and ) . toInt ( ) ] charArray [ ] = digits [ ( ( value shr ) and ) . toInt ( ) ] charArray [ ] = digits [ ( ( value shr ) and ) . toInt ( ) ] charArray [ ] = digits [ ( value and ) . toInt ( ) ] return if ( numberFormat . removeLeadingZeros ) charArray . concatToString ( startIndex = ( countLeadingZeroBits ( ) shr ) . coerceAtMost ( ) ) else charArray . concatToString ( ) } return toHexStringImpl ( numberFormat , digits , bits = ) }","docstring":"/**\n * Formats this `Long` value using the specified [format].\n *\n * Note that only [HexFormat.upperCase] and [HexFormat.NumberHexFormat] affect formatting.\n *\n * @param format the [HexFormat] to use for formatting, [HexFormat.Default] by default.\n */"} {"signature":"@ ExperimentalStdlibApi @ SinceKotlin ( \"\" ) public fun String . hexToLong ( format : HexFormat = HexFormat . Default ) : Long","body":"= hexToLong ( , length , format )","docstring":"/**\n * Parses a `Long` value from this string using the specified [format].\n *\n * Note that only [HexFormat.NumberHexFormat] affects parsing,\n * and parsing is performed in case-insensitive manner.\n *\n * @param format the [HexFormat] to use for parsing, [HexFormat.Default] by default.\n *\n * @throws IllegalArgumentException if this string does not comply with the specified [format].\n */"} {"signature":"@ ExperimentalStdlibApi private fun String . hexToLong ( startIndex : Int = , endIndex : Int = length , format : HexFormat = HexFormat . Default ) : Long","body":"= hexToLongImpl ( startIndex , endIndex , format , maxDigits = )","docstring":"/**\n * Parses a `Long` value from this string using the specified [format].\n *\n * Note that only [HexFormat.NumberHexFormat] affects parsing,\n * and parsing is performed in case-insensitive manner.\n *\n * @param startIndex the beginning (inclusive) of the substring to parse, 0 by default.\n * @param endIndex the end (exclusive) of the substring to parse, length of this string by default.\n * @param format the [HexFormat] to use for parsing, [HexFormat.Default] by default.\n *\n * @throws IndexOutOfBoundsException when [startIndex] or [endIndex] is out of range of this string indices.\n * @throws IllegalArgumentException when `startIndex > endIndex`.\n * @throws IllegalArgumentException if the substring does not comply with the specified [format].\n */"} {"signature":"@ InternalSerializationApi public open fun findPolymorphicSerializerOrNull ( decoder : CompositeDecoder , klassName : String ? ) : DeserializationStrategy < T > ?","body":"= decoder . serializersModule . getPolymorphic ( baseClass , klassName )","docstring":"/**\n * Lookups an actual serializer for given [klassName] withing the current [base class][baseClass].\n * May use context from the [decoder].\n */"} {"signature":"@ InternalSerializationApi public open fun findPolymorphicSerializerOrNull ( encoder : Encoder , value : T ) : SerializationStrategy < T > ?","body":"= encoder . serializersModule . getPolymorphic ( baseClass , value )","docstring":"/**\n * Lookups an actual serializer for given [value] within the current [base class][baseClass].\n * May use context from the [encoder].\n */"} {"signature":"fun module ( moduleName : String , dependencies : List < ScenarioModule > = emptyList ( ) , additionalCompilationArguments : List < String > = emptyList ( ) , compilationOptionsModifier : ( ( JvmCompilationConfiguration ) -> Unit ) ? = null , incrementalCompilationOptionsModifier : ( ( IncrementalJvmCompilationConfiguration < * > ) -> Unit ) ? = null , ) : ScenarioModule","body":"fun module ( moduleName : String , dependencies : List < ScenarioModule > = emptyList ( ) , additionalCompilationArguments : List < String > = emptyList ( ) , compilationOptionsModifier : ( ( JvmCompilationConfiguration ) -> Unit ) ? = null , incrementalCompilationOptionsModifier : ( ( IncrementalJvmCompilationConfiguration < * > ) -> Unit ) ? = null , ) : ScenarioModule","docstring":"/**\n * Creates a module for a scenario.\n *\n * Modules with the same combination of [Module.scenarioDslCacheKey], [compilationOptionsModifier], and [incrementalCompilationOptionsModifier] are compiled initially only once per tests run.\n *\n * In the case you are using custom values for [compilationOptionsModifier] or [incrementalCompilationOptionsModifier], consider sharing the same lambda between tests for better cacheability results.\n *\n * @param moduleName The name of the module.\n * @param dependencies (optional) The list of scenario modules that this module depends on. Defaults to an empty list.\n * @param additionalCompilationArguments (optional) The list of additional compilation arguments for this module. Defaults to an empty list.\n * @param compilationOptionsModifier (optional) A function that can be used to modify the compilation configuration for this module.\n * @param incrementalCompilationOptionsModifier (optional) A function that can be used to modify the incremental compilation configuration for this module.\n * @return The created scenario module in the compiled state.\n */"} {"signature":"fun println ( vararg objects : Any ? ) : IndentingPrinter","body":"fun println ( vararg objects : Any ? ) : IndentingPrinter","docstring":"/**\n * Prints [objects] by concatenating the results of their [Any.toString] calls, also appending a line break at the end.\n *\n * @return `this`\n */"} {"signature":"fun print ( vararg objects : Any ? ) : IndentingPrinter","body":"fun print ( vararg objects : Any ? ) : IndentingPrinter","docstring":"/**\n * Prints [objects] by concatenating the results of their [Any.toString] calls.\n *\n * @return `this`\n */"} {"signature":"fun pushIndent ( ) : IndentingPrinter","body":"fun pushIndent ( ) : IndentingPrinter","docstring":"/**\n * Increases the indentation level by one.\n *\n * @return `this`\n */"} {"signature":"fun popIndent ( ) : IndentingPrinter","body":"fun popIndent ( ) : IndentingPrinter","docstring":"/**\n * Decreases the indentation level by one.\n *\n * @return `this`\n */"} {"signature":"override fun toString ( ) : String","body":"override fun toString ( ) : String","docstring":"/**\n * Returns the printed text.\n */"} {"signature":"inline fun IndentingPrinter . withIndent ( block : ( ) -> Unit )","body":"{ pushIndent ( ) block ( ) popIndent ( ) }","docstring":"/**\n * The text printed within [block] will be indented.\n */"} {"signature":"public fun tryLock ( owner : Any ? = null ) : Boolean","body":"public fun tryLock ( owner : Any ? = null ) : Boolean","docstring":"/**\n * Tries to lock this mutex, returning `false` if this mutex is already locked.\n *\n * It is recommended to use [withLock] for safety reasons, so that the acquired lock is always\n * released at the end of your critical section, and [unlock] is never invoked before a successful\n * lock acquisition.\n *\n * @param owner Optional owner token for debugging. When `owner` is specified (non-null value) and this mutex\n * is already locked with the same token (same identity), this function throws [IllegalStateException].\n */"} {"signature":"public suspend fun lock ( owner : Any ? = null )","body":"public suspend fun lock ( owner : Any ? = null )","docstring":"/**\n * Locks this mutex, suspending caller until the lock is acquired (in other words, while the lock is held elsewhere).\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 lock 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 is not suspended.\n * Use [yield] or [CoroutineScope.isActive] to periodically check for cancellation in tight loops if needed.\n *\n * Use [tryLock] to try acquiring the lock without waiting.\n *\n * This function is fair; suspended callers are resumed in first-in-first-out order.\n *\n * It is recommended to use [withLock] for safety reasons, so that the acquired lock is always\n * released at the end of the critical section, and [unlock] is never invoked before a successful\n * lock acquisition.\n *\n * @param owner Optional owner token for debugging. When `owner` is specified (non-null value) and this mutex\n * is already locked with the same token (same identity), this function throws [IllegalStateException].\n */"} {"signature":"public fun holdsLock ( owner : Any ) : Boolean","body":"public fun holdsLock ( owner : Any ) : Boolean","docstring":"/**\n * Checks whether this mutex is locked by the specified owner.\n *\n * @return `true` when this mutex is locked by the specified owner;\n * `false` if the mutex is not locked or locked by another owner.\n */"} {"signature":"public fun unlock ( owner : Any ? = null )","body":"public fun unlock ( owner : Any ? = null )","docstring":"/**\n * Unlocks this mutex. Throws [IllegalStateException] if invoked on a mutex that is not locked or\n * was locked with a different owner token (by identity).\n *\n * It is recommended to use [withLock] for safety reasons, so that the acquired lock is always\n * released at the end of the critical section, and [unlock] is never invoked before a successful\n * lock acquisition.\n *\n * @param owner Optional owner token for debugging. When `owner` is specified (non-null value) and this mutex\n * was locked with the different token (by identity), this function throws [IllegalStateException].\n */"} {"signature":"@ Suppress ( \"\" ) public fun Mutex ( locked : Boolean = false ) : Mutex","body":"= MutexImpl ( locked )","docstring":"/**\n * Creates a [Mutex] instance.\n * The mutex created is fair: lock is granted in first come, first served order.\n *\n * @param locked initial state of the mutex.\n */"} {"signature":"@ OptIn ( ExperimentalContracts :: class ) public suspend inline fun < T > Mutex . withLock ( owner : Any ? = null , action : ( ) -> T ) : T","body":"{ contract { callsInPlace ( action , InvocationKind . EXACTLY_ONCE ) } lock ( owner ) return try { action ( ) } finally { unlock ( owner ) } }","docstring":"/**\n * Executes the given [action] under this mutex's lock.\n *\n * @param owner Optional owner token for debugging. When `owner` is specified (non-null value) and this mutex\n * is already locked with the same token (same identity), this function throws [IllegalStateException].\n *\n * @return the return value of the action.\n */"} {"signature":"private fun holdsLockImpl ( owner : Any ? ) : Int","body":"{ while ( true ) { if ( ! isLocked ) return HOLDS_LOCK_UNLOCKED val curOwner = this . owner . value if ( curOwner === NO_OWNER ) continue return if ( curOwner === owner ) HOLDS_LOCK_YES else HOLDS_LOCK_ANOTHER_OWNER } }","docstring":"/**\n * [HOLDS_LOCK_UNLOCKED] if the mutex is unlocked\n * [HOLDS_LOCK_YES] if the mutex is held with the specified [owner]\n * [HOLDS_LOCK_ANOTHER_OWNER] if the mutex is held with a different owner\n */"} {"signature":"@ DisplayName ( \"\" ) @ GradleAndroidTest fun testKT49798AgpVersionAttrNotPublished ( gradleVersion : GradleVersion , agpVersion : String , jdkVersion : JdkVersions . ProvidedJdk , )","body":"{ project ( \"\" , gradleVersion , buildOptions = defaultBuildOptions . copy ( androidVersion = agpVersion ) , buildJdk = jdkVersion . location ) { build ( \"\" ) { val libProject = subProject ( \"\" ) val debugPublicationDirectory = libProject . projectPath . resolve ( \"\" ) val releasePublicationDirectory = libProject . projectPath . resolve ( \"\" ) listOf ( debugPublicationDirectory , releasePublicationDirectory ) . forEach { publicationDirectory -> assertDirectoryExists ( publicationDirectory ) val moduleFiles = Files . walk ( publicationDirectory ) . use { it . filter { file -> file . extension == \"\" } . toList ( ) } assertTrue ( moduleFiles . isNotEmpty ( ) , \"\" ) assertTrue ( moduleFiles . size == , \"\" ) val moduleFile = moduleFiles . single ( ) val moduleFileText = moduleFile . readText ( ) assertTrue ( \"\" !in moduleFileText , \"\" ) } } } }","docstring":"/**\n * Starting from AGP version 7.1.0-alpha13, a new attribute com.android.build.api.attributes.AgpVersionAttr was added.\n * This attribute is *not intended* to be published.\n */"} {"signature":"fun poll ( ) : Task ?","body":"= lastScheduledTask . getAndSet ( null ) ? : pollBuffer ( )","docstring":"/**\n * Retrieves and removes task from the head of the queue\n * Invariant: this method is called only by the owner of the queue.\n */"} {"signature":"fun add ( task : Task , fair : Boolean = false ) : Task ?","body":"{ if ( fair ) return addLast ( task ) val previous = lastScheduledTask . getAndSet ( task ) ? : return null return addLast ( previous ) }","docstring":"/**\n * Invariant: Called only by the owner of the queue, returns\n * `null` if task was added, task that wasn't added otherwise.\n */"} {"signature":"private fun addLast ( task : Task ) : Task ?","body":"{ if ( bufferSize == BUFFER_CAPACITY - ) return task if ( task . isBlocking ) blockingTasksInBuffer . incrementAndGet ( ) val nextIndex = producerIndex . value and MASK while ( buffer [ nextIndex ] != null ) { Thread . yield ( ) } buffer . lazySet ( nextIndex , task ) producerIndex . incrementAndGet ( ) return null }","docstring":"/**\n * Invariant: Called only by the owner of the queue, returns\n * `null` if task was added, task that wasn't added otherwise.\n */"} {"signature":"fun trySteal ( stealingMode : StealingMode , stolenTaskRef : ObjectRef < Task ? > ) : Long","body":"{ val task = when ( stealingMode ) { STEAL_ANY -> pollBuffer ( ) else -> stealWithExclusiveMode ( stealingMode ) } if ( task != null ) { stolenTaskRef . element = task return TASK_STOLEN } return tryStealLastScheduled ( stealingMode , stolenTaskRef ) }","docstring":"/**\n * Tries stealing from this queue into the [stolenTaskRef] argument.\n *\n * Returns [NOTHING_TO_STEAL] if queue has nothing to steal, [TASK_STOLEN] if at least task was stolen\n * or positive value of how many nanoseconds should pass until the head of this queue will be available to steal.\n *\n * [StealingMode] controls what tasks to steal:\n * - [STEAL_ANY] is default mode for scheduler, task from the head (in FIFO order) is stolen\n * - [STEAL_BLOCKING_ONLY] is mode for stealing *an arbitrary* blocking task, which is used by the scheduler when helping in Dispatchers.IO mode\n * - [STEAL_CPU_ONLY] is a kludge for `runSingleTaskFromCurrentSystemDispatcher`\n */"} {"signature":"private fun tryStealLastScheduled ( stealingMode : StealingMode , stolenTaskRef : ObjectRef < Task ? > ) : Long","body":"{ while ( true ) { val lastScheduled = lastScheduledTask . value ? : return NOTHING_TO_STEAL if ( ( lastScheduled . maskForStealingMode and stealingMode ) == ) { return NOTHING_TO_STEAL } val time = schedulerTimeSource . nanoTime ( ) val staleness = time - lastScheduled . submissionTime if ( staleness < WORK_STEALING_TIME_RESOLUTION_NS ) { return WORK_STEALING_TIME_RESOLUTION_NS - staleness } if ( lastScheduledTask . compareAndSet ( lastScheduled , null ) ) { stolenTaskRef . element = lastScheduled return TASK_STOLEN } continue } }","docstring":"/**\n * Contract on return value is the same as for [trySteal]\n */"} {"signature":"fun efficientNetB0AdditionalTraining ( )","body":"{ val modelHub = ONNXModelHub ( cacheDirectory = File ( \"\" ) ) val modelType = ONNXModels . CVnoTop . EfficientNetB0 modelHub . loadModel ( modelType ) . use { model -> println ( model ) val preprocessing = modelType . createPreprocessing ( model ) . onnx { onnxModel = model } val dogsVsCatsDatasetPath = dogsCatsSmallDatasetPath ( ) val dataset = OnFlyImageDataset . create ( File ( dogsVsCatsDatasetPath ) , FromFolders ( mapping = mapOf ( \"\" to , \"\" to ) ) , preprocessing ) . shuffle ( ) val ( train , test ) = dataset . split ( TRAIN_TEST_SPLIT_RATIO ) topModel . use { topModel . compile ( optimizer = Adam ( ) , loss = Losses . SOFT_MAX_CROSS_ENTROPY_WITH_LOGITS , metric = Metrics . ACCURACY ) topModel . fit ( dataset = train , epochs = EPOCHS , batchSize = TRAINING_BATCH_SIZE ) val accuracy = topModel . evaluate ( dataset = test , batchSize = TEST_BATCH_SIZE ) . metrics [ Metrics . ACCURACY ] println ( \"\" ) } } }","docstring":"/**\n * This examples demonstrates the transfer learning concept on EfficientNetB0 model:\n * - Model configuration, model weights and labels are obtained from [ONNXModelHub].\n * - All layers, excluding the last [Dense], are added to the new Neural Network, its weights are frozen.\n * - ONNX frozen model is used as a preprocessing stage via `onnx` stage of the Image Preprocessing DSL.\n * - New Dense layers are added and initialized via defined initializers.\n * - Model is re-trained on [dogsCatsDatasetPath] dataset.\n *\n *\n * We use the preprocessing DSL to describe the dataset generation pipeline.\n * We demonstrate the workflow on the subset of Kaggle Cats vs Dogs binary classification dataset.\n */"} {"signature":"fun main ( ) : Unit","body":"= efficientNetB0AdditionalTraining ( )","docstring":"/** */"} {"signature":"fun load ( filename : String )","body":"= System . load ( filename )","docstring":"/**\n * Load library by its absolute path\n */"} {"signature":"fun loadLibrary ( name : String )","body":"= System . loadLibrary ( name )","docstring":"/**\n * Load library by its name\n */"} {"signature":"fun load ( kClass : KClass < * > , filename : String , )","body":"= load0 ( kClass , filename , true )","docstring":"/**\n * Load library by its absolute path from a different classloader\n */"} {"signature":"fun loadLibrary ( kClass : KClass < * > , name : String , )","body":"= load0 ( kClass , name , false )","docstring":"/**\n * Load library by its name from a different classloader\n */"} {"signature":"public fun < T > PlotContext . 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 > PlotContext . 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 PlotContext . 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 > PlotContext . 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 PlotContext . 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 < T > PlotContext . 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 > PlotContext . 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 PlotContext . 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 > PlotContext . 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 PlotContext . 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":"internal fun defaultActivationName ( layer : Layer )","body":"= \"\"","docstring":"/** Default activation name in TensorFlow graph, based on [layer]'s name. */"} {"signature":"internal fun defaultAssignOpName ( name : String )","body":"= \"\"","docstring":"/** Default Assign op name in TensorFlow graph, based on variable's name. */"} {"signature":"internal fun defaultInitializerOpName ( name : String )","body":"= \"\"","docstring":"/** Default Initializer op name in TensorFlow graph, based on variable's name. */"} {"signature":"internal fun defaultOptimizerVariableName ( name : String )","body":"= \"\"","docstring":"/** Default optimizer variable name in TensorFlow graph, based on variable's name. */"} {"signature":"internal fun convBiasVarName ( name : String , dim : Int ) : String","body":"= layerVarName ( name , \"\" )","docstring":"/** Default Conv bias variable name in TensorFlow graph, based on layer's name. */"} {"signature":"internal fun convKernelVarName ( name : String , dim : Int ) : String","body":"= layerVarName ( name , \"\" )","docstring":"/** Default Conv kernel variable name in TensorFlow graph, based on layer's name. */"} {"signature":"internal fun convTransposeBiasVarName ( name : String , dim : Int ) : String","body":"= layerVarName ( name , \"\" )","docstring":"/** Default Conv transpose bias variable name in TensorFlow graph, based on layer's name. */"} {"signature":"internal fun convTransposeKernelVarName ( name : String , dim : Int ) : String","body":"{ return layerVarName ( name , \"\" ) }","docstring":"/** Default Conv transpose kernel variable name in TensorFlow graph, based on layer's name. */"} {"signature":"internal fun depthwiseConv2dBiasVarName ( name : String ) : String","body":"= layerVarName ( name , \"\" )","docstring":"/** Default DepthwiseConv2d bias variable name in TensorFlow graph, based on layer's name. */"} {"signature":"internal fun depthwiseConv2dKernelVarName ( name : String ) : String","body":"= layerVarName ( name , \"\" )","docstring":"/** Default DepthwiseConv2d kernel variable name in TensorFlow graph, based on layer's name. */"} {"signature":"internal fun separableConv2dBiasVarName ( name : String )","body":"= layerVarName ( name , \"\" )","docstring":"/** Default SeparableConv2d bias variable name in TensorFlow graph, based on layer's name. */"} {"signature":"internal fun separableConv2dDepthwiseKernelVarName ( name : String )","body":"= layerVarName ( name , \"\" )","docstring":"/** Default SeparableConv2d depthwise kernel variable name in TensorFlow graph, based on layer's name. */"} {"signature":"internal fun separableConv2dPointwiseKernelVarName ( name : String )","body":"= layerVarName ( name , \"\" )","docstring":"/** Default SeparableConv2d pointwise kernel variable name in TensorFlow graph, based on layer's name. */"} {"signature":"internal fun denseBiasVarName ( name : String )","body":"= layerVarName ( name , \"\" )","docstring":"/** Default Dense bias variable name in TensorFlow graph, based on layer's name. */"} {"signature":"internal fun denseKernelVarName ( name : String )","body":"= layerVarName ( name , \"\" )","docstring":"/** Default Dense kernel variable name in TensorFlow graph, based on layer's name. */"} {"signature":"internal fun batchNormGammaVarName ( name : String )","body":"= layerVarName ( name , \"\" )","docstring":"/** Default BatchNorm gamma variable name in TensorFlow graph, based on layer's name. */"} {"signature":"internal fun batchNormBetaVarName ( name : String )","body":"= layerVarName ( name , \"\" )","docstring":"/** Default BatchNorm beta variable name in TensorFlow graph, based on layer's name. */"} {"signature":"internal fun batchNormMovingMeanVarName ( name : String )","body":"= layerVarName ( name , \"\" )","docstring":"/** Default BatchNorm moving mean variable name in TensorFlow graph, based on layer's name. */"} {"signature":"internal fun batchNormMovingVarianceVarName ( name : String )","body":"= layerVarName ( name , \"\" )","docstring":"/** Default BatchNorm moving variance variable name in TensorFlow graph, based on layer's name. */"} {"signature":"fun append ( char : String , name : String , categoryCode : String )","body":"{ val charCode = char . hexToInt ( ) val categoryId = categoryId ( categoryCode ) when { name . endsWith ( \"\" ) -> rangeFirst ( charCode , categoryId ) name . endsWith ( \"\" ) -> rangeLast ( charCode , categoryId ) else -> append ( charCode , categoryId ) } lastAppendedCharCode = charCode }","docstring":"/**\n * Appends a line from the UnicodeData.txt file.\n */"} {"signature":"fun build ( ) : Triple < List < Int > , List < Int > , List < Int > >","body":"{ for ( code in lastAppendedCharCode + .. ) { appendSingleChar ( code , unassignedCategoryId ) } var index = ranges . lastIndex while ( index > ) { val previous = ranges [ index - ] val previousEnd = previous . rangeEnd ( ) val previousEndCategory = previous . categoryIdOf ( previousEnd ) val current = ranges [ index ] if ( current . prepend ( previousEnd , previousEndCategory ) ) { val newPrevious = removeLast ( previous ) if ( newPrevious != null ) { ranges [ index - ] = newPrevious } else { ranges . removeAt ( index - ) index -- } } else { index -- } } return Triple ( ranges . map { it . rangeStart ( ) } , ranges . map { it . rangeEnd ( ) } , ranges . map { it . category ( ) } ) }","docstring":"/**\n * Optimizes the number of ranges and returns them.\n *\n * Returns a [Triple] containing lists of range starts, ends and categories in that particular order.\n */"} {"signature":"private fun rangeFirst ( charCode : Int , categoryId : String )","body":"{ append ( charCode , categoryId ) }","docstring":"/**\n * Appends the [charCode] as the start of a range of chars with the specified [categoryId].\n */"} {"signature":"private fun rangeLast ( charCode : Int , categoryId : String )","body":"{ if ( ! shouldSkip ( categoryId ) ) { check ( ranges . last ( ) . rangeEnd ( ) == lastAppendedCharCode ) check ( ranges . last ( ) . categoryIdOf ( lastAppendedCharCode ) == categoryId ) } for ( code in lastAppendedCharCode + .. charCode ) { appendSingleChar ( code , categoryId ) } }","docstring":"/**\n * Appends the [charCode] as the end of a range of chars with the specified [categoryId].\n * Chars between last appended char and the [charCode] are considered to have the specified [categoryId].\n */"} {"signature":"private fun append ( charCode : Int , categoryId : String )","body":"{ for ( code in lastAppendedCharCode + until charCode ) { appendSingleChar ( code , unassignedCategoryId ) } appendSingleChar ( charCode , categoryId ) }","docstring":"/**\n * Appends the [charCode] with the specified [categoryId].\n * Chars between last appended char and the [charCode] are considered to be unassigned.\n */"} {"signature":"private fun appendSingleChar ( charCode : Int , categoryId : String )","body":"{ if ( shouldSkip ( categoryId ) ) return if ( ranges . isEmpty ( ) ) { ranges . add ( createRange ( charCode , categoryId ) ) return } val lastRange = ranges . last ( ) if ( ! lastRange . append ( charCode , categoryId ) ) { val newLastRange = evolveLastRange ( lastRange , charCode , categoryId ) if ( newLastRange != null ) { ranges [ ranges . lastIndex ] = newLastRange } else { ranges . add ( createRange ( charCode , categoryId ) ) } } }","docstring":"/**\n * Appends the [charCode] with the specified [categoryId] to the last range, or a new range containing the [charCode] is created.\n * The last range can be transformed to another range type to accommodate the [charCode].\n */"} {"signature":"private fun createRange ( charCode : Int , categoryId : String ) : RangePattern","body":"{ return PeriodicRangePattern . from ( charCode , categoryId , sequenceLength = , isPeriodic = true , unassignedCategoryId , makeOnePeriodCategory ) }","docstring":"/**\n * Creates the simplest range containing the single [charCode].\n */"} {"signature":"private fun removeLast ( range : RangePattern ) : RangePattern ?","body":"{ if ( range . rangeLength ( ) == ) { return null } val rangeStart = range . rangeStart ( ) var result = createRange ( rangeStart , range . categoryIdOf ( rangeStart ) ) for ( code in rangeStart + until range . rangeEnd ( ) ) { val categoryId = range . categoryIdOf ( code ) if ( ! shouldSkip ( categoryId ) ) { result = if ( result . append ( code , categoryId ) ) result else evolveLastRange ( result , code , categoryId ) ! ! } } return result }","docstring":"/**\n * Removes the last char in the specified [range].\n * Returns the simplest pattern that accommodated the remaining chars in the [range],\n * or `null` if the [range] contained a single char.\n */"} {"signature":"protected abstract fun categoryId ( categoryCode : String ) : String","body":"protected abstract fun categoryId ( categoryCode : String ) : String","docstring":"/**\n * The id to use for the [categoryCode] - the Unicode general category code.\n */"} {"signature":"protected abstract fun shouldSkip ( categoryId : String ) : Boolean","body":"protected abstract fun shouldSkip ( categoryId : String ) : Boolean","docstring":"/**\n * Returns true if this range builder skips chars with the specified [categoryId].\n */"} {"signature":"protected open fun evolveLastRange ( lastRange : RangePattern , charCode : Int , categoryId : String ) : RangePattern ?","body":"= null","docstring":"/**\n * Appends the [charCode] with the specified [categoryId] to the [lastRange] and returns the resulting range,\n * or returns `null` if [charCode] can't be appended to the [lastRange].\n * The [lastRange] can be transformed to another range type to accommodate the [charCode].\n */"} {"signature":"fun nasNetLargePrediction ( )","body":"{ runImageRecognitionPrediction ( modelType = TFModels . CV . NASNetLarge ( ) ) }","docstring":"/**\n * This example demonstrates the inference concept on NasNetLarge 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 NasNetLarge during training on ImageNet dataset) is applied to each image before prediction.\n *\n * NOTE: Input resolution is 331*331\n */"} {"signature":"fun main ( ) : Unit","body":"= nasNetLargePrediction ( )","docstring":"/** */"} {"signature":"fun checkPoolThreadsCreated ( expectedThreadsCount : Int = CORES_COUNT )","body":"{ val threadsCount = maxSequenceNumber ( ) ! ! assertEquals ( expectedThreadsCount , threadsCount , \"\" ) }","docstring":"/**\n * Asserts that [expectedThreadsCount] pool worker threads were created.\n * Note that 'created' doesn't mean 'exists' because pool supports dynamic shrinking\n */"} {"signature":"fun checkPoolThreadsCreated ( range : IntRange , base : Int = CORES_COUNT )","body":"{ val maxSequenceNumber = maxSequenceNumber ( ) ! ! val r = ( range . first ) .. ( range . last + base ) assertTrue ( maxSequenceNumber in r , \"\" ) }","docstring":"/**\n * Asserts that any number of pool worker threads in [range] were created.\n * Note that 'created' doesn't mean 'exists' because pool supports dynamic shrinking\n */"} {"signature":"internal fun Json . deserializationNamesMap ( descriptor : SerialDescriptor ) : Map < String , Int >","body":"= schemaCache . getOrPut ( descriptor , JsonDeserializationNamesKey ) { descriptor . buildDeserializationNamesMap ( this ) }","docstring":"/**\n * Contains strategy-mapped names and @JsonNames,\n * so original names are not stored when strategy is `null`.\n */"} {"signature":"@ OptIn ( ExperimentalSerializationApi :: class ) internal fun SerialDescriptor . getJsonNameIndex ( json : Json , name : String ) : Int","body":"{ if ( json . decodeCaseInsensitive ( this ) ) { return getJsonNameIndexSlowPath ( json , name . lowercase ( ) ) } val strategy = namingStrategy ( json ) if ( strategy != null ) return getJsonNameIndexSlowPath ( json , name ) val index = getElementIndex ( name ) if ( index != CompositeDecoder . UNKNOWN_NAME ) return index if ( ! json . configuration . useAlternativeNames ) return index return getJsonNameIndexSlowPath ( json , name ) }","docstring":"/**\n * Serves same purpose as [SerialDescriptor.getElementIndex] but respects [JsonNames] annotation\n * and [JsonConfiguration] settings.\n */"} {"signature":"@ OptIn ( ExperimentalSerializationApi :: class ) internal fun SerialDescriptor . getJsonNameIndexOrThrow ( json : Json , name : String , suffix : String = \"\" ) : Int","body":"{ val index = getJsonNameIndex ( json , name ) if ( index == CompositeDecoder . UNKNOWN_NAME ) throw SerializationException ( \"\" ) return index }","docstring":"/**\n * Throws on [CompositeDecoder.UNKNOWN_NAME]\n */"} {"signature":"public inline fun < reified DomainType : Comparable < DomainType > > continuousColorBrewer ( type : BrewerPalette ? = null , domain : ClosedRange < DomainType > , nullValue : Color ? = null , transform : Transformation ? = null ) : ScaleContinuousColorBrewer < DomainType >","body":"= ScaleContinuousColorBrewer ( domain . let { listOf ( it . start , it . endInclusive ) } , type , nullValue , transform )","docstring":"/**\n * Sequential, diverging and qualitative color scales from colorbrewer.org.\n *\n * @param type [BrewerPalette] pallet.\n * @param DomainType scale domain type.\n * @param domain [ClosedRange] defining the scale domain.\n * @param nullValue value which null is mapped to.\n * @param transform the transformation of scale.\n *\n * @return new continuous color scale.\n */"} {"signature":"public inline fun < reified DomainType : Comparable < DomainType > > continuousColorBrewer ( type : BrewerPalette ? = null , domainMin : DomainType ? = null , domainMax : DomainType ? = null , nullValue : Color ? = null , transform : Transformation ? = null ) : ScaleContinuousColorBrewer < DomainType >","body":"= ScaleContinuousColorBrewer ( listOf ( domainMin , domainMax ) , type , nullValue , transform )","docstring":"/**\n * Sequential, diverging and qualitative color scales from colorbrewer.org.\n *\n * @param type [BrewerPalette] pallet.\n * @param DomainType scale domain type.\n * @param domainMin scale domain minimum.\n * @param domainMax scale domain maximum.\n * @param nullValue value which null is mapped to.\n * @param transform scale transformation.\n *\n * @return new continuous color scale.\n */"} {"signature":"public inline fun < reified DomainType > categoricalColorBrewer ( type : BrewerPalette ? = null , domain : List < DomainType > ? = null , ) : ScaleCategoricalColorBrewer < DomainType >","body":"= ScaleCategoricalColorBrewer ( domain , type )","docstring":"/**\n * Sequential, diverging and qualitative color scales from colorbrewer.org.\n *\n * @param type [BrewerPalette] pallet.\n * @param DomainType scale domain type.\n * @param domain [List] defining the scale domain.\n *\n * @return new categorical color scale.\n */"} {"signature":"fun kotlinToNative ( nativeBacked : NativeBacked , returnType : BridgedType , kotlinValues : List < BridgeTypedKotlinValue > , independent : Boolean , block : NativeCodeBuilder . ( nativeValues : List < NativeExpression > ) -> NativeExpression ) : KotlinExpression","body":"fun kotlinToNative ( nativeBacked : NativeBacked , returnType : BridgedType , kotlinValues : List < BridgeTypedKotlinValue > , independent : Boolean , block : NativeCodeBuilder . ( nativeValues : List < NativeExpression > ) -> NativeExpression ) : KotlinExpression","docstring":"/**\n * Generates the expression to convert given Kotlin values to native counterparts, pass through the bridge,\n * use inside the native code produced by [block] and then return the result back.\n *\n * @param block produces native code lines into the builder and returns the expression to be used as the result.\n */"} {"signature":"fun nativeToKotlin ( nativeBacked : NativeBacked , returnType : BridgedType , nativeValues : List < BridgeTypedNativeValue > , block : KotlinCodeBuilder . ( kotlinValues : List < KotlinExpression > ) -> KotlinExpression ) : NativeExpression","body":"fun nativeToKotlin ( nativeBacked : NativeBacked , returnType : BridgedType , nativeValues : List < BridgeTypedNativeValue > , block : KotlinCodeBuilder . ( kotlinValues : List < KotlinExpression > ) -> KotlinExpression ) : NativeExpression","docstring":"/**\n * Generates the expression to convert given native values to Kotlin counterparts, pass through the bridge,\n * use inside the Kotlin code produced by [block] and then return the result back.\n */"} {"signature":"fun prepare ( ) : NativeBridges","body":"fun prepare ( ) : NativeBridges","docstring":"/**\n * Prepares all requested native bridges.\n */"} {"signature":"fun isSupported ( nativeBacked : NativeBacked ) : Boolean","body":"fun isSupported ( nativeBacked : NativeBacked ) : Boolean","docstring":"/**\n * @return `true` iff given entity is supported by these bridges,\n * i.e. all bridges it depends on can be successfully generated.\n */"} {"signature":"public override fun close ( )","body":"{ ioState = IOState . CLOSED inputStream . close ( ) }","docstring":"/** */"} {"signature":"public fun readRemainingFrames ( ) : Array < FloatArray >","body":"{ val count = remainingFrames if ( count > Int . MAX_VALUE ) { throw WavFileException ( \"\" ) } val buffer = Array ( format . numChannels ) { FloatArray ( count . toInt ( ) ) } val readCount = readFrames ( buffer , count . toInt ( ) ) check ( readCount == count . toInt ( ) ) { \"\" } return buffer }","docstring":"/**\n * Read all remaining frames from WAV file and return them as an array of\n * results for each of the channels of input file.\n *\n * @return Array with sound data for each channel\n */"} {"signature":"public fun readFrames ( returnBuffer : Array < FloatArray > , count : Int , offset : Int = ) : Int","body":"{ var myOffset = offset if ( ioState != IOState . READING ) { throw IOException ( \"\" ) } for ( f in until count ) { if ( frameCounter == frames ) { return f } for ( c in until format . numChannels ) { returnBuffer [ c ] [ myOffset ] = format . floatOffset + readSingleSample ( ) . toFloat ( ) / format . floatScale } myOffset ++ frameCounter ++ } return count }","docstring":"/**\n * Read some number of frames from a specific offset in the buffer into a multidimensional\n * float array.\n *\n * @param returnBuffer the buffer to read samples into\n * @param count the number of frames to read\n * @param offset the buffer offset to read from\n * @return the number of frames read\n */"} {"signature":"private fun readSingleSample ( ) : Long","body":"{ var resultSample = for ( b in until format . bytesPerSample ) { if ( bufferPointer == bytesRead ) { val read = inputStream . read ( buffer , , bufferSize ) if ( read == - ) { throw WavFileException ( \"\" ) } bytesRead = read bufferPointer = } var v = buffer [ bufferPointer ] . toLong ( ) if ( b < format . bytesPerSample - || format . bytesPerSample == ) { v = v and . toLong ( ) } resultSample += ( v shl b * ) bufferPointer ++ } return resultSample }","docstring":"/**\n * Read a single sample from the buffer.\n *\n * @return the sample read\n * @throws IOException Signals that an I/O exception has occurred\n * @throws WavFileException a WavFile-specific exception\n */"} {"signature":"internal fun readLittleEndian ( buffer : ByteArray , position : Int , count : Int ) : Long","body":"{ var currPosition = position + count - var returnValue = ( buffer [ currPosition ] . toLong ( ) and ) for ( b in until count - ) { returnValue = ( returnValue shl ) + ( buffer [ -- currPosition ] . toLong ( ) and ) } return returnValue }","docstring":"/**\n * Read little-endian data from the buffer.\n *\n * @param buffer to read from\n * @param position the starting position to read from\n * @param count the number of bytes to read\n * @return a little-endian long value read from buffer\n */"} {"signature":"public fun < T : Any > serializersModuleOf ( kClass : KClass < T > , serializer : KSerializer < T > ) : SerializersModule","body":"= SerializersModule { contextual ( kClass , serializer ) }","docstring":"/**\n * Returns a [SerializersModule] which has one class with one [serializer] for [ContextualSerializer].\n */"} {"signature":"public inline fun < reified T : Any > serializersModuleOf ( serializer : KSerializer < T > ) : SerializersModule","body":"= serializersModuleOf ( T :: class , serializer )","docstring":"/**\n * Returns a [SerializersModule] which has one class with one [serializer] for [ContextualSerializer].\n */"} {"signature":"@ Suppress ( \"\" ) public inline fun SerializersModule ( builderAction : SerializersModuleBuilder . ( ) -> Unit ) : SerializersModule","body":"{ val builder = SerializersModuleBuilder ( ) builder . builderAction ( ) return builder . build ( ) }","docstring":"/**\n * A builder function for creating a [SerializersModule].\n * Serializers can be added via [SerializersModuleBuilder.contextual] or [SerializersModuleBuilder.polymorphic].\n * Since [SerializersModuleBuilder] also implements [SerialModuleCollector],\n * it is possible to copy whole another module to this builder with [SerializersModule.dumpTo]\n */"} {"signature":"@ Suppress ( \"\" ) public fun EmptySerializersModule ( ) : SerializersModule","body":"= @ Suppress ( \"\" ) EmptySerializersModule","docstring":"/**\n * A [SerializersModule] which is empty and returns `null` from each method.\n */"} {"signature":"public override fun < T : Any > contextual ( kClass : KClass < T > , serializer : KSerializer < T > ) : Unit","body":"= registerSerializer ( kClass , ContextualProvider . Argless ( serializer ) )","docstring":"/**\n * Adds [serializer] associated with given [kClass] for contextual serialization.\n * If [kClass] has generic type parameters, consider registering provider instead.\n *\n * Throws [SerializationException] if a module already has serializer or provider associated with a [kClass].\n * To overwrite an already registered serializer, [SerializersModule.overwriteWith] can be used.\n */"} {"signature":"public override fun < T : Any > contextual ( kClass : KClass < T > , provider : ( typeArgumentsSerializers : List < KSerializer < * > > ) -> KSerializer < * > ) : Unit","body":"= registerSerializer ( kClass , ContextualProvider . WithTypeArguments ( provider ) )","docstring":"/**\n * Registers [provider] associated with given generic [kClass] for contextual serialization.\n * When a serializer is requested from a module, provider is being called with type arguments serializers\n * of the particular [kClass] usage.\n *\n * Example:\n * ```\n * class Holder(@Contextual val boxI: Box, @Contextual val boxS: Box)\n *\n * val module = SerializersModule {\n * // args[0] contains Int.serializer() or String.serializer(), depending on the property\n * contextual(Box::class) { args -> BoxSerializer(args[0]) }\n * }\n * ```\n *\n * Throws [SerializationException] if a module already has provider or serializer associated with a [kClass].\n * To overwrite an already registered serializer, [SerializersModule.overwriteWith] can be used.\n */"} {"signature":"public override fun < Base : Any , Sub : Base > polymorphic ( baseClass : KClass < Base > , actualClass : KClass < Sub > , actualSerializer : KSerializer < Sub > )","body":"{ registerPolymorphicSerializer ( baseClass , actualClass , actualSerializer ) }","docstring":"/**\n * Adds [serializer][actualSerializer] associated with given [actualClass] in the scope of [baseClass] for polymorphic serialization.\n * Throws [SerializationException] if a module already has serializer associated with a [actualClass].\n * To overwrite an already registered serializer, [SerializersModule.overwriteWith] can be used.\n */"} {"signature":"public override fun < Base : Any > polymorphicDefaultSerializer ( baseClass : KClass < Base > , defaultSerializerProvider : ( value : Base ) -> SerializationStrategy < Base > ? )","body":"{ registerDefaultPolymorphicSerializer ( baseClass , defaultSerializerProvider , false ) }","docstring":"/**\n * Adds a default serializers provider associated with the given [baseClass] to the resulting module.\n * [defaultSerializerProvider] is invoked when no polymorphic serializers for `value` in the scope of [baseClass] were found.\n *\n * Default serializers provider affects only serialization process. To affect deserialization process, use\n * [SerializersModuleBuilder.polymorphicDefaultDeserializer].\n *\n * [defaultSerializerProvider] can be stateful and lookup a serializer for the missing type dynamically.\n */"} {"signature":"public override fun < Base : Any > polymorphicDefaultDeserializer ( baseClass : KClass < Base > , defaultDeserializerProvider : ( className : String ? ) -> DeserializationStrategy < Base > ? )","body":"{ registerDefaultPolymorphicDeserializer ( baseClass , defaultDeserializerProvider , false ) }","docstring":"/**\n * Adds a default deserializers provider associated with the given [baseClass] to the resulting module.\n * [defaultDeserializerProvider] is invoked when no polymorphic serializers associated with the `className`\n * in the scope of [baseClass] were found. `className` could be `null` for formats that support nullable class discriminators\n * (currently only `Json` with `useArrayPolymorphism` set to `false`).\n *\n * Default deserializers provider affects only deserialization process. To affect serialization process, use\n * [SerializersModuleBuilder.polymorphicDefaultSerializer].\n *\n * [defaultDeserializerProvider] can be stateful and lookup a serializer for the missing type dynamically.\n *\n * @see PolymorphicModuleBuilder.defaultDeserializer\n */"} {"signature":"public fun include ( module : SerializersModule )","body":"{ module . dumpTo ( this ) }","docstring":"/**\n * Copies the content of [module] module into the current builder.\n */"} {"signature":"public inline fun < reified T : Any > SerializersModuleBuilder . contextual ( serializer : KSerializer < T > ) : Unit","body":"= contextual ( T :: class , serializer )","docstring":"/**\n * Adds [serializer] associated with given type [T] for contextual serialization.\n * Throws [SerializationException] if a module already has serializer associated with the given type.\n * To overwrite an already registered serializer, [SerializersModule.overwriteWith] can be used.\n */"} {"signature":"public inline fun < Base : Any > SerializersModuleBuilder . polymorphic ( baseClass : KClass < Base > , baseSerializer : KSerializer < Base > ? = null , builderAction : PolymorphicModuleBuilder < Base > . ( ) -> Unit = { } )","body":"{ val builder = PolymorphicModuleBuilder ( baseClass , baseSerializer ) builder . builderAction ( ) builder . buildTo ( this ) }","docstring":"/**\n * Creates a builder to register subclasses of a given [baseClass] for polymorphic serialization.\n * If [baseSerializer] is not null, registers it as a serializer for [baseClass],\n * which is useful if the base class is serializable itself. To register subclasses,\n * [PolymorphicModuleBuilder.subclass] builder function can be used.\n *\n * If a serializer already registered for the given KClass in the given scope, an [IllegalArgumentException] is thrown.\n * To override registered serializers, combine built module with another using [SerializersModule.overwriteWith].\n *\n * @see PolymorphicSerializer\n */"} {"signature":"operator fun < T > set ( key : Key < T > , value : T ) : T ?","body":"operator fun < T > set ( key : Key < T > , value : T ) : T ?","docstring":"/**\n * @return The previous value or null if no previous value was set\n */"} {"signature":"fun kotlinSourceSetName ( disambiguationClassifier : String , androidSourceSetName : String , type : AndroidVariantType ? ) : String ?","body":"fun kotlinSourceSetName ( disambiguationClassifier : String , androidSourceSetName : String , type : AndroidVariantType ? ) : String ?","docstring":"/**\n * Returns the name of the corresponding [KotlinSourceSet]\n * This function can be called w/ or w/o a specific [type].\n */"} {"signature":"fun defaultKotlinSourceSetName ( target : KotlinAndroidTarget , @ Suppress ( \"\" ) variant : DeprecatedAndroidBaseVariant ) : String ?","body":"= null","docstring":"/**\n * Returns the name of the default KotlinSourceSet for a given Android compilation.\n * Returns `null`, if this naming schema does not know about it. In this case, the\n * 'default' defaultSourceSetName will be constructed by the compilation.\n */"} {"signature":"@ JvmStatic fun writeData ( message : MessageLite , stringTable : JvmStringTable ) : Array < String >","body":"= BitEncoding . encodeBytes ( writeDataBytes ( stringTable , message ) )","docstring":"/**\n * Serializes [message] and [stringTable] into a string array which must be further written to [Metadata.data1]\n */"} {"signature":"private fun isLowSurrogateOfSupplement ( string : CharSequence , index : Int ) : Boolean","body":"= index < string . length && string [ index ] . isLowSurrogate ( ) && index > && string [ index - ] . isHighSurrogate ( )","docstring":"/** Returns true if [index] points to a low surrogate following a high surrogate */"} {"signature":"fun merge ( vararg contexts : ScriptEvaluationContextData ? ) : ScriptEvaluationContextData ?","body":"{ val nonEmpty = ArrayList < ScriptEvaluationContextData > ( ) for ( data in contexts ) { if ( data != null && ! data . isEmpty ( ) ) { nonEmpty . add ( data ) } } return when { nonEmpty . isEmpty ( ) -> null nonEmpty . size == -> nonEmpty . first ( ) else -> ScriptEvaluationContextData ( nonEmpty . asIterable ( ) ) } }","docstring":"/**\n * optimized alternative to the constructor with multiple base configurations\n */"} {"signature":"fun tupleOf ( ) : EmptyTuple","body":"= EmptyTuple","docstring":"/**\n * Returns the instance of Tuple0.\n * @see t\n */"} {"signature":"fun < T1 > tupleOf ( _1 : T1 ) : Tuple1 < T1 >","body":"= Tuple1 < T1 > ( _1 )","docstring":"/**\n * Returns a new Tuple1 of the given arguments.\n * @see t\n * @see X\n */"} {"signature":"fun < T1 , T2 > tupleOf ( _1 : T1 , _2 : T2 ) : Tuple2 < T1 , T2 >","body":"= Tuple2 < T1 , T2 > ( _1 , _2 )","docstring":"/**\n * Returns a new Tuple2 of the given arguments.\n * @see t\n * @see X\n */"} {"signature":"fun < T1 , T2 , T3 > tupleOf ( _1 : T1 , _2 : T2 , _3 : T3 ) : Tuple3 < T1 , T2 , T3 >","body":"= Tuple3 < T1 , T2 , T3 > ( _1 , _2 , _3 )","docstring":"/**\n * Returns a new Tuple3 of the given arguments.\n * @see t\n * @see X\n */"} {"signature":"fun < T1 , T2 , T3 , T4 > tupleOf ( _1 : T1 , _2 : T2 , _3 : T3 , _4 : T4 ) : Tuple4 < T1 , T2 , T3 , T4 >","body":"= Tuple4 < T1 , T2 , T3 , T4 > ( _1 , _2 , _3 , _4 )","docstring":"/**\n * Returns a new Tuple4 of the given arguments.\n * @see t\n * @see X\n */"} {"signature":"fun < T1 , T2 , T3 , T4 , T5 > tupleOf ( _1 : T1 , _2 : T2 , _3 : T3 , _4 : T4 , _5 : T5 ) : Tuple5 < T1 , T2 , T3 , T4 , T5 >","body":"= Tuple5 < T1 , T2 , T3 , T4 , T5 > ( _1 , _2 , _3 , _4 , _5 )","docstring":"/**\n * Returns a new Tuple5 of the given arguments.\n * @see t\n * @see X\n */"} {"signature":"fun < T1 , T2 , T3 , T4 , T5 , T6 > tupleOf ( _1 : T1 , _2 : T2 , _3 : T3 , _4 : T4 , _5 : T5 , _6 : T6 ) : Tuple6 < T1 , T2 , T3 , T4 , T5 , T6 >","body":"= Tuple6 < T1 , T2 , T3 , T4 , T5 , T6 > ( _1 , _2 , _3 , _4 , _5 , _6 )","docstring":"/**\n * Returns a new Tuple6 of the given arguments.\n * @see t\n * @see X\n */"} {"signature":"fun < T1 , T2 , T3 , T4 , T5 , T6 , T7 > tupleOf ( _1 : T1 , _2 : T2 , _3 : T3 , _4 : T4 , _5 : T5 , _6 : T6 , _7 : T7 ) : Tuple7 < T1 , T2 , T3 , T4 , T5 , T6 , T7 >","body":"= Tuple7 < T1 , T2 , T3 , T4 , T5 , T6 , T7 > ( _1 , _2 , _3 , _4 , _5 , _6 , _7 )","docstring":"/**\n * Returns a new Tuple7 of the given arguments.\n * @see t\n * @see X\n */"} {"signature":"fun < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 > tupleOf ( _1 : T1 , _2 : T2 , _3 : T3 , _4 : T4 , _5 : T5 , _6 : T6 , _7 : T7 , _8 : T8 ) : Tuple8 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 >","body":"= Tuple8 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 > ( _1 , _2 , _3 , _4 , _5 , _6 , _7 , _8 )","docstring":"/**\n * Returns a new Tuple8 of the given arguments.\n * @see t\n * @see X\n */"} {"signature":"fun < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 > tupleOf ( _1 : T1 , _2 : T2 , _3 : T3 , _4 : T4 , _5 : T5 , _6 : T6 , _7 : T7 , _8 : T8 , _9 : T9 ) : Tuple9 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 >","body":"= Tuple9 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 > ( _1 , _2 , _3 , _4 , _5 , _6 , _7 , _8 , _9 )","docstring":"/**\n * Returns a new Tuple9 of the given arguments.\n * @see t\n * @see X\n */"} {"signature":"fun < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 > tupleOf ( _1 : T1 , _2 : T2 , _3 : T3 , _4 : T4 , _5 : T5 , _6 : T6 , _7 : T7 , _8 : T8 , _9 : T9 , _10 : T10 ) : Tuple10 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 >","body":"= Tuple10 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 > ( _1 , _2 , _3 , _4 , _5 , _6 , _7 , _8 , _9 , _10 )","docstring":"/**\n * Returns a new Tuple10 of the given arguments.\n * @see t\n * @see X\n */"} {"signature":"fun < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 > tupleOf ( _1 : T1 , _2 : T2 , _3 : T3 , _4 : T4 , _5 : T5 , _6 : T6 , _7 : T7 , _8 : T8 , _9 : T9 , _10 : T10 , _11 : T11 ) : Tuple11 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 >","body":"= Tuple11 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 > ( _1 , _2 , _3 , _4 , _5 , _6 , _7 , _8 , _9 , _10 , _11 )","docstring":"/**\n * Returns a new Tuple11 of the given arguments.\n * @see t\n * @see X\n */"} {"signature":"fun < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 , T12 > tupleOf ( _1 : T1 , _2 : T2 , _3 : T3 , _4 : T4 , _5 : T5 , _6 : T6 , _7 : T7 , _8 : T8 , _9 : T9 , _10 : T10 , _11 : T11 , _12 : T12 ) : Tuple12 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 , T12 >","body":"= Tuple12 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 , T12 > ( _1 , _2 , _3 , _4 , _5 , _6 , _7 , _8 , _9 , _10 , _11 , _12 )","docstring":"/**\n * Returns a new Tuple12 of the given arguments.\n * @see t\n * @see X\n */"} {"signature":"fun < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 , T12 , T13 > tupleOf ( _1 : T1 , _2 : T2 , _3 : T3 , _4 : T4 , _5 : T5 , _6 : T6 , _7 : T7 , _8 : T8 , _9 : T9 , _10 : T10 , _11 : T11 , _12 : T12 , _13 : T13 ) : Tuple13 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 , T12 , T13 >","body":"= Tuple13 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 , T12 , T13 > ( _1 , _2 , _3 , _4 , _5 , _6 , _7 , _8 , _9 , _10 , _11 , _12 , _13 )","docstring":"/**\n * Returns a new Tuple13 of the given arguments.\n * @see t\n * @see X\n */"} {"signature":"fun < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 , T12 , T13 , T14 > tupleOf ( _1 : T1 , _2 : T2 , _3 : T3 , _4 : T4 , _5 : T5 , _6 : T6 , _7 : T7 , _8 : T8 , _9 : T9 , _10 : T10 , _11 : T11 , _12 : T12 , _13 : T13 , _14 : T14 ) : Tuple14 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 , T12 , T13 , T14 >","body":"= Tuple14 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 , T12 , T13 , T14 > ( _1 , _2 , _3 , _4 , _5 , _6 , _7 , _8 , _9 , _10 , _11 , _12 , _13 , _14 )","docstring":"/**\n * Returns a new Tuple14 of the given arguments.\n * @see t\n * @see X\n */"} {"signature":"fun < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 , T12 , T13 , T14 , T15 > tupleOf ( _1 : T1 , _2 : T2 , _3 : T3 , _4 : T4 , _5 : T5 , _6 : T6 , _7 : T7 , _8 : T8 , _9 : T9 , _10 : T10 , _11 : T11 , _12 : T12 , _13 : T13 , _14 : T14 , _15 : T15 ) : Tuple15 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 , T12 , T13 , T14 , T15 >","body":"= Tuple15 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 , T12 , T13 , T14 , T15 > ( _1 , _2 , _3 , _4 , _5 , _6 , _7 , _8 , _9 , _10 , _11 , _12 , _13 , _14 , _15 )","docstring":"/**\n * Returns a new Tuple15 of the given arguments.\n * @see t\n * @see X\n */"} {"signature":"fun < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 , T12 , T13 , T14 , T15 , T16 > tupleOf ( _1 : T1 , _2 : T2 , _3 : T3 , _4 : T4 , _5 : T5 , _6 : T6 , _7 : T7 , _8 : T8 , _9 : T9 , _10 : T10 , _11 : T11 , _12 : T12 , _13 : T13 , _14 : T14 , _15 : T15 , _16 : T16 ) : Tuple16 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 , T12 , T13 , T14 , T15 , T16 >","body":"= Tuple16 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 , T12 , T13 , T14 , T15 , T16 > ( _1 , _2 , _3 , _4 , _5 , _6 , _7 , _8 , _9 , _10 , _11 , _12 , _13 , _14 , _15 , _16 )","docstring":"/**\n * Returns a new Tuple16 of the given arguments.\n * @see t\n * @see X\n */"} {"signature":"fun < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 , T12 , T13 , T14 , T15 , T16 , T17 > tupleOf ( _1 : T1 , _2 : T2 , _3 : T3 , _4 : T4 , _5 : T5 , _6 : T6 , _7 : T7 , _8 : T8 , _9 : T9 , _10 : T10 , _11 : T11 , _12 : T12 , _13 : T13 , _14 : T14 , _15 : T15 , _16 : T16 , _17 : T17 ) : Tuple17 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 , T12 , T13 , T14 , T15 , T16 , T17 >","body":"= Tuple17 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 , T12 , T13 , T14 , T15 , T16 , T17 > ( _1 , _2 , _3 , _4 , _5 , _6 , _7 , _8 , _9 , _10 , _11 , _12 , _13 , _14 , _15 , _16 , _17 )","docstring":"/**\n * Returns a new Tuple17 of the given arguments.\n * @see t\n * @see X\n */"} {"signature":"fun < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 , T12 , T13 , T14 , T15 , T16 , T17 , T18 > tupleOf ( _1 : T1 , _2 : T2 , _3 : T3 , _4 : T4 , _5 : T5 , _6 : T6 , _7 : T7 , _8 : T8 , _9 : T9 , _10 : T10 , _11 : T11 , _12 : T12 , _13 : T13 , _14 : T14 , _15 : T15 , _16 : T16 , _17 : T17 , _18 : T18 ) : Tuple18 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 , T12 , T13 , T14 , T15 , T16 , T17 , T18 >","body":"= Tuple18 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 , T12 , T13 , T14 , T15 , T16 , T17 , T18 > ( _1 , _2 , _3 , _4 , _5 , _6 , _7 , _8 , _9 , _10 , _11 , _12 , _13 , _14 , _15 , _16 , _17 , _18 )","docstring":"/**\n * Returns a new Tuple18 of the given arguments.\n * @see t\n * @see X\n */"} {"signature":"fun < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 , T12 , T13 , T14 , T15 , T16 , T17 , T18 , T19 > tupleOf ( _1 : T1 , _2 : T2 , _3 : T3 , _4 : T4 , _5 : T5 , _6 : T6 , _7 : T7 , _8 : T8 , _9 : T9 , _10 : T10 , _11 : T11 , _12 : T12 , _13 : T13 , _14 : T14 , _15 : T15 , _16 : T16 , _17 : T17 , _18 : T18 , _19 : T19 ) : Tuple19 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 , T12 , T13 , T14 , T15 , T16 , T17 , T18 , T19 >","body":"= Tuple19 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 , T12 , T13 , T14 , T15 , T16 , T17 , T18 , T19 > ( _1 , _2 , _3 , _4 , _5 , _6 , _7 , _8 , _9 , _10 , _11 , _12 , _13 , _14 , _15 , _16 , _17 , _18 , _19 )","docstring":"/**\n * Returns a new Tuple19 of the given arguments.\n * @see t\n * @see X\n */"} {"signature":"fun < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 , T12 , T13 , T14 , T15 , T16 , T17 , T18 , T19 , T20 > tupleOf ( _1 : T1 , _2 : T2 , _3 : T3 , _4 : T4 , _5 : T5 , _6 : T6 , _7 : T7 , _8 : T8 , _9 : T9 , _10 : T10 , _11 : T11 , _12 : T12 , _13 : T13 , _14 : T14 , _15 : T15 , _16 : T16 , _17 : T17 , _18 : T18 , _19 : T19 , _20 : T20 ) : Tuple20 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 , T12 , T13 , T14 , T15 , T16 , T17 , T18 , T19 , T20 >","body":"= Tuple20 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 , T12 , T13 , T14 , T15 , T16 , T17 , T18 , T19 , T20 > ( _1 , _2 , _3 , _4 , _5 , _6 , _7 , _8 , _9 , _10 , _11 , _12 , _13 , _14 , _15 , _16 , _17 , _18 , _19 , _20 )","docstring":"/**\n * Returns a new Tuple20 of the given arguments.\n * @see t\n * @see X\n */"} {"signature":"fun < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 , T12 , T13 , T14 , T15 , T16 , T17 , T18 , T19 , T20 , T21 > tupleOf ( _1 : T1 , _2 : T2 , _3 : T3 , _4 : T4 , _5 : T5 , _6 : T6 , _7 : T7 , _8 : T8 , _9 : T9 , _10 : T10 , _11 : T11 , _12 : T12 , _13 : T13 , _14 : T14 , _15 : T15 , _16 : T16 , _17 : T17 , _18 : T18 , _19 : T19 , _20 : T20 , _21 : T21 ) : Tuple21 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 , T12 , T13 , T14 , T15 , T16 , T17 , T18 , T19 , T20 , T21 >","body":"= Tuple21 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 , T12 , T13 , T14 , T15 , T16 , T17 , T18 , T19 , T20 , T21 > ( _1 , _2 , _3 , _4 , _5 , _6 , _7 , _8 , _9 , _10 , _11 , _12 , _13 , _14 , _15 , _16 , _17 , _18 , _19 , _20 , _21 )","docstring":"/**\n * Returns a new Tuple21 of the given arguments.\n * @see t\n * @see X\n */"} {"signature":"fun < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 , T12 , T13 , T14 , T15 , T16 , T17 , T18 , T19 , T20 , T21 , T22 > tupleOf ( _1 : T1 , _2 : T2 , _3 : T3 , _4 : T4 , _5 : T5 , _6 : T6 , _7 : T7 , _8 : T8 , _9 : T9 , _10 : T10 , _11 : T11 , _12 : T12 , _13 : T13 , _14 : T14 , _15 : T15 , _16 : T16 , _17 : T17 , _18 : T18 , _19 : T19 , _20 : T20 , _21 : T21 , _22 : T22 ) : Tuple22 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 , T12 , T13 , T14 , T15 , T16 , T17 , T18 , T19 , T20 , T21 , T22 >","body":"= Tuple22 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 , T12 , T13 , T14 , T15 , T16 , T17 , T18 , T19 , T20 , T21 , T22 > ( _1 , _2 , _3 , _4 , _5 , _6 , _7 , _8 , _9 , _10 , _11 , _12 , _13 , _14 , _15 , _16 , _17 , _18 , _19 , _20 , _21 , _22 )","docstring":"/**\n * Returns a new Tuple22 of the given arguments.\n * @see t\n * @see X\n */"} {"signature":"fun t ( ) : EmptyTuple","body":"= EmptyTuple","docstring":"/**\n * Returns the instance of Tuple0.\n * @see tupleOf\n */"} {"signature":"fun < T1 > t ( _1 : T1 ) : Tuple1 < T1 >","body":"= Tuple1 < T1 > ( _1 )","docstring":"/**\n * Returns a new Tuple1 of the given arguments.\n * @see tupleOf\n * @see X\n */"} {"signature":"fun < T1 , T2 > t ( _1 : T1 , _2 : T2 ) : Tuple2 < T1 , T2 >","body":"= Tuple2 < T1 , T2 > ( _1 , _2 )","docstring":"/**\n * Returns a new Tuple2 of the given arguments.\n * @see tupleOf\n * @see X\n */"} {"signature":"fun < T1 , T2 , T3 > t ( _1 : T1 , _2 : T2 , _3 : T3 ) : Tuple3 < T1 , T2 , T3 >","body":"= Tuple3 < T1 , T2 , T3 > ( _1 , _2 , _3 )","docstring":"/**\n * Returns a new Tuple3 of the given arguments.\n * @see tupleOf\n * @see X\n */"} {"signature":"fun < T1 , T2 , T3 , T4 > t ( _1 : T1 , _2 : T2 , _3 : T3 , _4 : T4 ) : Tuple4 < T1 , T2 , T3 , T4 >","body":"= Tuple4 < T1 , T2 , T3 , T4 > ( _1 , _2 , _3 , _4 )","docstring":"/**\n * Returns a new Tuple4 of the given arguments.\n * @see tupleOf\n * @see X\n */"} {"signature":"fun < T1 , T2 , T3 , T4 , T5 > t ( _1 : T1 , _2 : T2 , _3 : T3 , _4 : T4 , _5 : T5 ) : Tuple5 < T1 , T2 , T3 , T4 , T5 >","body":"= Tuple5 < T1 , T2 , T3 , T4 , T5 > ( _1 , _2 , _3 , _4 , _5 )","docstring":"/**\n * Returns a new Tuple5 of the given arguments.\n * @see tupleOf\n * @see X\n */"} {"signature":"fun < T1 , T2 , T3 , T4 , T5 , T6 > t ( _1 : T1 , _2 : T2 , _3 : T3 , _4 : T4 , _5 : T5 , _6 : T6 ) : Tuple6 < T1 , T2 , T3 , T4 , T5 , T6 >","body":"= Tuple6 < T1 , T2 , T3 , T4 , T5 , T6 > ( _1 , _2 , _3 , _4 , _5 , _6 )","docstring":"/**\n * Returns a new Tuple6 of the given arguments.\n * @see tupleOf\n * @see X\n */"} {"signature":"fun < T1 , T2 , T3 , T4 , T5 , T6 , T7 > t ( _1 : T1 , _2 : T2 , _3 : T3 , _4 : T4 , _5 : T5 , _6 : T6 , _7 : T7 ) : Tuple7 < T1 , T2 , T3 , T4 , T5 , T6 , T7 >","body":"= Tuple7 < T1 , T2 , T3 , T4 , T5 , T6 , T7 > ( _1 , _2 , _3 , _4 , _5 , _6 , _7 )","docstring":"/**\n * Returns a new Tuple7 of the given arguments.\n * @see tupleOf\n * @see X\n */"} {"signature":"fun < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 > t ( _1 : T1 , _2 : T2 , _3 : T3 , _4 : T4 , _5 : T5 , _6 : T6 , _7 : T7 , _8 : T8 ) : Tuple8 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 >","body":"= Tuple8 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 > ( _1 , _2 , _3 , _4 , _5 , _6 , _7 , _8 )","docstring":"/**\n * Returns a new Tuple8 of the given arguments.\n * @see tupleOf\n * @see X\n */"} {"signature":"fun < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 > t ( _1 : T1 , _2 : T2 , _3 : T3 , _4 : T4 , _5 : T5 , _6 : T6 , _7 : T7 , _8 : T8 , _9 : T9 ) : Tuple9 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 >","body":"= Tuple9 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 > ( _1 , _2 , _3 , _4 , _5 , _6 , _7 , _8 , _9 )","docstring":"/**\n * Returns a new Tuple9 of the given arguments.\n * @see tupleOf\n * @see X\n */"} {"signature":"fun < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 > t ( _1 : T1 , _2 : T2 , _3 : T3 , _4 : T4 , _5 : T5 , _6 : T6 , _7 : T7 , _8 : T8 , _9 : T9 , _10 : T10 ) : Tuple10 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 >","body":"= Tuple10 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 > ( _1 , _2 , _3 , _4 , _5 , _6 , _7 , _8 , _9 , _10 )","docstring":"/**\n * Returns a new Tuple10 of the given arguments.\n * @see tupleOf\n * @see X\n */"} {"signature":"fun < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 > t ( _1 : T1 , _2 : T2 , _3 : T3 , _4 : T4 , _5 : T5 , _6 : T6 , _7 : T7 , _8 : T8 , _9 : T9 , _10 : T10 , _11 : T11 ) : Tuple11 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 >","body":"= Tuple11 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 > ( _1 , _2 , _3 , _4 , _5 , _6 , _7 , _8 , _9 , _10 , _11 )","docstring":"/**\n * Returns a new Tuple11 of the given arguments.\n * @see tupleOf\n * @see X\n */"} {"signature":"fun < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 , T12 > t ( _1 : T1 , _2 : T2 , _3 : T3 , _4 : T4 , _5 : T5 , _6 : T6 , _7 : T7 , _8 : T8 , _9 : T9 , _10 : T10 , _11 : T11 , _12 : T12 ) : Tuple12 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 , T12 >","body":"= Tuple12 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 , T12 > ( _1 , _2 , _3 , _4 , _5 , _6 , _7 , _8 , _9 , _10 , _11 , _12 )","docstring":"/**\n * Returns a new Tuple12 of the given arguments.\n * @see tupleOf\n * @see X\n */"} {"signature":"fun < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 , T12 , T13 > t ( _1 : T1 , _2 : T2 , _3 : T3 , _4 : T4 , _5 : T5 , _6 : T6 , _7 : T7 , _8 : T8 , _9 : T9 , _10 : T10 , _11 : T11 , _12 : T12 , _13 : T13 ) : Tuple13 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 , T12 , T13 >","body":"= Tuple13 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 , T12 , T13 > ( _1 , _2 , _3 , _4 , _5 , _6 , _7 , _8 , _9 , _10 , _11 , _12 , _13 )","docstring":"/**\n * Returns a new Tuple13 of the given arguments.\n * @see tupleOf\n * @see X\n */"} {"signature":"fun < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 , T12 , T13 , T14 > t ( _1 : T1 , _2 : T2 , _3 : T3 , _4 : T4 , _5 : T5 , _6 : T6 , _7 : T7 , _8 : T8 , _9 : T9 , _10 : T10 , _11 : T11 , _12 : T12 , _13 : T13 , _14 : T14 ) : Tuple14 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 , T12 , T13 , T14 >","body":"= Tuple14 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 , T12 , T13 , T14 > ( _1 , _2 , _3 , _4 , _5 , _6 , _7 , _8 , _9 , _10 , _11 , _12 , _13 , _14 )","docstring":"/**\n * Returns a new Tuple14 of the given arguments.\n * @see tupleOf\n * @see X\n */"} {"signature":"fun < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 , T12 , T13 , T14 , T15 > t ( _1 : T1 , _2 : T2 , _3 : T3 , _4 : T4 , _5 : T5 , _6 : T6 , _7 : T7 , _8 : T8 , _9 : T9 , _10 : T10 , _11 : T11 , _12 : T12 , _13 : T13 , _14 : T14 , _15 : T15 ) : Tuple15 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 , T12 , T13 , T14 , T15 >","body":"= Tuple15 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 , T12 , T13 , T14 , T15 > ( _1 , _2 , _3 , _4 , _5 , _6 , _7 , _8 , _9 , _10 , _11 , _12 , _13 , _14 , _15 )","docstring":"/**\n * Returns a new Tuple15 of the given arguments.\n * @see tupleOf\n * @see X\n */"} {"signature":"fun < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 , T12 , T13 , T14 , T15 , T16 > t ( _1 : T1 , _2 : T2 , _3 : T3 , _4 : T4 , _5 : T5 , _6 : T6 , _7 : T7 , _8 : T8 , _9 : T9 , _10 : T10 , _11 : T11 , _12 : T12 , _13 : T13 , _14 : T14 , _15 : T15 , _16 : T16 ) : Tuple16 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 , T12 , T13 , T14 , T15 , T16 >","body":"= Tuple16 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 , T12 , T13 , T14 , T15 , T16 > ( _1 , _2 , _3 , _4 , _5 , _6 , _7 , _8 , _9 , _10 , _11 , _12 , _13 , _14 , _15 , _16 )","docstring":"/**\n * Returns a new Tuple16 of the given arguments.\n * @see tupleOf\n * @see X\n */"} {"signature":"fun < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 , T12 , T13 , T14 , T15 , T16 , T17 > t ( _1 : T1 , _2 : T2 , _3 : T3 , _4 : T4 , _5 : T5 , _6 : T6 , _7 : T7 , _8 : T8 , _9 : T9 , _10 : T10 , _11 : T11 , _12 : T12 , _13 : T13 , _14 : T14 , _15 : T15 , _16 : T16 , _17 : T17 ) : Tuple17 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 , T12 , T13 , T14 , T15 , T16 , T17 >","body":"= Tuple17 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 , T12 , T13 , T14 , T15 , T16 , T17 > ( _1 , _2 , _3 , _4 , _5 , _6 , _7 , _8 , _9 , _10 , _11 , _12 , _13 , _14 , _15 , _16 , _17 )","docstring":"/**\n * Returns a new Tuple17 of the given arguments.\n * @see tupleOf\n * @see X\n */"} {"signature":"fun < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 , T12 , T13 , T14 , T15 , T16 , T17 , T18 > t ( _1 : T1 , _2 : T2 , _3 : T3 , _4 : T4 , _5 : T5 , _6 : T6 , _7 : T7 , _8 : T8 , _9 : T9 , _10 : T10 , _11 : T11 , _12 : T12 , _13 : T13 , _14 : T14 , _15 : T15 , _16 : T16 , _17 : T17 , _18 : T18 ) : Tuple18 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 , T12 , T13 , T14 , T15 , T16 , T17 , T18 >","body":"= Tuple18 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 , T12 , T13 , T14 , T15 , T16 , T17 , T18 > ( _1 , _2 , _3 , _4 , _5 , _6 , _7 , _8 , _9 , _10 , _11 , _12 , _13 , _14 , _15 , _16 , _17 , _18 )","docstring":"/**\n * Returns a new Tuple18 of the given arguments.\n * @see tupleOf\n * @see X\n */"} {"signature":"fun < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 , T12 , T13 , T14 , T15 , T16 , T17 , T18 , T19 > t ( _1 : T1 , _2 : T2 , _3 : T3 , _4 : T4 , _5 : T5 , _6 : T6 , _7 : T7 , _8 : T8 , _9 : T9 , _10 : T10 , _11 : T11 , _12 : T12 , _13 : T13 , _14 : T14 , _15 : T15 , _16 : T16 , _17 : T17 , _18 : T18 , _19 : T19 ) : Tuple19 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 , T12 , T13 , T14 , T15 , T16 , T17 , T18 , T19 >","body":"= Tuple19 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 , T12 , T13 , T14 , T15 , T16 , T17 , T18 , T19 > ( _1 , _2 , _3 , _4 , _5 , _6 , _7 , _8 , _9 , _10 , _11 , _12 , _13 , _14 , _15 , _16 , _17 , _18 , _19 )","docstring":"/**\n * Returns a new Tuple19 of the given arguments.\n * @see tupleOf\n * @see X\n */"} {"signature":"fun < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 , T12 , T13 , T14 , T15 , T16 , T17 , T18 , T19 , T20 > t ( _1 : T1 , _2 : T2 , _3 : T3 , _4 : T4 , _5 : T5 , _6 : T6 , _7 : T7 , _8 : T8 , _9 : T9 , _10 : T10 , _11 : T11 , _12 : T12 , _13 : T13 , _14 : T14 , _15 : T15 , _16 : T16 , _17 : T17 , _18 : T18 , _19 : T19 , _20 : T20 ) : Tuple20 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 , T12 , T13 , T14 , T15 , T16 , T17 , T18 , T19 , T20 >","body":"= Tuple20 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 , T12 , T13 , T14 , T15 , T16 , T17 , T18 , T19 , T20 > ( _1 , _2 , _3 , _4 , _5 , _6 , _7 , _8 , _9 , _10 , _11 , _12 , _13 , _14 , _15 , _16 , _17 , _18 , _19 , _20 )","docstring":"/**\n * Returns a new Tuple20 of the given arguments.\n * @see tupleOf\n * @see X\n */"} {"signature":"fun < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 , T12 , T13 , T14 , T15 , T16 , T17 , T18 , T19 , T20 , T21 > t ( _1 : T1 , _2 : T2 , _3 : T3 , _4 : T4 , _5 : T5 , _6 : T6 , _7 : T7 , _8 : T8 , _9 : T9 , _10 : T10 , _11 : T11 , _12 : T12 , _13 : T13 , _14 : T14 , _15 : T15 , _16 : T16 , _17 : T17 , _18 : T18 , _19 : T19 , _20 : T20 , _21 : T21 ) : Tuple21 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 , T12 , T13 , T14 , T15 , T16 , T17 , T18 , T19 , T20 , T21 >","body":"= Tuple21 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 , T12 , T13 , T14 , T15 , T16 , T17 , T18 , T19 , T20 , T21 > ( _1 , _2 , _3 , _4 , _5 , _6 , _7 , _8 , _9 , _10 , _11 , _12 , _13 , _14 , _15 , _16 , _17 , _18 , _19 , _20 , _21 )","docstring":"/**\n * Returns a new Tuple21 of the given arguments.\n * @see tupleOf\n * @see X\n */"} {"signature":"fun < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 , T12 , T13 , T14 , T15 , T16 , T17 , T18 , T19 , T20 , T21 , T22 > t ( _1 : T1 , _2 : T2 , _3 : T3 , _4 : T4 , _5 : T5 , _6 : T6 , _7 : T7 , _8 : T8 , _9 : T9 , _10 : T10 , _11 : T11 , _12 : T12 , _13 : T13 , _14 : T14 , _15 : T15 , _16 : T16 , _17 : T17 , _18 : T18 , _19 : T19 , _20 : T20 , _21 : T21 , _22 : T22 ) : Tuple22 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 , T12 , T13 , T14 , T15 , T16 , T17 , T18 , T19 , T20 , T21 , T22 >","body":"= Tuple22 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 , T12 , T13 , T14 , T15 , T16 , T17 , T18 , T19 , T20 , T21 , T22 > ( _1 , _2 , _3 , _4 , _5 , _6 , _7 , _8 , _9 , _10 , _11 , _12 , _13 , _14 , _15 , _16 , _17 , _18 , _19 , _20 , _21 , _22 )","docstring":"/**\n * Returns a new Tuple22 of the given arguments.\n * @see tupleOf\n * @see X\n */"} {"signature":"private fun findAvailableConstructors ( scope : FirScope , targetClassName : Name ) : List < FirFunctionSymbol < * > >","body":"{ val classLikeSymbol = scope . findFirstClassifierByName ( targetClassName ) as? FirClassLikeSymbol ? : return emptyList ( ) val constructors = ( classLikeSymbol as? FirClassSymbol ) ? . declarationSymbols ? . filterIsInstance < FirConstructorSymbol > ( ) . orEmpty ( ) val samConstructor = classLikeSymbol . getSamConstructor ( ) return constructors + listOfNotNull ( samConstructor ) }","docstring":"/**\n * Finds constructors with a given [targetClassName] available within the [scope], including SAM constructors\n * (which are not explicitly declared in the class).\n *\n * Includes type-aliased constructors too if typealias confirms to the [targetClassName].\n *\n * Do not confuse with constructors **declared** in the scope (see [FirScope.processDeclaredConstructors]).\n */"} {"signature":"private fun FirClassLikeSymbol < * > . hasTypeParameterFromParent ( ) : Boolean","body":"= typeParameterSymbols . orEmpty ( ) . any { it . containingDeclarationSymbol != this }","docstring":"/**\n * Returns true if the class symbol has a type parameter that is supposed to be provided for its parent class.\n *\n * Example:\n * class Outer {\n * inner class Inner // Inner has an implicit type parameter `T`.\n * }\n */"} {"signature":"private fun FirScope . isScopeForClassCloserThanAnotherScopeForClass ( another : FirScope , from : KtClassOrObject ) : Boolean","body":"{ if ( ! isScopeForClass ( ) || ! another . isScopeForClass ( ) ) return false if ( this == another ) return false val classId = correspondingClassIdIfExists ( ) val classIdOfAnother = another . correspondingClassIdIfExists ( ) if ( classId == classIdOfAnother ) return false val candidates = setOfNotNull ( classId , classIdOfAnother , classId . idWithoutCompanion ( ) , classIdOfAnother . idWithoutCompanion ( ) ) val closestClassId = findMostInnerClassMatchingId ( from , candidates ) return closestClassId == classId || ( closestClassId != classIdOfAnother && closestClassId == classId . idWithoutCompanion ( ) ) }","docstring":"/**\n * Assuming that both this [FirScope] and [another] are [FirNestedClassifierScope] or [FirClassUseSiteMemberScope] and both of them\n * are surrounding [from], returns whether this [FirScope] is closer than [another] based on the distance from [from].\n *\n * If one of this [FirScope] and [another] is not [FirNestedClassifierScope] or [FirClassUseSiteMemberScope], it returns false.\n *\n * Example:\n * class Outer { // scope1 ClassId = Other\n * class Inner { // scope2 ClassId = Other.Inner\n * fun foo() {\n * // Distance to scopes for classes from in the order from the closest:\n * // scope2 -> scope3 -> scope1\n * \n * }\n * companion object { // scope3 ClassId = Other.Inner.Companion\n * }\n * }\n * }\n *\n * This function determines the distance based on [ClassId].\n */"} {"signature":"private fun findMostInnerClassMatchingId ( innerClass : KtClassOrObject , candidates : Set < ClassId > ) : ClassId ?","body":"{ var classInNestedClass : KtClassOrObject ? = innerClass while ( classInNestedClass != null ) { val containingClassId = classInNestedClass . getClassId ( ) if ( containingClassId in candidates ) return containingClassId classInNestedClass = classInNestedClass . findClassOrObjectParent ( ) } return null }","docstring":"/**\n * Travels all containing classes of [innerClass] and finds the one matching ClassId with one of [candidates]. Returns the matching\n * ClassId. If it does not have a matching ClassId, it returns null.\n */"} {"signature":"private fun FirScope . isWiderThan ( another : FirScope ) : Boolean","body":"= toPartialOrder ( ) . scopeDistanceLevel > another . toPartialOrder ( ) . scopeDistanceLevel","docstring":"/**\n * Returns whether this [FirScope] is a scope wider than [another] based on the above [PartialOrderOfScope] or not.\n */"} {"signature":"private fun List < FirScope > . hasScopeCloserThan ( base : FirScope , from : KtElement )","body":"= any { scope -> if ( scope . isScopeForClass ( ) && base . isScopeForClass ( ) ) { val classContainingFrom = from . findClassOrObjectParent ( ) ? : return@any false return@any scope . isScopeForClassCloserThanAnotherScopeForClass ( base , classContainingFrom ) } base . isWiderThan ( scope ) }","docstring":"/**\n * Assuming that all scopes in this List and [base] are surrounding [from], returns whether an element of\n * this List is closer than [base] based on the distance from [from].\n */"} {"signature":"private fun importDirectiveForDifferentSymbolWithSameNameIsPresent ( classId : ClassId ) : Boolean","body":"{ val importDirectivesWithSameImportedFqName = containingFile . collectDescendantsOfType { importedDirective : KtImportDirective -> importedDirective . importedFqName ? . shortName ( ) == classId . shortClassName } return importDirectivesWithSameImportedFqName . isNotEmpty ( ) && importDirectivesWithSameImportedFqName . all { it . importedFqName != classId . asSingleFqName ( ) } }","docstring":"/**\n * Returns true if [containingFile] has a [KtImportDirective] whose imported FqName is the same as [classId] but references a different\n * symbol.\n */"} {"signature":"private fun findClassifierQualifierToShorten ( wholeQualifierClassId : ClassId , wholeQualifierElement : KtElement , ) : ElementToShorten ?","body":"{ val positionScopes = shorteningContext . findScopesAtPosition ( wholeQualifierElement , getNamesToImport ( ) , towerContextProvider , withImplicitReceivers = false , ) ? : return null val allClassIds = wholeQualifierClassId . outerClassesWithSelf val allQualifiedElements = wholeQualifierElement . qualifiedElementsWithSelf for ( ( classId , element ) in allClassIds . zip ( allQualifiedElements ) ) { if ( ! element . inSelection ) continue shortenClassifierQualifier ( positionScopes , classId , element ) ? . let { return it } } val lastQualifier = allQualifiedElements . last ( ) if ( ! lastQualifier . inSelection ) return null return findFakePackageToShorten ( lastQualifier ) }","docstring":"/**\n * Finds the longest qualifier in [wholeQualifierElement] which can be safely shortened in the [positionScopes].\n * [wholeQualifierClassId] is supposed to reflect the class which is referenced by the [wholeQualifierElement].\n *\n * N.B. Even if the [wholeQualifierElement] is not strictly in the [selection],\n * some outer part of it might be, and we want to shorten that.\n * So we have to check all the outer qualifiers.\n */"} {"signature":"private fun importBreaksExistingReferences ( classToImport : ClassId , importAllInParent : Boolean ) : Boolean","body":"{ return importAffectsUsagesOfClassesWithSameName ( classToImport , importAllInParent ) }","docstring":"/**\n * Returns `true` if adding [classToImport] import to the [file] might alter or break the\n * resolve of existing references in the file.\n *\n * N.B.: At the moment it might have both false positives and false negatives, since it does not\n * check all possible references.\n */"} {"signature":"private fun importBreaksExistingReferences ( callableToImport : FirCallableSymbol < * > , importAllInParent : Boolean ) : Boolean","body":"{ if ( callableToImport is FirConstructorSymbol ) { val classToImport = callableToImport . classIdIfExists if ( classToImport != null ) { return importAffectsUsagesOfClassesWithSameName ( classToImport , importAllInParent ) } } return false }","docstring":"/**\n * Same as above, but for more general callable symbols.\n *\n * Currently only checks constructor calls, assuming `true` for everything else.\n */"} {"signature":"private fun KtExpression . isCompanionMemberUsedForEnumEntryInit ( resolvedSymbol : FirCallableSymbol < * > ) : Boolean","body":"{ val enumEntry = getNonStrictParentOfType < KtEnumEntry > ( ) ? : return false val firEnumEntry = enumEntry . resolveToFirSymbol ( firResolveSession ) as? FirEnumEntrySymbol ? : return false val classNameOfResolvedSymbol = resolvedSymbol . callableId . className ? : return false return firEnumEntry . callableId . className == classNameOfResolvedSymbol . parent ( ) && classNameOfResolvedSymbol . shortName ( ) == SpecialNames . DEFAULT_NAME_FOR_COMPANION_OBJECT }","docstring":"/**\n * Returns whether a member of companion is used to initialize the enum entry or not. For example,\n * enum class C(val i: Int) {\n * ONE(C.K) // C.ONE uses C.K for initialization\n * ;\n * companion object {\n * const val K = 1\n * }\n * }\n */"} {"signature":"private fun shortenIfAlreadyImported ( firQualifiedAccess : FirQualifiedAccessExpression , calledSymbol : FirCallableSymbol < * > , expressionInScope : KtExpression , ) : Boolean","body":"{ if ( expressionInScope . isCompanionMemberUsedForEnumEntryInit ( calledSymbol ) ) return false val candidates = resolveUnqualifiedAccess ( firQualifiedAccess , calledSymbol . name , expressionInScope ) val scopeForQualifiedAccess = candidates . findScopeForSymbol ( calledSymbol ) ? : return false if ( candidates . mapNotNull { it . candidate . originScope } . hasScopeCloserThan ( scopeForQualifiedAccess , expressionInScope ) ) return false val candidatesWithinSamePriorityScopes = candidates . filter { it . candidate . originScope == scopeForQualifiedAccess } return candidatesWithinSamePriorityScopes . isEmpty ( ) || candidatesWithinSamePriorityScopes . singleOrNull ( ) ? . isInBestCandidates == true }","docstring":"/**\n * Returns whether it is fine to shorten [firQualifiedAccess] or not.\n *\n * @param firQualifiedAccess FIR for the shortening target expression\n * @param calledSymbol The symbol referenced by the qualified access expression\n * @param expressionInScope An expression under the same scope as the shortening target expression\n *\n * The decision has two steps:\n * 1. Collect all candidates matching [firQualifiedAccess]\n * - We use `AllCandidatesResolver(shorteningContext.analysisSession.useSiteSession).getAllCandidates( .. fake FIR .. )`. See\n * [resolveUnqualifiedAccess] above.\n * 2. Check whether the candidate with the highest priority based on the distance to the scope from [expressionInScope] is the same\n * as [calledSymbol] ot not\n * - We use [hasScopeCloserThan] to determine the distance to the scope\n */"} {"signature":"private fun getSingleUnambiguousCandidate ( namedReference : FirErrorNamedReference ) : FirCallableSymbol < * > ?","body":"{ val coneAmbiguityError = namedReference . diagnostic as? ConeAmbiguityError ? : return null val candidates = coneAmbiguityError . candidates . map { it . symbol as FirCallableSymbol < * > } require ( candidates . isNotEmpty ( ) ) { \"\" } val distinctCandidates = candidates . distinctBy { it . callableId } return distinctCandidates . singleOrNull ( ) ? : errorWithAttachment ( \"\" ) { withEntry ( \"\" , distinctCandidates . map { it . callableId . asSingleFqName ( ) } . joinToString ( ) ) } }","docstring":"/**\n * If [namedReference] is ambiguous and all candidates point to the callables with same callableId,\n * returns the first candidate; otherwise returns null.\n */"} {"signature":"private fun FirThisReference . referencesClosestReceiver ( ) : Boolean","body":"{ require ( ! isImplicit ) { \"\" } if ( labelName == null ) return true val psi = psi as? KtThisExpression ? : return false val implicitReceivers = towerContextProvider . getClosestAvailableParentContext ( psi ) ? . implicitReceiverStack ? : return false val closestImplicitReceiver = implicitReceivers . lastOrNull ( ) ? : return false return boundSymbol == closestImplicitReceiver . boundSymbol }","docstring":"/**\n * Checks whether `this` expression references the closest receiver in the current position.\n *\n * If it is the case, then we can safely remove the label from it (if it exists).\n */"} {"signature":"private fun thisLabelShortenStrategy ( thisReference : FirThisReference ) : ShortenStrategy","body":"{ val referencedSymbol = thisReference . boundSymbol val strategy = when ( referencedSymbol ) { is FirClassLikeSymbol < * > -> classShortenStrategy ( referencedSymbol ) is FirCallableSymbol < * > -> callableShortenStrategy ( referencedSymbol ) else -> ShortenStrategy . DO_NOT_SHORTEN } return strategy }","docstring":"/**\n * This method intentionally mirrors the appearance\n * of the [classShortenStrategy] and [callableShortenStrategy] filters,\n * but ATM we don't have a way to properly handle\n * [FirThisReference]s through the existing filters.\n *\n * We need a better way to decide shortening strategy\n * for labeled and regular `this` expressions (KT-63555).\n */"} {"signature":"private fun removeRedundantElements ( qualifier : KtElement )","body":"{ typesToShorten . removeAll { it . element . qualifier ? . isInsideOf ( qualifier ) == true } qualifiersToShorten . removeAll { it . element . receiverExpression . isInsideOf ( qualifier ) } }","docstring":"/**\n * Remove entries from [typesToShorten] and [qualifiersToShorten] if their qualifiers will be shortened\n * when we shorten [qualifier].\n */"} {"signature":"private fun KtElement . findClassOrObjectParent ( ) : KtClassOrObject ?","body":"= parentOfType ( )","docstring":"/**\n * N.B. We don't use [containingClassOrObject] because it works only for [KtDeclaration]s,\n * and also check only the immediate (direct) parent.\n *\n * For this function, we want to find the parent [KtClassOrObject] declaration no matter\n * how far it is from the element.\n */"} {"signature":"public fun complete ( ) : Boolean","body":"public fun complete ( ) : Boolean","docstring":"/**\n * Completes this job. The result is `true` if this job was completed as a result of this invocation and\n * `false` otherwise (if it was already completed).\n *\n * Subsequent invocations of this function have no effect and always produce `false`.\n *\n * This function transitions this job into _completed_ state if it was not completed or cancelled yet.\n * However, that if this job has children, then it transitions into _completing_ state and becomes _complete_\n * once all its children are [complete][isCompleted]. See [Job] for details.\n */"} {"signature":"public fun completeExceptionally ( exception : Throwable ) : Boolean","body":"public fun completeExceptionally ( exception : Throwable ) : Boolean","docstring":"/**\n * Completes this job exceptionally with a given [exception]. The result is `true` if this job was\n * completed as a result of this invocation and `false` otherwise (if it was already completed).\n * [exception] parameter is used as an additional debug information that is not handled by any exception handlers.\n *\n * Subsequent invocations of this function have no effect and always produce `false`.\n *\n * This function transitions this job into _cancelled_ state if it was not completed or cancelled yet.\n * However, that if this job has children, then it transitions into _cancelling_ state and becomes _cancelled_\n * once all its children are [complete][isCompleted]. See [Job] for details.\n *\n * Its responsibility of the caller to properly handle and report the given [exception], all job's children will receive\n * a [CancellationException] with the [exception] as a cause for the sake of diagnostic.\n */"} {"signature":"@ DelicateDeclarationStorageApi fun forEachCachedDeclarationSymbol ( block : ( IrSymbol ) -> Unit )","body":"{ functionCache . values . forEachWithRemapping ( symbolsMappingForLazyClasses :: remapFunctionSymbol , block ) constructorCache . values . forEach ( block ) propertyCache . normal . values . forEachWithRemapping ( symbolsMappingForLazyClasses :: remapPropertySymbol , block ) propertyCache . synthetic . values . forEachWithRemapping ( symbolsMappingForLazyClasses :: remapPropertySymbol , block ) getterForPropertyCache . values . forEachWithRemapping ( symbolsMappingForLazyClasses :: remapFunctionSymbol , block ) setterForPropertyCache . values . forEachWithRemapping ( symbolsMappingForLazyClasses :: remapFunctionSymbol , block ) backingFieldForPropertyCache . values . forEach ( block ) propertyForBackingFieldCache . values . forEach ( block ) delegateVariableForPropertyCache . values . forEach ( block ) }","docstring":"/**\n * This function is quite messy and doesn't have a good contract of what exactly is traversed.\n * The basic idea is to traverse the symbols which can be reasonably referenced from other modules.\n *\n * Be careful when using it, and avoid it, except really needed.\n */"} {"signature":"fun createAndCacheIrFunction ( function : FirFunction , irParent : IrDeclarationParent ? , predefinedOrigin : IrDeclarationOrigin ? = null , isLocal : Boolean = false , fakeOverrideOwnerLookupTag : ConeClassLikeLookupTag ? = null , allowLazyDeclarationsCreation : Boolean = false ) : IrSimpleFunction","body":"{ val symbol = getIrFunctionSymbol ( function . symbol , fakeOverrideOwnerLookupTag , isLocal ) as IrSimpleFunctionSymbol return callablesGenerator . createIrFunction ( function , irParent , symbol , predefinedOrigin , isLocal = isLocal , fakeOverrideOwnerLookupTag = fakeOverrideOwnerLookupTag , allowLazyDeclarationsCreation ) }","docstring":"/**\n * @param allowLazyDeclarationsCreation should be passed only during fake-override generation\n */"} {"signature":"@ LeakedDeclarationCaches internal fun generateUnboundFakeOverrides ( )","body":"{ for ( ( identifier , symbol ) in irForFirSessionDependantDeclarationMap ) { if ( symbol . isBound ) continue val ( originalSymbol , dispatchReceiverLookupTag , _ ) = identifier generateDeclaration ( originalSymbol , dispatchReceiverLookupTag ) } }","docstring":"/**\n * This function iterates over all f/o symbols created in declaration storage and binds all unbound symbols\n *\n * Usually all symbols are bound after fir2ir conversion is over, but there is a case in MPP scenario when some fake-override\n * for common classes appears only during conversion of platform session:\n *\n * // MODULE: common\n * expect interface A\n *\n * interface B : A {\n * // f/o fun foo() // (1)\n * }\n *\n * // MODULE: platform()()(common)\n * actual interface A {\n * fun foo() // (2)\n * }\n *\n * fun test(b: B) {\n * b.foo() // (3)\n * }\n *\n * Here during common module conversion there is no `foo` function in scope of class B, so (1) is not generated\n * During conversion of function test we reference symbol for (1) at line (3), so this symbol is created. But\n * there is no code which generate actual IR for this symbol, because IR for f/o is generated only during\n * conversion of corresponing class (and `B` is already converted)\n *\n * So to fix this issue we need to call this method after conversion of platform module\n */"} {"signature":"@ LeakedDeclarationCaches internal fun fillUnboundSymbols ( )","body":"{ fillUnboundSymbols ( functionCache ) fillUnboundSymbols ( propertyCache . normal ) fillUnboundSymbols ( propertyCache . synthetic ) }","docstring":"/**\n * This function iterates over all non f/o callable symbols created in declaration storage and binds all unbound symbols\n *\n * Usually all symbols are bound after fir2ir conversion is over, but it's not true for `allowNonCachedDeclarations`, when\n * we convert to IR only part of sources from code fragments.\n *\n * ```\n * // Original code\n * fun foo(x: Int) {} // (1)\n *\n * fun bar() {\n * 1.let { // (2)\n * \n * }\n * }\n *\n * // Code fragment\n * foo(this@let)\n *\n * Here in the body of the code fragment we reference function (1) and lambda (2), which leads to creation of their symbols,\n * but not to generation of their IR. And since the original code won't be processed by fir2ir, we need to manually create\n * IR for all symbols from it, to avoid publication of unbound symbols after fir2ri conversion is over\n *\n * Note that in the code fragment we may capture even local functions and lambdas, which are stored not in global caches,\n * but in `localStorage`, which is getting cleared after leaving from corresponding scope. So to generate IR for them we need\n * to call this function not only after fir2ir conversion, but also after leaving each local scope (see `leaveScope` function)\n */"} {"signature":"@ UnsafeDuringIrConstructionAPI internal fun < D : IrDeclaration > IrBindableSymbol < * , D > . ownerIfBound ( ) : D ?","body":"{ return runIf ( isBound ) { owner } }","docstring":"/**\n * This function is introduced as preparation to publishing unbound symbols in fir2ir\n * There is a probability that it won't be non needed in future, but for now it allows\n * to easily track all places left when we need to extract owner from symbol\n */"} {"signature":"public suspend fun ProducerScope < * > . awaitClose ( block : ( ) -> Unit = { } )","body":"{ check ( kotlin . coroutines . coroutineContext [ Job ] === this ) { \"\" } try { suspendCancellableCoroutine < Unit > { cont -> invokeOnClose { cont . resume ( Unit ) } } } finally { block ( ) } }","docstring":"/**\n * Suspends the current coroutine until the channel is either [closed][SendChannel.close] or [cancelled][ReceiveChannel.cancel]\n * and invokes the given [block] before resuming the coroutine.\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, but was cancelled\n * while suspended, [CancellationException] will be thrown. See [suspendCancellableCoroutine] for low-level details.\n *\n * Note that when the producer channel is cancelled, this function resumes with a cancellation exception.\n * Therefore, in case of cancellation, no code after the call to this function will be executed.\n * That's why this function takes a lambda parameter.\n *\n * Example of usage:\n * ```\n * val callbackEventsStream = produce {\n * val disposable = registerChannelInCallback(channel)\n * awaitClose { disposable.dispose() }\n * }\n * ```\n */"} {"signature":"@ ExperimentalCoroutinesApi public fun < E > CoroutineScope . produce ( context : CoroutineContext = EmptyCoroutineContext , capacity : Int = , @ BuilderInference block : suspend ProducerScope < E > . ( ) -> Unit ) : ReceiveChannel < E >","body":"= produce ( context , capacity , BufferOverflow . SUSPEND , CoroutineStart . DEFAULT , onCompletion = null , block = block )","docstring":"/**\n * Launches a new coroutine to produce a stream of values by sending them to a channel\n * and returns a reference to the coroutine as a [ReceiveChannel]. This resulting\n * object can be used to [receive][ReceiveChannel.receive] elements produced by this coroutine.\n *\n * The scope of the coroutine contains the [ProducerScope] interface, which implements\n * both [CoroutineScope] and [SendChannel], so that the coroutine can invoke\n * [send][SendChannel.send] directly. The channel is [closed][SendChannel.close]\n * when the coroutine completes.\n * The running coroutine is cancelled when its receive channel is [cancelled][ReceiveChannel.cancel].\n *\n * The coroutine context is inherited from this [CoroutineScope]. Additional context elements can be specified with the [context] argument.\n * If the context does not have any dispatcher or other [ContinuationInterceptor], then [Dispatchers.Default] is used.\n * The parent job is inherited from the [CoroutineScope] as well, but it can also be overridden\n * with a corresponding [context] element.\n *\n * Any uncaught exception in this coroutine will close the channel with this exception as the cause and\n * the resulting channel will become _failed_, so that any attempt to receive from it thereafter will throw an exception.\n *\n * The kind of the resulting channel depends on the specified [capacity] parameter.\n * See the [Channel] interface documentation for details.\n *\n * See [newCoroutineContext] for a description of debugging facilities available for newly created coroutines.\n *\n * **Note: This is an experimental api.** Behaviour of producers that work as children in a parent scope with respect\n * to cancellation and error handling may change in the future.\n *\n * @param context additional to [CoroutineScope.coroutineContext] context of the coroutine.\n * @param capacity capacity of the channel's buffer (no buffer by default).\n * @param block the coroutine code.\n */"} {"signature":"@ InternalCoroutinesApi public fun < E > CoroutineScope . produce ( context : CoroutineContext = EmptyCoroutineContext , capacity : Int = , start : CoroutineStart = CoroutineStart . DEFAULT , onCompletion : CompletionHandler ? = null , @ BuilderInference block : suspend ProducerScope < E > . ( ) -> Unit ) : ReceiveChannel < E >","body":"= produce ( context , capacity , BufferOverflow . SUSPEND , start , onCompletion , block )","docstring":"/**\n * **This is an internal API and should not be used from general code.**\n * The `onCompletion` parameter will be redesigned.\n * If you have to use the `onCompletion` operator, please report to https://github.com/Kotlin/kotlinx.coroutines/issues/.\n * As a temporary solution, [invokeOnCompletion][Job.invokeOnCompletion] can be used instead:\n * ```\n * fun ReceiveChannel.myOperator(): ReceiveChannel = GlobalScope.produce(Dispatchers.Unconfined) {\n * coroutineContext[Job]?.invokeOnCompletion { consumes() }\n * }\n * ```\n * @suppress\n */"} {"signature":"fun `test typealias and class` ( )","body":"{ val result = commonize { outputTarget ( \"\" ) simpleSingleSourceTarget ( \"\" , \"\"\"\"\"\" ) simpleSingleSourceTarget ( \"\" , \"\"\"\"\"\" ) } result . assertCommonized ( \"\" , \"\" ) }","docstring":"/**\n * See: https://youtrack.jetbrains.com/issue/KT-45992\n */"} {"signature":"override actual fun add ( element : E ) : Boolean","body":"{ add ( size , element ) return true }","docstring":"/**\n * Adds the specified element to the end of this list.\n *\n * @return `true` because the list is always modified as the result of this operation.\n */"} {"signature":"protected actual open fun removeRange ( fromIndex : Int , toIndex : Int )","body":"{ val iterator = listIterator ( fromIndex ) repeat ( toIndex - fromIndex ) { iterator . next ( ) iterator . remove ( ) } }","docstring":"/**\n * Removes the range of elements from this list starting from [fromIndex] and ending with but not including [toIndex].\n */"} {"signature":"override fun equals ( other : Any ? ) : Boolean","body":"{ if ( other === this ) return true if ( other !is List < * > ) return false return AbstractList . orderedEquals ( this , other ) }","docstring":"/**\n * Checks if the two specified lists are *structurally* equal to one another.\n *\n * Two lists are considered structurally equal if they have the same size, and elements at corresponding indices are equal.\n * Elements are compared for equality using the [equals][Any.equals] function.\n * For floating point numbers, this means `NaN` is equal to itself and `-0.0` is not equal to `0.0`.\n *\n * @param other the list to compare with this list.\n * @return `true` if [other] is a [List] that is structurally equal to this list, `false` otherwise.\n */"} {"signature":"internal fun expandGlobTo ( unexpandedPath : File , output : MutableCollection < File > )","body":"{ assertTrue ( unexpandedPath . isAbsolute ) { \"\" } val paths : List < File > = generateSequence ( unexpandedPath ) { it . parentFile } . toMutableList ( ) . apply { reverse ( ) } for ( index in until paths . size ) { val path : File = paths [ index ] val isGlob = '' in path . name if ( isGlob ) { val basePath : File = paths [ index - ] val basePathAsPath : Path = basePath . toPath ( ) val pattern : String = unexpandedPath . relativeTo ( basePath ) . path . let { pattern -> if ( File . separatorChar == '' ) pattern . replace ( \"\" , \"\" ) else pattern } val matcher : PathMatcher = FileSystems . getDefault ( ) . getPathMatcher ( \"\" ) Files . walkFileTree ( basePathAsPath , object : SimpleFileVisitor < Path > ( ) { override fun visitFile ( file : Path , attrs : BasicFileAttributes ) : FileVisitResult { if ( matcher . matches ( basePathAsPath . relativize ( file ) ) ) output += file . toFile ( ) return FileVisitResult . CONTINUE } } ) return } } output += unexpandedPath }","docstring":"/**\n * Naive suboptimal implementation of glob expansion.\n */"} {"signature":"public suspend fun emit ( value : T )","body":"public suspend fun emit ( value : T )","docstring":"/**\n * Collects the value emitted by the upstream.\n * This method is not thread-safe and should not be invoked concurrently.\n */"} {"signature":"actual fun < T > CoroutineScope . asyncWithDealy ( delay : Long , block : suspend ( ) -> T ) : Deferred < T >","body":"{ TODO ( \"\" ) }","docstring":"/**\n * JVM actual implementation for `asyncWithDelay`\n */"} {"signature":"@ OptIn ( ExperimentalSerializationApi :: class ) private fun defer ( deferred : ( ) -> SerialDescriptor ) : SerialDescriptor","body":"= object : SerialDescriptor { private val original : SerialDescriptor by lazy ( deferred ) override val serialName : String get ( ) = original . serialName override val kind : SerialKind get ( ) = original . kind override val elementsCount : Int get ( ) = original . elementsCount override fun getElementName ( index : Int ) : String = original . getElementName ( index ) override fun getElementIndex ( name : String ) : Int = original . getElementIndex ( name ) override fun getElementAnnotations ( index : Int ) : List < Annotation > = original . getElementAnnotations ( index ) override fun getElementDescriptor ( index : Int ) : SerialDescriptor = original . getElementDescriptor ( index ) override fun isElementOptional ( index : Int ) : Boolean = original . isElementOptional ( index ) }","docstring":"/**\n * Returns serial descriptor that delegates all the calls to descriptor returned by [deferred] block.\n * Used to resolve cyclic dependencies between recursive serializable structures.\n */"} {"signature":"public fun onPreVisitDirectory ( function : ( directory : Path , attributes : BasicFileAttributes ) -> FileVisitResult ) : Unit","body":"public fun onPreVisitDirectory ( function : ( directory : Path , attributes : BasicFileAttributes ) -> FileVisitResult ) : Unit","docstring":"/**\n * Overrides the corresponding function of the built file visitor with the provided [function].\n *\n * By default, [FileVisitor.preVisitDirectory] of the built file visitor returns [FileVisitResult.CONTINUE].\n */"} {"signature":"public fun onVisitFile ( function : ( file : Path , attributes : BasicFileAttributes ) -> FileVisitResult ) : Unit","body":"public fun onVisitFile ( function : ( file : Path , attributes : BasicFileAttributes ) -> FileVisitResult ) : Unit","docstring":"/**\n * Overrides the corresponding function of the built file visitor with the provided [function].\n *\n * By default, [FileVisitor.visitFile] of the built file visitor returns [FileVisitResult.CONTINUE].\n */"} {"signature":"public fun onVisitFileFailed ( function : ( file : Path , exception : IOException ) -> FileVisitResult ) : Unit","body":"public fun onVisitFileFailed ( function : ( file : Path , exception : IOException ) -> FileVisitResult ) : Unit","docstring":"/**\n * Overrides the corresponding function of the built file visitor with the provided [function].\n *\n * By default, [FileVisitor.visitFileFailed] of the built file visitor re-throws the I/O exception\n * that prevented the file from being visited.\n */"} {"signature":"public fun onPostVisitDirectory ( function : ( directory : Path , exception : IOException ? ) -> FileVisitResult ) : Unit","body":"public fun onPostVisitDirectory ( function : ( directory : Path , exception : IOException ? ) -> FileVisitResult ) : Unit","docstring":"/**\n * Overrides the corresponding function of the built file visitor with the provided [function].\n *\n * By default, if the directory iteration completes without an I/O exception,\n * [FileVisitor.postVisitDirectory] of the built file visitor returns [FileVisitResult.CONTINUE];\n * otherwise it re-throws the I/O exception that caused the iteration of the directory to terminate prematurely.\n */"} {"signature":"private fun markInteropDeclaration ( descriptor : DeclarationDescriptor )","body":"{ if ( descriptor . isFromInteropLibrary ( ) ) { mask = mask or IdSignature . Flags . IS_NATIVE_INTEROP_LIBRARY . encode ( true ) } }","docstring":"/**\n * We need a way to distinguish interop declarations from usual ones\n * to be able to link against them. We do it by marking them with\n * [IdSignature.Flags.IS_NATIVE_INTEROP_LIBRARY] flag.\n */"} {"signature":"@ DokkatooInternalApi fun ObjectFactory . dokkaSourceSetIdSpec ( scopeId : String , sourceSetName : String , ) : DokkaSourceSetIdSpec","body":"= newInstance < DokkaSourceSetIdSpec > ( scopeId , sourceSetName )","docstring":"/** Utility for creating a new [DokkaSourceSetIdSpec] instance using [ObjectFactory.newInstance] */"} {"signature":"fun < T : Any > javaIoSerializable ( clazz : KClass < T > ) : IdeaKotlinExtrasSerializer < T >","body":"{ return IdeaKotlinJavaIoSerializableExtrasSerializer ( clazz ) }","docstring":"/**\n * Returns a [IdeaKotlinExtrasSerializer] based upon [java.io.Serializable]\n */"} {"signature":"public fun FaceDetectionModelBase < Bitmap > . detectFaces ( imageProxy : ImageProxy , topK : Int = , iouThreshold : Float = ) : List < DetectedObject >","body":"{ if ( this is CameraXCompatibleModel ) { return doWithRotation ( imageProxy . imageInfo . rotationDegrees ) { detectFaces ( imageProxy . toBitmap ( ) , topK , iouThreshold ) } } return detectFaces ( imageProxy . toBitmap ( applyRotation = true ) , topK , iouThreshold ) }","docstring":"/**\n * Detects [topK] faces on the given [imageProxy]. If [topK] is negative all detected faces are returned.\n * @param [iouThreshold] threshold IoU value for the non-maximum suppression applied during postprocessing\n */"} {"signature":"public fun DokkaConfiguration . toCompactJsonString ( ) : String","body":"= serializeAsCompactJson ( this )","docstring":"/**\n * Serializes [DokkaConfiguration] as a machine-readable and compact JSON string.\n *\n * The returned string is not very human friendly as it will be difficult to parse by eyes due to it\n * being compact and in one line. If you want to show the output to a human being, see [toPrettyJsonString].\n */"} {"signature":"public fun DokkaConfiguration . toPrettyJsonString ( ) : String","body":"= serializeAsPrettyJson ( this )","docstring":"/**\n * Serializes [DokkaConfiguration] as a human-readable (pretty printed) JSON string.\n *\n * The returned string will have excessive line breaks and indents, which might not be\n * desirable when passing this value between API consumers/producers. If you want\n * a machine-readable and compact json string, see [toCompactJsonString].\n */"} {"signature":"public fun < T : ConfigurableBlock > T . toCompactJsonString ( ) : String","body":"= serializeAsCompactJson ( this )","docstring":"/**\n * Serializes a [ConfigurableBlock] as a machine-readable and compact JSON string.\n *\n * The returned string is not very human friendly as it will be difficult to parse by eyes due to it\n * being compact and in one line. If you want to show the output to a human being, see [toPrettyJsonString].\n */"} {"signature":"public fun < T : ConfigurableBlock > T . toPrettyJsonString ( ) : String","body":"= serializeAsCompactJson ( this )","docstring":"/**\n * Serializes a [ConfigurableBlock] as a human-readable (pretty printed) JSON string.\n *\n * The returned string will have excessive line breaks and indents, which might not be\n * desirable when passing this value between API consumers/producers. If you want\n * a machine-readable and compact json string, see [toCompactJsonString].\n */"} {"signature":"internal fun Project . warnAboutDeprecatedProperty ( property : KonanPlugin . ProjectProperty )","body":"= property . deprecatedPropertyName ? . let { deprecated -> if ( project . hasProperty ( deprecated ) ) { logger . warn ( \"\" ) } }","docstring":"/**\n * We use the following properties:\n * org.jetbrains.kotlin.native.home - directory where compiler is located (aka dist in konan project output).\n * org.jetbrains.kotlin.native.version - a konan compiler version for downloading.\n * konan.build.targets - list of targets to build (by default all the declared targets are built).\n * konan.jvmArgs - additional args to be passed to a JVM executing the compiler/cinterop tool.\n */"} {"signature":"private fun Project . getOrRegisterTask ( name : String ) : TaskProvider < out Task >","body":"= if ( tasks . names . contains ( name ) ) { tasks . named ( name ) } else { tasks . register ( name , DefaultTask :: class . java ) }","docstring":"/**\n * Looks for task with given name in the given project.\n * If such task isn't found, will register it. Returns registered/found task.\n */"} {"signature":"public fun isPublicApi ( symbol : KtSymbolWithVisibility ) : Boolean","body":"= withValidityAssertion { analysisSession . visibilityChecker . isPublicApi ( symbol ) }","docstring":"/**\n * Returns true for effectively public symbols, including internal declarations with @PublishedApi annotation.\n * In 'Explicit API' mode explicit visibility modifier and explicit return types are required for such symbols.\n * See FirExplicitApiDeclarationChecker.kt\n */"} {"signature":"public fun argB8888ToNCHWArray ( encodedPixels : IntArray , width : Int , height : Int , channels : Int ) : FloatArray","body":"{ val output = FloatArray ( width * height * channels ) val stride = width * height for ( i in until width ) { for ( j in until height ) { val idx = height * i + j val pixelValue = encodedPixels [ idx ] val ( r , g , b ) = decodeARGB8888Pixel ( pixelValue ) output [ idx ] = r output [ idx + stride ] = g output [ idx + stride * ] = b } } return output }","docstring":"/**\n * Decodes an ARGB8888 encoded pixel array to a float array containing the red, green, blue components in NCWH layout.\n */"} {"signature":"public fun argB8888ToNHWCArray ( encodedPixels : IntArray , width : Int , height : Int , channels : Int ) : FloatArray","body":"{ val output = FloatArray ( width * height * channels ) var position = for ( pixelValue in encodedPixels ) { val ( r , g , b ) = decodeARGB8888Pixel ( pixelValue ) output [ position ++ ] = r output [ position ++ ] = g output [ position ++ ] = b } return output }","docstring":"/**\n * Decodes an ARGB8888 encoded pixel array to a float array containing the red, green, blue components in NHWC layout.\n */"} {"signature":"public fun decodeARGB8888Pixel ( pixelValue : Int ) : Triple < Float , Float , Float >","body":"{ val r = ( pixelValue shr and ) . toFloat ( ) val g = ( pixelValue shr and ) . toFloat ( ) val b = ( pixelValue and ) . toFloat ( ) return Triple ( r , g , b ) }","docstring":"/**\n * Decodes an ARGB8888 encoded pixel to a red, green, blue components.\n */"} {"signature":"@ JvmName ( \"\" ) public fun < T : Number , D : Dimension > Math . exp ( a : MultiArray < T , D > ) : NDArray < Double , D >","body":"= this . mathEx . exp ( a )","docstring":"/**\n * Returns a ndarray of Double from the given ndarray to each element of which an exp function has been applied.\n */"} {"signature":"@ JvmName ( \"\" ) public fun < D : Dimension > Math . exp ( a : MultiArray < Float , D > ) : NDArray < Float , D >","body":"= this . mathEx . expF ( a )","docstring":"/**\n * Returns a ndarray of Float from the given ndarray to each element of which an exp function has been applied.\n */"} {"signature":"@ JvmName ( \"\" ) public fun < D : Dimension > Math . exp ( a : MultiArray < ComplexFloat , D > ) : NDArray < ComplexFloat , D >","body":"= this . mathEx . expCF ( a )","docstring":"/**\n * Returns a ndarray of [ComplexFloat] from the given ndarray to each element of which an exp function has been applied.\n */"} {"signature":"@ JvmName ( \"\" ) public fun < D : Dimension > Math . exp ( a : MultiArray < ComplexDouble , D > ) : NDArray < ComplexDouble , D >","body":"= this . mathEx . expCD ( a )","docstring":"/**\n * Returns a ndarray of [ComplexDouble] from the given ndarray to each element of which an exp function has been applied.\n */"} {"signature":"private fun checkUnambiguousClassifiers ( foundClassifierSymbol : FirClassifierSymbol < * > , newClassifierSymbol : FirClassifierSymbol < * > , session : FirSession , ) : CheckUnambiguousClassifiersResult","body":"{ val classTypealiasesThatDontCauseAmbiguity = session . platformClassMapper . classTypealiasesThatDontCauseAmbiguity if ( foundClassifierSymbol is FirTypeAliasSymbol && newClassifierSymbol is FirRegularClassSymbol && classTypealiasesThatDontCauseAmbiguity [ newClassifierSymbol . classId ] == foundClassifierSymbol . classId ) { return CheckUnambiguousClassifiersResult ( shouldReplaceResult = true , isAmbiguousResult = false ) } if ( newClassifierSymbol is FirTypeAliasSymbol && foundClassifierSymbol is FirRegularClassSymbol && classTypealiasesThatDontCauseAmbiguity [ foundClassifierSymbol . classId ] == newClassifierSymbol . classId ) { return CheckUnambiguousClassifiersResult ( shouldReplaceResult = false , isAmbiguousResult = false ) } return CheckUnambiguousClassifiersResult ( shouldReplaceResult = false , isAmbiguousResult = true ) }","docstring":"/**\n * Handle special cases when classifiers don't cause ambiguity (`Throws`)\n *\n * The following output options are possible:\n * * `shouldReplaceResult = true, isAmbiguousResult = false` means successful disambiguation\n * but the previous result should be replaced with the new one (typically class symbol wins typealias)\n * * `shouldReplaceResult = false, isAmbiguousResult = false` means successful disambiguation\n * but the new result should be discarded\n * * `shouldReplaceResult = false, isAmbiguousResult = true` means unsuccessful disambiguation\n * and both results become irrelevant\n */"} {"signature":"private fun convertClass ( clazz : ClassNode , lineMappings : KaptLineMappingCollector , packageFqName : String , isTopLevel : Boolean ) : JCClassDecl ?","body":"{ if ( isSynthetic ( clazz . access ) ) return null if ( ! checkIfValidTypeName ( clazz , Type . getObjectType ( clazz . name ) ) ) return null val descriptor = kaptContext . origins [ clazz ] ? . descriptor ? : return null val isNested : Boolean val isInner : Boolean if ( descriptor is ClassDescriptor ) { isNested = descriptor . isNested isInner = isNested && descriptor . isInner } else { isNested = false isInner = false } val flags = getClassAccessFlags ( clazz , descriptor , isInner , isNested ) val isEnum = clazz . isEnum ( ) val isAnnotation = clazz . isAnnotation ( ) val modifiers = convertModifiers ( clazz , flags , if ( isEnum ) ElementKind . ENUM else ElementKind . CLASS , packageFqName , clazz . visibleAnnotations , clazz . invisibleAnnotations , descriptor . annotations ) val isDefaultImpls = clazz . name . endsWith ( \"\" ) && isPublic ( clazz . access ) && isFinal ( clazz . access ) && descriptor is ClassDescriptor && descriptor . kind == ClassKind . INTERFACE if ( isDefaultImpls && ( isTopLevel || ( clazz . fields . isNullOrEmpty ( ) && clazz . methods . isNullOrEmpty ( ) ) ) ) { return null } val simpleName = getClassName ( clazz , descriptor , isDefaultImpls , packageFqName ) if ( ! isValidIdentifier ( simpleName ) ) return null val interfaces = mapJList ( clazz . interfaces ) { if ( isAnnotation && it == \"\" ) return@mapJList null treeMaker . FqName ( treeMaker . getQualifiedName ( it ) ) } val superClass = treeMaker . FqName ( treeMaker . getQualifiedName ( clazz . superName ) ) val genericType = signatureParser . parseClassSignature ( clazz . signature , superClass , interfaces ) class EnumValueData ( val field : FieldNode , val innerClass : InnerClassNode ? , val correspondingClass : ClassNode ? ) val enumValuesData = clazz . fields . filter { it . isEnumValue ( ) } . map { field -> var foundInnerClass : InnerClassNode ? = null var correspondingClass : ClassNode ? = null for ( innerClass in clazz . innerClasses ) { if ( innerClass . innerName != field . name ) continue val classNode = compiledClassByName [ innerClass . name ] ? : continue if ( classNode . superName != clazz . name ) continue correspondingClass = classNode foundInnerClass = innerClass break } EnumValueData ( field , foundInnerClass , correspondingClass ) } val enumValues : JavacList < JCTree > = mapJList ( enumValuesData ) { data -> val constructorArguments = Type . getArgumentTypes ( clazz . methods . firstOrNull { it . name == \">\" && Type . getArgumentsAndReturnSizes ( it . desc ) . shr ( ) >= } ? . desc ? : \"\" ) val args = mapJList ( constructorArguments . drop ( ) ) { convertLiteralExpression ( clazz , getDefaultValue ( it ) ) } val def = data . correspondingClass ? . let { convertClass ( it , lineMappings , packageFqName , false ) } convertField ( data . field , clazz , lineMappings , packageFqName , treeMaker . NewClass ( null , JavacList . nil ( ) , treeMaker . Ident ( treeMaker . name ( data . field . name ) ) , args , def ) ) } val fieldsPositions = mutableMapOf < JCTree , MemberData > ( ) val fields = mapJList < FieldNode , JCTree > ( clazz . fields ) { fieldNode -> if ( fieldNode . isEnumValue ( ) ) { null } else { convertField ( fieldNode , clazz , lineMappings , packageFqName ) ? . also { fieldsPositions [ it ] = MemberData ( fieldNode . name , fieldNode . desc , lineMappings . getPosition ( clazz , fieldNode ) ) } } } val methodsPositions = mutableMapOf < JCTree , MemberData > ( ) val methods = mapJList < MethodNode , JCTree > ( clazz . methods ) { methodNode -> if ( isEnum ) { if ( methodNode . name == \"\" && methodNode . desc == \"\" ) return@mapJList null if ( methodNode . name == \"\" && methodNode . desc == \"\" ) return@mapJList null } convertMethod ( methodNode , clazz , lineMappings , packageFqName , isInner ) ? . also { methodsPositions [ it ] = MemberData ( methodNode . name , methodNode . desc , lineMappings . getPosition ( clazz , methodNode ) ) } } val nestedClasses = mapJList < InnerClassNode , JCTree > ( clazz . innerClasses ) { innerClass -> if ( enumValuesData . any { it . innerClass == innerClass } ) return@mapJList null if ( innerClass . outerName != clazz . name ) return@mapJList null val innerClassNode = compiledClassByName [ innerClass . name ] ? : return@mapJList null convertClass ( innerClassNode , lineMappings , packageFqName , false ) } lineMappings . registerClass ( clazz ) val superTypes = calculateSuperTypes ( clazz , genericType ) val classPosition = lineMappings . getPosition ( clazz ) val sortedFields = JavacList . from ( fields . sortedWith ( MembersPositionComparator ( classPosition , fieldsPositions ) ) ) val sortedMethods = JavacList . from ( methods . sortedWith ( MembersPositionComparator ( classPosition , methodsPositions ) ) ) return treeMaker . ClassDef ( modifiers , treeMaker . name ( simpleName ) , genericType . typeParameters , superTypes . superClass , superTypes . interfaces , enumValues + sortedFields + sortedMethods + nestedClasses ) . keepKdocCommentsIfNecessary ( clazz ) }","docstring":"/**\n * Returns false for the inner classes or if the origin for the class was not found.\n */"} {"signature":"fun contains ( predicate : ( Throwable ) -> Boolean ) : Boolean","body":"{ return exceptions . any ( predicate ) }","docstring":"/**\n * Returns true if any of the exceptions in the composite exception match the specified predicate.\n */"} {"signature":"fun getCauses ( ) : List < Throwable >","body":"{ return exceptions . flatMap { it . getCauses ( ) } . distinct ( ) }","docstring":"/**\n * Returns a list of the causes of the exceptions in the composite exception.\n */"} {"signature":"fun Throwable . getCauses ( ) : List < Throwable >","body":"{ return generateSequence ( cause ) { it . cause } . toList ( ) }","docstring":"/**\n * Returns a list of all the causes of a throwable.\n */"} {"signature":"public fun RawSource . buffered ( ) : Source","body":"= RealSource ( this )","docstring":"/**\n * Returns a new source that buffers reads from the source. The returned source will perform bulk\n * reads into its in-memory buffer. Use this wherever you read a source to get ergonomic and\n * efficient access to data.\n */"} {"signature":"public fun RawSink . buffered ( ) : Sink","body":"= RealSink ( this )","docstring":"/**\n * Returns a new sink that buffers writes to the sink. The returned sink will batch writes to the sink.\n * Use this wherever you write to a sink to get ergonomic and efficient access to data.\n */"} {"signature":"public fun discardingSink ( ) : RawSink","body":"= DiscardingSink ( )","docstring":"/**\n * Returns a sink that discards all data written to it.\n */"} {"signature":"public fun < T > yEnd ( column : ColumnReference < T > ) : PositionalMapping < T >","body":"{ return addPositionalMapping < T > ( Y_END , column . name ( ) , null ) }","docstring":"/**\n * Maps the `yEnd` 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 > yEnd ( column : KProperty < T > ) : PositionalMapping < T >","body":"{ return addPositionalMapping < T > ( Y_END , column . name , null ) }","docstring":"/**\n * Maps the `yEnd` 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 yEnd ( column : String ) : PositionalMapping < Any ? >","body":"{ return addPositionalMapping ( Y_END , column , null ) }","docstring":"/**\n * Maps the `yEnd` 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 > yEnd ( values : Iterable < T > ) : PositionalMapping < T >","body":"{ return addPositionalMapping < T > ( Y_END , values . toList ( ) , null , null ) }","docstring":"/**\n * Maps the `yEnd` 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 > yEnd ( values : DataColumn < T > ) : PositionalMapping < T >","body":"{ return addPositionalMapping < T > ( Y_END , values , null ) }","docstring":"/**\n * Maps the `yEnd` 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":"private fun headerContentHandler ( node : ASTNode ) : List < DocTag >","body":"{ val trimmedChildren = node . children . trimWhitespaceToken ( ) val children = trimmedChildren . evaluateChildren ( ) return DocTagsFromIElementFactory . getInstance ( MarkdownElementTypes . PARAGRAPH , children = children ) }","docstring":"/**\n * Handler for [MarkdownTokenTypes.ATX_CONTENT], which is the content of the header\n * elements like [MarkdownElementTypes.ATX_1], [MarkdownElementTypes.ATX_2] and so on.\n *\n * For example, a header line like `# Header text` is expected to be parsed into:\n * - One [MarkdownTokenTypes.ATX_HEADER] with startOffset = 0, endOffset = 1 (only the `#` symbol)\n * - Composite [MarkdownTokenTypes.ATX_CONTENT] with four children: WHITE_SPACE, TEXT, WHITE_SPACE, TEXT.\n */"} {"signature":"private fun List < ASTNode > . trimWhitespaceToken ( ) : List < ASTNode >","body":"{ val firstNonWhitespaceIndex = this . indexOfFirst { it . type != MarkdownTokenTypes . WHITE_SPACE } if ( firstNonWhitespaceIndex == - ) { return this } val lastNonWhitespaceIndex = this . indexOfLast { it . type != MarkdownTokenTypes . WHITE_SPACE } return this . subList ( firstNonWhitespaceIndex , lastNonWhitespaceIndex + ) }","docstring":"/**\n * @return a sublist of [this] list that does not contain\n * leading and trailing [MarkdownTokenTypes.WHITE_SPACE] elements\n */"} {"signature":"private fun processMemberDeclaration ( declaration : FirDeclaration , containingClass : FirClass ? , parent : IrDeclarationParent , delegateFieldToPropertyMap : MultiMap < FirProperty , FirField > ? )","body":"{ @ OptIn ( UnsafeDuringIrConstructionAPI :: class ) fun addDeclarationToParentIfNeeded ( irDeclaration : IrDeclaration ) { when ( parent ) { is IrFile -> parent . declarations += irDeclaration is IrClass -> parent . declarations += irDeclaration } } val isInLocalClass = containingClass != null && ( containingClass !is FirRegularClass || containingClass . isLocal ) when ( declaration ) { is FirRegularClass -> { val irClass = classifierStorage . getIrClass ( declaration ) addDeclarationToParentIfNeeded ( irClass ) processClassMembers ( declaration , irClass ) } is FirScript -> { require ( parent is IrFile ) val irScript = declarationStorage . createIrScript ( declaration ) addDeclarationToParentIfNeeded ( irScript ) declarationStorage . withScope ( irScript . symbol ) { irScript . parent = parent for ( scriptDeclaration in declaration . declarations . filterIsInstance < FirRegularClass > ( ) ) { registerClassAndNestedClasses ( scriptDeclaration , irScript ) } for ( scriptDeclaration in declaration . declarations ) { when ( scriptDeclaration ) { is FirRegularClass -> { processClassAndNestedClassHeaders ( scriptDeclaration ) } is FirTypeAlias -> classifierStorage . createAndCacheIrTypeAlias ( scriptDeclaration , irScript ) else -> { } } } for ( scriptDeclaration in declaration . declarations ) { if ( scriptDeclaration !is FirAnonymousInitializer ) { processMemberDeclaration ( scriptDeclaration , containingClass = null , irScript , delegateFieldToPropertyMap = null ) } } } } is FirSimpleFunction -> { declarationStorage . createAndCacheIrFunction ( declaration , parent , isLocal = isInLocalClass ) } is FirProperty -> { if ( containingClass == null || ! declaration . isEnumEntries ( containingClass ) || session . languageVersionSettings . supportsFeature ( LanguageFeature . EnumEntries ) ) { val irProperty = declarationStorage . createAndCacheIrProperty ( declaration , parent ) delegateFieldToPropertyMap ? . remove ( declaration ) ? . let { delegateFields -> val backingField = irProperty . backingField ! ! for ( delegateField in delegateFields ) { declarationStorage . recordDelegateFieldMappedToBackingField ( delegateField , backingField . symbol ) delegatedMemberGenerator . generateWithBodiesIfNeeded ( firField = delegateField , irField = backingField , containingClass ! ! , parent as IrClass ) } } } } is FirField -> { if ( ! declaration . isSynthetic ) { error ( \"\" ) } requireNotNull ( containingClass ) requireNotNull ( delegateFieldToPropertyMap ) require ( parent is IrClass ) val correspondingClassProperty = declaration . findCorrespondingDelegateProperty ( containingClass ) if ( correspondingClassProperty == null || correspondingClassProperty . isVar ) { val irField = declarationStorage . createDelegateIrField ( declaration , parent ) delegatedMemberGenerator . generateWithBodiesIfNeeded ( declaration , irField , containingClass , parent ) } else { delegateFieldToPropertyMap . putValue ( correspondingClassProperty , declaration ) } } is FirConstructor -> if ( ! declaration . isPrimary ) { declarationStorage . createAndCacheIrConstructor ( declaration , { parent as IrClass } , isLocal = isInLocalClass ) } is FirEnumEntry -> { classifierStorage . createAndCacheIrEnumEntry ( declaration , parent as IrClass ) } is FirAnonymousInitializer -> { declarationStorage . createIrAnonymousInitializer ( declaration , parent as IrClass ) } is FirTypeAlias -> { classifierStorage . getCachedTypeAlias ( declaration ) ? . let { irTypeAlias -> addDeclarationToParentIfNeeded ( irTypeAlias ) } } is FirCodeFragment -> { val codeFragmentClass = classifierStorage . getCachedIrCodeFragment ( declaration ) ! ! processCodeFragmentMembers ( declaration , codeFragmentClass ) addDeclarationToParentIfNeeded ( codeFragmentClass ) } else -> { error ( \"\" ) } } }","docstring":"/**\n * This function creates IR declarations for callable members without filling their body\n *\n * @param delegateFieldToPropertyMap is needed to avoid problems with delegation to properties from primary constructor.\n * The thing is that FirFields for delegates are declared before properties from the primary constructor, but in IR we don't\n * create separate IrField for such fields and reuse the backing field of corresponding property.\n * So, this map is used to postpone generation of delegated members until IR for corresponding property will be created\n */"} {"signature":"private fun checkGap ( timeZone : TimeZone , gapStart : LocalDateTime )","body":"{ val instant = gapStart . toInstant ( timeZone ) val adjusted = instant . toLocalDateTime ( timeZone ) try { assertNotEquals ( gapStart , adjusted ) assertEquals ( instant . offsetIn ( timeZone ) , instant . plus ( , DateTimeUnit . SECOND ) . offsetIn ( timeZone ) ) assertEquals ( instant . minus ( , DateTimeUnit . SECOND ) . offsetIn ( timeZone ) , instant . minus ( , DateTimeUnit . SECOND ) . offsetIn ( timeZone ) ) } catch ( e : Throwable ) { throw Exception ( \"\" , e ) } }","docstring":"/**\n * [gapStart] is the first non-existent moment.\n */"} {"signature":"private fun checkOverlap ( timeZone : TimeZone , overlapStart : LocalDateTime )","body":"{ val instantStart = overlapStart . plusNominalSeconds ( - ) . toInstant ( timeZone ) . plus ( , DateTimeUnit . SECOND ) val instantEnd = overlapStart . plusNominalSeconds ( ) . toInstant ( timeZone ) . minus ( , DateTimeUnit . SECOND ) try { assertNotEquals ( instantStart , instantEnd ) assertEquals ( instantStart . minus ( , DateTimeUnit . SECOND ) . offsetIn ( timeZone ) , instantStart . minus ( , DateTimeUnit . SECOND ) . offsetIn ( timeZone ) ) assertEquals ( instantStart . offsetIn ( timeZone ) , instantEnd . offsetIn ( timeZone ) ) } catch ( e : Throwable ) { throw Exception ( \"\" , e ) } }","docstring":"/**\n * [overlapStart] is the first non-ambiguous date-time.\n */"} {"signature":"@ Test fun testWithContextDispatching ( )","body":"= runTest { var counter = withContext ( Dispatchers . Default ) { counter += } assertEquals ( counter , ) }","docstring":"/** Tests that [withContext] that sends work to other threads works in [runTest]. */"} {"signature":"@ Test fun testJoiningForkedJob ( )","body":"= runTest { var counter = val job = GlobalScope . launch { counter += } job . join ( ) assertEquals ( counter , ) }","docstring":"/** Tests that joining [GlobalScope.launch] works in [runTest]. */"} {"signature":"@ Test fun testSuspendCoroutine ( )","body":"= runTest { val answer = suspendCoroutine < Int > { it . resume ( ) } assertEquals ( , answer ) }","docstring":"/** Tests [suspendCoroutine] not failing [runTest]. */"} {"signature":"@ Test fun testNestedRunTestForbidden ( )","body":"= runTest { assertFailsWith < IllegalStateException > { runTest { } } }","docstring":"/** Tests that [runTest] attempts to detect it being run inside another [runTest] and failing in such scenarios. */"} {"signature":"@ Test fun testRunTestWithZeroDispatchTimeoutWithControlledDispatches ( )","body":"= runTest ( dispatchTimeoutMs = ) { launch { delay ( ) } val deferred = async { val job = launch ( StandardTestDispatcher ( testScheduler ) ) { launch { delay ( ) } delay ( ) } job . join ( ) } deferred . await ( ) }","docstring":"/** Tests that even the dispatch timeout of `0` is fine if all the dispatches go through the same scheduler. */"} {"signature":"@ Test fun testRunTestWithSmallDispatchTimeout ( )","body":"= testResultMap ( { fn -> try { fn ( ) fail ( \"\" ) } catch ( e : Throwable ) { assertIs < UncompletedCoroutinesError > ( e ) } } ) { runTest ( dispatchTimeoutMs = ) { withContext ( Dispatchers . Default ) { delay ( ) } fail ( \"\" ) } }","docstring":"/** Tests that too low of a dispatch timeout causes crashes. */"} {"signature":"@ Test fun testRunTestWithSmallTimeout ( )","body":"= testResultMap ( { fn -> try { fn ( ) fail ( \"\" ) } catch ( e : Throwable ) { assertIs < UncompletedCoroutinesError > ( e ) } } ) { runTest ( timeout = . milliseconds ) { withContext ( Dispatchers . Default ) { delay ( ) } fail ( \"\" ) } }","docstring":"/**\n * Tests that [runTest] times out after the specified time.\n */"} {"signature":"@ Test fun testRunTestWithSmallTimeoutAndManyDispatches ( )","body":"= testResultMap ( { fn -> try { fn ( ) fail ( \"\" ) } catch ( e : Throwable ) { assertIs < UncompletedCoroutinesError > ( e ) } } ) { runTest ( timeout = . milliseconds ) { while ( true ) { withContext ( Dispatchers . Default ) { delay ( ) } } } }","docstring":"/** Tests that [runTest] times out after the specified time, even if the test framework always knows the test is\n * still doing something. */"} {"signature":"@ Test @ NoJs @ NoNative fun testListingActiveCoroutinesOnTimeout ( ) : TestResult","body":"{ val name1 = \"\" val name2 = \"\" return testResultMap ( { try { it ( ) fail ( \"\" ) } catch ( e : UncompletedCoroutinesError ) { assertContains ( e . message ? : \"\" , name1 ) assertFalse ( ( e . message ? : \"\" ) . contains ( name2 ) ) } } ) { runTest ( dispatchTimeoutMs = ) { launch ( CoroutineName ( name1 ) ) { CompletableDeferred < Unit > ( ) . await ( ) } launch ( CoroutineName ( name2 ) ) { } } } }","docstring":"/** Tests that, on timeout, the names of the active coroutines are listed,\n * whereas the names of the completed ones are not. */"} {"signature":"@ Test fun testFailureWithPendingCoroutine ( )","body":"= testResultMap ( { try { it ( ) fail ( \"\" ) } catch ( e : UncompletedCoroutinesError ) { @ Suppress ( \"\" , \"\" ) val suppressed = unwrap ( e ) . suppressedExceptions assertEquals ( , suppressed . size , \"\" ) assertIs < TestException > ( suppressed [ ] ) . also { assertEquals ( \"\" , it . message ) } } } ) { runTest ( timeout = . milliseconds ) { launch ( start = CoroutineStart . UNDISPATCHED ) { withContext ( NonCancellable + Dispatchers . Default ) { delay ( . milliseconds ) } } throw TestException ( \"\" ) } }","docstring":"/** Tests that the [UncompletedCoroutinesError] suppresses an exception with which the coroutine is completing. */"} {"signature":"@ Test fun testRunTestWithLargeDispatchTimeout ( )","body":"= runTest ( dispatchTimeoutMs = ) { withContext ( Dispatchers . Default ) { delay ( ) } }","docstring":"/** Tests that real delays can be accounted for with a large enough dispatch timeout. */"} {"signature":"@ Test fun testRunTestWithLargeTimeout ( )","body":"= runTest ( timeout = . milliseconds ) { withContext ( Dispatchers . Default ) { delay ( ) } }","docstring":"/** Tests that delays can be accounted for with a large enough timeout. */"} {"signature":"@ Test fun testRunTestTimingOutAndThrowing ( )","body":"= testResultMap ( { fn -> try { fn ( ) fail ( \"\" ) } catch ( e : UncompletedCoroutinesError ) { @ Suppress ( \"\" , \"\" ) val suppressed = unwrap ( e ) . suppressedExceptions assertEquals ( , suppressed . size , \"\" ) assertIs < TestException > ( suppressed [ ] ) . also { assertEquals ( \"\" , it . message ) } } } ) { runTest ( timeout = . milliseconds ) { coroutineContext [ CoroutineExceptionHandler ] ! ! . handleException ( coroutineContext , TestException ( \"\" ) ) withContext ( Dispatchers . Default ) { delay ( ) } fail ( \"\" ) } }","docstring":"/** Tests uncaught exceptions being suppressed by the dispatch timeout error. */"} {"signature":"@ Test fun testRunTestWithIllegalContext ( )","body":"{ for ( ctx in TestScopeTest . invalidContexts ) { assertFailsWith < IllegalArgumentException > { runTest ( ctx ) { } } } }","docstring":"/** Tests that passing invalid contexts to [runTest] causes it to fail (on JS, without forking). */"} {"signature":"@ Test fun testThrowingInRunTestBody ( )","body":"= testResultMap ( { assertFailsWith < RuntimeException > { it ( ) } } ) { runTest { throw RuntimeException ( ) } }","docstring":"/** Tests that throwing exceptions in [runTest] fails the test with them. */"} {"signature":"@ Test fun testThrowingInRunTestPendingTask ( )","body":"= testResultMap ( { assertFailsWith < RuntimeException > { it ( ) } } ) { runTest { launch { delay ( SLOW ) throw RuntimeException ( ) } } }","docstring":"/** Tests that throwing exceptions in pending tasks [runTest] fails the test with them. */"} {"signature":"@ Test fun testChildrenCancellationOnTestBodyFailure ( ) : TestResult","body":"{ var job : Job ? = null return testResultMap ( { assertFailsWith < AssertionError > { it ( ) } assertTrue ( job ! ! . isCancelled ) } ) { runTest { job = launch { while ( true ) { delay ( ) } } throw AssertionError ( ) } } }","docstring":"/** Tests that, once the test body has thrown, the child coroutines are cancelled. */"} {"signature":"@ Test fun testTimeout ( )","body":"= testResultMap ( { assertFailsWith < TimeoutCancellationException > { it ( ) } } ) { runTest { withTimeout ( ) { launch { delay ( ) } } } }","docstring":"/** Tests that [runTest] reports [TimeoutCancellationException]. */"} {"signature":"@ Test fun testRunTestThrowsRootCause ( )","body":"= testResultMap ( { assertFailsWith < TestException > { it ( ) } } ) { runTest { launch { throw TestException ( ) } } }","docstring":"/** Checks that [runTest] throws the root cause and not [JobCancellationException] when a child coroutine throws. */"} {"signature":"@ Test fun testCompletesOwnJob ( ) : TestResult","body":"{ var handlerCalled = false return testResultMap ( { it ( ) assertTrue ( handlerCalled ) } ) { runTest { coroutineContext . job . invokeOnCompletion { handlerCalled = true } } } }","docstring":"/** Tests that [runTest] completes its job. */"} {"signature":"@ Test fun testDoesNotCompleteGivenJob ( ) : TestResult","body":"{ var handlerCalled = false val job = Job ( ) job . invokeOnCompletion { handlerCalled = true } return testResultMap ( { it ( ) assertFalse ( handlerCalled ) assertEquals ( , job . children . filter { it . isActive } . count ( ) ) } ) { runTest ( job ) { assertTrue ( coroutineContext . job in job . children ) } } }","docstring":"/** Tests that [runTest] doesn't complete the job that was passed to it as an argument. */"} {"signature":"@ Test fun testSuppressedExceptions ( )","body":"= testResultMap ( { try { it ( ) fail ( \"\" ) } catch ( e : TestException ) { assertEquals ( \"\" , e . message ) val suppressed = e . suppressedExceptions + ( e . suppressedExceptions . firstOrNull ( ) ? . suppressedExceptions ? : emptyList ( ) ) assertEquals ( , suppressed . size ) assertEquals ( \"\" , suppressed [ ] . message ) assertEquals ( \"\" , suppressed [ ] . message ) assertEquals ( \"\" , suppressed [ ] . message ) } } ) { runTest { launch ( SupervisorJob ( ) ) { throw TestException ( \"\" ) } launch ( SupervisorJob ( ) ) { throw TestException ( \"\" ) } launch ( SupervisorJob ( ) ) { throw TestException ( \"\" ) } throw TestException ( \"\" ) } }","docstring":"/** Tests that, when the test body fails, the reported exceptions are suppressed. */"} {"signature":"@ Test fun testScopeRunTestExceptionHandler ( ) : TestResult","body":"{ val scope = TestScope ( ) return testResultMap ( { try { it ( ) fail ( \"\" ) } catch ( e : TestException ) { } } ) { scope . runTest { launch ( SupervisorJob ( ) ) { throw TestException ( \"\" ) } } } }","docstring":"/** Tests that [TestScope.runTest] does not inherit the exception handler and works. */"} {"signature":"@ Test fun testCoroutineCompletingWithoutDispatch ( )","body":"= runTest ( timeout = Duration . INFINITE ) { launch ( Dispatchers . Default ) { delay ( ) } }","docstring":"/**\n * Tests that if the main coroutine is completed without a dispatch, [runTest] will not consider this to be\n * inactivity.\n *\n * The test will hang if this is not the case.\n */"} {"signature":"@ Test @ Ignore fun testExceptionCaptorCleanedUpOnPreliminaryExit ( ) : TestResult","body":"= testResultChain ( { println ( \"\" ) runTest { } } , { it . getOrThrow ( ) println ( \"\" ) createTestResult { launch ( NonCancellable ) { throw TestException ( \"\" ) } } } , { it . getOrThrow ( ) println ( \"\" ) try { runTest { fail ( \"\" ) } fail ( \"\" ) } catch ( e : UncaughtExceptionsBeforeTest ) { val cause = e . suppressedExceptions . single ( ) assertIs < TestException > ( cause ) assertEquals ( \"\" , cause . message ) } println ( \"\" ) runTest { } } , { it . getOrThrow ( ) println ( \"\" ) createTestResult { launch ( NonCancellable ) { throw TestException ( \"\" ) } } } , { it . getOrThrow ( ) println ( \"\" ) try { runTest { fail ( \"\" ) } fail ( \"\" ) } catch ( e : Exception ) { val cause = e . suppressedExceptions . single ( ) assertIs < TestException > ( cause ) assertEquals ( \"\" , cause . message ) } println ( \"\" ) runTest { } } )","docstring":"/**\n * Tests that [runTest] cleans up the exception handler even if it threw on initialization.\n *\n * This test must be run manually, because it writes garbage to the log.\n *\n * The JVM-only source set contains a test equivalent to this one that isn't ignored.\n */"} {"signature":"private fun InternalKotlinSourceSet . configureLegacyMetadataDependenciesConfigurations ( resolvableMetadataConfiguration : Configuration )","body":"{ @ Suppress ( \"\" ) listOf ( apiMetadataConfigurationName , implementationMetadataConfigurationName , compileOnlyMetadataConfigurationName ) . forEach { configurationName -> val configuration = project . configurations . getByName ( configurationName ) configuration . extendsFrom ( resolvableMetadataConfiguration ) configuration . shouldResolveConsistentlyWith ( resolvableMetadataConfiguration ) } }","docstring":"/**\nOlder IDEs still rely on resolving the metadata configurations explicitly.\nDependencies will be coming from extending the newer 'resolvableMetadataConfiguration'.\n\nthe intransitiveMetadataConfigurationName will not extend this mechanism, since it only\nrelies on dependencies being added explicitly by the Kotlin Gradle Plugin\n */"} {"signature":"fun getSimpleName ( call : JsInvocation ) : JsName ?","body":"{ val qualifier = call . qualifier return ( qualifier as? JsNameRef ) ? . name }","docstring":"/**\n * Gets invocation qualifier name.\n *\n * @returns `f` for `_.foo.f()` call\n */"} {"signature":"fun getSimpleIdent ( call : JsInvocation ) : String ?","body":"{ var qualifier : JsExpression ? = call . qualifier qualifiers @ while ( qualifier != null ) { when ( qualifier ) { is JsInvocation -> { val callableQualifier = qualifier qualifier = callableQualifier . qualifier if ( isCallInvocation ( callableQualifier ) ) { qualifier = ( qualifier as? JsNameRef ) ? . qualifier } } is HasName -> return qualifier . name ? . ident else -> break@qualifiers } } return null }","docstring":"/**\n * Tries to get ident for call.\n *\n * @returns first name ident (iterating through qualifier chain)\n */"} {"signature":"fun isCallInvocation ( invocation : JsInvocation ) : Boolean","body":"{ val qualifier = invocation . qualifier as? JsNameRef val arguments = invocation . arguments if ( qualifier . name ? . descriptor != null ) return false return qualifier ? . ident == Namer . CALL_FUNCTION && arguments . isNotEmpty ( ) && qualifier . qualifier != null }","docstring":"/**\n * Tests if invocation is JavaScript call function\n *\n * @return true if invocation is something like `x.call(thisReplacement)`\n * false otherwise\n */"} {"signature":"fun hasCallerQualifier ( invocation : JsInvocation ) : Boolean","body":"{ return getCallerQualifierImpl ( invocation ) != null }","docstring":"/**\n * Checks if invocation has qualifier before call.\n *\n * @return true, if invocation is similar to `something.f()`\n * false, if invocation is similar to `f()`\n */"} {"signature":"fun getCallerQualifier ( invocation : JsInvocation ) : JsExpression","body":"{ return getCallerQualifierImpl ( invocation ) ? : throw AssertionError ( \"\" ) }","docstring":"/**\n * Gets qualifier preceding call.\n *\n * @return caller for invocation of type `caller.f()`,\n * where caller is any JsNameRef (for example a.b.c. etc.)\n *\n * @throws AssertionError, if invocation does not have caller qualifier.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalStdlibApi :: class ) @ kotlin . internal . InlineOnly public actual inline fun Char ( code : UShort ) : Char","body":"{ return code . toInt ( ) . toChar ( ) }","docstring":"/**\n * Creates a Char with the specified [code].\n *\n * @sample samples.text.Chars.charFromCode\n */"} {"signature":"fun main ( )","body":"{ val modelHub = TFModelHub ( cacheDirectory = File ( \"\" ) ) val modelType = TFModels . CV . ResNet50 ( ) val model = modelHub . loadModel ( modelType ) val fileDataLoader = modelType . createPreprocessing ( model ) . fileLoader ( ) val imageNetClassLabels = modelHub . loadClassLabels ( ) model . use { it . compile ( optimizer = Adam ( ) , loss = Losses . MAE , metric = Metrics . ACCURACY ) it . logSummary ( ) val hdfFile = modelHub . loadWeights ( modelType ) it . loadWeights ( hdfFile ) for ( i in .. ) { val inputData = fileDataLoader . load ( getFileFromResource ( \"\" ) ) val res = it . predictLabel ( inputData ) println ( \"\" ) val top5 = it . predictTop5Labels ( inputData , imageNetClassLabels ) println ( top5 . toString ( ) ) } it . save ( File ( PATH_TO_MODEL ) , savingFormat = SavingFormat . JsonConfigCustomVariables ( isKerasFullyCompatible = true ) , writingMode = WritingMode . OVERRIDE ) it . save ( File ( PATH_TO_MODEL_2 ) , savingFormat = SavingFormat . TfGraphCustomVariables , writingMode = WritingMode . OVERRIDE ) } val inferenceModel = TensorFlowInferenceModel . load ( File ( PATH_TO_MODEL_2 ) ) inferenceModel . use { for ( i in .. ) { val inputData = fileDataLoader . load ( getFileFromResource ( \"\" ) ) val res = it . predict ( inputData ) println ( \"\" ) val top5 = it . predictTop5Labels ( inputData , imageNetClassLabels ) println ( top5 . toString ( ) ) } } val model2 = Functional . loadModelConfiguration ( File ( \"\" ) ) model2 . use { it . compile ( optimizer = RMSProp ( ) , loss = Losses . MAE , metric = Metrics . ACCURACY ) it . logSummary ( ) it . loadWeights ( File ( PATH_TO_MODEL ) ) for ( i in .. ) { val inputData = fileDataLoader . load ( getFileFromResource ( \"\" ) ) val res = it . predictLabel ( inputData ) println ( \"\" ) val top5 = it . predictTop5Labels ( inputData , imageNetClassLabels ) println ( top5 . toString ( ) ) } } }","docstring":"/**\n * This example demonstrates the inference concept on ResNet'50 model and model, model weight export and import back:\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 ResNet'50 during training on ImageNet dataset) is applied to each image before prediction.\n * - Model is exported in both: Keras-style JSON format and graph .pb format ; weights are exported in custom (TXT) format.\n * - It saves all the data to the project root directory.\n * - The first [TensorFlowInferenceModel] is created via graph and weights loading.\n * - Model again predicts on a few images located in resources.\n * - The second [Functional] model is created via JSON configuration and weights loading.\n * - Model again predicts on a few images located in resources.\n */"} {"signature":"open fun shouldProcessNonAload0FieldAccessChains ( ) : Boolean","body":"= false","docstring":"/**constructors could access outer not through\n * ALOAD 0 //this\n * GETFIELD this$0 //outer\n * GETFIELD this$0 //outer of outer\n * but directly through constructor parameter\n * ALOAD X //outer\n * GETFIELD this$0 //outer of outer\n */"} {"signature":"private fun isDefaultValueForType ( type : Type , value : Any ? ) : Boolean","body":"= when ( type ) { Type . BOOLEAN_TYPE -> value is Boolean && ! value Type . CHAR_TYPE -> value is Char && value . code == Type . BYTE_TYPE , Type . SHORT_TYPE , Type . INT_TYPE , Type . LONG_TYPE -> value is Number && value . toLong ( ) == Type . FLOAT_TYPE -> value is Number && value . toFloat ( ) . equals ( ) Type . DOUBLE_TYPE -> value is Number && value . toDouble ( ) . equals ( ) else -> ! isPrimitive ( type ) && value == null }","docstring":"/**\n * Returns true if the given constant value is the JVM's default value for the given type.\n * See: https://docs.oracle.com/javase/specs/jvms/se8/html/jvms-2.html#jvms-2.3\n */"} {"signature":"fun getKotlinDevRepositoryUrl ( project : Project ) : String ?","body":"{ val url = project . rootProject . properties [ \"\" ] as? String if ( url != null ) { project . logger . info ( \"\"\"\"\"\" ) } return url }","docstring":"/**\n * Kotlin compiler artifacts are expected to be downloaded from maven central by default.\n * In case of compiling with kotlin compiler artifacts that are not published into the MC,\n * a kotlin_repo_url gradle parameter should be specified.\n * To reproduce a build locally, a kotlin/dev repo should be passed.\n *\n * @return an url for a kotlin compiler repository parametrized from command line or gradle.properties,\n * empty string otherwise\n */"} {"signature":"fun addDevRepositoryIfEnabled ( repositoryHandler : RepositoryHandler , project : Project )","body":"{ val devRepoUrl = getKotlinDevRepositoryUrl ( project ) ? : return repositoryHandler . maven { url = URI . create ( devRepoUrl ) } }","docstring":"/**\n * If the kotlin_repo_url gradle parameter is provided, adds it to the [repositoryHandler].\n */"} {"signature":"@ ExperimentalCoroutinesApi public actual fun CoroutineScope . newCoroutineContext ( context : CoroutineContext ) : CoroutineContext","body":"{ val combined = foldCopies ( coroutineContext , context , true ) val debug = if ( DEBUG ) combined + CoroutineId ( COROUTINE_ID . incrementAndGet ( ) ) else combined return if ( combined !== Dispatchers . Default && combined [ ContinuationInterceptor ] == null ) debug + Dispatchers . Default else debug }","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 * See [DEBUG_PROPERTY_NAME] for description of debugging facilities on JVM.\n */"} {"signature":"@ InternalCoroutinesApi public actual fun CoroutineContext . newCoroutineContext ( addedContext : CoroutineContext ) : CoroutineContext","body":"{ if ( ! addedContext . hasCopyableElements ( ) ) return this + addedContext return foldCopies ( this , addedContext , false ) }","docstring":"/**\n * Creates a context for coroutine builder functions that do not launch a new coroutine, e.g. [withContext].\n * @suppress\n */"} {"signature":"private fun foldCopies ( originalContext : CoroutineContext , appendContext : CoroutineContext , isNewCoroutine : Boolean ) : CoroutineContext","body":"{ val hasElementsLeft = originalContext . hasCopyableElements ( ) val hasElementsRight = appendContext . hasCopyableElements ( ) if ( ! hasElementsLeft && ! hasElementsRight ) { return originalContext + appendContext } var leftoverContext = appendContext val folded = originalContext . fold < CoroutineContext > ( EmptyCoroutineContext ) { result , element -> if ( element !is CopyableThreadContextElement < * > ) return@fold result + element val newElement = leftoverContext [ element . key ] if ( newElement == null ) { return@fold result + if ( isNewCoroutine ) element . copyForChild ( ) else element } leftoverContext = leftoverContext . minusKey ( element . key ) @ Suppress ( \"\" ) return@fold result + ( element as CopyableThreadContextElement < Any ? > ) . mergeForChild ( newElement ) } if ( hasElementsRight ) { leftoverContext = leftoverContext . fold < CoroutineContext > ( EmptyCoroutineContext ) { result , element -> if ( element is CopyableThreadContextElement < * > ) { return@fold result + element . copyForChild ( ) } return@fold result + element } } return folded + leftoverContext }","docstring":"/**\n * Folds two contexts properly applying [CopyableThreadContextElement] rules when necessary.\n * The rules are the following:\n * - If neither context has CTCE, the sum of two contexts is returned\n * - Every CTCE from the left-hand side context that does not have a matching (by key) element from right-hand side context\n * is [copied][CopyableThreadContextElement.copyForChild] if [isNewCoroutine] is `true`.\n * - Every CTCE from the left-hand side context that has a matching element in the right-hand side context is [merged][CopyableThreadContextElement.mergeForChild]\n * - Every CTCE from the right-hand side context that hasn't been merged is copied\n * - Everything else is added to the resulting context as is.\n */"} {"signature":"internal actual inline fun < T > withCoroutineContext ( context : CoroutineContext , countOrElement : Any ? , block : ( ) -> T ) : T","body":"{ val oldValue = updateThreadContext ( context , countOrElement ) try { return block ( ) } finally { restoreThreadContext ( context , oldValue ) } }","docstring":"/**\n * Executes a block using a given coroutine context.\n */"} {"signature":"internal actual inline fun < T > withContinuationContext ( continuation : Continuation < * > , countOrElement : Any ? , block : ( ) -> T ) : T","body":"{ val context = continuation . context val oldValue = updateThreadContext ( context , countOrElement ) val undispatchedCompletion = if ( oldValue !== NO_THREAD_ELEMENTS ) { continuation . updateUndispatchedCompletion ( context , oldValue ) } else { null } try { return block ( ) } finally { if ( undispatchedCompletion == null || undispatchedCompletion . clearThreadContext ( ) ) { restoreThreadContext ( context , oldValue ) } } }","docstring":"/**\n * Executes a block using a context of a given continuation.\n */"} {"signature":"internal fun indexSegment ( index : Int , shift : Int ) : Int","body":"= ( index shr shift ) and MAX_BRANCHING_FACTOR_MINUS_ONE","docstring":"/**\n * Gets trie index segment of the specified [index] at the level specified by [shift].\n *\n * `shift` equal to zero corresponds to the root level.\n * For each lower level `shift` increments by [LOG_MAX_BRANCHING_FACTOR].\n */"} {"signature":"internal fun entryCount ( ) : Int","body":"= dataMap . countOneBits ( )","docstring":"/** Returns number of entries stored in this trie node (not counting subnodes) */"} {"signature":"internal fun hasEntryAt ( positionMask : Int ) : Boolean","body":"{ return dataMap and positionMask != }","docstring":"/** Returns true if the data bit map has the bit specified by [positionMask] set, indicating there's a data entry in the buffer at that position. */"} {"signature":"private fun hasNodeAt ( positionMask : Int ) : Boolean","body":"{ return nodeMap and positionMask != }","docstring":"/** Returns true if the node bit map has the bit specified by [positionMask] set, indicating there's a subtrie node in the buffer at that position. */"} {"signature":"internal fun entryKeyIndex ( positionMask : Int ) : Int","body":"{ return ENTRY_SIZE * ( dataMap and ( positionMask - ) ) . countOneBits ( ) }","docstring":"/** Gets the index in buffer of the data entry key corresponding to the position specified by [positionMask]. */"} {"signature":"internal fun nodeIndex ( positionMask : Int ) : Int","body":"{ return buffer . size - - ( nodeMap and ( positionMask - ) ) . countOneBits ( ) }","docstring":"/** Gets the index in buffer of the subtrie node entry corresponding to the position specified by [positionMask]. */"} {"signature":"private fun keyAtIndex ( keyIndex : Int ) : K","body":"{ @ Suppress ( \"\" ) return buffer [ keyIndex ] as K }","docstring":"/** Retrieves the buffer element at the given [keyIndex] as key of a data entry. */"} {"signature":"private fun valueAtKeyIndex ( keyIndex : Int ) : V","body":"{ @ Suppress ( \"\" ) return buffer [ keyIndex + ] as V }","docstring":"/** Retrieves the buffer element next to the given [keyIndex] as value of a data entry. */"} {"signature":"internal fun nodeAtIndex ( nodeIndex : Int ) : TrieNode < K , V >","body":"{ @ Suppress ( \"\" ) return buffer [ nodeIndex ] as TrieNode < K , V > }","docstring":"/** Retrieves the buffer element at the given [nodeIndex] as subtrie node. */"} {"signature":"private fun updateNodeAtIndex ( nodeIndex : Int , positionMask : Int , newNode : TrieNode < K , V > ) : TrieNode < K , V >","body":"{ val newNodeBuffer = newNode . buffer if ( newNodeBuffer . size == && newNode . nodeMap == ) { if ( buffer . size == ) { newNode . dataMap = nodeMap return newNode } val keyIndex = entryKeyIndex ( positionMask ) val newBuffer = buffer . replaceNodeWithEntry ( nodeIndex , keyIndex , newNodeBuffer [ ] , newNodeBuffer [ ] ) return TrieNode ( dataMap xor positionMask , nodeMap xor positionMask , newBuffer ) } val newBuffer = buffer . copyOf ( buffer . size ) newBuffer [ nodeIndex ] = newNode return TrieNode ( dataMap , nodeMap , newBuffer ) }","docstring":"/** The given [newNode] must not be a part of any persistent map instance. */"} {"signature":"private fun mutableUpdateNodeAtIndex ( nodeIndex : Int , newNode : TrieNode < K , V > , owner : MutabilityOwnership ) : TrieNode < K , V >","body":"{ assert ( newNode . ownedBy === owner ) if ( buffer . size == && newNode . buffer . size == ENTRY_SIZE && newNode . nodeMap == ) { newNode . dataMap = nodeMap return newNode } if ( ownedBy === owner ) { buffer [ nodeIndex ] = newNode return this } val newBuffer = buffer . copyOf ( ) newBuffer [ nodeIndex ] = newNode return TrieNode ( dataMap , nodeMap , newBuffer , owner ) }","docstring":"/** The given [newNode] must not be a part of any persistent map instance. */"} {"signature":"private fun makeNode ( keyHash1 : Int , key1 : K , value1 : V , keyHash2 : Int , key2 : K , value2 : V , shift : Int , owner : MutabilityOwnership ? ) : TrieNode < K , V >","body":"{ if ( shift > MAX_SHIFT ) { return TrieNode ( , , arrayOf ( key1 , value1 , key2 , value2 ) , owner ) } val setBit1 = indexSegment ( keyHash1 , shift ) val setBit2 = indexSegment ( keyHash2 , shift ) if ( setBit1 != setBit2 ) { val nodeBuffer = if ( setBit1 < setBit2 ) { arrayOf ( key1 , value1 , key2 , value2 ) } else { arrayOf ( key2 , value2 , key1 , value1 ) } return TrieNode ( ( shl setBit1 ) or ( shl setBit2 ) , , nodeBuffer , owner ) } val node = makeNode ( keyHash1 , key1 , value1 , keyHash2 , key2 , value2 , shift + LOG_MAX_BRANCHING_FACTOR , owner ) return TrieNode ( , shl setBit1 , arrayOf < Any ? > ( node ) , owner ) }","docstring":"/** Creates a new TrieNode for holding two given key value entries */"} {"signature":"private fun mutablePutAllFromOtherNodeCell ( otherNode : TrieNode < K , V > , positionMask : Int , shift : Int , intersectionCounter : DeltaCounter , mutator : PersistentHashMapBuilder < K , V > ) : TrieNode < K , V >","body":"= when { this . hasNodeAt ( positionMask ) -> { val targetNode = this . nodeAtIndex ( nodeIndex ( positionMask ) ) when { otherNode . hasNodeAt ( positionMask ) -> { val otherTargetNode = otherNode . nodeAtIndex ( otherNode . nodeIndex ( positionMask ) ) targetNode . mutablePutAll ( otherTargetNode , shift + LOG_MAX_BRANCHING_FACTOR , intersectionCounter , mutator ) } otherNode . hasEntryAt ( positionMask ) -> { val keyIndex = otherNode . entryKeyIndex ( positionMask ) val key = otherNode . keyAtIndex ( keyIndex ) val value = otherNode . valueAtKeyIndex ( keyIndex ) val oldSize = mutator . size targetNode . mutablePut ( key . hashCode ( ) , key , value , shift + LOG_MAX_BRANCHING_FACTOR , mutator ) . also { if ( mutator . size == oldSize ) intersectionCounter . count ++ } } else -> targetNode } } otherNode . hasNodeAt ( positionMask ) -> { val otherTargetNode = otherNode . nodeAtIndex ( otherNode . nodeIndex ( positionMask ) ) when { this . hasEntryAt ( positionMask ) -> { val keyIndex = this . entryKeyIndex ( positionMask ) val key = this . keyAtIndex ( keyIndex ) if ( otherTargetNode . containsKey ( key . hashCode ( ) , key , shift + LOG_MAX_BRANCHING_FACTOR ) ) { intersectionCounter . count ++ otherTargetNode } else { val value = this . valueAtKeyIndex ( keyIndex ) otherTargetNode . mutablePut ( key . hashCode ( ) , key , value , shift + LOG_MAX_BRANCHING_FACTOR , mutator ) } } else -> otherTargetNode } } else -> { val thisKeyIndex = this . entryKeyIndex ( positionMask ) val thisKey = this . keyAtIndex ( thisKeyIndex ) val thisValue = this . valueAtKeyIndex ( thisKeyIndex ) val otherKeyIndex = otherNode . entryKeyIndex ( positionMask ) val otherKey = otherNode . keyAtIndex ( otherKeyIndex ) val otherValue = otherNode . valueAtKeyIndex ( otherKeyIndex ) makeNode ( thisKey . hashCode ( ) , thisKey , thisValue , otherKey . hashCode ( ) , otherKey , otherValue , shift + LOG_MAX_BRANCHING_FACTOR , mutator . ownership ) } }","docstring":"/**\n * Updates the cell of this node at [positionMask] with entries from the cell of [otherNode] at [positionMask].\n */"} {"signature":"public fun Array < * > . flattenFloats ( ) : FloatArray","body":"{ val result = mutableListOf < Float > ( ) fun flatten ( array : Any ? ) : Unit = when ( array ) { is FloatArray -> array . forEach { result . add ( it ) } is Array < * > -> array . forEach { flatten ( it ) } else -> throw IllegalArgumentException ( \"\" ) } flatten ( this ) return result . toFloatArray ( ) }","docstring":"/**\n * Flattens the given array of float values.\n * @return flattened array\n */"} {"signature":"private fun stdlibCommonMainDependency ( kotlin : KotlinMultiplatformExtension )","body":"= binaryCoordinates ( \"\" )","docstring":"/**\n * Refers to the 'commonMain' source set of the kotlin stdlib\n */"} {"signature":"internal fun String . indented ( nSpaces : Int = , skipFirstLine : Boolean = false ) : String","body":"{ val spaces = String ( CharArray ( nSpaces ) { '' } ) return lines ( ) . withIndex ( ) . joinToString ( separator = \"\" ) { ( index , line ) -> if ( skipFirstLine && index == ) return@joinToString line if ( line . isNotBlank ( ) ) \"\" else line } }","docstring":"/**\n * @param skipFirstLine if true doesn't indent first line\n */"} {"signature":"@ Deprecated ( level = DeprecationLevel . WARNING , message = message ) override fun start ( ) : Boolean","body":"= false","docstring":"/**\n * Always returns `false`.\n * @suppress **This an internal API and should not be used from general code.**\n */"} {"signature":"@ Deprecated ( level = DeprecationLevel . WARNING , message = message ) override suspend fun join ( )","body":"{ throw UnsupportedOperationException ( \"\" ) }","docstring":"/**\n * Always throws [UnsupportedOperationException].\n * @suppress **This an internal API and should not be used from general code.**\n */"} {"signature":"@ Deprecated ( level = DeprecationLevel . WARNING , message = message ) override fun getCancellationException ( ) : CancellationException","body":"= throw IllegalStateException ( \"\" )","docstring":"/**\n * Always throws [IllegalStateException].\n * @suppress **This an internal API and should not be used from general code.**\n */"} {"signature":"@ Deprecated ( level = DeprecationLevel . WARNING , message = message ) override fun invokeOnCompletion ( handler : CompletionHandler ) : DisposableHandle","body":"= NonDisposableHandle","docstring":"/**\n * @suppress **This an internal API and should not be used from general code.**\n */"} {"signature":"@ Deprecated ( level = DeprecationLevel . WARNING , message = message ) override fun invokeOnCompletion ( onCancelling : Boolean , invokeImmediately : Boolean , handler : CompletionHandler ) : DisposableHandle","body":"= NonDisposableHandle","docstring":"/**\n * Always returns no-op handle.\n * @suppress **This an internal API and should not be used from general code.**\n */"} {"signature":"@ Deprecated ( level = DeprecationLevel . WARNING , message = message ) override fun cancel ( cause : CancellationException ? )","body":"{ }","docstring":"/**\n * Does nothing.\n * @suppress **This an internal API and should not be used from general code.**\n */"} {"signature":"@ Deprecated ( level = DeprecationLevel . HIDDEN , message = \"\" ) override fun cancel ( cause : Throwable ? ) : Boolean","body":"= false","docstring":"/**\n * Always returns `false`.\n * @suppress This method has bad semantics when cause is not a [CancellationException]. Use [cancel].\n */"} {"signature":"@ Deprecated ( level = DeprecationLevel . WARNING , message = message ) override fun attachChild ( child : ChildJob ) : ChildHandle","body":"= NonDisposableHandle","docstring":"/**\n * Always returns [NonDisposableHandle] and does not do anything.\n * @suppress **This an internal API and should not be used from general code.**\n */"} {"signature":"override fun toString ( ) : String","body":"{ return \"\" }","docstring":"/** @suppress */"} {"signature":"public fun < T : FlatShape < T > > OnnxHighLevelModel < BufferedImage , List < T > > . predictOnCrop ( image : BufferedImage , detectedObject : DetectedObject ) : List < T >","body":"{ val objectWidth = detectedObject . xMax - detectedObject . xMin val objectHeight = detectedObject . yMax - detectedObject . yMin val x1 = ( ( detectedObject . xMin - * objectWidth ) * image . width ) . toInt ( ) . coerceAtLeast ( ) val y1 = ( ( detectedObject . yMin - * objectHeight ) * image . height ) . toInt ( ) . coerceAtLeast ( ) val x2 = ( ( detectedObject . xMax + * objectWidth ) * image . width ) . toInt ( ) . coerceAtMost ( image . width ) val y2 = ( ( detectedObject . yMax + * objectHeight ) * image . height ) . toInt ( ) . coerceAtMost ( image . height ) val cropImage = pipeline < BufferedImage > ( ) . crop { left = x1 top = y1 right = image . width - x2 bottom = image . height - y2 } . apply ( image ) return predict ( cropImage ) . map { shape -> shape . map { x , y -> ( x1 + x * cropImage . width ) / image . width to ( y1 + y * cropImage . height ) / image . height } } }","docstring":"/**\n * Runs prediction on an image crop, base on the provided [detectedObject]. Could be used for combining several\n * inference models together, for example detecting a face with\n * a [org.jetbrains.kotlinx.dl.onnx.inference.facealignment.FaceDetectionModel], then detecting face landmarks on the face\n * using a [org.jetbrains.kotlinx.dl.onnx.inference.facealignment.Fan2D106FaceAlignmentModel].\n *\n * @param [image] input image\n * @param [detectedObject] object, detected on this image, to run predictions on\n */"} {"signature":"public fun invoke ( input : FloatArray ) : FloatArray","body":"public fun invoke ( input : FloatArray ) : FloatArray","docstring":"/**\n * Invoke some transform for an [input] [FloatArray].\n * @param [input] [FloatArray] to transform.\n * */"} {"signature":"public fun denormalizeInplace ( input : FloatArray , scale : Float ) : FloatArray","body":"{ input . forEachIndexed { index , value -> input [ index ] = value * scale } return input }","docstring":"/**\n * Each array element of an [input] is multiplied in-place by [scale] coefficient.\n * @param [input] [FloatArray] to multiply by [scale].\n * @param [scale] [Float] coefficient.\n */"} {"signature":"fun usage ( )","body":"{ }","docstring":"/**\n * [FooAlias.fooExt]\n *\n * [Foo.fooAliasExt]\n * [FooAlias.fooAliasExt]\n *\n * [FooAlias.anyExt]\n * [FooAlias.otherExt]\n */"} {"signature":"@ TemplateTest ( \"\" , [ \"\" , \"\" ] ) fun CheckerContext . testAndroidInverseOrder ( )","body":"{ subproject ( \"\" ) { checkXmlReport ( \"\" ) checkXmlReport ( \"\" ) checkOutcome ( \"\" , \"\" ) checkOutcome ( \"\" , \"\" ) } }","docstring":"/**\n * A test to verify that the order of application of the Kover plugin does not affect the correct operation.\n * Kover + Kotlin Android Plugin\n */"} {"signature":"@ TemplateTest ( \"\" , [ \"\" , \"\" ] ) fun CheckerContext . testAndroidMppInverseOrder ( )","body":"{ checkXmlReport ( \"\" ) checkXmlReport ( \"\" ) checkOutcome ( \"\" , \"\" ) checkOutcome ( \"\" , \"\" ) }","docstring":"/**\n * A test to verify that the order of application of the Kover plugin does not affect the correct operation.\n * Kover + Kotlin Multiplatform Plugin with Android target\n */"} {"signature":"fun consume ( parameters : CommonizerParameters , target : CommonizerTarget , moduleResult : ModuleResult )","body":"= Unit","docstring":"/**\n * Consume a single [ModuleResult] for the specified [CommonizerTarget].\n */"} {"signature":"fun targetConsumed ( parameters : CommonizerParameters , target : CommonizerTarget )","body":"= Unit","docstring":"/**\n * Mark the specified [CommonizerTarget] as fully consumed.\n * It's forbidden to make subsequent [consume] calls for fully consumed targets.\n */"} {"signature":"fun allConsumed ( parameters : CommonizerParameters , status : Status )","body":"= Unit","docstring":"/**\n * Notify that all results have been consumed.\n * It's forbidden to make any subsequent [consume] and [targetConsumed] calls after this call.\n */"} {"signature":"private fun isKotlinWithCompatibleAbiVersion ( file : VirtualFile , jvmMetadataVersion : JvmMetadataVersion ) : Boolean","body":"{ val clsKotlinBinaryClassCache = ClsKotlinBinaryClassCache . getInstance ( ) if ( ! clsKotlinBinaryClassCache . isKotlinJvmCompiledFile ( file ) ) return false val kotlinClass = clsKotlinBinaryClassCache . getKotlinBinaryClassHeaderData ( file ) return kotlinClass != null && kotlinClass . metadataVersion . isCompatible ( jvmMetadataVersion ) }","docstring":"/**\n * Checks if this file is a compiled Kotlin class file ABI-compatible with the current plugin\n */"} {"signature":"fun test ( )","body":"{ }","docstring":"/**\n * [ClassWithCompanion.foo]\n */"} {"signature":"public fun Job . asCompletable ( context : CoroutineContext ) : Completable","body":"= rxCompletable ( context ) { this@asCompletable . join ( ) }","docstring":"/**\n * Converts this job to the hot reactive completable that signals\n * with [onCompleted][CompletableObserver.onComplete] when the corresponding job completes.\n *\n * Every subscriber gets the signal at the same time.\n * Unsubscribing from the resulting completable **does not** affect the original job in any way.\n *\n * **Note: This is an experimental api.** Conversion of coroutines primitives to reactive entities may change\n * in the future to account for the concept of structured concurrency.\n *\n * @param context -- the coroutine context from which the resulting completable is going to be signalled\n */"} {"signature":"public fun < T > Deferred < T ? > . asMaybe ( context : CoroutineContext ) : Maybe < T >","body":"= rxMaybe ( context ) { this@asMaybe . await ( ) }","docstring":"/**\n * Converts this deferred value to the hot reactive maybe that signals\n * [onComplete][MaybeEmitter.onComplete], [onSuccess][MaybeEmitter.onSuccess] or [onError][MaybeEmitter.onError].\n *\n * Every subscriber gets the same completion value.\n * Unsubscribing from the resulting maybe **does not** affect the original deferred value in any way.\n *\n * **Note: This is an experimental api.** Conversion of coroutines primitives to reactive entities may change\n * in the future to account for the concept of structured concurrency.\n *\n * @param context -- the coroutine context from which the resulting maybe is going to be signalled\n */"} {"signature":"public fun < T : Any > Deferred < T > . asSingle ( context : CoroutineContext ) : Single < T >","body":"= rxSingle ( context ) { this@asSingle . await ( ) }","docstring":"/**\n * Converts this deferred value to the hot reactive single that signals either\n * [onSuccess][SingleObserver.onSuccess] or [onError][SingleObserver.onError].\n *\n * Every subscriber gets the same completion value.\n * Unsubscribing from the resulting single **does not** affect the original deferred value in any way.\n *\n * **Note: This is an experimental api.** Conversion of coroutines primitives to reactive entities may change\n * in the future to account for the concept of structured concurrency.\n *\n * @param context -- the coroutine context from which the resulting single is going to be signalled\n */"} {"signature":"public fun < T : Any > ObservableSource < T > . asFlow ( ) : Flow < T >","body":"= callbackFlow { val disposableRef = AtomicReference < Disposable > ( ) val observer = object : Observer < T > { override fun onComplete ( ) { close ( ) } override fun onSubscribe ( d : Disposable ) { if ( ! disposableRef . compareAndSet ( null , d ) ) d . dispose ( ) } override fun onNext ( t : T ) { try { trySendBlocking ( t ) } catch ( e : InterruptedException ) { } } override fun onError ( e : Throwable ) { close ( e ) } } subscribe ( observer ) awaitClose { disposableRef . getAndSet ( Disposables . disposed ( ) ) ? . dispose ( ) } }","docstring":"/**\n * Transforms given cold [ObservableSource] into cold [Flow].\n *\n * The resulting flow is _cold_, which means that [ObservableSource.subscribe] is called every time a terminal operator\n * is applied to the resulting flow.\n *\n * A channel with the [default][Channel.BUFFERED] buffer size is used. Use the [buffer] operator on the\n * resulting flow to specify a user-defined value and to control what happens when data is produced faster\n * than consumed, i.e. to control the back-pressure behavior. Check [callbackFlow] for more details.\n */"} {"signature":"public fun < T : Any > Flow < T > . asObservable ( context : CoroutineContext = EmptyCoroutineContext ) : Observable < T >","body":"= Observable . create { emitter -> val job = GlobalScope . launch ( Dispatchers . Unconfined + context , start = CoroutineStart . ATOMIC ) { try { collect { value -> emitter . onNext ( value ) } emitter . onComplete ( ) } catch ( e : Throwable ) { if ( e !is CancellationException ) { if ( ! emitter . tryOnError ( e ) ) { handleUndeliverableException ( e , coroutineContext ) } } else { emitter . onComplete ( ) } } } emitter . setCancellable ( RxCancellable ( job ) ) }","docstring":"/**\n * Converts the given flow to a cold observable.\n * The original flow is cancelled when the observable subscriber is disposed.\n *\n * An optional [context] can be specified to control the execution context of calls to [Observer] methods.\n * You can set a [CoroutineDispatcher] to confine them to a specific thread and/or various [ThreadContextElement] 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 < T : Any > Flow < T > . asFlowable ( context : CoroutineContext = EmptyCoroutineContext ) : Flowable < T >","body":"= Flowable . fromPublisher ( asPublisher ( context ) )","docstring":"/**\n * Converts the given flow to a cold flowable.\n * The original flow is cancelled when the flowable subscriber is disposed.\n *\n * An optional [context] can be specified to control the execution context of calls to [Subscriber] methods.\n * You can set a [CoroutineDispatcher] to confine them to a specific thread and/or various [ThreadContextElement] 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":"@ Suppress ( \"\" ) @ JvmOverloads @ JvmName ( \"\" ) @ Deprecated ( level = DeprecationLevel . HIDDEN , message = \"\" ) public fun < T : Any > Flow < T > . _asFlowable ( context : CoroutineContext = EmptyCoroutineContext ) : Flowable < T >","body":"= asFlowable ( context )","docstring":"/** @suppress **/"} {"signature":"@ Suppress ( \"\" ) @ JvmOverloads @ JvmName ( \"\" ) @ Deprecated ( level = DeprecationLevel . HIDDEN , message = \"\" ) public fun < T : Any > Flow < T > . _asObservable ( context : CoroutineContext = EmptyCoroutineContext ) : Observable < T >","body":"= asObservable ( context )","docstring":"/** @suppress **/"} {"signature":"@ Deprecated ( message = \"\" , replaceWith = ReplaceWith ( \"\" ) ) fun createKotlinJvmOptions ( ) : KotlinJvmOptionsDeprecated","body":"@ Deprecated ( message = \"\" , replaceWith = ReplaceWith ( \"\" ) ) fun createKotlinJvmOptions ( ) : KotlinJvmOptionsDeprecated","docstring":"/**\n * Creates instance of DSL object that should be used to configure JVM/android specific compilation.\n *\n * Note: [CompilerJvmOptions] instance inside [KotlinJvmOptions] is not the same as returned by [createCompilerJvmOptions]\n */"} {"signature":"@ Deprecated ( message = \"\" , replaceWith = ReplaceWith ( \"\" ) ) fun registerKotlinJvmCompileTask ( taskName : String ) : TaskProvider < out KotlinJvmCompile >","body":"@ Deprecated ( message = \"\" , replaceWith = ReplaceWith ( \"\" ) ) fun registerKotlinJvmCompileTask ( taskName : String ) : TaskProvider < out KotlinJvmCompile >","docstring":"/**\n * Creates a Kotlin compile task.\n */"} {"signature":"fun registerKotlinJvmCompileTask ( taskName : String , moduleName : String ) : TaskProvider < out KotlinJvmCompile >","body":"fun registerKotlinJvmCompileTask ( taskName : String , moduleName : String ) : TaskProvider < out KotlinJvmCompile >","docstring":"/**\n * Creates a Kotlin JVM compile task.\n *\n * @param taskName The name of the task to be created.\n * @param moduleName The name of the module for which the task is being created.\n * @return The task provider for the Kotlin JVM compile task.\n */"} {"signature":"fun registerKaptGenerateStubsTask ( taskName : String ) : TaskProvider < out KaptGenerateStubs >","body":"fun registerKaptGenerateStubsTask ( taskName : String ) : TaskProvider < out KaptGenerateStubs >","docstring":"/** Creates a stub generation task which creates Java sources stubs from Kotlin sources. */"} {"signature":"fun registerKaptTask ( taskName : String ) : TaskProvider < out Kapt >","body":"fun registerKaptTask ( taskName : String ) : TaskProvider < out Kapt >","docstring":"/** Creates a KAPT task which runs annotation processing. */"} {"signature":"fun addCompilerPluginDependency ( dependency : Provider < Any > )","body":"fun addCompilerPluginDependency ( dependency : Provider < Any > )","docstring":"/** Adds a compiler plugin dependency to this project. This can be e.g a Maven coordinate or a project included in the build. */"} {"signature":"fun getCompilerPlugins ( ) : FileCollection","body":"fun getCompilerPlugins ( ) : FileCollection","docstring":"/** Returns a [FileCollection] that contains all compiler plugins classpath for this project. */"} {"signature":"fun createIfNeeded ( session : FirSession , moduleDataProvider : ModuleDataProvider , kotlinScopeProvider : FirKotlinScopeProvider , packagePartProvider : PackagePartProvider , defaultDeserializationOrigin : FirDeclarationOrigin = FirDeclarationOrigin . Library , ) : OptionalAnnotationClassesProvider ?","body":"{ if ( ! packagePartProvider . mayHaveOptionalAnnotationClasses ( ) ) return null return OptionalAnnotationClassesProvider ( session , moduleDataProvider , kotlinScopeProvider , packagePartProvider , defaultDeserializationOrigin , ) }","docstring":"/**\n * Creates a new [OptionalAnnotationClassesProvider] if [packagePartProvider] has any optional annotation classes. Otherwise, the\n * symbol provider does not need to be created because it would provide no symbols.\n */"} {"signature":"fun isDylib ( file : File , logger : Logger ) : Boolean","body":"{ try { RandomAccessFile ( file , \"\" ) . use { raf -> val magic = raf . readInt ( ) . fromUIntToLong ( ) val fileTypeOffset = when ( magic ) { MH_CIGAM , MH_CIGAM_64 -> FILE_TYPE_OFFSET FAT_MAGIC , FAT_MAGIC_64 -> { raf . seek ( FAT_FIRST_MACHO_OFFSET_OFFSET ) val firstMachoOffset = raf . readInt ( ) . fromUIntToLong ( ) firstMachoOffset + FILE_TYPE_OFFSET } else -> return false } raf . seek ( fileTypeOffset ) val fileType = raf . readInt ( ) . toLong ( ) return fileType == MH_BILYD } } catch ( e : IOException ) { logger . info ( \"\" , e ) return false } }","docstring":"/**\n * Checks if the [file] is a Mach-O dynamic shared library\n * or a Mach-O fat binary containing a number of dynamic libraries\n */"} {"signature":"public fun < T > lower ( column : ColumnReference < T > , ) : PositionalMapping < T >","body":"{ return addPositionalMapping < T > ( LOWER , column . name ( ) , null ) }","docstring":"/**\n * Maps the `lower` 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 > lower ( column : KProperty < T > , ) : PositionalMapping < T >","body":"{ return addPositionalMapping < T > ( LOWER , column . name , null ) }","docstring":"/**\n * Maps the `lower` 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 lower ( column : String , ) : PositionalMapping < Any ? >","body":"{ return addPositionalMapping ( LOWER , column , null ) }","docstring":"/**\n * Maps the `lower` 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 > lower ( values : Iterable < T > , ) : PositionalMapping < T >","body":"{ return addPositionalMapping < T > ( LOWER , values . toList ( ) , null , null ) }","docstring":"/**\n * Maps the `lower` 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 > lower ( values : DataColumn < T > , ) : PositionalMapping < T >","body":"{ return addPositionalMapping < T > ( LOWER , values , null ) }","docstring":"/**\n * Maps the `lower` 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":"@ Test fun testCancelledAwait ( )","body":"= runTest { val d = async { delay ( Long . MAX_VALUE ) } repeat ( n ) { val waiter = launch ( start = CoroutineStart . UNDISPATCHED ) { val a = ByteArray ( ) d . await ( ) keepMe ( a ) } waiter . cancel ( ) yield ( ) } d . cancel ( ) }","docstring":"/**\n * Tests that memory does not leak from cancelled [Deferred.await]\n */"} {"signature":"@ Test fun testCancelledJoin ( )","body":"= runTest { val j = launch { delay ( Long . MAX_VALUE ) } repeat ( n ) { val joiner = launch ( start = CoroutineStart . UNDISPATCHED ) { val a = ByteArray ( ) j . join ( ) keepMe ( a ) } joiner . cancel ( ) yield ( ) } j . cancel ( ) }","docstring":"/**\n * Tests that memory does not leak from cancelled [Job.join]\n */"} {"signature":"public fun < T > slice ( column : ColumnReference < T > , ) : PositionalMapping < T >","body":"{ return addPositionalMapping < T > ( SLICE , column . name ( ) , null ) }","docstring":"/**\n * Maps the `slice` 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 > slice ( column : KProperty < T > , ) : PositionalMapping < T >","body":"{ return addPositionalMapping < T > ( SLICE , column . name , null ) }","docstring":"/**\n * Maps the `slice` 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 slice ( column : String , ) : PositionalMapping < Any ? >","body":"{ return addPositionalMapping < Any ? > ( SLICE , column , null ) }","docstring":"/**\n * Maps the `slice` 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 > slice ( values : Iterable < T > , ) : PositionalMapping < T >","body":"{ return addPositionalMapping < T > ( SLICE , values . toList ( ) , null , null ) }","docstring":"/**\n * Maps the `slice` 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 > slice ( values : DataColumn < T > , ) : PositionalMapping < T >","body":"{ return addPositionalMapping < T > ( SLICE , values , null ) }","docstring":"/**\n * Maps the `slice` 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":"fun getModule ( element : PsiElement ) : KtModule","body":"{ return ProjectStructureProvider . getModule ( useSiteModule . project , element , useSiteModule ) }","docstring":"/**\n * Returns a [KtModule] for a given [element] in context of the current session.\n *\n * See [ProjectStructureProvider] for more information on contextual modules.\n */"} {"signature":"fun trainAndSave ( train : Dataset , test : Dataset , model : Sequential , path : String , accuracyThreshold : Double = )","body":"{ model . use { it . name = \"\" it . compile ( optimizer = SGD ( learningRate = ) , loss = Losses . SOFT_MAX_CROSS_ENTROPY_WITH_LOGITS , metric = Metrics . ACCURACY ) it . init ( ) var accuracy = while ( accuracy < accuracyThreshold ) { it . fit ( dataset = train , epochs = , batchSize = trainBatchSize , callback = object : Callback ( ) { override fun onTrainBatchEnd ( batch : Int , batchSize : Int , event : BatchTrainingEvent , logs : TrainingHistory ) { if ( event . metricValues [ ] > accuracyThreshold ) { println ( \"\" ) model . stopTraining = true } } } ) accuracy = it . evaluate ( dataset = test , batchSize = testBatchSize ) . metrics [ Metrics . ACCURACY ] ? : println ( \"\" ) } model . save ( modelDirectory = File ( path ) , savingFormat = SavingFormat . JsonConfigCustomVariables ( ) , writingMode = WritingMode . OVERRIDE ) } }","docstring":"/**\n * Train [model] on [train] dataset and evaluate accuracy on [test] dataset until [accuracyThreshold] is reached\n * then saves model to the folder [path].\n */"} {"signature":"abstract fun lazyResolveToPhase ( element : FirElementWithResolveState , toPhase : FirResolvePhase )","body":"abstract fun lazyResolveToPhase ( element : FirElementWithResolveState , toPhase : FirResolvePhase )","docstring":"/**\n * @see org.jetbrains.kotlin.fir.symbols.lazyResolveToPhase\n */"} {"signature":"abstract fun lazyResolveToPhaseWithCallableMembers ( clazz : FirClass , toPhase : FirResolvePhase )","body":"abstract fun lazyResolveToPhaseWithCallableMembers ( clazz : FirClass , toPhase : FirResolvePhase )","docstring":"/**\n * @see org.jetbrains.kotlin.fir.symbols.lazyResolveToPhaseWithCallableMembers\n */"} {"signature":"abstract fun lazyResolveToPhaseRecursively ( element : FirElementWithResolveState , toPhase : FirResolvePhase )","body":"abstract fun lazyResolveToPhaseRecursively ( element : FirElementWithResolveState , toPhase : FirResolvePhase )","docstring":"/**\n * @see org.jetbrains.kotlin.fir.symbols.lazyResolveToPhaseRecursively\n */"} {"signature":"fun FirBasedSymbol < * > . lazyResolveToPhase ( toPhase : FirResolvePhase )","body":"{ fir . lazyResolveToPhase ( toPhase ) }","docstring":"/**\n * Lazy resolve [FirBasedSymbol] to [FirResolvePhase].\n *\n * In the case of lazy resolution (inside Analysis API), it checks that the declaration phase `>= toPhase`.\n * If not, it resolves the declaration for the requested phase.\n *\n * If the [lazyResolveToPhase] is called inside a fir transformer,\n * it should always request the phase which is strictly lower than the current transformer phase, otherwise a deadlock/StackOverflow is possible.\n *\n * For the compiler mode, it does nothing, as the compiler is non-lazy.\n *\n * @receiver [FirBasedSymbol] which should be resolved\n * @param toPhase the minimum phase, the declaration should be resolved to after an execution of the [lazyResolveToPhase]\n */"} {"signature":"fun FirElementWithResolveState . lazyResolveToPhase ( toPhase : FirResolvePhase )","body":"{ invokeLazyResolveToPhase ( toPhase , FirLazyDeclarationResolver :: lazyResolveToPhase ) }","docstring":"/**\n * Lazy resolve [FirElementWithResolveState] to [FirResolvePhase].\n *\n * @see lazyResolveToPhase\n */"} {"signature":"fun FirClassSymbol < * > . lazyResolveToPhaseWithCallableMembers ( toPhase : FirResolvePhase )","body":"{ fir . lazyResolveToPhaseWithCallableMembers ( toPhase ) }","docstring":"/**\n * Lazy resolve [FirClassSymbol] and its callable members to [FirResolvePhase].\n *\n * Might resolve additional required declarations.\n *\n * Note: for the [STATUS][FirResolvePhase.STATUS] phase it guarantees\n * that all callables in [this] or superclasses are resolved to at least the [STATUS][FirResolvePhase.STATUS] phase.\n *\n * @receiver [FirClassSymbol] which should be resolved and which callable members should be resolved\n * @param toPhase the minimum phase, the declaration and callable members should be resolved\n * to after an execution of the [lazyResolveToPhaseWithCallableMembers]\n *\n * Can be used instead of [lazyResolveToPhase] to avoid extra resolve calls.\n * Effectively the same as:\n * ```\n * kclass.lazyResolveToPhase(phase)\n * kclass.callableDeclarations.forEach { it.lazyResolveToPhase(phase) }\n * ```\n *\n * @see lazyResolveToPhase\n */"} {"signature":"fun FirClass . lazyResolveToPhaseWithCallableMembers ( toPhase : FirResolvePhase )","body":"{ lazyDeclarationResolver . lazyResolveToPhaseWithCallableMembers ( this , toPhase ) }","docstring":"/**\n * Lazy resolve [FirClass] and its callable members to [FirResolvePhase].\n *\n * @see lazyResolveToPhaseWithCallableMembers\n */"} {"signature":"fun FirBasedSymbol < * > . lazyResolveToPhaseRecursively ( toPhase : FirResolvePhase )","body":"{ fir . lazyResolveToPhaseRecursively ( toPhase ) }","docstring":"/**\n * Lazy resolve [FirBasedSymbol] and all nested declarations to [FirResolvePhase].\n *\n * In the case of lazy resolution (inside Analysis API), it checks that the declaration phase `>= toPhase`.\n * If not, it resolves the declaration for the requested phase.\n *\n * If the [lazyResolveToPhase] is called inside a fir transformer,\n * it should always request the phase which is strictly lower than the current transformer phase,\n * otherwise a deadlock/StackOverflow is possible.\n *\n * For the compiler mode, it does nothing, as the compiler is non-lazy.\n *\n * @receiver [FirBasedSymbol] which should be resolved\n * @param toPhase the minimum phase, the declaration and all nested declarations should be resolved to after an execution of the [lazyResolveToPhase]\n */"} {"signature":"fun FirElementWithResolveState . lazyResolveToPhaseRecursively ( toPhase : FirResolvePhase )","body":"{ invokeLazyResolveToPhase ( toPhase , FirLazyDeclarationResolver :: lazyResolveToPhaseRecursively ) }","docstring":"/**\n * Lazy resolve [FirElementWithResolveState] and all nested declarations to [FirResolvePhase].\n *\n * @see lazyResolveToPhaseRecursively\n */"} {"signature":"@ Test fun testRfc7049IndefiniteByteStringExample ( )","body":"{ withDecoder ( input = \"\" ) { assertEquals ( expected = \"\" , actual = HexConverter . printHexBinary ( nextByteString ( ) , lowerCase = true ) ) } }","docstring":"/**\n * Test using example shown on page 11 of [RFC 7049 2.2.2](https://tools.ietf.org/html/rfc7049#section-2.2.2):\n *\n * ```\n * 0b010_11111 0b010_00100 0xaabbccdd 0b010_00011 0xeeff99 0b111_11111\n *\n * 5F -- Start indefinite-length byte string\n * 44 -- Byte string of length 4\n * aabbccdd -- Bytes content\n * 43 -- Byte string of length 3\n * eeff99 -- Bytes content\n * FF -- \"break\"\n *\n * After decoding, this results in a single byte string with seven\n * bytes: 0xaabbccddeeff99.\n * ```\n */"} {"signature":"@ Test fun testIgnoreUnknownKeysFailsWhenCborDataIsMissingKeysThatArePresentInKotlinClass ( )","body":"{ assertFailsWithMessage < SerializationException > ( \"\" ) { ignoreUnknownKeys . decodeFromHexString ( Simple . serializer ( ) , \"\" ) } assertFailsWithMessage < SerializationException > ( \"\" ) { ignoreUnknownKeys . decodeFromHexString ( Simple . serializer ( ) , \"\" ) } }","docstring":"/**\n * CBOR hex data represents serialized versions of [TypesUmbrella] (which does **not** have a root property 'a') so\n * decoding to [Simple] (which has the field 'a') is expected to fail.\n */"} {"signature":"@ Test fun testSkipPrimitives ( )","body":"{ withDecoder ( \"\" ) { expectMap ( size = ) expect ( \"\" ) skipElement ( ) expect ( \"\" ) skipElement ( ) expect ( \"\" ) skipElement ( ) expect ( \"\" ) skipElement ( ) expectEof ( ) } }","docstring":"/**\n * Tests skipping unknown keys associated with values of the following CBOR types:\n * - Major type 0: an unsigned integer\n * - Major type 1: a negative integer\n * - Major type 2: a byte string\n * - Major type 3: a text string\n */"} {"signature":"@ Test fun testSkipEmptyPrimitives ( )","body":"{ withDecoder ( \"\" ) { expectMap ( size = ) expect ( \"\" ) skipElement ( ) expect ( \"\" ) skipElement ( ) expectEof ( ) } }","docstring":"/**\n * Tests skipping unknown keys associated with values (that are empty) of the following CBOR types:\n * - Major type 2: a byte string\n * - Major type 3: a text string\n */"} {"signature":"@ Test fun testSkipCollections ( )","body":"{ withDecoder ( \"\" ) { expectMap ( size = ) expect ( \"\" ) skipElement ( ) expect ( \"\" ) skipElement ( ) expectEof ( ) } }","docstring":"/**\n * Tests skipping unknown keys associated with values of the following CBOR types:\n * - Major type 4: an array of data items\n * - Major type 5: a map of pairs of data items\n */"} {"signature":"@ Test fun testSkipEmptyCollections ( )","body":"{ withDecoder ( \"\" ) { expectMap ( size = ) expect ( \"\" ) skipElement ( ) expect ( \"\" ) skipElement ( ) expectEof ( ) } }","docstring":"/**\n * Tests skipping unknown keys associated with values (empty collections) of the following CBOR types:\n * - Major type 4: an array of data items\n * - Major type 5: a map of pairs of data items\n */"} {"signature":"@ Test fun testSkipIndefiniteLength ( )","body":"{ withDecoder ( \"\" ) { expectMap ( size = ) expect ( \"\" ) skipElement ( ) expect ( \"\" ) skipElement ( ) expect ( \"\" ) skipElement ( ) expect ( \"\" ) skipElement ( ) expectEof ( ) } }","docstring":"/**\n * Tests skipping unknown keys associated with **indefinite length** values of the following CBOR types:\n * - Major type 2: a byte string\n * - Major type 3: a text string\n * - Major type 4: an array of data items\n * - Major type 5: a map of pairs of data items\n */"} {"signature":"@ Test fun testSkipTags ( )","body":"{ withDecoder ( \"\" ) { expectMap ( size = ) expect ( \"\" ) skipElement ( ) expect ( \"\" ) skipElement ( ) expect ( \"\" ) skipElement ( ) expect ( \"\" ) skipElement ( ) expectEof ( ) } }","docstring":"/**\n * Tests that skipping unknown keys also skips over associated tags.\n *\n * Includes tags on the key, tags on the value, and tags on both key and value.\n */"} {"signature":"@ Test fun testDecodeCborWithUnknownKeysInSealedClasses ( )","body":"{ assertEquals ( expected = SealedBox ( listOf ( SubSealedA ( \"\" ) , SubSealedB ( ) ) ) , actual = ignoreUnknownKeys . decodeFromHexString ( SealedBox . serializer ( ) , \"\" ) ) }","docstring":"/**\n * The following CBOR diagnostic output demonstrates the additional fields (prefixed with `+` in front of each line)\n * present in the encoded CBOR data that does not have associated fields in the Kotlin classes (they will be skipped\n * over with `ignoreUnknownKeys` is enabled).\n *\n * ```diff\n * {\n * + \"extra\": [\n * + 9,\n * + 8,\n * + 7\n * + ],\n * \"boxed\": [\n * [\n * \"kotlinx.serialization.SimpleSealed.SubSealedA\",\n * {\n * \"s\": \"a\",\n * + \"newA\": {\n * + \"x\": 1,\n * + \"y\": 2\n * + }\n * }\n * ],\n * [\n * \"kotlinx.serialization.SimpleSealed.SubSealedB\",\n * {\n * \"i\": 1\n * }\n * ]\n * ]\n * }\n * ```\n */"} {"signature":"fun beforeTransformingChildren ( parentDeclaration : FirDeclaration ) : PersistentList < FirDeclaration >","body":"{ val current = owners owners = owners . add ( parentDeclaration ) return current }","docstring":"/**\n * Gets called before transforming [parentDeclaration]'s nested declarations (like in a class of a file).\n *\n * @param parentDeclaration A declaration whose nested declarations are about to be transformed.\n * @return Some state of the transformer; when the nested declarations are transformed, this state will be\n * passed to the [afterTransformingChildren].\n */"} {"signature":"fun afterTransformingChildren ( state : PersistentList < FirDeclaration > ? )","body":"{ requireNotNull ( state ) owners = state }","docstring":"/**\n * Gets called after performing transformation of some declaration's nested declarations; can be used to restore the internal\n * state of the transformer.\n *\n * @param state A state produced by the [beforeTransformingChildren] call before the transformation.\n */"} {"signature":"override fun getOutputShape ( inputShape : TensorShape ) : TensorShape","body":"{ return when ( inputShape . rank ( ) ) { , -> TensorShape ( inputShape [ ] , inputShape [ ] , colorMode . channels . toLong ( ) ) else -> throw IllegalArgumentException ( \"\" ) } }","docstring":"/**\n * Takes result color mode into account when computing output shape.\n */"} {"signature":"fun denseOnly ( )","body":"{ val ( train , test ) = mnist ( ) model . use { it . compile ( optimizer = Adam ( ) , loss = Losses . SOFT_MAX_CROSS_ENTROPY_WITH_LOGITS , metric = Metrics . ACCURACY ) 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 [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 * - model compilation\n * - model training\n * - model evaluation\n */"} {"signature":"fun main ( ) : Unit","body":"= denseOnly ( )","docstring":"/** */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalStdlibApi :: class ) public fun < T : Any > Optional < T > . getOrNull ( ) : T ?","body":"= orElse ( null )","docstring":"/**\n * Returns this [Optional]'s value if [present][Optional.isPresent], or otherwise `null`.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalStdlibApi :: class ) public fun < T > Optional < out T & Any > . getOrDefault ( defaultValue : T ) : T","body":"= if ( isPresent ) get ( ) else defaultValue","docstring":"/**\n * Returns this [Optional]'s value if [present][Optional.isPresent], or otherwise [defaultValue].\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalStdlibApi :: class ) public inline fun < T > Optional < out T & Any > . getOrElse ( defaultValue : ( ) -> T ) : T","body":"{ contract { callsInPlace ( defaultValue , InvocationKind . AT_MOST_ONCE ) } return if ( isPresent ) get ( ) else defaultValue ( ) }","docstring":"/**\n * Returns this [Optional]'s value if [present][Optional.isPresent], or otherwise the result of the [defaultValue] function.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalStdlibApi :: class ) public fun < T : Any , C : MutableCollection < in T > > Optional < T > . toCollection ( destination : C ) : C","body":"{ if ( isPresent ) { destination . add ( get ( ) ) } return destination }","docstring":"/**\n * Appends this [Optional]'s value to the given [destination] collection if [present][Optional.isPresent].\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalStdlibApi :: class ) public fun < T : Any > Optional < out T > . toList ( ) : List < T >","body":"= if ( isPresent ) listOf ( get ( ) ) else emptyList ( )","docstring":"/**\n * Returns a new read-only list of this [Optional]'s value if [present][Optional.isPresent], or otherwise an empty list.\n * The returned list is serializable (JVM).\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalStdlibApi :: class ) public fun < T : Any > Optional < out T > . toSet ( ) : Set < T >","body":"= if ( isPresent ) setOf ( get ( ) ) else emptySet ( )","docstring":"/**\n * Returns a new read-only set of this [Optional]'s value if [present][Optional.isPresent], or otherwise an empty set.\n * The returned set is serializable (JVM).\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalStdlibApi :: class ) public fun < T : Any > Optional < out T > . asSequence ( ) : Sequence < T >","body":"= if ( isPresent ) sequenceOf ( get ( ) ) else emptySequence ( )","docstring":"/**\n * Returns a new sequence for this [Optional]'s value if [present][Optional.isPresent], or otherwise an empty sequence.\n */"} {"signature":"fun FqName . tail ( prefix : FqName ) : FqName","body":"{ return when { ! isSubpackageOf ( prefix ) || prefix . isRoot -> this this == prefix -> FqName . ROOT else -> FqName ( asString ( ) . substring ( prefix . asString ( ) . length + ) ) } }","docstring":"/**\n * Get the tail part of the FQ name by stripping a prefix. If FQ name does not begin with the given prefix, it will be returned as is.\n *\n * Examples:\n * \"org.jetbrains.kotlin\".tail(\"org\") = \"jetbrains.kotlin\"\n * \"org.jetbrains.kotlin\".tail(\"\") = \"org.jetbrains.kotlin\"\n * \"org.jetbrains.kotlin\".tail(\"org.jetbrains.kotlin\") = \"\"\n * \"org.jetbrains.kotlin\".tail(\"org.jetbrains.gogland\") = \"org.jetbrains.kotlin\"\n */"} {"signature":"fun main ( )","body":"{ val jsonConfigFile = getVGG16JSONConfigFile ( ) val model = Sequential . loadModelConfiguration ( jsonConfigFile ) val imageNetClassLabels = Imagenet . V1k . labels ( ) model . use { it . compile ( optimizer = Adam ( ) , loss = Losses . MAE , metric = Metrics . ACCURACY ) it . logSummary ( ) val hdfFile = getVGG16WeightsFile ( ) recursivePrintGroupInHDF5File ( hdfFile , hdfFile ) val kernelDataPathTemplate = \"\" val biasDataPathTemplate = \"\" it . loadWeightsByPathTemplates ( hdfFile , kernelDataPathTemplate , biasDataPathTemplate ) val fileLoader = pipeline < BufferedImage > ( ) . convert { colorMode = ColorMode . BGR } . toFloatArray { } . call ( InputType . CAFFE . preprocessing ( ) ) . fileLoader ( ) for ( i in .. ) { val inputData = fileLoader . load ( getFileFromResource ( \"\" ) ) val res = it . predict ( inputData , \"\" ) println ( \"\" ) val top5 = it . predictTop5Labels ( inputData , imageNetClassLabels ) println ( top5 . toString ( ) ) } } val model2 = Sequential . loadModelConfiguration ( jsonConfigFile ) model2 . use { it . compile ( optimizer = Adam ( ) , loss = Losses . MAE , metric = Metrics . ACCURACY ) it . logSummary ( ) val hdfFile = getVGG16WeightsFile ( ) recursivePrintGroupInHDF5File ( hdfFile , hdfFile ) val weightPaths = listOf ( LayerConvOrDensePaths ( \"\" , \"\" , \"\" ) , LayerConvOrDensePaths ( \"\" , \"\" , \"\" ) , LayerConvOrDensePaths ( \"\" , \"\" , \"\" ) , LayerConvOrDensePaths ( \"\" , \"\" , \"\" ) , LayerConvOrDensePaths ( \"\" , \"\" , \"\" ) , LayerConvOrDensePaths ( \"\" , \"\" , \"\" ) , LayerConvOrDensePaths ( \"\" , \"\" , \"\" ) , LayerConvOrDensePaths ( \"\" , \"\" , \"\" ) , LayerConvOrDensePaths ( \"\" , \"\" , \"\" ) , LayerConvOrDensePaths ( \"\" , \"\" , \"\" ) , LayerConvOrDensePaths ( \"\" , \"\" , \"\" ) , LayerConvOrDensePaths ( \"\" , \"\" , \"\" ) , LayerConvOrDensePaths ( \"\" , \"\" , \"\" ) , LayerConvOrDensePaths ( \"\" , \"\" , \"\" ) , LayerConvOrDensePaths ( \"\" , \"\" , \"\" ) , LayerConvOrDensePaths ( \"\" , \"\" , \"\" ) , ) it . loadWeightsByPaths ( hdfFile , weightPaths ) val inputStreamLoader = pipeline < BufferedImage > ( ) . convert { colorMode = ColorMode . BGR } . toFloatArray { } . call ( InputType . CAFFE . preprocessing ( ) ) . inputStreamLoader ( ) for ( i in .. ) { val inputStream = OnHeapDataset :: class . java . classLoader . getResourceAsStream ( \"\" ) val inputData = inputStreamLoader . load ( inputStream ) val res = it . predict ( inputData , \"\" ) println ( \"\" ) val top5 = it . predictTop5Labels ( inputData , imageNetClassLabels ) println ( top5 . toString ( ) ) } } val model3 = Sequential . loadModelConfiguration ( jsonConfigFile ) model3 . use { it . compile ( optimizer = Adam ( ) , loss = Losses . MAE , metric = Metrics . ACCURACY ) it . logSummary ( ) val hdfFile = getVGG16WeightsFile ( ) recursivePrintGroupInHDF5File ( hdfFile , hdfFile ) it . loadWeights ( hdfFile ) } }","docstring":"/**\n * This example demonstrates the inference concept on VGG'16 model and weights loading from outdated or custom weights' schema in .h5 file:\n *\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 VGG'16 during training on ImageNet dataset) is applied to each image before prediction.\n * - No additional training.\n * - No new layers are added.\n *\n * NOTE: Also recursivePrintGroupInHDF5File() is helpful to discover hidden schema and paths.\n *\n * @see \n * Very Deep Convolutional Networks for Large-Scale Image Recognition (ICLR 2015).\n * @see \n * Detailed description of VGG'16 model and an approach to build it in Keras.\n */"} {"signature":"private fun getVGG16JSONConfigFile ( ) : File","body":"{ val properties = Properties ( ) val reader = FileReader ( \"\" ) properties . load ( reader ) val vgg16JSONModelPathForOldWeightSchema = properties [ \"\" ] as String return File ( vgg16JSONModelPathForOldWeightSchema ) }","docstring":"/** Returns JSON file with model configuration, saved from Keras 2.x. */"} {"signature":"private fun getVGG16WeightsFile ( ) : HdfFile","body":"{ val properties = Properties ( ) val reader = FileReader ( \"\" ) properties . load ( reader ) val vgg19h5WeightsPathForOldWeightSchema = properties [ \"\" ] as String return HdfFile ( File ( vgg19h5WeightsPathForOldWeightSchema ) ) }","docstring":"/** Returns .h5 file with model weights, saved from Keras 2.x. with old weights' schema in h5 file */"} {"signature":"fun genReturn ( target : IrSymbolOwner , value : LLVMValueRef ? )","body":"fun genReturn ( target : IrSymbolOwner , value : LLVMValueRef ? )","docstring":"/**\n * Generates `return` [value] operation.\n *\n * @param value may be null iff target type is `Unit`.\n */"} {"signature":"fun genDeclareVariable ( variable : IrVariable , value : LLVMValueRef ? , variableLocation : VariableDebugLocation ? ) : Int","body":"fun genDeclareVariable ( variable : IrVariable , value : LLVMValueRef ? , variableLocation : VariableDebugLocation ? ) : Int","docstring":"/**\n * Declares the variable.\n * @return index of declared variable.\n */"} {"signature":"fun getDeclaredValue ( value : IrValueDeclaration ) : Int","body":"fun getDeclaredValue ( value : IrValueDeclaration ) : Int","docstring":"/**\n * @return index of value declared before, or -1 if no such variable has been declared yet.\n */"} {"signature":"fun genGetValue ( value : IrValueDeclaration , resultSlot : LLVMValueRef ? ) : LLVMValueRef","body":"fun genGetValue ( value : IrValueDeclaration , resultSlot : LLVMValueRef ? ) : LLVMValueRef","docstring":"/**\n * Generates the code to obtain a value available in this context.\n *\n * @return the requested value\n */"} {"signature":"fun functionScope ( ) : CodeContext ?","body":"fun functionScope ( ) : CodeContext ?","docstring":"/**\n * Returns owning function scope.\n *\n * @return the requested value\n */"} {"signature":"fun fileScope ( ) : CodeContext ?","body":"fun fileScope ( ) : CodeContext ?","docstring":"/**\n * Returns owning file scope.\n *\n * @return the requested value if in the file scope or null.\n */"} {"signature":"fun classScope ( ) : CodeContext ?","body":"fun classScope ( ) : CodeContext ?","docstring":"/**\n * Returns owning class scope [ClassScope].\n *\n * @returns the requested value if in the class scope or null.\n */"} {"signature":"fun returnableBlockScope ( ) : CodeContext ?","body":"fun returnableBlockScope ( ) : CodeContext ?","docstring":"/**\n * Returns owning returnable block scope [ReturnableBlockScope].\n *\n * @returns the requested value if in the returnableBlockScope scope or null.\n */"} {"signature":"fun location ( offset : Int ) : LocationInfo ?","body":"fun location ( offset : Int ) : LocationInfo ?","docstring":"/**\n * Returns location information for given source location [LocationInfo].\n */"} {"signature":"fun scope ( ) : DIScopeOpaqueRef ?","body":"fun scope ( ) : DIScopeOpaqueRef ?","docstring":"/**\n * Returns [DIScopeOpaqueRef] instance for corresponding scope.\n */"} {"signature":"fun onEnter ( )","body":"{ }","docstring":"/**\n * Called, when context is pushed on stack\n */"} {"signature":"fun onExit ( )","body":"{ }","docstring":"/**\n * Called, when context is removed from stack\n */"} {"signature":"fun wrapException ( e : Exception ) : Exception","body":"fun wrapException ( e : Exception ) : Exception","docstring":"/**\n * Called, when exception is caught in this block. Result expception would be rethrown instead.\n */"} {"signature":"private inline fun < R > using ( codeContext : CodeContext ? , block : ( ) -> R ) : R","body":"{ val oldCodeContext = currentCodeContext if ( codeContext != null ) { currentCodeContext = codeContext codeContext . onEnter ( ) } try { return block ( ) } catch ( e : Exception ) { throw ( codeContext ? . wrapException ( e ) ? : e ) } finally { codeContext ? . onExit ( ) currentCodeContext = oldCodeContext } }","docstring":"/**\n * Executes [block] with [codeContext] substituted as [currentCodeContext].\n */"} {"signature":"private fun bindParameters ( function : IrFunction ? ) : Map < IrValueParameter , LLVMValueRef >","body":"{ if ( function == null ) return emptyMap ( ) return function . allParameters . mapIndexed { i , irParameter -> val parameter = codegen . param ( function , i ) assert ( irParameter . type . toLLVMType ( llvm ) == parameter . type ) irParameter to parameter } . toMap ( ) }","docstring":"/**\n * Binds LLVM function parameters to IR parameter descriptors.\n */"} {"signature":"private fun FunctionGenerationContext . jump ( target : ContinuationBlock , value : LLVMValueRef ? )","body":"{ val entry = target . block br ( entry ) if ( target . valuePhi != null ) { assignPhis ( target . valuePhi to value ! ! ) } }","docstring":"/**\n * Jumps to [target] passing [value].\n */"} {"signature":"private fun continuationBlock ( type : IrType , locationInfo : LocationInfo ? , code : ( ContinuationBlock ) -> Unit = { } ) : ContinuationBlock","body":"{ val entry = functionGenerationContext . basicBlock ( \"\" , locationInfo ) functionGenerationContext . appendingTo ( entry ) { val valuePhi = if ( type . isUnit ( ) ) { null } else { functionGenerationContext . phi ( type . toLLVMType ( llvm ) ) } val result = ContinuationBlock ( entry , valuePhi ) code ( result ) return result } }","docstring":"/**\n * Creates new [ContinuationBlock] that receives the value of given Kotlin type\n * and generates [code] starting from its beginning.\n */"} {"signature":"private fun genLandingpad ( )","body":"{ with ( functionGenerationContext ) { val exceptionPtr = catchKotlinException ( ) jumpToHandler ( exceptionPtr ) } }","docstring":"/**\n * Generates the LLVM `landingpad` that catches C++ exception with type `KotlinException`,\n * unwraps the Kotlin exception object and jumps to [handler].\n *\n * This method generates nearly the same code as `clang++` does for the following:\n * ```\n * catch (KotlinException& e) {\n * KRef exception = e.exception_;\n * return exception;\n * }\n * ```\n * except that our code doesn't check exception `typeid`.\n *\n * TODO: why does `clang++` check `typeid` even if there is only one catch clause?\n */"} {"signature":"private fun evaluateWhen ( expression : IrWhen , resultSlot : LLVMValueRef ? ) : LLVMValueRef","body":"{ context . log { \"\" } generateDebugTrambolineIf ( \"\" , expression ) val bbOfFirstConditionCheck = functionGenerationContext . currentBlock val branchInfos : List < BranchCaseNextInfo > = expression . branches . map { val bbCase = if ( it . isUnconditional ( ) ) null else functionGenerationContext . basicBlock ( \"\" , it . startLocation , it . endLocation ) . apply { functionGenerationContext . positionAtEnd ( this ) } val bbNext = if ( it . isUnconditional ( ) || it == expression . branches . last ( ) ) null else functionGenerationContext . basicBlock ( \"\" , it . startLocation , it . endLocation ) . apply { functionGenerationContext . positionAtEnd ( this ) } BranchCaseNextInfo ( it , bbCase , bbNext , resultSlot ) } val whenEmittingContext = WhenEmittingContext ( expression , lastBBOfWhenCases = functionGenerationContext . currentBlock ) functionGenerationContext . positionAtEnd ( bbOfFirstConditionCheck ) branchInfos . forEach { generateWhenCase ( whenEmittingContext , it ) } if ( whenEmittingContext . bbExit . isInitialized ( ) ) functionGenerationContext . positionAtEnd ( whenEmittingContext . bbExit . value ) return when { expression . type . isUnit ( ) -> codegen . theUnitInstanceRef . llvm expression . type . isNothing ( ) -> functionGenerationContext . kNothingFakeValue whenEmittingContext . resultPhi . isInitialized ( ) -> whenEmittingContext . resultPhi . value else -> LLVMGetUndef ( whenEmittingContext . llvmType ) ! ! } }","docstring":"/** For WHEN { COND1 -> CASE1, COND2 -> CASE2, ELSE -> UNCONDITIONAL }\n * the following sequence of basic blocks is generated:\n * -- if COND1\n * -- CASE1\n * -- NEXT1(if COND2)\n * -- CASE2\n * -- NEXT2 (UNCONDITIONAL)\n * -- EXIT\n */"} {"signature":"private fun Float . normalizeNan ( )","body":"= if ( isNaN ( ) ) java . lang . Float . NaN else this","docstring":"/**\n * Normalizing nans to single value is useful for build reproducibility.\n *\n * It's possible that it can lead to some bad consequences for interop libraries,\n * for which exact nan value is important. We are not aware of the existence of\n * any such useful library, at least on priority targets.\n *\n * On the other side, the semantics of exact cases, NaN values should be not normalized, is unclear.\n * E.g., in previous implementation, storing constant to another constant could change the exact bit pattern.\n *\n * So for now, we would just normalize all NaN constants. At least this leads to predictable result\n * useful in almost all cases.\n *\n * Also, java.lang classes are used here to avoid unexpected NaN values if a compiler and stdlib\n * are built in an arm64 architecture environment.\n */"} {"signature":"private fun evaluateExplicitArgs ( expression : IrFunctionAccessExpression ) : List < LLVMValueRef >","body":"{ val result = expression . getArgumentsWithIr ( ) . map { ( _ , argExpr ) -> evaluateExpression ( argExpr ) } val explicitParametersCount = expression . symbol . owner . explicitParametersCount if ( result . size != explicitParametersCount ) { error ( \"\" + \"\" ) } return result }","docstring":"/**\n * Evaluates all arguments of [expression] that are explicitly represented in the IR.\n * Returns results in the same order as LLVM function expects, assuming that all explicit arguments\n * exactly correspond to a tail of LLVM parameters.\n */"} {"signature":"private fun IrValueDeclaration . debugNameConversion ( ) : Name","body":"{ if ( name == thisName ) { return when ( origin ) { IrDeclarationOrigin . IR_TEMPORARY_VARIABLE_FOR_INLINED_EXTENSION_RECEIVER -> doubleUnderscoreThisName else -> underscoreThisName } } return name }","docstring":"/**\n * HACK: this is workaround for GH-2316, to let IDE some how operate with this.\n * We're experiencing issue with libclang which is used as compiler of expression in lldb\n * for current state support Kotlin in lldb:\n * 1. isn't accepted by libclang as valid variable name.\n * 2. this is reserved name and compiled in special way.\n */"} {"signature":"@ Deprecated ( \"\" ) public abstract fun restoreSymbol ( analysisSession : KtAnalysisSession ) : S ?","body":"@ Deprecated ( \"\" ) public abstract fun restoreSymbol ( analysisSession : KtAnalysisSession ) : S ?","docstring":"/**\n * @return restored symbol (possibly the new symbol instance) if one is still valid, `null` otherwise\n *\n * Consider using [org.jetbrains.kotlin.analysis.api.KtAnalysisSession.restoreSymbol]\n */"} {"signature":"public open fun pointsToTheSameSymbolAs ( other : KtSymbolPointer < KtSymbol > ) : Boolean","body":"= this === other","docstring":"/**\n * @return **true** if [other] pointer can be restored to the same symbol. The operation is symmetric and transitive.\n */"} {"signature":"public inline fun < reified DomainType : Comparable < DomainType > > continuousColorHue ( huesRange : ClosedRange < Int > ? = null , chroma : Int ? = null , luminance : Int ? = null , hueStart : Int ? = null , direction : WheelDirection ? = null , domainLimits : ClosedRange < DomainType > , nullValue : Color ? = null , transform : Transformation ? = null ) : ScaleContinuousColorHue < DomainType >","body":"= ScaleContinuousColorHue ( domainLimits . let { it . start to it . endInclusive } , huesRange ? . let { it . start to it . endInclusive } , chroma , luminance , hueStart , direction , nullValue , transform )","docstring":"/**\n * Creates a qualitative continuous color scale with evenly spaced hues.\n *\n * @param DomainType scale domain type.\n * @param domainLimits [ClosedRange] defining the scale domain.\n * @param huesRange [ClosedRange] of hues, in [0,360]\n * @param chroma numeric Chroma (intensity of color), maximum value varies depending on\n * @param luminance numeric Luminance (lightness), in [0,100]\n * @param hueStart number Hue to start at\n * @param direction [WheelDirection] to travel around the color wheel.\n * @param nullValue value which null is mapped to.\n * @param transform scale transformation.\n * @return new continuous color scale.\n */"} {"signature":"public inline fun < reified DomainType : Comparable < DomainType > > continuousColorHue ( huesRange : ClosedRange < Int > ? = null , chroma : Int ? = null , luminance : Int ? = null , hueStart : Int ? = null , direction : WheelDirection ? = null , domainMin : DomainType ? = null , domainMax : DomainType ? = null , nullValue : Color ? = null , transform : Transformation ? = null ) : ScaleContinuousColorHue < DomainType >","body":"= ScaleContinuousColorHue ( domainMin to domainMax , huesRange ? . let { it . start to it . endInclusive } , chroma , luminance , hueStart , direction , nullValue , transform )","docstring":"/**\n * Creates a qualitative continuous color scale with evenly spaced hues.\n *\n * @param DomainType scale domain type.\n * @param domainMin scale domain minimum.\n * @param domainMax scale domain maximum.\n * @param huesRange [ClosedRange] of hues, in [0,360]\n * @param chroma numeric Chroma (intensity of color), maximum value varies depending on\n * @param luminance numeric Luminance (lightness), in [0,100]\n * @param hueStart number Hue to start at\n * @param direction [WheelDirection] to travel around the color wheel.\n * @param nullValue value which null is mapped to.\n * @param transform scale transformation.\n * @return new continuous color scale.\n */"} {"signature":"public fun < DomainType > categoricalColorHue ( huesRange : Pair < Int , Int > ? = null , chroma : Int ? = null , luminance : Int ? = null , hueStart : Int ? = null , direction : WheelDirection ? = null , ) : ScaleCategoricalColorHue < DomainType >","body":"= ScaleCategoricalColorHue < DomainType > ( huesRange , chroma , luminance , hueStart , direction , )","docstring":"/**\n * Creates a qualitative categorical color scale with evenly spaced hues.\n *\n * @param DomainType scale domain type.\n * @param huesRange [ClosedRange] of hues, in [0,360]\n * @param chroma numeric Chroma (intensity of color), maximum value varies depending on\n * @param luminance numeric Luminance (lightness), in [0,100]\n * @param hueStart number Hue to start at\n * @param direction [WheelDirection] to travel around the color wheel.\n * @return new categorical color scale.\n */"} {"signature":"public fun add ( element : @ UnsafeVariance E ) : PersistentCollection < E >","body":"public fun add ( element : @ UnsafeVariance E ) : PersistentCollection < E >","docstring":"/**\n * Returns the result of adding the specified [element] to this collection.\n *\n * @returns a new persistent collection with the specified [element] added;\n * or this instance if this collection does not support duplicates and it already contains the element.\n */"} {"signature":"public fun addAll ( elements : Collection < @ UnsafeVariance E > ) : PersistentCollection < E >","body":"public fun addAll ( elements : Collection < @ UnsafeVariance E > ) : PersistentCollection < E >","docstring":"/**\n * Returns the result of adding all elements of the specified [elements] collection to this collection.\n *\n * @return a new persistent collection with elements of the specified [elements] collection added;\n * or this instance if no modifications were made in the result of this operation.\n */"} {"signature":"public fun remove ( element : @ UnsafeVariance E ) : PersistentCollection < E >","body":"public fun remove ( element : @ UnsafeVariance E ) : PersistentCollection < E >","docstring":"/**\n * Returns the result of removing a single appearance of the specified [element] from this collection.\n *\n * @return a new persistent collection with a single appearance of the specified [element] removed;\n * or this instance if there is no such element in this collection.\n */"} {"signature":"public fun removeAll ( elements : Collection < @ UnsafeVariance E > ) : PersistentCollection < E >","body":"public fun removeAll ( elements : Collection < @ UnsafeVariance E > ) : PersistentCollection < E >","docstring":"/**\n * Returns the result of removing all elements in this collection that are also\n * contained in the specified [elements] collection.\n *\n * @return a new persistent collection with elements in this collection 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":"public fun removeAll ( predicate : ( E ) -> Boolean ) : PersistentCollection < E >","body":"public fun removeAll ( predicate : ( E ) -> Boolean ) : PersistentCollection < E >","docstring":"/**\n * Returns the result of removing all elements in this collection that match the specified [predicate].\n *\n * @return a new persistent collection with elements matching the specified [predicate] removed;\n * or this instance if no elements match the predicate.\n */"} {"signature":"public fun retainAll ( elements : Collection < @ UnsafeVariance E > ) : PersistentCollection < E >","body":"public fun retainAll ( elements : Collection < @ UnsafeVariance E > ) : PersistentCollection < E >","docstring":"/**\n * Returns all elements in this collection that are also\n * contained in the specified [elements] collection.\n *\n * @return a new persistent set with elements in this set 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":"public fun clear ( ) : PersistentCollection < E >","body":"public fun clear ( ) : PersistentCollection < E >","docstring":"/**\n * Returns an empty persistent collection.\n */"} {"signature":"public fun build ( ) : PersistentCollection < E >","body":"public fun build ( ) : PersistentCollection < E >","docstring":"/**\n * Returns a persistent collection with the same contents as this builder.\n *\n * This method can be called multiple times.\n *\n * If operations applied on this builder have caused no modifications:\n * - on the first call it returns the same persistent collection instance this builder was obtained from.\n * - on subsequent calls it returns the same previously returned persistent collection instance.\n */"} {"signature":"public fun builder ( ) : Builder < @ UnsafeVariance E >","body":"public fun builder ( ) : Builder < @ UnsafeVariance E >","docstring":"/**\n * Returns a new builder with the same contents as this collection.\n *\n * The builder can be used to efficiently perform multiple modification operations.\n */"} {"signature":"fun append ( charCode : Int , categoryCode : String , mapping : Int ) : Boolean","body":"fun append ( charCode : Int , categoryCode : String , mapping : Int ) : Boolean","docstring":"/**\n * Appends the [charCode] to this range pattern.\n * Returns true if the [charCode] with the specified [categoryCode] and [mapping] was accommodated within this pattern.\n * Returns false otherwise.\n *\n * @param mapping the difference between the [charCode] and the char it converts to.\n */"} {"signature":"internal fun _markDirty ( file : File , root : JavaSourceRootDescriptor )","body":"{ val isCrossCompiled = root is KotlinIncludedModuleSourceRoot val old = _dirty . put ( file . normalize ( ) . absoluteFile , KotlinModuleBuildTarget . Source ( file , isCrossCompiled ) ) check ( old == null || old . isCrossCompiled == isCrossCompiled ) { \"\" + \"\" + \"\" } }","docstring":"/**\n * Should be called only from [FSOperationsHelper.markFilesForCurrentRound]\n * and during KotlinDirtySourceFilesHolder initialization.\n */"} {"signature":"@ Deprecated ( \"\" , ReplaceWith ( \"\" ) ) @ DeprecatedSinceKotlin ( warningSince = \"\" ) @ kotlin . internal . InlineOnly public actual inline fun Char . toLowerCase ( ) : Char","body":"= lowercaseChar ( )","docstring":"/**\n * Converts this character to lower case using Unicode mapping rules of the invariant locale.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalStdlibApi :: class ) @ kotlin . internal . InlineOnly public actual inline fun Char . lowercaseChar ( ) : Char","body":"= lowercase ( ) [ ]","docstring":"/**\n * Converts this character to lower case using Unicode mapping rules of the invariant locale.\n *\n * This function performs one-to-one character mapping.\n * To support one-to-many character mapping use the [lowercase] function.\n * If this character has no mapping equivalent, the character itself is returned.\n *\n * @sample samples.text.Chars.lowercase\n */"} {"signature":"@ Deprecated ( \"\" , ReplaceWith ( \"\" ) ) @ DeprecatedSinceKotlin ( warningSince = \"\" ) @ kotlin . internal . InlineOnly public actual inline fun Char . toUpperCase ( ) : Char","body":"= uppercaseChar ( )","docstring":"/**\n * Converts this character to upper case using Unicode mapping rules of the invariant locale.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalStdlibApi :: class ) public actual fun Char . uppercaseChar ( ) : Char","body":"{ val uppercase = uppercase ( ) return if ( uppercase . length > ) this else uppercase [ ] }","docstring":"/**\n * Converts this character to upper case using Unicode mapping rules of the invariant locale.\n *\n * This function performs one-to-one character mapping.\n * To support one-to-many character mapping use the [uppercase] function.\n * If this character has no mapping equivalent, the character itself is returned.\n *\n * @sample samples.text.Chars.uppercase\n */"} {"signature":"@ SinceKotlin ( \"\" ) public actual fun Char . titlecaseChar ( ) : Char","body":"= titlecaseCharImpl ( )","docstring":"/**\n * Converts this character to title case using Unicode mapping rules of the invariant locale.\n *\n * This function performs one-to-one character mapping.\n * To support one-to-many character mapping use the [titlecase] function.\n * If this character has no mapping equivalent, the result of calling [uppercaseChar] is returned.\n *\n * @sample samples.text.Chars.titlecase\n */"} {"signature":"public actual fun Char . isHighSurrogate ( ) : Boolean","body":"= this in Char . MIN_HIGH_SURROGATE .. Char . MAX_HIGH_SURROGATE","docstring":"/**\n * Returns `true` if this character is a Unicode high-surrogate code unit (also known as leading-surrogate code unit).\n */"} {"signature":"public actual fun Char . isLowSurrogate ( ) : Boolean","body":"= this in Char . MIN_LOW_SURROGATE .. Char . MAX_LOW_SURROGATE","docstring":"/**\n * Returns `true` if this character is a Unicode low-surrogate code unit (also known as trailing-surrogate code unit).\n */"} {"signature":"@ SinceKotlin ( \"\" ) public actual fun Char . isDefined ( ) : Boolean","body":"{ if ( this < '' ) { return true } return getCategoryValue ( ) != CharCategory . UNASSIGNED . value }","docstring":"/**\n * Returns `true` if this character (Unicode code point) is defined in Unicode.\n *\n * A character is considered to be defined in Unicode if its [category] is not [CharCategory.UNASSIGNED].\n */"} {"signature":"@ SinceKotlin ( \"\" ) public actual fun Char . isLetter ( ) : Boolean","body":"{ if ( this in '' .. '' || this in '' .. '' ) { return true } if ( this < '' ) { return false } return isLetterImpl ( ) }","docstring":"/**\n * Returns `true` if this character is a letter.\n *\n * A character is considered to be a letter if its [category] is [CharCategory.UPPERCASE_LETTER],\n * [CharCategory.LOWERCASE_LETTER], [CharCategory.TITLECASE_LETTER], [CharCategory.MODIFIER_LETTER], or [CharCategory.OTHER_LETTER].\n *\n * @sample samples.text.Chars.isLetter\n */"} {"signature":"@ SinceKotlin ( \"\" ) public actual fun Char . isLetterOrDigit ( ) : Boolean","body":"{ if ( this in '' .. '' || this in '' .. '' || this in '' .. '' ) { return true } if ( this < '' ) { return false } return isDigitImpl ( ) || isLetterImpl ( ) }","docstring":"/**\n * Returns `true` if this character is a letter or digit.\n *\n * @see isLetter\n * @see isDigit\n *\n * @sample samples.text.Chars.isLetterOrDigit\n */"} {"signature":"@ SinceKotlin ( \"\" ) public actual fun Char . isDigit ( ) : Boolean","body":"{ if ( this in '' .. '' ) { return true } if ( this < '' ) { return false } return isDigitImpl ( ) }","docstring":"/**\n * Returns `true` if this character is a digit.\n *\n * A character is considered to be a digit if its [category] is [CharCategory.DECIMAL_DIGIT_NUMBER].\n *\n * @sample samples.text.Chars.isDigit\n */"} {"signature":"@ SinceKotlin ( \"\" ) public actual fun Char . isUpperCase ( ) : Boolean","body":"{ if ( this in '' .. '' ) { return true } if ( this < '' ) { return false } return isUpperCaseImpl ( ) }","docstring":"/**\n * Returns `true` if this character is upper case.\n *\n * A character is considered to be an upper case character if its [category] is [CharCategory.UPPERCASE_LETTER],\n * or it has contributory property `Other_Uppercase` as defined by the Unicode Standard.\n *\n * @sample samples.text.Chars.isUpperCase\n */"} {"signature":"@ SinceKotlin ( \"\" ) public actual fun Char . isLowerCase ( ) : Boolean","body":"{ if ( this in '' .. '' ) { return true } if ( this < '' ) { return false } return isLowerCaseImpl ( ) }","docstring":"/**\n * Returns `true` if this character is lower case.\n *\n * A character is considered to be a lower case character if its [category] is [CharCategory.LOWERCASE_LETTER],\n * or it has contributory property `Other_Lowercase` as defined by the Unicode Standard.\n *\n * @sample samples.text.Chars.isLowerCase\n */"} {"signature":"@ SinceKotlin ( \"\" ) public actual fun Char . isTitleCase ( ) : Boolean","body":"{ if ( this < '' ) { return false } return getCategoryValue ( ) == CharCategory . TITLECASE_LETTER . value }","docstring":"/**\n * Returns `true` if this character is a title case letter.\n *\n * A character is considered to be a title case letter if its [category] is [CharCategory.TITLECASE_LETTER].\n *\n * @sample samples.text.Chars.isTitleCase\n */"} {"signature":"@ SinceKotlin ( \"\" ) public actual fun Char . isISOControl ( ) : Boolean","body":"{ return this <= '' || this in '' .. '' }","docstring":"/**\n * Returns `true` if this character is an ISO control character.\n *\n * A character is considered to be an ISO control character if its [category] is [CharCategory.CONTROL],\n * meaning the Char is in the range `'\\u0000'..'\\u001F'` or in the range `'\\u007F'..'\\u009F'`.\n *\n * @sample samples.text.Chars.isISOControl\n */"} {"signature":"public actual fun Char . isWhitespace ( ) : Boolean","body":"= isWhitespaceImpl ( )","docstring":"/**\n * Determines whether a character is whitespace.\n *\n * A character is considered whitespace if either its Unicode [category][Char.category]\n * is one of [CharCategory.SPACE_SEPARATOR], [CharCategory.LINE_SEPARATOR], [CharCategory.PARAGRAPH_SEPARATOR],\n * or it is a [CharCategory.CONTROL] character in range `U+0009..U+000D` or `U+001C..U+001F`.\n *\n * Returns `true` if the character is whitespace.\n *\n * @sample samples.text.Chars.isWhitespace\n */"} {"signature":"fun < E > decodeConfigValue ( extractValueAtPath : ( conf : Config , path : String ) -> E ) : E","body":"fun < E > decodeConfigValue ( extractValueAtPath : ( conf : Config , path : String ) -> E ) : E","docstring":"/**\n * Decodes the value at the current path from the input.\n * Allows to call methods on a [Config] instance.\n *\n * @param E type of value\n * @param extractValueAtPath lambda for extracting value, where conf - original config object, path - current path expression being decoded.\n * @return result of lambda execution\n */"} {"signature":"public fun < T > stroke ( column : ColumnReference < T > , parameters : LetsPlotNonPositionalMappingParametersContinuous < T , Double > . ( ) -> Unit = { } ) : NonPositionalMapping < T , Double >","body":"{ return addNonPositionalMapping ( STROKE , column . name ( ) , LetsPlotNonPositionalMappingParametersContinuous < T , Double > ( ) . apply ( parameters ) ) }","docstring":"/**\n * Maps the `stroke` 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 > stroke ( column : KProperty < T > , parameters : LetsPlotNonPositionalMappingParametersContinuous < T , Double > . ( ) -> Unit = { } ) : NonPositionalMapping < T , Double >","body":"{ return addNonPositionalMapping ( STROKE , column . name , LetsPlotNonPositionalMappingParametersContinuous < T , Double > ( ) . apply ( parameters ) ) }","docstring":"/**\n * Maps the `stroke` 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 stroke ( column : String , parameters : LetsPlotNonPositionalMappingParametersContinuous < Any ? , Double > . ( ) -> Unit = { } ) : NonPositionalMapping < Any ? , Double >","body":"{ return addNonPositionalMapping ( STROKE , column , LetsPlotNonPositionalMappingParametersContinuous < Any ? , Double > ( ) . apply ( parameters ) ) }","docstring":"/**\n * Maps the `stroke` 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 > stroke ( values : Iterable < T > , name : String ? = null , parameters : LetsPlotNonPositionalMappingParametersContinuous < T , Double > . ( ) -> Unit = { } ) : NonPositionalMapping < T , Double >","body":"{ return addNonPositionalMapping ( STROKE , values . toList ( ) , name , LetsPlotNonPositionalMappingParametersContinuous < T , Double > ( ) . apply ( parameters ) ) }","docstring":"/**\n * Maps the `stroke` 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 > stroke ( values : DataColumn < T > , parameters : LetsPlotNonPositionalMappingParametersContinuous < T , Double > . ( ) -> Unit = { } ) : NonPositionalMapping < T , Double >","body":"{ return addNonPositionalMapping ( STROKE , values , LetsPlotNonPositionalMappingParametersContinuous < T , Double > ( ) . apply ( parameters ) ) }","docstring":"/**\n * Maps the `stroke` 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":"fun legacyStdlibJdkDependencies ( version : String = \"\" )","body":"= listOf ( binaryCoordinates ( \"\" ) , binaryCoordinates ( \"\" ) , )","docstring":"/**\n * Legacy -jdk8 and -jdk7 dependencies:\n * Those artifacts will be published as empty jars starting from Kotlin 1.8.0 as\n * the classes will be included in the kotlin-stdlib artifact already.\n *\n * Note: The kotlin-stdlib will add a constraint to always resolve 1.8.0 of those artifacts.\n * This will be necessary in the future, when no more jdk8 or jdk7 artifacts will be published:\n * In this case we need to still resolve to a version that will contain empty artifacts (1.8.0)\n *\n */"} {"signature":"@ PublishedApi internal fun < T > arrayConcat ( vararg args : T ) : T","body":"{ val len = args . size val typed = js ( \"\" ) . unsafeCast < Array < T > > ( ) for ( i in .. ( len - ) ) { val arr = args [ i ] if ( arr !is Array < * > ) { typed [ i ] = js ( \"\" ) . slice . call ( arr ) } else { typed [ i ] = arr } } return js ( \"\" ) . concat . apply ( js ( \"\" ) , typed ) ; }","docstring":"/** Concat regular Array's and TypedArray's into an Array.\n */"} {"signature":"@ PublishedApi internal fun < T > primitiveArrayConcat ( vararg args : T ) : T","body":"{ var size_local = for ( i in .. ( args . size - ) ) { size_local += args [ i ] . unsafeCast < Array < Any ? > > ( ) . size } val a = args [ ] val result = js ( \"\" ) . unsafeCast < Array < Any ? > > ( ) if ( a . asDynamic ( ) . `$type$` != null ) { withType ( a . asDynamic ( ) . `$type$` , result ) } size_local = for ( i in .. ( args . size - ) ) { val arr = args [ i ] . unsafeCast < Array < Any ? > > ( ) for ( j in .. ( arr . size - ) ) { result [ size_local ++ ] = arr [ j ] } } return result . unsafeCast < T > ( ) }","docstring":"/** Concat primitive arrays. Main use: prepare vararg arguments.\n */"} {"signature":"fun isOverridable ( superMember : MemberWithOriginal , subMember : MemberWithOriginal , ) : Result","body":"fun isOverridable ( superMember : MemberWithOriginal , subMember : MemberWithOriginal , ) : Result","docstring":"/**\n * Determines whether [superMember] is overridable by [subMember]. The returned result can be one of the following:\n *\n * - [Result.OVERRIDABLE] means that it is definitely overridable, and neither the general override checking algorithm, nor other\n * external overridability conditions can refute that.\n * - [Result.INCOMPATIBLE] means that it is not overridable, but it's OK to have both declarations available in the same class because\n * they don't cause a conflict.\n * - [Result.UNKNOWN] means that this overridability condition cannot claim anything about the overridability, and the final result\n * will be based on the general override checking algorithm and the other external overridability conditions.\n */"} {"signature":"internal fun MethodNode . alternateDefaultSignature ( className : String ) : JvmMethodSignature ?","body":"{ return when { access and Opcodes . ACC_SYNTHETIC == -> null name == \">\" && \"\" in desc -> JvmMethodSignature ( name , desc . replace ( \"\" , \"\" ) ) name . endsWith ( \"\" ) && \"\" in desc -> JvmMethodSignature ( name . removeSuffix ( \"\" ) , desc . replace ( \"\" , \"\" ) . replace ( \"\" , \"\" ) ) else -> null } }","docstring":"/**\n * Calculates the signature of this method without default parameters\n *\n * Returns `null` if this method isn't an entry point of a function\n * or a constructor with default parameters.\n * Returns an incorrect result, if there are more than 31 default parameters.\n */"} {"signature":"@ Test fun testSelectFailure ( )","body":"= runTest { val d = CompletableDeferred < Nothing > ( ) d . completeExceptionally ( TestException ( ) ) val d2 = CompletableDeferred ( ) assertFailsWith < TestException > { select { d . onAwait { expectUnreached ( ) } d2 . onAwait { } } } }","docstring":"/**\n * Tests that completing a [Deferred] with an exception will cause the [select] that uses [Deferred.onAwait]\n * to throw the same exception.\n */"} {"signature":"override fun hasConsumed ( matchResult : MatchResultImpl ) : Boolean","body":"= false","docstring":"/** Returns false, because word boundary does not consumes any characters and do not move string index. */"} {"signature":"private fun tryGenerateInteropConstantRead ( expression : IrCall ) : IrExpression ?","body":"{ val function = expression . symbol . owner if ( ! function . isFromInteropLibrary ( ) ) return null if ( ! function . isGetter ) return null val constantProperty = function . correspondingPropertySymbol ? . owner ? . takeIf { it . isConst } ? : return null val initializer = constantProperty . backingField ? . initializer ? . expression require ( initializer is IrConst < * > ) { renderCompilerError ( expression ) } return initializer . shallowCopy ( ) }","docstring":"/**\n * Handle `const val`s that come from interop libraries.\n *\n * We extract constant value from the backing field, and replace getter invocation with it.\n */"} {"signature":"fun autoreleaseAndRet ( value : LLVMValueRef )","body":"{ onReturn ( ) val result = call ( objCExportCodegen . objcAutoreleaseReturnValue , listOf ( value ) ) LLVMSetTailCall ( result , ) rawRet ( result ) }","docstring":"/**\n * autoreleases and returns [value].\n * It is equivalent to `ret(autorelease(value))`, but optimizes the autorelease out if the caller is prepared for it.\n *\n * See the Clang documentation and the Obj-C runtime source code for more details:\n * https://clang.llvm.org/docs/AutomaticReferenceCounting.html#arc-runtime-objc-autoreleasereturnvalue\n * https://github.com/opensource-apple/objc4/blob/cd5e62a5597ea7a31dccef089317abb3a661c154/runtime/objc-object.h#L930\n */"} {"signature":"inline fun ObjCExportFunctionGenerationContext . convertKotlin ( genValue : ( Lifetime ) -> LLVMValueRef , actualType : IrType , expectedType : IrType , resultLifetime : Lifetime ) : LLVMValueRef","body":"{ val conversion = context . getTypeConversion ( actualType , expectedType ) ? : return genValue ( resultLifetime ) val value = genValue ( Lifetime . ARGUMENT ) return callFromBridge ( conversion . owner . llvmFunction , listOf ( value ) , resultLifetime ) }","docstring":"/**\n * Convert [genValue] of Kotlin type from [actualType] to [expectedType] in a bridge method.\n */"} {"signature":"private fun ObjCExportCodeGenerator . createReverseAdapter ( irFunction : IrFunction , baseMethod : ObjCMethodSpec . BaseMethod < IrSimpleFunctionSymbol > , vtableIndex : Int ? , itablePlace : ClassLayoutBuilder . InterfaceTablePlace ? ) : ObjCExportCodeGenerator . KotlinToObjCMethodAdapter","body":"{ val selector = baseMethod . selector val kotlinToObjC = generateKotlinToObjCBridge ( irFunction , baseMethod ) . bitcast ( llvm . int8PtrType ) return KotlinToObjCMethodAdapter ( selector , itablePlace ? : ClassLayoutBuilder . InterfaceTablePlace . INVALID , vtableIndex ? : - , kotlinToObjC ) }","docstring":"/**\n * Reverse adapters are required when Kotlin code invokes virtual method which might be overriden on Objective-C side.\n * Example:\n *\n * ```kotlin\n * interface I {\n * fun foo()\n * }\n *\n * fun usage(i: I) {\n * i.foo() // Here we invoke\n * }\n * ```\n *\n * ```swift\n * class C : I {\n * override func foo() { ... }\n * }\n *\n * FileKt.usage(C()) // C.foo is invoked via reverse method adapter.\n * ```\n */"} {"signature":"private fun ObjCExportCodeGenerator . createMethodVirtualAdapter ( baseMethod : ObjCMethodSpec . BaseMethod < IrSimpleFunctionSymbol > ) : ObjCExportCodeGenerator . ObjCToKotlinMethodAdapter","body":"{ val selector = baseMethod . selector val methodBridge = baseMethod . bridge val irFunction = baseMethod . owner val imp = generateObjCImp ( irFunction , irFunction , methodBridge , isVirtual = true ) return objCToKotlinMethodAdapter ( selector , methodBridge , imp ) }","docstring":"/**\n * We need to generate indirect version of a method for a cases\n * when it is called on an object of non-exported type.\n *\n * Consider the following example:\n * file.kt:\n * ```\n * open class Foo {\n * open fun foo() {}\n * }\n * private class Bar : Foo() {\n * override fun foo() {}\n * }\n *\n * fun createBar(): Foo = Bar()\n * ```\n * file.swift:\n * ```\n * FileKt.createBar().foo()\n * ```\n * There is no Objective-C typeinfo for `Bar`, thus `foo` will be called via method lookup.\n */"} {"signature":"fun usage ( )","body":"{ }","docstring":"/**\n * [WithGenerics.intExt]\n * [WithGenerics.stringExt]\n */"} {"signature":"protected fun Constraint . resolveWithProperties ( ) : Constraint","body":"{ val copy = this . resolve ( ) if ( copy is PropertyOwner ) { modifiedProperties . forEach { ( name , constraint ) -> copy [ name ] = constraint } } return copy . resolve ( ) }","docstring":"/**\n * Called at resolving stage,\n * to apply properties to the resolved reference.\n */"} {"signature":"fun accepts ( code : String ) : Boolean","body":"= true","docstring":"/**\n * Returns `true` if this preprocessor accepts the given [code]\n */"} {"signature":"fun process ( code : String , host : KotlinKernelHost , ) : Result","body":"fun process ( code : String , host : KotlinKernelHost , ) : Result","docstring":"/**\n * Performs code preprocessing\n */"} {"signature":"fun < T : Number > lcm ( x1 : KtNDArray < T > , x2 : KtNDArray < T > ) : KtNDArray < T >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( x1 , x2 ) )","docstring":"/**\n * Returns the lowest common multiple of |x1| and |x2|\n */"} {"signature":"fun < T : Number > gcd ( x1 : KtNDArray < T > , x2 : KtNDArray < T > ) : KtNDArray < T >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( x1 , x2 ) )","docstring":"/**\n * Returns the greatest common divisor of |x1| and |x2|\n */"} {"signature":"fun clearExtras ( )","body":"{ _builder . clearExtras ( ) }","docstring":"/**\n * optional .org.jetbrains.kotlin.gradle.idea.proto.generated.IdeaExtrasProto extras = 1;\n */"} {"signature":"fun hasExtras ( ) : kotlin . Boolean","body":"{ return _builder . hasExtras ( ) }","docstring":"/**\n * optional .org.jetbrains.kotlin.gradle.idea.proto.generated.IdeaExtrasProto extras = 1;\n * @return Whether the extras field is set.\n */"} {"signature":"fun clearType ( )","body":"{ _builder . clearType ( ) }","docstring":"/**\n * optional .org.jetbrains.kotlin.gradle.idea.proto.generated.tcs.IdeaKotlinSourceDependencyProto.Type type = 2;\n */"} {"signature":"fun hasType ( ) : kotlin . Boolean","body":"{ return _builder . hasType ( ) }","docstring":"/**\n * optional .org.jetbrains.kotlin.gradle.idea.proto.generated.tcs.IdeaKotlinSourceDependencyProto.Type type = 2;\n * @return Whether the type field is set.\n */"} {"signature":"fun clearCoordinates ( )","body":"{ _builder . clearCoordinates ( ) }","docstring":"/**\n * optional .org.jetbrains.kotlin.gradle.idea.proto.generated.tcs.IdeaKotlinSourceCoordinatesProto coordinates = 3;\n */"} {"signature":"fun hasCoordinates ( ) : kotlin . Boolean","body":"{ return _builder . hasCoordinates ( ) }","docstring":"/**\n * optional .org.jetbrains.kotlin.gradle.idea.proto.generated.tcs.IdeaKotlinSourceCoordinatesProto coordinates = 3;\n * @return Whether the coordinates field is set.\n */"} {"signature":"@ OptIn ( SymbolInternals :: class ) private fun FirStatement . isDelegatedPropertySelfAccess ( context : CheckerContext , referencedSymbol : FirBasedSymbol < * > ) : Boolean","body":"{ if ( source ? . kind != KtFakeSourceElementKind . DelegatedPropertyAccessor ) return false val containers = context . containingDeclarations val size = containers . size val fir = referencedSymbol . fir return containers . getOrNull ( size - ) == fir || containers . getOrNull ( size - ) == fir }","docstring":"/** Checks if this is an access to a delegated property inside the delegated property itself.\n * Deprecations shouldn't be reported here. */"} {"signature":"fun FirFunction . constructFunctionType ( kind : FunctionTypeKind ? = null ) : ConeLookupTagBasedType","body":"{ val receiverTypeRef = when ( this ) { is FirSimpleFunction -> receiverParameter is FirAnonymousFunction -> receiverParameter else -> null } ? . typeRef val parameters = valueParameters . map { it . returnTypeRef . coneTypeSafe < ConeKotlinType > ( ) ? : ConeErrorType ( ConeSimpleDiagnostic ( \"\" , DiagnosticKind . ValueParameterWithNoTypeAnnotation ) ) } val rawReturnType = ( this as FirCallableDeclaration ) . returnTypeRef . coneType return createFunctionType ( kind ? : FunctionTypeKind . Function , parameters , receiverTypeRef ? . coneType , rawReturnType , contextReceivers = contextReceivers . map { it . typeRef . coneType } ) }","docstring":"/**\n * [kind] == null means that [FunctionTypeKind.Function] will be used\n */"} {"signature":"fun FirAnonymousFunction . constructFunctionTypeRef ( session : FirSession , kind : FunctionTypeKind ? = null ) : FirResolvedTypeRef","body":"{ var diagnostic : ConeDiagnostic ? = null val kinds = session . functionTypeService . extractAllSpecialKindsForFunction ( symbol ) val kindFromDeclaration = when ( kinds . size ) { -> null -> kinds . single ( ) else -> { diagnostic = ConeAmbiguousFunctionTypeKinds ( kinds ) FunctionTypeKind . Function } } val type = constructFunctionType ( kindFromDeclaration ? : kind ) val source = this@constructFunctionTypeRef . source ? . fakeElement ( KtFakeSourceElementKind . ImplicitTypeRef ) return if ( diagnostic == null ) { buildResolvedTypeRef { this . source = source this . type = type } } else { buildErrorTypeRef { this . source = source this . type = type this . diagnostic = diagnostic } } }","docstring":"/**\n * [kind] == null means that [FunctionTypeKind.Function] will be used\n */"} {"signature":"internal fun FirFunction . forbiddenNamedArgumentsTargetOrNull ( originScope : FirTypeScope ? ) : ForbiddenNamedArgumentsTarget ?","body":"{ if ( hasStableParameterNames ) return null return when ( origin ) { FirDeclarationOrigin . ImportedFromObjectOrStatic -> importedFromObjectOrStaticData ? . original ? . forbiddenNamedArgumentsTargetOrNullIgnoringOverridden ( ) FirDeclarationOrigin . IntersectionOverride , is FirDeclarationOrigin . SubstitutionOverride , FirDeclarationOrigin . Delegated -> { val initial = unwrapFakeOverridesOrDelegated ( ) . forbiddenNamedArgumentsTargetOrNullIgnoringOverridden ( ) ? : return null initial . takeUnless { symbol . hasOverrideThatAllowsNamedArguments ( originScope ) } } FirDeclarationOrigin . Enhancement -> { ForbiddenNamedArgumentsTarget . NON_KOTLIN_FUNCTION . takeUnless { symbol . hasOverrideThatAllowsNamedArguments ( originScope ) } } FirDeclarationOrigin . BuiltIns -> ForbiddenNamedArgumentsTarget . INVOKE_ON_FUNCTION_TYPE is FirDeclarationOrigin . Plugin -> null else -> ForbiddenNamedArgumentsTarget . NON_KOTLIN_FUNCTION } }","docstring":"/**\n * Returns a non-null value when named arguments are forbidden for calls to this function.\n *\n * When [originScope] is provided, overrides of the function will be checked.\n * If one of the overridden functions allows named arguments, `null` will be returned.\n *\n * One example of this behavior is a Java function that overrides a Kotlin function.\n * In this case, `null` will be returned, if [originScope] is provided.\n * Otherwise, [ForbiddenNamedArgumentsTarget.NON_KOTLIN_FUNCTION] will be returned.\n *\n * To check if a function allows named arguments regardless of its overrides, it is recommended to use\n * [FirFunction.areNamedArgumentsForbiddenIgnoringOverridden].\n */"} {"signature":"private fun isEqualBound ( overrideBound : FirTypeRef , baseBound : FirTypeRef , overrideTypeParameter : FirTypeParameter , baseTypeParameter : FirTypeParameter , substitutor : ConeSubstitutor ) : Boolean","body":"{ val substitutedOverrideType = substitutor . substituteOrSelf ( overrideBound . coneType ) val substitutedBaseType = substitutor . substituteOrSelf ( baseBound . coneType ) if ( AbstractTypeChecker . equalTypes ( context , substitutedOverrideType , substitutedBaseType ) ) return true return overrideTypeParameter . symbol . resolvedBounds . any { bound -> isEqualTypes ( bound . coneType , substitutedBaseType , substitutor ) } && baseTypeParameter . symbol . resolvedBounds . any { bound -> isEqualTypes ( bound . coneType , substitutedOverrideType , substitutor ) } }","docstring":"/**\n * Good case complexity is O(1)\n * Worst case complexity is O(N), where N is number of type-parameter bound's\n */"} {"signature":"fun asString ( ) : String","body":"{ fun FqName . escapeSlashes ( ) : String { val res = asString ( ) if ( res . contains ( '' ) ) { return \"\" } return res } return if ( packageFqName . isRoot ) { relativeClassName . escapeSlashes ( ) } else { buildString { append ( packageFqName . asString ( ) . replace ( '' , '' ) ) append ( \"\" ) append ( relativeClassName . escapeSlashes ( ) ) } } }","docstring":"/**\n * @return a string where packages are delimited by '/' and classes by '.', e.g. \"kotlin/Map.Entry\"\n */"} {"signature":"@ JvmOverloads @ JvmStatic fun fromString ( string : String , isLocal : Boolean = false ) : ClassId","body":"{ val tickIndex = string . indexOf ( '' ) val lastSlashIndex = string . lastIndexOf ( \"\" , if ( tickIndex == - ) string . length else tickIndex ) val packageName : String val className : String if ( lastSlashIndex == - ) { packageName = \"\" className = string . replace ( \"\" , \"\" ) } else { packageName = string . substring ( , lastSlashIndex ) . replace ( '' , '' ) className = string . substring ( lastSlashIndex + ) . replace ( \"\" , \"\" ) } return ClassId ( FqName ( packageName ) , FqName ( className ) , isLocal ) }","docstring":"/**\n * @param string a string where packages are delimited by '/' and classes by '.', e.g. \"kotlin/Map.Entry\".\n * If class name contains slashes, it should be put into ticks, e.g. \"package/`test/test`\"\n */"} {"signature":"@ OptIn ( ExperimentalContracts :: class ) public suspend inline fun < R > select ( crossinline builder : SelectBuilder < R > . ( ) -> Unit ) : R","body":"{ contract { callsInPlace ( builder , InvocationKind . EXACTLY_ONCE ) } return SelectImplementation < R > ( coroutineContext ) . run { builder ( this ) doSelect ( ) } }","docstring":"/**\n * Waits for the result of multiple suspending functions simultaneously, which are specified using _clauses_\n * in the [builder] scope of this select invocation. The caller is suspended until one of the clauses\n * is either _selected_ or _fails_.\n *\n * At most one clause is *atomically* selected and its block is executed. The result of the selected clause\n * becomes the result of the select. If any clause _fails_, then the select invocation produces the\n * corresponding exception. No clause is selected in this case.\n *\n * This select function is _biased_ to the first clause. When multiple clauses can be selected at the same time,\n * the first one of them gets priority. Use [selectUnbiased] for an unbiased (randomized) selection among\n * the clauses.\n\n * There is no `default` clause for select expression. Instead, each selectable suspending function has the\n * corresponding non-suspending version that can be used with a regular `when` expression to select one\n * of the alternatives or to perform the default (`else`) action if none of them can be immediately selected.\n *\n * ### List of supported select methods\n *\n * | **Receiver** | **Suspending function** | **Select clause**\n * | ---------------- | --------------------------------------------- | -----------------------------------------------------\n * | [Job] | [join][Job.join] | [onJoin][Job.onJoin]\n * | [Deferred] | [await][Deferred.await] | [onAwait][Deferred.onAwait]\n * | [SendChannel] | [send][SendChannel.send] | [onSend][SendChannel.onSend]\n * | [ReceiveChannel] | [receive][ReceiveChannel.receive] | [onReceive][ReceiveChannel.onReceive]\n * | [ReceiveChannel] | [receiveCatching][ReceiveChannel.receiveCatching] | [onReceiveCatching][ReceiveChannel.onReceiveCatching]\n * | none | [delay] | [onTimeout][SelectBuilder.onTimeout]\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 *\n * Note that this function does not check for cancellation when it is not suspended.\n * Use [yield] or [CoroutineScope.isActive] to periodically check for cancellation in tight loops if needed.\n */"} {"signature":"public operator fun SelectClause0 . invoke ( block : suspend ( ) -> R )","body":"public operator fun SelectClause0 . invoke ( block : suspend ( ) -> R )","docstring":"/**\n * Registers a clause in this [select] expression without additional parameters that does not select any value.\n */"} {"signature":"public operator fun < Q > SelectClause1 < Q > . invoke ( block : suspend ( Q ) -> R )","body":"public operator fun < Q > SelectClause1 < Q > . invoke ( block : suspend ( Q ) -> R )","docstring":"/**\n * Registers clause in this [select] expression without additional parameters that selects value of type [Q].\n */"} {"signature":"public operator fun < P , Q > SelectClause2 < P , Q > . invoke ( param : P , block : suspend ( Q ) -> R )","body":"public operator fun < P , Q > SelectClause2 < P , Q > . invoke ( param : P , block : suspend ( Q ) -> R )","docstring":"/**\n * Registers clause in this [select] expression with additional parameter of type [P] that selects value of type [Q].\n */"} {"signature":"public operator fun < P , Q > SelectClause2 < P ? , Q > . invoke ( block : suspend ( Q ) -> R ) : Unit","body":"= invoke ( null , block )","docstring":"/**\n * Registers clause in this [select] expression with additional nullable parameter of type [P]\n * with the `null` value for this parameter that selects value of type [Q].\n */"} {"signature":"@ ExperimentalCoroutinesApi @ Suppress ( \"\" , \"\" ) @ LowPriorityInOverloadResolution @ Deprecated ( message = \"\" , level = DeprecationLevel . ERROR , replaceWith = ReplaceWith ( expression = \"\" , imports = [ \"\" ] ) ) public fun onTimeout ( timeMillis : Long , block : suspend ( ) -> R ) : Unit","body":"= onTimeout ( timeMillis , 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":"public fun trySelect ( clauseObject : Any , result : Any ? ) : Boolean","body":"public fun trySelect ( clauseObject : Any , result : Any ? ) : Boolean","docstring":"/**\n * This function should be called by other operations,\n * which are trying to perform a rendezvous with this `select`.\n * Returns `true` if the rendezvous succeeds, `false` otherwise.\n *\n * Note that according to the current implementation, a rendezvous attempt can fail\n * when either another clause is already selected or this `select` is still in\n * REGISTRATION phase. To distinguish the reasons, [SelectImplementation.trySelectDetailed]\n * function can be used instead.\n */"} {"signature":"public fun disposeOnCompletion ( disposableHandle : DisposableHandle )","body":"public fun disposeOnCompletion ( disposableHandle : DisposableHandle )","docstring":"/**\n * When this `select` instance is stored as a waiter, the specified [handle][disposableHandle]\n * defines how the stored `select` should be removed in case of cancellation or another clause selection.\n */"} {"signature":"public fun selectInRegistrationPhase ( internalResult : Any ? )","body":"public fun selectInRegistrationPhase ( internalResult : Any ? )","docstring":"/**\n * When a clause becomes selected during registration, the corresponding internal result\n * (which is further passed to the clause's [ProcessResultFunction]) should be provided\n * via this function. After that, other clause registrations are ignored and [trySelect] fails.\n */"} {"signature":"@ PublishedApi internal open suspend fun doSelect ( ) : R","body":"= if ( isSelected ) complete ( ) else doSelectSuspend ( )","docstring":"/**\n * This function is called after the [SelectBuilder] is applied. In case one of the clauses is already selected,\n * the algorithm applies the corresponding [ProcessResultFunction] and invokes the user-specified [block][ClauseData.block].\n * Otherwise, it moves this `select` to WAITING phase (re-registering clauses if needed), suspends until a rendezvous\n * is happened, and then completes the operation by applying the corresponding [ProcessResultFunction] and\n * invoking the user-specified [block][ClauseData.block].\n */"} {"signature":"@ JvmName ( \"\" ) internal fun ClauseData . register ( reregister : Boolean = false )","body":"{ assert { state . value !== STATE_CANCELLED } if ( state . value . let { it is SelectImplementation < * > . ClauseData } ) return if ( ! reregister ) checkClauseObject ( clauseObject ) if ( tryRegisterAsWaiter ( this @ SelectImplementation ) ) { if ( ! reregister ) clauses ! ! += this disposableHandleOrSegment = this@SelectImplementation . disposableHandleOrSegment indexInSegment = this@SelectImplementation . indexInSegment this@SelectImplementation . disposableHandleOrSegment = null this@SelectImplementation . indexInSegment = - } else { state . value = this } }","docstring":"/**\n * Attempts to register this `select` clause. If another clause is already selected,\n * this function does nothing and completes immediately.\n * Otherwise, it registers this `select` instance in\n * the [clause object][ClauseData.clauseObject]\n * according to the provided [registration function][ClauseData.regFunc].\n * On success, this `select` instance is stored as a waiter\n * in the clause object -- the algorithm also stores\n * the provided via [disposeOnCompletion] completion action\n * and adds the clause to the list of registered one.\n * In case of registration failure, the internal result\n * (not processed by [ProcessResultFunction] yet) must be\n * provided via [selectInRegistrationPhase] -- the algorithm\n * updates the state to this clause reference.\n */"} {"signature":"private fun checkClauseObject ( clauseObject : Any )","body":"{ val clauses = clauses ! ! check ( clauses . none { it . clauseObject === clauseObject } ) { \"\" } }","docstring":"/**\n * Checks that there does not exist another clause with the same object.\n */"} {"signature":"override fun invokeOnCancellation ( segment : Segment < * > , index : Int )","body":"{ this . disposableHandleOrSegment = segment this . indexInSegment = index }","docstring":"/**\n * An optimized version for the code below that does not allocate\n * a cancellation handler object and efficiently stores the specified\n * [segment] and [index].\n *\n * ```\n * disposeOnCompletion {\n * segment.onCancellation(index, null)\n * }\n * ```\n */"} {"signature":"private suspend fun waitUntilSelected ( )","body":"= suspendCancellableCoroutine < Unit > sc @ { cont -> state . loop { curState -> when { curState === STATE_REG -> if ( state . compareAndSet ( curState , cont ) ) { cont . invokeOnCancellation ( this ) return@sc } curState is List < * > -> if ( state . compareAndSet ( curState , STATE_REG ) ) { @ Suppress ( \"\" ) curState as List < Any > curState . forEach { reregisterClause ( it ) } } curState is SelectImplementation < * > . ClauseData -> { cont . resume ( Unit , curState . createOnCancellationAction ( this , internalResult ) ) return@sc } else -> error ( \"\" ) } } }","docstring":"/**\n * Suspends and waits until some clause is selected. However, it is possible for a concurrent\n * coroutine to invoke [trySelect] while this `select` is still in REGISTRATION phase.\n * In this case, [trySelect] marks the corresponding select clause to be re-registered, and\n * this function performs registration of such clauses. After that, it atomically stores\n * the continuation into the [state] field if there is no more clause to be re-registered.\n */"} {"signature":"private fun reregisterClause ( clauseObject : Any )","body":"{ val clause = findClause ( clauseObject ) ! ! clause . disposableHandleOrSegment = null clause . indexInSegment = - clause . register ( reregister = true ) }","docstring":"/**\n * Re-registers the clause with the specified\n * [clause object][clauseObject] after unsuccessful\n * [trySelect] of this clause while the `select`\n * was still in REGISTRATION phase.\n */"} {"signature":"fun trySelectDetailed ( clauseObject : Any , result : Any ? )","body":"= TrySelectDetailedResult ( trySelectInternal ( clauseObject , result ) )","docstring":"/**\n * Similar to [trySelect] but provides a failure reason\n * if this rendezvous is unsuccessful. We need this function\n * in the channel implementation.\n */"} {"signature":"private fun findClause ( clauseObject : Any ) : ClauseData ?","body":"{ val clauses = this . clauses ? : return null return clauses . find { it . clauseObject === clauseObject } ? : error ( \"\" ) }","docstring":"/**\n * Finds the clause with the corresponding [clause object][SelectClause.clauseObject].\n * If the reference to the list of clauses is already cleared due to completion/cancellation,\n * this function returns `null`\n */"} {"signature":"private suspend fun complete ( ) : R","body":"{ assert { isSelected } @ Suppress ( \"\" ) val selectedClause = state . value as SelectImplementation < R > . ClauseData val internalResult = this . internalResult cleanup ( selectedClause ) return if ( ! RECOVER_STACK_TRACES ) { val blockArgument = selectedClause . processResult ( internalResult ) selectedClause . invokeBlock ( blockArgument ) } else { processResultAndInvokeBlockRecoveringException ( selectedClause , internalResult ) } }","docstring":"/**\n * Completes this `select` operation after the internal result is provided\n * via [SelectInstance.trySelect] or [SelectInstance.selectInRegistrationPhase].\n * (1) First, this function applies the [ProcessResultFunction] of the selected clause\n * to the internal result.\n * (2) After that, the [clean-up procedure][cleanup]\n * is called to remove this `select` instance from other clause objects, and\n * make it possible to collect it by GC after this `select` finishes.\n * (3) Finally, the user-specified block is invoked\n * with the processed result as an argument.\n */"} {"signature":"private fun cleanup ( selectedClause : ClauseData )","body":"{ assert { state . value == selectedClause } val clauses = this . clauses ? : return clauses . forEach { clause -> if ( clause !== selectedClause ) clause . dispose ( ) } this . state . value = STATE_COMPLETED this . internalResult = NO_RESULT this . clauses = null }","docstring":"/**\n * Invokes all [DisposableHandle]-s provided via\n * [SelectInstance.disposeOnCompletion] during\n * clause registrations.\n */"} {"signature":"fun tryRegisterAsWaiter ( select : SelectImplementation < R > ) : Boolean","body":"{ assert { select . inRegistrationPhase || select . isCancelled } assert { select . internalResult === NO_RESULT } regFunc ( clauseObject , select , param ) return select . internalResult === NO_RESULT }","docstring":"/**\n * Tries to register the specified [select] instance in [clauseObject] and check\n * whether the registration succeeded or a rendezvous has happened during the registration.\n * This function returns `true` if this [select] is successfully registered and\n * is _waiting_ for a rendezvous, or `false` when this clause becomes\n * selected during registration.\n *\n * For example, the [Channel.onReceive] clause registration\n * on a non-empty channel retrieves the first element and completes\n * the corresponding [select] via [SelectInstance.selectInRegistrationPhase].\n */"} {"signature":"fun processResult ( result : Any ? )","body":"= processResFunc ( clauseObject , param , result )","docstring":"/**\n * Processes the internal result provided via either\n * [SelectInstance.selectInRegistrationPhase] or\n * [SelectInstance.trySelect] and returns an argument\n * for the user-specified [block].\n *\n * Importantly, this function may throw an exception\n * (e.g., when the channel is closed in [Channel.onSend], the\n * corresponding [ProcessResultFunction] is bound to fail).\n */"} {"signature":"@ Suppress ( \"\" ) suspend fun invokeBlock ( argument : Any ? ) : R","body":"{ val block = block return if ( this . param === PARAM_CLAUSE_0 ) { block as suspend ( ) -> R block ( ) } else { block as suspend ( Any ? ) -> R block ( argument ) } }","docstring":"/**\n * Invokes the user-specified block and returns\n * the final result of this `select` clause.\n */"} {"signature":"private fun JsNode . match ( predicate : ( JsNode ) -> Boolean ) : Set < JsNode >","body":"{ val visitor = object : JsExpressionVisitor ( ) { val matched = IdentitySet < JsNode > ( ) override fun < R : JsNode > doTraverse ( node : R , ctx : JsContext < JsNode > ? ) { super . doTraverse ( node , ctx ) if ( node !in matched && predicate ( node ) ) { matched . add ( node ) } } } visitor . accept ( this ) return visitor . matched }","docstring":"/**\n * Returns descendants of receiver, matched by [predicate].\n */"} {"signature":"private fun JsNode . withParentsOfNodes ( nodes : Set < JsNode > ) : Set < JsNode >","body":"{ val visitor = object : JsExpressionVisitor ( ) { private val stack = SmartList < JsNode > ( ) val matched = IdentitySet < JsNode > ( ) override fun < R : JsNode > doTraverse ( node : R , ctx : JsContext < JsNode > ? ) { stack . add ( node ) super . doTraverse ( node , ctx ) if ( node in nodes ) { addAllUntilMatchedOrStatement ( stack ) } stack . removeAt ( stack . lastIndex ) } fun addAllUntilMatchedOrStatement ( nodesOnStack : List < JsNode > ) { for ( i in nodesOnStack . lastIndex downTo ) { val currentNode = nodesOnStack [ i ] if ( currentNode in matched ) break matched . add ( currentNode ) if ( currentNode is JsStatement ) break } } } visitor . accept ( this ) return visitor . matched }","docstring":"/**\n * Returns set of nodes, that satisfy transitive closure of `is parent` relation, starting from [nodes].\n */"} {"signature":"public fun getCallableSignatures ( nameFilter : KtScopeNameFilter = { true } ) : Sequence < KtCallableSignature < * > >","body":"public fun getCallableSignatures ( nameFilter : KtScopeNameFilter = { true } ) : Sequence < KtCallableSignature < * > >","docstring":"/**\n * Return a sequence of [KtCallableSignature] which current scope contain if declaration name matches [nameFilter].\n */"} {"signature":"public fun getCallableSignatures ( names : Collection < Name > ) : Sequence < KtCallableSignature < * > >","body":"public fun getCallableSignatures ( names : Collection < Name > ) : Sequence < KtCallableSignature < * > >","docstring":"/**\n * Return a sequence of [KtCallableSignature] which current scope contain if declaration, if declaration name present in [names]\n *\n * This implementation is more optimal than the one with `nameFilter` and should be used when the candidate name set is known.\n */"} {"signature":"public fun getCallableSignatures ( vararg names : Name ) : Sequence < KtCallableSignature < * > >","body":"= withValidityAssertion { getCallableSignatures ( names . toList ( ) ) }","docstring":"/**\n * Return a sequence of [KtCallableSignature] which current scope contain if declaration, if declaration name present in [names]\n *\n * @see getCallableSignatures\n */"} {"signature":"public fun getClassifierSymbols ( nameFilter : KtScopeNameFilter = { true } ) : Sequence < KtClassifierSymbol >","body":"public fun getClassifierSymbols ( nameFilter : KtScopeNameFilter = { true } ) : Sequence < KtClassifierSymbol >","docstring":"/**\n * Return a sequence of [KtClassifierSymbol] which current scope contain if classifier name matches [nameFilter]. The sequence includes:\n * nested classes, inner classes, nested type aliases for the class scope, and top-level classes and top-level type aliases for file scope.\n *\n * This function needs to retrieve a set of all possible names before processing the scope.\n * The overload with `names: Collection` should be used when the candidate name set is known.\n */"} {"signature":"public fun getClassifierSymbols ( names : Collection < Name > ) : Sequence < KtClassifierSymbol >","body":"public fun getClassifierSymbols ( names : Collection < Name > ) : Sequence < KtClassifierSymbol >","docstring":"/**\n * Return a sequence of [KtClassifierSymbol] which current scope contains, if classifier name present in [names].\n *\n * The sequence includes: nested classes, inner classes, nested type aliases for the class scope,\n * and top-level classes and top-level type aliases for file scope.\n *\n * This implementation is more optimal than the one with `nameFilter` and should be used when the candidate name set is known.\n */"} {"signature":"public fun getClassifierSymbols ( vararg names : Name ) : Sequence < KtClassifierSymbol >","body":"= getClassifierSymbols ( names . toList ( ) )","docstring":"/**\n * Return a sequence of [KtClassifierSymbol] which current scope contains, if classifier name present in [names].\n *\n * @see getClassifierSymbols\n */"} {"signature":"public fun getConstructors ( ) : Sequence < KtConstructorSymbol >","body":"public fun getConstructors ( ) : Sequence < KtConstructorSymbol >","docstring":"/**\n * Return a sequence of [KtConstructorSymbol] which current scope contain\n */"} {"signature":"@ SinceKotlin ( \"\" ) public expect fun < T : Comparable < T > > maxOf ( a : T , b : T ) : T","body":"@ SinceKotlin ( \"\" ) public expect fun < T : Comparable < T > > maxOf ( a : T , b : T ) : T","docstring":"/**\n * Returns the greater of two values.\n * \n * If values are equal, returns the first one.\n */"} {"signature":"@ SinceKotlin ( \"\" ) public expect inline fun maxOf ( a : Byte , b : Byte ) : Byte","body":"@ SinceKotlin ( \"\" ) public expect inline fun maxOf ( a : Byte , b : Byte ) : Byte","docstring":"/**\n * Returns the greater of two values.\n */"} {"signature":"@ SinceKotlin ( \"\" ) public expect inline fun maxOf ( a : Short , b : Short ) : Short","body":"@ SinceKotlin ( \"\" ) public expect inline fun maxOf ( a : Short , b : Short ) : Short","docstring":"/**\n * Returns the greater of two values.\n */"} {"signature":"@ SinceKotlin ( \"\" ) public expect inline fun maxOf ( a : Int , b : Int ) : Int","body":"@ SinceKotlin ( \"\" ) public expect inline fun maxOf ( a : Int , b : Int ) : Int","docstring":"/**\n * Returns the greater of two values.\n */"} {"signature":"@ SinceKotlin ( \"\" ) public expect inline fun maxOf ( a : Long , b : Long ) : Long","body":"@ SinceKotlin ( \"\" ) public expect inline fun maxOf ( a : Long , b : Long ) : Long","docstring":"/**\n * Returns the greater of two values.\n */"} {"signature":"@ SinceKotlin ( \"\" ) public expect inline fun maxOf ( a : Float , b : Float ) : Float","body":"@ SinceKotlin ( \"\" ) public expect inline fun maxOf ( a : Float , b : Float ) : Float","docstring":"/**\n * Returns the greater of two values.\n * \n * If either value is `NaN`, returns `NaN`.\n */"} {"signature":"@ SinceKotlin ( \"\" ) public expect inline fun maxOf ( a : Double , b : Double ) : Double","body":"@ SinceKotlin ( \"\" ) public expect inline fun maxOf ( a : Double , b : Double ) : Double","docstring":"/**\n * Returns the greater of two values.\n * \n * If either value is `NaN`, returns `NaN`.\n */"} {"signature":"@ SinceKotlin ( \"\" ) public expect fun < T : Comparable < T > > maxOf ( a : T , b : T , c : T ) : T","body":"@ SinceKotlin ( \"\" ) public expect fun < T : Comparable < T > > maxOf ( a : T , b : T , c : T ) : T","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 expect inline fun maxOf ( a : Byte , b : Byte , c : Byte ) : Byte","body":"@ SinceKotlin ( \"\" ) @ kotlin . internal . InlineOnly public expect inline fun maxOf ( a : Byte , b : Byte , c : Byte ) : Byte","docstring":"/**\n * Returns the greater of three values.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . internal . InlineOnly public expect inline fun maxOf ( a : Short , b : Short , c : Short ) : Short","body":"@ SinceKotlin ( \"\" ) @ kotlin . internal . InlineOnly public expect inline fun maxOf ( a : Short , b : Short , c : Short ) : Short","docstring":"/**\n * Returns the greater of three values.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . internal . InlineOnly public expect inline fun maxOf ( a : Int , b : Int , c : Int ) : Int","body":"@ SinceKotlin ( \"\" ) @ kotlin . internal . InlineOnly public expect inline fun maxOf ( a : Int , b : Int , c : Int ) : Int","docstring":"/**\n * Returns the greater of three values.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . internal . InlineOnly public expect inline fun maxOf ( a : Long , b : Long , c : Long ) : Long","body":"@ SinceKotlin ( \"\" ) @ kotlin . internal . InlineOnly public expect inline fun maxOf ( a : Long , b : Long , c : Long ) : Long","docstring":"/**\n * Returns the greater of three values.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . internal . InlineOnly public expect inline fun maxOf ( a : Float , b : Float , c : Float ) : Float","body":"@ SinceKotlin ( \"\" ) @ kotlin . internal . InlineOnly public expect inline fun maxOf ( a : Float , b : Float , c : Float ) : Float","docstring":"/**\n * Returns the greater of three values.\n * \n * If any value is `NaN`, returns `NaN`.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . internal . InlineOnly public expect inline fun maxOf ( a : Double , b : Double , c : Double ) : Double","body":"@ SinceKotlin ( \"\" ) @ kotlin . internal . InlineOnly public expect inline fun maxOf ( a : Double , b : Double , c : Double ) : Double","docstring":"/**\n * Returns the greater of three values.\n * \n * If any value is `NaN`, returns `NaN`.\n */"} {"signature":"@ SinceKotlin ( \"\" ) public fun < T > maxOf ( a : T , b : T , c : T , comparator : Comparator < in T > ) : T","body":"{ return maxOf ( a , maxOf ( b , c , comparator ) , comparator ) }","docstring":"/**\n * Returns the greater of three values according to the order specified by the given [comparator].\n * \n * If there are multiple equal maximal values, returns the first of them.\n */"} {"signature":"@ SinceKotlin ( \"\" ) public fun < T > maxOf ( a : T , b : T , comparator : Comparator < in T > ) : T","body":"{ return if ( comparator . compare ( a , b ) >= ) a else b }","docstring":"/**\n * Returns the greater of two values according to the order specified by the given [comparator].\n * \n * If values are equal, returns the first one.\n */"} {"signature":"@ SinceKotlin ( \"\" ) public expect fun < T : Comparable < T > > maxOf ( a : T , vararg other : T ) : T","body":"@ SinceKotlin ( \"\" ) public expect fun < T : Comparable < T > > maxOf ( a : T , vararg other : T ) : T","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 expect fun maxOf ( a : Byte , vararg other : Byte ) : Byte","body":"@ SinceKotlin ( \"\" ) public expect fun maxOf ( a : Byte , vararg other : Byte ) : Byte","docstring":"/**\n * Returns the greater of the given values.\n */"} {"signature":"@ SinceKotlin ( \"\" ) public expect fun maxOf ( a : Short , vararg other : Short ) : Short","body":"@ SinceKotlin ( \"\" ) public expect fun maxOf ( a : Short , vararg other : Short ) : Short","docstring":"/**\n * Returns the greater of the given values.\n */"} {"signature":"@ SinceKotlin ( \"\" ) public expect fun maxOf ( a : Int , vararg other : Int ) : Int","body":"@ SinceKotlin ( \"\" ) public expect fun maxOf ( a : Int , vararg other : Int ) : Int","docstring":"/**\n * Returns the greater of the given values.\n */"} {"signature":"@ SinceKotlin ( \"\" ) public expect fun maxOf ( a : Long , vararg other : Long ) : Long","body":"@ SinceKotlin ( \"\" ) public expect fun maxOf ( a : Long , vararg other : Long ) : Long","docstring":"/**\n * Returns the greater of the given values.\n */"} {"signature":"@ SinceKotlin ( \"\" ) public expect fun maxOf ( a : Float , vararg other : Float ) : Float","body":"@ SinceKotlin ( \"\" ) public expect fun maxOf ( a : Float , vararg other : Float ) : Float","docstring":"/**\n * Returns the greater of the given values.\n * \n * If any value is `NaN`, returns `NaN`.\n */"} {"signature":"@ SinceKotlin ( \"\" ) public expect fun maxOf ( a : Double , vararg other : Double ) : Double","body":"@ SinceKotlin ( \"\" ) public expect fun maxOf ( a : Double , vararg other : Double ) : Double","docstring":"/**\n * Returns the greater of the given values.\n * \n * If any value is `NaN`, returns `NaN`.\n */"} {"signature":"@ SinceKotlin ( \"\" ) public fun < T > maxOf ( a : T , vararg other : T , comparator : Comparator < in T > ) : T","body":"{ var max = a for ( e in other ) if ( comparator . compare ( max , e ) < ) max = e return max }","docstring":"/**\n * Returns the greater of the given values according to the order specified by the given [comparator].\n * \n * If there are multiple equal maximal values, returns the first of them.\n */"} {"signature":"@ SinceKotlin ( \"\" ) public expect fun < T : Comparable < T > > minOf ( a : T , b : T ) : T","body":"@ SinceKotlin ( \"\" ) public expect fun < T : Comparable < T > > minOf ( a : T , b : T ) : T","docstring":"/**\n * Returns the smaller of two values.\n * \n * If values are equal, returns the first one.\n */"} {"signature":"@ SinceKotlin ( \"\" ) public expect inline fun minOf ( a : Byte , b : Byte ) : Byte","body":"@ SinceKotlin ( \"\" ) public expect inline fun minOf ( a : Byte , b : Byte ) : Byte","docstring":"/**\n * Returns the smaller of two values.\n */"} {"signature":"@ SinceKotlin ( \"\" ) public expect inline fun minOf ( a : Short , b : Short ) : Short","body":"@ SinceKotlin ( \"\" ) public expect inline fun minOf ( a : Short , b : Short ) : Short","docstring":"/**\n * Returns the smaller of two values.\n */"} {"signature":"@ SinceKotlin ( \"\" ) public expect inline fun minOf ( a : Int , b : Int ) : Int","body":"@ SinceKotlin ( \"\" ) public expect inline fun minOf ( a : Int , b : Int ) : Int","docstring":"/**\n * Returns the smaller of two values.\n */"} {"signature":"@ SinceKotlin ( \"\" ) public expect inline fun minOf ( a : Long , b : Long ) : Long","body":"@ SinceKotlin ( \"\" ) public expect inline fun minOf ( a : Long , b : Long ) : Long","docstring":"/**\n * Returns the smaller of two values.\n */"} {"signature":"@ SinceKotlin ( \"\" ) public expect inline fun minOf ( a : Float , b : Float ) : Float","body":"@ SinceKotlin ( \"\" ) public expect inline fun minOf ( a : Float , b : Float ) : Float","docstring":"/**\n * Returns the smaller of two values.\n * \n * If either value is `NaN`, returns `NaN`.\n */"} {"signature":"@ SinceKotlin ( \"\" ) public expect inline fun minOf ( a : Double , b : Double ) : Double","body":"@ SinceKotlin ( \"\" ) public expect inline fun minOf ( a : Double , b : Double ) : Double","docstring":"/**\n * Returns the smaller of two values.\n * \n * If either value is `NaN`, returns `NaN`.\n */"} {"signature":"@ SinceKotlin ( \"\" ) public expect fun < T : Comparable < T > > minOf ( a : T , b : T , c : T ) : T","body":"@ SinceKotlin ( \"\" ) public expect fun < T : Comparable < T > > minOf ( a : T , b : T , c : T ) : T","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 expect inline fun minOf ( a : Byte , b : Byte , c : Byte ) : Byte","body":"@ SinceKotlin ( \"\" ) @ kotlin . internal . InlineOnly public expect inline fun minOf ( a : Byte , b : Byte , c : Byte ) : Byte","docstring":"/**\n * Returns the smaller of three values.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . internal . InlineOnly public expect inline fun minOf ( a : Short , b : Short , c : Short ) : Short","body":"@ SinceKotlin ( \"\" ) @ kotlin . internal . InlineOnly public expect inline fun minOf ( a : Short , b : Short , c : Short ) : Short","docstring":"/**\n * Returns the smaller of three values.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . internal . InlineOnly public expect inline fun minOf ( a : Int , b : Int , c : Int ) : Int","body":"@ SinceKotlin ( \"\" ) @ kotlin . internal . InlineOnly public expect inline fun minOf ( a : Int , b : Int , c : Int ) : Int","docstring":"/**\n * Returns the smaller of three values.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . internal . InlineOnly public expect inline fun minOf ( a : Long , b : Long , c : Long ) : Long","body":"@ SinceKotlin ( \"\" ) @ kotlin . internal . InlineOnly public expect inline fun minOf ( a : Long , b : Long , c : Long ) : Long","docstring":"/**\n * Returns the smaller of three values.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . internal . InlineOnly public expect inline fun minOf ( a : Float , b : Float , c : Float ) : Float","body":"@ SinceKotlin ( \"\" ) @ kotlin . internal . InlineOnly public expect inline fun minOf ( a : Float , b : Float , c : Float ) : Float","docstring":"/**\n * Returns the smaller of three values.\n * \n * If any value is `NaN`, returns `NaN`.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . internal . InlineOnly public expect inline fun minOf ( a : Double , b : Double , c : Double ) : Double","body":"@ SinceKotlin ( \"\" ) @ kotlin . internal . InlineOnly public expect inline fun minOf ( a : Double , b : Double , c : Double ) : Double","docstring":"/**\n * Returns the smaller of three values.\n * \n * If any value is `NaN`, returns `NaN`.\n */"} {"signature":"@ SinceKotlin ( \"\" ) public fun < T > minOf ( a : T , b : T , c : T , comparator : Comparator < in T > ) : T","body":"{ return minOf ( a , minOf ( b , c , comparator ) , comparator ) }","docstring":"/**\n * Returns the smaller of three values according to the order specified by the given [comparator].\n * \n * If there are multiple equal minimal values, returns the first of them.\n */"} {"signature":"@ SinceKotlin ( \"\" ) public fun < T > minOf ( a : T , b : T , comparator : Comparator < in T > ) : T","body":"{ return if ( comparator . compare ( a , b ) <= ) a else b }","docstring":"/**\n * Returns the smaller of two values according to the order specified by the given [comparator].\n * \n * If values are equal, returns the first one.\n */"} {"signature":"@ SinceKotlin ( \"\" ) public expect fun < T : Comparable < T > > minOf ( a : T , vararg other : T ) : T","body":"@ SinceKotlin ( \"\" ) public expect fun < T : Comparable < T > > minOf ( a : T , vararg other : T ) : T","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 expect fun minOf ( a : Byte , vararg other : Byte ) : Byte","body":"@ SinceKotlin ( \"\" ) public expect fun minOf ( a : Byte , vararg other : Byte ) : Byte","docstring":"/**\n * Returns the smaller of the given values.\n */"} {"signature":"@ SinceKotlin ( \"\" ) public expect fun minOf ( a : Short , vararg other : Short ) : Short","body":"@ SinceKotlin ( \"\" ) public expect fun minOf ( a : Short , vararg other : Short ) : Short","docstring":"/**\n * Returns the smaller of the given values.\n */"} {"signature":"@ SinceKotlin ( \"\" ) public expect fun minOf ( a : Int , vararg other : Int ) : Int","body":"@ SinceKotlin ( \"\" ) public expect fun minOf ( a : Int , vararg other : Int ) : Int","docstring":"/**\n * Returns the smaller of the given values.\n */"} {"signature":"@ SinceKotlin ( \"\" ) public expect fun minOf ( a : Long , vararg other : Long ) : Long","body":"@ SinceKotlin ( \"\" ) public expect fun minOf ( a : Long , vararg other : Long ) : Long","docstring":"/**\n * Returns the smaller of the given values.\n */"} {"signature":"@ SinceKotlin ( \"\" ) public expect fun minOf ( a : Float , vararg other : Float ) : Float","body":"@ SinceKotlin ( \"\" ) public expect fun minOf ( a : Float , vararg other : Float ) : Float","docstring":"/**\n * Returns the smaller of the given values.\n * \n * If any value is `NaN`, returns `NaN`.\n */"} {"signature":"@ SinceKotlin ( \"\" ) public expect fun minOf ( a : Double , vararg other : Double ) : Double","body":"@ SinceKotlin ( \"\" ) public expect fun minOf ( a : Double , vararg other : Double ) : Double","docstring":"/**\n * Returns the smaller of the given values.\n * \n * If any value is `NaN`, returns `NaN`.\n */"} {"signature":"@ SinceKotlin ( \"\" ) public fun < T > minOf ( a : T , vararg other : T , comparator : Comparator < in T > ) : T","body":"{ var min = a for ( e in other ) if ( comparator . compare ( min , e ) > ) min = e return min }","docstring":"/**\n * Returns the smaller of the given values according to the order specified by the given [comparator].\n * \n * If there are multiple equal minimal values, returns the first of them.\n */"} {"signature":"public abstract fun renderAsKotlinConstant ( ) : String","body":"public abstract fun renderAsKotlinConstant ( ) : String","docstring":"/**\n * Constant value represented as Kotlin code. E.g: `1`, `2f, `3u` `null`, `\"str\"`\n */"} {"signature":"operator fun < K , V > Map . Entry < K , V > . component1 ( ) : K","body":"{ return key }","docstring":"/** Returns the key of the entry */"} {"signature":"operator fun < K , V > Map . Entry < K , V > . component2 ( ) : V","body":"{ return value }","docstring":"/** Returns the value of the entry */"} {"signature":"abstract fun run ( config : KonanConfig , environment : KotlinCoreEnvironment )","body":"abstract fun run ( config : KonanConfig , environment : KotlinCoreEnvironment )","docstring":"/**\n * Entry point for compilation pipeline.\n */"} {"signature":"@ Deprecated ( \"\" , ReplaceWith ( \"\" ) , DeprecationLevel . WARNING ) fun fromProject ( project : Project )","body":"= GradleExecutionContext ( filesProvider = project :: files , javaexec = { spec -> project . javaexec ( spec ) } , logger = project . logger )","docstring":"/**\n * Executing [KotlinToolRunner] during Gradle Configuration Phase is undesired behaviour.\n * Currently only [KotlinNativeLibraryGenerationRunner] used in this way.\n * It should be fixed as part of KT-51255\n */"} {"signature":"fun fromTaskContext ( objectFactory : ObjectFactory , execOperations : ExecOperations , logger : Logger , )","body":"= GradleExecutionContext ( filesProvider = objectFactory . fileCollection ( ) :: from , javaexec = { spec -> execOperations . javaexec ( spec ) } , logger = logger )","docstring":"/** Gradle Configuration Cache friendly context, should be used inside Task Execution Phase */"} {"signature":"override fun printBuildReport ( data : Any , outputFile : File )","body":"{ outputFile . bufferedWriter ( ) . use { it . write ( gson . toJson ( data ) ) } }","docstring":"/**\n * Prints general build information and task/transform build metrics\n */"} {"signature":"public inline fun LayerCollectorContext . pie ( block : PieContext . ( ) -> Unit )","body":"{ addLayer ( PieContext ( this ) . apply ( block ) ) }","docstring":"/**\n * Adds a new `pie` layer to the plot.\n *\n * The `pie` layer represents categorical data through the angle of pie slices.\n * The size of each slice is proportional to the value it represents.\n *\n * This function creates a context where you can set aesthetic mappings (`aes`) or aesthetic constants.\n * - Mappings are specified by calling methods that correspond to aesthetic names (`aes`).\n * - Constants are directly assigned using properties with the names corresponding to aesthetics.\n * For positional aesthetics, you can use the `.constant()` method.\n *\n * ## Pie Aesthetics\n * * **`x`** - The X-coordinate specifying the center of the pie.\n * * **`y`** - The Y-coordinate specifying the center of the pie.\n * * **`fillColor`** - The color of each pie slice.\n * * **`slice`** - The value each slice represents.\n * * **`hole`** - The radius of the inner hole, creating a donut chart when set.\n * * **`explode`** - The distance to offset slices from the center.\n * * **`size`** - The size of the pie chart.\n * * **`alpha`** - The transparency of the pie slices.\n * * **`stroke`** - The stroke width around each slice.\n * * **`strokeColor`** - The color of the stroke around each slice.\n *\n * ## Example\n *\n * ```kotlin\n * val categories by columnOf(\"Rent\", \"Food\", \"Utilities\", \"Transportation\", \"Entertainment\")\n * val amounts by columnOf(500.0, 300.0, 150.0, 100.0, 50.0)\n *\n * plot {\n * pie {\n * // Positional settings for the center of the pie chart\n * x.constant(0.5) // Assuming this is the normalized center on the X-axis\n * y.constant(0.5) // Assuming this is the normalized center on the Y-axis\n *\n * slice(amounts) // The values that each slice represents\n *\n * // Non-positional setting for the size of the pie chart\n * size = 30.0 // Assuming this is a normalized size relative to the plot dimensions\n *\n * // Non-positional mapping for the fill color based on the category\n * fillColor(categories) {\n * // Inside this block, you would define the mapping parameters or color scale\n * // e.g., you might want to map each category to a specific color\n * }\n *\n * // Non-positional settings for aesthetics like alpha, stroke, and stroke color\n * alpha = 0.8 // Sets the transparency of the pie slices\n * stroke = 1.0 // Sets the stroke width around each slice\n * strokeColor = Color.BLACK // Sets the color of the stroke around each slice\n *\n * // If you want to create a donut chart, set the hole radius\n * hole = 0.2 // Assuming this creates a hole with radius equal to 20% of the pie chart radius\n *\n * // If you want to \"explode\" or offset a slice from the center, specify the explode setting\n * explode(listOf(.0, .0, 0.1, .0, .0)) // This would offset the \"Utilities\" slice by 10% of the pie radius\n * }\n * }\n * ```\n */"} {"signature":"fun getSession ( module : KtModule , preferBinary : Boolean = false ) : LLFirSession","body":"{ if ( module is KtBinaryModule && ( preferBinary || module is KtSdkModule ) ) { return getCachedSession ( module , binaryCache ) { createPlatformAwareSessionFactory ( module ) . createBinaryLibrarySession ( module ) } } if ( module is KtDanglingFileModule ) { return getDanglingFileCachedSession ( module ) } return getCachedSession ( module , sourceCache , factory = :: createSession ) }","docstring":"/**\n * Returns the existing session if found, or creates a new session and caches it.\n * Analyzable session will be returned for a library module.\n *\n * Must be called from a read action.\n */"} {"signature":"internal fun getSessionNoCaching ( module : KtModule ) : LLFirSession","body":"{ return createSession ( module ) }","docstring":"/**\n * Returns a session without caching it.\n * Note that session dependencies are still cached.\n */"} {"signature":"fun removeSession ( module : KtModule ) : Boolean","body":"{ ApplicationManager . getApplication ( ) . assertWriteAccessAllowed ( ) val didSourceSessionExist = removeSessionFrom ( module , sourceCache ) val didBinarySessionExist = module is KtBinaryModule && removeSessionFrom ( module , binaryCache ) val didDanglingFileSessionExist = module is KtDanglingFileModule && removeSessionFrom ( module , danglingFileSessionCache ) val didUnstableDanglingFileSessionExist = module is KtDanglingFileModule && removeSessionFrom ( module , unstableDanglingFileSessionCache ) return didSourceSessionExist || didBinarySessionExist || didDanglingFileSessionExist || didUnstableDanglingFileSessionExist }","docstring":"/**\n * Removes the session(s) associated with [module] after it has been invalidated. Must be called in a write action.\n *\n * @return `true` if any sessions were removed.\n */"} {"signature":"fun removeAllSessions ( includeLibraryModules : Boolean )","body":"{ ApplicationManager . getApplication ( ) . assertWriteAccessAllowed ( ) if ( includeLibraryModules ) { removeAllSessionsFrom ( sourceCache ) removeAllSessionsFrom ( binaryCache ) } else { removeAllMatchingSessionsFrom ( sourceCache ) { it !is KtBinaryModule && it !is KtLibrarySourceModule } } removeAllDanglingFileSessions ( ) }","docstring":"/**\n * Removes all sessions after global invalidation. If [includeLibraryModules] is `false`, sessions of library modules will not be\n * removed.\n *\n * [removeAllSessions] must be called in a write action.\n */"} {"signature":"public fun < T > Flow < T > . catch ( action : suspend FlowCollector < T > . ( cause : Throwable ) -> Unit ) : Flow < T >","body":"= flow { val exception = catchImpl ( this ) if ( exception != null ) action ( exception ) }","docstring":"/**\n * Catches exceptions in the flow completion and calls a specified [action] with\n * the caught exception. This operator is *transparent* to exceptions that occur\n * in downstream flow and does not catch exceptions that are thrown to cancel the flow.\n *\n * For example:\n *\n * ```\n * flow { emitData() }\n * .map { computeOne(it) }\n * .catch { ... } // catches exceptions in emitData and computeOne\n * .map { computeTwo(it) }\n * .collect { process(it) } // throws exceptions from process and computeTwo\n * ```\n *\n * Conceptually, the action of `catch` operator is similar to wrapping the code of upstream flows with\n * `try { ... } catch (e: Throwable) { action(e) }`.\n *\n * Any exception in the [action] code itself proceeds downstream where it can be\n * caught by further `catch` operators if needed. If a particular exception does not need to be\n * caught it can be rethrown from the action of `catch` operator. For example:\n *\n * ```\n * flow.catch { e ->\n * if (e !is IOException) throw e // rethrow all but IOException\n * // e is IOException here\n * ...\n * }\n * ```\n *\n * The [action] code has [FlowCollector] as a receiver and can [emit][FlowCollector.emit] values downstream.\n * For example, caught exception can be replaced with some wrapper value for errors:\n *\n * ```\n * flow.catch { e -> emit(ErrorWrapperValue(e)) }\n * ```\n *\n * The [action] can also use [emitAll] to fallback on some other flow in case of an error. However, to\n * retry an original flow use [retryWhen] operator that can retry the flow multiple times without\n * introducing ever-growing stack of suspending calls.\n */"} {"signature":"public fun < T > Flow < T > . retry ( retries : Long = Long . MAX_VALUE , predicate : suspend ( cause : Throwable ) -> Boolean = { true } ) : Flow < T >","body":"{ require ( retries > ) { \"\" } return retryWhen { cause , attempt -> attempt < retries && predicate ( cause ) } }","docstring":"/**\n * Retries collection of the given flow up to [retries] times when an exception that matches the\n * given [predicate] occurs in the upstream flow. This operator is *transparent* to exceptions that occur\n * in downstream flow and does not retry on exceptions that are thrown to cancel the flow.\n *\n * See [catch] for details on how exceptions are caught in flows.\n *\n * The default value of [retries] parameter is [Long.MAX_VALUE]. This value effectively means to retry forever.\n * This operator is a shorthand for the following code (see [retryWhen]). Note that `attempt` is checked first\n * and [predicate] is not called when it reaches the given number of [retries]:\n *\n * ```\n * retryWhen { cause, attempt -> attempt < retries && predicate(cause) }\n * ```\n *\n * The [predicate] parameter is always true by default. The [predicate] is a suspending function,\n * so it can be also used to introduce delay before retry, for example:\n *\n * ```\n * flow.retry(3) { e ->\n * // retry on any IOException but also introduce delay if retrying\n * (e is IOException).also { if (it) delay(1000) }\n * }\n * ```\n *\n * @throws IllegalArgumentException when [retries] is not positive.\n */"} {"signature":"public fun < T > Flow < T > . retryWhen ( predicate : suspend FlowCollector < T > . ( cause : Throwable , attempt : Long ) -> Boolean ) : Flow < T >","body":"= flow { var attempt = var shallRetry : Boolean do { shallRetry = false val cause = catchImpl ( this ) if ( cause != null ) { if ( predicate ( cause , attempt ) ) { shallRetry = true attempt ++ } else { throw cause } } } while ( shallRetry ) }","docstring":"/**\n * Retries collection of the given flow when an exception occurs in the upstream flow and the\n * [predicate] returns true. The predicate also receives an `attempt` number as parameter,\n * starting from zero on the initial call. This operator is *transparent* to exceptions that occur\n * in downstream flow and does not retry on exceptions that are thrown to cancel the flow.\n *\n * For example, the following call retries the flow forever if the error is caused by `IOException`, but\n * stops after 3 retries on any other exception:\n *\n * ```\n * flow.retryWhen { cause, attempt -> cause is IOException || attempt < 3 }\n * ```\n *\n * To implement a simple retry logic with a limit on the number of retries use [retry] operator.\n *\n * Similarly to [catch] operator, the [predicate] code has [FlowCollector] as a receiver and can\n * [emit][FlowCollector.emit] values downstream.\n * The [predicate] is a suspending function, so it can be used to introduce delay before retry, for example:\n *\n * ```\n * flow.retryWhen { cause, attempt ->\n * if (cause is IOException) { // retry on IOException\n * emit(RetryWrapperValue(e))\n * delay(1000) // delay for one second before retry\n * true\n * } else { // do not retry otherwise\n * false\n * }\n * }\n * ```\n *\n * See [catch] for more details.\n */"} {"signature":"@ kotlin . internal . InlineOnly public inline fun charset ( charsetName : String ) : Charset","body":"= Charset . forName ( charsetName )","docstring":"/**\n * Returns a named charset with the given [charsetName] name.\n *\n * @throws UnsupportedCharsetException If the specified named charset is not available.\n */"} {"signature":"@ Test fun testAwaitCancellation ( )","body":"= runTest { expect ( ) val mono = mono { delay ( Long . MAX_VALUE ) } . doOnSubscribe { expect ( ) } . doOnCancel { expect ( ) } val job = launch ( start = CoroutineStart . UNDISPATCHED ) { try { expect ( ) mono . awaitSingleOrNull ( ) } catch ( e : CancellationException ) { expect ( ) throw e } } expect ( ) job . cancelAndJoin ( ) finish ( ) }","docstring":"/** Tests that calls to [awaitSingleOrNull] (and, thus, to the rest of such functions) throw [CancellationException]\n * and unsubscribe from the publisher when their [Job] is cancelled. */"} {"signature":"@ Test fun testTimeout ( )","body":"{ val mono = mono { withTimeout ( ) { delay ( ) } } try { mono . doOnSubscribe { expect ( ) } . doOnNext { expectUnreached ( ) } . doOnSuccess { expectUnreached ( ) } . doOnError { expect ( ) } . doOnCancel { expectUnreached ( ) } . block ( ) } catch ( e : CancellationException ) { expect ( ) } finish ( ) }","docstring":"/** Test that cancelling a [mono] due to a timeout does throw an exception. */"} {"signature":"@ Test fun testDownstreamCancellationDoesNotThrow ( )","body":"= runTest { var i = Hooks . onOperatorError ( \"\" ) { t , a -> expectUnreached ( ) t } val mono = mono ( Dispatchers . Unconfined ) { expect ( * i + ) ; delay ( Long . MAX_VALUE ) } . doOnSubscribe { expect ( * i + ) } . doOnNext { expectUnreached ( ) } . doOnSuccess { expectUnreached ( ) } . doOnError { expectUnreached ( ) } . doOnCancel { expect ( * i + ) } val n = repeat ( n ) { i = it expect ( * i + ) mono . awaitCancelAndJoin ( ) expect ( * i + ) } finish ( * n + ) Hooks . resetOnOperatorError ( \"\" ) }","docstring":"/** Test that when the reason for cancellation of a [mono] is that the downstream doesn't want its results anymore,\n * this is considered normal behavior and exceptions are not propagated. */"} {"signature":"@ Test fun testRethrowingDownstreamCancellation ( )","body":"= runTest { var i = Hooks . onOperatorError ( \"\" ) { t , a -> expect ( i * + ) t } val mono = mono ( Dispatchers . Unconfined ) { expect ( i * + ) try { delay ( Long . MAX_VALUE ) } catch ( e : CancellationException ) { throw TestException ( ) } } . doOnSubscribe { expect ( i * + ) } . doOnNext { expectUnreached ( ) } . doOnSuccess { expectUnreached ( ) } . doOnError { expectUnreached ( ) } . doOnCancel { expect ( i * + ) } val n = repeat ( n ) { i = it expect ( i * + ) mono . awaitCancelAndJoin ( ) expect ( i * + ) } finish ( n * + ) Hooks . resetOnOperatorError ( \"\" ) }","docstring":"/** Test that, when [Mono] is cancelled by the downstream and throws during handling the cancellation, the resulting\n * error is propagated to [Hooks.onOperatorError]. */"} {"signature":"private suspend fun < T > Mono < T > . awaitCancelAndJoin ( )","body":"= coroutineScope { async ( start = CoroutineStart . UNDISPATCHED ) { awaitSingleOrNull ( ) } . cancelAndJoin ( ) }","docstring":"/** Run the given [Mono], cancel it, wait for the cancellation handler to finish, and return only then.\n *\n * Will not work in the general case, but here, when the publisher uses [Dispatchers.Unconfined], this seems to\n * ensure that the cancellation handler will have nowhere to execute but serially with the cancellation. */"} {"signature":"@ SinceKotlin ( \"\" ) internal expect fun convertDurationUnit ( value : Double , sourceUnit : DurationUnit , targetUnit : DurationUnit ) : Double","body":"@ SinceKotlin ( \"\" ) internal expect fun convertDurationUnit ( value : Double , sourceUnit : DurationUnit , targetUnit : DurationUnit ) : Double","docstring":"/** Converts the given time duration [value] expressed in the specified [sourceUnit] into the specified [targetUnit]. */"} {"signature":"@ Test fun testLookBehind ( )","body":"{ var regex : Regex var result : List < String > regex = \"\" . toRegex ( ) result = regex . allGroups ( \"\" ) assertEquals ( , result . count ( ) ) assertEquals ( \"\" , result [ ] ) assertEquals ( \"\" , result [ ] ) regex = \"\" . toRegex ( ) result = regex . allGroups ( \"\" ) assertEquals ( , result . count ( ) ) assertEquals ( \"\" , result [ ] ) assertEquals ( \"\" , result [ ] ) }","docstring":"/**\n * Tests regular expressions with lookbehind asserts.\n */"} {"signature":"@ Test fun testLookAheadBehind ( )","body":"{ var regex : Regex var result : List < String > regex = \"\" . toRegex ( ) result = regex . allGroups ( \"\" ) assertEquals ( , result . count ( ) ) assertEquals ( \"\" , result [ ] ) assertEquals ( \"\" , result [ ] ) regex = \"\" . toRegex ( ) result = regex . allGroups ( \"\" ) assertEquals ( , result . count ( ) ) assertEquals ( \"\" , result [ ] ) assertEquals ( \"\" , result [ ] ) regex = \"\" . toRegex ( ) result = regex . allGroups ( \"\" ) assertEquals ( , result . count ( ) ) assertEquals ( \"\" , result [ ] ) assertEquals ( \"\" , result [ ] ) regex = \"\" . toRegex ( ) result = regex . allGroups ( \"\" ) assertEquals ( , result . count ( ) ) assertEquals ( \"\" , result [ ] ) }","docstring":"/**\n * Tests regular expressions with lookahead asserts.\n */"} {"signature":"public actual fun reverse ( ) : StringBuilder","body":"{ var reversed = \"\" var index = string . length - while ( index >= ) { val low = string [ index -- ] if ( low . isLowSurrogate ( ) && index >= ) { val high = string [ index -- ] if ( high . isHighSurrogate ( ) ) { reversed = reversed + high + low } else { reversed = reversed + low + high } } else { reversed += low } } string = reversed return this }","docstring":"/**\n * Reverses the contents of this string builder and returns this instance.\n *\n * Surrogate pairs included in this string builder are treated as single characters.\n * Therefore, the order of the high-low surrogates is never reversed.\n *\n * Note that the reverse operation may produce new surrogate pairs that were unpaired low-surrogates and high-surrogates before the operation.\n * For example, reversing `\"\\uDC00\\uD800\"` produces `\"\\uD800\\uDC00\"` which is a valid surrogate pair.\n */"} {"signature":"public actual fun append ( value : Any ? ) : StringBuilder","body":"{ string += value . toString ( ) return this }","docstring":"/**\n * Appends the string representation of the specified object [value] to this string builder and returns this instance.\n *\n * The overall effect is exactly as if the [value] were converted to a string by the `value.toString()` method,\n * and then that string was appended to this string builder.\n */"} {"signature":"@ SinceKotlin ( \"\" ) public actual fun append ( value : Boolean ) : StringBuilder","body":"{ string += value return this }","docstring":"/**\n * Appends the string representation of the specified boolean [value] to this string builder and returns this instance.\n *\n * The overall effect is exactly as if the [value] were converted to a string by the `value.toString()` method,\n * and then that string was appended to this string builder.\n */"} {"signature":"@ SinceKotlin ( \"\" ) public fun append ( value : Byte ) : StringBuilder","body":"= append ( value . toString ( ) )","docstring":"/**\n * Appends the string representation of the specified byte [value] to this string builder and returns this instance.\n *\n * The overall effect is exactly as if the [value] were converted to a string by the `value.toString()` method,\n * and then that string was appended to this string builder.\n */"} {"signature":"@ SinceKotlin ( \"\" ) public fun append ( value : Short ) : StringBuilder","body":"= append ( value . toString ( ) )","docstring":"/**\n * Appends the string representation of the specified short [value] to this string builder and returns this instance.\n *\n * The overall effect is exactly as if the [value] were converted to a string by the `value.toString()` method,\n * and then that string was appended to this string builder.\n */"} {"signature":"@ SinceKotlin ( \"\" ) public actual fun append ( value : Int ) : StringBuilder","body":"= append ( value . toString ( ) )","docstring":"/**\n * Appends the string representation of the specified int [value] to this string builder and returns this instance.\n *\n * The overall effect is exactly as if the [value] were converted to a string by the `value.toString()` method,\n * and then that string was appended to this string builder.\n */"} {"signature":"@ SinceKotlin ( \"\" ) public actual fun append ( value : Long ) : StringBuilder","body":"= append ( value . toString ( ) )","docstring":"/**\n * Appends the string representation of the specified long [value] to this string builder and returns this instance.\n *\n * The overall effect is exactly as if the [value] were converted to a string by the `value.toString()` method,\n * and then that string was appended to this string builder.\n */"} {"signature":"@ SinceKotlin ( \"\" ) public actual fun append ( value : Float ) : StringBuilder","body":"= append ( value . toString ( ) )","docstring":"/**\n * Appends the string representation of the specified float [value] to this string builder and returns this instance.\n *\n * The overall effect is exactly as if the [value] were converted to a string by the `value.toString()` method,\n * and then that string was appended to this string builder.\n */"} {"signature":"@ SinceKotlin ( \"\" ) public actual fun append ( value : Double ) : StringBuilder","body":"= append ( value . toString ( ) )","docstring":"/**\n * Appends the string representation of the specified double [value] to this string builder and returns this instance.\n *\n * The overall effect is exactly as if the [value] were converted to a string by the `value.toString()` method,\n * and then that string was appended to this string builder.\n */"} {"signature":"@ SinceKotlin ( \"\" ) public actual fun append ( value : CharArray ) : StringBuilder","body":"{ string += value . concatToString ( ) return this }","docstring":"/**\n * Appends characters in the specified character array [value] to this string builder and returns this instance.\n *\n * Characters are appended in order, starting at the index 0.\n */"} {"signature":"@ SinceKotlin ( \"\" ) public actual fun append ( value : String ? ) : StringBuilder","body":"{ this . string += value ? : \"\" return this }","docstring":"/**\n * Appends the specified string [value] to this string builder and returns this instance.\n *\n * If [value] is `null`, then the four characters `\"null\"` are appended.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ Deprecated ( \"\" , level = DeprecationLevel . WARNING ) public actual fun capacity ( ) : Int","body":"= length","docstring":"/**\n * Returns the current capacity of this string builder.\n *\n * The capacity is the maximum length this string builder can have before an allocation occurs.\n *\n * In Kotlin/JS implementation of StringBuilder the value returned from this method may not indicate the actual size of the backing storage.\n */"} {"signature":"@ SinceKotlin ( \"\" ) public actual fun ensureCapacity ( minimumCapacity : Int )","body":"{ }","docstring":"/**\n * Ensures that the capacity of this string builder is at least equal to the specified [minimumCapacity].\n *\n * If the current capacity is less than the [minimumCapacity], a new backing storage is allocated with greater capacity.\n * Otherwise, this method takes no action and simply returns.\n *\n * In Kotlin/JS implementation of StringBuilder the size of the backing storage is not extended to comply the given [minimumCapacity],\n * thus calling this method has no effect on the further performance of operations.\n */"} {"signature":"@ SinceKotlin ( \"\" ) public actual fun indexOf ( string : String ) : Int","body":"= this . string . asDynamic ( ) . indexOf ( string )","docstring":"/**\n * Returns the index within this string builder of the first occurrence of the specified [string].\n *\n * Returns `-1` if the specified [string] does not occur in this string builder.\n */"} {"signature":"@ SinceKotlin ( \"\" ) public actual fun indexOf ( string : String , startIndex : Int ) : Int","body":"= this . string . asDynamic ( ) . indexOf ( string , startIndex )","docstring":"/**\n * Returns the index within this string builder of the first occurrence of the specified [string],\n * starting at the specified [startIndex].\n *\n * Returns `-1` if the specified [string] does not occur in this string builder starting at the specified [startIndex].\n */"} {"signature":"@ SinceKotlin ( \"\" ) public actual fun lastIndexOf ( string : String ) : Int","body":"= this . string . asDynamic ( ) . lastIndexOf ( string )","docstring":"/**\n * Returns the index within this string builder of the last occurrence of the specified [string].\n * The last occurrence of empty string `\"\"` is considered to be at the index equal to `this.length`.\n *\n * Returns `-1` if the specified [string] does not occur in this string builder.\n */"} {"signature":"@ SinceKotlin ( \"\" ) public actual fun lastIndexOf ( string : String , startIndex : Int ) : Int","body":"{ if ( string . isEmpty ( ) && startIndex < ) return - return this . string . asDynamic ( ) . lastIndexOf ( string , startIndex ) }","docstring":"/**\n * Returns the index within this string builder of the last occurrence of the specified [string],\n * starting from the specified [startIndex] toward the beginning.\n *\n * Returns `-1` if the specified [string] does not occur in this string builder starting at the specified [startIndex].\n */"} {"signature":"@ SinceKotlin ( \"\" ) public actual fun insert ( index : Int , value : Boolean ) : StringBuilder","body":"{ AbstractList . checkPositionIndex ( index , length ) string = string . substring ( , index ) + value + string . substring ( index ) return this }","docstring":"/**\n * Inserts the string representation of the specified boolean [value] into this string builder at the specified [index] and returns this instance.\n *\n * The overall effect is exactly as if the [value] were converted to a string by the `value.toString()` method,\n * and then that string was inserted into this string builder at the specified [index].\n *\n * @throws IndexOutOfBoundsException if [index] is less than zero or greater than the length of this string builder.\n */"} {"signature":"@ SinceKotlin ( \"\" ) public fun insert ( index : Int , value : Byte ) : StringBuilder","body":"= insert ( index , value . toString ( ) )","docstring":"/**\n * Inserts the string representation of the specified byte [value] into this string builder at the specified [index] and returns this instance.\n *\n * The overall effect is exactly as if the [value] were converted to a string by the `value.toString()` method,\n * and then that string was inserted into this string builder at the specified [index].\n *\n * @throws IndexOutOfBoundsException if [index] is less than zero or greater than the length of this string builder.\n */"} {"signature":"@ SinceKotlin ( \"\" ) public fun insert ( index : Int , value : Short ) : StringBuilder","body":"= insert ( index , value . toString ( ) )","docstring":"/**\n * Inserts the string representation of the specified short [value] into this string builder at the specified [index] and returns this instance.\n *\n * The overall effect is exactly as if the [value] were converted to a string by the `value.toString()` method,\n * and then that string was inserted into this string builder at the specified [index].\n *\n * @throws IndexOutOfBoundsException if [index] is less than zero or greater than the length of this string builder.\n */"} {"signature":"@ SinceKotlin ( \"\" ) public actual fun insert ( index : Int , value : Int ) : StringBuilder","body":"= insert ( index , value . toString ( ) )","docstring":"/**\n * Inserts the string representation of the specified int [value] into this string builder at the specified [index] and returns this instance.\n *\n * The overall effect is exactly as if the [value] were converted to a string by the `value.toString()` method,\n * and then that string was inserted into this string builder at the specified [index].\n *\n * @throws IndexOutOfBoundsException if [index] is less than zero or greater than the length of this string builder.\n */"} {"signature":"@ SinceKotlin ( \"\" ) public actual fun insert ( index : Int , value : Long ) : StringBuilder","body":"= insert ( index , value . toString ( ) )","docstring":"/**\n * Inserts the string representation of the specified long [value] into this string builder at the specified [index] and returns this instance.\n *\n * The overall effect is exactly as if the [value] were converted to a string by the `value.toString()` method,\n * and then that string was inserted into this string builder at the specified [index].\n *\n * @throws IndexOutOfBoundsException if [index] is less than zero or greater than the length of this string builder.\n */"} {"signature":"@ SinceKotlin ( \"\" ) public actual fun insert ( index : Int , value : Float ) : StringBuilder","body":"= insert ( index , value . toString ( ) )","docstring":"/**\n * Inserts the string representation of the specified float [value] into this string builder at the specified [index] and returns this instance.\n *\n * The overall effect is exactly as if the [value] were converted to a string by the `value.toString()` method,\n * and then that string was inserted into this string builder at the specified [index].\n *\n * @throws IndexOutOfBoundsException if [index] is less than zero or greater than the length of this string builder.\n */"} {"signature":"@ SinceKotlin ( \"\" ) public actual fun insert ( index : Int , value : Double ) : StringBuilder","body":"= insert ( index , value . toString ( ) )","docstring":"/**\n * Inserts the string representation of the specified double [value] into this string builder at the specified [index] and returns this instance.\n *\n * The overall effect is exactly as if the [value] were converted to a string by the `value.toString()` method,\n * and then that string was inserted into this string builder at the specified [index].\n *\n * @throws IndexOutOfBoundsException if [index] is less than zero or greater than the length of this string builder.\n */"} {"signature":"@ SinceKotlin ( \"\" ) public actual fun insert ( index : Int , value : Char ) : StringBuilder","body":"{ AbstractList . checkPositionIndex ( index , length ) string = string . substring ( , index ) + value + string . substring ( index ) return this }","docstring":"/**\n * Inserts the specified character [value] into this string builder at the specified [index] and returns this instance.\n *\n * @throws IndexOutOfBoundsException if [index] is less than zero or greater than the length of this string builder.\n */"} {"signature":"@ SinceKotlin ( \"\" ) public actual fun insert ( index : Int , value : CharArray ) : StringBuilder","body":"{ AbstractList . checkPositionIndex ( index , length ) string = string . substring ( , index ) + value . concatToString ( ) + string . substring ( index ) return this }","docstring":"/**\n * Inserts characters in the specified character array [value] into this string builder at the specified [index] and returns this instance.\n *\n * The inserted characters go in same order as in the [value] character array, starting at [index].\n *\n * @throws IndexOutOfBoundsException if [index] is less than zero or greater than the length of this string builder.\n */"} {"signature":"@ SinceKotlin ( \"\" ) public actual fun insert ( index : Int , value : CharSequence ? ) : StringBuilder","body":"{ AbstractList . checkPositionIndex ( index , length ) string = string . substring ( , index ) + value . toString ( ) + string . substring ( index ) return this }","docstring":"/**\n * Inserts characters in the specified character sequence [value] into this string builder at the specified [index] and returns this instance.\n *\n * The inserted characters go in the same order as in the [value] character sequence, starting at [index].\n *\n * @param index the position in this string builder to insert at.\n * @param value the character sequence from which characters are inserted. If [value] is `null`, then the four characters `\"null\"` are inserted.\n *\n * @throws IndexOutOfBoundsException if [index] is less than zero or greater than the length of this string builder.\n */"} {"signature":"@ SinceKotlin ( \"\" ) public actual fun insert ( index : Int , value : Any ? ) : StringBuilder","body":"{ AbstractList . checkPositionIndex ( index , length ) string = string . substring ( , index ) + value . toString ( ) + string . substring ( index ) return this }","docstring":"/**\n * Inserts the string representation of the specified object [value] into this string builder at the specified [index] and returns this instance.\n *\n * The overall effect is exactly as if the [value] were converted to a string by the `value.toString()` method,\n * and then that string was inserted into this string builder at the specified [index].\n *\n * @throws IndexOutOfBoundsException if [index] is less than zero or greater than the length of this string builder.\n */"} {"signature":"@ SinceKotlin ( \"\" ) public actual fun insert ( index : Int , value : String ? ) : StringBuilder","body":"{ AbstractList . checkPositionIndex ( index , length ) val toInsert = value ? : \"\" this . string = this . string . substring ( , index ) + toInsert + this . string . substring ( index ) return this }","docstring":"/**\n * Inserts the string [value] into this string builder at the specified [index] and returns this instance.\n *\n * If [value] is `null`, then the four characters `\"null\"` are inserted.\n *\n * @throws IndexOutOfBoundsException if [index] is less than zero or greater than the length of this string builder.\n */"} {"signature":"@ SinceKotlin ( \"\" ) public actual fun setLength ( newLength : Int )","body":"{ if ( newLength < ) { throw IllegalArgumentException ( \"\" ) } if ( newLength <= length ) { string = string . substring ( , newLength ) } else { for ( i in length until newLength ) { string += '' } } }","docstring":"/**\n * Sets the length of this string builder to the specified [newLength].\n *\n * If the [newLength] is less than the current length, it is changed to the specified [newLength].\n * Otherwise, null characters '\\u0000' are appended to this string builder until its length is less than the [newLength].\n *\n * Note that in Kotlin/JS [set] operator function has non-constant execution time complexity.\n * Therefore, increasing length of this string builder and then updating each character by index may slow down your program.\n *\n * @throws IndexOutOfBoundsException or [IllegalArgumentException] if [newLength] is less than zero.\n */"} {"signature":"@ SinceKotlin ( \"\" ) public actual fun substring ( startIndex : Int ) : String","body":"{ AbstractList . checkPositionIndex ( startIndex , length ) return string . substring ( startIndex ) }","docstring":"/**\n * Returns a new [String] that contains characters in this string builder at [startIndex] (inclusive) and up to the [length] (exclusive).\n *\n * @throws IndexOutOfBoundsException if [startIndex] is less than zero or greater than the length of this string builder.\n */"} {"signature":"@ SinceKotlin ( \"\" ) public actual fun substring ( startIndex : Int , endIndex : Int ) : String","body":"{ AbstractList . checkBoundsIndexes ( startIndex , endIndex , length ) return string . substring ( startIndex , endIndex ) }","docstring":"/**\n * Returns a new [String] that contains characters in this string builder at [startIndex] (inclusive) and up to the [endIndex] (exclusive).\n *\n * @throws IndexOutOfBoundsException or [IllegalArgumentException] when [startIndex] or [endIndex] is out of range of this string builder indices or when `startIndex > endIndex`.\n */"} {"signature":"@ SinceKotlin ( \"\" ) public actual fun trimToSize ( )","body":"{ }","docstring":"/**\n * Attempts to reduce storage used for this string builder.\n *\n * If the backing storage of this string builder is larger than necessary to hold its current contents,\n * then it may be resized to become more space efficient.\n * Calling this method may, but is not required to, affect the value of the [capacity] property.\n *\n * In Kotlin/JS implementation of StringBuilder the size of the backing storage is always equal to the length of the string builder.\n */"} {"signature":"@ SinceKotlin ( \"\" ) public fun clear ( ) : StringBuilder","body":"{ string = \"\" return this }","docstring":"/**\n * Clears the content of this string builder making it empty and returns this instance.\n *\n * @sample samples.text.Strings.clearStringBuilder\n */"} {"signature":"@ SinceKotlin ( \"\" ) public operator fun set ( index : Int , value : Char )","body":"{ AbstractList . checkElementIndex ( index , length ) string = string . substring ( , index ) + value + string . substring ( index + ) }","docstring":"/**\n * Sets the character at the specified [index] to the specified [value].\n *\n * @throws IndexOutOfBoundsException if [index] is out of bounds of this string builder.\n */"} {"signature":"@ SinceKotlin ( \"\" ) public fun setRange ( startIndex : Int , endIndex : Int , value : String ) : StringBuilder","body":"{ checkReplaceRange ( startIndex , endIndex , length ) this . string = this . string . substring ( , startIndex ) + value + this . string . substring ( endIndex ) return this }","docstring":"/**\n * Replaces characters in the specified range of this string builder with characters in the specified string [value] and returns this instance.\n *\n * @param startIndex the beginning (inclusive) of the range to replace.\n * @param endIndex the end (exclusive) of the range to replace.\n * @param value the string to replace with.\n *\n * @throws IndexOutOfBoundsException or [IllegalArgumentException] if [startIndex] is less than zero, greater than the length of this string builder, or `startIndex > endIndex`.\n */"} {"signature":"@ SinceKotlin ( \"\" ) public fun deleteAt ( index : Int ) : StringBuilder","body":"{ AbstractList . checkElementIndex ( index , length ) string = string . substring ( , index ) + string . substring ( index + ) return this }","docstring":"/**\n * Removes the character at the specified [index] from this string builder and returns this instance.\n *\n * If the `Char` at the specified [index] is part of a supplementary code point, this method does not remove the entire supplementary character.\n *\n * @param index the index of `Char` to remove.\n *\n * @throws IndexOutOfBoundsException if [index] is out of bounds of this string builder.\n */"} {"signature":"@ SinceKotlin ( \"\" ) public fun deleteRange ( startIndex : Int , endIndex : Int ) : StringBuilder","body":"{ checkReplaceRange ( startIndex , endIndex , length ) string = string . substring ( , startIndex ) + string . substring ( endIndex ) return this }","docstring":"/**\n * Removes characters in the specified range from this string builder and returns this instance.\n *\n * @param startIndex the beginning (inclusive) of the range to remove.\n * @param endIndex the end (exclusive) of the range to remove.\n *\n * @throws IndexOutOfBoundsException or [IllegalArgumentException] when [startIndex] is out of range of this string builder indices or when `startIndex > endIndex`.\n */"} {"signature":"@ SinceKotlin ( \"\" ) public fun toCharArray ( destination : CharArray , destinationOffset : Int = , startIndex : Int = , endIndex : Int = this . length )","body":"{ AbstractList . checkBoundsIndexes ( startIndex , endIndex , length ) AbstractList . checkBoundsIndexes ( destinationOffset , destinationOffset + endIndex - startIndex , destination . size ) var dstIndex = destinationOffset for ( index in startIndex until endIndex ) { destination [ dstIndex ++ ] = string [ index ] } }","docstring":"/**\n * Copies characters from this string builder into the [destination] character array.\n *\n * @param destination the array to copy to.\n * @param destinationOffset the position in the array to copy to, 0 by default.\n * @param startIndex the beginning (inclusive) of the range to copy, 0 by default.\n * @param endIndex the end (exclusive) of the range to copy, length of this string builder by default.\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 fun appendRange ( value : CharArray , startIndex : Int , endIndex : Int ) : StringBuilder","body":"{ string += value . concatToString ( startIndex , endIndex ) return this }","docstring":"/**\n * Appends characters in a subarray of the specified character array [value] to this string builder and returns this instance.\n *\n * Characters are appended in order, starting at specified [startIndex].\n *\n * @param value the array from which characters are appended.\n * @param startIndex the beginning (inclusive) of the subarray to append.\n * @param endIndex the end (exclusive) of the subarray to append.\n *\n * @throws IndexOutOfBoundsException or [IllegalArgumentException] when [startIndex] or [endIndex] is out of range of the [value] array indices or when `startIndex > endIndex`.\n */"} {"signature":"@ SinceKotlin ( \"\" ) public fun appendRange ( value : CharSequence , startIndex : Int , endIndex : Int ) : StringBuilder","body":"{ val stringCsq = value . toString ( ) AbstractList . checkBoundsIndexes ( startIndex , endIndex , stringCsq . length ) string += stringCsq . substring ( startIndex , endIndex ) return this }","docstring":"/**\n * Appends a subsequence of the specified character sequence [value] to this string builder and returns this instance.\n *\n * @param value the character sequence from which a subsequence is appended.\n * @param startIndex the beginning (inclusive) of the subsequence to append.\n * @param endIndex the end (exclusive) of the subsequence to append.\n *\n * @throws IndexOutOfBoundsException or [IllegalArgumentException] when [startIndex] or [endIndex] is out of range of the [value] character sequence indices or when `startIndex > endIndex`.\n */"} {"signature":"@ SinceKotlin ( \"\" ) public fun insertRange ( index : Int , value : CharArray , startIndex : Int , endIndex : Int ) : StringBuilder","body":"{ AbstractList . checkPositionIndex ( index , this . length ) string = string . substring ( , index ) + value . concatToString ( startIndex , endIndex ) + string . substring ( index ) return this }","docstring":"/**\n * Inserts characters in a subarray of the specified character array [value] into this string builder at the specified [index] and returns this instance.\n *\n * The inserted characters go in same order as in the [value] array, starting at [index].\n *\n * @param index the position in this string builder to insert at.\n * @param value the array from which characters are inserted.\n * @param startIndex the beginning (inclusive) of the subarray to insert.\n * @param endIndex the end (exclusive) of the subarray to insert.\n *\n * @throws IndexOutOfBoundsException or [IllegalArgumentException] when [startIndex] or [endIndex] is out of range of the [value] array indices or when `startIndex > endIndex`.\n * @throws IndexOutOfBoundsException if [index] is less than zero or greater than the length of this string builder.\n */"} {"signature":"@ SinceKotlin ( \"\" ) public fun insertRange ( index : Int , value : CharSequence , startIndex : Int , endIndex : Int ) : StringBuilder","body":"{ AbstractList . checkPositionIndex ( index , length ) val stringCsq = value . toString ( ) AbstractList . checkBoundsIndexes ( startIndex , endIndex , stringCsq . length ) string = string . substring ( , index ) + stringCsq . substring ( startIndex , endIndex ) + string . substring ( index ) return this }","docstring":"/**\n * Inserts characters in a subsequence of the specified character sequence [value] into this string builder at the specified [index] and returns this instance.\n *\n * The inserted characters go in the same order as in the [value] character sequence, starting at [index].\n *\n * @param index the position in this string builder to insert at.\n * @param value the character sequence from which a subsequence is inserted.\n * @param startIndex the beginning (inclusive) of the subsequence to insert.\n * @param endIndex the end (exclusive) of the subsequence to insert.\n *\n * @throws IndexOutOfBoundsException or [IllegalArgumentException] when [startIndex] or [endIndex] is out of range of the [value] character sequence indices or when `startIndex > endIndex`.\n * @throws IndexOutOfBoundsException if [index] is less than zero or greater than the length of this string builder.\n */"} {"signature":"@ Suppress ( \"\" , \"\" ) @ SinceKotlin ( \"\" ) public actual inline fun StringBuilder . append ( value : Byte ) : StringBuilder","body":"= this . append ( value )","docstring":"/**\n * Appends the string representation of the specified byte [value] to this string builder and returns this instance.\n *\n * The overall effect is exactly as if the [value] were converted to a string by the `value.toString()` method,\n * and then that string was appended to this string builder.\n */"} {"signature":"@ Suppress ( \"\" , \"\" ) @ SinceKotlin ( \"\" ) public actual inline fun StringBuilder . append ( value : Short ) : StringBuilder","body":"= this . append ( value )","docstring":"/**\n * Appends the string representation of the specified short [value] to this string builder and returns this instance.\n *\n * The overall effect is exactly as if the [value] were converted to a string by the `value.toString()` method,\n * and then that string was appended to this string builder.\n */"} {"signature":"@ Suppress ( \"\" , \"\" ) @ SinceKotlin ( \"\" ) public actual inline fun StringBuilder . insert ( index : Int , value : Byte ) : StringBuilder","body":"= this . insert ( index , value )","docstring":"/**\n * Inserts the string representation of the specified byte [value] into this string builder at the specified [index] and returns this instance.\n *\n * The overall effect is exactly as if the [value] were converted to a string by the `value.toString()` method,\n * and then that string was inserted into this string builder at the specified [index].\n *\n * @throws IndexOutOfBoundsException if [index] is less than zero or greater than the length of this string builder.\n */"} {"signature":"@ Suppress ( \"\" , \"\" ) @ SinceKotlin ( \"\" ) public actual inline fun StringBuilder . insert ( index : Int , value : Short ) : StringBuilder","body":"= this . insert ( index , value )","docstring":"/**\n * Inserts the string representation of the specified short [value] into this string builder at the specified [index] and returns this instance.\n *\n * The overall effect is exactly as if the [value] were converted to a string by the `value.toString()` method,\n * and then that string was inserted into this string builder at the specified [index].\n *\n * @throws IndexOutOfBoundsException if [index] is less than zero or greater than the length of this string builder.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ Suppress ( \"\" , \"\" ) public actual inline fun StringBuilder . clear ( ) : StringBuilder","body":"= this . clear ( )","docstring":"/**\n * Clears the content of this string builder making it empty and returns this instance.\n *\n * @sample samples.text.Strings.clearStringBuilder\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ Suppress ( \"\" , \"\" ) public actual inline operator fun StringBuilder . set ( index : Int , value : Char ) : Unit","body":"= this . set ( index , value )","docstring":"/**\n * Sets the character at the specified [index] to the specified [value].\n *\n * @throws IndexOutOfBoundsException if [index] is out of bounds of this string builder.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ Suppress ( \"\" , \"\" ) public actual inline fun StringBuilder . setRange ( startIndex : Int , endIndex : Int , value : String ) : StringBuilder","body":"= this . setRange ( startIndex , endIndex , value )","docstring":"/**\n * Replaces characters in the specified range of this string builder with characters in the specified string [value] and returns this instance.\n *\n * @param startIndex the beginning (inclusive) of the range to replace.\n * @param endIndex the end (exclusive) of the range to replace.\n * @param value the string to replace with.\n *\n * @throws IndexOutOfBoundsException or [IllegalArgumentException] if [startIndex] is less than zero, greater than the length of this string builder, or `startIndex > endIndex`.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ Suppress ( \"\" , \"\" ) public actual inline fun StringBuilder . deleteAt ( index : Int ) : StringBuilder","body":"= this . deleteAt ( index )","docstring":"/**\n * Removes the character at the specified [index] from this string builder and returns this instance.\n *\n * If the `Char` at the specified [index] is part of a supplementary code point, this method does not remove the entire supplementary character.\n *\n * @param index the index of `Char` to remove.\n *\n * @throws IndexOutOfBoundsException if [index] is out of bounds of this string builder.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ Suppress ( \"\" , \"\" ) public actual inline fun StringBuilder . deleteRange ( startIndex : Int , endIndex : Int ) : StringBuilder","body":"= this . deleteRange ( startIndex , endIndex )","docstring":"/**\n * Removes characters in the specified range from this string builder and returns this instance.\n *\n * @param startIndex the beginning (inclusive) of the range to remove.\n * @param endIndex the end (exclusive) of the range to remove.\n *\n * @throws IndexOutOfBoundsException or [IllegalArgumentException] when [startIndex] is out of range of this string builder indices or when `startIndex > endIndex`.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ Suppress ( \"\" , \"\" , \"\" ) public actual inline fun StringBuilder . toCharArray ( destination : CharArray , destinationOffset : Int = , startIndex : Int = , endIndex : Int = this . length ) : Unit","body":"= this . toCharArray ( destination , destinationOffset , startIndex , endIndex )","docstring":"/**\n * Copies characters from this string builder into the [destination] character array.\n *\n * @param destination the array to copy to.\n * @param destinationOffset the position in the array to copy to, 0 by default.\n * @param startIndex the beginning (inclusive) of the range to copy, 0 by default.\n * @param endIndex the end (exclusive) of the range to copy, length of this string builder by default.\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 ( \"\" ) @ Suppress ( \"\" , \"\" ) public actual inline fun StringBuilder . appendRange ( value : CharArray , startIndex : Int , endIndex : Int ) : StringBuilder","body":"= this . appendRange ( value , startIndex , endIndex )","docstring":"/**\n * Appends characters in a subarray of the specified character array [value] to this string builder and returns this instance.\n *\n * Characters are appended in order, starting at specified [startIndex].\n *\n * @param value the array from which characters are appended.\n * @param startIndex the beginning (inclusive) of the subarray to append.\n * @param endIndex the end (exclusive) of the subarray to append.\n *\n * @throws IndexOutOfBoundsException or [IllegalArgumentException] when [startIndex] or [endIndex] is out of range of the [value] array indices or when `startIndex > endIndex`.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ Suppress ( \"\" , \"\" ) public actual inline fun StringBuilder . appendRange ( value : CharSequence , startIndex : Int , endIndex : Int ) : StringBuilder","body":"= this . appendRange ( value , startIndex , endIndex )","docstring":"/**\n * Appends a subsequence of the specified character sequence [value] to this string builder and returns this instance.\n *\n * @param value the character sequence from which a subsequence is appended.\n * @param startIndex the beginning (inclusive) of the subsequence to append.\n * @param endIndex the end (exclusive) of the subsequence to append.\n *\n * @throws IndexOutOfBoundsException or [IllegalArgumentException] when [startIndex] or [endIndex] is out of range of the [value] character sequence indices or when `startIndex > endIndex`.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ Suppress ( \"\" , \"\" ) public actual inline fun StringBuilder . insertRange ( index : Int , value : CharArray , startIndex : Int , endIndex : Int ) : StringBuilder","body":"= this . insertRange ( index , value , startIndex , endIndex )","docstring":"/**\n * Inserts characters in a subarray of the specified character array [value] into this string builder at the specified [index] and returns this instance.\n *\n * The inserted characters go in same order as in the [value] array, starting at [index].\n *\n * @param index the position in this string builder to insert at.\n * @param value the array from which characters are inserted.\n * @param startIndex the beginning (inclusive) of the subarray to insert.\n * @param endIndex the end (exclusive) of the subarray to insert.\n *\n * @throws IndexOutOfBoundsException or [IllegalArgumentException] when [startIndex] or [endIndex] is out of range of the [value] array indices or when `startIndex > endIndex`.\n * @throws IndexOutOfBoundsException if [index] is less than zero or greater than the length of this string builder.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ Suppress ( \"\" , \"\" ) public actual inline fun StringBuilder . insertRange ( index : Int , value : CharSequence , startIndex : Int , endIndex : Int ) : StringBuilder","body":"= this . insertRange ( index , value , startIndex , endIndex )","docstring":"/**\n * Inserts characters in a subsequence of the specified character sequence [value] into this string builder at the specified [index] and returns this instance.\n *\n * The inserted characters go in the same order as in the [value] character sequence, starting at [index].\n *\n * @param index the position in this string builder to insert at.\n * @param value the character sequence from which a subsequence is inserted.\n * @param startIndex the beginning (inclusive) of the subsequence to insert.\n * @param endIndex the end (exclusive) of the subsequence to insert.\n *\n * @throws IndexOutOfBoundsException or [IllegalArgumentException] when [startIndex] or [endIndex] is out of range of the [value] character sequence indices or when `startIndex > endIndex`.\n * @throws IndexOutOfBoundsException if [index] is less than zero or greater than the length of this string builder.\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 : Short ) : StringBuilder","body":"= append ( value . toInt ( ) ) . 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 : Byte ) : StringBuilder","body":"= append ( value . toInt ( ) ) . 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":"public actual operator fun contains ( char : Char ) : Boolean","body":"= char . getCategoryValue ( ) == this . value","docstring":"/**\n * Returns `true` if [char] character belongs to this category.\n */"} {"signature":"inline fun ConeKotlinType . forEachType ( prepareType : ( ConeKotlinType ) -> ConeKotlinType = { it } , action : ( ConeKotlinType ) -> Unit , )","body":"{ val stack = mutableListOf ( this ) while ( stack . isNotEmpty ( ) ) { val next = stack . popLast ( ) . let ( prepareType ) action ( next ) when ( next ) { is ConeFlexibleType -> { stack . add ( next . lowerBound ) stack . add ( next . upperBound ) } is ConeDefinitelyNotNullType -> stack . add ( next . original ) is ConeIntersectionType -> stack . addAll ( next . intersectedTypes ) else -> next . typeArguments . forEach { if ( it is ConeKotlinTypeProjection ) stack . add ( it . type ) } } } }","docstring":"/**\n * Recursively visits each [ConeKotlinType] inside (including itself) and performs the given action.\n * Doesn't give guarantees on the traversal order.\n */"} {"signature":"private fun rebindDelegate ( newTarget : FirProperty , oldTarget : FirProperty )","body":"{ val delegate = newTarget . delegate ? : return requireWithAttachment ( delegate is FirWrappedDelegateExpression , { \"\" } , ) { withFirEntry ( \"\" , newTarget ) withFirEntry ( \"\" , oldTarget ) withFirEntry ( \"\" , delegate ) } val delegateProvider = delegate . provideDelegateCall rebindArgumentList ( delegateProvider . argumentList , newTarget = newTarget . symbol , oldTarget = oldTarget . symbol , isSetter = false , canHavePropertySymbolAsThisReference = false , ) }","docstring":"/**\n * This function is required to correctly rebind symbols\n * after [generateAccessorsByDelegate][org.jetbrains.kotlin.fir.builder.generateAccessorsByDelegate]\n * for correct work\n *\n * @see org.jetbrains.kotlin.fir.builder.generateAccessorsByDelegate\n */"} {"signature":"private fun rebindDelegatedAccessorBody ( newTarget : FirPropertyAccessor , oldTarget : FirPropertyAccessor )","body":"{ if ( newTarget . source ? . kind != KtFakeSourceElementKind . DelegatedPropertyAccessor ) return val body = newTarget . body requireWithAttachment ( body is FirSingleExpressionBlock , { \"\" } , ) { withFirSymbolEntry ( \"\" , newTarget . propertySymbol ) withFirSymbolEntry ( \"\" , oldTarget . propertySymbol ) body ? . let { withFirEntry ( \"\" , it ) } ? : withEntry ( \"\" , \"\" ) } val returnExpression = body . statement rebindReturnExpression ( returnExpression = returnExpression , newTarget = newTarget , oldTarget = oldTarget ) }","docstring":"/**\n * This function is required to correctly rebind symbols\n * after [generateAccessorsByDelegate][org.jetbrains.kotlin.fir.builder.generateAccessorsByDelegate]\n * for correct work\n *\n * @see org.jetbrains.kotlin.fir.builder.generateAccessorsByDelegate\n * @see rebindDelegate\n */"} {"signature":"private fun rebindThisRef ( expression : FirExpression , newTarget : FirPropertySymbol , oldTarget : FirPropertySymbol , canHavePropertySymbolAsThisReference : Boolean , )","body":"{ if ( expression is FirLiteralExpression < * > ) return requireWithAttachment ( expression is FirThisReceiverExpression , { \"\" } , ) { withFirSymbolEntry ( \"\" , newTarget ) withFirSymbolEntry ( \"\" , oldTarget ) withFirEntry ( \"\" , expression ) } val boundSymbol = expression . calleeReference . boundSymbol if ( boundSymbol is FirClassSymbol < * > ) return requireWithAttachment ( canHavePropertySymbolAsThisReference , { \"\" } , ) { withFirSymbolEntry ( \"\" , newTarget ) withFirSymbolEntry ( \"\" , oldTarget ) boundSymbol ? . let { withFirSymbolEntry ( \"\" , boundSymbol ) } } requireWithAttachment ( boundSymbol == oldTarget , { \"\" } ) { withFirSymbolEntry ( \"\" , newTarget ) withFirSymbolEntry ( \"\" , oldTarget ) boundSymbol ? . let { withFirSymbolEntry ( \"\" , boundSymbol ) } } expression . replaceCalleeReference ( buildImplicitThisReference { this . boundSymbol = newTarget } ) }","docstring":"/**\n * To cover `thisRef` function\n *\n * @see org.jetbrains.kotlin.fir.builder.generateAccessorsByDelegate\n */"} {"signature":"private fun rebindSetterParameter ( expression : FirExpression , newPropertySymbol : FirPropertySymbol , oldPropertySymbol : FirPropertySymbol )","body":"{ requireWithAttachment ( expression is FirPropertyAccessExpression , { \"\" } ) { withFirSymbolEntry ( \"\" , newPropertySymbol ) withFirSymbolEntry ( \"\" , oldPropertySymbol ) withFirEntry ( \"\" , expression ) } val calleeReference = expression . resolvedCalleeReference ( newPropertySymbol = newPropertySymbol , oldPropertySymbol = oldPropertySymbol ) val resolvedParameterSymbol = calleeReference . resolvedSymbol val oldValueParameterSymbol = oldPropertySymbol . setterSymbol ? . valueParameterSymbols ? . first ( ) requireWithAttachment ( resolvedParameterSymbol == oldValueParameterSymbol , { \"\" } , ) { withFirEntry ( \"\" , expression ) withFirSymbolEntry ( \"\" , resolvedParameterSymbol ) oldValueParameterSymbol ? . let { withFirSymbolEntry ( \"\" , it ) } withFirSymbolEntry ( \"\" , oldPropertySymbol ) withFirSymbolEntry ( \"\" , newPropertySymbol ) } expression . replaceCalleeReference ( buildResolvedNamedReference { source = calleeReference . source name = calleeReference . name resolvedSymbol = newPropertySymbol . setterSymbol ? . valueParameterSymbols ? . first ( ) ? : errorWithAttachment ( \"\" ) { withFirSymbolEntry ( \"\" , oldPropertySymbol ) withFirSymbolEntry ( \"\" , newPropertySymbol ) } } ) }","docstring":"/**\n * To cover third argument in setter body\n *\n * @see org.jetbrains.kotlin.fir.builder.generateAccessorsByDelegate\n */"} {"signature":"private fun rebindPropertyRef ( expression : FirExpression , newPropertySymbol : FirPropertySymbol , oldPropertySymbol : FirPropertySymbol , )","body":"{ requireWithAttachment ( expression is FirCallableReferenceAccess , { \"\" } , ) { withFirSymbolEntry ( \"\" , newPropertySymbol ) withFirSymbolEntry ( \"\" , oldPropertySymbol ) withFirEntry ( \"\" , expression ) } val calleeReference = expression . resolvedCalleeReference ( newPropertySymbol = newPropertySymbol , oldPropertySymbol = oldPropertySymbol ) val resolvedPropertySymbol = calleeReference . resolvedSymbol requireWithAttachment ( resolvedPropertySymbol == oldPropertySymbol , { \"\" } , ) { withFirEntry ( \"\" , expression ) withFirSymbolEntry ( \"\" , resolvedPropertySymbol ) withFirSymbolEntry ( \"\" , oldPropertySymbol ) withFirSymbolEntry ( \"\" , newPropertySymbol ) } expression . replaceCalleeReference ( buildResolvedNamedReference { source = calleeReference . source name = calleeReference . name resolvedSymbol = newPropertySymbol } ) expression . replaceTypeArguments ( newPropertySymbol . fir . typeParameters . map { buildTypeProjectionWithVariance { source = expression . source variance = Variance . INVARIANT typeRef = buildResolvedTypeRef { type = ConeTypeParameterTypeImpl ( it . symbol . toLookupTag ( ) , false ) } } } ) }","docstring":"/**\n * To cover `propertyRef` function\n *\n * @see org.jetbrains.kotlin.fir.builder.generateAccessorsByDelegate\n */"} {"signature":"private fun rebindDelegateAccess ( expression : FirExpression ? , newPropertySymbol : FirPropertySymbol , oldPropertySymbol : FirPropertySymbol )","body":"{ requireWithAttachment ( expression is FirPropertyAccessExpression , { \"\" } , ) { withFirSymbolEntry ( \"\" , newPropertySymbol ) withFirSymbolEntry ( \"\" , oldPropertySymbol ) expression ? . let { withFirEntry ( \"\" , it ) } } val delegateFieldReference = expression . calleeReference requireWithAttachment ( delegateFieldReference is FirDelegateFieldReference , { \"\" } , ) { withFirSymbolEntry ( \"\" , newPropertySymbol ) withFirSymbolEntry ( \"\" , oldPropertySymbol ) withFirEntry ( \"\" , delegateFieldReference ) } requireWithAttachment ( delegateFieldReference . resolvedSymbol == oldPropertySymbol . delegateFieldSymbol , { \"\" } ) { withFirSymbolEntry ( \"\" , newPropertySymbol ) withFirSymbolEntry ( \"\" , oldPropertySymbol ) withFirSymbolEntry ( \"\" , delegateFieldReference . resolvedSymbol ) } expression . replaceCalleeReference ( buildDelegateFieldReference { source = delegateFieldReference . source resolvedSymbol = newPropertySymbol . delegateFieldSymbol ? : errorWithAttachment ( \"\" ) { withFirSymbolEntry ( \"\" , newPropertySymbol ) withFirSymbolEntry ( \"\" , oldPropertySymbol ) } } ) expression . dispatchReceiver ? . let { rebindThisRef ( expression = it , newTarget = newPropertySymbol , oldTarget = oldPropertySymbol , canHavePropertySymbolAsThisReference = false , ) } }","docstring":"/**\n * To cover `delegateAccess` function\n *\n * @see org.jetbrains.kotlin.fir.builder.generateAccessorsByDelegate\n */"} {"signature":"fun initializeIteration ( loopVariable : IrVariable ? , loopVariableComponents : Map < Int , IrVariable > , builder : DeclarationIrBuilder , backendContext : CommonBackendContext , ) : List < IrStatement >","body":"fun initializeIteration ( loopVariable : IrVariable ? , loopVariableComponents : Map < Int , IrVariable > , builder : DeclarationIrBuilder , backendContext : CommonBackendContext , ) : List < IrStatement >","docstring":"/** Statements used to initialize an iteration of the loop (e.g., assign loop variable). */"} {"signature":"fun buildLoop ( builder : DeclarationIrBuilder , oldLoop : IrLoop , newBody : IrExpression ? ) : LoopReplacement","body":"fun buildLoop ( builder : DeclarationIrBuilder , oldLoop : IrLoop , newBody : IrExpression ? ) : LoopReplacement","docstring":"/** Builds a new loop from the old loop. */"} {"signature":"fun extractHeader ( variable : IrVariable ) : ForLoopHeader ?","body":"{ assert ( variable . origin == IrDeclarationOrigin . FOR_LOOP_ITERATOR ) if ( ! variable . type . isSubtypeOfClass ( symbols . iterator ) ) { return null } val iteratorCall = variable . initializer as? IrCall val iterable = iteratorCall ? . run { if ( extensionReceiver != null ) { extensionReceiver } else { dispatchReceiver } } val headerInfo = iterable ? . accept ( headerInfoBuilder , iteratorCall ) ? : return null val builder = context . createIrBuilder ( scopeOwnerSymbol ( ) , variable . startOffset , variable . endOffset ) return when ( headerInfo ) { is IndexedGetHeaderInfo -> IndexedGetLoopHeader ( headerInfo , builder , context ) is ProgressionHeaderInfo -> ProgressionLoopHeader ( headerInfo , builder , context ) is WithIndexHeaderInfo -> WithIndexLoopHeader ( headerInfo , builder , context ) is IterableHeaderInfo -> IterableLoopHeader ( headerInfo ) is FloatingPointRangeHeaderInfo , is ComparableRangeInfo -> error ( \"\" ) } }","docstring":"/**\n * Extracts information for building the for-loop (as a [ForLoopHeader]) from the given\n * \"header\" statement that stores the iterator into the loop variable\n * (e.g., `val it = someIterable.iterator()`).\n *\n * Returns null if the for-loop cannot be lowered.\n */"} {"signature":"@ JvmName ( \"\" ) fun com . google . protobuf . kotlin . DslMap < kotlin . String , com . google . protobuf . ByteString , ValuesProxy > . put ( key : kotlin . String , value : com . google . protobuf . ByteString )","body":"{ _builder . putValues ( key , value ) }","docstring":"/**\n * map<string, bytes> values = 1;\n */"} {"signature":"@ kotlin . jvm . JvmSynthetic @ JvmName ( \"\" ) @ Suppress ( \"\" ) inline operator fun com . google . protobuf . kotlin . DslMap < kotlin . String , com . google . protobuf . ByteString , ValuesProxy > . set ( key : kotlin . String , value : com . google . protobuf . ByteString )","body":"{ put ( key , value ) }","docstring":"/**\n * map<string, bytes> values = 1;\n */"} {"signature":"@ kotlin . jvm . JvmSynthetic @ JvmName ( \"\" ) fun com . google . protobuf . kotlin . DslMap < kotlin . String , com . google . protobuf . ByteString , ValuesProxy > . remove ( key : kotlin . String )","body":"{ _builder . removeValues ( key ) }","docstring":"/**\n * map<string, bytes> values = 1;\n */"} {"signature":"@ kotlin . jvm . JvmSynthetic @ JvmName ( \"\" ) fun com . google . protobuf . kotlin . DslMap < kotlin . String , com . google . protobuf . ByteString , ValuesProxy > . putAll ( map : kotlin . collections . Map < kotlin . String , com . google . protobuf . ByteString > )","body":"{ _builder . putAllValues ( map ) }","docstring":"/**\n * map<string, bytes> values = 1;\n */"} {"signature":"@ kotlin . jvm . JvmSynthetic @ JvmName ( \"\" ) fun com . google . protobuf . kotlin . DslMap < kotlin . String , com . google . protobuf . ByteString , ValuesProxy > . clear ( )","body":"{ _builder . clearValues ( ) }","docstring":"/**\n * map<string, bytes> values = 1;\n */"} {"signature":"public actual fun lazySet ( value : T )","body":"{ interceptor . beforeUpdate ( this ) FU . lazySet ( this , value ) interceptor . afterSet ( this , value ) }","docstring":"/**\n * Maps to [AtomicReferenceFieldUpdater.lazySet].\n */"} {"signature":"public actual fun compareAndSet ( expect : T , update : T ) : Boolean","body":"{ interceptor . beforeUpdate ( this ) val result = FU . compareAndSet ( this , expect , update ) if ( result ) interceptor . afterRMW ( this , expect , update ) return result }","docstring":"/**\n * Maps to [AtomicReferenceFieldUpdater.compareAndSet].\n */"} {"signature":"public actual fun getAndSet ( value : T ) : T","body":"{ interceptor . beforeUpdate ( this ) val oldValue = FU . getAndSet ( this , value ) as T interceptor . afterRMW ( this , oldValue , value ) return oldValue }","docstring":"/**\n * Maps to [AtomicReferenceFieldUpdater.getAndSet].\n */"} {"signature":"public fun < T > mono ( context : CoroutineContext = EmptyCoroutineContext , block : suspend CoroutineScope . ( ) -> T ? ) : Mono < T >","body":"{ require ( context [ Job ] === null ) { \"\" + \"\" } return monoInternal ( GlobalScope , context , block ) }","docstring":"/**\n * Creates a cold [mono][Mono] that runs a given [block] in a coroutine and emits its result.\n * Every time the returned mono is subscribed, it starts a new coroutine.\n * If the result of [block] is `null`, [MonoSink.success] is invoked without a value.\n * Unsubscribing cancels the running coroutine.\n *\n * Coroutine context can be specified with [context] argument.\n * If the context does not have any dispatcher nor any other [ContinuationInterceptor], then [Dispatchers.Default] is used.\n *\n * @throws IllegalArgumentException if the provided [context] contains a [Job] instance.\n */"} {"signature":"public suspend fun < T > Mono < T > . awaitSingleOrNull ( ) : T ?","body":"= suspendCancellableCoroutine { cont -> injectCoroutineContext ( cont . context ) . subscribe ( object : Subscriber < T > { private var value : T ? = null override fun onSubscribe ( s : Subscription ) { cont . invokeOnCancellation { s . cancel ( ) } s . request ( Long . MAX_VALUE ) } override fun onComplete ( ) { cont . resume ( value ) value = null } override fun onNext ( t : T ) { value = t } override fun onError ( error : Throwable ) { cont . resumeWithException ( error ) } } ) }","docstring":"/**\n * Awaits the single value from the given [Mono] without blocking the thread and returns the resulting value, or, if\n * this publisher has produced an error, throws the corresponding exception. If the Mono completed without a value,\n * `null` is returned.\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 cancels its [Subscription] and resumes with [CancellationException].\n */"} {"signature":"public suspend fun < T > Mono < T > . awaitSingle ( ) : T","body":"= awaitSingleOrNull ( ) ? : throw NoSuchElementException ( )","docstring":"/**\n * Awaits the single value from the given [Mono] without blocking the thread and returns the resulting value, or,\n * if this Mono 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 cancels its [Subscription] and resumes with [CancellationException].\n *\n * @throws NoSuchElementException if the Mono does not emit any value\n */"} {"signature":"@ Deprecated ( message = \"\" , level = DeprecationLevel . HIDDEN , replaceWith = ReplaceWith ( \"\" ) ) public fun < T > CoroutineScope . mono ( context : CoroutineContext = EmptyCoroutineContext , block : suspend CoroutineScope . ( ) -> T ? ) : Mono < T >","body":"= monoInternal ( this , context , block )","docstring":"/**\n * @suppress\n */"} {"signature":"@ Deprecated ( message = \"\" + \"\" , level = DeprecationLevel . HIDDEN , replaceWith = ReplaceWith ( \"\" ) ) public suspend fun < T > Mono < T > . awaitFirst ( ) : T","body":"= awaitSingle ( )","docstring":"/**\n * This is a lint function that was added already deprecated in order to guard against confusing usages on [Mono].\n * On [Publisher] instances other than [Mono], this function is not deprecated.\n *\n * Both [awaitFirst] and [awaitSingle] await the first value, or throw [NoSuchElementException] if there is none, but\n * the name [Mono.awaitSingle] better reflects the semantics of [Mono].\n *\n * For example, consider this code:\n * ```\n * myDbClient.findById(uniqueId).awaitFirst() // findById returns a `Mono`\n * ```\n * It looks like more than one value could be returned from `findById` and [awaitFirst] discards the extra elements,\n * when in fact, at most a single value can be present.\n *\n * @suppress\n */"} {"signature":"@ Deprecated ( message = \"\" + \"\" , level = DeprecationLevel . HIDDEN , replaceWith = ReplaceWith ( \"\" ) ) public suspend fun < T > Mono < T > . awaitFirstOrDefault ( default : T ) : T","body":"= awaitSingleOrNull ( ) ? : default","docstring":"/**\n * This is a lint function that was added already deprecated in order to guard against confusing usages on [Mono].\n * On [Publisher] instances other than [Mono], this function is not deprecated.\n *\n * Both [awaitFirstOrDefault] and [awaitSingleOrNull] await the first value, or return some special value if there\n * is none, but the name [Mono.awaitSingleOrNull] better reflects the semantics of [Mono].\n *\n * For example, consider this code:\n * ```\n * myDbClient.findById(uniqueId).awaitFirstOrDefault(default) // findById returns a `Mono`\n * ```\n * It looks like more than one value could be returned from `findById` and [awaitFirstOrDefault] discards the extra\n * elements, when in fact, at most a single value can be present.\n *\n * @suppress\n */"} {"signature":"@ Deprecated ( message = \"\" + \"\" , level = DeprecationLevel . HIDDEN , replaceWith = ReplaceWith ( \"\" ) ) public suspend fun < T > Mono < T > . awaitFirstOrNull ( ) : T ?","body":"= awaitSingleOrNull ( )","docstring":"/**\n * This is a lint function that was added already deprecated in order to guard against confusing usages on [Mono].\n * On [Publisher] instances other than [Mono], this function is not deprecated.\n *\n * Both [awaitFirstOrNull] and [awaitSingleOrNull] await the first value, or return some special value if there\n * is none, but the name [Mono.awaitSingleOrNull] better reflects the semantics of [Mono].\n *\n * For example, consider this code:\n * ```\n * myDbClient.findById(uniqueId).awaitFirstOrNull() // findById returns a `Mono`\n * ```\n * It looks like more than one value could be returned from `findById` and [awaitFirstOrNull] discards the extra\n * elements, when in fact, at most a single value can be present.\n *\n * @suppress\n */"} {"signature":"@ Deprecated ( message = \"\" + \"\" , level = DeprecationLevel . HIDDEN , replaceWith = ReplaceWith ( \"\" ) ) public suspend fun < T > Mono < T > . awaitFirstOrElse ( defaultValue : ( ) -> T ) : T","body":"= awaitSingleOrNull ( ) ? : defaultValue ( )","docstring":"/**\n * This is a lint function that was added already deprecated in order to guard against confusing usages on [Mono].\n * On [Publisher] instances other than [Mono], this function is not deprecated.\n *\n * Both [awaitFirstOrElse] and [awaitSingleOrNull] await the first value, or return some special value if there\n * is none, but the name [Mono.awaitSingleOrNull] better reflects the semantics of [Mono].\n *\n * For example, consider this code:\n * ```\n * myDbClient.findById(uniqueId).awaitFirstOrElse(defaultValue) // findById returns a `Mono`\n * ```\n * It looks like more than one value could be returned from `findById` and [awaitFirstOrElse] discards the extra\n * elements, when in fact, at most a single value can be present.\n *\n * @suppress\n */"} {"signature":"@ Deprecated ( message = \"\" + \"\" , level = DeprecationLevel . HIDDEN , replaceWith = ReplaceWith ( \"\" ) ) public suspend fun < T > Mono < T > . awaitLast ( ) : T","body":"= awaitSingle ( )","docstring":"/**\n * This is a lint function that was added already deprecated in order to guard against confusing usages on [Mono].\n * On [Publisher] instances other than [Mono], this function is not deprecated.\n *\n * Both [awaitLast] and [awaitSingle] await the single value, or throw [NoSuchElementException] if there is none, but\n * the name [Mono.awaitSingle] better reflects the semantics of [Mono].\n *\n * For example, consider this code:\n * ```\n * myDbClient.findById(uniqueId).awaitLast() // findById returns a `Mono`\n * ```\n * It looks like more than one value could be returned from `findById` and [awaitLast] discards the initial elements,\n * when in fact, at most a single value can be present.\n *\n * @suppress\n */"} {"signature":"private fun < T > remapCapturedFields ( lambdaConstructor : IrConstructor , remapVP : ( IrValueParameterSymbol ) -> T ? ) : Map < IrFieldSymbol , T >","body":"{ val statements = lambdaConstructor . body ? . let { it . cast < IrBlockBody > ( ) . statements } ? : compilationException ( \"\" , lambdaConstructor ) return statements . asSequence ( ) . filterIsInstance < IrSetField > ( ) . filter { it . origin == LoweredStatementOrigins . STATEMENT_ORIGIN_INITIALIZER_OF_FIELD_FOR_CAPTURED_VALUE } . mapNotNull { irSetField -> remapVP ( irSetField . value . cast < IrGetValue > ( ) . symbol . cast ( ) ) ? . let { irSetField . symbol to it } } . toMap ( ) }","docstring":"/**\n * Returns a mapping from a lambda class field to the corresponding captured value.\n *\n * [remapVP] accepts a lambda constructor's value parameter symbol, for which it should return the corresponding captured value.\n */"} {"signature":"private fun liftLambda ( ctorToFreeFunctionMap : MutableMap < IrConstructorSymbol , IrSimpleFunctionSymbol > , lambdaInfo : LambdaInfo ) : List < IrDeclaration >","body":"{ val constructor = lambdaInfo . lambdaClass . constructors . single ( ) val newDeclarations = mutableListOf < IrDeclaration > ( ) val freeFunctionDeclaration = createLambdaDeclaration ( lambdaInfo . invokeFun , lambdaInfo . lambdaClass . name , lambdaInfo . lambdaClass . parent , lambdaInfo . superInvokeFun ) freeFunctionDeclaration . body = inlineLambdaBody ( freeFunctionDeclaration , lambdaInfo . invokeFun , lambdaInfo . createOldToNewInvokeParametersMapping ( freeFunctionDeclaration ) , emptyMap ( ) ) newDeclarations . add ( freeFunctionDeclaration ) newDeclarations . addAll ( lambdaInfo . lambdaInnerClasses ( ) ) ctorToFreeFunctionMap [ constructor . symbol ] = freeFunctionDeclaration . symbol return newDeclarations }","docstring":"/**\n * Replaces a contextless lambda class with a free function.\n */"} {"signature":"abstract override fun toString ( ) : String","body":"abstract override fun toString ( ) : String","docstring":"/**\n * Returns a string representation of the signature.\n *\n * In case of a method it's just [name] and [descriptor] concatenated together, e.g. `equals(Ljava/lang/Object;)Z`\n *\n * In case of a field [name] and [descriptor] are concatenated with `:` separator, e.g. `value:Ljava/lang/String;`\n */"} {"signature":"fun execClangForCompilerTests ( target : KonanTarget , action : Action < in ExecSpec > ) : ExecResult","body":"{ val defaultArgs = platformManager . platform ( target ) . clang . clangArgs . toList ( ) return execOperations . exec { action . execute ( this ) executable = if ( target . family . isAppleFamily ) { resolveToolchainExecutable ( target , executable ) } else { resolveExecutable ( executable ) } args = defaultArgs + args } }","docstring":"/**\n * Execute Clang the way that produced object file is compatible with\n * the one that produced by Kotlin/Native for given [target]. It means:\n * 1. We pass flags that set sysroot.\n * 2. We call Clang from toolchain in case of Apple target.\n */"} {"signature":"private inline fun dispatchInternal ( block : Runnable , startWorker : ( Worker ) -> Unit )","body":"{ queue . addLast ( block ) if ( runningWorkers . value >= parallelism ) return if ( ! tryAllocateWorker ( ) ) return val task = obtainTaskOrDeallocateWorker ( ) ? : return startWorker ( Worker ( task ) ) }","docstring":"/**\n * Tries to dispatch the given [block].\n * If there are not enough workers, it starts a new one via [startWorker].\n */"} {"signature":"private fun tryAllocateWorker ( ) : Boolean","body":"{ synchronized ( workerAllocationLock ) { if ( runningWorkers . value >= parallelism ) return false runningWorkers . incrementAndGet ( ) return true } }","docstring":"/**\n * Tries to obtain the permit to start a new worker.\n */"} {"signature":"private fun obtainTaskOrDeallocateWorker ( ) : Runnable ?","body":"{ while ( true ) { when ( val nextTask = queue . removeFirstOrNull ( ) ) { null -> synchronized ( workerAllocationLock ) { runningWorkers . decrementAndGet ( ) if ( queue . size == ) return null runningWorkers . incrementAndGet ( ) } else -> return nextTask } } }","docstring":"/**\n * Obtains the next task from the queue, or logically deallocates the worker if the queue is empty.\n */"} {"signature":"protected abstract fun computeNext ( ) : Unit","body":"protected abstract fun computeNext ( ) : Unit","docstring":"/**\n * Computes the next item in the iterator.\n *\n * This callback method should call one of these two methods:\n *\n * * [setNext] with the next value of the iteration\n * * [done] to indicate there are no more elements\n *\n * Failure to call either method will result in the iteration terminating with a failed state\n */"} {"signature":"protected fun setNext ( value : T ) : Unit","body":"{ nextValue = value state = State . READY }","docstring":"/**\n * Sets the next value in the iteration, called from the [computeNext] function\n */"} {"signature":"protected fun done ( )","body":"{ state = State . DONE }","docstring":"/**\n * Sets the state to done so that the iteration terminates.\n */"} {"signature":"internal fun runCommand ( command : List < String > , logger : Logger ? = null , errorHandler : ( ( result : RunProcessResult ) -> String ? ) ? = null , processConfiguration : ProcessBuilder . ( ) -> Unit = { } , ) : String","body":"{ val runResult = assembleAndRunProcess ( command , logger , processConfiguration ) check ( runResult . retCode == ) { errorHandler ? . invoke ( runResult ) ? : createErrorMessage ( command , runResult ) } return runResult . stdOut }","docstring":"/**\n * Executes a command and returns the input text.\n *\n * @param command the command and its arguments to be executed as a list of strings.\n * @param logger an optional logger to log information about the command execution.\n * @param errorHandler (Optional) A function that handles any errors that occur during the command execution.\n * @param processConfiguration a function to configure the process before execution.\n * @return The input text of the executed command.\n */"} {"signature":"internal fun runCommandWithFallback ( command : List < String > , logger : Logger ? = null , fallback : ( result : RunProcessResult ) -> CommandFallback , processConfiguration : ProcessBuilder . ( ) -> Unit = { } , ) : String","body":"{ val runResult = assembleAndRunProcess ( command , logger , processConfiguration ) return if ( runResult . retCode != ) { when ( val fallbackOption = fallback ( runResult ) ) { is CommandFallback . Action -> fallbackOption . fallback is CommandFallback . Error -> error ( fallbackOption . error ? : createErrorMessage ( command , runResult ) ) } } else { runResult . stdOut } }","docstring":"/**\n * Executes the specified command with fallback behavior in case of non-zero return code.\n *\n * @param command the command and its arguments to be executed as a list of strings.\n * @param logger an optional logger to log information about the command execution.\n * @param fallback a function that provides the fallback behavior. It takes the return code, output, and process as parameters and returns a [CommandFallback] object.\n * @param processConfiguration a function to configure the process before execution.\n * @return the output of the command if the return code is 0, otherwise the fallback action or error.\n */"} {"signature":"private fun String . detectSubprojects ( rootPath : String ) : Map < String , String >","body":"{ val result : MutableMap < String , String > = mutableMapOf ( ) lines ( ) . forEach { line -> if ( ! line . matches ( includeRegex ) ) { return@forEach } pathStringRegex . findAll ( this ) . mapNotNull { it . groupValues . getOrNull ( ) } . forEach { path -> if ( path != \"\" ) { val parent = path . substringBeforeLast ( '' ) + \"\" if ( parent . startsWith ( rootPath ) ) { result [ path ] = parent } } } } return result }","docstring":"/**\n * @return map project path -> parent project path\n */"} {"signature":"public suspend fun < T > Flow < T > . toList ( destination : MutableList < T > = ArrayList ( ) ) : List < T >","body":"= toCollection ( destination )","docstring":"/**\n * Collects given flow into a [destination]\n */"} {"signature":"public suspend fun < T > Flow < T > . toSet ( destination : MutableSet < T > = LinkedHashSet ( ) ) : Set < T >","body":"= toCollection ( destination )","docstring":"/**\n * Collects given flow into a [destination]\n */"} {"signature":"public suspend fun < T , C : MutableCollection < in T > > Flow < T > . toCollection ( destination : C ) : C","body":"{ collect { value -> destination . add ( value ) } return destination }","docstring":"/**\n * Collects given flow into a [destination]\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ ExperimentalUnsignedTypes @ kotlin . internal . InlineOnly public actual inline fun UIntArray . elementAt ( index : Int ) : UInt","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 array.\n * \n * @sample samples.collections.Collections.Elements.elementAt\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ ExperimentalUnsignedTypes @ kotlin . internal . InlineOnly public actual inline fun ULongArray . elementAt ( index : Int ) : ULong","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 array.\n * \n * @sample samples.collections.Collections.Elements.elementAt\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ ExperimentalUnsignedTypes @ kotlin . internal . InlineOnly public actual inline fun UByteArray . elementAt ( index : Int ) : UByte","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 array.\n * \n * @sample samples.collections.Collections.Elements.elementAt\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ ExperimentalUnsignedTypes @ kotlin . internal . InlineOnly public actual inline fun UShortArray . elementAt ( index : Int ) : UShort","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 array.\n * \n * @sample samples.collections.Collections.Elements.elementAt\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ ExperimentalUnsignedTypes public actual fun UIntArray . asList ( ) : List < UInt >","body":"{ return object : AbstractList < UInt > ( ) , RandomAccess { override val size : Int get ( ) = this@asList . size override fun isEmpty ( ) : Boolean = this@asList . isEmpty ( ) override fun contains ( element : UInt ) : Boolean = this@asList . contains ( element ) override fun get ( index : Int ) : UInt = this@asList [ index ] override fun indexOf ( element : UInt ) : Int = this@asList . indexOf ( element ) override fun lastIndexOf ( element : UInt ) : Int = this@asList . lastIndexOf ( element ) } }","docstring":"/**\n * Returns a [List] that wraps the original array.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ ExperimentalUnsignedTypes public actual fun ULongArray . asList ( ) : List < ULong >","body":"{ return object : AbstractList < ULong > ( ) , RandomAccess { override val size : Int get ( ) = this@asList . size override fun isEmpty ( ) : Boolean = this@asList . isEmpty ( ) override fun contains ( element : ULong ) : Boolean = this@asList . contains ( element ) override fun get ( index : Int ) : ULong = this@asList [ index ] override fun indexOf ( element : ULong ) : Int = this@asList . indexOf ( element ) override fun lastIndexOf ( element : ULong ) : Int = this@asList . lastIndexOf ( element ) } }","docstring":"/**\n * Returns a [List] that wraps the original array.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ ExperimentalUnsignedTypes public actual fun UByteArray . asList ( ) : List < UByte >","body":"{ return object : AbstractList < UByte > ( ) , RandomAccess { override val size : Int get ( ) = this@asList . size override fun isEmpty ( ) : Boolean = this@asList . isEmpty ( ) override fun contains ( element : UByte ) : Boolean = this@asList . contains ( element ) override fun get ( index : Int ) : UByte = this@asList [ index ] override fun indexOf ( element : UByte ) : Int = this@asList . indexOf ( element ) override fun lastIndexOf ( element : UByte ) : Int = this@asList . lastIndexOf ( element ) } }","docstring":"/**\n * Returns a [List] that wraps the original array.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ ExperimentalUnsignedTypes public actual fun UShortArray . asList ( ) : List < UShort >","body":"{ return object : AbstractList < UShort > ( ) , RandomAccess { override val size : Int get ( ) = this@asList . size override fun isEmpty ( ) : Boolean = this@asList . isEmpty ( ) override fun contains ( element : UShort ) : Boolean = this@asList . contains ( element ) override fun get ( index : Int ) : UShort = this@asList [ index ] override fun indexOf ( element : UShort ) : Int = this@asList . indexOf ( element ) override fun lastIndexOf ( element : UShort ) : Int = this@asList . lastIndexOf ( element ) } }","docstring":"/**\n * Returns a [List] that wraps the original array.\n */"} {"signature":"@ Deprecated ( \"\" ) @ SinceKotlin ( \"\" ) @ DeprecatedSinceKotlin ( hiddenSince = \"\" ) @ ExperimentalUnsignedTypes public infix fun UIntArray . contentEquals ( other : UIntArray ) : Boolean","body":"{ return this . contentEquals ( other ) }","docstring":"/**\n * Checks if the two specified arrays are *structurally* equal to one another.\n * \n * Two arrays are considered structurally equal if they have the same size, and elements at corresponding indices are equal.\n * \n * @param other the array to compare with this array.\n * @return `true` if the two arrays are structurally equal, `false` otherwise.\n * \n * @sample samples.collections.Arrays.ContentOperations.intArrayContentEquals\n */"} {"signature":"@ Deprecated ( \"\" ) @ SinceKotlin ( \"\" ) @ DeprecatedSinceKotlin ( hiddenSince = \"\" ) @ ExperimentalUnsignedTypes public infix fun ULongArray . contentEquals ( other : ULongArray ) : Boolean","body":"{ return this . contentEquals ( other ) }","docstring":"/**\n * Checks if the two specified arrays are *structurally* equal to one another.\n * \n * Two arrays are considered structurally equal if they have the same size, and elements at corresponding indices are equal.\n * \n * @param other the array to compare with this array.\n * @return `true` if the two arrays are structurally equal, `false` otherwise.\n * \n * @sample samples.collections.Arrays.ContentOperations.intArrayContentEquals\n */"} {"signature":"@ Deprecated ( \"\" ) @ SinceKotlin ( \"\" ) @ DeprecatedSinceKotlin ( hiddenSince = \"\" ) @ ExperimentalUnsignedTypes public infix fun UByteArray . contentEquals ( other : UByteArray ) : Boolean","body":"{ return this . contentEquals ( other ) }","docstring":"/**\n * Checks if the two specified arrays are *structurally* equal to one another.\n * \n * Two arrays are considered structurally equal if they have the same size, and elements at corresponding indices are equal.\n * \n * @param other the array to compare with this array.\n * @return `true` if the two arrays are structurally equal, `false` otherwise.\n * \n * @sample samples.collections.Arrays.ContentOperations.intArrayContentEquals\n */"} {"signature":"@ Deprecated ( \"\" ) @ SinceKotlin ( \"\" ) @ DeprecatedSinceKotlin ( hiddenSince = \"\" ) @ ExperimentalUnsignedTypes public infix fun UShortArray . contentEquals ( other : UShortArray ) : Boolean","body":"{ return this . contentEquals ( other ) }","docstring":"/**\n * Checks if the two specified arrays are *structurally* equal to one another.\n * \n * Two arrays are considered structurally equal if they have the same size, and elements at corresponding indices are equal.\n * \n * @param other the array to compare with this array.\n * @return `true` if the two arrays are structurally equal, `false` otherwise.\n * \n * @sample samples.collections.Arrays.ContentOperations.intArrayContentEquals\n */"} {"signature":"@ Deprecated ( \"\" ) @ SinceKotlin ( \"\" ) @ DeprecatedSinceKotlin ( hiddenSince = \"\" ) @ ExperimentalUnsignedTypes public fun UIntArray . contentHashCode ( ) : Int","body":"{ return this . contentHashCode ( ) }","docstring":"/**\n * Returns a hash code based on the contents of this array as if it is [List].\n */"} {"signature":"@ Deprecated ( \"\" ) @ SinceKotlin ( \"\" ) @ DeprecatedSinceKotlin ( hiddenSince = \"\" ) @ ExperimentalUnsignedTypes public fun ULongArray . contentHashCode ( ) : Int","body":"{ return this . contentHashCode ( ) }","docstring":"/**\n * Returns a hash code based on the contents of this array as if it is [List].\n */"} {"signature":"@ Deprecated ( \"\" ) @ SinceKotlin ( \"\" ) @ DeprecatedSinceKotlin ( hiddenSince = \"\" ) @ ExperimentalUnsignedTypes public fun UByteArray . contentHashCode ( ) : Int","body":"{ return this . contentHashCode ( ) }","docstring":"/**\n * Returns a hash code based on the contents of this array as if it is [List].\n */"} {"signature":"@ Deprecated ( \"\" ) @ SinceKotlin ( \"\" ) @ DeprecatedSinceKotlin ( hiddenSince = \"\" ) @ ExperimentalUnsignedTypes public fun UShortArray . contentHashCode ( ) : Int","body":"{ return this . contentHashCode ( ) }","docstring":"/**\n * Returns a hash code based on the contents of this array as if it is [List].\n */"} {"signature":"@ Deprecated ( \"\" ) @ SinceKotlin ( \"\" ) @ DeprecatedSinceKotlin ( hiddenSince = \"\" ) @ ExperimentalUnsignedTypes public fun UIntArray . contentToString ( ) : String","body":"{ return this . contentToString ( ) }","docstring":"/**\n * Returns a string representation of the contents of the specified array as if it is [List].\n * \n * @sample samples.collections.Arrays.ContentOperations.contentToString\n */"} {"signature":"@ Deprecated ( \"\" ) @ SinceKotlin ( \"\" ) @ DeprecatedSinceKotlin ( hiddenSince = \"\" ) @ ExperimentalUnsignedTypes public fun ULongArray . contentToString ( ) : String","body":"{ return this . contentToString ( ) }","docstring":"/**\n * Returns a string representation of the contents of the specified array as if it is [List].\n * \n * @sample samples.collections.Arrays.ContentOperations.contentToString\n */"} {"signature":"@ Deprecated ( \"\" ) @ SinceKotlin ( \"\" ) @ DeprecatedSinceKotlin ( hiddenSince = \"\" ) @ ExperimentalUnsignedTypes public fun UByteArray . contentToString ( ) : String","body":"{ return this . contentToString ( ) }","docstring":"/**\n * Returns a string representation of the contents of the specified array as if it is [List].\n * \n * @sample samples.collections.Arrays.ContentOperations.contentToString\n */"} {"signature":"@ Deprecated ( \"\" ) @ SinceKotlin ( \"\" ) @ DeprecatedSinceKotlin ( hiddenSince = \"\" ) @ ExperimentalUnsignedTypes public fun UShortArray . contentToString ( ) : String","body":"{ return this . contentToString ( ) }","docstring":"/**\n * Returns a string representation of the contents of the specified array as if it is [List].\n * \n * @sample samples.collections.Arrays.ContentOperations.contentToString\n */"} {"signature":"public fun convert ( lossFunctionType : Losses ) : LossFunction","body":"{ return when ( lossFunctionType ) { SOFT_MAX_CROSS_ENTROPY_WITH_LOGITS -> SoftmaxCrossEntropyWithLogits ( ) HINGE -> Hinge ( ) HUBER -> Huber ( ) BINARY_CROSSENTROPY -> BinaryCrossEntropy ( ) MAE -> MAE ( ) MSE -> MSE ( ) MAPE -> MAPE ( ) MSLE -> MSLE ( ) POISSON -> Poisson ( ) SQUARED_HINGE -> SquaredHinge ( ) LOG_COSH -> LogCosh ( ) } }","docstring":"/** Converts enum value to subclass of [LossFunction]. */"} {"signature":"public abstract fun apply ( tf : Ops , input : Operand < Float > , ) : Operand < Float >","body":"public abstract fun apply ( tf : Ops , input : Operand < Float > , ) : Operand < Float >","docstring":"/** Applies regularization to the input. */"} {"signature":"private fun FlyweightCapableTreeStructure < LighterASTNode > . referenceExpression ( node : LighterASTNode , locateReferencedName : Boolean ) : LighterASTNode ?","body":"{ val childrenRef = Ref < Array < LighterASTNode ? > > ( ) getChildren ( node , childrenRef ) var result = childrenRef . get ( ) ? . firstOrNull { it ? . isExpression ( ) == true || it ? . tokenType == KtNodeTypes . PARENTHESIZED } while ( locateReferencedName && result != null && result . tokenType == KtNodeTypes . PARENTHESIZED ) { result = referenceExpression ( result , locateReferencedName = true ) } return result }","docstring":"/**\n * @param locateReferencedName whether to remove any nested parentheses while locating the reference element. This is useful for diagnostics\n * on super and unresolved references. For example, with the following, only the part inside the parentheses should be highlighted.\n *\n * ```\n * fun foo() {\n * (super)()\n * ^^^^^\n * (random123)()\n * ^^^^^^^^^\n * }\n * ```\n */"} {"signature":"@ Test fun testAndroidInverseOrder ( )","body":"{ val buildSource = buildFromTemplate ( \"\" ) val build = buildSource . generate ( ) val buildResult = build . runWithParams ( \"\" ) assertFalse ( buildResult . isSuccessful ) }","docstring":"/**\n * In the common verify config, rules are declared that always lead to an error.\n * Verification of the Android build variant should use these rules and failed.\n */"} {"signature":"fun setUnnamedAddr ( value : Boolean )","body":"{ LLVMSetUnnamedAddr ( llvmGlobal , if ( value ) else ) }","docstring":"/**\n * Globals that are marked with unnamed_addr might be merged by LLVM's ConstantMerge pass.\n */"} {"signature":"fun createGlobal ( type : LLVMTypeRef , name : String , isExported : Boolean = false ) : Global","body":"{ return Global . create ( this , type , name , isExported ) }","docstring":"/**\n * Creates [Global] with given type and name.\n *\n * It is external until explicitly initialized with [Global.setInitializer].\n */"} {"signature":"fun placeGlobal ( name : String , initializer : ConstValue , isExported : Boolean = false ) : Global","body":"{ val global = createGlobal ( initializer . llvmType , name , isExported ) global . setInitializer ( initializer ) return global }","docstring":"/**\n * Creates [Global] with given name and value.\n */"} {"signature":"fun placeGlobalArray ( name : String , elemType : LLVMTypeRef ? , elements : List < ConstValue > , isExported : Boolean = false ) : Global","body":"{ val initializer = ConstArray ( elemType , elements ) val global = placeGlobal ( name , initializer , isExported ) return global }","docstring":"/**\n * Creates array-typed global with given name and value.\n */"} {"signature":"@ JsExport fun makeValueDescriptionForSteppingTests ( value : Any ? ) : ValueDescriptionForSteppingTests ?","body":"{ val jsTypeName = jsTypeOf ( value ) val displayedTypeName = when ( jsTypeName ) { \"\" -> return null \"\" , \"\" , \"\" -> if ( value == null ) jsTypeName else { val klass = value :: class knownFqNames [ klass ] ? : klass . simpleName ? : \"\" } else -> jsTypeName } return js ( \"\" ) . unsafeCast < ValueDescriptionForSteppingTests > ( ) . apply { isNull = value == null isReferenceType = jsTypeName == \"\" || jsTypeName == \"\" valueDescription = when ( jsTypeName ) { \"\" -> JSON . stringify ( value ) else -> value . toString ( ) } typeName = displayedTypeName } }","docstring":"/**\n * This function is only called from the debugger\n */"} {"signature":"@ kotlin . internal . InlineOnly public inline fun exitProcess ( status : Int ) : Nothing","body":"{ System . exit ( status ) throw RuntimeException ( \"\" ) }","docstring":"/**\n * Terminates the currently running process.\n *\n * @param status serves as a status code; by convention,\n * a nonzero status code indicates abnormal termination.\n *\n * @return This method never returns normally.\n */"} {"signature":"fun iWantSomeDocumentationFromDokka ( f : FindMyDocumantationPlease )","body":"{ }","docstring":"/**\n * A function using a class type placed right into the same file.\n *\n * @param f The parameter of the type under the investigation\n * */"} {"signature":"public fun mean ( vararg arrays : FloatArray , channels : Int = ) : FloatArray","body":"{ val result = FloatArray ( ) { } val n = arrays . sumOf { it . size / channels } for ( floats in arrays ) { require ( floats . size % channels == ) { \"\" + \"\" } for ( i in floats . indices ) { result [ i % channels ] += floats [ i ] / n } } return result }","docstring":"/**\n * Computes mean value for each channel of the provided arrays.\n *\n * NOTE: might be migrated to multik in the future.\n *\n * @param [arrays] input arrays. Size of each array should be divisible by the passed [channels] number.\n * @param [channels] number of channels to compute mean value for.\n * @return an array of size [channels] containing mean value for each channel.\n */"} {"signature":"public fun std ( vararg arrays : FloatArray , channels : Int = ) : FloatArray","body":"{ val sumSquares = FloatArray ( ) { } val sum = FloatArray ( ) { } val n = arrays . sumOf { it . size / channels } for ( floats in arrays ) { require ( floats . size % channels == ) { \"\" + \"\" } for ( i in floats . indices ) { sumSquares [ i % channels ] += floats [ i ] * floats [ i ] / n sum [ i % channels ] += floats [ i ] / n } } return FloatArray ( ) { sqrt ( sumSquares [ it ] - sum [ it ] * sum [ it ] ) } }","docstring":"/**\n * Computes std value for each channel of the provided arrays.\n *\n * NOTE: might be migrated to multik in the future.\n *\n * @param [arrays] input arrays. Size of each array should be divisible by the passed [channels] number.\n * @param [channels] number of channels to compute std value for.\n * @return an array of size [channels] containing std value for each channel.\n */"} {"signature":"public fun FloatArray . mean ( channels : Int = ) : FloatArray","body":"= mean ( this , channels = channels )","docstring":"/**\n * Computes mean value for each channel of the array. Array size should be divisible by the passed [channels] number.\n *\n * NOTE: might be migrated to multik in the future.\n *\n * @param [channels] number of channels to compute mean value for.\n * @return an array of size [channels] containing mean value for each channel.\n */"} {"signature":"public fun FloatArray . std ( channels : Int = ) : FloatArray","body":"= std ( this , channels = channels )","docstring":"/**\n * Computes std value for each channel of the array. Array size should be divisible by the passed [channels] number.\n *\n * NOTE: might be migrated to multik in the future.\n *\n * @param [channels] number of channels to compute std value for.\n * @return an array of size [channels] containing std value for each channel.\n */"} {"signature":"fun generateBodies ( )","body":"{ cEnumCompanionGenerator . invokePostLinkageSteps ( ) cEnumByValueFunctionGenerator . invokePostLinkageSteps ( ) cEnumClassGenerator . invokePostLinkageSteps ( ) cEnumVarClassGenerator . invokePostLinkageSteps ( ) cStructClassGenerator . invokePostLinkageSteps ( ) cStructCompanionGenerator . invokePostLinkageSteps ( ) }","docstring":"/**\n * We postpone generation of bodies until IR linkage is complete.\n * This way we ensure that all used symbols are resolved.\n */"} {"signature":"@ HtmlTagMarker inline fun TABLE . caption ( classes : String ? = null , crossinline block : CAPTION . ( ) -> Unit = { } ) : Unit","body":"= CAPTION ( attributesMapOf ( \"\" , classes ) , consumer ) . visit ( block )","docstring":"/**\n * Table caption\n */"} {"signature":"@ HtmlTagMarker inline fun TABLE . colGroup ( classes : String ? = null , crossinline block : COLGROUP . ( ) -> Unit = { } ) : Unit","body":"= COLGROUP ( attributesMapOf ( \"\" , classes ) , consumer ) . visit ( block )","docstring":"/**\n * Table column group\n */"} {"signature":"@ HtmlTagMarker inline fun TABLE . thead ( classes : String ? = null , crossinline block : THEAD . ( ) -> Unit = { } ) : Unit","body":"= THEAD ( attributesMapOf ( \"\" , classes ) , consumer ) . visit ( block )","docstring":"/**\n * Table header\n */"} {"signature":"@ HtmlTagMarker inline fun TABLE . tfoot ( classes : String ? = null , crossinline block : TFOOT . ( ) -> Unit = { } ) : Unit","body":"= TFOOT ( attributesMapOf ( \"\" , classes ) , consumer ) . visit ( block )","docstring":"/**\n * Table footer\n */"} {"signature":"@ HtmlTagMarker inline fun TABLE . tbody ( classes : String ? = null , crossinline block : TBODY . ( ) -> Unit = { } ) : Unit","body":"= TBODY ( attributesMapOf ( \"\" , classes ) , consumer ) . visit ( block )","docstring":"/**\n * Table body\n */"} {"signature":"@ HtmlTagMarker inline fun TABLE . tr ( classes : String ? = null , crossinline block : TR . ( ) -> Unit = { } ) : Unit","body":"= TR ( attributesMapOf ( \"\" , classes ) , consumer ) . visit ( block )","docstring":"/**\n * Table row\n */"} {"signature":"@ HtmlTagMarker inline fun TBODY . tr ( classes : String ? = null , crossinline block : TR . ( ) -> Unit = { } ) : Unit","body":"= TR ( attributesMapOf ( \"\" , classes ) , consumer ) . visit ( block )","docstring":"/**\n * Table row\n */"} {"signature":"@ HtmlTagMarker inline fun TFOOT . tr ( classes : String ? = null , crossinline block : TR . ( ) -> Unit = { } ) : Unit","body":"= TR ( attributesMapOf ( \"\" , classes ) , consumer ) . visit ( block )","docstring":"/**\n * Table row\n */"} {"signature":"@ HtmlTagMarker inline fun THEAD . tr ( classes : String ? = null , crossinline block : TR . ( ) -> Unit = { } ) : Unit","body":"= TR ( attributesMapOf ( \"\" , classes ) , consumer ) . visit ( block )","docstring":"/**\n * Table row\n */"} {"signature":"@ HtmlTagMarker inline fun TR . th ( scope : ThScope ? = null , classes : String ? = null , crossinline block : TH . ( ) -> Unit = { } ) : Unit","body":"= TH ( attributesMapOf ( \"\" , scope ? . enumEncode ( ) , \"\" , classes ) , consumer ) . visit ( block )","docstring":"/**\n * Table header cell\n */"} {"signature":"@ HtmlTagMarker inline fun TR . td ( classes : String ? = null , crossinline block : TD . ( ) -> Unit = { } ) : Unit","body":"= TD ( attributesMapOf ( \"\" , classes ) , consumer ) . visit ( block )","docstring":"/**\n * Table data cell\n */"} {"signature":"public expect fun println ( )","body":"public expect fun println ( )","docstring":"/** Prints the line separator to the standard output stream. */"} {"signature":"public expect fun println ( message : Any ? )","body":"public expect fun println ( message : Any ? )","docstring":"/** Prints the given [message] and the line separator to the standard output stream. */"} {"signature":"public expect fun print ( message : Any ? )","body":"public expect fun print ( message : Any ? )","docstring":"/** Prints the given [message] to the standard output stream. */"} {"signature":"@ SinceKotlin ( \"\" ) public expect fun readln ( ) : String","body":"@ SinceKotlin ( \"\" ) public expect fun readln ( ) : String","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 * Currently this function is not supported in Kotlin/JS and throws [UnsupportedOperationException].\n */"} {"signature":"@ SinceKotlin ( \"\" ) public expect fun readlnOrNull ( ) : String ?","body":"@ SinceKotlin ( \"\" ) public expect fun readlnOrNull ( ) : String ?","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 * Currently this function is not supported in Kotlin/JS and throws [UnsupportedOperationException].\n */"} {"signature":"@ DisplayName ( \"\" ) @ GradleTest fun testClasspathChangesCauseTypesToBeReprocessed ( gradleVersion : GradleVersion )","body":"{ project ( PROJECT_NAME , gradleVersion ) { setupIncrementalAptProject ( Pair ( \"\" , IncrementalBinaryIsolatingProcessor :: class . java ) , Pair ( \"\" , IncrementalAggregatingReferencingClasspathProcessor :: class . java ) , ) settingsGradle . append ( \"\" ) val classpathTypeSource = subProject ( \"\" ) . run { projectPath . createDirectories ( ) buildGradle . writeText ( \"\"\"\"\"\" . trimIndent ( ) ) val source = javaSourcesDir ( ) . resolve ( IncrementalAggregatingReferencingClasspathProcessor . CLASSPATH_TYPE . replace ( \"\" , \"\" ) + \"\" ) source . parent . createDirectories ( ) source . writeText ( \"\"\"\"\"\" . trimIndent ( ) ) return@run source } buildGradle . append ( \"\"\"\"\"\" . trimIndent ( ) ) javaSourcesDir ( ) . deleteRecursively ( ) with ( javaSourcesDir ( ) . resolve ( \"\" ) ) { parent . createDirectories ( ) writeText ( \"\"\"\"\"\" . trimIndent ( ) ) } val allKotlinStubs = setOf ( \"\" , \"\" , \"\" ) build ( \"\" , \"\" ) { assertEquals ( allKotlinStubs . map { projectPath . resolve ( it ) . toRealPath ( ) . toString ( ) } . toSet ( ) , getProcessedSources ( output ) ) assertFileInProjectExists ( \"\" ) } classpathTypeSource . writeText ( classpathTypeSource . readText ( ) . replace ( \"\" , \"\" ) ) build ( \"\" ) { assertEquals ( emptySet ( ) , getProcessedSources ( output ) ) assertEquals ( setOf ( \"\" ) , getProcessedTypes ( output ) ) assertFileInProjectExists ( \"\" ) } } }","docstring":"/**\n * Make sure that changes to classpath can cause types to be reprocessed (i.e types in generated .class files that contain annotations\n * claimed by annotation processors).\n */"} {"signature":"override fun equals ( other : Any ? ) : Boolean","body":"{ val otherType = other as? ColumnSchema ? : return false if ( otherType . kind != kind ) return false if ( otherType . nullable != nullable ) return false return when ( this ) { is Value -> type == ( otherType as Value ) . type is Group -> schema == ( otherType as Group ) . schema is Frame -> schema == ( otherType as Frame ) . schema else -> throw NotImplementedError ( ) } }","docstring":"/** Checks equality just on kind, type, or schema. */"} {"signature":"public fun numElements ( ) : Long","body":"{ var prod = for ( i in until numDimensions ( ) ) { prod *= abs ( dims [ i ] ) } return prod }","docstring":"/** Returns amount of elements in Tensor with the given shape. */"} {"signature":"public fun rank ( ) : Int","body":"{ return dims . size }","docstring":"/** Returns the rank of this shape. */"} {"signature":"public fun dims ( ) : LongArray","body":"{ return dims }","docstring":"/** Returns the array of dimensions representing this shape. */"} {"signature":"public operator fun get ( i : Int ) : Long","body":"{ return dims [ i ] }","docstring":"/**\n * Returns the value of a dimension\n *\n * @param i The index at which to retrieve a dimension.\n * @return The size of dimension i\n */"} {"signature":"public operator fun set ( i : Int , value : Long )","body":"{ dims [ i ] = value }","docstring":"/**\n * Sets the value of a dimension\n *\n * @param i The index at which to retrieve a dimension.\n */"} {"signature":"private fun isKnown ( i : Int ) : Boolean","body":"{ return dims [ i ] != - }","docstring":"/**\n * Test whether dimension i in this shape is known\n *\n * @param [i] Target dimension to test\n * @return Whether dimension [i] is unknown (equal to -1)\n */"} {"signature":"public fun assertKnown ( i : Int )","body":"{ check ( isKnown ( i ) ) { \"\" } }","docstring":"/**\n * Throw an exception if dimension [i] is unknown.\n *\n * @param [i] Target dimension to test\n * @throws IllegalStateException if dimension [i] is unknown\n */"} {"signature":"public fun replace ( i : Int , dim : Long ) : TensorShape","body":"{ dims [ i ] = dim return this }","docstring":"/**\n * Replace dimension i with a new dimension size.\n *\n * @param i The target dimension to change.\n * @param dim The new dimension size.\n * @return The new changed TensorShape\n */"} {"signature":"public fun replaceLast ( dim : Long ) : TensorShape","body":"{ return replace ( dims . size - , dim ) }","docstring":"/**\n * Replace the last dimension with a new dimension size.\n *\n * @param dim New size for the last dimensions\n * @return The new changed TensorShape\n */"} {"signature":"public fun replaceFirst ( dim : Long ) : TensorShape","body":"{ return replace ( , dim ) }","docstring":"/**\n * Replace the first dimension with a new dimension size.\n *\n * @param dim New size for first dimension\n * @return The new changed TensorShape.\n */"} {"signature":"public fun size ( i : Int ) : Long","body":"{ return dims [ i ] }","docstring":"/**\n * Get the size of a target dimension.\n *\n * @param i Target dimension.\n * @return The size of dimension i\n */"} {"signature":"public fun concatenate ( vararg dims : Long ) : TensorShape","body":"{ this . dims = concatenate ( this . dims , * dims ) return this }","docstring":"/**\n * Augment this TensorShape by appending more dimensions to it.\n *\n * @param dims The new dimensions to incorporate\n * @return The new changed TensorShape\n */"} {"signature":"public fun head ( ) : Long","body":"{ return dims [ ] }","docstring":"/** Returns the head dimension. */"} {"signature":"public fun tail ( ) : LongArray","body":"{ return dims . copyOfRange ( , dims . size ) }","docstring":"/** Returns the tail dimension. */"} {"signature":"public fun clone ( ) : TensorShape","body":"{ return TensorShape ( dims ) }","docstring":"/** Makes a copy of TensorShape object. */"} {"signature":"public fun almostEqual ( tensorShape : TensorShape , except : Int ) : Boolean","body":"{ var almostEqual = true for ( i in until tensorShape . numDimensions ( ) ) { if ( i == except ) continue if ( this [ i ] != tensorShape [ i ] ) almostEqual = false } return almostEqual }","docstring":"/** Check the fact that two shapes has the same values at the same dimensions except one with index [except]. */"} {"signature":"public fun LongArray . head ( ) : Long","body":"= this [ ]","docstring":"/** Returns first dimension from all dimensions of this array. */"} {"signature":"public fun LongArray . tail ( ) : LongArray","body":"= copyOfRange ( , size )","docstring":"/** Returns last dimensions (except first) from this array. */"} {"signature":"public fun getDimsOfArray ( data : Array < * > ) : LongArray","body":"{ fun appendPrimitiveArraySize ( size : Int , acc : MutableList < Long > ) : LongArray { acc += size . toLong ( ) return acc . toLongArray ( ) } tailrec fun collectDims ( data : Array < * > , acc : MutableList < Long > ) : LongArray { val firstElem = data [ ] ? : return acc . toLongArray ( ) acc += data . size . toLong ( ) return when ( firstElem ) { is Array < * > -> collectDims ( firstElem , acc ) is BooleanArray -> appendPrimitiveArraySize ( firstElem . size , acc ) is ByteArray -> appendPrimitiveArraySize ( firstElem . size , acc ) is CharArray -> appendPrimitiveArraySize ( firstElem . size , acc ) is ShortArray -> appendPrimitiveArraySize ( firstElem . size , acc ) is IntArray -> appendPrimitiveArraySize ( firstElem . size , acc ) is LongArray -> appendPrimitiveArraySize ( firstElem . size , acc ) is FloatArray -> appendPrimitiveArraySize ( firstElem . size , acc ) is DoubleArray -> appendPrimitiveArraySize ( firstElem . size , acc ) else -> acc . toLongArray ( ) } } return collectDims ( data , mutableListOf ( ) ) }","docstring":"/**\n * Get shape of array of arrays (of arrays...) of Array of elements of any type.\n * If the most inner array does not have any elements its size is skipped in the result.\n */"} {"signature":"public fun IntArray . toTensorShape ( ) : TensorShape","body":"= TensorShape ( this . map ( Int :: toLong ) . toLongArray ( ) )","docstring":"/**\n * Wraps an IntArray to TensorShape.\n */"} {"signature":"@ Test @ DisplayName ( \"\" ) fun testSyncingIntoNonEmptyFile ( )","body":"{ val initialContent = mapOf ( \"\" to PropertyValue . Configured ( \"\" ) , \"\" to PropertyValue . Configured ( \"\" ) , ) fillInitialLocalPropertiesFile ( initialContent ) modifier . applySetup ( setupFile ) localPropertiesFile . propertiesFileContentAssertions { fileContents , properties -> assertContainsMarkersOnce ( fileContents ) val expectedProperties = setupFile . properties + initialContent . mapValues { it . value . value } assertEquals ( expectedProperties . size , properties . size ) for ( ( key , value ) in expectedProperties ) { assertEquals ( value , properties [ key ] ) } } }","docstring":"/**\n * Checks that a file like\n * ```\n * a=1\n * b=2\n * c=3\n * ```\n * is being transformed into\n * ```\n * a=1\n * b=2\n * c=3\n * #header\n * d=4\n * f=5\n * #footer\n * ```\n */"} {"signature":"@ Test @ DisplayName ( \"\" ) fun testSyncingDoesNotOverrideValues ( )","body":"{ val initialContent = mapOf ( \"\" to PropertyValue . Configured ( \"\" ) , \"\" to PropertyValue . Configured ( \"\" ) , \"\" to PropertyValue . Configured ( \"\" ) , ) fillInitialLocalPropertiesFile ( initialContent ) modifier . applySetup ( setupFile ) localPropertiesFile . propertiesFileContentAssertions { fileContents , properties -> assertContainsMarkersOnce ( fileContents ) val expectedProperties = setupFile . properties + initialContent . mapValues { it . value . value } assertEquals ( expectedProperties . size , properties . size ) for ( ( key , value ) in expectedProperties ) { assertEquals ( value , properties [ key ] ) } assertContainsExactTimes ( fileContents , \"\" , ) } }","docstring":"/**\n * Checks that a file like\n * ```\n * a=1\n * b=2\n * f=3\n * ```\n * is being transformed into\n * ```\n * a=1\n * b=2\n * c=3\n * #header\n * d=4\n * #footer\n * ```\n */"} {"signature":"@ Test @ DisplayName ( \"\" ) fun testSyncingOverrideAutomaticallySetValues ( )","body":"{ val initialContent = mapOf ( \"\" to PropertyValue . Configured ( \"\" ) , \"\" to PropertyValue . Configured ( \"\" ) , \"\" to PropertyValue . Configured ( \"\" ) , ) fillInitialLocalPropertiesFile ( initialContent ) modifier . applySetup ( setupFile ) val newProperties = mapOf ( \"\" to PropertyValue . Configured ( \"\" ) , \"\" to PropertyValue . Configured ( \"\" ) , ) fillInitialLocalPropertiesFile ( newProperties ) val anotherSetupFile = SetupFile ( mapOf ( \"\" to \"\" , \"\" to \"\" , \"\" to \"\" , ) ) modifier . applySetup ( anotherSetupFile ) localPropertiesFile . propertiesFileContentAssertions { fileContents , properties -> assertContainsMarkersOnce ( fileContents ) val expectedProperties = anotherSetupFile . properties + initialContent . mapValues { it . value . value } + newProperties . mapValues { it . value . value } assertEquals ( expectedProperties . size , properties . size ) for ( ( key , value ) in expectedProperties ) { assertEquals ( value , properties [ key ] ) } } }","docstring":"/**\n * Checks that a file like\n * ```\n * a=1\n * b=2\n * c=3\n * #header\n * d=4\n * #footer\n * e=5\n * ```\n * is being transformed into\n * ```\n * a=1\n * b=2\n * c=3\n * e=5\n * #header\n * d=10\n * #footer\n * ```\n */"} {"signature":"private fun appendImports ( rawImports : String ) : Boolean","body":"{ if ( rawImports . isEmpty ( ) ) { return false } var hasNewImports = false for ( rawImport in rawImports . split ( IMPORT_SEPARATOR ) ) { val importDirectiveString = if ( rawImport . startsWith ( \"\" ) ) rawImport else \"\" if ( importDirectiveStrings . add ( importDirectiveString ) && ! hasNewImports ) { hasNewImports = true } } return hasNewImports }","docstring":"/**\n * Parses raw [rawImports] and appends them to the list of code fragment imports.\n *\n * Import strings must be separated by the [IMPORT_SEPARATOR].\n * Each import must be either a qualified name to import (e.g., 'foo.bar'), or a complete text representation of an import directive\n * (e.g., 'import foo.bar as baz').\n *\n * Note that already present import directives will be ignored.\n *\n * @return `true` if new import directives were added.\n */"} {"signature":"fun main ( )","body":"{ val modelHub = ONNXModelHub ( cacheDirectory = File ( \"\" ) ) val model = ONNXModels . ObjectDetection . SSDMobileNetV1 . 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":"public abstract fun nextByte ( ) : Byte","body":"public abstract fun nextByte ( ) : Byte","docstring":"/** Returns the next value in the sequence without boxing. */"} {"signature":"public abstract fun nextChar ( ) : Char","body":"public abstract fun nextChar ( ) : Char","docstring":"/** Returns the next value in the sequence without boxing. */"} {"signature":"public abstract fun nextShort ( ) : Short","body":"public abstract fun nextShort ( ) : Short","docstring":"/** Returns the next value in the sequence without boxing. */"} {"signature":"public abstract fun nextInt ( ) : Int","body":"public abstract fun nextInt ( ) : Int","docstring":"/** Returns the next value in the sequence without boxing. */"} {"signature":"public abstract fun nextLong ( ) : Long","body":"public abstract fun nextLong ( ) : Long","docstring":"/** Returns the next value in the sequence without boxing. */"} {"signature":"public abstract fun nextFloat ( ) : Float","body":"public abstract fun nextFloat ( ) : Float","docstring":"/** Returns the next value in the sequence without boxing. */"} {"signature":"public abstract fun nextDouble ( ) : Double","body":"public abstract fun nextDouble ( ) : Double","docstring":"/** Returns the next value in the sequence without boxing. */"} {"signature":"public abstract fun nextBoolean ( ) : Boolean","body":"public abstract fun nextBoolean ( ) : Boolean","docstring":"/** Returns the next value in the sequence without boxing. */"} {"signature":"fun skipElement ( )","body":"{ val lengthStack = mutableListOf < Int > ( ) skipOverTags ( ) do { if ( isEof ( ) ) throw CborDecodingException ( \"\" ) if ( isIndefinite ( ) ) { lengthStack . add ( LENGTH_STACK_INDEFINITE ) } else if ( isEnd ( ) ) { if ( lengthStack . removeLastOrNull ( ) != LENGTH_STACK_INDEFINITE ) throw CborDecodingException ( \"\" , curByte ) prune ( lengthStack ) } else { val header = curByte and val length = elementLength ( ) if ( header == HEADER_ARRAY || header == HEADER_MAP ) { if ( length > ) lengthStack . add ( length ) skipOverTags ( ) } else { input . skip ( length ) prune ( lengthStack ) } } readByte ( ) } while ( lengthStack . isNotEmpty ( ) ) }","docstring":"/**\n * Skips the current value element. Bytes are processed to determine the element type (and corresponding length), to\n * determine how many bytes to skip.\n *\n * For primitive (finite length) elements (e.g. unsigned integer, text string), their length is read and\n * corresponding number of bytes are skipped.\n *\n * For elements that contain children (e.g. array, map), the child count is read and added to a \"length stack\"\n * (which represents the \"number of elements\" at each depth of the CBOR data structure). When a child element has\n * been skipped, the \"length stack\" is [pruned][prune]. For indefinite length elements, a special marker is added to\n * the \"length stack\" which is only popped from the \"length stack\" when a CBOR [break][isEnd] is encountered.\n */"} {"signature":"private fun prune ( lengthStack : MutableList < Int > )","body":"{ for ( i in lengthStack . lastIndex downTo ) { when ( lengthStack [ i ] ) { LENGTH_STACK_INDEFINITE -> break -> lengthStack . removeAt ( i ) else -> { lengthStack [ i ] = lengthStack [ i ] - break } } } }","docstring":"/**\n * Removes an item from the top of the [lengthStack], cascading the removal if the item represents the last item\n * (i.e. a length value of `1`) at its stack depth.\n *\n * For example, pruning a [lengthStack] of `[3, 2, 1, 1]` would result in `[3, 1]`.\n */"} {"signature":"private fun isIndefinite ( ) : Boolean","body":"{ val majorType = curByte and val value = curByte and return value == ADDITIONAL_INFORMATION_INDEFINITE_LENGTH && ( majorType == HEADER_ARRAY || majorType == HEADER_MAP || majorType == HEADER_BYTE_STRING . toInt ( ) || majorType == HEADER_STRING . toInt ( ) ) }","docstring":"/**\n * Determines if [curByte] represents an indefinite length CBOR item.\n *\n * Per [RFC 7049: 2.2. Indefinite Lengths for Some Major Types](https://tools.ietf.org/html/rfc7049#section-2.2):\n * > Four CBOR items (arrays, maps, byte strings, and text strings) can be encoded with an indefinite length\n */"} {"signature":"private fun elementLength ( ) : Int","body":"{ val majorType = curByte and val additionalInformation = curByte and return when ( majorType ) { HEADER_BYTE_STRING . toInt ( ) , HEADER_STRING . toInt ( ) , HEADER_ARRAY -> readNumber ( ) . toInt ( ) HEADER_MAP -> readNumber ( ) . toInt ( ) * else -> when ( additionalInformation ) { -> -> -> -> else -> } } }","docstring":"/**\n * Determines the length of the CBOR item represented by [curByte]; length has specific meaning based on the type:\n *\n * | Major type | Length represents number of... |\n * |---------------------|--------------------------------|\n * | 0. unsigned integer | bytes |\n * | 1. negative integer | bytes |\n * | 2. byte string | bytes |\n * | 3. string | bytes |\n * | 4. array | data items (values) |\n * | 5. map | sub-items (keys + values) |\n * | 6. tag | bytes |\n */"} {"signature":"private fun readIndefiniteLengthBytes ( ) : ByteArray","body":"{ val byteStrings = mutableListOf < ByteArray > ( ) do { byteStrings . add ( readBytes ( ) ) readByte ( ) } while ( ! isEnd ( ) ) return byteStrings . flatten ( ) }","docstring":"/**\n * Indefinite-length byte sequences contain an unknown number of fixed-length byte sequences (chunks).\n *\n * @return [ByteArray] containing all of the concatenated bytes found in the buffer.\n */"} {"signature":"private fun MemScope . readHistoricDataFromRegistry ( tzHKey : HKEY ) : List < Pair < Int , PerYearZoneRulesData > >","body":"{ return withRegistryKey ( tzHKey , \"\" , { emptyList ( ) } ) { dynDstHKey -> val firstEntry = getRegistryValue < DWORDVar > ( dynDstHKey , \"\" ) . value . toInt ( ) val lastEntry = getRegistryValue < DWORDVar > ( dynDstHKey , \"\" ) . value . toInt ( ) ( firstEntry .. lastEntry ) . map { year -> year to getRegistryValue < REG_TZI_FORMAT > ( dynDstHKey , year . toString ( ) ) . toZoneRules ( ) } } }","docstring":"/**\n * Reads the historic data in the \"Dynamic DST\" subkey, if present.\n *\n * [tzHKey] is an open registry key pointing to the timezone record.\n *\n * Returns pairs of years and the corresponding rules in effect for those years.\n *\n * @throws IllegalStateException if the 'Dynamic DST' key is present but malformed.\n */"} {"signature":"fun createInstanceFromBox ( scope : IrBlockBuilder , typeArguments : TypeArguments , receiver : IrExpression ? , accessType : AccessType , saveVariable : ( IrVariable ) -> Unit , ) : ReceiverBasedMfvcNodeInstance","body":"fun createInstanceFromBox ( scope : IrBlockBuilder , typeArguments : TypeArguments , receiver : IrExpression ? , accessType : AccessType , saveVariable : ( IrVariable ) -> Unit , ) : ReceiverBasedMfvcNodeInstance","docstring":"/**\n * Create instance-specific [ReceiverBasedMfvcNodeInstance] from instance-agnostic [MfvcNode] using a boxed [receiver] as data source.\n */"} {"signature":"fun MfvcNode . createInstanceFromBox ( scope : IrBlockBuilder , receiver : IrExpression , accessType : AccessType , saveVariable : ( IrVariable ) -> Unit )","body":"= createInstanceFromBox ( scope , makeTypeArgumentsFromType ( receiver . type as IrSimpleType ) , receiver , accessType , saveVariable )","docstring":"/**\n * Create instance-specific [ReceiverBasedMfvcNodeInstance] from instance-agnostic [MfvcNode] using a boxed [receiver] as data source.\n */"} {"signature":"fun MfvcNode . createInstanceFromValueDeclarationsAndBoxType ( scope : IrBuilderWithScope , type : IrSimpleType , name : Name , saveVariable : ( IrVariable ) -> Unit , isVar : Boolean , origin : IrDeclarationOrigin , ) : ValueDeclarationMfvcNodeInstance","body":"= createInstanceFromValueDeclarations ( scope , makeTypeArgumentsFromType ( type ) , name , saveVariable , isVar , origin )","docstring":"/**\n * Create instance-specific [ValueDeclarationMfvcNodeInstance] from instance-agnostic [MfvcNode] using new flattened variables as data source.\n */"} {"signature":"fun MfvcNode . createInstanceFromValueDeclarations ( scope : IrBuilderWithScope , typeArguments : TypeArguments , name : Name , saveVariable : ( IrVariable ) -> Unit , isVar : Boolean , origin : IrDeclarationOrigin , ) : ValueDeclarationMfvcNodeInstance","body":"{ val valueDeclarations = mapLeaves { scope . savableStandaloneVariable ( type = it . type , name = listOf ( name , it . fullFieldName ) . joinToString ( \"\" ) , origin = origin , saveVariable = saveVariable , isVar = isVar , ) } return ValueDeclarationMfvcNodeInstance ( this , typeArguments , valueDeclarations ) }","docstring":"/**\n * Create instance-specific [ValueDeclarationMfvcNodeInstance] from instance-agnostic [MfvcNode] using new flattened variables as data source.\n */"} {"signature":"fun MfvcNode . createInstanceFromValueDeclarationsAndBoxType ( type : IrSimpleType , fieldValues : List < IrValueDeclaration > ) : ValueDeclarationMfvcNodeInstance","body":"= ValueDeclarationMfvcNodeInstance ( this , makeTypeArgumentsFromType ( type ) , fieldValues )","docstring":"/**\n * Create instance-specific [ValueDeclarationMfvcNodeInstance] from instance-agnostic [MfvcNode] using flattened [fieldValues] as data source.\n */"} {"signature":"operator fun get ( name : Name ) : NameableMfvcNode ?","body":"= mapping [ name ]","docstring":"/**\n * Get child by [name].\n */"} {"signature":"fun MfvcNodeWithSubnodes . makeBoxedExpression ( scope : IrBuilderWithScope , typeArguments : TypeArguments , valueArguments : List < IrExpression > , registerPossibleExtraBoxCreation : ( ) -> Unit , ) : IrExpression","body":"= scope . irCall ( boxMethod ) . apply { val resultType = type . substitute ( typeArguments ) as IrSimpleType require ( resultType . erasedUpperBound == type . erasedUpperBound ) { \"\" } for ( ( index , typeArgument ) in resultType . arguments . withIndex ( ) ) { putTypeArgument ( index , typeArgument . typeOrNull ? : resultType . erasedUpperBound . typeParameters [ index ] . defaultType ) } for ( ( index , valueArgument ) in valueArguments . withIndex ( ) ) { putValueArgument ( index , valueArgument ) } registerPossibleExtraBoxCreation ( ) }","docstring":"/**\n * Creates a box expression for the given [MfvcNodeWithSubnodes] by calling box methods with the given [typeArguments] and [valueArguments].\n */"} {"signature":"operator fun MfvcNodeWithSubnodes . get ( names : List < Name > ) : MfvcNode ?","body":"{ var cur : MfvcNode = this for ( name in names ) { cur = ( cur as? MfvcNodeWithSubnodes ) ? . get ( name ) ? : return null } return cur }","docstring":"/**\n * A shortcut to get children by name several times.\n */"} {"signature":"public actual inline fun < reified T > Array < out T > ? . orEmpty ( ) : Array < out T >","body":"= this ? : emptyArray < T > ( )","docstring":"/**\n * Returns the array if it's not `null`, or an empty array otherwise.\n * @sample samples.collections.Arrays.Usage.arrayOrEmpty\n */"} {"signature":"@ kotlin . internal . InlineOnly public inline fun ByteArray . toString ( charset : Charset ) : String","body":"= String ( this , charset )","docstring":"/**\n * Converts the contents of this byte array to a string using the specified [charset].\n * @sample samples.text.Strings.stringToByteArray\n */"} {"signature":"@ Suppress ( \"\" ) public actual inline fun < reified T > Collection < T > . toTypedArray ( ) : Array < T >","body":"{ @ Suppress ( \"\" ) val thisCollection = this as java . util . Collection < T > return thisCollection . toArray ( arrayOfNulls < T > ( ) ) as Array < T > }","docstring":"/**\n * Returns a *typed* array containing all the elements of this collection.\n *\n * Allocates an array of runtime type `T` having its size equal to the size of this collection\n * and populates the array with the elements of this collection.\n * @sample samples.collections.Collections.Collections.collectionToTypedArray\n */"} {"signature":"internal actual fun < T > arrayOfNulls ( reference : Array < T > , size : Int ) : Array < T >","body":"{ @ Suppress ( \"\" ) return java . lang . reflect . Array . newInstance ( reference . javaClass . componentType , size ) as Array < T > }","docstring":"/** Internal unsafe construction of array based on reference array type */"} {"signature":"public abstract fun convertSqlTypeToColumnSchemaValue ( tableColumnMetadata : TableColumnMetadata ) : ColumnSchema ?","body":"public abstract fun convertSqlTypeToColumnSchemaValue ( tableColumnMetadata : TableColumnMetadata ) : ColumnSchema ?","docstring":"/**\n * Returns a [ColumnSchema] produced from [tableColumnMetadata].\n */"} {"signature":"public abstract fun isSystemTable ( tableMetadata : TableMetadata ) : Boolean","body":"public abstract fun isSystemTable ( tableMetadata : TableMetadata ) : Boolean","docstring":"/**\n * Checks if the given table name is a system table for the specified database type.\n *\n * @param [tableMetadata] the table object representing the table from the database.\n * @param [dbType] the database type to check against.\n * @return True if the table is a system table for the specified database type, false otherwise.\n */"} {"signature":"public abstract fun buildTableMetadata ( tables : ResultSet ) : TableMetadata","body":"public abstract fun buildTableMetadata ( tables : ResultSet ) : TableMetadata","docstring":"/**\n * Builds the table metadata based on the database type and the ResultSet from the query.\n *\n * @param [tables] the ResultSet containing the table's meta-information.\n * @return the TableMetadata object representing the table metadata.\n */"} {"signature":"public abstract fun convertSqlTypeToKType ( tableColumnMetadata : TableColumnMetadata ) : KType ?","body":"public abstract fun convertSqlTypeToKType ( tableColumnMetadata : TableColumnMetadata ) : KType ?","docstring":"/**\n * Converts SQL data type to a Kotlin data type.\n *\n * @param [tableColumnMetadata] The metadata of the table column.\n * @return The corresponding Kotlin data type, or null if no mapping is found.\n */"} {"signature":"fun toLocalDate ( year : Int ) : LocalDate","body":"fun toLocalDate ( year : Int ) : LocalDate","docstring":"/**\n * Converts this date-time to an [Instant] in the given [year],\n * using the knowledge of the offset that's in effect at the resulting date-time.\n */"} {"signature":"internal fun JulianDayOfYearSkippingLeapDate ( dayOfYear : Int ) : DateOfYear","body":"{ require ( dayOfYear in .. ) { \"\" } val date = LocalDate ( , , ) . plusDays ( dayOfYear - ) return MonthDayOfYear ( date . month , MonthDayOfYear . TransitionDay . ExactlyDayOfMonth ( date . dayOfMonth ) ) }","docstring":"/**\n * The day of year, in the 1..365 range. During leap years, 29th February is skipped.\n */"} {"signature":"fun Nth ( dayOfWeek : DayOfWeek , n : Int ) : TransitionDay","body":"= First ( dayOfWeek , ( n - ) * + )","docstring":"/**\n * The [n]th given [dayOfWeek] in the month.\n */"} {"signature":"fun toInstant ( year : Int , effectiveOffset : UtcOffset ) : Instant","body":"{ val localDateTime = time . resolve ( date . toLocalDate ( year ) ) return when ( this . offset ) { is OffsetResolver . WallClockOffset -> localDateTime . toInstant ( effectiveOffset ) is OffsetResolver . FixedOffset -> localDateTime . toInstant ( this . offset . offset ) } }","docstring":"/**\n * Converts this [MonthDayTime] to an [Instant] in the given [year],\n * using the knowledge of the offset that's in effect at the resulting date-time.\n */"} {"signature":"@ kotlin . jvm . JvmName ( \"\" ) @ PublishedApi internal fun < K , V > Map < K , V > . getOrImplicitDefault ( key : K ) : V","body":"{ if ( this is MapWithDefault ) return this . getOrImplicitDefault ( key ) return getOrElseNullable ( key , { throw NoSuchElementException ( \"\" ) } ) }","docstring":"/**\n * Returns the value for the given key, or the implicit default value for this map.\n * By default no implicit value is provided for maps and a [NoSuchElementException] is thrown.\n * To create a map with implicit default value use [withDefault] method.\n *\n * @throws NoSuchElementException when the map doesn't contain a value for the specified key and no implicit default was provided for that map.\n */"} {"signature":"public fun < K , V > Map < K , V > . withDefault ( defaultValue : ( key : K ) -> V ) : Map < K , V >","body":"= when ( this ) { is MapWithDefault -> this . map . withDefault ( defaultValue ) else -> MapWithDefaultImpl ( this , defaultValue ) }","docstring":"/**\n * Returns a wrapper of this read-only map, having the implicit default value provided with the specified function [defaultValue].\n *\n * This implicit default value is used when the original map doesn't contain a value for the key specified\n * and a value is obtained with [Map.getValue] function, for example when properties are delegated to the map.\n *\n * When this map already has an implicit default value provided with a former call to [withDefault], it is being replaced by this call.\n */"} {"signature":"@ kotlin . jvm . JvmName ( \"\" ) public fun < K , V > MutableMap < K , V > . withDefault ( defaultValue : ( key : K ) -> V ) : MutableMap < K , V >","body":"= when ( this ) { is MutableMapWithDefault -> this . map . withDefault ( defaultValue ) else -> MutableMapWithDefaultImpl ( this , defaultValue ) }","docstring":"/**\n * Returns a wrapper of this mutable map, having the implicit default value provided with the specified function [defaultValue].\n *\n * This implicit default value is used when the original map doesn't contain a value for the key specified\n * and a value is obtained with [Map.getValue] function, for example when properties are delegated to the map.\n *\n * When this map already has an implicit default value provided with a former call to [withDefault], it is being replaced by this call.\n */"} {"signature":"public fun < T : HttpClientEngineConfig > NotebookHttpClient ( engineFactory : HttpClientEngineFactory < T > , block : HttpClientConfig < T > . ( ) -> Unit = { } ) : NotebookHttpClient","body":"= NotebookHttpClient ( HttpClient ( engineFactory , block ) )","docstring":"/**\n * Creates an asynchronous [NotebookHttpClient] with the specified [HttpClientEngineFactory] and optional [block]\n * configuration.\n * Note that a specific platform may require a specific engine for processing requests.\n * You can learn more about available engines from [Engines](https://ktor.io/docs/http-client-engines.html).\n */"} {"signature":"public fun NotebookHttpClient . config ( block : HttpClientConfig < * > . ( ) -> Unit ) : NotebookHttpClient","body":"{ return NotebookHttpClient ( ktorClient . config ( block ) ) }","docstring":"/**\n * Returns a new [NotebookHttpClient] by copying this client's configuration\n * and additionally configured by the [block] parameter.\n */"} {"signature":"fun getReplacementFunction ( function : IrFunction )","body":"= getReplacementFunctionImpl ( function )","docstring":"/**\n * Get a replacement for a function or a constructor.\n */"} {"signature":"fun efficientNetB0EasyPrediction ( )","body":"{ val modelHub = ONNXModelHub ( cacheDirectory = File ( \"\" ) ) val model = ONNXModels . CV . EfficientNetB0 . pretrainedModel ( modelHub ) model . printSummary ( ) model . use { for ( i in .. ) { val imageFile = getFileFromResource ( \"\" ) val recognizedObject = it . predictObject ( imageFile = imageFile ) println ( recognizedObject ) val top5 = it . predictTopKObjects ( imageFile = imageFile , topK = ) println ( top5 . toString ( ) ) } } }","docstring":"/**\n * This examples demonstrates the light-weight inference API with [ImageRecognitionModel] on EfficientNetB0 model:\n * - Model is obtained from [ONNXModelHub].\n * - Model predicts on a few images located in resources.\n */"} {"signature":"fun main ( ) : Unit","body":"= efficientNetB0EasyPrediction ( )","docstring":"/** */"} {"signature":"private fun FirNamedReference . getCorrespondingTypeIfPossible ( ) : ConeKotlinType ?","body":"= findOuterPropertyAccessExpression ( ) ? . resolvedType","docstring":"/**\n * It only makes sense to provide type for the references which reference some actual properties/variables.\n *\n * In cases when the name reference references a function (a REAL function, not a functional type variable), it does not\n * make sense to provide any type for it.\n *\n * ---\n *\n * Why not just always provide null for name references? In such case, the following case would be a problem:\n *\n * ```kt\n * fun usage(action: String.(Int) -> String) {\n * \"hello\".action(10)\n * }\n * ```\n *\n * The user might want to know the type of the `action` callback. If we always return null for the named references,\n * we won't be able to handle this request, and just return null. So the user will only be able to see the type\n * of the whole expression instead, and that is not what he wants.\n */"} {"signature":"private fun FirNamedReference . findOuterPropertyAccessExpression ( ) : FirExpression ?","body":"{ val referenceExpression = psi as? KtExpression ? : return null val outerExpression = referenceExpression . getOutermostParenthesizerOrThis ( ) . parent as? KtElement ? : return null return when ( val outerFirElement = outerExpression . getOrBuildFir ( firResolveSession ) ) { is FirVariableAssignment -> outerFirElement . lValue is FirPropertyAccessExpression -> outerFirElement is FirImplicitInvokeCall -> outerFirElement . explicitReceiver is FirSafeCallExpression -> { if ( outerFirElement . selector is FirPropertyAccessExpression ) outerFirElement else null } else -> null } }","docstring":"/**\n * Finds an outer expression for [this] named reference in cases when it is a part of a property access.\n *\n * Otherwise, return null.\n */"} {"signature":"private fun getExpectedTypeOfIndexingParameter ( expression : PsiElement ) : KtType ?","body":"{ val arrayAccessExpression = expression . unwrapQualified < KtArrayAccessExpression > { arrayAccessExpression , currentExpression -> currentExpression in arrayAccessExpression . indexExpressions } ? : return null val firCall = arrayAccessExpression . getOrBuildFirSafe < FirFunctionCall > ( firResolveSession ) ? : return null val firArgument = firCall . argumentList . arguments . firstOrNull { it . psi == expression } ? : return null val argumentsToParameters = firCall . argumentsToSubstitutedValueParameters ( substituteWithErrorTypes = false ) ? : return null return argumentsToParameters [ firArgument ] ? . substitutedType ? . asKtType ( ) }","docstring":"/**\n * Expected type of the indexing parameter in array access, for example, in the following code:\n * ```\n * val map = mapOf()\n * map[k] = v\n * ```\n * `k` is indexing parameter and its expected type is `Int`.\n */"} {"signature":"public fun < T > Flow < T > . drop ( count : Int ) : Flow < T >","body":"{ require ( count >= ) { \"\" } return flow { var skipped = collect { value -> if ( skipped >= count ) emit ( value ) else ++ skipped } } }","docstring":"/**\n * Returns a flow that ignores first [count] elements.\n * Throws [IllegalArgumentException] if [count] is negative.\n */"} {"signature":"public fun < T > Flow < T > . dropWhile ( predicate : suspend ( T ) -> Boolean ) : Flow < T >","body":"= flow { var matched = false collect { value -> if ( matched ) { emit ( value ) } else if ( ! predicate ( value ) ) { matched = true emit ( value ) } } }","docstring":"/**\n * Returns a flow containing all elements except first elements that satisfy the given predicate.\n */"} {"signature":"public fun < T > Flow < T > . take ( count : Int ) : Flow < T >","body":"{ require ( count > ) { \"\" } return flow { val ownershipMarker = Any ( ) var consumed = try { collect { value -> if ( ++ consumed < count ) { return@collect emit ( value ) } else { return@collect emitAbort ( value , ownershipMarker ) } } } catch ( e : AbortFlowException ) { e . checkOwnership ( owner = ownershipMarker ) } } }","docstring":"/**\n * Returns a flow that contains first [count] elements.\n * When [count] elements are consumed, the original flow is cancelled.\n * Throws [IllegalArgumentException] if [count] is not positive.\n */"} {"signature":"public fun < T > Flow < T > . takeWhile ( predicate : suspend ( T ) -> Boolean ) : Flow < T >","body":"= flow { return@flow collectWhile { value -> if ( predicate ( value ) ) { emit ( value ) true } else { false } } }","docstring":"/**\n * Returns a flow that contains first elements satisfying the given [predicate].\n *\n * Note, that the resulting flow does not contain the element on which the [predicate] returned `false`.\n * See [transformWhile] for a more flexible operator.\n */"} {"signature":"public fun < T , R > Flow < T > . transformWhile ( @ BuilderInference transform : suspend FlowCollector < R > . ( value : T ) -> Boolean ) : Flow < R >","body":"= safeFlow { return@safeFlow collectWhile { value -> transform ( value ) } }","docstring":"/**\n * Applies [transform] function to each value of the given flow while this\n * function returns `true`.\n *\n * The receiver of the `transformWhile` is [FlowCollector] and thus `transformWhile` is a\n * flexible function that may transform emitted element, skip it or emit it multiple times.\n *\n * This operator generalizes [takeWhile] and can be used as a building block for other operators.\n * For example, a flow of download progress messages can be completed when the\n * download is done but emit this last message (unlike `takeWhile`):\n *\n * ```\n * fun Flow.completeWhenDone(): Flow =\n * transformWhile { progress ->\n * emit(progress) // always emit progress\n * !progress.isDone() // continue while download is not done\n * }\n * ```\n */"} {"signature":"@ Deprecated ( \"\" , ReplaceWith ( \"\" ) ) public fun FlowContent . buildBreakableDotSeparatedHtml ( name : String )","body":"{ buildBreakableCharSeparatedHtml ( name , '' ) }","docstring":"/**\n * Makes [name] breakable by inserting `` element after each occurrence of `.`.\n */"} {"signature":"public fun FlowContent . buildBreakableCharSeparatedHtml ( name : String , breakableChar : Char )","body":"{ val phrases = name . split ( breakableChar ) phrases . forEachIndexed { i , e -> val elementWithOptionalChar = e . takeIf { i == phrases . lastIndex } ? : \"\" if ( e . length > ) { buildTextBreakableAfterCapitalLetters ( elementWithOptionalChar , hasLastElement = i == phrases . lastIndex ) } else { buildBreakableHtmlElement ( elementWithOptionalChar , i == phrases . lastIndex ) } } }","docstring":"/**\n * Makes [name] breakable by inserting `` element after each occurrence of [breakableChar].\n */"} {"signature":"public fun < C > colGroup ( colGroup : ColumnAccessor < DataRow < C > > ) : ColumnAccessor < DataRow < C > >","body":"= colGroup . ensureIsColumnGroup ( )","docstring":"/**\n * @include [ColGroupReferenceDocs] {@set [CommonColGroupDocs.ReceiverArg]}\n */"} {"signature":"public fun < C > SingleColumn < DataRow < * > > . colGroup ( colGroup : ColumnAccessor < DataRow < C > > ) : SingleColumn < DataRow < C > >","body":"= this . ensureIsColumnGroup ( ) . transformSingle { val child = it . getCol ( colGroup ) ? : throw IllegalStateException ( \"\" ) child . data . ensureIsColumnGroup ( ) listOf ( child ) } . singleImpl ( )","docstring":"/**\n * @include [ColGroupReferenceDocs] {@set [CommonColGroupDocs.ReceiverArg] myColumnGroup.}\n */"} {"signature":"public fun < C > AnyColumnGroupAccessor . colGroup ( colGroup : ColumnAccessor < DataRow < C > > ) : ColumnAccessor < DataRow < C > >","body":"= this . ensureIsColumnGroup ( ) . columnGroup < C > ( colGroup . path ( ) ) . ensureIsColumnGroup ( )","docstring":"/**\n * @include [ColGroupReferenceDocs] {@set [CommonColGroupDocs.ReceiverArg] myColumnGroup.}\n */"} {"signature":"public fun < C > String . colGroup ( colGroup : ColumnAccessor < DataRow < C > > ) : ColumnAccessor < DataRow < C > >","body":"= columnGroup ( this ) . ensureIsColumnGroup ( ) . columnGroup < C > ( colGroup . path ( ) ) . ensureIsColumnGroup ( )","docstring":"/**\n * @include [ColGroupReferenceDocs] {@set [CommonColGroupDocs.ReceiverArg] \"myColumnGroup\".}\n */"} {"signature":"public fun < C > KProperty < * > . colGroup ( colGroup : ColumnAccessor < DataRow < C > > ) : ColumnAccessor < DataRow < C > >","body":"= columnGroup ( this ) . ensureIsColumnGroup ( ) . columnGroup < C > ( colGroup . path ( ) ) . ensureIsColumnGroup ( )","docstring":"/**\n * @include [ColGroupReferenceDocs] {@set [CommonColGroupDocs.ReceiverArg] Type::myColumnGroup.}\n */"} {"signature":"public fun < C > ColumnPath . colGroup ( colGroup : ColumnAccessor < DataRow < C > > ) : ColumnAccessor < DataRow < C > >","body":"= columnGroup ( this ) . ensureIsColumnGroup ( ) . columnGroup < C > ( colGroup . path ( ) ) . ensureIsColumnGroup ( )","docstring":"/**\n * @include [ColGroupReferenceDocs] {@set [CommonColGroupDocs.ReceiverArg] \"pathTo\"[\"myColumnGroup\"].}\n */"} {"signature":"@ Suppress ( \"\" ) @ JvmName ( \"\" ) public fun colGroup ( name : String ) : ColumnAccessor < DataRow < * > >","body":"= columnGroup < Any ? > ( name ) . ensureIsColumnGroup ( )","docstring":"/**\n * @include [ColGroupNameDocs] {@set [CommonColGroupDocs.ReceiverArg]}\n */"} {"signature":"public fun < C > colGroup ( name : String ) : ColumnAccessor < DataRow < C > >","body":"= columnGroup < C > ( name ) . ensureIsColumnGroup ( )","docstring":"/**\n * @include [ColGroupNameDocs] {@set [CommonColGroupDocs.ReceiverArg]}\n * @include [CommonColGroupDocs.ColumnGroupTypeParam]\n */"} {"signature":"@ Suppress ( \"\" ) @ JvmName ( \"\" ) public fun SingleColumn < DataRow < * > > . colGroup ( name : String ) : SingleColumn < DataRow < * > >","body":"= colGroup < Any ? > ( name )","docstring":"/**\n * @include [ColGroupNameDocs] {@set [CommonColGroupDocs.ReceiverArg] myColumnGroup.}\n */"} {"signature":"public fun < C > SingleColumn < DataRow < * > > . colGroup ( name : String ) : SingleColumn < DataRow < C > >","body":"= this . ensureIsColumnGroup ( ) . transformSingle { val child = it . getCol ( name ) ? . cast < DataRow < C > > ( ) ? : throw IllegalStateException ( \"\" ) child . data . ensureIsColumnGroup ( ) listOf ( child ) } . singleImpl ( )","docstring":"/**\n * @include [ColGroupNameDocs] {@set [CommonColGroupDocs.ReceiverArg] myColumnGroup.}\n * @include [CommonColGroupDocs.ColumnGroupTypeParam]\n */"} {"signature":"@ Suppress ( \"\" ) @ JvmName ( \"\" ) public fun AnyColumnGroupAccessor . colGroup ( name : String ) : ColumnAccessor < DataRow < * > >","body":"= colGroup < Any ? > ( name )","docstring":"/**\n * @include [ColGroupNameDocs] {@set [CommonColGroupDocs.ReceiverArg] myColumnGroup.}\n */"} {"signature":"public fun < C > AnyColumnGroupAccessor . colGroup ( name : String ) : ColumnAccessor < DataRow < C > >","body":"= this . ensureIsColumnGroup ( ) . columnGroup < C > ( name ) . ensureIsColumnGroup ( )","docstring":"/**\n * @include [ColGroupNameDocs] {@set [CommonColGroupDocs.ReceiverArg] myColumnGroup.}\n * @include [CommonColGroupDocs.ColumnGroupTypeParam]\n */"} {"signature":"@ Suppress ( \"\" ) @ JvmName ( \"\" ) public fun String . colGroup ( name : String ) : ColumnAccessor < DataRow < * > >","body":"= colGroup < Any ? > ( name )","docstring":"/**\n * @include [ColGroupNameDocs] {@set [CommonColGroupDocs.ReceiverArg] \"myColumnGroup\".}\n */"} {"signature":"public fun < C > String . colGroup ( name : String ) : ColumnAccessor < DataRow < C > >","body":"= columnGroup ( this ) . ensureIsColumnGroup ( ) . columnGroup < C > ( name ) . ensureIsColumnGroup ( )","docstring":"/**\n * @include [ColGroupNameDocs] {@set [CommonColGroupDocs.ReceiverArg] \"myColumnGroup\".}\n * @include [CommonColGroupDocs.ColumnGroupTypeParam]\n */"} {"signature":"@ Suppress ( \"\" ) @ JvmName ( \"\" ) public fun KProperty < * > . colGroup ( name : String ) : ColumnAccessor < DataRow < * > >","body":"= colGroup < Any ? > ( name )","docstring":"/**\n * @include [ColGroupNameDocs] {@set [CommonColGroupDocs.ReceiverArg] Type::myColumnGroup.}\n */"} {"signature":"public fun < C > KProperty < * > . colGroup ( name : String ) : ColumnAccessor < DataRow < C > >","body":"= columnGroup ( this ) . ensureIsColumnGroup ( ) . columnGroup < C > ( name ) . ensureIsColumnGroup ( )","docstring":"/**\n * @include [ColGroupNameDocs] {@set [CommonColGroupDocs.ReceiverArg] Type::myColumnGroup.}\n * @include [CommonColGroupDocs.ColumnGroupTypeParam]\n */"} {"signature":"@ Suppress ( \"\" ) @ JvmName ( \"\" ) public fun ColumnPath . colGroup ( name : String ) : ColumnAccessor < DataRow < * > >","body":"= colGroup < Any ? > ( name )","docstring":"/**\n * @include [ColGroupNameDocs] {@set [CommonColGroupDocs.ReceiverArg] \"pathTo\"[\"myColumnGroup\"].}\n */"} {"signature":"public fun < C > ColumnPath . colGroup ( name : String ) : ColumnAccessor < DataRow < C > >","body":"= columnGroup ( this ) . ensureIsColumnGroup ( ) . columnGroup < C > ( name ) . ensureIsColumnGroup ( )","docstring":"/**\n * @include [ColGroupNameDocs] {@set [CommonColGroupDocs.ReceiverArg] \"pathTo\"[\"myColumnGroup\"].}\n * @include [CommonColGroupDocs.ColumnGroupTypeParam]\n */"} {"signature":"@ Suppress ( \"\" ) @ JvmName ( \"\" ) public fun colGroup ( path : ColumnPath ) : ColumnAccessor < DataRow < * > >","body":"= columnGroup < Any ? > ( path ) . ensureIsColumnGroup ( )","docstring":"/**\n * @include [ColGroupPathDocs] {@set [CommonColGroupDocs.ReceiverArg]}\n */"} {"signature":"public fun < C > colGroup ( path : ColumnPath ) : ColumnAccessor < DataRow < C > >","body":"= columnGroup < C > ( path ) . ensureIsColumnGroup ( )","docstring":"/**\n * @include [ColGroupPathDocs] {@set [CommonColGroupDocs.ReceiverArg]}\n * @include [CommonColGroupDocs.ColumnGroupTypeParam]\n */"} {"signature":"@ Suppress ( \"\" ) @ JvmName ( \"\" ) public fun SingleColumn < DataRow < * > > . colGroup ( path : ColumnPath ) : SingleColumn < DataRow < * > >","body":"= colGroup < Any ? > ( path )","docstring":"/**\n * @include [ColGroupPathDocs] {@set [CommonColGroupDocs.ReceiverArg] myColumnGroup.}\n */"} {"signature":"public fun < C > SingleColumn < DataRow < * > > . colGroup ( path : ColumnPath ) : SingleColumn < DataRow < C > >","body":"= this . ensureIsColumnGroup ( ) . transformSingle { val child = it . getCol ( path ) ? . cast < DataRow < C > > ( ) ? : throw IllegalStateException ( \"\" ) child . data . ensureIsColumnGroup ( ) listOf ( child ) } . singleImpl ( )","docstring":"/**\n * @include [ColGroupPathDocs] {@set [CommonColGroupDocs.ReceiverArg] myColumnGroup.}\n * @include [CommonColGroupDocs.ColumnGroupTypeParam]\n */"} {"signature":"@ Suppress ( \"\" ) @ JvmName ( \"\" ) public fun AnyColumnGroupAccessor . colGroup ( path : ColumnPath ) : ColumnAccessor < DataRow < * > >","body":"= colGroup < Any ? > ( path )","docstring":"/**\n * @include [ColGroupPathDocs] {@set [CommonColGroupDocs.ReceiverArg] myColumnGroup.}\n */"} {"signature":"public fun < C > AnyColumnGroupAccessor . colGroup ( path : ColumnPath ) : ColumnAccessor < DataRow < C > >","body":"= this . ensureIsColumnGroup ( ) . columnGroup < C > ( path ) . ensureIsColumnGroup ( )","docstring":"/**\n * @include [ColGroupPathDocs] {@set [CommonColGroupDocs.ReceiverArg] myColumnGroup.}\n * @include [CommonColGroupDocs.ColumnGroupTypeParam]\n */"} {"signature":"@ Suppress ( \"\" ) @ JvmName ( \"\" ) public fun String . colGroup ( path : ColumnPath ) : ColumnAccessor < DataRow < * > >","body":"= colGroup < Any ? > ( path )","docstring":"/**\n * @include [ColGroupPathDocs] {@set [CommonColGroupDocs.ReceiverArg] \"myColumnGroup\".}\n */"} {"signature":"public fun < C > String . colGroup ( path : ColumnPath ) : ColumnAccessor < DataRow < C > >","body":"= columnGroup ( this ) . ensureIsColumnGroup ( ) . columnGroup < C > ( path ) . ensureIsColumnGroup ( )","docstring":"/**\n * @include [ColGroupPathDocs] {@set [CommonColGroupDocs.ReceiverArg] \"myColumnGroup\".}\n * @include [CommonColGroupDocs.ColumnGroupTypeParam]\n */"} {"signature":"@ Suppress ( \"\" ) @ JvmName ( \"\" ) public fun KProperty < * > . colGroup ( path : ColumnPath ) : ColumnAccessor < DataRow < * > >","body":"= colGroup < Any ? > ( path )","docstring":"/**\n * @include [ColGroupPathDocs] {@set [CommonColGroupDocs.ReceiverArg] Type::myColumnGroup.}\n */"} {"signature":"public fun < C > KProperty < * > . colGroup ( path : ColumnPath ) : ColumnAccessor < DataRow < C > >","body":"= columnGroup ( this ) . ensureIsColumnGroup ( ) . columnGroup < C > ( path ) . ensureIsColumnGroup ( )","docstring":"/**\n * @include [ColGroupPathDocs] {@set [CommonColGroupDocs.ReceiverArg] Type::myColumnGroup.}\n * @include [CommonColGroupDocs.ColumnGroupTypeParam]\n */"} {"signature":"@ Suppress ( \"\" ) @ JvmName ( \"\" ) public fun ColumnPath . colGroup ( path : ColumnPath ) : ColumnAccessor < DataRow < * > >","body":"= colGroup < Any ? > ( path )","docstring":"/**\n * @include [ColGroupPathDocs] {@set [CommonColGroupDocs.ReceiverArg] \"pathTo\"[\"myColumnGroup\"].}\n */"} {"signature":"public fun < C > ColumnPath . colGroup ( path : ColumnPath ) : ColumnAccessor < DataRow < C > >","body":"= columnGroup ( this ) . ensureIsColumnGroup ( ) . columnGroup < C > ( path ) . ensureIsColumnGroup ( )","docstring":"/**\n * @include [ColGroupPathDocs] {@set [CommonColGroupDocs.ReceiverArg] \"pathTo\"[\"myColumnGroup\"].}\n * @include [CommonColGroupDocs.ColumnGroupTypeParam]\n */"} {"signature":"@ Suppress ( \"\" ) @ JvmName ( \"\" ) public fun < C > colGroup ( property : KProperty < DataRow < C > > ) : SingleColumn < DataRow < C > >","body":"= columnGroup ( property ) . ensureIsColumnGroup ( )","docstring":"/**\n * @include [ColGroupKPropertyDocs] {@set [CommonColGroupDocs.ReceiverArg]}\n */"} {"signature":"public fun < C > colGroup ( property : KProperty < C > ) : SingleColumn < DataRow < C > >","body":"= columnGroup ( property ) . ensureIsColumnGroup ( )","docstring":"/**\n * @include [ColGroupKPropertyDocs] {@set [CommonColGroupDocs.ReceiverArg]}\n */"} {"signature":"@ Suppress ( \"\" ) @ JvmName ( \"\" ) public fun < C > SingleColumn < DataRow < * > > . colGroup ( property : KProperty < DataRow < C > > ) : SingleColumn < DataRow < C > >","body":"= colGroup < C > ( property . name )","docstring":"/**\n * @include [ColGroupKPropertyDocs] {@set [CommonColGroupDocs.ReceiverArg] myColumnGroup.}\n */"} {"signature":"public fun < C > SingleColumn < DataRow < * > > . colGroup ( property : KProperty < C > ) : SingleColumn < DataRow < C > >","body":"= colGroup < C > ( property . name )","docstring":"/**\n * @include [ColGroupKPropertyDocs] {@set [CommonColGroupDocs.ReceiverArg] myColumnGroup.}\n */"} {"signature":"@ Suppress ( \"\" ) @ JvmName ( \"\" ) public fun < C > AnyColumnGroupAccessor . colGroup ( property : KProperty < DataRow < C > > ) : ColumnAccessor < DataRow < C > >","body":"= this . ensureIsColumnGroup ( ) . columnGroup ( property ) . ensureIsColumnGroup ( )","docstring":"/**\n * @include [ColGroupKPropertyDocs] {@set [CommonColGroupDocs.ReceiverArg] myColumnGroup.}\n */"} {"signature":"public fun < C > AnyColumnGroupAccessor . colGroup ( property : KProperty < C > ) : ColumnAccessor < DataRow < C > >","body":"= this . ensureIsColumnGroup ( ) . columnGroup ( property ) . ensureIsColumnGroup ( )","docstring":"/**\n * @include [ColGroupKPropertyDocs] {@set [CommonColGroupDocs.ReceiverArg] myColumnGroup.}\n */"} {"signature":"@ Suppress ( \"\" ) @ JvmName ( \"\" ) public fun < C > String . colGroup ( property : KProperty < DataRow < C > > ) : ColumnAccessor < DataRow < C > >","body":"= columnGroup ( this ) . ensureIsColumnGroup ( ) . columnGroup ( property ) . ensureIsColumnGroup ( )","docstring":"/**\n * @include [ColGroupKPropertyDocs] {@set [CommonColGroupDocs.ReceiverArg] \"myColumnGroup\".}\n */"} {"signature":"public fun < C > String . colGroup ( property : KProperty < C > ) : ColumnAccessor < DataRow < C > >","body":"= columnGroup ( this ) . ensureIsColumnGroup ( ) . columnGroup ( property ) . ensureIsColumnGroup ( )","docstring":"/**\n * @include [ColGroupKPropertyDocs] {@set [CommonColGroupDocs.ReceiverArg] \"myColumnGroup\".}\n */"} {"signature":"@ Suppress ( \"\" ) @ JvmName ( \"\" ) public fun < C > KProperty < * > . colGroup ( property : KProperty < DataRow < C > > ) : ColumnAccessor < DataRow < C > >","body":"= columnGroup ( this ) . ensureIsColumnGroup ( ) . columnGroup ( property ) . ensureIsColumnGroup ( )","docstring":"/**\n * @include [ColGroupKPropertyDocs] {@set [CommonColGroupDocs.ReceiverArg] Type::myColumnGroup.}\n */"} {"signature":"public fun < C > KProperty < * > . colGroup ( property : KProperty < C > ) : ColumnAccessor < DataRow < C > >","body":"= columnGroup ( this ) . ensureIsColumnGroup ( ) . columnGroup ( property ) . ensureIsColumnGroup ( )","docstring":"/**\n * @include [ColGroupKPropertyDocs] {@set [CommonColGroupDocs.ReceiverArg] Type::myColumnGroup.}\n */"} {"signature":"@ Suppress ( \"\" ) @ JvmName ( \"\" ) public fun < C > ColumnPath . colGroup ( property : KProperty < DataRow < C > > ) : ColumnAccessor < DataRow < C > >","body":"= columnGroup ( this ) . ensureIsColumnGroup ( ) . columnGroup ( property ) . ensureIsColumnGroup ( )","docstring":"/**\n * @include [ColGroupKPropertyDocs] {@set [CommonColGroupDocs.ReceiverArg] \"pathTo\"[\"myColumnGroup\"].}\n */"} {"signature":"public fun < C > ColumnPath . colGroup ( property : KProperty < C > ) : ColumnAccessor < DataRow < C > >","body":"= columnGroup ( this ) . ensureIsColumnGroup ( ) . columnGroup ( property ) . ensureIsColumnGroup ( )","docstring":"/**\n * @include [ColGroupKPropertyDocs] {@set [CommonColGroupDocs.ReceiverArg] \"pathTo\"[\"myColumnGroup\"].}\n */"} {"signature":"@ Suppress ( \"\" ) @ JvmName ( \"\" ) public fun < C > ColumnSet < DataRow < C > > . colGroup ( index : Int ) : SingleColumn < DataRow < C > >","body":"= getAt ( index ) . ensureIsColumnGroup ( )","docstring":"/**\n * @include [ColGroupIndexDocs] {@set [CommonColGroupDocs.ReceiverArg] `[colsOf][ColumnsSelectionDsl.colsOf]`<`[Int][Int]`>().}\n * @include [CommonColGroupDocs.ColumnGroupTypeParam]\n * {@set [CommonColGroupDocs.ExampleArg] {@include [CommonColGroupDocs.SingleExample]}}\n */"} {"signature":"public fun ColumnSet < * > . colGroup ( index : Int ) : SingleColumn < DataRow < * > >","body":"= getAt ( index ) . cast < DataRow < * > > ( ) . ensureIsColumnGroup ( )","docstring":"/**\n * @include [ColGroupIndexDocs] {@set [CommonColGroupDocs.ReceiverArg] `[colsOf][ColumnsSelectionDsl.colsOf]`<`[Int][Int]`>().}\n * @include [CommonColGroupDocs.ColumnGroupTypeParam]\n * {@set [CommonColGroupDocs.ExampleArg] {@include [CommonColGroupDocs.SingleExample]}}\n */"} {"signature":"@ Suppress ( \"\" ) @ JvmName ( \"\" ) public fun ColumnsSelectionDsl < * > . colGroup ( index : Int ) : SingleColumn < DataRow < * > >","body":"= colGroup < Any ? > ( index )","docstring":"/**\n * @include [ColGroupIndexDocs] {@set [CommonColGroupDocs.ReceiverArg]}\n */"} {"signature":"public fun < C > ColumnsSelectionDsl < * > . colGroup ( index : Int ) : SingleColumn < DataRow < C > >","body":"= asSingleColumn ( ) . colGroup < C > ( index )","docstring":"/**\n * @include [ColGroupIndexDocs] {@set [CommonColGroupDocs.ReceiverArg]}\n * @include [CommonColGroupDocs.ColumnGroupTypeParam]\n */"} {"signature":"@ Suppress ( \"\" ) @ JvmName ( \"\" ) public fun SingleColumn < DataRow < * > > . colGroup ( index : Int ) : SingleColumn < DataRow < * > >","body":"= colGroup < Any ? > ( index )","docstring":"/**\n * @include [ColGroupIndexDocs] {@set [CommonColGroupDocs.ReceiverArg] myColumnGroup.}\n */"} {"signature":"public fun < C > SingleColumn < DataRow < * > > . colGroup ( index : Int ) : SingleColumn < DataRow < C > >","body":"= this . ensureIsColumnGroup ( ) . allColumnsInternal ( ) . getAt ( index ) . cast < DataRow < C > > ( ) . ensureIsColumnGroup ( )","docstring":"/**\n * @include [ColGroupIndexDocs] {@set [CommonColGroupDocs.ReceiverArg] myColumnGroup.}\n * @include [CommonColGroupDocs.ColumnGroupTypeParam]\n */"} {"signature":"@ Suppress ( \"\" ) @ JvmName ( \"\" ) public fun String . colGroup ( index : Int ) : SingleColumn < DataRow < * > >","body":"= colGroup < Any ? > ( index )","docstring":"/**\n * @include [ColGroupIndexDocs] {@set [CommonColGroupDocs.ReceiverArg] \"myColumnGroup\".}\n */"} {"signature":"public fun < C > String . colGroup ( index : Int ) : SingleColumn < DataRow < C > >","body":"= columnGroup ( this ) . colGroup < C > ( index )","docstring":"/**\n * @include [ColGroupIndexDocs] {@set [CommonColGroupDocs.ReceiverArg] \"myColumnGroup\".}\n * @include [CommonColGroupDocs.ColumnGroupTypeParam]\n */"} {"signature":"@ Suppress ( \"\" ) @ JvmName ( \"\" ) public fun KProperty < * > . colGroup ( index : Int ) : SingleColumn < DataRow < * > >","body":"= colGroup < Any ? > ( index )","docstring":"/**\n * @include [ColGroupIndexDocs] {@set [CommonColGroupDocs.ReceiverArg] Type::myColumnGroup.}\n */"} {"signature":"public fun < C > KProperty < * > . colGroup ( index : Int ) : SingleColumn < DataRow < C > >","body":"= columnGroup ( this ) . colGroup < C > ( index )","docstring":"/**\n * @include [ColGroupIndexDocs] {@set [CommonColGroupDocs.ReceiverArg] Type::myColumnGroup.}\n * @include [CommonColGroupDocs.ColumnGroupTypeParam]\n */"} {"signature":"@ Suppress ( \"\" ) @ JvmName ( \"\" ) public fun ColumnPath . colGroup ( index : Int ) : SingleColumn < DataRow < * > >","body":"= colGroup < Any ? > ( index )","docstring":"/**\n * @include [ColGroupIndexDocs] {@set [CommonColGroupDocs.ReceiverArg] \"pathTo\"[\"myColumnGroup\"].}\n */"} {"signature":"public fun < C > ColumnPath . colGroup ( index : Int ) : SingleColumn < DataRow < C > >","body":"= columnGroup ( this ) . colGroup < C > ( index )","docstring":"/**\n * @include [ColGroupIndexDocs] {@set [CommonColGroupDocs.ReceiverArg] \"pathTo\"[\"myColumnGroup\"].}\n * @include [CommonColGroupDocs.ColumnGroupTypeParam]\n */"} {"signature":"@ PublishedApi internal fun < C > SingleColumn < DataRow < C > > . ensureIsColumnGroup ( ) : SingleColumn < DataRow < C > >","body":"= onResolve { col : ColumnWithPath < * > ? -> require ( col ? . isColumnGroup ( ) != false ) { \"\" } }","docstring":"/**\n * Checks the validity of this [SingleColumn],\n * by adding a check to see it's a [ColumnGroup] (so, a [SingleColumn]<*>)\n * and throwing an [IllegalArgumentException] if it's not.\n */"} {"signature":"internal fun < C > ColumnAccessor < DataRow < C > > . ensureIsColumnGroup ( ) : ColumnAccessor < DataRow < C > >","body":"= onResolve { col : ColumnWithPath < * > ? -> require ( col ? . isColumnGroup ( ) != false ) { \"\" } }","docstring":"/** @include [SingleColumn.ensureIsColumnGroup] */"} {"signature":"public fun filters ( config : Action < KoverReportFiltersConfig > )","body":"public fun filters ( config : Action < KoverReportFiltersConfig > )","docstring":"/**\n * Specify common filters for all report variants, these filters will be inherited in HTML/XML/verification reports.\n * They can be redefined in the settings of a specific report variant.\n * ```\n * filters {\n * excludes {\n * // ...\n * }\n *\n * includes {\n * // ...\n * }\n * }\n * ```\n */"} {"signature":"public fun verify ( config : Action < KoverVerificationRulesConfig > )","body":"public fun verify ( config : Action < KoverVerificationRulesConfig > )","docstring":"/**\n * Specify common verification rules for all report variants: JVM and Android build variants.\n * They can be overridden in the settings for a specific report set for particular variant.\n * ```\n * verify {\n * rule {\n * // verification rule\n * }\n *\n * rule(\"custom rule name\") {\n * // named verification rule\n * }\n *\n * // fail on verification error\n * warningInsteadOfFailure = false\n * }\n * ```\n */"} {"signature":"public fun total ( config : Action < KoverReportSetConfig > )","body":"public fun total ( config : Action < KoverReportSetConfig > )","docstring":"/**\n * Configure reports for all code of current project and `kover` dependencies.\n *\n * example:\n * ```\n * kover {\n * reports {\n * total {\n * filters {\n * // override report filters for total reports\n * }\n * html {\n * // configure HTML report for all code of current project and `kover` dependencies.\n * }\n * xml {\n * // configure XML report for all code of current project and `kover` dependencies.\n * }\n * verify {\n * // configure coverage verification all code of current project and `kover` dependencies.\n * }\n * }\n * }\n * }\n * ```\n */"} {"signature":"public fun variant ( variant : String , config : Action < KoverReportSetConfig > )","body":"public fun variant ( variant : String , config : Action < KoverReportSetConfig > )","docstring":"/**\n * Configure reports for classes of specified named Kover report variant.\n *\n * example:\n * ```\n * kover {\n * reports {\n * variant(\"debug\") {\n * filters {\n * // override report filters for reports of 'debug' variant\n * }\n *\n * html {\n * // configure HTML report for 'debug' variant\n * }\n *\n * xml {\n * // configure XML report for 'debug' variant\n * }\n *\n * verify {\n * // configure coverage verification for 'debug' variant\n * }\n * }\n * }\n * }\n * ```\n */"} {"signature":"public fun filters ( config : Action < KoverReportFiltersConfig > )","body":"public fun filters ( config : Action < KoverReportFiltersConfig > )","docstring":"/**\n * Specify common filters for all report variants, these filters will be inherited in HTML/XML/verification reports.\n * They can be redefined in the settings of a specific report variant.\n * ```\n * filters {\n * excludes {\n * // ...\n * }\n *\n * includes {\n * // ...\n * }\n * }\n * ```\n */"} {"signature":"public fun filtersAppend ( config : Action < KoverReportFiltersConfig > )","body":"public fun filtersAppend ( config : Action < KoverReportFiltersConfig > )","docstring":"/**\n * Specify common report filters, these filters will be inherited in HTML/XML/verification and other reports.\n *\n * Using this block will add additional filters to those that were inherited and specified earlier.\n * In order to clear the existing filters, use [filters].\n *\n * ```\n * filtersAppend {\n * excludes {\n * // ...\n * }\n *\n * includes {\n * // ...\n * }\n * }\n * ```\n */"} {"signature":"public fun html ( config : Action < KoverHtmlTaskConfig > )","body":"public fun html ( config : Action < KoverHtmlTaskConfig > )","docstring":"/**\n * Configure HTML report for current report variant.\n * ```\n * html {\n * title = \"Custom title\"\n *\n * // Generate an HTML report when running the `check` task\n * onCheck = false\n *\n * // Specify HTML report directory\n * htmlDir = layout.buildDirectory.dir(\"my-html-report\")\n * }\n * ```\n */"} {"signature":"public fun xml ( config : Action < KoverXmlTaskConfig > )","body":"public fun xml ( config : Action < KoverXmlTaskConfig > )","docstring":"/**\n * Configure XML report for current report variant.\n * ```\n * xml {\n * // Generate an XML report when running the `check` task\n * onCheck = true\n *\n * // XML report title (the location depends on the library)\n * title = \"Custom XML report title\"\n *\n * // Specify file to generate XML report\n * xmlFile = layout.buildDirectory.file(\"my-xml-report.xml\")\n * }\n * ```\n */"} {"signature":"public fun binary ( config : Action < KoverBinaryTaskConfig > )","body":"public fun binary ( config : Action < KoverBinaryTaskConfig > )","docstring":"/**\n * Configure Kover binary report for current report variant.\n * ```\n * binary {\n * // Generate binary report when running the `check` task\n * onCheck = true\n *\n * // Specify file to generate binary report\n * file = layout.buildDirectory.file(\"my-project-report/report.bin\")\n * }\n * ```\n *\n * Kover binary report is compatible with IntelliJ Coverage report (ic)\n */"} {"signature":"public fun verify ( config : Action < KoverVerifyTaskConfig > )","body":"public fun verify ( config : Action < KoverVerifyTaskConfig > )","docstring":"/**\n * Configure coverage verification for current report variant.\n *\n * Using this block clears all the bounds specified earlier.\n * In order not to clear the existing bounds, but to add new ones, use [verifyAppend].\n *\n * ```\n * verify {\n * onCheck = true\n *\n * rule {\n * // ...\n * }\n *\n * rule(\"Custom Name\") {\n * // ...\n * }\n *\n * // fail on verification error\n * warningInsteadOfFailure = false\n * }\n * ```\n */"} {"signature":"public fun verifyAppend ( config : Action < KoverVerifyTaskConfig > )","body":"public fun verifyAppend ( config : Action < KoverVerifyTaskConfig > )","docstring":"/**\n * Configure coverage verification for current report variant.\n *\n * Using this block will add additional bounds to those that were inherited and specified earlier.\n * In order to clear the existing bounds, use [verify].\n *\n * ```\n * verifyAppend {\n * onCheck = true\n *\n * rule {\n * // ...\n * }\n *\n * rule(\"Custom Name\") {\n * // ...\n * }\n * }\n * ```\n */"} {"signature":"public fun log ( config : Action < KoverLogTaskConfig > )","body":"public fun log ( config : Action < KoverLogTaskConfig > )","docstring":"/**\n * Configure coverage printing to the log for current report variant.\n * ```\n * log {\n * onCheck = true\n *\n * filters {\n * // ...\n * }\n * header = null\n * format = \" line coverage: %\"\n * groupBy = GroupingEntityType.APPLICATION\n * coverageUnits = CoverageUnit.LINE\n * aggregationForGroup = AggregationType.COVERED_PERCENTAGE\n * }\n * ```\n */"} {"signature":"public fun excludes ( config : Action < KoverReportFilter > )","body":"public fun excludes ( config : Action < KoverReportFilter > )","docstring":"/**\n * Configures class filter in order to exclude classes and functions.\n *\n * Example:\n * ```\n * excludes {\n * classes(\"com.example.FooBar?\", \"com.example.*Bar\")\n * packages(\"com.example.subpackage\")\n * annotatedBy(\"*Generated*\")\n * }\n * ```\n * Excludes have priority over includes.\n */"} {"signature":"public fun includes ( config : Action < KoverReportFilter > )","body":"public fun includes ( config : Action < KoverReportFilter > )","docstring":"/**\n * Configures class filter in order to include classes.\n *\n * Example:\n * ```\n * includes {\n * classes(\"com.example.FooBar?\", \"com.example.*Bar\")\n * packages(\"com.example.subpackage\")\n * }\n * ```\n * Excludes have priority over includes.\n */"} {"signature":"public fun classes ( vararg names : String )","body":"public fun classes ( vararg names : String )","docstring":"/**\n * Add specified classes to current filters.\n *\n * It is acceptable to use `*` and `?` wildcards,\n * `*` means any number of arbitrary characters (including no chars), `?` means one arbitrary character.\n *\n * Example:\n * ```\n * classes(\"*.foo.Bar\", \"*.M?Class\")\n * ```\n */"} {"signature":"public fun classes ( names : Iterable < String > )","body":"public fun classes ( names : Iterable < String > )","docstring":"/**\n * Add specified classes to current filters.\n *\n * It is acceptable to use `*` and `?` wildcards,\n * `*` means any number of arbitrary characters (including no chars), `?` means one arbitrary character.\n *\n * Example for Groovy:\n * ```\n * def someClasses = [\"*.foo.Bar\", \"*.M?Class\"]\n * ...\n * classes(someClasses)\n * ```\n *\n * Example for Kotlin:\n * ```\n * val someClasses = listOf(\"*.foo.Bar\", \"*.M?Class\")\n * ...\n * classes(someClasses)\n * ```\n */"} {"signature":"public fun classes ( vararg names : Provider < String > )","body":"public fun classes ( vararg names : Provider < String > )","docstring":"/**\n * Add specified classes to current filters.\n *\n * Used for lazy setup.\n *\n * It is acceptable to use `*` and `?` wildcards,\n * `*` means any number of arbitrary characters (including no chars), `?` means one arbitrary character.\n *\n * Example:\n * ```\n * val excludedClass: Provider = ...\n * ...\n * classes(excludedClass)\n * ```\n */"} {"signature":"public fun classes ( names : Provider < Iterable < String > > )","body":"public fun classes ( names : Provider < Iterable < String > > )","docstring":"/**\n * Add specified classes to current filters.\n *\n * Used for lazy setup.\n *\n * It is acceptable to use `*` and `?` wildcards,\n * `*` means any number of arbitrary characters (including no chars), `?` means one arbitrary character.\n *\n * Example:\n * ```\n * val someClasses: Provider> = ...\n * ...\n * classes(someClasses)\n * ```\n */"} {"signature":"public fun packages ( vararg names : String )","body":"public fun packages ( vararg names : String )","docstring":"/**\n * Add all classes in specified package and its subpackages to current filters.\n *\n * It is acceptable to use `*` and `?` wildcards,\n * `*` means any number of arbitrary characters (including no chars), `?` means one arbitrary character.\n *\n * Example:\n * ```\n * packages(\"foo.b?r\", \"com.*.example\")\n * ```\n */"} {"signature":"public fun packages ( names : Iterable < String > )","body":"public fun packages ( names : Iterable < String > )","docstring":"/**\n * Add all classes in specified package and its subpackages to current filters.\n *\n * It is acceptable to use `*` and `?` wildcards,\n * `*` means any number of arbitrary characters (including no chars), `?` means one arbitrary character.\n *\n * Example for Groovy:\n * ```\n * def somePackages = [\"foo.b?r\", \"com.*.example\"]\n *\n * packages(somePackages)\n * ```\n *\n * Example for Kotlin:\n * ```\n * val somePackages = listOf(\"foo.b?r\", \"com.*.example\")\n * ...\n * packages(somePackages)\n * ```\n */"} {"signature":"public fun packages ( vararg names : Provider < String > )","body":"public fun packages ( vararg names : Provider < String > )","docstring":"/**\n * Add all classes in specified package and its subpackages to current filters.\n *\n * Used for lazy setup.\n *\n * It is acceptable to use `*` and `?` wildcards,\n * `*` means any number of arbitrary characters (including no chars), `?` means one arbitrary character.\n *\n * Example:\n * ```\n * val classA: Provider = ...\n * val classB: Provider = ...\n * packages(classA, classB)\n * ```\n */"} {"signature":"public fun packages ( names : Provider < Iterable < String > > )","body":"public fun packages ( names : Provider < Iterable < String > > )","docstring":"/**\n * Add all classes in specified package and its subpackages to current filters.\n *\n * Used for lazy setup.\n *\n * It is acceptable to use `*` and `?` wildcards,\n * `*` means any number of arbitrary characters (including no chars), `?` means one arbitrary character.\n *\n * Example:\n * ```\n * val somePackages: Provider> = ...\n * ...\n * packages(somePackages)\n * ```\n */"} {"signature":"public fun annotatedBy ( vararg annotationName : String )","body":"public fun annotatedBy ( vararg annotationName : String )","docstring":"/**\n * Add to filters all classes and functions marked by specified annotations.\n *\n * It is acceptable to use `*` and `?` wildcards,\n * `*` means any number of arbitrary characters (including no chars), `?` means one arbitrary character.\n *\n * Example:\n * ```\n * annotatedBy(\"*Generated*\", \"com.example.KoverExclude\")\n * ```\n */"} {"signature":"public fun annotatedBy ( vararg annotationName : Provider < String > )","body":"public fun annotatedBy ( vararg annotationName : Provider < String > )","docstring":"/**\n * Add to filters all classes and functions marked by specified annotations.\n *\n * Used for lazy setup.\n *\n * It is acceptable to use `*` and `?` wildcards,\n * `*` means any number of arbitrary characters (including no chars), `?` means one arbitrary character.\n *\n * Example:\n * ```\n * val annotation: Provider = ...\n * annotatedBy(annotation)\n * ```\n */"} {"signature":"public fun androidGeneratedClasses ( )","body":"{ classes ( \"\" , \"\" , \"\" , \"\" , \"\" , \"\" ) }","docstring":"/**\n * Add all classes generated by Android plugin to filters.\n *\n * It is shortcut for:\n * ```\n * classes(\n * \"*Fragment\",\n * \"*Fragment\\$*\",\n * \"*Activity\",\n * \"*Activity\\$*\",\n * \"*.databinding.*\",\n * \"*.BuildConfig\"\n * )\n * ```\n */"} {"signature":"@ Deprecated ( message = \"\" , replaceWith = ReplaceWith ( \"\" ) , level = DeprecationLevel . ERROR ) public fun setReportFile ( xmlFile : Any )","body":"{ throw KoverDeprecationException ( \"\" ) }","docstring":"/**\n * Specify file to generate XML report.\n */"} {"signature":"public fun rule ( config : Action < KoverVerifyRule > )","body":"public fun rule ( config : Action < KoverVerifyRule > )","docstring":"/**\n * Add new coverage verification rule to check after test task execution.\n */"} {"signature":"public fun rule ( name : String , config : Action < KoverVerifyRule > )","body":"public fun rule ( name : String , config : Action < KoverVerifyRule > )","docstring":"/**\n * Add new named coverage verification rule to check after test task execution.\n *\n * The name will be displayed in case of a verification error if Kover Tool was used.\n */"} {"signature":"public fun bound ( config : Action < KoverVerifyBound > )","body":"public fun bound ( config : Action < KoverVerifyBound > )","docstring":"/**\n * Specifies the set of verification rules that control the\n * coverage conditions required for the verification task to pass.\n *\n * An example of bound configuration:\n * ```\n * // At least 75% of lines should be covered in order for build to pass\n * bound {\n * aggregationForGroup = AggregationType.COVERED_PERCENTAGE // Default aggregation\n * coverageUnits = CoverageUnit.LINE\n * minValue = 75\n * }\n * ```\n *\n * @see KoverVerifyBound\n */"} {"signature":"public fun minBound ( minValue : Int )","body":"public fun minBound ( minValue : Int )","docstring":"/**\n * A shortcut for\n * ```\n * bound {\n * minValue = min\n * }\n * ```\n *\n * @see bound\n */"} {"signature":"public fun minBound ( minValue : Provider < Int > )","body":"public fun minBound ( minValue : Provider < Int > )","docstring":"/**\n * A shortcut for\n * ```\n * bound {\n * minValue = min\n * }\n * ```\n *\n * @see bound\n */"} {"signature":"public fun maxBound ( maxValue : Int )","body":"public fun maxBound ( maxValue : Int )","docstring":"/**\n * A shortcut for\n * ```\n * bound {\n * maxValue = maxValue\n * }\n * ```\n *\n * @see bound\n */"} {"signature":"public fun maxBound ( maxValue : Provider < Int > )","body":"public fun maxBound ( maxValue : Provider < Int > )","docstring":"/**\n * A shortcut for\n * ```\n * bound {\n * maxValue = max\n * }\n * ```\n *\n * @see bound\n */"} {"signature":"public fun minBound ( minValue : Int , coverageUnits : CoverageUnit = CoverageUnit . LINE , aggregationForGroup : AggregationType = AggregationType . COVERED_PERCENTAGE )","body":"public fun minBound ( minValue : Int , coverageUnits : CoverageUnit = CoverageUnit . LINE , aggregationForGroup : AggregationType = AggregationType . COVERED_PERCENTAGE )","docstring":"/**\n * A shortcut for\n * ```\n * bound {\n * minValue = minValue\n * coverageUnits = coverageUnits\n * aggregationForGroup = aggregationForGroup\n * }\n * ```\n *\n * @see bound\n */"} {"signature":"public fun maxBound ( maxValue : Int , coverageUnits : CoverageUnit = CoverageUnit . LINE , aggregationForGroup : AggregationType = AggregationType . COVERED_PERCENTAGE )","body":"public fun maxBound ( maxValue : Int , coverageUnits : CoverageUnit = CoverageUnit . LINE , aggregationForGroup : AggregationType = AggregationType . COVERED_PERCENTAGE )","docstring":"/**\n * A shortcut for\n * ```\n * bound {\n * maxValue = maxValue\n * coverageUnits = coverageUnits\n * aggregationForGroup = aggregation\n * }\n * ```\n *\n * @see bound\n */"} {"signature":"public fun bound ( minValue : Int , maxValue : Int , coverageUnits : CoverageUnit = CoverageUnit . LINE , aggregationForGroup : AggregationType = AggregationType . COVERED_PERCENTAGE )","body":"public fun bound ( minValue : Int , maxValue : Int , coverageUnits : CoverageUnit = CoverageUnit . LINE , aggregationForGroup : AggregationType = AggregationType . COVERED_PERCENTAGE )","docstring":"/**\n * A shortcut for\n * ```\n * bound {\n * maxValue = maxValue\n * minValue = minValue\n * coverageUnits = coverageUnits\n * aggregationForGroup = aggregation\n * }\n * ```\n *\n * @see bound\n */"} {"signature":"@ Test fun testCancellationExceptionOnExternalCancellation ( )","body":"= runTest { expect ( ) val result = future ( NonCancellable + Dispatchers . Unconfined ) { try { delay ( Long . MAX_VALUE ) } finally { expect ( ) throw TestCancellationException ( ) } } assertTrue ( result . cancel ( true ) ) finish ( ) }","docstring":"/** This test ensures that we never pass [CancellationException] to [CoroutineExceptionHandler]. */"} {"signature":"fun configure ( configuration : CO . ( ) -> Unit )","body":"{ configuration ( options ) }","docstring":"/**\n * @suppress\n */"} {"signature":"fun configure ( configuration : Action < @ UnsafeVariance CO > )","body":"{ configuration . execute ( options ) }","docstring":"/**\n * @suppress\n */"} {"signature":"fun FirMemberDeclaration . setLazyPublishedVisibility ( session : FirSession )","body":"{ setLazyPublishedVisibility ( annotations , null , session ) }","docstring":"/**\n * Published visibility depends on the published visibility of the containing class.\n * However, the published visibility of deserialized classes can't be eagerly determined because it depends on their annotations, which\n * are loaded later to prevent endless loops.\n * To break up this dependency, the published visibility can be computed lazily when containing classes are fully deserialized.\n */"} {"signature":"fun availableFor ( configurables : AppleConfigurables ) : Boolean","body":"{ return HostManager . host is KonanTarget . MACOS_ARM64 && configurables . target is KonanTarget . MACOS_X64 }","docstring":"/**\n * Returns `true` if running via Rosetta 2 can be made available for given [configurables].\n *\n * This does not check that Rosetta 2 is installed.\n */"} {"signature":"fun checkIsInstalled ( hostExecutor : Executor = HostExecutor ( ) ) : Boolean","body":"{ if ( HostManager . host !is KonanTarget . MACOS_ARM64 ) { return false } return hostExecutor . execute ( ExecuteRequest ( \"\" ) . apply { this . args . addAll ( listOf ( \"\" , \"\" ) ) } ) . exitCode == }","docstring":"/**\n * Return `true` if Rosetta 2 is installed.\n *\n * @param [hostExecutor] executor in which to run the check. By default [HostExecutor].\n */"} {"signature":"fun getTypeText ( ) : String","body":"{ return stub ? . let { getTypeText ( typeElement ) } ? : text }","docstring":"/**\n * Returns presentable text for the underlying type based on stubs when provided.\n * No decompilation happens if [KtTypeReference] represents compiled code.\n */"} {"signature":"fun Project . nativeTest ( taskName : String , tag : String ? , requirePlatformLibs : Boolean = false , customCompilerDependencies : List < Configuration > = emptyList ( ) , customTestDependencies : List < Configuration > = emptyList ( ) , compilerPluginDependencies : List < Configuration > = emptyList ( ) , allowParallelExecution : Boolean = true , body : Test . ( ) -> Unit = { } , )","body":"= projectTest ( taskName , jUnitMode = JUnitMode . JUnit5 , maxHeapSizeMb = ) { group = \"\" if ( kotlinBuildProperties . isKotlinNativeEnabled ) { workingDir = rootDir outputs . upToDateWhen { false } jvmArgs ( \"\" ) jvmArgs ( \"\" ) val availableCpuCores : Int = if ( allowParallelExecution ) Runtime . getRuntime ( ) . availableProcessors ( ) else if ( ! kotlinBuildProperties . isTeamcityBuild && minOf ( kotlinBuildProperties . junit5NumberOfThreadsForParallelExecution ? : , availableCpuCores ) > ) { logger . info ( \"\" ) jvmArgs ( \"\" ) } val computedTestProperties = ComputedTestProperties { compute ( KOTLIN_NATIVE_HOME ) { val testTarget = readFromGradle ( TEST_TARGET ) if ( testTarget != null ) { dependsOn ( \"\" ) if ( requirePlatformLibs ) dependsOn ( \"\" ) } else { dependsOn ( \"\" ) if ( requirePlatformLibs ) dependsOn ( \"\" ) } project ( \"\" ) . projectDir . resolve ( \"\" ) . absolutePath } computeLazy ( COMPILER_CLASSPATH ) { val customNativeHome = readFromGradle ( KOTLIN_NATIVE_HOME ) val kotlinNativeCompilerEmbeddable = if ( customNativeHome == null ) configurations . detachedConfiguration ( dependencies . project ( \"\" ) , dependencies . create ( commonDependency ( \"\" ) ) ) . also { dependsOn ( it ) } else null customCompilerDependencies . forEach ( :: dependsOn ) lazyClassPath { if ( customNativeHome == null ) { addAll ( kotlinNativeCompilerEmbeddable ! ! . files ) } else { this += file ( customNativeHome ) . resolve ( \"\" ) this += file ( customNativeHome ) . resolve ( \"\" ) } customCompilerDependencies . flatMapTo ( this ) { it . files } } } computeLazy ( COMPILER_PLUGINS ) { compilerPluginDependencies . forEach ( :: dependsOn ) lazyClassPath { compilerPluginDependencies . flatMapTo ( this ) { it . files } } } computeLazy ( CUSTOM_KLIBS ) { customTestDependencies . forEach ( :: dependsOn ) lazyClassPath { customTestDependencies . flatMapTo ( this ) { it . files } } } compute ( TEST_KIND ) { readFromGradle ( FORCE_STANDALONE ) ? . let { \"\" } } compute ( TEST_TARGET ) compute ( TEST_MODE ) compute ( COMPILE_ONLY ) compute ( OPTIMIZATION_MODE ) compute ( USE_THREAD_STATE_CHECKER ) compute ( GC_TYPE ) compute ( GC_SCHEDULER ) compute ( ALLOCATOR ) compute ( CACHE_MODE ) compute ( EXECUTION_TIMEOUT ) compute ( SANITIZER ) compute ( SHARED_TEST_EXECUTION ) compute ( EAGER_GROUP_CREATION ) computePrivate ( TEAMCITY ) { kotlinBuildProperties . isTeamcityBuild . toString ( ) } } environment ( \"\" , path ) useJUnitPlatform { tag ? . let { includeTags ( it ) } } if ( ! allowParallelExecution ) { systemProperty ( \"\" , \"\" ) } doFirst { logger . info ( buildString { appendLine ( \"\" ) append ( \"\" ) systemProperties . filterKeys { it . startsWith ( \"\" ) } . toSortedMap ( ) . forEach { ( key , value ) -> append ( \"\" ) } } ) computedTestProperties . resolveAndApplyToTask ( ) } } else doFirst { throw GradleException ( \"\"\"\"\"\" . trimIndent ( ) ) } body ( ) }","docstring":"/**\n * @param taskName Name of Gradle task.\n * @param tag Optional JUnit test tag. See https://junit.org/junit5/docs/current/user-guide/#writing-tests-tagging-and-filtering\n * @param requirePlatformLibs Where platform KLIBs from the Kotlin/Native distribution are required for running this test.\n * @param customCompilerDependencies The [Configuration]s that provide additional JARs to be added to the compiler's classpath.\n * @param customTestDependencies The [Configuration]s that provide KLIBs to be added to Kotlin/Native compiler dependencies list\n * along with Kotlin/Native stdlib KLIB and Kotlin/Native platform KLIBs (the latter only if [requirePlatformLibs] is `true`).\n * @param compilerPluginDependencies The [Configuration]s that provide compiler plugins to be enabled for the Kotlin/Native compiler\n * for the duration of test execution.\n * @param allowParallelExecution if false, force junit to execute test sequentially\n */"} {"signature":"fun sourceSetTrees ( vararg tree : KotlinSourceSetTree )","body":"fun sourceSetTrees ( vararg tree : KotlinSourceSetTree )","docstring":"/**\n * Defines the trees that the described hierarchy is applied to.\n * ### Example 1: Only apply a hierarchy for the \"main\" and \"test\" [KotlinSourceSetTree]\n *\n * ```kotlin\n * applyHierarchyTemplate {\n * sourceSetTrees(KotlinSourceSetTree.main, KotlinSourceSetTree.test)\n * common {\n * withJvm()\n * group(\"ios\") {\n * withIos()\n * }\n * }\n * }\n *```\n *\n * Will create the following trees given an iosX64(), iosArm64() and jvm() target:\n * ```\n * \"main\" \"test\"\n * commonMain commonTest\n * | |\n * +----+-----+ +----+-----+\n * | | | |\n * iosMain jvmMain iosTest jvmTest\n * | |\n * +---+----+ +---+----+\n * | | | |\n * iosX64Main iosArm64Main iosX64Test iosArm64Test\n * ```\n *\n * ### Example 2:\n * Using a different hierarchy for \"main\" and \"test\"\n *```kotlin\n * applyHierarchyTemplate {\n * sourceSetTrees(SourceSetTree.main) // ! <- only applied to the \"main\" tree\n * common {\n * withJvm()\n * group(\"ios\") {\n * withIos()\n * }\n * }\n * }\n *\n * applyHierarchyTemplate {\n * sourceSetTrees(SourceSetTree.test) // ! <- only applied to the \"test\" tree\n * common {\n * withJvm()\n * withIos()\n * }\n * }\n * ```\n *\n * Will create the following trees given an iosX64(), iosArm64() and jvm() target:\n * ```\n * \"main\" \"test\"\n * commonMain commonTest\n * | |\n * +----+-----+ +-----------+-----------+\n * | | | | |\n * iosMain jvmMain iosX64Test iosArm64Test jvmTest\n * |\n * +---+----+\n * | |\n * iosX64Main iosArm64Main\n * ```\n */"} {"signature":"fun withSourceSetTree ( vararg tree : KotlinSourceSetTree )","body":"fun withSourceSetTree ( vararg tree : KotlinSourceSetTree )","docstring":"/**\n * Will add the given [tree]s into for this descriptor.\n * @see sourceSetTrees\n */"} {"signature":"fun excludeSourceSetTree ( vararg tree : KotlinSourceSetTree )","body":"fun excludeSourceSetTree ( vararg tree : KotlinSourceSetTree )","docstring":"/**\n * Will remove the given [tree]s from this descriptor\n * @see sourceSetTrees\n */"} {"signature":"fun common ( build : KotlinHierarchyBuilder . ( ) -> Unit )","body":"= group ( \"\" , build )","docstring":"/**\n * Shortcut for `group(\"common\") { }`:\n * Most hierarchies should attach their nodes/groups to 'common'\n *\n * e.g.\n * ```\n * common {\n * group(\"native\") {\n * withIos()\n * withMacos()\n * }\n * }\n * ```\n * applying the shown hierarchy to the main compilations will create a 'nativeMain' source set which will\n * depend on the usual 'commonMain'\n *\n */"} {"signature":"private fun descriptionFrom ( token : String ) : String","body":"{ val fqName = FqName ( token ) val cls = callContext . moduleDescriptor . findClassAcrossModuleDependencies ( ClassId . topLevel ( fqName ) ) return cls ? . let { it . annotations . findAnnotation ( ComposeFqNames . ComposableTargetMarker ) ? . let { marker -> marker . allValueArguments . firstNotNullOfOrNull { entry -> val name = entry . key if ( ! name . isSpecial && name . identifier == ComposeFqNames . ComposableTargetMarkerDescription ) { ( entry . value as? StringValue ) ? . value } else null } } } ? : token }","docstring":"/**\n * Find the `description` value from ComposableTargetMarker if the token refers to an\n * annotation with the marker or just return [token] if it cannot be found.\n */"} {"signature":"fun getStart ( group : Int = ) : Int","body":"{ checkGroup ( group ) return groupBounds [ group * ] }","docstring":"/**\n * Returns the index of the first character of the text that matched a given group.\n *\n * @param group the group, ranging from 0 to groupCount() - 1, with 0 representing the whole pattern.\n * @return the character index.\n */"} {"signature":"fun getEnd ( group : Int = ) : Int","body":"{ checkGroup ( group ) return groupBounds [ group * + ] }","docstring":"/**\n * Returns the index of the first character following the text that matched a given group.\n *\n * @param group the group, ranging from 0 to groupCount() - 1, with 0 representing the whole pattern.\n * @return the character index.\n */"} {"signature":"fun group ( group : Int = ) : String ?","body":"{ val start = getStart ( group ) val end = getEnd ( group ) if ( start < || end < ) { return null } return input . subSequence ( getStart ( group ) , getEnd ( group ) ) . toString ( ) }","docstring":"/**\n * Returns the text that matched a given group of the regular expression.\n *\n * @param group the group, ranging from 0 to groupCount() - 1, with 0 representing the whole pattern.\n * @return the text that matched the group.\n */"} {"signature":"fun groupCount ( ) : Int","body":"{ return groupCount - }","docstring":"/**\n * Returns the number of groups in the result, which is always equal to\n * the number of groups in the original regular expression.\n *\n * @return the number of groups.\n */"} {"signature":"private tailrec fun findStartDestination ( graph : NavDestination ) : NavDestination","body":"{ return if ( graph is NavGraph ) findStartDestination ( graph . startDestination ! ! ) else graph }","docstring":"/**\n * Copied from similar function in NavigationUI.kt\n *\n * https://cs.android.com/androidx/platform/frameworks/support/+/androidx-main:navigation/navigation-ui/src/main/java/androidx/navigation/ui/NavigationUI.kt\n */"} {"signature":"@ Composable @ ReadOnlyComposable private fun resources ( ) : Resources","body":"{ LocalConfiguration . current return LocalContext . current . resources }","docstring":"/**\n * A composable function that returns the [Resources]. It will be recomposed when `Configuration`\n * gets updated.\n */"} {"signature":"@ kotlin . internal . InlineOnly public inline operator fun BigInteger . plus ( other : BigInteger ) : BigInteger","body":"= this . add ( other )","docstring":"/**\n * Enables the use of the `+` operator for [BigInteger] instances.\n */"} {"signature":"@ kotlin . internal . InlineOnly public inline operator fun BigInteger . minus ( other : BigInteger ) : BigInteger","body":"= this . subtract ( other )","docstring":"/**\n * Enables the use of the `-` operator for [BigInteger] instances.\n */"} {"signature":"@ kotlin . internal . InlineOnly public inline operator fun BigInteger . times ( other : BigInteger ) : BigInteger","body":"= this . multiply ( other )","docstring":"/**\n * Enables the use of the `*` operator for [BigInteger] instances.\n */"} {"signature":"@ kotlin . internal . InlineOnly public inline operator fun BigInteger . div ( other : BigInteger ) : BigInteger","body":"= this . divide ( other )","docstring":"/**\n * Enables the use of the `/` operator for [BigInteger] instances.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . internal . InlineOnly public inline operator fun BigInteger . rem ( other : BigInteger ) : BigInteger","body":"= this . remainder ( other )","docstring":"/**\n * Enables the use of the `%` operator for [BigInteger] instances.\n */"} {"signature":"@ kotlin . internal . InlineOnly public inline operator fun BigInteger . unaryMinus ( ) : BigInteger","body":"= this . negate ( )","docstring":"/**\n * Enables the use of the unary `-` operator for [BigInteger] instances.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . internal . InlineOnly public inline operator fun BigInteger . inc ( ) : BigInteger","body":"= this . add ( BigInteger . ONE )","docstring":"/**\n * Enables the use of the `++` operator for [BigInteger] instances.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . internal . InlineOnly public inline operator fun BigInteger . dec ( ) : BigInteger","body":"= this . subtract ( BigInteger . ONE )","docstring":"/**\n * Enables the use of the `--` operator for [BigInteger] instances.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . internal . InlineOnly public inline fun BigInteger . inv ( ) : BigInteger","body":"= this . not ( )","docstring":"/** Inverts the bits including the sign bit in this value. */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . internal . InlineOnly public inline infix fun BigInteger . and ( other : BigInteger ) : BigInteger","body":"= this . and ( other )","docstring":"/** Performs a bitwise AND operation between the two values. */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . internal . InlineOnly public inline infix fun BigInteger . or ( other : BigInteger ) : BigInteger","body":"= this . or ( other )","docstring":"/** Performs a bitwise OR operation between the two values. */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . internal . InlineOnly public inline infix fun BigInteger . xor ( other : BigInteger ) : BigInteger","body":"= this . xor ( other )","docstring":"/** Performs a bitwise XOR operation between the two values. */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . internal . InlineOnly public inline infix fun BigInteger . shl ( n : Int ) : BigInteger","body":"= this . shiftLeft ( n )","docstring":"/** Shifts this value left by the [n] number of bits. */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . internal . InlineOnly public inline infix fun BigInteger . shr ( n : Int ) : BigInteger","body":"= this . shiftRight ( n )","docstring":"/** Shifts this value right by the [n] number of bits, filling the leftmost bits with copies of the sign bit. */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . internal . InlineOnly public inline fun Int . toBigInteger ( ) : BigInteger","body":"= BigInteger . valueOf ( this . toLong ( ) )","docstring":"/**\n * Returns the value of this [Int] number as a [BigInteger].\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . internal . InlineOnly public inline fun Long . toBigInteger ( ) : BigInteger","body":"= BigInteger . valueOf ( this )","docstring":"/**\n * Returns the value of this [Long] number as a [BigInteger].\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . internal . InlineOnly public inline fun BigInteger . toBigDecimal ( ) : BigDecimal","body":"= BigDecimal ( this )","docstring":"/**\n * Returns the value of this [BigInteger] number as a [BigDecimal].\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . internal . InlineOnly public inline fun BigInteger . toBigDecimal ( scale : Int = , mathContext : MathContext = MathContext . UNLIMITED ) : BigDecimal","body":"= BigDecimal ( this , scale , mathContext )","docstring":"/**\n * Returns the value of this [BigInteger] number as a [BigDecimal]\n * scaled according to the specified [scale] and rounded according to the settings specified with [mathContext].\n *\n * @param scale the scale of the resulting [BigDecimal], i.e. number of decimal places of the fractional part.\n * By default 0.\n */"} {"signature":"fun analyze ( element : KtElement )","body":"{ val project = element . project val nextInlineFunctions = HashSet < KtDeclarationWithBody > ( ) val collector = InlineFunctionsCollector ( project , analyzeOnlyReifiedInlineFunctions ) { declaration -> if ( ! analyzedElements . contains ( declaration ) ) { nextInlineFunctions . add ( declaration ) } } val propertyAccessor = InlineDelegatedPropertyAccessorsAnalyzer ( analysisContext , collector ) element . accept ( object : KtTreeVisitorVoid ( ) { override fun visitExpression ( expression : KtExpression ) { super . visitExpression ( expression ) val bindingContext = analysisContext . analyze ( expression ) val call = bindingContext . get ( BindingContext . CALL , expression ) ? : return val resolvedCall = bindingContext . get ( BindingContext . RESOLVED_CALL , call ) collector . checkResolveCall ( resolvedCall ) } override fun visitDestructuringDeclaration ( destructuringDeclaration : KtDestructuringDeclaration ) { super . visitDestructuringDeclaration ( destructuringDeclaration ) val bindingContext = analysisContext . analyze ( destructuringDeclaration ) for ( entry in destructuringDeclaration . entries ) { val resolvedCall = bindingContext . get ( BindingContext . COMPONENT_RESOLVED_CALL , entry ) collector . checkResolveCall ( resolvedCall ) } } override fun visitForExpression ( expression : KtForExpression ) { super . visitForExpression ( expression ) val bindingContext = analysisContext . analyze ( expression ) collector . checkResolveCall ( bindingContext . get ( BindingContext . LOOP_RANGE_ITERATOR_RESOLVED_CALL , expression . loopRange ) ) collector . checkResolveCall ( bindingContext . get ( BindingContext . LOOP_RANGE_HAS_NEXT_RESOLVED_CALL , expression . loopRange ) ) collector . checkResolveCall ( bindingContext . get ( BindingContext . LOOP_RANGE_NEXT_RESOLVED_CALL , expression . loopRange ) ) } override fun visitProperty ( property : KtProperty ) { super . visitProperty ( property ) propertyAccessor . visitProperty ( property ) } } ) analyzedElements . add ( element ) if ( nextInlineFunctions . isNotEmpty ( ) ) { for ( inlineFunction in nextInlineFunctions ) { if ( inlineFunction . bodyExpression != null ) { inlineFunctionsWithBody . add ( inlineFunction ) analyze ( inlineFunction ) } } analyzedElements . addAll ( nextInlineFunctions ) } }","docstring":"/**\n * Collects all inline function calls in an [element] (usually a file) and follows each transitively.\n */"} {"signature":"fun allFiles ( ) : List < KtFile >","body":"= analyzedElements . mapTo ( mutableSetOf ( ) ) { it . containingKtFile } . toList ( )","docstring":"/**\n * Returns the list of files that contain all reached inline functions.\n */"} {"signature":"fun inlineObjectDeclarations ( ) : Set < KtObjectDeclaration >","body":"{ val results = mutableSetOf < KtObjectDeclaration > ( ) inlineFunctionsWithBody . forEach { inlineFunction -> val body = inlineFunction . bodyExpression ? : return@forEach body . accept ( object : KtTreeVisitorVoid ( ) { override fun visitObjectLiteralExpression ( expression : KtObjectLiteralExpression ) { super . visitObjectLiteralExpression ( expression ) results . add ( expression . objectDeclaration ) } } ) } return results }","docstring":"/**\n * Returns the set of [KtObjectDeclaration]s which are defined as an object literal in one of the reached inline functions.\n */"} {"signature":"public fun createVariant ( variantName : String , block : Action < KoverVariantCreateConfig > )","body":"public fun createVariant ( variantName : String , block : Action < KoverVariantCreateConfig > )","docstring":"/**\n * Create custom report variant with name [variantName].\n * In it is acceptable to add information from other variants of the current project, as well as `kover` dependencies.\n */"} {"signature":"public fun providedVariant ( variantName : String , block : Action < KoverVariantConfig > )","body":"public fun providedVariant ( variantName : String , block : Action < KoverVariantConfig > )","docstring":"/**\n * Configure the variant with name [variantName] that is automatically created in the current project.\n * For example, `\"jvm\"` for JVM target or `\"debug\"` for Android build variant.\n */"} {"signature":"public fun totalVariant ( block : Action < KoverVariantConfig > )","body":"public fun totalVariant ( block : Action < KoverVariantConfig > )","docstring":"/**\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 */"} {"signature":"public fun instrumentation ( block : Action < KoverProjectInstrumentation > )","body":"public fun instrumentation ( block : Action < KoverProjectInstrumentation > )","docstring":"/**\n * Instrumentation settings for the current Gradle project.\n *\n * Instrumentation is the modification of classes when they are loaded into the JVM, which helps to determine which code was called and which was not.\n * Instrumentation changes the bytecode of the class, so it may disable some JVM optimizations, slow down performance and concurrency tests, and may also be incompatible with other instrumentation libraries.\n *\n * For this reason, it may be necessary to fine-tune the instrumentation, for example, disabling instrumentation for problematic classes. Note that such classes would be marked as uncovered because of that.\n *\n * Example:\n * ```\n * instrumentation {\n * // disable instrumentation of test tasks of all classes\n * disabledForAll = true\n *\n * // disable instrumentation of test task `test2`\n * disabledForTasks.add(\"test2\")\n *\n * // The coverage of the test1 and test2 tasks will no longer be taken into account in the reports\n * // as well as these tasks will not be called when generating the report.\n * // These tasks will not be instrumented even if you explicitly run them\n * disabledForTestTasks.addAll(\"test1\", \"test2\")\n *\n * // disable instrumentation of specified classes in test tasks\n * excludedClasses.addAll(\"foo.bar.*Biz\", \"*\\$Generated\")\n * }\n * ```\n */"} {"signature":"public fun sources ( block : Action < KoverVariantSources > )","body":"public fun sources ( block : Action < KoverVariantSources > )","docstring":"/**\n * Limit the classes that will be included in the reports.\n * These settings do not affect the instrumentation of classes.\n *\n * The settings specified here affect all reports in any projects that use the current project depending on.\n * However, these settings should be used to regulate classes specific only to the project in which this setting is specified.\n *\n * Example:\n * ```\n * sources {\n * // exclude classes compiled by Java compiler from all reports\n * excludeJava = true\n *\n * // exclude source classes of specified source sets from all reports\n * excludedSourceSets.addAll(excludedSourceSet)\n * ```\n */"} {"signature":"public fun add ( vararg variantNames : String , optional : Boolean = false )","body":"public fun add ( vararg variantNames : String , optional : Boolean = false )","docstring":"/**\n * Add to created variant classes, tests and instrumented classes from report variant with name [variantNames].\n * This variant is taken only from the current project.\n *\n * If [optional] is `false` and a variant with given name is not found in the current project, an error [KoverIllegalConfigException] is thrown.\n */"} {"signature":"public fun addWithDependencies ( vararg variantNames : String , optional : Boolean = false )","body":"public fun addWithDependencies ( vararg variantNames : String , optional : Boolean = false )","docstring":"/**\n * Add to created variant classes, tests and instrumented classes from report variant with name [variantNames].\n * This variant is taken from the current project and all `kover(project(\"name\"))` dependency projects.\n *\n * If [optional] is `false` and a variant with given name is not found in the current project, an error [KoverIllegalConfigException] is thrown.\n *\n * If [optional] is `true` and a variant with given name is not found in the current project - in this case, the variant will not be searched even in dependencies.\n */"} {"signature":"public fun add ( variantNames : Iterable < String > , optional : Boolean = false )","body":"public fun add ( variantNames : Iterable < String > , optional : Boolean = false )","docstring":"/**\n * Add to created variant classes, tests and instrumented classes from report variant with name [variantNames].\n * These variants are taken only from the current project.\n *\n * If [optional] is `false` and a variant with given name is not found in the current project, an error [KoverIllegalConfigException] is thrown.\n */"} {"signature":"public fun addWithDependencies ( variantNames : Iterable < String > , optional : Boolean = false )","body":"public fun addWithDependencies ( variantNames : Iterable < String > , optional : Boolean = false )","docstring":"/**\n * Add to created variant classes, tests and instrumented classes from report variant with name [variantNames].\n * These variants are taken from the current project and all `kover(project(\"name\"))` dependency projects.\n *\n * If [optional] is `false` and a variant with given name is not found in the current project, an error [KoverIllegalConfigException] is thrown.\n *\n * If [optional] is `true` and a variant with given name is not found in the current project - in this case, the variant will not be searched even in dependencies.\n */"} {"signature":"public actual fun < T > lazy ( initializer : ( ) -> T ) : Lazy < T >","body":"= SynchronizedLazyImpl ( initializer )","docstring":"/**\n * Creates a new instance of the [Lazy] that uses the specified initialization function [initializer]\n * and the default thread-safety mode [LazyThreadSafetyMode.SYNCHRONIZED].\n *\n * If the initialization of a value throws an exception, it will attempt to reinitialize the value at next access.\n *\n * Note that the returned instance uses itself to synchronize on. Do not synchronize from external code on\n * the returned instance as it may cause accidental deadlock. Also this behavior can be changed in the future.\n */"} {"signature":"public actual fun < T > lazy ( mode : LazyThreadSafetyMode , initializer : ( ) -> T ) : Lazy < T >","body":"= when ( mode ) { LazyThreadSafetyMode . SYNCHRONIZED -> SynchronizedLazyImpl ( initializer ) LazyThreadSafetyMode . PUBLICATION -> SafePublicationLazyImpl ( initializer ) LazyThreadSafetyMode . NONE -> UnsafeLazyImpl ( initializer ) }","docstring":"/**\n * Creates a new instance of the [Lazy] that uses the specified initialization function [initializer]\n * and thread-safety [mode].\n *\n * If the initialization of a value throws an exception, it will attempt to reinitialize the value at next access.\n *\n * Note that when the [LazyThreadSafetyMode.SYNCHRONIZED] mode is specified the returned instance uses itself\n * to synchronize on. Do not synchronize from external code on the returned instance as it may cause accidental deadlock.\n * Also this behavior can be changed in the future.\n */"} {"signature":"public actual fun < T > lazy ( lock : Any ? , initializer : ( ) -> T ) : Lazy < T >","body":"= SynchronizedLazyImpl ( initializer , lock )","docstring":"/**\n * Creates a new instance of the [Lazy] that uses the specified initialization function [initializer]\n * and the default thread-safety mode [LazyThreadSafetyMode.SYNCHRONIZED].\n *\n * If the initialization of a value throws an exception, it will attempt to reinitialize the value at next access.\n *\n * The returned instance uses the specified [lock] object to synchronize on.\n * When the [lock] is not specified the instance uses itself to synchronize on,\n * in this case do not synchronize from external code on the returned instance as it may cause accidental deadlock.\n * Also this behavior can be changed in the future.\n */"} {"signature":"private fun buildNullableArgToString ( argument : IrExpression ) : IrExpression","body":"= if ( argument . type . isNullable ( ) ) { builder . irBlock { nullableArgToStringType ( argument , context . irBuiltIns . stringType , irString ( \"\" ) ) } } else buildNonNullableArgToString ( argument )","docstring":"/** Builds snippet of type String\n * - \"if(argument==null) \"null\" else argument.toString()\", if argument's type is nullable. Note: fortunately, all \"null\" string structures are unified\n * - \"argument.toString()\", otherwise\n * Note: should side effects are possible, temporary val is introduced\n */"} {"signature":"private fun buildArgForAppend ( argument : IrExpression ) : IrExpression","body":"= if ( argument . type . isNullable ( ) ) { builder . irBlock { nullableArgToStringType ( argument , context . irBuiltIns . stringType . makeNullable ( ) , irNull ( ) ) } } else { buildNonNullableArgToString ( argument ) }","docstring":"/** Builds snippet of type String?\n * - \"if(argument==null) null else argument.toString()\" (that is similar to \"argument?.toString()\"), if argument's type is nullable.\n * - \"argument.toString()\", otherwise\n * Note: should side effects are possible, temporary val is introduced\n */"} {"signature":"private fun IrBlockBuilder . nullableArgToStringType ( argument : IrExpression , stringType : IrType , ifNull : IrExpression )","body":"{ val ( firstExpression , secondExpression ) = twoExpressionsForSubsequentUsages ( argument ) + irIfThenElse ( stringType , condition = irEqeqeq ( firstExpression , irNull ( ) ) , thenPart = ifNull , elsePart = buildNonNullableArgToString ( secondExpression ) , origin = null ) }","docstring":"/** Builds snippet of type String:\n * val arg = argument\n * if (arg==null) ifNull else arg.toString()\n * In case \"argument\" is IrGetValue => temporary val is omitted due to side effect absence\n */"} {"signature":"private fun buildNonNullableArgToString ( argument : IrExpression ) : IrExpression","body":"{ return if ( argument . type . isString ( ) || argument . type . isNullableString ( ) ) argument else { val calleeOrNull = argument . type . classOrNull ? . owner ? . functions ? . singleOrNull { it . name == OperatorNameConventions . TO_STRING && it . valueParameters . isEmpty ( ) } ? . symbol val callee = calleeOrNull ? : context . ir . symbols . memberToString builder . irCall ( callee , callee . owner . returnType , valueArgumentsCount = , typeArgumentsCount = ) . apply { dispatchReceiver = argument } } }","docstring":"/** Builds snippet of type String\n * - \"argument\", in case argument's type is String, since String.toString() is no-op\n * - \"argument\", in case argument's type is String?, due to smart-cast and no-op\n * - \"argument.toString()\", otherwise\n */"} {"signature":"private fun IrBlockBuilder . twoExpressionsForSubsequentUsages ( argument : IrExpression ) : Pair < IrExpression , IrExpression >","body":"= if ( argument is IrGetValue ) Pair ( argument , argument . shallowCopy ( ) ) else createTmpVariable ( argument ) . let { Pair ( irGet ( it ) , irGet ( it ) ) }","docstring":"/**\n * This function returns two expressions based on the parameter:\n * - , should its second usage be idempotent and have runtime cost not greater than local val read.\n * This reduces excessive local variable usage without performance degradation.\n * - , otherwise.\n */"} {"signature":"override fun transformWhenExpression ( whenExpression : FirWhenExpression , data : Any ? ) : FirStatement","body":"{ processExhaustivenessCheck ( whenExpression ) bodyResolveComponents . session . enumWhenTracker ? . reportEnumUsageInWhen ( bodyResolveComponents . file . sourceFile ? . path , getSubjectType ( bodyResolveComponents . session , whenExpression ) ) return whenExpression }","docstring":"/**\n * The synthetic call for the whole [whenExpression] might be not completed yet\n */"} {"signature":"@ JvmName ( \"\" ) public fun < D : Dimension > MultiArray < ComplexDouble , D > . conj ( ) : MultiArray < ComplexDouble , D >","body":"= this . map { it . conjugate ( ) }","docstring":"/**\n * Transforms this [MultiArray] of [ComplexDouble] to an [NDArray] of the conjugated value.\n * Dimensions are preserved.\n *\n * @param D dimension.\n * @return [NDArray] of conjugated [ComplexDouble]\n */"} {"signature":"@ JvmName ( \"\" ) public fun < D : Dimension > MultiArray < ComplexFloat , D > . conj ( ) : MultiArray < ComplexFloat , D >","body":"= this . map { it . conjugate ( ) }","docstring":"/**\n * Transforms this [MultiArray] of [ComplexFloat] to an [NDArray] of the conjugated value.\n * Dimensions are preserved.\n *\n * @param D dimension.\n * @return [NDArray] of conjugated [ComplexFloat]\n */"} {"signature":"@ kotlin . internal . InlineOnly public actual inline fun < T > Collection < T > . toTypedArray ( ) : Array < T >","body":"= copyToArray ( this )","docstring":"/**\n * Returns a *typed* array containing all the elements of this collection.\n *\n * Allocates an array of runtime type `T` having its size equal to the size of this collection\n * and populates the array with the elements of this collection.\n * @sample samples.collections.Collections.Collections.collectionToTypedArray\n */"} {"signature":"public fun convert ( activationType : Activations ) : Activation","body":"{ return when ( activationType ) { Sigmoid -> SigmoidActivation ( ) Linear -> LinearActivation ( ) Tanh -> TanhActivation ( ) TanhShrink -> TanhShrinkActivation ( ) Relu -> ReluActivation ( ) Relu6 -> Relu6Activation ( ) Elu -> EluActivation ( ) Selu -> SeluActivation ( ) Softmax -> SoftmaxActivation ( ) LogSoftmax -> LogSoftmaxActivation ( ) Exponential -> ExponentialActivation ( ) SoftPlus -> SoftPlusActivation ( ) SoftSign -> SoftSignActivation ( ) HardSigmoid -> HardSigmoidActivation ( ) Swish -> SwishActivation ( ) Mish -> MishActivation ( ) HardShrink -> HardShrinkActivation ( ) SoftShrink -> SoftShrinkActivation ( ) LiSHT -> LishtActivation ( ) Snake -> SnakeActivation ( ) Gelu -> GeluActivation ( ) Sparsemax -> SparsemaxActivation ( ) } }","docstring":"/**\n * Converts [activationType] to the appropriate [Activation] subclass.\n */"} {"signature":"public actual fun append ( value : Char ) : Appendable","body":"public actual fun append ( value : Char ) : Appendable","docstring":"/**\n * Appends the specified character [value] to this Appendable and returns this instance.\n *\n * @param value the character to append.\n */"} {"signature":"public actual fun append ( value : CharSequence ? ) : Appendable","body":"public actual fun append ( value : CharSequence ? ) : Appendable","docstring":"/**\n * Appends the specified character sequence [value] to this Appendable and returns this instance.\n *\n * @param value the character sequence to append. If [value] is `null`, then the four characters `\"null\"` are appended to this Appendable.\n */"} {"signature":"public actual fun append ( value : CharSequence ? , startIndex : Int , endIndex : Int ) : Appendable","body":"public actual fun append ( value : CharSequence ? , startIndex : Int , endIndex : Int ) : Appendable","docstring":"/**\n * Appends a subsequence of the specified character sequence [value] to this Appendable and returns this instance.\n *\n * @param value the character sequence from which a subsequence is appended. If [value] is `null`,\n * then characters are appended as if [value] contained the four characters `\"null\"`.\n * @param startIndex the beginning (inclusive) of the subsequence to append.\n * @param endIndex the end (exclusive) of the subsequence to append.\n *\n * @throws IndexOutOfBoundsException or [IllegalArgumentException] when [startIndex] or [endIndex] is out of range of the [value] character sequence indices or when `startIndex > endIndex`.\n */"} {"signature":"fun register ( source : String , destination : String , configure : DokkaTemplateProjectSpec . ( ) -> Unit = { } , )","body":"{ val name = source . toAlphaNumericCamelCase ( ) templateProjects . register ( name ) { this . sourcePath . set ( source ) this . destinationPath . set ( destination ) configure ( ) } }","docstring":"/**\n * Copy a directory from the Dokka source project into a local directory.\n *\n * @param[source] Source dir, relative to [templateProjectsDir]\n * @param[destination] Destination dir, relative to [destinationBaseDir]\n */"} {"signature":"private fun Project . copyCInteropFileForIdeIfNecessary ( file : File ) : File","body":"{ if ( ! file . exists ( ) ) return file val newFileName = \"\" val outputFile = kotlinCInteropLibraryDirectoryForIde . resolve ( newFileName ) if ( ! outputFile . exists ( ) ) { file . copyTo ( outputFile ) } return outputFile }","docstring":"/**\n * Copies the file into a directory specifically for the IDE, so it survives ./gradlew clean\n */"} {"signature":"fun resnet18LightAPIPrediction ( )","body":"{ val modelHub = ONNXModelHub ( cacheDirectory = File ( \"\" ) ) val model = ONNXModels . CV . ResNet18 . pretrainedModel ( modelHub ) model . printSummary ( ) model . use { for ( i in .. ) { val imageFile = getFileFromResource ( \"\" ) val recognizedObject = it . predictObject ( imageFile = imageFile ) println ( recognizedObject ) val top5 = it . predictTopKObjects ( imageFile = imageFile , topK = ) println ( top5 . toString ( ) ) } } }","docstring":"/**\n * This examples demonstrates the light-weight inference API with [ImageRecognitionModel] on ResNet'18 model:\n * - Model is obtained from [ONNXModelHub].\n * - Model predicts on a few images located in resources.\n */"} {"signature":"fun main ( ) : Unit","body":"= resnet18LightAPIPrediction ( )","docstring":"/** */"} {"signature":"fun foo ( )","body":"{ }","docstring":"/**\n * [A.toName.length]\n */"} {"signature":"@ ExperimentalEncodingApi public fun Base64 . encodeToByteArray ( source : ByteString , startIndex : Int = , endIndex : Int = source . size ) : ByteArray","body":"{ return encodeToByteArray ( source . getBackingArrayReference ( ) , startIndex , endIndex ) }","docstring":"/**\n * Encodes bytes from the specified [source] byte string or its subrange.\n * Returns a [ByteArray] containing the resulting symbols.\n *\n * If the size of the [source] byte string or its subrange is not an integral multiple of 3,\n * the result is padded with `'='` to an integral multiple of 4 symbols.\n *\n * Each resulting symbol occupies one byte in the returned byte array.\n *\n * Use [encode] to get the output in string form.\n *\n * @param source the byte string to encode bytes from.\n * @param startIndex the beginning (inclusive) of the subrange to encode, 0 by default.\n * @param endIndex the end (exclusive) of the subrange to encode, size of the [source] byte string by default.\n *\n * @throws IndexOutOfBoundsException when [startIndex] or [endIndex] is out of range of [source] byte string indices.\n * @throws IllegalArgumentException when `startIndex > endIndex`.\n *\n * @return a [ByteArray] with the resulting symbols.\n */"} {"signature":"@ ExperimentalEncodingApi public fun Base64 . encodeIntoByteArray ( source : ByteString , destination : ByteArray , destinationOffset : Int = , startIndex : Int = , endIndex : Int = source . size ) : Int","body":"{ return encodeIntoByteArray ( source . getBackingArrayReference ( ) , destination , destinationOffset , startIndex , endIndex ) }","docstring":"/**\n * Encodes bytes from the specified [source] byte string or its subrange and writes resulting symbols into the [destination] array.\n * Returns the number of symbols written.\n *\n * If the size of the [source] byte string or its subrange is not an integral multiple of 3,\n * the result is padded with `'='` to an integral multiple of 4 symbols.\n *\n * @param source the byte string to encode bytes from.\n * @param destination the array to write symbols into.\n * @param destinationOffset the starting index in the [destination] array to write symbols to, 0 by default.\n * @param startIndex the beginning (inclusive) of the subrange to encode, 0 by default.\n * @param endIndex the end (exclusive) of the subrange to encode, size of the [source] byte string by default.\n *\n * @throws IndexOutOfBoundsException when [startIndex] or [endIndex] is out of range of [source] byte string indices.\n * @throws IllegalArgumentException when `startIndex > endIndex`.\n * @throws IndexOutOfBoundsException when the resulting symbols don'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 *\n * @return the number of symbols written into [destination] array.\n */"} {"signature":"@ ExperimentalEncodingApi public fun Base64 . encode ( source : ByteString , startIndex : Int = , endIndex : Int = source . size ) : String","body":"{ return encode ( source . getBackingArrayReference ( ) , startIndex , endIndex ) }","docstring":"/**\n * Encodes bytes from the specified [source] byte string or its subrange.\n * Returns a string with the resulting symbols.\n *\n * If the size of the [source] byte string or its subrange is not an integral multiple of 3,\n * the result is padded with `'='` to an integral multiple of 4 symbols.\n *\n * Use [encodeToByteArray] to get the output in [ByteArray] form.\n *\n * @param source the byte string to encode bytes from.\n * @param startIndex the beginning (inclusive) of the subrange to encode, 0 by default.\n * @param endIndex the end (exclusive) of the subrange to encode, size of the [source] byte string by default.\n *\n * @throws IndexOutOfBoundsException when [startIndex] or [endIndex] is out of range of [source] byte string indices.\n * @throws IllegalArgumentException when `startIndex > endIndex`.\n *\n * @return a string with the resulting symbols.\n */"} {"signature":"@ ExperimentalEncodingApi public fun < A : Appendable > Base64 . encodeToAppendable ( source : ByteString , destination : A , startIndex : Int = , endIndex : Int = source . size ) : A","body":"{ return encodeToAppendable ( source . getBackingArrayReference ( ) , destination , startIndex , endIndex ) }","docstring":"/**\n * Encodes bytes from the specified [source] byte string or its subrange and appends resulting symbols to the [destination] appendable.\n * Returns the destination appendable.\n *\n * If the size of the [source] byte string or its subrange is not an integral multiple of 3,\n * the result is padded with `'='` to an integral multiple of 4 symbols.\n *\n * @param source the byte string to encode bytes from.\n * @param destination the appendable to append symbols to.\n * @param startIndex the beginning (inclusive) of the subrange to encode, 0 by default.\n * @param endIndex the end (exclusive) of the subrange to encode, size of the [source] byte string by default.\n *\n * @throws IndexOutOfBoundsException when [startIndex] or [endIndex] is out of range of [source] byte string indices.\n * @throws IllegalArgumentException when `startIndex > endIndex`.\n *\n * @return the destination appendable.\n */"} {"signature":"@ ExperimentalEncodingApi public fun Base64 . decode ( source : ByteString , startIndex : Int = , endIndex : Int = source . size ) : ByteArray","body":"{ return decode ( source . getBackingArrayReference ( ) , startIndex , endIndex ) }","docstring":"/**\n * Decodes symbols from the specified [source] byte string or its subrange.\n * Returns a [ByteArray] containing the resulting bytes.\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 encoded byte data. Subsequent symbols are prohibited.\n *\n * @param source the byte string to decode symbols from.\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 the [source] byte string by default.\n *\n * @throws IndexOutOfBoundsException when [startIndex] or [endIndex] is out of range of [source] byte string indices.\n * @throws IllegalArgumentException when `startIndex > endIndex`.\n * @throws IllegalArgumentException when the symbols for decoding are padded incorrectly or there are extra symbols after the padding.\n *\n * @return a [ByteArray] with the resulting bytes.\n */"} {"signature":"@ ExperimentalEncodingApi public fun Base64 . decodeToByteString ( source : CharSequence , startIndex : Int = , endIndex : Int = source . length ) : ByteString","body":"{ return ByteString . wrap ( decode ( source , startIndex , endIndex ) ) }","docstring":"/**\n * Decodes symbols from the specified [source] char sequence or its substring.\n * Returns a [ByteString] containing the resulting bytes.\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 encoded byte data. Subsequent symbols are prohibited.\n *\n * @param source the char sequence to decode symbols from.\n * @param startIndex the beginning (inclusive) of the substring to decode, 0 by default.\n * @param endIndex the end (exclusive) of the substring to decode, length of the [source] by default.\n *\n * @throws IndexOutOfBoundsException when [startIndex] or [endIndex] is out of range of [source] indices.\n * @throws IllegalArgumentException when `startIndex > endIndex`.\n * @throws IllegalArgumentException when the symbols for decoding are padded incorrectly or there are extra symbols after the padding.\n *\n * @return a [ByteArray] with the resulting bytes.\n */"} {"signature":"@ ExperimentalEncodingApi public fun Base64 . decodeIntoByteArray ( source : ByteString , destination : ByteArray , destinationOffset : Int = , startIndex : Int = , endIndex : Int = source . size ) : Int","body":"{ return decodeIntoByteArray ( source . getBackingArrayReference ( ) , destination , destinationOffset , startIndex , endIndex ) }","docstring":"/**\n * Decodes symbols from the specified [source] byte string or its subrange and writes resulting bytes into the [destination] array.\n * Returns the number of bytes written.\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 encoded byte data. Subsequent symbols are prohibited.\n *\n * @param source the byte string to decode symbols from.\n * @param destination the array to write bytes into.\n * @param destinationOffset the starting index in the [destination] array to write bytes to, 0 by default.\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 the [source] byte string by default.\n *\n * @throws IndexOutOfBoundsException when [startIndex] or [endIndex] is out of range of [source] byte string indices.\n * @throws IllegalArgumentException when `startIndex > endIndex`.\n * @throws IndexOutOfBoundsException when the resulting bytes don'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 * @throws IllegalArgumentException when the symbols for decoding are padded incorrectly or there are extra symbols after the padding.\n *\n * @return the number of bytes written into [destination] array.\n */"} {"signature":"@ ExperimentalEncodingApi public fun Base64 . decodeToByteString ( source : ByteArray , startIndex : Int = , endIndex : Int = source . size ) : ByteString","body":"{ return ByteString . wrap ( decode ( source , startIndex , endIndex ) ) }","docstring":"/**\n * Decodes symbols from the specified [source] byte string or its subrange.\n * Returns a [ByteString] containing the resulting bytes.\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 encoded byte data. Subsequent symbols are prohibited.\n *\n * @param source the byte string to decode symbols from.\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 the [source] byte string by default.\n *\n * @throws IndexOutOfBoundsException when [startIndex] or [endIndex] is out of range of [source] byte string indices.\n * @throws IllegalArgumentException when `startIndex > endIndex`.\n * @throws IllegalArgumentException when the symbols for decoding are padded incorrectly or there are extra symbols after the padding.\n *\n * @return a [ByteString] with the resulting bytes.\n */"} {"signature":"@ ExperimentalEncodingApi public fun Base64 . decodeToByteString ( source : ByteString , startIndex : Int = , endIndex : Int = source . size ) : ByteString","body":"{ return ByteString . wrap ( decode ( source . getBackingArrayReference ( ) , startIndex , endIndex ) ) }","docstring":"/**\n * Decodes symbols from the specified [source] byte string or its subrange.\n * Returns a [ByteString] containing the resulting bytes.\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 encoded byte data. Subsequent symbols are prohibited.\n *\n * @param source the byte string to decode symbols from.\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 the [source] byte string by default.\n *\n * @throws IndexOutOfBoundsException when [startIndex] or [endIndex] is out of range of [source] byte string indices.\n * @throws IllegalArgumentException when `startIndex > endIndex`.\n * @throws IllegalArgumentException when the symbols for decoding are padded incorrectly or there are extra symbols after the padding.\n *\n * @return a [ByteString] with the resulting bytes.\n */"} {"signature":"public expect fun CharSequence . elementAt ( index : Int ) : Char","body":"public expect fun CharSequence . elementAt ( index : Int ) : Char","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":"@ kotlin . internal . InlineOnly public inline fun CharSequence . elementAtOrElse ( index : Int , defaultValue : ( Int ) -> Char ) : Char","body":"{ contract { callsInPlace ( defaultValue , InvocationKind . AT_MOST_ONCE ) } return if ( index in indices ) get ( index ) else defaultValue ( index ) }","docstring":"/**\n * Returns a character at the given [index] or the result of calling the [defaultValue] function if the [index] is out of bounds of this char sequence.\n * \n * @sample samples.collections.Collections.Elements.elementAtOrElse\n */"} {"signature":"@ kotlin . internal . InlineOnly public inline fun CharSequence . elementAtOrNull ( index : Int ) : Char ?","body":"{ return this . getOrNull ( index ) }","docstring":"/**\n * Returns a character at the given [index] or `null` if the [index] is out of bounds of this char sequence.\n * \n * @sample samples.collections.Collections.Elements.elementAtOrNull\n */"} {"signature":"@ kotlin . internal . InlineOnly public inline fun CharSequence . find ( predicate : ( Char ) -> Boolean ) : Char ?","body":"{ return firstOrNull ( predicate ) }","docstring":"/**\n * Returns the first character matching the given [predicate], or `null` if no such character was found.\n * \n * @sample samples.collections.Collections.Elements.find\n */"} {"signature":"@ kotlin . internal . InlineOnly public inline fun CharSequence . findLast ( predicate : ( Char ) -> Boolean ) : Char ?","body":"{ return lastOrNull ( predicate ) }","docstring":"/**\n * Returns the last character matching the given [predicate], or `null` if no such character was found.\n * \n * @sample samples.collections.Collections.Elements.find\n */"} {"signature":"public fun CharSequence . first ( ) : Char","body":"{ if ( isEmpty ( ) ) throw NoSuchElementException ( \"\" ) return this [ ] }","docstring":"/**\n * Returns the first character.\n * \n * @throws NoSuchElementException if the char sequence is empty.\n */"} {"signature":"public inline fun CharSequence . first ( predicate : ( Char ) -> Boolean ) : Char","body":"{ for ( element in this ) if ( predicate ( element ) ) return element throw NoSuchElementException ( \"\" ) }","docstring":"/**\n * Returns the first character matching the given [predicate].\n * @throws [NoSuchElementException] if no such character is found.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . internal . InlineOnly public inline fun < R : Any > CharSequence . firstNotNullOf ( transform : ( Char ) -> R ? ) : R","body":"{ return firstNotNullOfOrNull ( transform ) ? : throw NoSuchElementException ( \"\" ) }","docstring":"/**\n * Returns the first non-null value produced by [transform] function being applied to characters of this char sequence 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 < R : Any > CharSequence . firstNotNullOfOrNull ( transform : ( Char ) -> 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 characters of this char sequence 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 CharSequence . firstOrNull ( ) : Char ?","body":"{ return if ( isEmpty ( ) ) null else this [ ] }","docstring":"/**\n * Returns the first character, or `null` if the char sequence is empty.\n */"} {"signature":"public inline fun CharSequence . firstOrNull ( predicate : ( Char ) -> Boolean ) : Char ?","body":"{ for ( element in this ) if ( predicate ( element ) ) return element return null }","docstring":"/**\n * Returns the first character matching the given [predicate], or `null` if character was not found.\n */"} {"signature":"@ kotlin . internal . InlineOnly public inline fun CharSequence . getOrElse ( index : Int , defaultValue : ( Int ) -> Char ) : Char","body":"{ contract { callsInPlace ( defaultValue , InvocationKind . AT_MOST_ONCE ) } return if ( index in indices ) get ( index ) else defaultValue ( index ) }","docstring":"/**\n * Returns a character at the given [index] or the result of calling the [defaultValue] function if the [index] is out of bounds of this char sequence.\n */"} {"signature":"public fun CharSequence . getOrNull ( index : Int ) : Char ?","body":"{ return if ( index in indices ) get ( index ) else null }","docstring":"/**\n * Returns a character at the given [index] or `null` if the [index] is out of bounds of this char sequence.\n * \n * @sample samples.collections.Collections.Elements.getOrNull\n */"} {"signature":"public inline fun CharSequence . indexOfFirst ( predicate : ( Char ) -> Boolean ) : Int","body":"{ for ( index in indices ) { if ( predicate ( this [ index ] ) ) { return index } } return - }","docstring":"/**\n * Returns index of the first character matching the given [predicate], or -1 if the char sequence does not contain such character.\n */"} {"signature":"public inline fun CharSequence . indexOfLast ( predicate : ( Char ) -> Boolean ) : Int","body":"{ for ( index in indices . reversed ( ) ) { if ( predicate ( this [ index ] ) ) { return index } } return - }","docstring":"/**\n * Returns index of the last character matching the given [predicate], or -1 if the char sequence does not contain such character.\n */"} {"signature":"public fun CharSequence . last ( ) : Char","body":"{ if ( isEmpty ( ) ) throw NoSuchElementException ( \"\" ) return this [ lastIndex ] }","docstring":"/**\n * Returns the last character.\n * \n * @throws NoSuchElementException if the char sequence is empty.\n * \n * @sample samples.text.Strings.last\n */"} {"signature":"public inline fun CharSequence . last ( predicate : ( Char ) -> Boolean ) : Char","body":"{ for ( index in this . indices . reversed ( ) ) { val element = this [ index ] if ( predicate ( element ) ) return element } throw NoSuchElementException ( \"\" ) }","docstring":"/**\n * Returns the last character matching the given [predicate].\n * \n * @throws NoSuchElementException if no such character is found.\n * \n * @sample samples.text.Strings.last\n */"} {"signature":"public fun CharSequence . lastOrNull ( ) : Char ?","body":"{ return if ( isEmpty ( ) ) null else this [ length - ] }","docstring":"/**\n * Returns the last character, or `null` if the char sequence is empty.\n * \n * @sample samples.text.Strings.last\n */"} {"signature":"public inline fun CharSequence . lastOrNull ( predicate : ( Char ) -> Boolean ) : Char ?","body":"{ for ( index in this . indices . reversed ( ) ) { val element = this [ index ] if ( predicate ( element ) ) return element } return null }","docstring":"/**\n * Returns the last character matching the given [predicate], or `null` if no such character was found.\n * \n * @sample samples.text.Strings.last\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . internal . InlineOnly public inline fun CharSequence . random ( ) : Char","body":"{ return random ( Random ) }","docstring":"/**\n * Returns a random character from this char sequence.\n * \n * @throws NoSuchElementException if this char sequence is empty.\n */"} {"signature":"@ SinceKotlin ( \"\" ) public fun CharSequence . random ( random : Random ) : Char","body":"{ if ( isEmpty ( ) ) throw NoSuchElementException ( \"\" ) return get ( random . nextInt ( length ) ) }","docstring":"/**\n * Returns a random character from this char sequence using the specified source of randomness.\n * \n * @throws NoSuchElementException if this char sequence is empty.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . internal . InlineOnly public inline fun CharSequence . randomOrNull ( ) : Char ?","body":"{ return randomOrNull ( Random ) }","docstring":"/**\n * Returns a random character from this char sequence, or `null` if this char sequence is empty.\n */"} {"signature":"@ SinceKotlin ( \"\" ) public fun CharSequence . randomOrNull ( random : Random ) : Char ?","body":"{ if ( isEmpty ( ) ) return null return get ( random . nextInt ( length ) ) }","docstring":"/**\n * Returns a random character from this char sequence using the specified source of randomness, or `null` if this char sequence is empty.\n */"} {"signature":"public fun CharSequence . single ( ) : Char","body":"{ return when ( length ) { -> throw NoSuchElementException ( \"\" ) -> this [ ] else -> throw IllegalArgumentException ( \"\" ) } }","docstring":"/**\n * Returns the single character, or throws an exception if the char sequence is empty or has more than one character.\n */"} {"signature":"public inline fun CharSequence . single ( predicate : ( Char ) -> Boolean ) : Char","body":"{ var single : Char ? = 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 Char }","docstring":"/**\n * Returns the single character matching the given [predicate], or throws exception if there is no or more than one matching character.\n */"} {"signature":"public fun CharSequence . singleOrNull ( ) : Char ?","body":"{ return if ( length == ) this [ ] else null }","docstring":"/**\n * Returns single character, or `null` if the char sequence is empty or has more than one character.\n */"} {"signature":"public inline fun CharSequence . singleOrNull ( predicate : ( Char ) -> Boolean ) : Char ?","body":"{ var single : Char ? = 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 character matching the given [predicate], or `null` if character was not found or more than one character was found.\n */"} {"signature":"public fun CharSequence . drop ( n : Int ) : CharSequence","body":"{ require ( n >= ) { \"\" } return subSequence ( n . coerceAtMost ( length ) , length ) }","docstring":"/**\n * Returns a subsequence of this char sequence with the first [n] characters removed.\n * \n * @throws IllegalArgumentException if [n] is negative.\n * \n * @sample samples.text.Strings.drop\n */"} {"signature":"public fun String . drop ( n : Int ) : String","body":"{ require ( n >= ) { \"\" } return substring ( n . coerceAtMost ( length ) ) }","docstring":"/**\n * Returns a string with the first [n] characters removed.\n * \n * @throws IllegalArgumentException if [n] is negative.\n * \n * @sample samples.text.Strings.drop\n */"} {"signature":"public fun CharSequence . dropLast ( n : Int ) : CharSequence","body":"{ require ( n >= ) { \"\" } return take ( ( length - n ) . coerceAtLeast ( ) ) }","docstring":"/**\n * Returns a subsequence of this char sequence with the last [n] characters removed.\n * \n * @throws IllegalArgumentException if [n] is negative.\n * \n * @sample samples.text.Strings.drop\n */"} {"signature":"public fun String . dropLast ( n : Int ) : String","body":"{ require ( n >= ) { \"\" } return take ( ( length - n ) . coerceAtLeast ( ) ) }","docstring":"/**\n * Returns a string with the last [n] characters removed.\n * \n * @throws IllegalArgumentException if [n] is negative.\n * \n * @sample samples.text.Strings.drop\n */"} {"signature":"public inline fun CharSequence . dropLastWhile ( predicate : ( Char ) -> Boolean ) : CharSequence","body":"{ for ( index in lastIndex downTo ) if ( ! predicate ( this [ index ] ) ) return subSequence ( , index + ) return \"\" }","docstring":"/**\n * Returns a subsequence of this char sequence containing all characters except last characters that satisfy the given [predicate].\n * \n * @sample samples.text.Strings.drop\n */"} {"signature":"public inline fun String . dropLastWhile ( predicate : ( Char ) -> Boolean ) : String","body":"{ for ( index in lastIndex downTo ) if ( ! predicate ( this [ index ] ) ) return substring ( , index + ) return \"\" }","docstring":"/**\n * Returns a string containing all characters except last characters that satisfy the given [predicate].\n * \n * @sample samples.text.Strings.drop\n */"} {"signature":"public inline fun CharSequence . dropWhile ( predicate : ( Char ) -> Boolean ) : CharSequence","body":"{ for ( index in this . indices ) if ( ! predicate ( this [ index ] ) ) return subSequence ( index , length ) return \"\" }","docstring":"/**\n * Returns a subsequence of this char sequence containing all characters except first characters that satisfy the given [predicate].\n * \n * @sample samples.text.Strings.drop\n */"} {"signature":"public inline fun String . dropWhile ( predicate : ( Char ) -> Boolean ) : String","body":"{ for ( index in this . indices ) if ( ! predicate ( this [ index ] ) ) return substring ( index ) return \"\" }","docstring":"/**\n * Returns a string containing all characters except first characters that satisfy the given [predicate].\n * \n * @sample samples.text.Strings.drop\n */"} {"signature":"public inline fun CharSequence . filter ( predicate : ( Char ) -> Boolean ) : CharSequence","body":"{ return filterTo ( StringBuilder ( ) , predicate ) }","docstring":"/**\n * Returns a char sequence containing only those characters from the original char sequence that match the given [predicate].\n * \n * @sample samples.text.Strings.filter\n */"} {"signature":"public inline fun String . filter ( predicate : ( Char ) -> Boolean ) : String","body":"{ return filterTo ( StringBuilder ( ) , predicate ) . toString ( ) }","docstring":"/**\n * Returns a string containing only those characters from the original string that match the given [predicate].\n * \n * @sample samples.text.Strings.filter\n */"} {"signature":"public inline fun CharSequence . filterIndexed ( predicate : ( index : Int , Char ) -> Boolean ) : CharSequence","body":"{ return filterIndexedTo ( StringBuilder ( ) , predicate ) }","docstring":"/**\n * Returns a char sequence containing only those characters from the original char sequence that match the given [predicate].\n * @param [predicate] function that takes the index of a character and the character itself\n * and returns the result of predicate evaluation on the character.\n * \n * @sample samples.collections.Collections.Filtering.filterIndexed\n */"} {"signature":"public inline fun String . filterIndexed ( predicate : ( index : Int , Char ) -> Boolean ) : String","body":"{ return filterIndexedTo ( StringBuilder ( ) , predicate ) . toString ( ) }","docstring":"/**\n * Returns a string containing only those characters from the original string that match the given [predicate].\n * @param [predicate] function that takes the index of a character and the character itself\n * and returns the result of predicate evaluation on the character.\n * \n * @sample samples.collections.Collections.Filtering.filterIndexed\n */"} {"signature":"public inline fun < C : Appendable > CharSequence . filterIndexedTo ( destination : C , predicate : ( index : Int , Char ) -> Boolean ) : C","body":"{ forEachIndexed { index , element -> if ( predicate ( index , element ) ) destination . append ( element ) } return destination }","docstring":"/**\n * Appends all characters matching the given [predicate] to the given [destination].\n * @param [predicate] function that takes the index of a character and the character itself\n * and returns the result of predicate evaluation on the character.\n * \n * @sample samples.collections.Collections.Filtering.filterIndexedTo\n */"} {"signature":"public inline fun CharSequence . filterNot ( predicate : ( Char ) -> Boolean ) : CharSequence","body":"{ return filterNotTo ( StringBuilder ( ) , predicate ) }","docstring":"/**\n * Returns a char sequence containing only those characters from the original char sequence that do not match the given [predicate].\n * \n * @sample samples.text.Strings.filterNot\n */"} {"signature":"public inline fun String . filterNot ( predicate : ( Char ) -> Boolean ) : String","body":"{ return filterNotTo ( StringBuilder ( ) , predicate ) . toString ( ) }","docstring":"/**\n * Returns a string containing only those characters from the original string that do not match the given [predicate].\n * \n * @sample samples.text.Strings.filterNot\n */"} {"signature":"public inline fun < C : Appendable > CharSequence . filterNotTo ( destination : C , predicate : ( Char ) -> Boolean ) : C","body":"{ for ( element in this ) if ( ! predicate ( element ) ) destination . append ( element ) return destination }","docstring":"/**\n * Appends all characters not matching the given [predicate] to the given [destination].\n * \n * @sample samples.collections.Collections.Filtering.filterTo\n */"} {"signature":"public inline fun < C : Appendable > CharSequence . filterTo ( destination : C , predicate : ( Char ) -> Boolean ) : C","body":"{ for ( index in until length ) { val element = get ( index ) if ( predicate ( element ) ) destination . append ( element ) } return destination }","docstring":"/**\n * Appends all characters matching the given [predicate] to the given [destination].\n * \n * @sample samples.collections.Collections.Filtering.filterTo\n */"} {"signature":"public fun CharSequence . slice ( indices : IntRange ) : CharSequence","body":"{ if ( indices . isEmpty ( ) ) return \"\" return subSequence ( indices ) }","docstring":"/**\n * Returns a char sequence containing characters of the original char sequence at the specified range of [indices].\n */"} {"signature":"public fun String . slice ( indices : IntRange ) : String","body":"{ if ( indices . isEmpty ( ) ) return \"\" return substring ( indices ) }","docstring":"/**\n * Returns a string containing characters of the original string at the specified range of [indices].\n */"} {"signature":"public fun CharSequence . slice ( indices : Iterable < Int > ) : CharSequence","body":"{ val size = indices . collectionSizeOrDefault ( ) if ( size == ) return \"\" val result = StringBuilder ( size ) for ( i in indices ) { result . append ( get ( i ) ) } return result }","docstring":"/**\n * Returns a char sequence containing characters of the original char sequence at specified [indices].\n */"} {"signature":"@ kotlin . internal . InlineOnly public inline fun String . slice ( indices : Iterable < Int > ) : String","body":"{ return ( this as CharSequence ) . slice ( indices ) . toString ( ) }","docstring":"/**\n * Returns a string containing characters of the original string at specified [indices].\n */"} {"signature":"public fun CharSequence . take ( n : Int ) : CharSequence","body":"{ require ( n >= ) { \"\" } return subSequence ( , n . coerceAtMost ( length ) ) }","docstring":"/**\n * Returns a subsequence of this char sequence containing the first [n] characters from this char sequence, or the entire char sequence if this char sequence is shorter.\n * \n * @throws IllegalArgumentException if [n] is negative.\n * \n * @sample samples.text.Strings.take\n */"} {"signature":"public fun String . take ( n : Int ) : String","body":"{ require ( n >= ) { \"\" } return substring ( , n . coerceAtMost ( length ) ) }","docstring":"/**\n * Returns a string containing the first [n] characters from this string, or the entire string if this string is shorter.\n * \n * @throws IllegalArgumentException if [n] is negative.\n * \n * @sample samples.text.Strings.take\n */"} {"signature":"public fun CharSequence . takeLast ( n : Int ) : CharSequence","body":"{ require ( n >= ) { \"\" } val length = length return subSequence ( length - n . coerceAtMost ( length ) , length ) }","docstring":"/**\n * Returns a subsequence of this char sequence containing the last [n] characters from this char sequence, or the entire char sequence if this char sequence is shorter.\n * \n * @throws IllegalArgumentException if [n] is negative.\n * \n * @sample samples.text.Strings.take\n */"} {"signature":"public fun String . takeLast ( n : Int ) : String","body":"{ require ( n >= ) { \"\" } val length = length return substring ( length - n . coerceAtMost ( length ) ) }","docstring":"/**\n * Returns a string containing the last [n] characters from this string, or the entire string if this string is shorter.\n * \n * @throws IllegalArgumentException if [n] is negative.\n * \n * @sample samples.text.Strings.take\n */"} {"signature":"public inline fun CharSequence . takeLastWhile ( predicate : ( Char ) -> Boolean ) : CharSequence","body":"{ for ( index in lastIndex downTo ) { if ( ! predicate ( this [ index ] ) ) { return subSequence ( index + , length ) } } return subSequence ( , length ) }","docstring":"/**\n * Returns a subsequence of this char sequence containing last characters that satisfy the given [predicate].\n * \n * @sample samples.text.Strings.take\n */"} {"signature":"public inline fun String . takeLastWhile ( predicate : ( Char ) -> Boolean ) : String","body":"{ for ( index in lastIndex downTo ) { if ( ! predicate ( this [ index ] ) ) { return substring ( index + ) } } return this }","docstring":"/**\n * Returns a string containing last characters that satisfy the given [predicate].\n * \n * @sample samples.text.Strings.take\n */"} {"signature":"public inline fun CharSequence . takeWhile ( predicate : ( Char ) -> Boolean ) : CharSequence","body":"{ for ( index in until length ) if ( ! predicate ( get ( index ) ) ) { return subSequence ( , index ) } return subSequence ( , length ) }","docstring":"/**\n * Returns a subsequence of this char sequence containing the first characters that satisfy the given [predicate].\n * \n * @sample samples.text.Strings.take\n */"} {"signature":"public inline fun String . takeWhile ( predicate : ( Char ) -> Boolean ) : String","body":"{ for ( index in until length ) if ( ! predicate ( get ( index ) ) ) { return substring ( , index ) } return this }","docstring":"/**\n * Returns a string containing the first characters that satisfy the given [predicate].\n * \n * @sample samples.text.Strings.take\n */"} {"signature":"public fun CharSequence . reversed ( ) : CharSequence","body":"{ return StringBuilder ( this ) . reverse ( ) }","docstring":"/**\n * Returns a char sequence with characters in reversed order.\n */"} {"signature":"@ kotlin . internal . InlineOnly public inline fun String . reversed ( ) : String","body":"{ return ( this as CharSequence ) . reversed ( ) . toString ( ) }","docstring":"/**\n * Returns a string with characters in reversed order.\n */"} {"signature":"public inline fun < K , V > CharSequence . associate ( transform : ( Char ) -> Pair < K , V > ) : Map < K , V >","body":"{ val capacity = mapCapacity ( length ) . coerceAtLeast ( ) return associateTo ( LinkedHashMap < K , V > ( capacity ) , transform ) }","docstring":"/**\n * Returns a [Map] containing key-value pairs provided by [transform] function\n * applied to characters of the given char sequence.\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 char sequence.\n * \n * @sample samples.text.Strings.associate\n */"} {"signature":"public inline fun < K > CharSequence . associateBy ( keySelector : ( Char ) -> K ) : Map < K , Char >","body":"{ val capacity = mapCapacity ( length ) . coerceAtLeast ( ) return associateByTo ( LinkedHashMap < K , Char > ( capacity ) , keySelector ) }","docstring":"/**\n * Returns a [Map] containing the characters from the given char sequence indexed by the key\n * returned from [keySelector] function applied to each character.\n * \n * If any two characters 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 char sequence.\n * \n * @sample samples.text.Strings.associateBy\n */"} {"signature":"public inline fun < K , V > CharSequence . associateBy ( keySelector : ( Char ) -> K , valueTransform : ( Char ) -> V ) : Map < K , V >","body":"{ val capacity = mapCapacity ( length ) . 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 characters of the given char sequence.\n * \n * If any two characters 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 char sequence.\n * \n * @sample samples.text.Strings.associateByWithValueTransform\n */"} {"signature":"public inline fun < K , M : MutableMap < in K , in Char > > CharSequence . associateByTo ( destination : M , keySelector : ( Char ) -> 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 character of the given char sequence\n * and value is the character itself.\n * \n * If any two characters would have the same key returned by [keySelector] the last one gets added to the map.\n * \n * @sample samples.text.Strings.associateByTo\n */"} {"signature":"public inline fun < K , V , M : MutableMap < in K , in V > > CharSequence . associateByTo ( destination : M , keySelector : ( Char ) -> K , valueTransform : ( Char ) -> 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 characters of the given char sequence.\n * \n * If any two characters would have the same key returned by [keySelector] the last one gets added to the map.\n * \n * @sample samples.text.Strings.associateByToWithValueTransform\n */"} {"signature":"public inline fun < K , V , M : MutableMap < in K , in V > > CharSequence . associateTo ( destination : M , transform : ( Char ) -> 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 character of the given char sequence.\n * \n * If any of two pairs would have the same key the last one gets added to the map.\n * \n * @sample samples.text.Strings.associateTo\n */"} {"signature":"@ SinceKotlin ( \"\" ) public inline fun < V > CharSequence . associateWith ( valueSelector : ( Char ) -> V ) : Map < Char , V >","body":"{ val result = LinkedHashMap < Char , V > ( mapCapacity ( length . coerceAtMost ( ) ) . coerceAtLeast ( ) ) return associateWithTo ( result , valueSelector ) }","docstring":"/**\n * Returns a [Map] where keys are characters from the given char sequence and values are\n * produced by the [valueSelector] function applied to each character.\n * \n * If any two characters are equal, the last one gets added to the map.\n * \n * The returned map preserves the entry iteration order of the original char sequence.\n * \n * @sample samples.text.Strings.associateWith\n */"} {"signature":"@ SinceKotlin ( \"\" ) public inline fun < V , M : MutableMap < in Char , in V > > CharSequence . associateWithTo ( destination : M , valueSelector : ( Char ) -> 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 character of the given char sequence,\n * where key is the character itself and value is provided by the [valueSelector] function applied to that key.\n * \n * If any two characters are equal, the last one overwrites the former value in the map.\n * \n * @sample samples.text.Strings.associateWithTo\n */"} {"signature":"public fun < C : MutableCollection < in Char > > CharSequence . toCollection ( destination : C ) : C","body":"{ for ( item in this ) { destination . add ( item ) } return destination }","docstring":"/**\n * Appends all characters to the given [destination] collection.\n */"} {"signature":"public fun CharSequence . toHashSet ( ) : HashSet < Char >","body":"{ return toCollection ( HashSet < Char > ( mapCapacity ( length . coerceAtMost ( ) ) ) ) }","docstring":"/**\n * Returns a new [HashSet] of all characters.\n */"} {"signature":"public fun CharSequence . toList ( ) : List < Char >","body":"{ return when ( length ) { -> emptyList ( ) -> listOf ( this [ ] ) else -> this . toMutableList ( ) } }","docstring":"/**\n * Returns a [List] containing all characters.\n */"} {"signature":"public fun CharSequence . toMutableList ( ) : MutableList < Char >","body":"{ return toCollection ( ArrayList < Char > ( length ) ) }","docstring":"/**\n * Returns a new [MutableList] filled with all characters of this char sequence.\n */"} {"signature":"public fun CharSequence . toSet ( ) : Set < Char >","body":"{ return when ( length ) { -> emptySet ( ) -> setOf ( this [ ] ) else -> toCollection ( LinkedHashSet < Char > ( mapCapacity ( length . coerceAtMost ( ) ) ) ) } }","docstring":"/**\n * Returns a [Set] of all characters.\n * \n * The returned set preserves the element iteration order of the original char sequence.\n */"} {"signature":"public inline fun < R > CharSequence . flatMap ( transform : ( Char ) -> 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 character of original char sequence.\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 < R > CharSequence . flatMapIndexed ( transform : ( index : Int , Char ) -> 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 character\n * and its index in the original char sequence.\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 < R , C : MutableCollection < in R > > CharSequence . flatMapIndexedTo ( destination : C , transform : ( index : Int , Char ) -> Iterable < R > ) : C","body":"{ var index = for ( element in this ) { val list = transform ( index ++ , element ) destination . addAll ( list ) } return destination }","docstring":"/**\n * Appends all elements yielded from results of [transform] function being invoked on each character\n * and its index in the original char sequence, to the given [destination].\n */"} {"signature":"public inline fun < R , C : MutableCollection < in R > > CharSequence . flatMapTo ( destination : C , transform : ( Char ) -> 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 character of original char sequence, to the given [destination].\n */"} {"signature":"public inline fun < K > CharSequence . groupBy ( keySelector : ( Char ) -> K ) : Map < K , List < Char > >","body":"{ return groupByTo ( LinkedHashMap < K , MutableList < Char > > ( ) , keySelector ) }","docstring":"/**\n * Groups characters of the original char sequence by the key returned by the given [keySelector] function\n * applied to each character and returns a map where each group key is associated with a list of corresponding characters.\n * \n * The returned map preserves the entry iteration order of the keys produced from the original char sequence.\n * \n * @sample samples.collections.Collections.Transformations.groupBy\n */"} {"signature":"public inline fun < K , V > CharSequence . groupBy ( keySelector : ( Char ) -> K , valueTransform : ( Char ) -> 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 character of the original char sequence\n * by the key returned by the given [keySelector] function applied to the character\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 char sequence.\n * \n * @sample samples.collections.Collections.Transformations.groupByKeysAndValues\n */"} {"signature":"public inline fun < K , M : MutableMap < in K , MutableList < Char > > > CharSequence . groupByTo ( destination : M , keySelector : ( Char ) -> K ) : M","body":"{ for ( element in this ) { val key = keySelector ( element ) val list = destination . getOrPut ( key ) { ArrayList < Char > ( ) } list . add ( element ) } return destination }","docstring":"/**\n * Groups characters of the original char sequence by the key returned by the given [keySelector] function\n * applied to each character and puts to the [destination] map each group key associated with a list of corresponding characters.\n * \n * @return The [destination] map.\n * \n * @sample samples.collections.Collections.Transformations.groupBy\n */"} {"signature":"public inline fun < K , V , M : MutableMap < in K , MutableList < V > > > CharSequence . groupByTo ( destination : M , keySelector : ( Char ) -> K , valueTransform : ( Char ) -> 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 character of the original char sequence\n * by the key returned by the given [keySelector] function applied to the character\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 < K > CharSequence . groupingBy ( crossinline keySelector : ( Char ) -> K ) : Grouping < Char , K >","body":"{ return object : Grouping < Char , K > { override fun sourceIterator ( ) : Iterator < Char > = this@groupingBy . iterator ( ) override fun keyOf ( element : Char ) : K = keySelector ( element ) } }","docstring":"/**\n * Creates a [Grouping] source from a char sequence to be used later with one of group-and-fold operations\n * using the specified [keySelector] function to extract a key from each character.\n * \n * @sample samples.collections.Grouping.groupingByEachCount\n */"} {"signature":"public inline fun < R > CharSequence . map ( transform : ( Char ) -> R ) : List < R >","body":"{ return mapTo ( ArrayList < R > ( length ) , transform ) }","docstring":"/**\n * Returns a list containing the results of applying the given [transform] function\n * to each character in the original char sequence.\n * \n * @sample samples.text.Strings.map\n */"} {"signature":"public inline fun < R > CharSequence . mapIndexed ( transform : ( index : Int , Char ) -> R ) : List < R >","body":"{ return mapIndexedTo ( ArrayList < R > ( length ) , transform ) }","docstring":"/**\n * Returns a list containing the results of applying the given [transform] function\n * to each character and its index in the original char sequence.\n * @param [transform] function that takes the index of a character and the character itself\n * and returns the result of the transform applied to the character.\n */"} {"signature":"public inline fun < R : Any > CharSequence . mapIndexedNotNull ( transform : ( index : Int , Char ) -> 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 character and its index in the original char sequence.\n * @param [transform] function that takes the index of a character and the character itself\n * and returns the result of the transform applied to the character.\n */"} {"signature":"public inline fun < R : Any , C : MutableCollection < in R > > CharSequence . mapIndexedNotNullTo ( destination : C , transform : ( index : Int , Char ) -> R ? ) : C","body":"{ forEachIndexed { index , element -> transform ( index , element ) ? . let { destination . add ( it ) } } return destination }","docstring":"/**\n * Applies the given [transform] function to each character and its index in the original char sequence\n * and appends only the non-null results to the given [destination].\n * @param [transform] function that takes the index of a character and the character itself\n * and returns the result of the transform applied to the character.\n */"} {"signature":"public inline fun < R , C : MutableCollection < in R > > CharSequence . mapIndexedTo ( destination : C , transform : ( index : Int , Char ) -> R ) : C","body":"{ var index = for ( item in this ) destination . add ( transform ( index ++ , item ) ) return destination }","docstring":"/**\n * Applies the given [transform] function to each character and its index in the original char sequence\n * and appends the results to the given [destination].\n * @param [transform] function that takes the index of a character and the character itself\n * and returns the result of the transform applied to the character.\n */"} {"signature":"public inline fun < R : Any > CharSequence . mapNotNull ( transform : ( Char ) -> 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 character in the original char sequence.\n * \n * @sample samples.collections.Collections.Transformations.mapNotNull\n */"} {"signature":"public inline fun < R : Any , C : MutableCollection < in R > > CharSequence . mapNotNullTo ( destination : C , transform : ( Char ) -> R ? ) : C","body":"{ forEach { element -> transform ( element ) ? . let { destination . add ( it ) } } return destination }","docstring":"/**\n * Applies the given [transform] function to each character in the original char sequence\n * and appends only the non-null results to the given [destination].\n */"} {"signature":"public inline fun < R , C : MutableCollection < in R > > CharSequence . mapTo ( destination : C , transform : ( Char ) -> R ) : C","body":"{ for ( item in this ) destination . add ( transform ( item ) ) return destination }","docstring":"/**\n * Applies the given [transform] function to each character of the original char sequence\n * and appends the results to the given [destination].\n */"} {"signature":"public fun CharSequence . withIndex ( ) : Iterable < IndexedValue < Char > >","body":"{ return IndexingIterable { iterator ( ) } }","docstring":"/**\n * Returns a lazy [Iterable] that wraps each character of the original char sequence\n * into an [IndexedValue] containing the index of that character and the character itself.\n */"} {"signature":"public inline fun CharSequence . all ( predicate : ( Char ) -> Boolean ) : Boolean","body":"{ for ( element in this ) if ( ! predicate ( element ) ) return false return true }","docstring":"/**\n * Returns `true` if all characters match the given [predicate].\n * \n * Note that if the char sequence contains no characters, the function returns `true`\n * because there are no characters 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 CharSequence . any ( ) : Boolean","body":"{ return ! isEmpty ( ) }","docstring":"/**\n * Returns `true` if char sequence has at least one character.\n * \n * @sample samples.collections.Collections.Aggregates.any\n */"} {"signature":"public inline fun CharSequence . any ( predicate : ( Char ) -> Boolean ) : Boolean","body":"{ for ( element in this ) if ( predicate ( element ) ) return true return false }","docstring":"/**\n * Returns `true` if at least one character matches the given [predicate].\n * \n * @sample samples.collections.Collections.Aggregates.anyWithPredicate\n */"} {"signature":"@ kotlin . internal . InlineOnly public inline fun CharSequence . count ( ) : Int","body":"{ return length }","docstring":"/**\n * Returns the length of this char sequence.\n */"} {"signature":"public inline fun CharSequence . count ( predicate : ( Char ) -> Boolean ) : Int","body":"{ var count = for ( element in this ) if ( predicate ( element ) ) ++ count return count }","docstring":"/**\n * Returns the number of characters matching the given [predicate].\n */"} {"signature":"public inline fun < R > CharSequence . fold ( initial : R , operation : ( acc : R , Char ) -> 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 character.\n * \n * Returns the specified [initial] value if the char sequence is empty.\n * \n * @param [operation] function that takes current accumulator value and a character, and calculates the next accumulator value.\n */"} {"signature":"public inline fun < R > CharSequence . foldIndexed ( initial : R , operation : ( index : Int , acc : R , Char ) -> R ) : R","body":"{ var index = var accumulator = initial for ( element in this ) accumulator = operation ( 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 character with its index in the original char sequence.\n * \n * Returns the specified [initial] value if the char sequence is empty.\n * \n * @param [operation] function that takes the index of a character, current accumulator value\n * and the character itself, and calculates the next accumulator value.\n */"} {"signature":"public inline fun < R > CharSequence . foldRight ( initial : R , operation : ( Char , acc : R ) -> R ) : R","body":"{ var index = lastIndex var accumulator = initial while ( index >= ) { accumulator = operation ( get ( index -- ) , accumulator ) } return accumulator }","docstring":"/**\n * Accumulates value starting with [initial] value and applying [operation] from right to left\n * to each character and current accumulator value.\n * \n * Returns the specified [initial] value if the char sequence is empty.\n * \n * @param [operation] function that takes a character and current accumulator value, and calculates the next accumulator value.\n */"} {"signature":"public inline fun < R > CharSequence . foldRightIndexed ( initial : R , operation : ( index : Int , Char , acc : R ) -> R ) : R","body":"{ var index = lastIndex var accumulator = initial while ( index >= ) { accumulator = operation ( index , get ( index ) , accumulator ) -- index } return accumulator }","docstring":"/**\n * Accumulates value starting with [initial] value and applying [operation] from right to left\n * to each character with its index in the original char sequence and current accumulator value.\n * \n * Returns the specified [initial] value if the char sequence is empty.\n * \n * @param [operation] function that takes the index of a character, the character itself\n * and current accumulator value, and calculates the next accumulator value.\n */"} {"signature":"public inline fun CharSequence . forEach ( action : ( Char ) -> Unit ) : Unit","body":"{ for ( element in this ) action ( element ) }","docstring":"/**\n * Performs the given [action] on each character.\n */"} {"signature":"public inline fun CharSequence . forEachIndexed ( action : ( index : Int , Char ) -> Unit ) : Unit","body":"{ var index = for ( item in this ) action ( index ++ , item ) }","docstring":"/**\n * Performs the given [action] on each character, providing sequential index with the character.\n * @param [action] function that takes the index of a character and the character itself\n * and performs the action on the character.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . jvm . JvmName ( \"\" ) @ Suppress ( \"\" ) public fun CharSequence . max ( ) : Char","body":"{ if ( isEmpty ( ) ) throw NoSuchElementException ( ) var max = this [ ] for ( i in .. lastIndex ) { val e = this [ i ] if ( max < e ) max = e } return max }","docstring":"/**\n * Returns the largest character.\n * \n * @throws NoSuchElementException if the char sequence is empty.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . jvm . JvmName ( \"\" ) @ Suppress ( \"\" ) public inline fun < R : Comparable < R > > CharSequence . maxBy ( selector : ( Char ) -> R ) : Char","body":"{ if ( isEmpty ( ) ) throw NoSuchElementException ( ) var maxElem = this [ ] val lastIndex = this . lastIndex if ( lastIndex == ) return maxElem var maxValue = selector ( maxElem ) for ( i in .. lastIndex ) { val e = this [ i ] val v = selector ( e ) if ( maxValue < v ) { maxElem = e maxValue = v } } return maxElem }","docstring":"/**\n * Returns the first character yielding the largest value of the given function.\n * \n * @throws NoSuchElementException if the char sequence is empty.\n * \n * @sample samples.collections.Collections.Aggregates.maxBy\n */"} {"signature":"@ SinceKotlin ( \"\" ) public inline fun < R : Comparable < R > > CharSequence . maxByOrNull ( selector : ( Char ) -> R ) : Char ?","body":"{ if ( isEmpty ( ) ) return null var maxElem = this [ ] val lastIndex = this . lastIndex if ( lastIndex == ) return maxElem var maxValue = selector ( maxElem ) for ( i in .. lastIndex ) { val e = this [ i ] val v = selector ( e ) if ( maxValue < v ) { maxElem = e maxValue = v } } return maxElem }","docstring":"/**\n * Returns the first character yielding the largest value of the given function or `null` if there are no characters.\n * \n * @sample samples.collections.Collections.Aggregates.maxByOrNull\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ OptIn ( kotlin . experimental . ExperimentalTypeInference :: class ) @ OverloadResolutionByLambdaReturnType @ kotlin . internal . InlineOnly public inline fun CharSequence . maxOf ( selector : ( Char ) -> Double ) : Double","body":"{ if ( isEmpty ( ) ) throw NoSuchElementException ( ) var maxValue = selector ( this [ ] ) for ( i in .. lastIndex ) { val v = selector ( this [ i ] ) maxValue = maxOf ( maxValue , v ) } return maxValue }","docstring":"/**\n * Returns the largest value among all values produced by [selector] function\n * applied to each character in the char sequence.\n * \n * If any of values produced by [selector] function is `NaN`, the returned result is `NaN`.\n * \n * @throws NoSuchElementException if the char sequence is empty.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ OptIn ( kotlin . experimental . ExperimentalTypeInference :: class ) @ OverloadResolutionByLambdaReturnType @ kotlin . internal . InlineOnly public inline fun CharSequence . maxOf ( selector : ( Char ) -> Float ) : Float","body":"{ if ( isEmpty ( ) ) throw NoSuchElementException ( ) var maxValue = selector ( this [ ] ) for ( i in .. lastIndex ) { val v = selector ( this [ i ] ) maxValue = maxOf ( maxValue , v ) } return maxValue }","docstring":"/**\n * Returns the largest value among all values produced by [selector] function\n * applied to each character in the char sequence.\n * \n * If any of values produced by [selector] function is `NaN`, the returned result is `NaN`.\n * \n * @throws NoSuchElementException if the char sequence is empty.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ OptIn ( kotlin . experimental . ExperimentalTypeInference :: class ) @ OverloadResolutionByLambdaReturnType @ kotlin . internal . InlineOnly public inline fun < R : Comparable < R > > CharSequence . maxOf ( selector : ( Char ) -> R ) : R","body":"{ if ( isEmpty ( ) ) throw NoSuchElementException ( ) var maxValue = selector ( this [ ] ) for ( i in .. lastIndex ) { val v = selector ( this [ i ] ) if ( maxValue < v ) { maxValue = v } } return maxValue }","docstring":"/**\n * Returns the largest value among all values produced by [selector] function\n * applied to each character in the char sequence.\n * \n * @throws NoSuchElementException if the char sequence is empty.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ OptIn ( kotlin . experimental . ExperimentalTypeInference :: class ) @ OverloadResolutionByLambdaReturnType @ kotlin . internal . InlineOnly public inline fun CharSequence . maxOfOrNull ( selector : ( Char ) -> Double ) : Double ?","body":"{ if ( isEmpty ( ) ) return null var maxValue = selector ( this [ ] ) for ( i in .. lastIndex ) { val v = selector ( this [ i ] ) maxValue = maxOf ( maxValue , v ) } return maxValue }","docstring":"/**\n * Returns the largest value among all values produced by [selector] function\n * applied to each character in the char sequence or `null` if there are no characters.\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 CharSequence . maxOfOrNull ( selector : ( Char ) -> Float ) : Float ?","body":"{ if ( isEmpty ( ) ) return null var maxValue = selector ( this [ ] ) for ( i in .. lastIndex ) { val v = selector ( this [ i ] ) maxValue = maxOf ( maxValue , v ) } return maxValue }","docstring":"/**\n * Returns the largest value among all values produced by [selector] function\n * applied to each character in the char sequence or `null` if there are no characters.\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 < R : Comparable < R > > CharSequence . maxOfOrNull ( selector : ( Char ) -> R ) : R ?","body":"{ if ( isEmpty ( ) ) return null var maxValue = selector ( this [ ] ) for ( i in .. lastIndex ) { val v = selector ( this [ i ] ) if ( maxValue < v ) { maxValue = v } } return maxValue }","docstring":"/**\n * Returns the largest value among all values produced by [selector] function\n * applied to each character in the char sequence or `null` if there are no characters.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ OptIn ( kotlin . experimental . ExperimentalTypeInference :: class ) @ OverloadResolutionByLambdaReturnType @ kotlin . internal . InlineOnly public inline fun < R > CharSequence . maxOfWith ( comparator : Comparator < in R > , selector : ( Char ) -> R ) : R","body":"{ if ( isEmpty ( ) ) throw NoSuchElementException ( ) var maxValue = selector ( this [ ] ) for ( i in .. lastIndex ) { val v = selector ( this [ i ] ) 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 character in the char sequence.\n * \n * @throws NoSuchElementException if the char sequence is empty.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ OptIn ( kotlin . experimental . ExperimentalTypeInference :: class ) @ OverloadResolutionByLambdaReturnType @ kotlin . internal . InlineOnly public inline fun < R > CharSequence . maxOfWithOrNull ( comparator : Comparator < in R > , selector : ( Char ) -> R ) : R ?","body":"{ if ( isEmpty ( ) ) return null var maxValue = selector ( this [ ] ) for ( i in .. lastIndex ) { val v = selector ( this [ i ] ) 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 character in the char sequence or `null` if there are no characters.\n */"} {"signature":"@ SinceKotlin ( \"\" ) public fun CharSequence . maxOrNull ( ) : Char ?","body":"{ if ( isEmpty ( ) ) return null var max = this [ ] for ( i in .. lastIndex ) { val e = this [ i ] if ( max < e ) max = e } return max }","docstring":"/**\n * Returns the largest character or `null` if there are no characters.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . jvm . JvmName ( \"\" ) @ Suppress ( \"\" ) public fun CharSequence . maxWith ( comparator : Comparator < in Char > ) : Char","body":"{ if ( isEmpty ( ) ) throw NoSuchElementException ( ) var max = this [ ] for ( i in .. lastIndex ) { val e = this [ i ] if ( comparator . compare ( max , e ) < ) max = e } return max }","docstring":"/**\n * Returns the first character having the largest value according to the provided [comparator].\n * \n * @throws NoSuchElementException if the char sequence is empty.\n */"} {"signature":"@ SinceKotlin ( \"\" ) public fun CharSequence . maxWithOrNull ( comparator : Comparator < in Char > ) : Char ?","body":"{ if ( isEmpty ( ) ) return null var max = this [ ] for ( i in .. lastIndex ) { val e = this [ i ] if ( comparator . compare ( max , e ) < ) max = e } return max }","docstring":"/**\n * Returns the first character having the largest value according to the provided [comparator] or `null` if there are no characters.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . jvm . JvmName ( \"\" ) @ Suppress ( \"\" ) public fun CharSequence . min ( ) : Char","body":"{ if ( isEmpty ( ) ) throw NoSuchElementException ( ) var min = this [ ] for ( i in .. lastIndex ) { val e = this [ i ] if ( min > e ) min = e } return min }","docstring":"/**\n * Returns the smallest character.\n * \n * @throws NoSuchElementException if the char sequence is empty.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . jvm . JvmName ( \"\" ) @ Suppress ( \"\" ) public inline fun < R : Comparable < R > > CharSequence . minBy ( selector : ( Char ) -> R ) : Char","body":"{ if ( isEmpty ( ) ) throw NoSuchElementException ( ) var minElem = this [ ] val lastIndex = this . lastIndex if ( lastIndex == ) return minElem var minValue = selector ( minElem ) for ( i in .. lastIndex ) { val e = this [ i ] val v = selector ( e ) if ( minValue > v ) { minElem = e minValue = v } } return minElem }","docstring":"/**\n * Returns the first character yielding the smallest value of the given function.\n * \n * @throws NoSuchElementException if the char sequence is empty.\n * \n * @sample samples.collections.Collections.Aggregates.minBy\n */"} {"signature":"@ SinceKotlin ( \"\" ) public inline fun < R : Comparable < R > > CharSequence . minByOrNull ( selector : ( Char ) -> R ) : Char ?","body":"{ if ( isEmpty ( ) ) return null var minElem = this [ ] val lastIndex = this . lastIndex if ( lastIndex == ) return minElem var minValue = selector ( minElem ) for ( i in .. lastIndex ) { val e = this [ i ] val v = selector ( e ) if ( minValue > v ) { minElem = e minValue = v } } return minElem }","docstring":"/**\n * Returns the first character yielding the smallest value of the given function or `null` if there are no characters.\n * \n * @sample samples.collections.Collections.Aggregates.minByOrNull\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ OptIn ( kotlin . experimental . ExperimentalTypeInference :: class ) @ OverloadResolutionByLambdaReturnType @ kotlin . internal . InlineOnly public inline fun CharSequence . minOf ( selector : ( Char ) -> Double ) : Double","body":"{ if ( isEmpty ( ) ) throw NoSuchElementException ( ) var minValue = selector ( this [ ] ) for ( i in .. lastIndex ) { val v = selector ( this [ i ] ) minValue = minOf ( minValue , v ) } return minValue }","docstring":"/**\n * Returns the smallest value among all values produced by [selector] function\n * applied to each character in the char sequence.\n * \n * If any of values produced by [selector] function is `NaN`, the returned result is `NaN`.\n * \n * @throws NoSuchElementException if the char sequence is empty.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ OptIn ( kotlin . experimental . ExperimentalTypeInference :: class ) @ OverloadResolutionByLambdaReturnType @ kotlin . internal . InlineOnly public inline fun CharSequence . minOf ( selector : ( Char ) -> Float ) : Float","body":"{ if ( isEmpty ( ) ) throw NoSuchElementException ( ) var minValue = selector ( this [ ] ) for ( i in .. lastIndex ) { val v = selector ( this [ i ] ) minValue = minOf ( minValue , v ) } return minValue }","docstring":"/**\n * Returns the smallest value among all values produced by [selector] function\n * applied to each character in the char sequence.\n * \n * If any of values produced by [selector] function is `NaN`, the returned result is `NaN`.\n * \n * @throws NoSuchElementException if the char sequence is empty.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ OptIn ( kotlin . experimental . ExperimentalTypeInference :: class ) @ OverloadResolutionByLambdaReturnType @ kotlin . internal . InlineOnly public inline fun < R : Comparable < R > > CharSequence . minOf ( selector : ( Char ) -> R ) : R","body":"{ if ( isEmpty ( ) ) throw NoSuchElementException ( ) var minValue = selector ( this [ ] ) for ( i in .. lastIndex ) { val v = selector ( this [ i ] ) if ( minValue > v ) { minValue = v } } return minValue }","docstring":"/**\n * Returns the smallest value among all values produced by [selector] function\n * applied to each character in the char sequence.\n * \n * @throws NoSuchElementException if the char sequence is empty.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ OptIn ( kotlin . experimental . ExperimentalTypeInference :: class ) @ OverloadResolutionByLambdaReturnType @ kotlin . internal . InlineOnly public inline fun CharSequence . minOfOrNull ( selector : ( Char ) -> Double ) : Double ?","body":"{ if ( isEmpty ( ) ) return null var minValue = selector ( this [ ] ) for ( i in .. lastIndex ) { val v = selector ( this [ i ] ) minValue = minOf ( minValue , v ) } return minValue }","docstring":"/**\n * Returns the smallest value among all values produced by [selector] function\n * applied to each character in the char sequence or `null` if there are no characters.\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 CharSequence . minOfOrNull ( selector : ( Char ) -> Float ) : Float ?","body":"{ if ( isEmpty ( ) ) return null var minValue = selector ( this [ ] ) for ( i in .. lastIndex ) { val v = selector ( this [ i ] ) minValue = minOf ( minValue , v ) } return minValue }","docstring":"/**\n * Returns the smallest value among all values produced by [selector] function\n * applied to each character in the char sequence or `null` if there are no characters.\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 < R : Comparable < R > > CharSequence . minOfOrNull ( selector : ( Char ) -> R ) : R ?","body":"{ if ( isEmpty ( ) ) return null var minValue = selector ( this [ ] ) for ( i in .. lastIndex ) { val v = selector ( this [ i ] ) if ( minValue > v ) { minValue = v } } return minValue }","docstring":"/**\n * Returns the smallest value among all values produced by [selector] function\n * applied to each character in the char sequence or `null` if there are no characters.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ OptIn ( kotlin . experimental . ExperimentalTypeInference :: class ) @ OverloadResolutionByLambdaReturnType @ kotlin . internal . InlineOnly public inline fun < R > CharSequence . minOfWith ( comparator : Comparator < in R > , selector : ( Char ) -> R ) : R","body":"{ if ( isEmpty ( ) ) throw NoSuchElementException ( ) var minValue = selector ( this [ ] ) for ( i in .. lastIndex ) { val v = selector ( this [ i ] ) 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 character in the char sequence.\n * \n * @throws NoSuchElementException if the char sequence is empty.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ OptIn ( kotlin . experimental . ExperimentalTypeInference :: class ) @ OverloadResolutionByLambdaReturnType @ kotlin . internal . InlineOnly public inline fun < R > CharSequence . minOfWithOrNull ( comparator : Comparator < in R > , selector : ( Char ) -> R ) : R ?","body":"{ if ( isEmpty ( ) ) return null var minValue = selector ( this [ ] ) for ( i in .. lastIndex ) { val v = selector ( this [ i ] ) 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 character in the char sequence or `null` if there are no characters.\n */"} {"signature":"@ SinceKotlin ( \"\" ) public fun CharSequence . minOrNull ( ) : Char ?","body":"{ if ( isEmpty ( ) ) return null var min = this [ ] for ( i in .. lastIndex ) { val e = this [ i ] if ( min > e ) min = e } return min }","docstring":"/**\n * Returns the smallest character or `null` if there are no characters.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . jvm . JvmName ( \"\" ) @ Suppress ( \"\" ) public fun CharSequence . minWith ( comparator : Comparator < in Char > ) : Char","body":"{ if ( isEmpty ( ) ) throw NoSuchElementException ( ) var min = this [ ] for ( i in .. lastIndex ) { val e = this [ i ] if ( comparator . compare ( min , e ) > ) min = e } return min }","docstring":"/**\n * Returns the first character having the smallest value according to the provided [comparator].\n * \n * @throws NoSuchElementException if the char sequence is empty.\n */"} {"signature":"@ SinceKotlin ( \"\" ) public fun CharSequence . minWithOrNull ( comparator : Comparator < in Char > ) : Char ?","body":"{ if ( isEmpty ( ) ) return null var min = this [ ] for ( i in .. lastIndex ) { val e = this [ i ] if ( comparator . compare ( min , e ) > ) min = e } return min }","docstring":"/**\n * Returns the first character having the smallest value according to the provided [comparator] or `null` if there are no characters.\n */"} {"signature":"public fun CharSequence . none ( ) : Boolean","body":"{ return isEmpty ( ) }","docstring":"/**\n * Returns `true` if the char sequence has no characters.\n * \n * @sample samples.collections.Collections.Aggregates.none\n */"} {"signature":"public inline fun CharSequence . none ( predicate : ( Char ) -> Boolean ) : Boolean","body":"{ for ( element in this ) if ( predicate ( element ) ) return false return true }","docstring":"/**\n * Returns `true` if no characters match the given [predicate].\n * \n * @sample samples.collections.Collections.Aggregates.noneWithPredicate\n */"} {"signature":"@ SinceKotlin ( \"\" ) public inline fun < S : CharSequence > S . onEach ( action : ( Char ) -> Unit ) : S","body":"{ return apply { for ( element in this ) action ( element ) } }","docstring":"/**\n * Performs the given [action] on each character and returns the char sequence itself afterwards.\n */"} {"signature":"@ SinceKotlin ( \"\" ) public inline fun < S : CharSequence > S . onEachIndexed ( action : ( index : Int , Char ) -> Unit ) : S","body":"{ return apply { forEachIndexed ( action ) } }","docstring":"/**\n * Performs the given [action] on each character, providing sequential index with the character,\n * and returns the char sequence itself afterwards.\n * @param [action] function that takes the index of a character and the character itself\n * and performs the action on the character.\n */"} {"signature":"public inline fun CharSequence . reduce ( operation : ( acc : Char , Char ) -> Char ) : Char","body":"{ if ( isEmpty ( ) ) throw UnsupportedOperationException ( \"\" ) var accumulator = this [ ] for ( index in .. lastIndex ) { accumulator = operation ( accumulator , this [ index ] ) } return accumulator }","docstring":"/**\n * Accumulates value starting with the first character and applying [operation] from left to right\n * to current accumulator value and each character.\n * \n * Throws an exception if this char sequence is empty. If the char sequence 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 a character,\n * and calculates the next accumulator value.\n * \n * @sample samples.collections.Collections.Aggregates.reduce\n */"} {"signature":"public inline fun CharSequence . reduceIndexed ( operation : ( index : Int , acc : Char , Char ) -> Char ) : Char","body":"{ if ( isEmpty ( ) ) throw UnsupportedOperationException ( \"\" ) var accumulator = this [ ] for ( index in .. lastIndex ) { accumulator = operation ( index , accumulator , this [ index ] ) } return accumulator }","docstring":"/**\n * Accumulates value starting with the first character and applying [operation] from left to right\n * to current accumulator value and each character with its index in the original char sequence.\n * \n * Throws an exception if this char sequence is empty. If the char sequence 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 a character, current accumulator value and the character itself,\n * and calculates the next accumulator value.\n * \n * @sample samples.collections.Collections.Aggregates.reduce\n */"} {"signature":"@ SinceKotlin ( \"\" ) public inline fun CharSequence . reduceIndexedOrNull ( operation : ( index : Int , acc : Char , Char ) -> Char ) : Char ?","body":"{ if ( isEmpty ( ) ) return null var accumulator = this [ ] for ( index in .. lastIndex ) { accumulator = operation ( index , accumulator , this [ index ] ) } return accumulator }","docstring":"/**\n * Accumulates value starting with the first character and applying [operation] from left to right\n * to current accumulator value and each character with its index in the original char sequence.\n * \n * Returns `null` if the char sequence is empty.\n * \n * @param [operation] function that takes the index of a character, current accumulator value and the character itself,\n * and calculates the next accumulator value.\n * \n * @sample samples.collections.Collections.Aggregates.reduceOrNull\n */"} {"signature":"@ SinceKotlin ( \"\" ) public inline fun CharSequence . reduceOrNull ( operation : ( acc : Char , Char ) -> Char ) : Char ?","body":"{ if ( isEmpty ( ) ) return null var accumulator = this [ ] for ( index in .. lastIndex ) { accumulator = operation ( accumulator , this [ index ] ) } return accumulator }","docstring":"/**\n * Accumulates value starting with the first character and applying [operation] from left to right\n * to current accumulator value and each character.\n * \n * Returns `null` if the char sequence is empty.\n * \n * @param [operation] function that takes current accumulator value and a character,\n * and calculates the next accumulator value.\n * \n * @sample samples.collections.Collections.Aggregates.reduceOrNull\n */"} {"signature":"public inline fun CharSequence . reduceRight ( operation : ( Char , acc : Char ) -> Char ) : Char","body":"{ var index = lastIndex if ( index < ) throw UnsupportedOperationException ( \"\" ) var accumulator = get ( index -- ) while ( index >= ) { accumulator = operation ( get ( index -- ) , accumulator ) } return accumulator }","docstring":"/**\n * Accumulates value starting with the last character and applying [operation] from right to left\n * to each character and current accumulator value.\n * \n * Throws an exception if this char sequence is empty. If the char sequence 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 a character and current accumulator value,\n * and calculates the next accumulator value.\n * \n * @sample samples.collections.Collections.Aggregates.reduceRight\n */"} {"signature":"public inline fun CharSequence . reduceRightIndexed ( operation : ( index : Int , Char , acc : Char ) -> Char ) : Char","body":"{ var index = lastIndex if ( index < ) throw UnsupportedOperationException ( \"\" ) var accumulator = get ( index -- ) while ( index >= ) { accumulator = operation ( index , get ( index ) , accumulator ) -- index } return accumulator }","docstring":"/**\n * Accumulates value starting with the last character and applying [operation] from right to left\n * to each character with its index in the original char sequence and current accumulator value.\n * \n * Throws an exception if this char sequence is empty. If the char sequence 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 a character, the character 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 CharSequence . reduceRightIndexedOrNull ( operation : ( index : Int , Char , acc : Char ) -> Char ) : Char ?","body":"{ var index = lastIndex if ( index < ) return null var accumulator = get ( index -- ) while ( index >= ) { accumulator = operation ( index , get ( index ) , accumulator ) -- index } return accumulator }","docstring":"/**\n * Accumulates value starting with the last character and applying [operation] from right to left\n * to each character with its index in the original char sequence and current accumulator value.\n * \n * Returns `null` if the char sequence is empty.\n * \n * @param [operation] function that takes the index of a character, the character 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 CharSequence . reduceRightOrNull ( operation : ( Char , acc : Char ) -> Char ) : Char ?","body":"{ var index = lastIndex if ( index < ) return null var accumulator = get ( index -- ) while ( index >= ) { accumulator = operation ( get ( index -- ) , accumulator ) } return accumulator }","docstring":"/**\n * Accumulates value starting with the last character and applying [operation] from right to left\n * to each character and current accumulator value.\n * \n * Returns `null` if the char sequence is empty.\n * \n * @param [operation] function that takes a character 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 < R > CharSequence . runningFold ( initial : R , operation : ( acc : R , Char ) -> R ) : List < R >","body":"{ if ( isEmpty ( ) ) return listOf ( initial ) val result = ArrayList < R > ( length + ) . 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 character 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 a character, and calculates the next accumulator value.\n * \n * @sample samples.collections.Collections.Aggregates.runningFold\n */"} {"signature":"@ SinceKotlin ( \"\" ) public inline fun < R > CharSequence . runningFoldIndexed ( initial : R , operation : ( index : Int , acc : R , Char ) -> R ) : List < R >","body":"{ if ( isEmpty ( ) ) return listOf ( initial ) val result = ArrayList < R > ( length + ) . apply { add ( initial ) } var accumulator = initial for ( index in indices ) { accumulator = operation ( index , accumulator , this [ index ] ) 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 character, its index in the original char sequence 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 a character, current accumulator value\n * and the character itself, and calculates the next accumulator value.\n * \n * @sample samples.collections.Collections.Aggregates.runningFold\n */"} {"signature":"@ SinceKotlin ( \"\" ) public inline fun CharSequence . runningReduce ( operation : ( acc : Char , Char ) -> Char ) : List < Char >","body":"{ if ( isEmpty ( ) ) return emptyList ( ) var accumulator = this [ ] val result = ArrayList < Char > ( length ) . apply { add ( accumulator ) } for ( index in until length ) { accumulator = operation ( accumulator , this [ index ] ) 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 character and current accumulator value that starts with the first character of this char sequence.\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 a character, and calculates the next accumulator value.\n * \n * @sample samples.collections.Collections.Aggregates.runningReduce\n */"} {"signature":"@ SinceKotlin ( \"\" ) public inline fun CharSequence . runningReduceIndexed ( operation : ( index : Int , acc : Char , Char ) -> Char ) : List < Char >","body":"{ if ( isEmpty ( ) ) return emptyList ( ) var accumulator = this [ ] val result = ArrayList < Char > ( length ) . apply { add ( accumulator ) } for ( index in until length ) { accumulator = operation ( index , accumulator , this [ index ] ) 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 character, its index in the original char sequence and current accumulator value that starts with the first character of this char sequence.\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 a character, current accumulator value\n * and the character itself, and calculates the next accumulator value.\n * \n * @sample samples.collections.Collections.Aggregates.runningReduce\n */"} {"signature":"@ SinceKotlin ( \"\" ) public inline fun < R > CharSequence . scan ( initial : R , operation : ( acc : R , Char ) -> 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 character 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 a character, and calculates the next accumulator value.\n * \n * @sample samples.collections.Collections.Aggregates.scan\n */"} {"signature":"@ SinceKotlin ( \"\" ) public inline fun < R > CharSequence . scanIndexed ( initial : R , operation : ( index : Int , acc : R , Char ) -> 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 character, its index in the original char sequence 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 a character, current accumulator value\n * and the character itself, and calculates the next accumulator value.\n * \n * @sample samples.collections.Collections.Aggregates.scan\n */"} {"signature":"@ Deprecated ( \"\" , ReplaceWith ( \"\" ) ) @ DeprecatedSinceKotlin ( warningSince = \"\" ) public inline fun CharSequence . sumBy ( selector : ( Char ) -> 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 character in the char sequence.\n */"} {"signature":"@ Deprecated ( \"\" , ReplaceWith ( \"\" ) ) @ DeprecatedSinceKotlin ( warningSince = \"\" ) public inline fun CharSequence . sumByDouble ( selector : ( Char ) -> 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 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 ) -> 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 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 ) -> 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 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 ) -> 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 character in the char sequence.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ OptIn ( kotlin . experimental . ExperimentalTypeInference :: class ) @ OverloadResolutionByLambdaReturnType @ kotlin . jvm . JvmName ( \"\" ) @ WasExperimental ( ExperimentalUnsignedTypes :: class ) @ kotlin . internal . InlineOnly public inline fun CharSequence . sumOf ( selector : ( Char ) -> 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 character in the char sequence.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ OptIn ( kotlin . experimental . ExperimentalTypeInference :: class ) @ OverloadResolutionByLambdaReturnType @ kotlin . jvm . JvmName ( \"\" ) @ WasExperimental ( ExperimentalUnsignedTypes :: class ) @ kotlin . internal . InlineOnly public inline fun CharSequence . sumOf ( selector : ( Char ) -> 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 character in the char sequence.\n */"} {"signature":"@ SinceKotlin ( \"\" ) public fun CharSequence . chunked ( size : Int ) : List < String >","body":"{ return windowed ( size , size , partialWindows = true ) }","docstring":"/**\n * Splits this char sequence into a list of strings each not exceeding the given [size].\n * \n * The last string in the resulting list may have fewer characters than the given [size].\n * \n * @param size the number of elements to take in each string, must be positive and can be greater than the number of elements in this char sequence.\n * \n * @sample samples.text.Strings.chunked\n */"} {"signature":"@ SinceKotlin ( \"\" ) public fun < R > CharSequence . chunked ( size : Int , transform : ( CharSequence ) -> R ) : List < R >","body":"{ return windowed ( size , size , partialWindows = true , transform = transform ) }","docstring":"/**\n * Splits this char sequence into several char sequences 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 char sequence.\n * \n * Note that the char sequence 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 char sequence may have fewer characters than the given [size].\n * \n * @param size the number of elements to take in each char sequence, must be positive and can be greater than the number of elements in this char sequence.\n * \n * @sample samples.text.Strings.chunkedTransform\n */"} {"signature":"@ SinceKotlin ( \"\" ) public fun CharSequence . chunkedSequence ( size : Int ) : Sequence < String >","body":"{ return chunkedSequence ( size ) { it . toString ( ) } }","docstring":"/**\n * Splits this char sequence into a sequence of strings each not exceeding the given [size].\n * \n * The last string in the resulting sequence may have fewer characters than the given [size].\n * \n * @param size the number of elements to take in each string, must be positive and can be greater than the number of elements in this char sequence.\n * \n * @sample samples.collections.Collections.Transformations.chunked\n */"} {"signature":"@ SinceKotlin ( \"\" ) public fun < R > CharSequence . chunkedSequence ( size : Int , transform : ( CharSequence ) -> R ) : Sequence < R >","body":"{ return windowedSequence ( size , size , partialWindows = true , transform = transform ) }","docstring":"/**\n * Splits this char sequence into several char sequences each not exceeding the given [size]\n * and applies the given [transform] function to an each.\n * \n * @return sequence of results of the [transform] applied to an each char sequence.\n * \n * Note that the char sequence 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 char sequence may have fewer characters than the given [size].\n * \n * @param size the number of elements to take in each char sequence, must be positive and can be greater than the number of elements in this char sequence.\n * \n * @sample samples.text.Strings.chunkedTransformToSequence\n */"} {"signature":"public inline fun CharSequence . partition ( predicate : ( Char ) -> Boolean ) : Pair < CharSequence , CharSequence >","body":"{ val first = StringBuilder ( ) val second = StringBuilder ( ) for ( element in this ) { if ( predicate ( element ) ) { first . append ( element ) } else { second . append ( element ) } } return Pair ( first , second ) }","docstring":"/**\n * Splits the original char sequence into pair of char sequences,\n * where *first* char sequence contains characters for which [predicate] yielded `true`,\n * while *second* char sequence contains characters for which [predicate] yielded `false`.\n * \n * @sample samples.text.Strings.partition\n */"} {"signature":"public inline fun String . partition ( predicate : ( Char ) -> Boolean ) : Pair < String , String >","body":"{ val first = StringBuilder ( ) val second = StringBuilder ( ) for ( element in this ) { if ( predicate ( element ) ) { first . append ( element ) } else { second . append ( element ) } } return Pair ( first . toString ( ) , second . toString ( ) ) }","docstring":"/**\n * Splits the original string into pair of strings,\n * where *first* string contains characters for which [predicate] yielded `true`,\n * while *second* string contains characters for which [predicate] yielded `false`.\n * \n * @sample samples.text.Strings.partition\n */"} {"signature":"@ SinceKotlin ( \"\" ) public fun CharSequence . windowed ( size : Int , step : Int = , partialWindows : Boolean = false ) : List < String >","body":"{ return windowed ( size , step , partialWindows ) { it . toString ( ) } }","docstring":"/**\n * Returns a list of snapshots of the window of the given [size]\n * sliding along this char sequence with the given [step], where each\n * snapshot is a string.\n * \n * Several last strings may have fewer characters than the given [size].\n * \n * Both [size] and [step] must be positive and can be greater than the number of elements in this char sequence.\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 < R > CharSequence . windowed ( size : Int , step : Int = , partialWindows : Boolean = false , transform : ( CharSequence ) -> R ) : List < R >","body":"{ checkWindowSizeStep ( size , step ) val thisSize = this . length val resultCapacity = thisSize / step + if ( thisSize % step == ) else val result = ArrayList < R > ( resultCapacity ) var index = while ( index in until thisSize ) { val end = index + size val coercedEnd = if ( end < || end > thisSize ) { if ( partialWindows ) thisSize else break } else end result . add ( transform ( subSequence ( index , coercedEnd ) ) ) index += step } return result }","docstring":"/**\n * Returns a list of results of applying the given [transform] function to\n * an each char sequence representing a view over the window of the given [size]\n * sliding along this char sequence with the given [step].\n * \n * Note that the char sequence 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 char sequences may have fewer characters than the given [size].\n * \n * Both [size] and [step] must be positive and can be greater than the number of elements in this char sequence.\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":"@ SinceKotlin ( \"\" ) public fun CharSequence . windowedSequence ( size : Int , step : Int = , partialWindows : Boolean = false ) : Sequence < String >","body":"{ return windowedSequence ( size , step , partialWindows ) { it . toString ( ) } }","docstring":"/**\n * Returns a sequence of snapshots of the window of the given [size]\n * sliding along this char sequence with the given [step], where each\n * snapshot is a string.\n * \n * Several last strings may have fewer characters than the given [size].\n * \n * Both [size] and [step] must be positive and can be greater than the number of elements in this char sequence.\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 < R > CharSequence . windowedSequence ( size : Int , step : Int = , partialWindows : Boolean = false , transform : ( CharSequence ) -> R ) : Sequence < R >","body":"{ checkWindowSizeStep ( size , step ) val windows = ( if ( partialWindows ) indices else until length - size + ) step step return windows . asSequence ( ) . map { index -> val end = index + size val coercedEnd = if ( end < || end > length ) length else end transform ( subSequence ( index , coercedEnd ) ) } }","docstring":"/**\n * Returns a sequence of results of applying the given [transform] function to\n * an each char sequence representing a view over the window of the given [size]\n * sliding along this char sequence with the given [step].\n * \n * Note that the char sequence 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 char sequences may have fewer characters than the given [size].\n * \n * Both [size] and [step] must be positive and can be greater than the number of elements in this char sequence.\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 CharSequence . zip ( other : CharSequence ) : List < Pair < Char , Char > >","body":"{ return zip ( other ) { c1 , c2 -> c1 to c2 } }","docstring":"/**\n * Returns a list of pairs built from the characters of `this` and the [other] char sequences with the same index\n * The returned list has length of the shortest char sequence.\n * \n * @sample samples.text.Strings.zip\n */"} {"signature":"public inline fun < V > CharSequence . zip ( other : CharSequence , transform : ( a : Char , b : Char ) -> V ) : List < V >","body":"{ val length = minOf ( this . length , other . length ) val list = ArrayList < V > ( length ) for ( i in until length ) { list . add ( transform ( this [ i ] , other [ i ] ) ) } return list }","docstring":"/**\n * Returns a list of values built from the characters of `this` and the [other] char sequences with the same index\n * using the provided [transform] function applied to each pair of characters.\n * The returned list has length of the shortest char sequence.\n * \n * @sample samples.text.Strings.zipWithTransform\n */"} {"signature":"@ SinceKotlin ( \"\" ) public fun CharSequence . zipWithNext ( ) : List < Pair < Char , Char > >","body":"{ return zipWithNext { a , b -> a to b } }","docstring":"/**\n * Returns a list of pairs of each two adjacent characters in this char sequence.\n * \n * The returned list is empty if this char sequence contains less than two characters.\n * \n * @sample samples.collections.Collections.Transformations.zipWithNext\n */"} {"signature":"@ SinceKotlin ( \"\" ) public inline fun < R > CharSequence . zipWithNext ( transform : ( a : Char , b : Char ) -> R ) : List < R >","body":"{ val size = length - if ( size < ) return emptyList ( ) val result = ArrayList < R > ( size ) for ( index in until size ) { result . add ( transform ( this [ index ] , this [ index + ] ) ) } return result }","docstring":"/**\n * Returns a list containing the results of applying the given [transform] function\n * to an each pair of two adjacent characters in this char sequence.\n * \n * The returned list is empty if this char sequence contains less than two characters.\n * \n * @sample samples.collections.Collections.Transformations.zipWithNextToFindDeltas\n */"} {"signature":"public fun CharSequence . asIterable ( ) : Iterable < Char >","body":"{ if ( this is String && isEmpty ( ) ) return emptyList ( ) return Iterable { this . iterator ( ) } }","docstring":"/**\n * Creates an [Iterable] instance that wraps the original char sequence returning its characters when being iterated.\n */"} {"signature":"public fun CharSequence . asSequence ( ) : Sequence < Char >","body":"{ if ( this is String && isEmpty ( ) ) return emptySequence ( ) return Sequence { this . iterator ( ) } }","docstring":"/**\n * Creates a [Sequence] instance that wraps the original char sequence returning its characters when being iterated.\n */"} {"signature":"internal inline fun < T : Any ? > runWithTimeoutDumpingCoroutines ( methodName : String , testTimeoutMs : Long , cancelOnTimeout : Boolean , initCancellationException : ( ) -> Throwable , crossinline invocation : ( ) -> T ) : T","body":"{ val testStartedLatch = CountDownLatch ( ) val testResult = FutureTask { testStartedLatch . countDown ( ) invocation ( ) } val testThread = Thread ( testResult , \"\" ) . apply { isDaemon = true } try { testThread . start ( ) testStartedLatch . await ( ) return testResult . get ( testTimeoutMs , TimeUnit . MILLISECONDS ) } catch ( e : TimeoutException ) { handleTimeout ( testThread , methodName , testTimeoutMs , cancelOnTimeout , initCancellationException ( ) ) } catch ( e : ExecutionException ) { throw e . cause ? : e } }","docstring":"/**\n * Run [invocation] in a separate thread with the given timeout in ms, after which the coroutines info is dumped and, if\n * [cancelOnTimeout] is set, the execution is interrupted.\n *\n * Assumes that [DebugProbes] are installed. Does not deinstall them.\n */"} {"signature":"@ Test fun testTransitiveKotlinStdlibDependency ( )","body":"{ val dependencies = pluginOrderBugProject . dependencies ( ) assertFalse ( dependencies . output . contains ( \"\" ) , \"\" + \"\" ) }","docstring":"/**\n * kotlin-stdlib is an implementation dependency of :atomicfu module, \n * because compileOnly dependencies are not applicable for Native targets (#376).\n * \n * This test ensures that kotlin-stdlib of the Kotlin version used to build kotlinx-atomicfu library is not \"required\" in the user's project.\n * The user project should use kotlin-stdlib version that is present in it's classpath.\n */"} {"signature":"internal fun < T > Iterable < DataFrame < T > > . concatKeepingSchema ( ) : DataFrame < T >","body":"{ val dataFrames = asList ( ) when ( dataFrames . size ) { -> return emptyDataFrame ( ) -> return dataFrames [ ] } val columnNames = dataFrames . first ( ) . columnNames ( ) val columns = columnNames . map { name -> val values = dataFrames . flatMap { it . getColumn ( name ) . values ( ) } DataColumn . createValueColumn ( name , values , dataFrames . first ( ) . getColumn ( name ) . type ( ) ) } return dataFrameOf ( columns ) . cast ( ) }","docstring":"/**\n * same as [Iterable>.concat()] without internal type guessing (all batches should have the same schema)\n */"} {"signature":"internal fun DataFrame . Companion . readArrowIPCImpl ( channel : ReadableByteChannel , allocator : RootAllocator = Allocator . ROOT , nullability : NullabilityOptions = NullabilityOptions . Infer , ) : AnyFrame","body":"{ return readArrowImpl ( ArrowStreamReader ( channel , allocator ) , nullability ) }","docstring":"/**\n * Read [Arrow interprocess streaming format](https://arrow.apache.org/docs/java/ipc.html#writing-and-reading-streaming-format) data from existing [channel]\n */"} {"signature":"internal fun DataFrame . Companion . readArrowFeatherImpl ( channel : SeekableByteChannel , allocator : RootAllocator = Allocator . ROOT , nullability : NullabilityOptions = NullabilityOptions . Infer , ) : AnyFrame","body":"{ return readArrowImpl ( ArrowFileReader ( channel , allocator ) , nullability ) }","docstring":"/**\n * Read [Arrow random access format](https://arrow.apache.org/docs/java/ipc.html#writing-and-reading-random-access-files) data from existing [channel]\n */"} {"signature":"internal fun DataFrame . Companion . readArrowImpl ( reader : ArrowReader , nullability : NullabilityOptions = NullabilityOptions . Infer ) : AnyFrame","body":"{ reader . use { val flattened = buildList { when ( reader ) { is ArrowFileReader -> { reader . recordBlocks . forEach { block -> reader . loadRecordBatch ( block ) val root = reader . vectorSchemaRoot val schema = root . schema val df = schema . fields . map { f -> readField ( root , f , nullability ) } . toDataFrame ( ) add ( df ) } } else -> { val root = reader . vectorSchemaRoot val schema = root . schema while ( reader . loadNextBatch ( ) ) { val df = schema . fields . map { f -> readField ( root , f , nullability ) } . toDataFrame ( ) add ( df ) } } } } return flattened . concatKeepingSchema ( ) } }","docstring":"/**\n * Read [Arrow any format](https://arrow.apache.org/docs/java/ipc.html#reading-writing-ipc-formats) data from existing [reader]\n */"} {"signature":"private fun KotlinGradleProjectCheckerContext . compileOnlyDependencies ( target : KotlinTarget , ) : List < CompilationDependenciesPair >","body":"{ val apiElementsDependencies = project . configurations . findByName ( target . apiElementsConfigurationName ) ? . allDependencies . orEmpty ( ) fun Dependency . isInApiElements ( ) : Boolean = apiElementsDependencies . any { it . contentEquals ( this ) } val compilationsIncompatibleWithCompileOnly = target . compilations . filter { it . isPublished ( ) } . filter { ! isAllowedCompileOnlyDependencies ( it . target . platformType ) } return compilationsIncompatibleWithCompileOnly . map { compilation -> val compileOnlyDependencies = project . configurations . findByName ( compilation . compileOnlyConfigurationName ) ? . allDependencies . orEmpty ( ) val nonApiCompileOnlyDependencies = compileOnlyDependencies . filter { ! it . isInApiElements ( ) } CompilationDependenciesPair ( compilation , nonApiCompileOnlyDependencies . map { it . stringCoordinates ( ) } , ) } }","docstring":"/**\n * Extract all dependencies of [target], satisfying:\n * 1. they are `compileOnly`\n * 2. they are not exposed as api elements.\n *\n * Fetches Configurations leniently, just in case a plugin (e.g. AGP) isn't configured correctly.\n */"} {"signature":"private fun KotlinCompilation < * > . isPublished ( ) : Boolean","body":"{ return when ( this ) { is KotlinMetadataCompilation < * > -> true else -> name == KotlinCompilation . MAIN_COMPILATION_NAME } }","docstring":"/**\n * Estimate whether a [KotlinCompilation] is 'publishable' (i.e. it is a main, non-test compilation).\n */"} {"signature":"abstract fun getSymbolsByPredicate ( predicate : LookupPredicate ) : List < FirBasedSymbol < * > >","body":"abstract fun getSymbolsByPredicate ( predicate : LookupPredicate ) : List < FirBasedSymbol < * > >","docstring":"/**\n * @return list of all declarations from compiled source module which are matched to [predicate]\n */"} {"signature":"abstract fun getOwnersOfDeclaration ( declaration : FirDeclaration ) : List < FirBasedSymbol < * > > ?","body":"abstract fun getOwnersOfDeclaration ( declaration : FirDeclaration ) : List < FirBasedSymbol < * > > ?","docstring":"/**\n * @return list of all parents of [declaration]\n */"} {"signature":"abstract fun fileHasPluginAnnotations ( file : FirFile ) : Boolean","body":"abstract fun fileHasPluginAnnotations ( file : FirFile ) : Boolean","docstring":"/**\n * @return `true` if file has a top-level annotation from the [FirRegisteredPluginAnnotations.annotations] list.\n * @see FirRegisteredPluginAnnotations.annotations\n */"} {"signature":"abstract fun matches ( predicate : AbstractPredicate < * > , declaration : FirDeclaration ) : Boolean","body":"abstract fun matches ( predicate : AbstractPredicate < * > , declaration : FirDeclaration ) : Boolean","docstring":"/**\n * @return if [declaration] matches [predicate] or not\n */"} {"signature":"fun matches ( predicate : AbstractPredicate < * > , declaration : FirBasedSymbol < * > ) : Boolean","body":"{ return matches ( predicate , declaration . fir ) }","docstring":"/**\n * @return if [declaration] matches [predicate] or not\n */"} {"signature":"fun matches ( predicates : List < AbstractPredicate < * > > , declaration : FirDeclaration ) : Boolean","body":"{ return predicates . any { matches ( it , declaration ) } }","docstring":"/**\n * @return if [declaration] matches any predicate from [predicates] or not\n */"} {"signature":"fun matches ( predicates : List < AbstractPredicate < * > > , declaration : FirBasedSymbol < * > ) : Boolean","body":"{ return matches ( predicates , declaration . fir ) }","docstring":"/**\n * @return if [declaration] matches any predicate from [predicates] or not\n */"} {"signature":"@ FirExtensionApiInternals open fun registerAnnotatedDeclaration ( declaration : FirDeclaration , owners : PersistentList < FirDeclaration > )","body":"{ }","docstring":"/**\n * Utility method which should not be used from plugins\n */"} {"signature":"@ InternalCoroutinesApi public fun getCancellationException ( ) : CancellationException","body":"@ InternalCoroutinesApi public fun getCancellationException ( ) : CancellationException","docstring":"/**\n * Returns [CancellationException] that signals the completion of this job. This function is\n * used by [cancellable][suspendCancellableCoroutine] suspending functions. They throw exception\n * returned by this function when they suspend in the context of this job and this job becomes _complete_.\n *\n * This function returns the original [cancel] cause of this job if that `cause` was an instance of\n * [CancellationException]. Otherwise (if this job was cancelled with a cause of a different type, or\n * was cancelled without a cause, or had completed normally), an instance of [CancellationException] is\n * returned. The [CancellationException.cause] of the resulting [CancellationException] references\n * the original cancellation cause that was passed to [cancel] function.\n *\n * This function throws [IllegalStateException] when invoked on a job that is still active.\n *\n * @suppress **This an internal API and should not be used from general code.**\n */"} {"signature":"public fun start ( ) : Boolean","body":"public fun start ( ) : Boolean","docstring":"/**\n * Starts coroutine related to this job (if any) if it was not started yet.\n * The result is `true` if this invocation actually started coroutine or `false`\n * if it was already started or completed.\n */"} {"signature":"public fun cancel ( cause : CancellationException ? = null )","body":"public fun cancel ( cause : CancellationException ? = null )","docstring":"/**\n * Cancels this job with an optional cancellation [cause].\n * A cause can be used to specify an error message or to provide other details on\n * the cancellation reason for debugging purposes.\n * See [Job] documentation for full explanation of cancellation machinery.\n */"} {"signature":"@ Deprecated ( level = DeprecationLevel . HIDDEN , message = \"\" ) public fun cancel ( ) : Unit","body":"= cancel ( null )","docstring":"/**\n * @suppress This method implements old version of JVM ABI. Use [cancel].\n */"} {"signature":"@ Deprecated ( level = DeprecationLevel . HIDDEN , message = \"\" ) public fun cancel ( cause : Throwable ? = null ) : Boolean","body":"@ Deprecated ( level = DeprecationLevel . HIDDEN , message = \"\" ) public fun cancel ( cause : Throwable ? = null ) : Boolean","docstring":"/**\n * @suppress This method has bad semantics when cause is not a [CancellationException]. Use [cancel].\n */"} {"signature":"@ InternalCoroutinesApi public fun attachChild ( child : ChildJob ) : ChildHandle","body":"@ InternalCoroutinesApi public fun attachChild ( child : ChildJob ) : ChildHandle","docstring":"/**\n * Attaches child job so that this job becomes its parent and\n * returns a handle that should be used to detach it.\n *\n * A parent-child relation has the following effect:\n * - Cancellation of parent with [cancel] or its exceptional completion (failure)\n * immediately cancels all its children.\n * - Parent cannot complete until all its children are complete. Parent waits for all its children to\n * complete in _completing_ or _cancelling_ states.\n *\n * **A child must store the resulting [ChildHandle] and [dispose][DisposableHandle.dispose] the attachment\n * to its parent on its own completion.**\n *\n * Coroutine builders and job factory functions that accept `parent` [CoroutineContext] parameter\n * lookup a [Job] instance in the parent context and use this function to attach themselves as a child.\n * They also store a reference to the resulting [ChildHandle] and dispose a handle when they complete.\n *\n * @suppress This is an internal API. This method is too error prone for public API.\n */"} {"signature":"public suspend fun join ( )","body":"public suspend fun join ( )","docstring":"/**\n * Suspends the coroutine until this job is complete. This invocation resumes normally (without exception)\n * when the job is complete for any reason and the [Job] of the invoking coroutine is still [active][isActive].\n * This function also [starts][Job.start] the corresponding coroutine if the [Job] was still in _new_ state.\n *\n * Note that the job becomes complete only when all its children are complete.\n *\n * This suspending function is cancellable and **always** checks for a cancellation of the invoking coroutine's Job.\n * If the [Job] of the invoking coroutine is cancelled or completed when this\n * suspending function is invoked or while it is suspended, this function\n * throws [CancellationException].\n *\n * In particular, it means that a parent coroutine invoking `join` on a child coroutine throws\n * [CancellationException] if the child had failed, since a failure of a child coroutine cancels parent by default,\n * unless the child was launched from within [supervisorScope].\n *\n * This function can be used in [select] invocation with [onJoin] clause.\n * Use [isCompleted] to check for a completion of this job without waiting.\n *\n * There is [cancelAndJoin] function that combines an invocation of [cancel] and `join`.\n */"} {"signature":"public fun invokeOnCompletion ( handler : CompletionHandler ) : DisposableHandle","body":"public fun invokeOnCompletion ( handler : CompletionHandler ) : DisposableHandle","docstring":"/**\n * Registers handler that is **synchronously** invoked once on completion of this job.\n * When the job is already complete, then the handler is immediately invoked\n * with the job's exception or cancellation cause or `null`. Otherwise, the handler will be invoked once when this\n * job is complete.\n *\n * The meaning of `cause` that is passed to the handler:\n * - Cause is `null` when the job has completed normally.\n * - Cause is an instance of [CancellationException] when 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 *\n * The resulting [DisposableHandle] can be used to [dispose][DisposableHandle.dispose] the\n * registration of this handler and release its memory if its invocation is no longer needed.\n * There is no need to dispose the handler after completion of this job. The references to\n * all the handlers are released when this job completes.\n *\n * Installed [handler] should not throw any exceptions. If it does, they will get caught,\n * wrapped into [CompletionHandlerException], and rethrown, potentially causing crash of unrelated code.\n *\n * **Note**: Implementation 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] is invoked.\n */"} {"signature":"@ InternalCoroutinesApi public fun invokeOnCompletion ( onCancelling : Boolean = false , invokeImmediately : Boolean = true , handler : CompletionHandler ) : DisposableHandle","body":"@ InternalCoroutinesApi public fun invokeOnCompletion ( onCancelling : Boolean = false , invokeImmediately : Boolean = true , handler : CompletionHandler ) : DisposableHandle","docstring":"/**\n * Kept for preserving compatibility. Shouldn't be used by anyone.\n * @suppress\n */"} {"signature":"@ Suppress ( \"\" ) @ Deprecated ( message = \"\" + \"\" + \"\" , level = DeprecationLevel . ERROR ) public operator fun plus ( other : Job ) : Job","body":"= other","docstring":"/**\n * @suppress **Error**: Operator '+' on two Job objects is meaningless.\n * Job is a coroutine context element and `+` is a set-sum operator for coroutine contexts.\n * The job to the right of `+` just replaces the job the left of `+`.\n */"} {"signature":"internal fun Job . invokeOnCompletion ( onCancelling : Boolean = false , invokeImmediately : Boolean = true , handler : InternalCompletionHandler ) : DisposableHandle","body":"= when ( this ) { is JobSupport -> invokeOnCompletionInternal ( onCancelling , invokeImmediately , handler ) else -> invokeOnCompletion ( onCancelling , invokeImmediately , handler :: invoke ) }","docstring":"/**\n * Registers a handler that is **synchronously** invoked once on cancellation or completion of this job.\n *\n * If the handler would have been invoked earlier if it was registered at that time, then it is invoked immediately,\n * unless [invokeImmediately] is set to `false`.\n *\n * The handler is scheduled to be invoked once the job is cancelled or is complete.\n * This behavior can be changed by setting the [onCancelling] parameter to `true`.\n * In this case, the handler is invoked as soon as the job becomes _cancelling_ instead.\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 *\n * The resulting [DisposableHandle] can be used to [dispose][DisposableHandle.dispose] of the registration of this\n * handler and release its memory if its invocation is no longer needed.\n * There is no need to dispose of the handler after completion of this job. The references to\n * all the handlers are released when this job completes.\n */"} {"signature":"@ Suppress ( \"\" ) public fun Job ( parent : Job ? = null ) : CompletableJob","body":"= JobImpl ( parent )","docstring":"/**\n * Creates a job object in an active state.\n * A failure of any child of this job immediately causes this job to fail, too, and cancels the rest of its children.\n *\n * To handle children failure independently of each other use [SupervisorJob].\n *\n * If [parent] job is specified, then this job becomes a child job of its parent and\n * is cancelled when its parent fails or is cancelled. All this job's children are cancelled in this case, too.\n *\n * Conceptually, the resulting job works in the same way as the job created by the `launch { body }` invocation\n * (see [launch]), but without any code in the body. It is active until cancelled or completed. Invocation of\n * [CompletableJob.complete] or [CompletableJob.completeExceptionally] corresponds to the successful or\n * failed completion of the body of the coroutine.\n *\n * @param parent an optional parent job.\n */"} {"signature":"@ Suppress ( \"\" ) @ Deprecated ( level = DeprecationLevel . HIDDEN , message = \"\" ) @ JvmName ( \"\" ) public fun Job0 ( parent : Job ? = null ) : Job","body":"= Job ( parent )","docstring":"/** @suppress Binary compatibility only */"} {"signature":"public fun dispose ( )","body":"public fun dispose ( )","docstring":"/**\n * Disposes the corresponding object, making it eligible for garbage collection.\n * Repeated invocation of this function has no effect.\n */"} {"signature":"@ InternalCoroutinesApi public fun parentCancelled ( parentJob : ParentJob )","body":"@ InternalCoroutinesApi public fun parentCancelled ( parentJob : ParentJob )","docstring":"/**\n * Parent is cancelling its child by invoking this method.\n * Child finds the cancellation cause using [ParentJob.getChildJobCancellationCause].\n * This method does nothing is the child is already being cancelled.\n *\n * @suppress **This is unstable API and it is subject to change.**\n */"} {"signature":"@ InternalCoroutinesApi public fun getChildJobCancellationCause ( ) : CancellationException","body":"@ InternalCoroutinesApi public fun getChildJobCancellationCause ( ) : CancellationException","docstring":"/**\n * Child job is using this method to learn its cancellation cause when the parent cancels it with [ChildJob.parentCancelled].\n * This method is invoked only if the child was not already being cancelled.\n *\n * Note that [CancellationException] is the method's return type: if child is cancelled by its parent,\n * then the original exception is **already** handled by either the parent or the original source of failure.\n *\n * @suppress **This is unstable API and it is subject to change.**\n */"} {"signature":"@ InternalCoroutinesApi public fun childCancelled ( cause : Throwable ) : Boolean","body":"@ InternalCoroutinesApi public fun childCancelled ( cause : Throwable ) : Boolean","docstring":"/**\n * Child is cancelling its parent by invoking this method.\n * This method is invoked by the child twice. The first time child report its root cause as soon as possible,\n * so that all its siblings and the parent can start cancelling their work asap. The second time\n * child invokes this method when it had aggregated and determined its final cancellation cause.\n *\n * @suppress **This is unstable API and it is subject to change.**\n */"} {"signature":"internal fun Job . disposeOnCompletion ( handle : DisposableHandle ) : DisposableHandle","body":"= invokeOnCompletion ( handler = DisposeOnCompletion ( handle ) )","docstring":"/**\n * Disposes a specified [handle] when this job is complete.\n *\n * This is a shortcut for the following code with slightly more efficient implementation (one fewer object created).\n * ```\n * invokeOnCompletion { handle.dispose() }\n * ```\n */"} {"signature":"public suspend fun Job . cancelAndJoin ( )","body":"{ cancel ( ) return join ( ) }","docstring":"/**\n * Cancels the job and suspends the invoking coroutine until the cancelled job is complete.\n *\n * This suspending function is cancellable and **always** checks for a cancellation of the invoking coroutine's Job.\n * If the [Job] of the invoking coroutine is cancelled or completed when this\n * suspending function is invoked or while it is suspended, this function\n * throws [CancellationException].\n *\n * In particular, it means that a parent coroutine invoking `cancelAndJoin` on a child coroutine throws\n * [CancellationException] if the child had failed, since a failure of a child coroutine cancels parent by default,\n * unless the child was launched from within [supervisorScope].\n *\n * This is a shortcut for the invocation of [cancel][Job.cancel] followed by [join][Job.join].\n */"} {"signature":"public fun Job . cancelChildren ( cause : CancellationException ? = null )","body":"{ children . forEach { it . cancel ( cause ) } }","docstring":"/**\n * Cancels all [children][Job.children] jobs of this coroutine using [Job.cancel] for all of them\n * with an optional cancellation [cause].\n * Unlike [Job.cancel] on this job as a whole, the state of this job itself is not affected.\n */"} {"signature":"@ Deprecated ( level = DeprecationLevel . HIDDEN , message = \"\" ) public fun Job . cancelChildren ( ) : Unit","body":"= cancelChildren ( null )","docstring":"/**\n * @suppress This method implements old version of JVM ABI. Use [cancel].\n */"} {"signature":"@ Deprecated ( level = DeprecationLevel . HIDDEN , message = \"\" ) public fun Job . cancelChildren ( cause : Throwable ? = null )","body":"{ children . forEach { ( it as? JobSupport ) ? . cancelInternal ( cause . orCancellation ( this ) ) } }","docstring":"/**\n * @suppress This method has bad semantics when cause is not a [CancellationException]. Use [Job.cancelChildren].\n */"} {"signature":"public fun CoroutineContext . cancel ( cause : CancellationException ? = null )","body":"{ this [ Job ] ? . cancel ( cause ) }","docstring":"/**\n * Cancels [Job] of this context with an optional cancellation cause.\n * See [Job.cancel] for details.\n */"} {"signature":"@ Deprecated ( level = DeprecationLevel . HIDDEN , message = \"\" ) public fun CoroutineContext . cancel ( ) : Unit","body":"= cancel ( null )","docstring":"/**\n * @suppress This method implements old version of JVM ABI. Use [CoroutineContext.cancel].\n */"} {"signature":"public fun Job . ensureActive ( ) : Unit","body":"{ if ( ! isActive ) throw getCancellationException ( ) }","docstring":"/**\n * Ensures that current job is [active][Job.isActive].\n * If the job is no longer active, throws [CancellationException].\n * If the job was cancelled, thrown exception contains the original cancellation cause.\n *\n * This method is a drop-in replacement for the following code, but with more precise exception:\n * ```\n * if (!job.isActive) {\n * throw CancellationException()\n * }\n * ```\n */"} {"signature":"public fun CoroutineContext . ensureActive ( )","body":"{ get ( Job ) ? . ensureActive ( ) }","docstring":"/**\n * Ensures that job in the current context is [active][Job.isActive].\n *\n * If the job is no longer active, throws [CancellationException].\n * If the job was cancelled, thrown exception contains the original cancellation cause.\n * This function does not do anything if there is no [Job] in the context, since such a coroutine cannot be cancelled.\n *\n * This method is a drop-in replacement for the following code, but with more precise exception:\n * ```\n * if (!isActive) {\n * throw CancellationException()\n * }\n * ```\n */"} {"signature":"public fun Job . cancel ( message : String , cause : Throwable ? = null ) : Unit","body":"= cancel ( CancellationException ( message , cause ) )","docstring":"/**\n * Cancels current job, including all its children with a specified diagnostic error [message].\n * A [cause] can be specified to provide additional details on a cancellation reason for debugging purposes.\n */"} {"signature":"@ Deprecated ( level = DeprecationLevel . HIDDEN , message = \"\" ) public fun CoroutineContext . cancel ( cause : Throwable ? = null ) : Boolean","body":"{ val job = this [ Job ] as? JobSupport ? : return false job . cancelInternal ( cause . orCancellation ( job ) ) return true }","docstring":"/**\n * @suppress This method has bad semantics when cause is not a [CancellationException]. Use [CoroutineContext.cancel].\n */"} {"signature":"public fun CoroutineContext . cancelChildren ( cause : CancellationException ? = null )","body":"{ this [ Job ] ? . children ? . forEach { it . cancel ( cause ) } }","docstring":"/**\n * Cancels all children of the [Job] in this context, without touching the state of this job itself\n * with an optional cancellation cause. See [Job.cancel].\n * It does not do anything if there is no job in the context or it has no children.\n */"} {"signature":"@ Deprecated ( level = DeprecationLevel . HIDDEN , message = \"\" ) public fun CoroutineContext . cancelChildren ( ) : Unit","body":"= cancelChildren ( null )","docstring":"/**\n * @suppress This method implements old version of JVM ABI. Use [CoroutineContext.cancelChildren].\n */"} {"signature":"@ Deprecated ( level = DeprecationLevel . HIDDEN , message = \"\" ) public fun CoroutineContext . cancelChildren ( cause : Throwable ? = null )","body":"{ val job = this [ Job ] ? : return job . children . forEach { ( it as? JobSupport ) ? . cancelInternal ( cause . orCancellation ( job ) ) } }","docstring":"/**\n * @suppress This method has bad semantics when cause is not a [CancellationException]. Use [CoroutineContext.cancelChildren].\n */"} {"signature":"override fun dispose ( )","body":"{ }","docstring":"/**\n * Does not do anything.\n * @suppress\n */"} {"signature":"override fun childCancelled ( cause : Throwable ) : Boolean","body":"= false","docstring":"/**\n * Returns `false`.\n * @suppress\n */"} {"signature":"override fun toString ( ) : String","body":"= \"\"","docstring":"/**\n * Returns \"NonDisposableHandle\" string.\n * @suppress\n */"} {"signature":"@ Test fun testBasicNoSuspend ( )","body":"= runTest { expect ( ) val result = withTimeoutOrNull ( . seconds ) { expect ( ) \"\" } assertEquals ( \"\" , result ) finish ( ) }","docstring":"/**\n * Tests a case of no timeout and no suspension inside.\n */"} {"signature":"@ Test fun testBasicSuspend ( )","body":"= runTest { expect ( ) val result = withTimeoutOrNull ( . seconds ) { expect ( ) yield ( ) expect ( ) \"\" } assertEquals ( \"\" , result ) finish ( ) }","docstring":"/**\n * Tests a case of no timeout and one suspension inside.\n */"} {"signature":"@ Test fun testDispatch ( )","body":"= runTest { expect ( ) launch { expect ( ) yield ( ) expect ( ) } expect ( ) val result = withTimeoutOrNull ( . seconds ) { expect ( ) yield ( ) expect ( ) \"\" } assertEquals ( \"\" , result ) expect ( ) yield ( ) finish ( ) }","docstring":"/**\n * Tests property dispatching of `withTimeoutOrNull` blocks\n */"} {"signature":"@ Test fun testYieldBlockingWithTimeout ( )","body":"= runTest { expect ( ) val result = withTimeoutOrNull ( . milliseconds ) { while ( true ) { yield ( ) } } assertNull ( result ) finish ( ) }","docstring":"/**\n * Tests that a 100% CPU-consuming loop will react on timeout if it has yields.\n */"} {"signature":"@ Test fun absD ( )","body":"{ assertTrue ( \"\" , abs ( - ) == ) assertTrue ( \"\" , abs ( ) == ) }","docstring":"/**\n * Tests kotlin.math.abs(Double)\n */"} {"signature":"@ Test fun absF ( )","body":"{ assertTrue ( \"\" , abs ( - ) == ) assertTrue ( \"\" , abs ( ) == ) }","docstring":"/**\n * Tests kotlin.math.abs(float)\n */"} {"signature":"@ Test fun absI ( )","body":"{ assertTrue ( \"\" , abs ( - ) == ) assertTrue ( \"\" , abs ( ) == ) }","docstring":"/**\n * Tests kotlin.math.abs(int)\n */"} {"signature":"@ Test fun absJ ( )","body":"{ assertTrue ( \"\" , abs ( - ) == ) assertTrue ( \"\" , abs ( ) == ) }","docstring":"/**\n * Tests kotlin.math.abs(long)\n */"} {"signature":"@ Test fun acosD ( )","body":"{ val r = cos ( acos ( ADJ / HYP ) ) val lr = r . toBits ( ) val t = ( ADJ / HYP ) . toBits ( ) assertTrue ( \"\" , lr == t || lr + == t || lr - == t ) }","docstring":"/**\n * Tests kotlin.math.acos(Double)\n */"} {"signature":"@ Test fun asinD ( )","body":"{ val r = sin ( asin ( OPP / HYP ) ) val lr = r . toBits ( ) val t = ( OPP / HYP ) . toBits ( ) assertTrue ( \"\" , lr == t || lr + == t || lr - == t ) }","docstring":"/**\n * Tests kotlin.math.asin(Double)\n */"} {"signature":"@ Test fun atanD ( )","body":"{ val answer = tan ( atan ( ) ) assertTrue ( \"\" + answer , answer <= && answer >= ) }","docstring":"/**\n * Tests kotlin.math.atan(Double)\n */"} {"signature":"@ Test fun atan2DD ( )","body":"{ val answer = atan ( tan ( ) ) assertTrue ( \"\" + answer , answer <= && answer >= ) }","docstring":"/**\n * Tests kotlin.math.atan2(Double, Double)\n */"} {"signature":"@ Test fun ceilD ( )","body":"{ assertEquals ( \"\" , , ceil ( ) , ) assertEquals ( \"\" , - , ceil ( - ) , ) }","docstring":"/**\n * Tests kotlin.math.ceil(Double)\n */"} {"signature":"@ Test fun withSign_D ( )","body":"{ for ( i in COPYSIGN_DD_CASES . indices ) { val magnitude = COPYSIGN_DD_CASES [ i ] val absMagnitudeBits = abs ( magnitude ) . toBits ( ) val negMagnitudeBits = ( - abs ( magnitude ) ) . toBits ( ) assertTrue ( \"\" , Double . isNaN ( Double . NaN . withSign ( magnitude ) ) ) for ( j in COPYSIGN_DD_CASES . indices ) { val sign = COPYSIGN_DD_CASES [ j ] val resultBits = magnitude . withSign ( sign ) . toBits ( ) if ( sign > || ( + ) . toBits ( ) == sign . toBits ( ) || . toBits ( ) == sign . toBits ( ) ) { assertEquals ( \"\" , absMagnitudeBits , resultBits ) } if ( sign < || ( - ) . toBits ( ) == sign . toBits ( ) ) { assertEquals ( \"\" , negMagnitudeBits , resultBits ) } } } assertTrue ( \"\" , Double . isNaN ( Double . NaN . withSign ( Double . NaN ) ) ) }","docstring":"/**\n * Tests kotlin.math.withSign(Double)\n */"} {"signature":"@ Test fun withSign_F ( )","body":"{ for ( i in COPYSIGN_FF_CASES . indices ) { val magnitude = COPYSIGN_FF_CASES [ i ] val absMagnitudeBits = abs ( magnitude ) . toBits ( ) val negMagnitudeBits = ( - abs ( magnitude ) ) . toBits ( ) assertTrue ( \"\" , Float . isNaN ( Float . NaN . withSign ( magnitude ) ) ) for ( j in COPYSIGN_FF_CASES . indices ) { val sign = COPYSIGN_FF_CASES [ j ] val resultBits = magnitude . withSign ( sign ) . toBits ( ) if ( sign > || ( + ) . toBits ( ) == sign . toBits ( ) || . toBits ( ) == sign . toBits ( ) ) { assertEquals ( \"\" , absMagnitudeBits , resultBits ) } if ( sign < || ( - ) . toBits ( ) == sign . toBits ( ) ) { assertEquals ( \"\" , negMagnitudeBits , resultBits ) } } } assertTrue ( \"\" , Float . isNaN ( Float . NaN . withSign ( Float . NaN ) ) ) }","docstring":"/**\n * Tests kotlin.math.withSign(Float)\n */"} {"signature":"@ Test fun cosD ( )","body":"{ assertEquals ( \"\" , , cos ( ) , ) assertEquals ( \"\" , , cos ( ) , ) }","docstring":"/**\n * Tests kotlin.math.cos(Double)\n */"} {"signature":"@ Test fun cosh_D ( )","body":"{ assertTrue ( Double . isNaN ( cosh ( Double . NaN ) ) ) assertEquals ( \"\" , Double . POSITIVE_INFINITY , cosh ( Double . POSITIVE_INFINITY ) , ) assertEquals ( \"\" , Double . POSITIVE_INFINITY , cosh ( Double . NEGATIVE_INFINITY ) , ) assertEquals ( \"\" , , cosh ( + ) , ) assertEquals ( \"\" , , cosh ( - ) , ) assertEquals ( \"\" , Double . POSITIVE_INFINITY , cosh ( ) , ) assertEquals ( \"\" , Double . POSITIVE_INFINITY , cosh ( - ) , ) assertEquals ( \"\" , , cosh ( ) , ) assertEquals ( \"\" , , cosh ( - ) , ) assertEquals ( \"\" , , cosh ( ) , ) assertEquals ( \"\" , Double . POSITIVE_INFINITY , cosh ( Double . MAX_VALUE ) , ) assertEquals ( \"\" , , cosh ( Double . MIN_VALUE ) , ) }","docstring":"/**\n * Tests kotlin.math.cosh(Double)\n */"} {"signature":"@ Test fun expD ( )","body":"{ assertTrue ( \"\" , abs ( exp ( ) - E * E * E * E ) < ) assertTrue ( \"\" , ln ( abs ( exp ( ) ) - ) < ) }","docstring":"/**\n * Tests kotlin.math.exp(Double)\n */"} {"signature":"@ Test fun expm1_D ( )","body":"{ assertTrue ( \"\" , Double . isNaN ( expm1 ( Double . NaN ) ) ) assertEquals ( \"\" , Double . POSITIVE_INFINITY , expm1 ( Double . POSITIVE_INFINITY ) , ) assertEquals ( \"\" , - , expm1 ( Double . NEGATIVE_INFINITY ) , ) assertEquals ( . toBits ( ) , expm1 ( ) . toBits ( ) ) assertEquals ( + . toBits ( ) , expm1 ( + ) . toBits ( ) ) assertEquals ( ( - ) . toBits ( ) , expm1 ( - ) . toBits ( ) ) assertEquals ( \"\" , - , expm1 ( - ) ) assertEquals ( \"\" , , expm1 ( ) , ) assertEquals ( \"\" , Double . POSITIVE_INFINITY , expm1 ( ) , ) assertEquals ( \"\" , Double . POSITIVE_INFINITY , expm1 ( Double . MAX_VALUE ) , ) assertEquals ( \"\" , Double . MIN_VALUE , expm1 ( Double . MIN_VALUE ) , ) }","docstring":"/**\n * Tests kotlin.math.expm1(Double)\n */"} {"signature":"@ Test fun floorD ( )","body":"{ assertEquals ( \"\" , , floor ( ) , ) assertEquals ( \"\" , - , floor ( - ) , ) assertEquals ( \"\" , , floor ( ) , ) assertEquals ( \"\" , , floor ( ) , ) assertEquals ( \"\" , - , floor ( - ) , ) assertEquals ( \"\" , , floor ( ) , ) assertEquals ( \"\" , - , floor ( - ) , ) assertEquals ( \"\" , , floor ( ) , ) assertEquals ( Double . NaN . toString ( ) , floor ( Double . NaN ) . toString ( ) , \"\" ) assertEquals ( ( + ) . toString ( ) , floor ( + ) . toString ( ) , \"\" ) assertEquals ( ( - ) . toString ( ) , floor ( - ) . toString ( ) , \"\" ) assertEquals ( Double . POSITIVE_INFINITY . toString ( ) , floor ( Double . POSITIVE_INFINITY ) . toString ( ) , \"\" ) assertEquals ( Double . NEGATIVE_INFINITY . toString ( ) , floor ( Double . NEGATIVE_INFINITY ) . toString ( ) , \"\" ) }","docstring":"/**\n * Tests kotlin.math.floor(Double)\n */"} {"signature":"@ Test fun hypot_DD ( )","body":"{ assertEquals ( \"\" , Double . POSITIVE_INFINITY , hypot ( Double . POSITIVE_INFINITY , ) , ) assertEquals ( \"\" , Double . POSITIVE_INFINITY , hypot ( Double . NEGATIVE_INFINITY , ) , ) assertEquals ( \"\" , Double . POSITIVE_INFINITY , hypot ( - , Double . POSITIVE_INFINITY ) , ) assertEquals ( \"\" , Double . POSITIVE_INFINITY , hypot ( , Double . NEGATIVE_INFINITY ) , ) assertEquals ( \"\" , Double . POSITIVE_INFINITY , hypot ( Double . POSITIVE_INFINITY , Double . NEGATIVE_INFINITY ) , ) assertEquals ( \"\" , Double . POSITIVE_INFINITY , hypot ( Double . NEGATIVE_INFINITY , Double . POSITIVE_INFINITY ) , ) assertTrue ( \"\" , Double . isNaN ( hypot ( Double . NaN , ) ) ) assertTrue ( \"\" , Double . isNaN ( hypot ( - , Double . NaN ) ) ) assertEquals ( \"\" , , hypot ( , - ) , ) assertEquals ( \"\" , , hypot ( - , ) , ) assertEquals ( \"\" , , hypot ( Double . MAX_VALUE , ) , ) assertEquals ( \"\" , , hypot ( - , Double . MIN_VALUE ) , ) }","docstring":"/**\n * Tests kotlin.math.hypot(Double, Double)\n */"} {"signature":"@ Test fun IEEEremainderDD ( )","body":"{ assertEquals ( \"\" , , . IEEErem ( ) , ) assertTrue ( \"\" , . IEEErem ( ) >= || . IEEErem ( ) >= ) }","docstring":"/**\n * Tests kotlin.math.IEEEremainder(Double, Double)\n */"} {"signature":"@ Test fun lnD ( )","body":"{ var d = while ( d >= - ) { val answer = ln ( exp ( d ) ) assertTrue ( \"\" + d + \"\" + answer , abs ( answer - d ) <= abs ( d * ) ) d -= } }","docstring":"/**\n * Tests kotlin.math.ln(Double)\n */"} {"signature":"@ Test fun log10_D ( )","body":"{ assertTrue ( Double . isNaN ( log10 ( Double . NaN ) ) ) assertTrue ( Double . isNaN ( log10 ( - ) ) ) assertTrue ( Double . isNaN ( log10 ( - ) ) ) assertEquals ( Double . POSITIVE_INFINITY , log10 ( Double . POSITIVE_INFINITY ) ) assertEquals ( Double . NEGATIVE_INFINITY , log10 ( ) ) assertEquals ( Double . NEGATIVE_INFINITY , log10 ( + ) ) assertEquals ( Double . NEGATIVE_INFINITY , log10 ( - ) ) assertEquals ( , log10 ( ) ) assertEquals ( , log10 ( . pow ( ) ) ) assertEquals ( , log10 ( ) ) assertEquals ( , log10 ( ) ) assertEquals ( - , log10 ( ) ) assertEquals ( , log10 ( Double . MAX_VALUE ) ) assertEquals ( - , log10 ( Double . MIN_VALUE ) ) }","docstring":"/**\n * Tests kotlin.math.log10(Double)\n */"} {"signature":"@ Test fun ln1p_D ( )","body":"{ assertTrue ( \"\" , Double . isNaN ( ln1p ( Double . NaN ) ) ) assertTrue ( \"\" , Double . isNaN ( ln1p ( - ) ) ) assertEquals ( \"\" , Double . POSITIVE_INFINITY , ln1p ( Double . POSITIVE_INFINITY ) , ) assertEquals ( . toBits ( ) , ln1p ( ) . toBits ( ) ) assertEquals ( + . toBits ( ) , ln1p ( + ) . toBits ( ) ) assertEquals ( ( - ) . toBits ( ) , ln1p ( - ) . toBits ( ) ) assertEquals ( \"\" , - , ln1p ( - ) , ) assertEquals ( \"\" , , ln1p ( ) , ) assertEquals ( \"\" , , ln1p ( ) , ) assertEquals ( \"\" , , ln1p ( Double . MAX_VALUE ) , ) assertEquals ( \"\" , Double . MIN_VALUE , ln1p ( Double . MIN_VALUE ) , ) }","docstring":"/**\n * Tests kotlin.math.ln1p(Double)\n */"} {"signature":"@ Test fun maxDD ( )","body":"{ assertEquals ( \"\" , , max ( - , ) , ) assertEquals ( \"\" , , max ( , ) , ) assertEquals ( \"\" , - , max ( - , - ) , ) assertEquals ( ( Double . NaN ) . toString ( ) , max ( Double . NaN , ) . toString ( ) , \"\" ) assertEquals ( ( Double . NaN ) . toString ( ) , max ( , Double . NaN ) . toString ( ) , \"\" ) assertEquals ( ( + ) . toString ( ) , max ( + , - ) . toString ( ) , \"\" ) assertEquals ( ( + ) . toString ( ) , max ( - , + ) . toString ( ) , \"\" ) assertEquals ( ( - ) . toString ( ) , max ( - , - ) . toString ( ) , \"\" ) assertEquals ( ( + ) . toString ( ) , max ( + , + ) . toString ( ) , \"\" ) }","docstring":"/**\n * Tests kotlin.math.max(Double, Double)\n */"} {"signature":"@ Test fun maxFF ( )","body":"{ assertTrue ( \"\" , max ( - , ) == ) assertTrue ( \"\" , max ( , ) == ) assertTrue ( \"\" , max ( - , - ) == - ) assertEquals ( Float . NaN . toString ( ) , max ( Float . NaN , ) . toString ( ) , \"\" ) assertEquals ( Float . NaN . toString ( ) , max ( , Float . NaN ) . toString ( ) , \"\" ) assertEquals ( ( + ) . toString ( ) , max ( + , - ) . toString ( ) , \"\" ) assertEquals ( ( + ) . toString ( ) , max ( - , + ) . toString ( ) , \"\" ) assertEquals ( ( - ) . toString ( ) , max ( - , - ) . toString ( ) , \"\" ) assertEquals ( ( + ) . toString ( ) , max ( + , + ) . toString ( ) , \"\" ) }","docstring":"/**\n * Tests kotlin.math.max(float, float)\n */"} {"signature":"@ Test fun maxII ( )","body":"{ assertEquals ( \"\" , , max ( - , ) ) assertEquals ( \"\" , , max ( , ) ) assertEquals ( \"\" , - , max ( - , - ) ) }","docstring":"/**\n * Tests kotlin.math.max(int, int)\n */"} {"signature":"@ Test fun maxJJ ( )","body":"{ assertEquals ( \"\" , , max ( - , ) ) assertEquals ( \"\" , , max ( , ) ) assertEquals ( \"\" , - , max ( - , - ) ) }","docstring":"/**\n * Tests kotlin.math.max(long, long)\n */"} {"signature":"@ Test fun minDD ( )","body":"{ assertEquals ( \"\" , - , min ( - , ) , ) assertEquals ( \"\" , , min ( , ) , ) assertEquals ( \"\" , - , min ( - , - ) , ) assertEquals ( \"\" , , min ( , ) ) assertEquals ( Double . NaN . toString ( ) , min ( Double . NaN , ) . toString ( ) , \"\" ) assertEquals ( Double . NaN . toString ( ) , min ( , Double . NaN ) . toString ( ) , \"\" ) assertEquals ( ( - ) . toString ( ) , min ( + , - ) . toString ( ) , \"\" ) assertEquals ( ( - ) . toString ( ) , min ( - , + ) . toString ( ) , \"\" ) assertEquals ( ( - ) . toString ( ) , min ( - , - ) . toString ( ) , \"\" ) assertEquals ( ( + ) . toString ( ) , min ( + , + ) . toString ( ) , \"\" ) }","docstring":"/**\n * Tests kotlin.math.min(Double, Double)\n */"} {"signature":"@ Test fun minFF ( )","body":"{ assertTrue ( \"\" , min ( - , ) == - ) assertTrue ( \"\" , min ( , ) == ) assertTrue ( \"\" , min ( - , - ) == - ) assertEquals ( \"\" , , min ( , ) ) assertEquals ( Float . NaN . toString ( ) , min ( Float . NaN , ) . toString ( ) , \"\" ) assertEquals ( Float . NaN . toString ( ) , min ( , Float . NaN ) . toString ( ) , \"\" ) assertEquals ( ( - ) . toString ( ) , min ( + , - ) . toString ( ) , \"\" ) assertEquals ( ( - ) . toString ( ) , min ( - , + ) . toString ( ) , \"\" ) assertEquals ( ( - ) . toString ( ) , min ( - , - ) . toString ( ) , \"\" ) assertEquals ( ( + ) . toString ( ) , min ( + , + ) . toString ( ) , \"\" ) }","docstring":"/**\n * Tests kotlin.math.min(float, float)\n */"} {"signature":"@ Test fun minII ( )","body":"{ assertEquals ( \"\" , - , min ( - , ) ) assertEquals ( \"\" , , min ( , ) ) assertEquals ( \"\" , - , min ( - , - ) ) }","docstring":"/**\n * Tests kotlin.math.min(int, int)\n */"} {"signature":"fun test_powDD ( )","body":"{ assertTrue ( \"\" , . pow ( ) . toLong ( ) == ) assertTrue ( \"\" , . pow ( - ) == ) assertEquals ( \"\" , , sqrt ( sqrt ( ) . pow ( ) ) , ) }","docstring":"/**\n * @tests java.lang.Math#pow(double, double)\n */"} {"signature":"@ Test fun roundD ( )","body":"{ assertEquals ( \"\" , , round ( ) , ) assertTrue ( \"\" , Double . isNaN ( round ( Double . NaN ) ) ) assertEquals ( \"\" , , round ( ) , ) assertTrue ( \"\" + + \"\" , round ( ) == ) assertTrue ( \"\" + + , round ( + ) == + ) assertTrue ( \"\" + - , round ( - ) == - ) }","docstring":"/**\n * Tests kotlin.math.round(Double)\n */"} {"signature":"@ Test fun sign_D ( )","body":"{ assertTrue ( Double . isNaN ( sign ( Double . NaN ) ) ) assertTrue ( Double . isNaN ( sign ( Double . NaN ) ) ) assertEquals ( . toBits ( ) , sign ( ) . toBits ( ) ) assertEquals ( + . toBits ( ) , sign ( + ) . toBits ( ) ) assertEquals ( ( - ) . toBits ( ) , sign ( - ) . toBits ( ) ) assertEquals ( , sign ( ) , ) assertEquals ( - , sign ( - ) , ) assertEquals ( , sign ( ) , ) assertEquals ( - , sign ( - ) , ) assertEquals ( , sign ( Double . MAX_VALUE ) , ) assertEquals ( , sign ( Double . MIN_VALUE ) , ) assertEquals ( - , sign ( - Double . MAX_VALUE ) , ) assertEquals ( - , sign ( - Double . MIN_VALUE ) , ) assertEquals ( , sign ( Double . POSITIVE_INFINITY ) , ) assertEquals ( - , sign ( Double . NEGATIVE_INFINITY ) , ) }","docstring":"/**\n * Tests kotlin.math.sign(Double)\n */"} {"signature":"@ Test fun sign_F ( )","body":"{ assertTrue ( Float . isNaN ( sign ( Float . NaN ) ) ) assertEquals ( . toBits ( ) , sign ( ) . toBits ( ) ) assertEquals ( + . toBits ( ) , sign ( + ) . toBits ( ) ) assertEquals ( ( - ) . toBits ( ) , sign ( - ) . toBits ( ) ) assertEquals ( , sign ( ) , ) assertEquals ( - , sign ( - ) , ) assertEquals ( , sign ( ) , ) assertEquals ( - , sign ( - ) , ) assertEquals ( , sign ( Float . MAX_VALUE ) , ) assertEquals ( , sign ( Float . MIN_VALUE ) , ) assertEquals ( - , sign ( - Float . MAX_VALUE ) , ) assertEquals ( - , sign ( - Float . MIN_VALUE ) , ) assertEquals ( , sign ( Float . POSITIVE_INFINITY ) , ) assertEquals ( - , sign ( Float . NEGATIVE_INFINITY ) , ) }","docstring":"/**\n * Tests kotlin.math.sign(float)\n */"} {"signature":"@ Test fun sinD ( )","body":"{ assertEquals ( \"\" , , sin ( ) , ) assertEquals ( \"\" , , sin ( ) , ) }","docstring":"/**\n * Tests kotlin.math.sin(Double)\n */"} {"signature":"@ Test fun sinh_D ( )","body":"{ assertTrue ( \"\" , Double . isNaN ( sinh ( Double . NaN ) ) ) assertEquals ( \"\" , Double . POSITIVE_INFINITY , sinh ( Double . POSITIVE_INFINITY ) , ) assertEquals ( \"\" , Double . NEGATIVE_INFINITY , sinh ( Double . NEGATIVE_INFINITY ) , ) assertEquals ( . toBits ( ) , sinh ( ) . toBits ( ) ) assertEquals ( + . toBits ( ) , sinh ( + ) . toBits ( ) ) assertEquals ( ( - ) . toBits ( ) , sinh ( - ) . toBits ( ) ) assertEquals ( \"\" , Double . POSITIVE_INFINITY , sinh ( ) , ) assertEquals ( \"\" , Double . NEGATIVE_INFINITY , sinh ( - ) , ) assertEquals ( \"\" , , sinh ( ) , ) assertEquals ( \"\" , - , sinh ( - ) , ) assertEquals ( \"\" , , sinh ( ) ) assertEquals ( \"\" , Double . POSITIVE_INFINITY , sinh ( Double . MAX_VALUE ) , ) assertEquals ( \"\" , , sinh ( Double . MIN_VALUE ) , ) }","docstring":"/**\n * Tests kotlin.math.sinh(Double)\n */"} {"signature":"@ Test fun sqrt_D ( )","body":"{ assertEquals ( \"\" , , sqrt ( ) , ) }","docstring":"/**\n * Tests kotlin.math.sqrt(Double)\n */"} {"signature":"@ Test fun tan_D ( )","body":"{ assertEquals ( \"\" , , tan ( ) , ) assertEquals ( \"\" , , tan ( ) ) }","docstring":"/**\n * Tests kotlin.math.tan(Double)\n */"} {"signature":"@ Test fun tanh_D ( )","body":"{ assertTrue ( \"\" , Double . isNaN ( tanh ( Double . NaN ) ) ) assertEquals ( \"\" , + , tanh ( Double . POSITIVE_INFINITY ) , ) assertEquals ( \"\" , - , tanh ( Double . NEGATIVE_INFINITY ) , ) assertEquals ( . toBits ( ) , tanh ( ) . toBits ( ) ) assertEquals ( + . toBits ( ) , tanh ( + ) . toBits ( ) ) assertEquals ( ( - ) . toBits ( ) , tanh ( - ) . toBits ( ) ) assertEquals ( \"\" , , tanh ( ) , ) assertEquals ( \"\" , - , tanh ( - ) , ) assertEquals ( \"\" , , tanh ( ) , ) assertEquals ( \"\" , , tanh ( ) , ) assertEquals ( \"\" , , tanh ( Double . MAX_VALUE ) , ) assertEquals ( \"\" , , tanh ( Double . MIN_VALUE ) , ) }","docstring":"/**\n * Tests kotlin.math.tanh(Double)\n */"} {"signature":"fun test_ulp_D ( )","body":"{ assertTrue ( \"\" , Double . isNaN ( ulp ( Double . NaN ) ) ) assertEquals ( \"\" , Double . POSITIVE_INFINITY , ulp ( Double . POSITIVE_INFINITY ) , ) assertEquals ( \"\" , Double . POSITIVE_INFINITY , ulp ( Double . NEGATIVE_INFINITY ) , ) assertEquals ( \"\" , Double . MIN_VALUE , ulp ( ) , ) assertEquals ( \"\" , Double . MIN_VALUE , ulp ( + ) , ) assertEquals ( \"\" , Double . MIN_VALUE , ulp ( - ) , ) assertEquals ( \"\" , pow ( , ) , ulp ( Double . MAX_VALUE ) , ) assertEquals ( \"\" , pow ( , ) , ulp ( - Double . MAX_VALUE ) , ) assertEquals ( \"\" , Double . MIN_VALUE , ulp ( Double . MIN_VALUE ) , ) assertEquals ( \"\" , Double . MIN_VALUE , ulp ( - Double . MIN_VALUE ) , ) assertEquals ( \"\" , , ulp ( ) , ) assertEquals ( \"\" , , ulp ( - ) , ) assertEquals ( \"\" , , ulp ( ) , ) }","docstring":"/**\n * Tests kotlin.Double.ulp\n */"} {"signature":"fun test_ulp_f ( )","body":"{ assertTrue ( \"\" , Float . isNaN ( ulp ( Float . NaN ) ) ) assertEquals ( \"\" , Float . POSITIVE_INFINITY , ulp ( Float . POSITIVE_INFINITY ) , ) assertEquals ( \"\" , Float . POSITIVE_INFINITY , ulp ( Float . NEGATIVE_INFINITY ) , ) assertEquals ( \"\" , Float . MIN_VALUE , ulp ( ) , ) assertEquals ( \"\" , Float . MIN_VALUE , ulp ( + ) , ) assertEquals ( \"\" , Float . MIN_VALUE , ulp ( - ) , ) assertEquals ( \"\" , , ulp ( Float . MAX_VALUE ) , ) assertEquals ( \"\" , , ulp ( - Float . MAX_VALUE ) , ) assertEquals ( \"\" , , ulp ( Float . MIN_VALUE ) , ) assertEquals ( \"\" , , ulp ( - Float . MIN_VALUE ) , ) assertEquals ( \"\" , , ulp ( ) , ) assertEquals ( \"\" , , ulp ( - ) , ) assertEquals ( \"\" , , ulp ( ) , ) assertEquals ( \"\" , , ulp ( ) , ) }","docstring":"/**\n * Tests kotlin.Float.ulp\n */"} {"signature":"public fun < I > Operation < I , BufferedImage > . rotate ( block : Rotate . ( ) -> Unit ) : Operation < I , BufferedImage >","body":"{ return PreprocessingPipeline ( this , Rotate ( ) . apply ( block ) ) }","docstring":"/** Applies [Rotate] operation to rotate the image by an arbitrary angle (specified in degrees). */"} {"signature":"public fun < I > Operation < I , BufferedImage > . crop ( block : Cropping . ( ) -> Unit ) : Operation < I , BufferedImage >","body":"{ return PreprocessingPipeline ( this , Cropping ( ) . apply ( block ) ) }","docstring":"/** Applies [Cropping] operation to crop the image by the specified amount. */"} {"signature":"public fun < I > Operation < I , BufferedImage > . resize ( block : Resize . ( ) -> Unit ) : Operation < I , BufferedImage >","body":"{ return PreprocessingPipeline ( this , Resize ( ) . apply ( block ) ) }","docstring":"/** Applies [Resize] operation to resize the image to a specific size. */"} {"signature":"public fun < I > Operation < I , BufferedImage > . pad ( block : Padding . ( ) -> Unit ) : Operation < I , BufferedImage >","body":"{ return PreprocessingPipeline ( this , Padding ( ) . apply ( block ) ) }","docstring":"/** Applies [Padding] operation to pad the image. */"} {"signature":"public fun < I > Operation < I , BufferedImage > . convert ( block : Convert . ( ) -> Unit ) : Operation < I , BufferedImage >","body":"{ return PreprocessingPipeline ( this , Convert ( ) . apply ( block ) ) }","docstring":"/** Applies [Convert] operation to convert the image to a different [ColorMode]. */"} {"signature":"public fun < I > Operation < I , BufferedImage > . grayscale ( ) : Operation < I , BufferedImage >","body":"{ return PreprocessingPipeline ( this , Convert ( colorMode = ColorMode . GRAYSCALE ) ) }","docstring":"/** Applies [Convert] operation to convert the image to [ColorMode.GRAYSCALE]. */"} {"signature":"public fun < I > Operation < I , BufferedImage > . centerCrop ( block : CenterCrop . ( ) -> Unit ) : Operation < I , BufferedImage >","body":"{ return PreprocessingPipeline ( this , CenterCrop ( ) . apply ( block ) ) }","docstring":"/** Applies [CenterCrop] operation to crop the image at the center. */"} {"signature":"public fun < I > Operation < I , BufferedImage > . toFloatArray ( block : ConvertToFloatArray . ( ) -> Unit ) : Operation < I , FloatData >","body":"{ return PreprocessingPipeline ( this , ConvertToFloatArray ( ) . apply ( block ) ) }","docstring":"/** Applies [ConvertToFloatArray] operation to convert the image to a float array. */"} {"signature":"public fun superType ( type : ConeKotlinType )","body":"{ superTypeProviders += { type } }","docstring":"/**\n * Adds [type] as supertype for constructed class\n *\n * If no supertypes are declared [kotlin.Any] supertype will be\n * added automatically\n */"} {"signature":"public fun superType ( typeProvider : ( List < FirTypeParameterRef > ) -> ConeKotlinType )","body":"{ superTypeProviders += typeProvider }","docstring":"/**\n * Adds type created by [typeProvider] as supertype for constructed class\n * Use this overload when supertype uses type parameters of constructed class\n *\n * If no supertypes are declared [kotlin.Any] supertype will be\n * added automatically\n */"} {"signature":"@ ExperimentalTopLevelDeclarationsGenerationApi public fun FirExtension . createTopLevelClass ( classId : ClassId , key : GeneratedDeclarationKey , classKind : ClassKind = ClassKind . CLASS , config : ClassBuildingContext . ( ) -> Unit = { } ) : FirRegularClass","body":"{ return ClassBuildingContext ( session , key , owner = null , classId , classKind ) . apply ( config ) . build ( ) }","docstring":"/**\n * Creates top-level class with given [classId]\n * All declarations in class should be generated using methods from [FirDeclarationGenerationExtension]\n * Generation of top-level classes with [FirDeclarationsForMetadataProviderExtension] is prohibited\n *\n * If no supertypes added then [kotlin.Any] supertype will be added automatically\n *\n * Created class won't have a constructor; constructor can be added separately with [createConstructor] function\n */"} {"signature":"public fun FirExtension . createNestedClass ( owner : FirClassSymbol < * > , name : Name , key : GeneratedDeclarationKey , classKind : ClassKind = ClassKind . CLASS , config : ClassBuildingContext . ( ) -> Unit = { } ) : FirRegularClass","body":"{ return ClassBuildingContext ( session , key , owner , owner . classId . createNestedClassId ( name ) , classKind ) . apply ( config ) . apply { status { isExpect = owner . isExpect } } . build ( ) }","docstring":"/**\n * Creates nested class for [owner] class with name [name]\n * If class is generated in [FirDeclarationGenerationExtension], all its declarations should be generated\n * using methods from [FirDeclarationGenerationExtension]\n * If class is generated in [FirDeclarationsForMetadataProviderExtension] all its declarations should be manually added right to\n * FIR node of created class\n *\n * If no supertypes added then [kotlin.Any] supertype will be added automatically\n *\n * Created class won't have a constructor; constructor can be added separately with [createConstructor] function\n *\n * By default, the class is only nested; to create an inner class, create nested class and add inner status via status()\n */"} {"signature":"public fun FirExtension . createCompanionObject ( owner : FirClassSymbol < * > , key : GeneratedDeclarationKey , config : ClassBuildingContext . ( ) -> Unit = { } ) : FirRegularClass","body":"{ val classId = owner . classId . createNestedClassId ( SpecialNames . DEFAULT_NAME_FOR_COMPANION_OBJECT ) return ClassBuildingContext ( session , key , owner , classId , ClassKind . OBJECT ) . apply ( config ) . apply { modality = Modality . FINAL status { isCompanion = true isExpect = owner . isExpect } } . build ( ) }","docstring":"/**\n * Creates companion object for [owner] class\n * If class is generated in [FirDeclarationGenerationExtension], all its declarations should be generated\n * using methods from [FirDeclarationGenerationExtension]\n * If class is generated in [FirDeclarationsForMetadataProviderExtension] all its declarations should be manually added right to\n * FIR node of created class\n *\n * If no supertypes added then [kotlin.Any] supertype will be added automatically\n *\n * Created class won't have a constructor; constructor can be added separately with [createDefaultPrivateConstructor] function\n */"} {"signature":"override fun buildTransformedAtomicExtensionSignature ( atomicExtension : IrFunction , isArrayReceiver : Boolean ) : IrSimpleFunction","body":"{ val mangledName = mangleAtomicExtensionName ( atomicExtension . name . asString ( ) , isArrayReceiver ) val atomicReceiverType = atomicExtension . extensionReceiverParameter ! ! . type val valueType = ( atomicReceiverType as IrSimpleType ) . atomicToPrimitiveType ( ) return pluginContext . irFactory . buildFun { name = Name . identifier ( mangledName ) isInline = true visibility = atomicExtension . visibility origin = AbstractAtomicSymbols . ATOMICFU_GENERATED_FUNCTION } . apply { extensionReceiverParameter = null dispatchReceiverParameter = atomicExtension . dispatchReceiverParameter ? . deepCopyWithSymbols ( this ) atomicExtension . typeParameters . forEach { addTypeParameter ( it . name . asString ( ) , it . representativeUpperBound ) } addSyntheticValueParametersToTransformedAtomicExtension ( isArrayReceiver , if ( valueType == irBuiltIns . anyNType ) atomicReceiverType . arguments . first ( ) . typeOrNull ! ! else valueType ) atomicExtension . valueParameters . forEach { addValueParameter ( it . name , it . type ) } returnType = atomicExtension . returnType this . parent = atomicExtension . parent } }","docstring":"/**\n * Builds the signature of the transformed atomic extension:\n *\n * inline fun AtomicInt.foo(arg: Int) --> inline fun foo$atomicfu(refGetter: () -> KMutableProperty0, arg': Int)\n * inline fun foo$atomicfu$array(atomicArray: AtomicIntegerArray, index: Int, arg': Int)\n */"} {"signature":"override fun IrFunction . addSyntheticValueParametersToTransformedAtomicExtension ( isArrayReceiver : Boolean , valueType : IrType )","body":"{ if ( ! isArrayReceiver ) { addValueParameter ( REF_GETTER , atomicSymbols . kMutableProperty0GetterType ( valueType ) ) . apply { isCrossinline = true } } else { addValueParameter ( ATOMIC_ARRAY , atomicSymbols . getParameterizedAtomicArrayType ( valueType ) ) addValueParameter ( INDEX , irBuiltIns . intType ) } }","docstring":"/**\n * Adds synthetic value parameters to the transformed atomic extension (custom atomic extension or atomicfu inline update functions).\n */"} {"signature":"infix fun < K , V > Map < K , Set < V > > . mergeWith ( that : Map < K , Set < V > > ) : Map < K , Set < V > >","body":"{ val result = mutableMapOf < K , Set < V > > ( ) for ( ( k , setOfV ) in this ) { result [ k ] = setOfV + that [ k ] . orEmpty ( ) } val uniqueEntriesFromRight = that - this . keys result . putAll ( uniqueEntriesFromRight ) return result }","docstring":"/**\n * Merges two Map of Sets to new map\n * Example:\n * { 1: ['a', 'b'], 2: ['c'] }\n * merge\n * { 0: ['x'], 1: ['c'], 42: ['y'] }\n * =\n * { 0: ['x'], 1: ['a', 'b', 'c'], 2: ['c'], 42: ['y'] }\n */"} {"signature":"public expect fun ComplexDouble ( re : Double , im : Double ) : ComplexDouble","body":"public expect fun ComplexDouble ( re : Double , im : Double ) : ComplexDouble","docstring":"/**\n * Creates a [ComplexDouble] with the given real and imaginary values in floating-point format.\n *\n * @param re the real value of the complex number in double format.\n * @param im the imaginary value of the complex number in double format.\n */"} {"signature":"public expect fun ComplexDouble ( re : Number , im : Number ) : ComplexDouble","body":"public expect fun ComplexDouble ( re : Number , im : Number ) : ComplexDouble","docstring":"/**\n * Creates a [ComplexDouble] with the given real and imaginary values in number format.\n *\n * @param re the real value of the complex number in number format.\n * @param im the imaginary value of the complex number in number format.\n */"} {"signature":"public fun ComplexDouble ( re : Number ) : ComplexDouble","body":"= ComplexDouble ( re . toDouble ( ) , )","docstring":"/**\n * Creates a [ComplexDouble] with a zero imaginary value.\n * @param re the real value of the complex number in number format.\n */"} {"signature":"public fun conjugate ( ) : ComplexDouble","body":"= ComplexDouble ( re , - im )","docstring":"/**\n * Returns the complex conjugate value of the current complex number.\n *\n * @return a new ComplexFloat object representing the complex conjugate of the current complex number.\n * It has the same real part as the current number, but an opposite sign of its imaginary part.\n */"} {"signature":"public fun abs ( ) : Double","body":"= sqrt ( re * re + im * im )","docstring":"/**\n * Returns the absolute value of the complex number.\n *\n * @return the absolute value of the complex number.\n */"} {"signature":"public fun angle ( ) : Double","body":"= atan2 ( im , re )","docstring":"/**\n * Returns the angle of the complex number.\n *\n * @return the angle of the complex number as a Double.\n */"} {"signature":"public operator fun plus ( other : Byte ) : ComplexDouble","body":"= ComplexDouble ( re + other , im )","docstring":"/**\n * Adds the other byte value to this value.\n *\n * @param other the [Byte] value to add to this one.\n * @return a new [ComplexDouble] with the result of the addition.\n */"} {"signature":"public operator fun plus ( other : Short ) : ComplexDouble","body":"= ComplexDouble ( re + other , im )","docstring":"/**\n * Adds the other short value to this value.\n *\n * @param other the [Short] value to add to this one.\n * @return a new [ComplexDouble] with the result of the addition.\n */"} {"signature":"public operator fun plus ( other : Int ) : ComplexDouble","body":"= ComplexDouble ( re + other , im )","docstring":"/**\n * Adds the other integer value to this value.\n *\n * @param other the [Int] value to add to this one.\n * @return a new [ComplexDouble] with the result of the addition.\n */"} {"signature":"public operator fun plus ( other : Long ) : ComplexDouble","body":"= ComplexDouble ( re + other , im )","docstring":"/**\n * Adds the other long value to this value.\n *\n * @param other the [Long] value to add to this one.\n * @return a new [ComplexDouble] with the result of the addition.\n */"} {"signature":"public operator fun plus ( other : Float ) : ComplexDouble","body":"= ComplexDouble ( re + other , im )","docstring":"/**\n * Adds the other float value to this value.\n *\n * @param other the [Float] value to add to this one.\n * @return a new [ComplexDouble] with the result of the addition.\n */"} {"signature":"public operator fun plus ( other : Double ) : ComplexDouble","body":"= ComplexDouble ( re + other , im )","docstring":"/**\n * Adds the other double value to this value.\n *\n * @param other the [Double] value to add to this one.\n * @return a new [ComplexDouble] with the result of the addition.\n */"} {"signature":"public operator fun plus ( other : ComplexFloat ) : ComplexDouble","body":"= ComplexDouble ( re + other . re , im + other . im )","docstring":"/**\n * Adds the other ComplexFloat value to this value.\n *\n * @param other the [ComplexFloat] value to add to this one.\n * @return a new [ComplexDouble] with the result of the addition.\n */"} {"signature":"public operator fun plus ( other : ComplexDouble ) : ComplexDouble","body":"= ComplexDouble ( re + other . re , im + other . im )","docstring":"/**\n * Adds the other ComplexDouble value to this value.\n *\n * @param other the [ComplexDouble] value to add to this one.\n * @return a new [ComplexDouble] with the result of the addition.\n */"} {"signature":"public operator fun minus ( other : Byte ) : ComplexDouble","body":"= ComplexDouble ( re - other , im )","docstring":"/**\n * Subtracts the other byte value from this value.\n *\n * @param other the [Byte] value to be subtracted from this value.\n * @return a new [ComplexDouble] representing the result of the subtraction operation.\n */"} {"signature":"public operator fun minus ( other : Short ) : ComplexDouble","body":"= ComplexDouble ( re - other , im )","docstring":"/**\n * Subtracts the other short value from this value.\n *\n * @param other the [Short] value to be subtracted from this value.\n * @return a new [ComplexDouble] representing the result of the subtraction operation.\n */"} {"signature":"public operator fun minus ( other : Int ) : ComplexDouble","body":"= ComplexDouble ( re - other , im )","docstring":"/**\n * Subtracts the other integer value from this value.\n *\n * @param other the [Int] value to be subtracted from this value.\n * @return a new [ComplexDouble] representing the result of the subtraction operation.\n */"} {"signature":"public operator fun minus ( other : Long ) : ComplexDouble","body":"= ComplexDouble ( re - other , im )","docstring":"/**\n * Subtracts the other long value from this value.\n *\n * @param other the [Long] value to be subtracted from this value.\n * @return a new [ComplexDouble] representing the result of the subtraction operation.\n */"} {"signature":"public operator fun minus ( other : Float ) : ComplexDouble","body":"= ComplexDouble ( re - other , im )","docstring":"/**\n * Subtracts the other float value from this value.\n *\n * @param other the [Float] value to be subtracted from this value.\n * @return a new [ComplexDouble] representing the result of the subtraction operation.\n */"} {"signature":"public operator fun minus ( other : Double ) : ComplexDouble","body":"= ComplexDouble ( re - other , im )","docstring":"/**\n * Subtracts the other double value from this value.\n *\n * @param other the [Double] value to be subtracted from this value.\n * @return a new [ComplexDouble] representing the result of the subtraction operation.\n */"} {"signature":"public operator fun minus ( other : ComplexFloat ) : ComplexDouble","body":"= ComplexDouble ( re - other . re , im - other . im )","docstring":"/**\n * Subtracts the other ComplexFloat value from this value.\n *\n * @param other the [ComplexFloat] value to be subtracted from this value.\n * @return a new [ComplexDouble] representing the result of the subtraction operation.\n */"} {"signature":"public operator fun minus ( other : ComplexDouble ) : ComplexDouble","body":"= ComplexDouble ( re - other . re , im - other . im )","docstring":"/**\n * Subtracts the other ComplexDouble value from this value.\n *\n * @param other the [ComplexDouble] value to be subtracted from this value.\n * @return a new [ComplexDouble] representing the result of the subtraction operation.\n */"} {"signature":"public operator fun times ( other : Byte ) : ComplexDouble","body":"= ComplexDouble ( re * other , im * other )","docstring":"/**\n * Multiplies this complex number by the given byte value.\n *\n * @param other the [Byte] value to multiply this complex number by\n * @return a new [ComplexDouble] representing the result of the multiplication\n */"} {"signature":"public operator fun times ( other : Short ) : ComplexDouble","body":"= ComplexDouble ( re * other , im * other )","docstring":"/**\n * Multiplies this complex number by the given short value.\n *\n * @param other the [Short] value to multiply this complex number by\n * @return a new [ComplexDouble] representing the result of the multiplication\n */"} {"signature":"public operator fun times ( other : Int ) : ComplexDouble","body":"= ComplexDouble ( re * other , im * other )","docstring":"/**\n * Multiplies this complex number by the given integer value.\n *\n * @param other the [Int] value to multiply this complex number by\n * @return a new [ComplexDouble] representing the result of the multiplication\n */"} {"signature":"public operator fun times ( other : Long ) : ComplexDouble","body":"= ComplexDouble ( re * other , im * other )","docstring":"/**\n * Multiplies this complex number by the given long value.\n *\n * @param other the [Long] value to multiply this complex number by\n * @return a new [ComplexDouble] representing the result of the multiplication\n */"} {"signature":"public operator fun times ( other : Float ) : ComplexDouble","body":"= ComplexDouble ( re * other , im * other )","docstring":"/**\n * Multiplies this complex number by the given float value.\n *\n * @param other the [Float] value to multiply this complex number by\n * @return a new [ComplexDouble] representing the result of the multiplication\n */"} {"signature":"public operator fun times ( other : Double ) : ComplexDouble","body":"= ComplexDouble ( re * other , im * other )","docstring":"/**\n * Multiplies this complex number by the given double value.\n *\n * @param other the [Double] value to multiply this complex number by\n * @return a new [ComplexDouble] representing the result of the multiplication\n */"} {"signature":"public operator fun times ( other : ComplexFloat ) : ComplexDouble","body":"= ComplexDouble ( re * other . re - im * other . im , re * other . im + other . re * im )","docstring":"/**\n * Multiplies this complex number by the given ComplexFloat value.\n *\n * @param other the [ComplexFloat] value to multiply this complex number by\n * @return a new [ComplexDouble] representing the result of the multiplication\n */"} {"signature":"public operator fun times ( other : ComplexDouble ) : ComplexDouble","body":"= ComplexDouble ( re * other . re - im * other . im , re * other . im + other . re * im )","docstring":"/**\n * Multiplies this complex number by the given ComplexDouble value.\n *\n * @param other the [ComplexDouble] value to multiply this complex number by\n * @return a new [ComplexDouble] representing the result of the multiplication\n */"} {"signature":"public operator fun div ( other : Byte ) : ComplexDouble","body":"= ComplexDouble ( re / other , im / other )","docstring":"/**\n * Divides this value by the given byte value.\n *\n * @param other the [Byte] value to divide this ComplexFloat by.\n * @return a new [ComplexDouble] value after division.\n */"} {"signature":"public operator fun div ( other : Short ) : ComplexDouble","body":"= ComplexDouble ( re / other , im / other )","docstring":"/**\n * Divides this value by the given short value.\n *\n * @param other the [Short] value to divide this ComplexFloat by.\n * @return a new [ComplexDouble] value after division.\n */"} {"signature":"public operator fun div ( other : Int ) : ComplexDouble","body":"= ComplexDouble ( re / other , im / other )","docstring":"/**\n * Divides this value by the given integer value.\n *\n * @param other the [Int] value to divide this ComplexFloat by.\n * @return a new [ComplexDouble] value after division.\n */"} {"signature":"public operator fun div ( other : Long ) : ComplexDouble","body":"= ComplexDouble ( re / other , im / other )","docstring":"/**\n * Divides this value by the given long value.\n *\n * @param other the [Long] value to divide this ComplexFloat by.\n * @return a new [ComplexDouble] value after division.\n */"} {"signature":"public operator fun div ( other : Float ) : ComplexDouble","body":"= ComplexDouble ( re / other , im / other )","docstring":"/**\n * Divides this value by the given float value.\n *\n * @param other the [Float] value to divide this ComplexFloat by.\n * @return a new [ComplexDouble] value after division.\n */"} {"signature":"public operator fun div ( other : Double ) : ComplexDouble","body":"= ComplexDouble ( re / other , im / other )","docstring":"/**\n * Divides this value by the given double value.\n *\n * @param other the [Double] value to divide this ComplexFloat by.\n * @return a new [ComplexDouble] value after division.\n */"} {"signature":"public operator fun div ( other : ComplexFloat ) : ComplexDouble","body":"= when { kotlin . math . abs ( other . re ) > kotlin . math . abs ( other . im ) -> { val dr = other . im / other . re val dd = other . re + dr * other . im if ( dd . isNaN ( ) || dd == ) throw ArithmeticException ( \"\" ) ComplexDouble ( ( re + im * dr ) / dd , ( im - re * dr ) / dd ) } other . im == -> throw ArithmeticException ( \"\" ) else -> { val dr = other . re / other . im val dd = other . im + dr * other . re if ( dd . isNaN ( ) || dd == ) throw ArithmeticException ( \"\" ) ComplexDouble ( ( re * dr + im ) / dd , ( im * dr - re ) / dd ) } }","docstring":"/**\n * Divides this value by the given ComplexFloat value.\n *\n * @param other the [ComplexFloat] value to divide this ComplexFloat by.\n * @return a new [ComplexDouble] value after division.\n */"} {"signature":"public operator fun div ( other : ComplexDouble ) : ComplexDouble","body":"= when { kotlin . math . abs ( other . re ) > kotlin . math . abs ( other . im ) -> { val dr = other . im / other . re val dd = other . re + dr * other . im if ( dd . isNaN ( ) || dd == ) throw ArithmeticException ( \"\" ) ComplexDouble ( ( re + im * dr ) / dd , ( im - re * dr ) / dd ) } other . im == -> throw ArithmeticException ( \"\" ) else -> { val dr = other . re / other . im val dd = other . im + dr * other . re if ( dd . isNaN ( ) || dd == ) throw ArithmeticException ( \"\" ) ComplexDouble ( ( re * dr + im ) / dd , ( im * dr - re ) / dd ) } }","docstring":"/**\n * Divides this value by the given ComplexDouble value.\n *\n * @param other the [ComplexDouble] value to divide this ComplexFloat by.\n * @return a new [ComplexDouble] value after division.\n */"} {"signature":"public operator fun unaryPlus ( ) : ComplexDouble","body":"= this","docstring":"/** Returns this value. */"} {"signature":"public operator fun unaryMinus ( ) : ComplexDouble","body":"= ComplexDouble ( - re , - im )","docstring":"/** Returns the negative of this value. */"} {"signature":"public operator fun component1 ( ) : Double","body":"= re","docstring":"/**\n * Returns the real component of a complex number.\n *\n * @return the real part of the complex number as a Double value.\n */"} {"signature":"public operator fun component2 ( ) : Double","body":"= im","docstring":"/**\n * Returns the imaginary component of a complex number.\n *\n * @return the imaginary part of the complex number as a Double value.\n */"} {"signature":"fun < R , D > accept ( visitor : FirVisitor < R , D > , data : D ) : R","body":"= visitor . visitElement ( this , data )","docstring":"/**\n * Runs the provided [visitor] on the FIR 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":"@ Suppress ( \"\" ) fun < E : FirElement , D > transform ( transformer : FirTransformer < D > , data : D ) : E","body":"= transformer . transformElement ( this , data ) as E","docstring":"/**\n * Runs the provided [transformer] on the FIR 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 accept ( visitor : FirVisitorVoid )","body":"= accept ( visitor , null )","docstring":"/**\n * Runs the provided [visitor] on the FIR subtree with the root at this node.\n *\n * @param visitor The visitor to accept.\n */"} {"signature":"fun < R , D > acceptChildren ( visitor : FirVisitor < R , D > , data : D )","body":"fun < R , D > acceptChildren ( visitor : FirVisitor < R , 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 acceptChildren ( visitor : FirVisitorVoid )","body":"= acceptChildren ( visitor , null )","docstring":"/**\n * Runs the provided [visitor] on subtrees with roots in this node's children.\n *\n * Basically, calls `accept(visitor)` 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 */"} {"signature":"fun < D > transformChildren ( transformer : FirTransformer < D > , data : D ) : FirElement","body":"fun < D > transformChildren ( transformer : FirTransformer < D > , data : D ) : FirElement","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 * @return `this`\n */"} {"signature":"fun process ( file : FirFile , holder : SessionHolder , targetElement : PsiElement , bodyElement : PsiElement ? = targetElement ) : Context ?","body":"{ val isBodyContextCollected = bodyElement != null val acceptedElements = targetElement . parentsWithSelf . toSet ( ) val contextProvider = process ( file , holder , computeDesignation ( file , targetElement ) , isBodyContextCollected ) { candidate -> when ( candidate ) { targetElement -> FilterResponse . STOP in acceptedElements -> FilterResponse . CONTINUE else -> FilterResponse . SKIP } } for ( acceptedElement in acceptedElements ) { if ( acceptedElement === bodyElement ) { val bodyContext = contextProvider [ acceptedElement , ContextKind . BODY ] if ( bodyContext != null ) { return bodyContext } } val elementContext = contextProvider [ acceptedElement , ContextKind . SELF ] if ( elementContext != null ) { return elementContext } } return null }","docstring":"/**\n * Get the most precise context available for the [targetElement] in the [file].\n *\n * @param file The file to process.\n * @param holder The [SessionHolder] for the session that owns a [file].\n * @param targetElement The most precise element for which the context is required.\n * @param bodyElement An element for which the [ContextKind.BODY] context is preferred.\n *\n * Returns the context of the [targetElement] if available, or of one of its tree parents.\n * Returns `null` if the context was not collected.\n */"} {"signature":"fun process ( file : FirFile , holder : SessionHolder , designation : FirDesignation ? , shouldCollectBodyContext : Boolean , filter : ( PsiElement ) -> FilterResponse , ) : ContextProvider","body":"{ val interceptor = designation ? . let ( :: DesignationInterceptor ) val visitor = ContextCollectorVisitor ( holder , shouldCollectBodyContext , filter , interceptor ) visitor . collect ( file ) return ContextProvider { element , kind -> visitor [ element , kind ] } }","docstring":"/**\n * Processes the [FirFile], collecting contexts for elements matching the [filter].\n *\n * @param file The file to process.\n * @param holder The [SessionHolder] for the session that owns a [file].\n * @param designation The declaration to process. If `null`, all declarations in the [file] are processed.\n * @param shouldCollectBodyContext If `true`, [ContextKind.BODY] is collected where available.\n * @param filter The filter predicate. Context is collected only for [PsiElement]s for which the [filter] returns `true`.\n */"} {"signature":"@ OptIn ( PrivateForInline :: class ) private fun Processor . processClassHeader ( regularClass : FirRegularClass )","body":"{ context . withTypeParametersOf ( regularClass ) { processList ( regularClass . contextReceivers ) processList ( regularClass . typeParameters ) processList ( regularClass . superTypeRefs ) } }","docstring":"/**\n * Process the parts of the class declaration which resolution is not affected\n * by the class own supertypes.\n *\n * Processing those parts before adding the implicit receiver of the class\n * to the [context] allows to not collect incorrect contexts for them later on.\n */"} {"signature":"private fun Processor . processAnonymousObjectHeader ( anonymousObject : FirAnonymousObject )","body":"{ processList ( anonymousObject . superTypeRefs ) }","docstring":"/**\n * Same as [processClassHeader], but for anonymous objects.\n *\n * N.B. Anonymous classes cannot have its own explicit type parameters, so we do not process them.\n */"} {"signature":"override fun visitField ( field : FirField )","body":"= withProcessor ( field ) { dumpContext ( field , ContextKind . SELF ) processSignatureAnnotations ( field ) onActiveBody { field . lazyResolveToPhase ( FirResolvePhase . BODY_RESOLVE ) context . withField ( field ) { dumpContext ( field , ContextKind . BODY ) onActive { process ( field . initializer ) } } } }","docstring":"/**\n * We visit fields to properly handle supertypes delegation:\n *\n * ```kt\n * class Foo : Bar by baz\n * ```\n *\n * In the code above, `baz` expression is saved into a separate synthetic field.\n * It's not accessible from the delegated constructor, it's just added to the\n * `Foo` class body.\n */"} {"signature":"private fun withInterceptor ( block : ( ) -> Unit )","body":"{ val target = designationPathInterceptor ? . invoke ( ) if ( target != null ) { target . accept ( this ) } else { block ( ) } }","docstring":"/**\n * Ensures that the visitor is going through the path specified by the initial [FirDesignation].\n *\n * If the designation is over, then allows the [block] code to take control.\n */"} {"signature":"@ Test fun longDecimalString ( )","body":"{ assertLongDecimalString ( \"\" , ) assertLongDecimalString ( \"\" , Long . MIN_VALUE ) assertLongDecimalString ( \"\" , Long . MAX_VALUE ) assertLongDecimalString ( \"\" , ) assertLongDecimalString ( \"\" , ) assertLongDecimalString ( \"\" , ) assertLongDecimalString ( \"\" , ) assertLongDecimalString ( \"\" , ) assertLongDecimalString ( \"\" , ) assertLongDecimalString ( \"\" , ) assertLongDecimalString ( \"\" , ) assertLongDecimalString ( \"\" , ) assertLongDecimalString ( \"\" , ) assertLongDecimalString ( \"\" , ) assertLongDecimalString ( \"\" , ) assertLongDecimalString ( \"\" , ) assertLongDecimalString ( \"\" , ) assertLongDecimalString ( \"\" , ) assertLongDecimalString ( \"\" , ) assertLongDecimalString ( \"\" , ) assertLongDecimalString ( \"\" , ) assertLongDecimalString ( \"\" , ) assertLongDecimalString ( \"\" , ) assertLongDecimalString ( \"\" , ) assertLongDecimalString ( \"\" , ) assertLongDecimalString ( \"\" , ) assertLongDecimalString ( \"\" , ) assertLongDecimalString ( \"\" , ) assertLongDecimalString ( \"\" , ) assertLongDecimalString ( \"\" , ) assertLongDecimalString ( \"\" , ) assertLongDecimalString ( \"\" , ) assertLongDecimalString ( \"\" , ) assertLongDecimalString ( \"\" , ) assertLongDecimalString ( \"\" , ) assertLongDecimalString ( \"\" , ) assertLongDecimalString ( \"\" , ) assertLongDecimalString ( \"\" , ) assertLongDecimalString ( \"\" , ) }","docstring":"/**\n * This test hard codes the results of Long.toString() because that function rounds large values\n * when using Kotlin/JS IR. https://youtrack.jetbrains.com/issue/KT-39891\n */"} {"signature":"private fun copyXToBatch ( src : Array < FloatArray > , start : Int , length : Int ) : Array < FloatArray >","body":"{ val dataForBatch = Array ( length ) { src [ it + start ] . copyOf ( ) } return dataForBatch }","docstring":"/** Converts [src] to [FloatBuffer] from [start] position for the next [length] positions. */"} {"signature":"private fun copyLabelsToBatch ( src : FloatArray , start : Int , length : Int ) : FloatArray","body":"{ val dataForBatch = FloatArray ( length ) { } for ( i in start until start + length ) { dataForBatch [ i - start ] = src [ i ] } return dataForBatch }","docstring":"/** Converts [src] to [FloatBuffer] from [start] position for the next [length] positions. */"} {"signature":"override fun split ( splitRatio : Double ) : Pair < OnHeapDataset , OnHeapDataset >","body":"{ require ( splitRatio in .. ) { \"\" } val trainDatasetLastIndex = truncate ( x . size * splitRatio ) . toInt ( ) return Pair ( OnHeapDataset ( x . copyOfRange ( , trainDatasetLastIndex ) , y . copyOfRange ( , trainDatasetLastIndex ) , elementShape ) , OnHeapDataset ( x . copyOfRange ( trainDatasetLastIndex , x . size ) , y . copyOfRange ( trainDatasetLastIndex , y . size ) , elementShape ) ) }","docstring":"/** Splits datasets on two sub-datasets according [splitRatio].*/"} {"signature":"override fun xSize ( ) : Int","body":"{ return x . size }","docstring":"/** Returns number of data rows. */"} {"signature":"override fun getX ( idx : Int ) : FloatData","body":"{ return x [ idx ] to elementShape }","docstring":"/** Returns row by index [idx]. */"} {"signature":"override fun getY ( idx : Int ) : Float","body":"{ return y [ idx ] }","docstring":"/** Returns label as [FloatArray] by index [idx]. */"} {"signature":"@ JvmStatic public fun toOneHotVector ( numClasses : Int , label : Byte ) : FloatArray","body":"{ val ret = FloatArray ( numClasses ) ret [ label . toInt ( ) and SHIFT_NUMBER ] = return ret }","docstring":"/** Creates binary vector with size [numClasses] from [label]. */"} {"signature":"@ JvmStatic public fun convertByteToFloat ( label : Byte ) : Float","body":"{ return ( label . toInt ( ) and SHIFT_NUMBER ) . toFloat ( ) }","docstring":"/** Creates float [label]. */"} {"signature":"@ JvmStatic public fun create ( features : Array < FloatArray > , labels : FloatArray , shape : TensorShape = TensorShape ( features . first ( ) . size . toLong ( ) ) ) : OnHeapDataset","body":"{ return OnHeapDataset ( features , labels , shape ) }","docstring":"/**\n * Creates an [OnHeapDataset] from [features] and [labels].\n */"} {"signature":"@ JvmStatic @ Throws ( IOException :: class ) public fun create ( pathToData : File , labels : FloatArray , preprocessing : Operation < BufferedImage , FloatData > ) : OnHeapDataset","body":"{ val xFiles = prepareFileNames ( pathToData ) val ( x , shape ) = preprocessing . fileLoader ( ) . prepareX ( xFiles ) return OnHeapDataset ( x , labels , shape ) }","docstring":"/**\n * Creates an [OnHeapDataset] from [pathToData] and [labels] using [preprocessing] to prepare images.\n */"} {"signature":"@ JvmStatic @ Throws ( IOException :: class ) public fun create ( pathToData : File , labelGenerator : LabelGenerator < File > , preprocessing : Operation < BufferedImage , FloatData > = ConvertToFloatArray ( ) ) : OnHeapDataset","body":"{ val xFiles = prepareFileNames ( pathToData ) val ( x , shape ) = preprocessing . fileLoader ( ) . prepareX ( xFiles ) val y = labelGenerator . prepareY ( xFiles ) return OnHeapDataset ( x , y , shape ) }","docstring":"/**\n * Creates an [OnHeapDataset] from [pathToData] and [labelGenerator] with [preprocessing] to prepare images.\n */"} {"signature":"internal fun addBuildEventsListenerRegistryMock ( project : Project )","body":"{ try { val projectScopeServices = ( project as DefaultProject ) . services as ProjectScopeServices val state : Field = ProjectScopeServices :: class . java . superclass . getDeclaredField ( \"\" ) state . isAccessible = true @ Suppress ( \"\" ) val stateValue : AtomicReference < Any > = state . get ( projectScopeServices ) as AtomicReference < Any > val enumClass = Class . forName ( DefaultServiceRegistry :: class . java . name + \"\" ) stateValue . set ( enumClass . enumConstants [ ] ) projectScopeServices . add ( BuildEventsListenerRegistry :: class . java , BuildEventsListenerRegistryMock ) stateValue . set ( enumClass . enumConstants [ ] ) } catch ( e : Throwable ) { throw RuntimeException ( e ) } }","docstring":"/**\n * In Gradle 6.7-rc-1 BuildEventsListenerRegistry service is not created in we need it in order\n * to instantiate AGP. This creates a fake one and injects it - http://b/168630734.\n */"} {"signature":"internal fun loadMainDispatcherFactory ( ) : List < MainDispatcherFactory >","body":"{ val clz = MainDispatcherFactory :: class . java if ( ! ANDROID_DETECTED ) { return load ( clz , clz . classLoader ) } return try { val result = ArrayList < MainDispatcherFactory > ( ) createInstanceOf ( clz , \"\" ) ? . apply { result . add ( this ) } createInstanceOf ( clz , \"\" ) ? . apply { result . add ( this ) } result } catch ( e : Throwable ) { load ( clz , clz . classLoader ) } }","docstring":"/**\n * This method attempts to load [MainDispatcherFactory] in Android-friendly way.\n *\n * If we are not on Android, this method fallbacks to a regular service loading,\n * else we attempt to do `Class.forName` lookup for\n * `AndroidDispatcherFactory` and `TestMainDispatcherFactory`.\n * If lookups are successful, we return resultinAg instances because we know that\n * `MainDispatcherFactory` API is internal and this is the only possible classes of `MainDispatcherFactory` Service on Android.\n *\n * Such intricate dance is required to avoid calls to `ServiceLoader.load` for multiple reasons:\n * 1) It eliminates disk lookup on potentially slow devices on the Main thread.\n * 2) Various Android toolchain versions by various vendors don't tend to handle ServiceLoader calls properly.\n * Sometimes META-INF is removed from the resulting APK, sometimes class names are mangled, etc.\n * While it is not the problem of `kotlinx.coroutines`, it significantly worsens user experience, thus we are workarounding it.\n * Examples of such issues are #932, #1072, #1557, #1567\n *\n * We also use SL for [CoroutineExceptionHandler], but we do not experience the same problems and CEH is a public API\n * that may already be injected vis SL, so we are not using the same technique for it.\n */"} {"signature":"protected fun doTestByKtFile ( ktFile : KtFile , testServices : TestServices )","body":"{ analyseForTest ( ktFile ) { val actualText = with ( SymbolByFqName . getSymbolDataFromFile ( testDataPath ) ) { val classSymbol = toSymbols ( ktFile ) . singleOrNull ( ) as? KtNamedClassOrObjectSymbol ? : error ( \"\" ) classSymbol . getSealedClassInheritors ( ) . joinToString ( \"\" ) { inheritor -> val declarationRenderer = KtDeclarationRendererForSource . WITH_QUALIFIED_NAMES . with { typeRenderer = KtTypeRendererForSource . WITH_QUALIFIED_NAMES . with { usualClassTypeRenderer = KtUsualClassTypeRenderer . AS_FULLY_EXPANDED_CLASS_TYPE_WITH_TYPE_ARGUMENTS } } \"\" } } testServices . assertions . assertEqualsToTestDataFileSibling ( actualText ) } }","docstring":"/**\n * [ktFile] may be a fake file for dangling module tests.\n */"} {"signature":"public actual fun < T > Array < out T > . elementAt ( index : Int ) : T","body":"{ 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 array.\n * \n * @sample samples.collections.Collections.Elements.elementAt\n */"} {"signature":"public actual fun ByteArray . elementAt ( index : Int ) : Byte","body":"{ 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 array.\n * \n * @sample samples.collections.Collections.Elements.elementAt\n */"} {"signature":"public actual fun ShortArray . elementAt ( index : Int ) : Short","body":"{ 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 array.\n * \n * @sample samples.collections.Collections.Elements.elementAt\n */"} {"signature":"public actual fun IntArray . elementAt ( index : Int ) : Int","body":"{ 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 array.\n * \n * @sample samples.collections.Collections.Elements.elementAt\n */"} {"signature":"public actual fun LongArray . elementAt ( index : Int ) : Long","body":"{ 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 array.\n * \n * @sample samples.collections.Collections.Elements.elementAt\n */"} {"signature":"public actual fun FloatArray . elementAt ( index : Int ) : Float","body":"{ 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 array.\n * \n * @sample samples.collections.Collections.Elements.elementAt\n */"} {"signature":"public actual fun DoubleArray . elementAt ( index : Int ) : Double","body":"{ 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 array.\n * \n * @sample samples.collections.Collections.Elements.elementAt\n */"} {"signature":"public actual fun BooleanArray . elementAt ( index : Int ) : Boolean","body":"{ 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 array.\n * \n * @sample samples.collections.Collections.Elements.elementAt\n */"} {"signature":"public actual fun CharArray . elementAt ( index : Int ) : Char","body":"{ 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 array.\n * \n * @sample samples.collections.Collections.Elements.elementAt\n */"} {"signature":"public actual fun < T > Array < out T > . asList ( ) : List < T >","body":"{ return ArrayList < T > ( this . unsafeCast < Array < Any ? > > ( ) ) }","docstring":"/**\n * Returns a [List] that wraps the original array.\n */"} {"signature":"@ kotlin . internal . InlineOnly public actual inline fun ByteArray . asList ( ) : List < Byte >","body":"{ return this . unsafeCast < Array < Byte > > ( ) . asList ( ) }","docstring":"/**\n * Returns a [List] that wraps the original array.\n */"} {"signature":"@ kotlin . internal . InlineOnly public actual inline fun ShortArray . asList ( ) : List < Short >","body":"{ return this . unsafeCast < Array < Short > > ( ) . asList ( ) }","docstring":"/**\n * Returns a [List] that wraps the original array.\n */"} {"signature":"@ kotlin . internal . InlineOnly public actual inline fun IntArray . asList ( ) : List < Int >","body":"{ return this . unsafeCast < Array < Int > > ( ) . asList ( ) }","docstring":"/**\n * Returns a [List] that wraps the original array.\n */"} {"signature":"@ kotlin . internal . InlineOnly public actual inline fun LongArray . asList ( ) : List < Long >","body":"{ return this . unsafeCast < Array < Long > > ( ) . asList ( ) }","docstring":"/**\n * Returns a [List] that wraps the original array.\n */"} {"signature":"@ kotlin . internal . InlineOnly public actual inline fun FloatArray . asList ( ) : List < Float >","body":"{ return this . unsafeCast < Array < Float > > ( ) . asList ( ) }","docstring":"/**\n * Returns a [List] that wraps the original array.\n */"} {"signature":"@ kotlin . internal . InlineOnly public actual inline fun DoubleArray . asList ( ) : List < Double >","body":"{ return this . unsafeCast < Array < Double > > ( ) . asList ( ) }","docstring":"/**\n * Returns a [List] that wraps the original array.\n */"} {"signature":"@ kotlin . internal . InlineOnly public actual inline fun BooleanArray . asList ( ) : List < Boolean >","body":"{ return this . unsafeCast < Array < Boolean > > ( ) . asList ( ) }","docstring":"/**\n * Returns a [List] that wraps the original array.\n */"} {"signature":"public actual fun CharArray . asList ( ) : List < Char >","body":"{ return object : AbstractList < Char > ( ) , RandomAccess { override val size : Int get ( ) = this@asList . size override fun isEmpty ( ) : Boolean = this@asList . isEmpty ( ) override fun contains ( element : Char ) : Boolean = this@asList . contains ( element ) override fun get ( index : Int ) : Char { AbstractList . checkElementIndex ( index , size ) return this@asList [ index ] } override fun indexOf ( element : Char ) : Int { @ Suppress ( \"\" ) if ( ( element as Any ? ) !is Char ) return - return this@asList . indexOf ( element ) } override fun lastIndexOf ( element : Char ) : Int { @ Suppress ( \"\" ) if ( ( element as Any ? ) !is Char ) return - return this@asList . lastIndexOf ( element ) } } }","docstring":"/**\n * Returns a [List] that wraps the original array.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . internal . LowPriorityInOverloadResolution public actual infix fun < T > Array < out T > . contentDeepEquals ( other : Array < out T > ) : Boolean","body":"{ return this . contentDeepEquals ( other ) }","docstring":"/**\n * Checks if the two specified arrays are *deeply* equal to one another.\n * \n * Two arrays are considered deeply equal if they have the same size, and elements at corresponding indices are deeply equal.\n * That is, if two corresponding elements are nested arrays, they are also compared deeply.\n * Elements of other types are compared for equality using the [equals][Any.equals] function.\n * For floating point numbers, this means `NaN` is equal to itself and `-0.0` is not equal to `0.0`.\n * \n * If any of the arrays contain themselves at any nesting level, the behavior is undefined.\n * \n * @param other the array to compare deeply with this array.\n * @return `true` if the two arrays are deeply equal, `false` otherwise.\n * \n * @sample samples.collections.Arrays.ContentOperations.contentDeepEquals\n */"} {"signature":"@ SinceKotlin ( \"\" ) public actual infix fun < T > Array < out T > ? . contentDeepEquals ( other : Array < out T > ? ) : Boolean","body":"{ return contentDeepEqualsImpl ( other ) }","docstring":"/**\n * Checks if the two specified arrays are *deeply* equal to one another.\n * \n * Two arrays are considered deeply equal if they have the same size, and elements at corresponding indices are deeply equal.\n * That is, if two corresponding elements are nested arrays, they are also compared deeply.\n * Elements of other types are compared for equality using the [equals][Any.equals] function.\n * For floating point numbers, this means `NaN` is equal to itself and `-0.0` is not equal to `0.0`.\n * \n * The arrays are also considered deeply equal if both are `null`.\n * \n * If any of the arrays contain themselves at any nesting level, the behavior is undefined.\n * \n * @param other the array to compare deeply with this array.\n * @return `true` if the two arrays are deeply equal, `false` otherwise.\n * \n * @sample samples.collections.Arrays.ContentOperations.contentDeepEquals\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . internal . LowPriorityInOverloadResolution public actual fun < T > Array < out T > . contentDeepHashCode ( ) : Int","body":"{ return this . contentDeepHashCode ( ) }","docstring":"/**\n * Returns a hash code based on the contents of this array as if it is [List].\n * Nested arrays are treated as lists too.\n * \n * If any of arrays contains itself on any nesting level the behavior is undefined.\n */"} {"signature":"@ SinceKotlin ( \"\" ) public actual fun < T > Array < out T > ? . contentDeepHashCode ( ) : Int","body":"{ return contentDeepHashCodeInternal ( ) }","docstring":"/**\n * Returns a hash code based on the contents of this array as if it is [List].\n * Nested arrays are treated as lists too.\n * \n * If any of arrays contains itself on any nesting level the behavior is undefined.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . internal . LowPriorityInOverloadResolution public actual fun < T > Array < out T > . contentDeepToString ( ) : String","body":"{ return this . contentDeepToString ( ) }","docstring":"/**\n * Returns a string representation of the contents of this array as if it is a [List].\n * Nested arrays are treated as lists too.\n * \n * If any of arrays contains itself on any nesting level that reference\n * is rendered as `\"[...]\"` to prevent recursion.\n * \n * @sample samples.collections.Arrays.ContentOperations.contentDeepToString\n */"} {"signature":"@ SinceKotlin ( \"\" ) public actual fun < T > Array < out T > ? . contentDeepToString ( ) : String","body":"{ return contentDeepToStringImpl ( ) }","docstring":"/**\n * Returns a string representation of the contents of this array as if it is a [List].\n * Nested arrays are treated as lists too.\n * \n * If any of arrays contains itself on any nesting level that reference\n * is rendered as `\"[...]\"` to prevent recursion.\n * \n * @sample samples.collections.Arrays.ContentOperations.contentDeepToString\n */"} {"signature":"@ SinceKotlin ( \"\" ) public actual infix fun < T > Array < out T > ? . contentEquals ( other : Array < out T > ? ) : Boolean","body":"{ return contentEqualsInternal ( other ) }","docstring":"/**\n * Checks if the two specified arrays are *structurally* equal to one another.\n * \n * Two arrays are considered structurally equal if they have the same size, and elements at corresponding indices are equal.\n * Elements are compared for equality using the [equals][Any.equals] function.\n * For floating point numbers, this means `NaN` is equal to itself and `-0.0` is not equal to `0.0`.\n * \n * The arrays are also considered structurally equal if both are `null`.\n * \n * If the arrays contain nested arrays, use [contentDeepEquals] to recursively compare their elements.\n * \n * @param other the array to compare with this array.\n * @return `true` if the two arrays are structurally equal, `false` otherwise.\n * \n * @sample samples.collections.Arrays.ContentOperations.arrayContentEquals\n */"} {"signature":"@ SinceKotlin ( \"\" ) public actual infix fun ByteArray ? . contentEquals ( other : ByteArray ? ) : Boolean","body":"{ return contentEqualsInternal ( other ) }","docstring":"/**\n * Checks if the two specified arrays are *structurally* equal to one another.\n * \n * Two arrays are considered structurally equal if they have the same size, and elements at corresponding indices are equal.\n * \n * The arrays are also considered structurally equal if both are `null`.\n * \n * @param other the array to compare with this array.\n * @return `true` if the two arrays are structurally equal, `false` otherwise.\n * \n * @sample samples.collections.Arrays.ContentOperations.intArrayContentEquals\n */"} {"signature":"@ SinceKotlin ( \"\" ) public actual infix fun ShortArray ? . contentEquals ( other : ShortArray ? ) : Boolean","body":"{ return contentEqualsInternal ( other ) }","docstring":"/**\n * Checks if the two specified arrays are *structurally* equal to one another.\n * \n * Two arrays are considered structurally equal if they have the same size, and elements at corresponding indices are equal.\n * \n * The arrays are also considered structurally equal if both are `null`.\n * \n * @param other the array to compare with this array.\n * @return `true` if the two arrays are structurally equal, `false` otherwise.\n * \n * @sample samples.collections.Arrays.ContentOperations.intArrayContentEquals\n */"} {"signature":"@ SinceKotlin ( \"\" ) public actual infix fun IntArray ? . contentEquals ( other : IntArray ? ) : Boolean","body":"{ return contentEqualsInternal ( other ) }","docstring":"/**\n * Checks if the two specified arrays are *structurally* equal to one another.\n * \n * Two arrays are considered structurally equal if they have the same size, and elements at corresponding indices are equal.\n * \n * The arrays are also considered structurally equal if both are `null`.\n * \n * @param other the array to compare with this array.\n * @return `true` if the two arrays are structurally equal, `false` otherwise.\n * \n * @sample samples.collections.Arrays.ContentOperations.intArrayContentEquals\n */"} {"signature":"@ SinceKotlin ( \"\" ) public actual infix fun LongArray ? . contentEquals ( other : LongArray ? ) : Boolean","body":"{ return contentEqualsInternal ( other ) }","docstring":"/**\n * Checks if the two specified arrays are *structurally* equal to one another.\n * \n * Two arrays are considered structurally equal if they have the same size, and elements at corresponding indices are equal.\n * \n * The arrays are also considered structurally equal if both are `null`.\n * \n * @param other the array to compare with this array.\n * @return `true` if the two arrays are structurally equal, `false` otherwise.\n * \n * @sample samples.collections.Arrays.ContentOperations.intArrayContentEquals\n */"} {"signature":"@ SinceKotlin ( \"\" ) public actual infix fun FloatArray ? . contentEquals ( other : FloatArray ? ) : Boolean","body":"{ return contentEqualsInternal ( other ) }","docstring":"/**\n * Checks if the two specified arrays are *structurally* equal to one another.\n * \n * Two arrays are considered structurally equal if they have the same size, and elements at corresponding indices are equal.\n * Elements are compared for equality using the [equals][Any.equals] function.\n * This means `NaN` is equal to itself and `-0.0` is not equal to `0.0`.\n * \n * The arrays are also considered structurally equal if both are `null`.\n * \n * @param other the array to compare with this array.\n * @return `true` if the two arrays are structurally equal, `false` otherwise.\n * \n * @sample samples.collections.Arrays.ContentOperations.doubleArrayContentEquals\n */"} {"signature":"@ SinceKotlin ( \"\" ) public actual infix fun DoubleArray ? . contentEquals ( other : DoubleArray ? ) : Boolean","body":"{ return contentEqualsInternal ( other ) }","docstring":"/**\n * Checks if the two specified arrays are *structurally* equal to one another.\n * \n * Two arrays are considered structurally equal if they have the same size, and elements at corresponding indices are equal.\n * Elements are compared for equality using the [equals][Any.equals] function.\n * This means `NaN` is equal to itself and `-0.0` is not equal to `0.0`.\n * \n * The arrays are also considered structurally equal if both are `null`.\n * \n * @param other the array to compare with this array.\n * @return `true` if the two arrays are structurally equal, `false` otherwise.\n * \n * @sample samples.collections.Arrays.ContentOperations.doubleArrayContentEquals\n */"} {"signature":"@ SinceKotlin ( \"\" ) public actual infix fun BooleanArray ? . contentEquals ( other : BooleanArray ? ) : Boolean","body":"{ return contentEqualsInternal ( other ) }","docstring":"/**\n * Checks if the two specified arrays are *structurally* equal to one another.\n * \n * Two arrays are considered structurally equal if they have the same size, and elements at corresponding indices are equal.\n * \n * The arrays are also considered structurally equal if both are `null`.\n * \n * @param other the array to compare with this array.\n * @return `true` if the two arrays are structurally equal, `false` otherwise.\n * \n * @sample samples.collections.Arrays.ContentOperations.booleanArrayContentEquals\n */"} {"signature":"@ SinceKotlin ( \"\" ) public actual infix fun CharArray ? . contentEquals ( other : CharArray ? ) : Boolean","body":"{ return contentEqualsInternal ( other ) }","docstring":"/**\n * Checks if the two specified arrays are *structurally* equal to one another.\n * \n * Two arrays are considered structurally equal if they have the same size, and elements at corresponding indices are equal.\n * \n * The arrays are also considered structurally equal if both are `null`.\n * \n * @param other the array to compare with this array.\n * @return `true` if the two arrays are structurally equal, `false` otherwise.\n * \n * @sample samples.collections.Arrays.ContentOperations.charArrayContentEquals\n */"} {"signature":"@ SinceKotlin ( \"\" ) public actual fun < T > Array < out T > ? . contentHashCode ( ) : Int","body":"{ return contentHashCodeInternal ( ) }","docstring":"/**\n * Returns a hash code based on the contents of this array as if it is [List].\n */"} {"signature":"@ SinceKotlin ( \"\" ) public actual fun ByteArray ? . contentHashCode ( ) : Int","body":"{ return contentHashCodeInternal ( ) }","docstring":"/**\n * Returns a hash code based on the contents of this array as if it is [List].\n */"} {"signature":"@ SinceKotlin ( \"\" ) public actual fun ShortArray ? . contentHashCode ( ) : Int","body":"{ return contentHashCodeInternal ( ) }","docstring":"/**\n * Returns a hash code based on the contents of this array as if it is [List].\n */"} {"signature":"@ SinceKotlin ( \"\" ) public actual fun IntArray ? . contentHashCode ( ) : Int","body":"{ return contentHashCodeInternal ( ) }","docstring":"/**\n * Returns a hash code based on the contents of this array as if it is [List].\n */"} {"signature":"@ SinceKotlin ( \"\" ) public actual fun LongArray ? . contentHashCode ( ) : Int","body":"{ return contentHashCodeInternal ( ) }","docstring":"/**\n * Returns a hash code based on the contents of this array as if it is [List].\n */"} {"signature":"@ SinceKotlin ( \"\" ) public actual fun FloatArray ? . contentHashCode ( ) : Int","body":"{ return contentHashCodeInternal ( ) }","docstring":"/**\n * Returns a hash code based on the contents of this array as if it is [List].\n */"} {"signature":"@ SinceKotlin ( \"\" ) public actual fun DoubleArray ? . contentHashCode ( ) : Int","body":"{ return contentHashCodeInternal ( ) }","docstring":"/**\n * Returns a hash code based on the contents of this array as if it is [List].\n */"} {"signature":"@ SinceKotlin ( \"\" ) public actual fun BooleanArray ? . contentHashCode ( ) : Int","body":"{ return contentHashCodeInternal ( ) }","docstring":"/**\n * Returns a hash code based on the contents of this array as if it is [List].\n */"} {"signature":"@ SinceKotlin ( \"\" ) public actual fun CharArray ? . contentHashCode ( ) : Int","body":"{ return contentHashCodeInternal ( ) }","docstring":"/**\n * Returns a hash code based on the contents of this array as if it is [List].\n */"} {"signature":"@ SinceKotlin ( \"\" ) public actual fun < T > Array < out T > ? . contentToString ( ) : String","body":"{ return this ? . joinToString ( \"\" , \"\" , \"\" ) ? : \"\" }","docstring":"/**\n * Returns a string representation of the contents of the specified array as if it is [List].\n * \n * @sample samples.collections.Arrays.ContentOperations.contentToString\n */"} {"signature":"@ SinceKotlin ( \"\" ) public actual fun ByteArray ? . contentToString ( ) : String","body":"{ return this ? . joinToString ( \"\" , \"\" , \"\" ) ? : \"\" }","docstring":"/**\n * Returns a string representation of the contents of the specified array as if it is [List].\n * \n * @sample samples.collections.Arrays.ContentOperations.contentToString\n */"} {"signature":"@ SinceKotlin ( \"\" ) public actual fun ShortArray ? . contentToString ( ) : String","body":"{ return this ? . joinToString ( \"\" , \"\" , \"\" ) ? : \"\" }","docstring":"/**\n * Returns a string representation of the contents of the specified array as if it is [List].\n * \n * @sample samples.collections.Arrays.ContentOperations.contentToString\n */"} {"signature":"@ SinceKotlin ( \"\" ) public actual fun IntArray ? . contentToString ( ) : String","body":"{ return this ? . joinToString ( \"\" , \"\" , \"\" ) ? : \"\" }","docstring":"/**\n * Returns a string representation of the contents of the specified array as if it is [List].\n * \n * @sample samples.collections.Arrays.ContentOperations.contentToString\n */"} {"signature":"@ SinceKotlin ( \"\" ) public actual fun LongArray ? . contentToString ( ) : String","body":"{ return this ? . joinToString ( \"\" , \"\" , \"\" ) ? : \"\" }","docstring":"/**\n * Returns a string representation of the contents of the specified array as if it is [List].\n * \n * @sample samples.collections.Arrays.ContentOperations.contentToString\n */"} {"signature":"@ SinceKotlin ( \"\" ) public actual fun FloatArray ? . contentToString ( ) : String","body":"{ return this ? . joinToString ( \"\" , \"\" , \"\" ) ? : \"\" }","docstring":"/**\n * Returns a string representation of the contents of the specified array as if it is [List].\n * \n * @sample samples.collections.Arrays.ContentOperations.contentToString\n */"} {"signature":"@ SinceKotlin ( \"\" ) public actual fun DoubleArray ? . contentToString ( ) : String","body":"{ return this ? . joinToString ( \"\" , \"\" , \"\" ) ? : \"\" }","docstring":"/**\n * Returns a string representation of the contents of the specified array as if it is [List].\n * \n * @sample samples.collections.Arrays.ContentOperations.contentToString\n */"} {"signature":"@ SinceKotlin ( \"\" ) public actual fun BooleanArray ? . contentToString ( ) : String","body":"{ return this ? . joinToString ( \"\" , \"\" , \"\" ) ? : \"\" }","docstring":"/**\n * Returns a string representation of the contents of the specified array as if it is [List].\n * \n * @sample samples.collections.Arrays.ContentOperations.contentToString\n */"} {"signature":"@ SinceKotlin ( \"\" ) public actual fun CharArray ? . contentToString ( ) : String","body":"{ return this ? . joinToString ( \"\" , \"\" , \"\" ) ? : \"\" }","docstring":"/**\n * Returns a string representation of the contents of the specified array as if it is [List].\n * \n * @sample samples.collections.Arrays.ContentOperations.contentToString\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . internal . InlineOnly @ Suppress ( \"\" ) public actual inline fun < T > Array < out T > . copyInto ( destination : Array < T > , destinationOffset : Int = , startIndex : Int = , endIndex : Int = size ) : Array < T >","body":"{ arrayCopy ( this , destination , destinationOffset , startIndex , endIndex ) return destination }","docstring":"/**\n * Copies this array or its subrange into the [destination] array and returns that array.\n * \n * It's allowed to pass the same array in the [destination] and even specify the subrange so that it overlaps with the destination range.\n * \n * @param destination the array to copy to.\n * @param destinationOffset the position in the [destination] array to copy to, 0 by default.\n * @param startIndex the beginning (inclusive) of the subrange to copy, 0 by default.\n * @param endIndex the end (exclusive) of the subrange to copy, size of this array by default.\n * \n * @throws IndexOutOfBoundsException or [IllegalArgumentException] when [startIndex] or [endIndex] is out of range of this array 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 * \n * @return the [destination] array.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . internal . InlineOnly @ Suppress ( \"\" ) public actual inline fun ByteArray . copyInto ( destination : ByteArray , destinationOffset : Int = , startIndex : Int = , endIndex : Int = size ) : ByteArray","body":"{ arrayCopy ( this . unsafeCast < Array < Byte > > ( ) , destination . unsafeCast < Array < Byte > > ( ) , destinationOffset , startIndex , endIndex ) return destination }","docstring":"/**\n * Copies this array or its subrange into the [destination] array and returns that array.\n * \n * It's allowed to pass the same array in the [destination] and even specify the subrange so that it overlaps with the destination range.\n * \n * @param destination the array to copy to.\n * @param destinationOffset the position in the [destination] array to copy to, 0 by default.\n * @param startIndex the beginning (inclusive) of the subrange to copy, 0 by default.\n * @param endIndex the end (exclusive) of the subrange to copy, size of this array by default.\n * \n * @throws IndexOutOfBoundsException or [IllegalArgumentException] when [startIndex] or [endIndex] is out of range of this array 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 * \n * @return the [destination] array.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . internal . InlineOnly @ Suppress ( \"\" ) public actual inline fun ShortArray . copyInto ( destination : ShortArray , destinationOffset : Int = , startIndex : Int = , endIndex : Int = size ) : ShortArray","body":"{ arrayCopy ( this . unsafeCast < Array < Short > > ( ) , destination . unsafeCast < Array < Short > > ( ) , destinationOffset , startIndex , endIndex ) return destination }","docstring":"/**\n * Copies this array or its subrange into the [destination] array and returns that array.\n * \n * It's allowed to pass the same array in the [destination] and even specify the subrange so that it overlaps with the destination range.\n * \n * @param destination the array to copy to.\n * @param destinationOffset the position in the [destination] array to copy to, 0 by default.\n * @param startIndex the beginning (inclusive) of the subrange to copy, 0 by default.\n * @param endIndex the end (exclusive) of the subrange to copy, size of this array by default.\n * \n * @throws IndexOutOfBoundsException or [IllegalArgumentException] when [startIndex] or [endIndex] is out of range of this array 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 * \n * @return the [destination] array.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . internal . InlineOnly @ Suppress ( \"\" ) public actual inline fun IntArray . copyInto ( destination : IntArray , destinationOffset : Int = , startIndex : Int = , endIndex : Int = size ) : IntArray","body":"{ arrayCopy ( this . unsafeCast < Array < Int > > ( ) , destination . unsafeCast < Array < Int > > ( ) , destinationOffset , startIndex , endIndex ) return destination }","docstring":"/**\n * Copies this array or its subrange into the [destination] array and returns that array.\n * \n * It's allowed to pass the same array in the [destination] and even specify the subrange so that it overlaps with the destination range.\n * \n * @param destination the array to copy to.\n * @param destinationOffset the position in the [destination] array to copy to, 0 by default.\n * @param startIndex the beginning (inclusive) of the subrange to copy, 0 by default.\n * @param endIndex the end (exclusive) of the subrange to copy, size of this array by default.\n * \n * @throws IndexOutOfBoundsException or [IllegalArgumentException] when [startIndex] or [endIndex] is out of range of this array 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 * \n * @return the [destination] array.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . internal . InlineOnly @ Suppress ( \"\" ) public actual inline fun LongArray . copyInto ( destination : LongArray , destinationOffset : Int = , startIndex : Int = , endIndex : Int = size ) : LongArray","body":"{ arrayCopy ( this . unsafeCast < Array < Long > > ( ) , destination . unsafeCast < Array < Long > > ( ) , destinationOffset , startIndex , endIndex ) return destination }","docstring":"/**\n * Copies this array or its subrange into the [destination] array and returns that array.\n * \n * It's allowed to pass the same array in the [destination] and even specify the subrange so that it overlaps with the destination range.\n * \n * @param destination the array to copy to.\n * @param destinationOffset the position in the [destination] array to copy to, 0 by default.\n * @param startIndex the beginning (inclusive) of the subrange to copy, 0 by default.\n * @param endIndex the end (exclusive) of the subrange to copy, size of this array by default.\n * \n * @throws IndexOutOfBoundsException or [IllegalArgumentException] when [startIndex] or [endIndex] is out of range of this array 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 * \n * @return the [destination] array.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . internal . InlineOnly @ Suppress ( \"\" ) public actual inline fun FloatArray . copyInto ( destination : FloatArray , destinationOffset : Int = , startIndex : Int = , endIndex : Int = size ) : FloatArray","body":"{ arrayCopy ( this . unsafeCast < Array < Float > > ( ) , destination . unsafeCast < Array < Float > > ( ) , destinationOffset , startIndex , endIndex ) return destination }","docstring":"/**\n * Copies this array or its subrange into the [destination] array and returns that array.\n * \n * It's allowed to pass the same array in the [destination] and even specify the subrange so that it overlaps with the destination range.\n * \n * @param destination the array to copy to.\n * @param destinationOffset the position in the [destination] array to copy to, 0 by default.\n * @param startIndex the beginning (inclusive) of the subrange to copy, 0 by default.\n * @param endIndex the end (exclusive) of the subrange to copy, size of this array by default.\n * \n * @throws IndexOutOfBoundsException or [IllegalArgumentException] when [startIndex] or [endIndex] is out of range of this array 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 * \n * @return the [destination] array.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . internal . InlineOnly @ Suppress ( \"\" ) public actual inline fun DoubleArray . copyInto ( destination : DoubleArray , destinationOffset : Int = , startIndex : Int = , endIndex : Int = size ) : DoubleArray","body":"{ arrayCopy ( this . unsafeCast < Array < Double > > ( ) , destination . unsafeCast < Array < Double > > ( ) , destinationOffset , startIndex , endIndex ) return destination }","docstring":"/**\n * Copies this array or its subrange into the [destination] array and returns that array.\n * \n * It's allowed to pass the same array in the [destination] and even specify the subrange so that it overlaps with the destination range.\n * \n * @param destination the array to copy to.\n * @param destinationOffset the position in the [destination] array to copy to, 0 by default.\n * @param startIndex the beginning (inclusive) of the subrange to copy, 0 by default.\n * @param endIndex the end (exclusive) of the subrange to copy, size of this array by default.\n * \n * @throws IndexOutOfBoundsException or [IllegalArgumentException] when [startIndex] or [endIndex] is out of range of this array 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 * \n * @return the [destination] array.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . internal . InlineOnly @ Suppress ( \"\" ) public actual inline fun BooleanArray . copyInto ( destination : BooleanArray , destinationOffset : Int = , startIndex : Int = , endIndex : Int = size ) : BooleanArray","body":"{ arrayCopy ( this . unsafeCast < Array < Boolean > > ( ) , destination . unsafeCast < Array < Boolean > > ( ) , destinationOffset , startIndex , endIndex ) return destination }","docstring":"/**\n * Copies this array or its subrange into the [destination] array and returns that array.\n * \n * It's allowed to pass the same array in the [destination] and even specify the subrange so that it overlaps with the destination range.\n * \n * @param destination the array to copy to.\n * @param destinationOffset the position in the [destination] array to copy to, 0 by default.\n * @param startIndex the beginning (inclusive) of the subrange to copy, 0 by default.\n * @param endIndex the end (exclusive) of the subrange to copy, size of this array by default.\n * \n * @throws IndexOutOfBoundsException or [IllegalArgumentException] when [startIndex] or [endIndex] is out of range of this array 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 * \n * @return the [destination] array.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . internal . InlineOnly @ Suppress ( \"\" ) public actual inline fun CharArray . copyInto ( destination : CharArray , destinationOffset : Int = , startIndex : Int = , endIndex : Int = size ) : CharArray","body":"{ arrayCopy ( this . unsafeCast < Array < Char > > ( ) , destination . unsafeCast < Array < Char > > ( ) , destinationOffset , startIndex , endIndex ) return destination }","docstring":"/**\n * Copies this array or its subrange into the [destination] array and returns that array.\n * \n * It's allowed to pass the same array in the [destination] and even specify the subrange so that it overlaps with the destination range.\n * \n * @param destination the array to copy to.\n * @param destinationOffset the position in the [destination] array to copy to, 0 by default.\n * @param startIndex the beginning (inclusive) of the subrange to copy, 0 by default.\n * @param endIndex the end (exclusive) of the subrange to copy, size of this array by default.\n * \n * @throws IndexOutOfBoundsException or [IllegalArgumentException] when [startIndex] or [endIndex] is out of range of this array 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 * \n * @return the [destination] array.\n */"} {"signature":"@ Suppress ( \"\" , \"\" ) public actual inline fun < T > Array < out T > . copyOf ( ) : Array < T >","body":"{ return this . asDynamic ( ) . slice ( ) }","docstring":"/**\n * Returns new array which is a copy of the original array.\n * \n * @sample samples.collections.Arrays.CopyOfOperations.copyOf\n */"} {"signature":"@ Suppress ( \"\" ) public actual inline fun ByteArray . copyOf ( ) : ByteArray","body":"{ return this . asDynamic ( ) . slice ( ) }","docstring":"/**\n * Returns new array which is a copy of the original array.\n * \n * @sample samples.collections.Arrays.CopyOfOperations.copyOf\n */"} {"signature":"@ Suppress ( \"\" ) public actual inline fun ShortArray . copyOf ( ) : ShortArray","body":"{ return this . asDynamic ( ) . slice ( ) }","docstring":"/**\n * Returns new array which is a copy of the original array.\n * \n * @sample samples.collections.Arrays.CopyOfOperations.copyOf\n */"} {"signature":"@ Suppress ( \"\" ) public actual inline fun IntArray . copyOf ( ) : IntArray","body":"{ return this . asDynamic ( ) . slice ( ) }","docstring":"/**\n * Returns new array which is a copy of the original array.\n * \n * @sample samples.collections.Arrays.CopyOfOperations.copyOf\n */"} {"signature":"public actual fun LongArray . copyOf ( ) : LongArray","body":"{ return withType ( \"\" , this . asDynamic ( ) . slice ( ) ) }","docstring":"/**\n * Returns new array which is a copy of the original array.\n * \n * @sample samples.collections.Arrays.CopyOfOperations.copyOf\n */"} {"signature":"@ Suppress ( \"\" ) public actual inline fun FloatArray . copyOf ( ) : FloatArray","body":"{ return this . asDynamic ( ) . slice ( ) }","docstring":"/**\n * Returns new array which is a copy of the original array.\n * \n * @sample samples.collections.Arrays.CopyOfOperations.copyOf\n */"} {"signature":"@ Suppress ( \"\" ) public actual inline fun DoubleArray . copyOf ( ) : DoubleArray","body":"{ return this . asDynamic ( ) . slice ( ) }","docstring":"/**\n * Returns new array which is a copy of the original array.\n * \n * @sample samples.collections.Arrays.CopyOfOperations.copyOf\n */"} {"signature":"public actual fun BooleanArray . copyOf ( ) : BooleanArray","body":"{ return withType ( \"\" , this . asDynamic ( ) . slice ( ) ) }","docstring":"/**\n * Returns new array which is a copy of the original array.\n * \n * @sample samples.collections.Arrays.CopyOfOperations.copyOf\n */"} {"signature":"public actual fun CharArray . copyOf ( ) : CharArray","body":"{ return withType ( \"\" , this . asDynamic ( ) . slice ( ) ) }","docstring":"/**\n * Returns new array which is a copy of the original array.\n * \n * @sample samples.collections.Arrays.CopyOfOperations.copyOf\n */"} {"signature":"public actual fun ByteArray . copyOf ( newSize : Int ) : ByteArray","body":"{ require ( newSize >= ) { \"\" } return fillFrom ( this , ByteArray ( newSize ) ) }","docstring":"/**\n * Returns new array which is a copy of the original array, resized to the given [newSize].\n * The copy is either truncated or padded at the end with zero values if necessary.\n * \n * - If [newSize] is less than the size of the original array, the copy array is truncated to the [newSize].\n * - If [newSize] is greater than the size of the original array, the extra elements in the copy array are filled with zero values.\n * \n * @sample samples.collections.Arrays.CopyOfOperations.resizedPrimitiveCopyOf\n */"} {"signature":"public actual fun ShortArray . copyOf ( newSize : Int ) : ShortArray","body":"{ require ( newSize >= ) { \"\" } return fillFrom ( this , ShortArray ( newSize ) ) }","docstring":"/**\n * Returns new array which is a copy of the original array, resized to the given [newSize].\n * The copy is either truncated or padded at the end with zero values if necessary.\n * \n * - If [newSize] is less than the size of the original array, the copy array is truncated to the [newSize].\n * - If [newSize] is greater than the size of the original array, the extra elements in the copy array are filled with zero values.\n * \n * @sample samples.collections.Arrays.CopyOfOperations.resizedPrimitiveCopyOf\n */"} {"signature":"public actual fun IntArray . copyOf ( newSize : Int ) : IntArray","body":"{ require ( newSize >= ) { \"\" } return fillFrom ( this , IntArray ( newSize ) ) }","docstring":"/**\n * Returns new array which is a copy of the original array, resized to the given [newSize].\n * The copy is either truncated or padded at the end with zero values if necessary.\n * \n * - If [newSize] is less than the size of the original array, the copy array is truncated to the [newSize].\n * - If [newSize] is greater than the size of the original array, the extra elements in the copy array are filled with zero values.\n * \n * @sample samples.collections.Arrays.CopyOfOperations.resizedPrimitiveCopyOf\n */"} {"signature":"public actual fun LongArray . copyOf ( newSize : Int ) : LongArray","body":"{ require ( newSize >= ) { \"\" } return withType ( \"\" , arrayCopyResize ( this , newSize , ) ) }","docstring":"/**\n * Returns new array which is a copy of the original array, resized to the given [newSize].\n * The copy is either truncated or padded at the end with zero values if necessary.\n * \n * - If [newSize] is less than the size of the original array, the copy array is truncated to the [newSize].\n * - If [newSize] is greater than the size of the original array, the extra elements in the copy array are filled with zero values.\n * \n * @sample samples.collections.Arrays.CopyOfOperations.resizedPrimitiveCopyOf\n */"} {"signature":"public actual fun FloatArray . copyOf ( newSize : Int ) : FloatArray","body":"{ require ( newSize >= ) { \"\" } return fillFrom ( this , FloatArray ( newSize ) ) }","docstring":"/**\n * Returns new array which is a copy of the original array, resized to the given [newSize].\n * The copy is either truncated or padded at the end with zero values if necessary.\n * \n * - If [newSize] is less than the size of the original array, the copy array is truncated to the [newSize].\n * - If [newSize] is greater than the size of the original array, the extra elements in the copy array are filled with zero values.\n * \n * @sample samples.collections.Arrays.CopyOfOperations.resizedPrimitiveCopyOf\n */"} {"signature":"public actual fun DoubleArray . copyOf ( newSize : Int ) : DoubleArray","body":"{ require ( newSize >= ) { \"\" } return fillFrom ( this , DoubleArray ( newSize ) ) }","docstring":"/**\n * Returns new array which is a copy of the original array, resized to the given [newSize].\n * The copy is either truncated or padded at the end with zero values if necessary.\n * \n * - If [newSize] is less than the size of the original array, the copy array is truncated to the [newSize].\n * - If [newSize] is greater than the size of the original array, the extra elements in the copy array are filled with zero values.\n * \n * @sample samples.collections.Arrays.CopyOfOperations.resizedPrimitiveCopyOf\n */"} {"signature":"public actual fun BooleanArray . copyOf ( newSize : Int ) : BooleanArray","body":"{ require ( newSize >= ) { \"\" } return withType ( \"\" , arrayCopyResize ( this , newSize , false ) ) }","docstring":"/**\n * Returns new array which is a copy of the original array, resized to the given [newSize].\n * The copy is either truncated or padded at the end with `false` values if necessary.\n * \n * - If [newSize] is less than the size of the original array, the copy array is truncated to the [newSize].\n * - If [newSize] is greater than the size of the original array, the extra elements in the copy array are filled with `false` values.\n * \n * @sample samples.collections.Arrays.CopyOfOperations.resizedPrimitiveCopyOf\n */"} {"signature":"public actual fun CharArray . copyOf ( newSize : Int ) : CharArray","body":"{ require ( newSize >= ) { \"\" } return withType ( \"\" , fillFrom ( this , CharArray ( newSize ) ) ) }","docstring":"/**\n * Returns new array which is a copy of the original array, resized to the given [newSize].\n * The copy is either truncated or padded at the end with null char (`\\u0000`) values if necessary.\n * \n * - If [newSize] is less than the size of the original array, the copy array is truncated to the [newSize].\n * - If [newSize] is greater than the size of the original array, the extra elements in the copy array are filled with null char (`\\u0000`) values.\n * \n * @sample samples.collections.Arrays.CopyOfOperations.resizedPrimitiveCopyOf\n */"} {"signature":"@ Suppress ( \"\" ) public actual fun < T > Array < out T > . copyOf ( newSize : Int ) : Array < T ? >","body":"{ require ( newSize >= ) { \"\" } return arrayCopyResize ( this , newSize , null ) }","docstring":"/**\n * Returns new array which is a copy of the original array, resized to the given [newSize].\n * The copy is either truncated or padded at the end with `null` values if necessary.\n * \n * - If [newSize] is less than the size of the original array, the copy array is truncated to the [newSize].\n * - If [newSize] is greater than the size of the original array, the extra elements in the copy array are filled with `null` values.\n * \n * @sample samples.collections.Arrays.CopyOfOperations.resizingCopyOf\n */"} {"signature":"@ Suppress ( \"\" ) public actual fun < T > Array < out T > . copyOfRange ( fromIndex : Int , toIndex : Int ) : Array < T >","body":"{ AbstractList . checkRangeIndexes ( fromIndex , toIndex , size ) return this . asDynamic ( ) . slice ( fromIndex , toIndex ) }","docstring":"/**\n * Returns a new array which is a copy of the specified range of the original array.\n * \n * @param fromIndex the start of the range (inclusive) to copy.\n * @param toIndex the end of the range (exclusive) to copy.\n * \n * @throws IndexOutOfBoundsException if [fromIndex] is less than zero or [toIndex] is greater than the size of this array.\n * @throws IllegalArgumentException if [fromIndex] is greater than [toIndex].\n */"} {"signature":"public actual fun ByteArray . copyOfRange ( fromIndex : Int , toIndex : Int ) : ByteArray","body":"{ AbstractList . checkRangeIndexes ( fromIndex , toIndex , size ) return this . asDynamic ( ) . slice ( fromIndex , toIndex ) }","docstring":"/**\n * Returns a new array which is a copy of the specified range of the original array.\n * \n * @param fromIndex the start of the range (inclusive) to copy.\n * @param toIndex the end of the range (exclusive) to copy.\n * \n * @throws IndexOutOfBoundsException if [fromIndex] is less than zero or [toIndex] is greater than the size of this array.\n * @throws IllegalArgumentException if [fromIndex] is greater than [toIndex].\n */"} {"signature":"public actual fun ShortArray . copyOfRange ( fromIndex : Int , toIndex : Int ) : ShortArray","body":"{ AbstractList . checkRangeIndexes ( fromIndex , toIndex , size ) return this . asDynamic ( ) . slice ( fromIndex , toIndex ) }","docstring":"/**\n * Returns a new array which is a copy of the specified range of the original array.\n * \n * @param fromIndex the start of the range (inclusive) to copy.\n * @param toIndex the end of the range (exclusive) to copy.\n * \n * @throws IndexOutOfBoundsException if [fromIndex] is less than zero or [toIndex] is greater than the size of this array.\n * @throws IllegalArgumentException if [fromIndex] is greater than [toIndex].\n */"} {"signature":"public actual fun IntArray . copyOfRange ( fromIndex : Int , toIndex : Int ) : IntArray","body":"{ AbstractList . checkRangeIndexes ( fromIndex , toIndex , size ) return this . asDynamic ( ) . slice ( fromIndex , toIndex ) }","docstring":"/**\n * Returns a new array which is a copy of the specified range of the original array.\n * \n * @param fromIndex the start of the range (inclusive) to copy.\n * @param toIndex the end of the range (exclusive) to copy.\n * \n * @throws IndexOutOfBoundsException if [fromIndex] is less than zero or [toIndex] is greater than the size of this array.\n * @throws IllegalArgumentException if [fromIndex] is greater than [toIndex].\n */"} {"signature":"public actual fun LongArray . copyOfRange ( fromIndex : Int , toIndex : Int ) : LongArray","body":"{ AbstractList . checkRangeIndexes ( fromIndex , toIndex , size ) return withType ( \"\" , this . asDynamic ( ) . slice ( fromIndex , toIndex ) ) }","docstring":"/**\n * Returns a new array which is a copy of the specified range of the original array.\n * \n * @param fromIndex the start of the range (inclusive) to copy.\n * @param toIndex the end of the range (exclusive) to copy.\n * \n * @throws IndexOutOfBoundsException if [fromIndex] is less than zero or [toIndex] is greater than the size of this array.\n * @throws IllegalArgumentException if [fromIndex] is greater than [toIndex].\n */"} {"signature":"public actual fun FloatArray . copyOfRange ( fromIndex : Int , toIndex : Int ) : FloatArray","body":"{ AbstractList . checkRangeIndexes ( fromIndex , toIndex , size ) return this . asDynamic ( ) . slice ( fromIndex , toIndex ) }","docstring":"/**\n * Returns a new array which is a copy of the specified range of the original array.\n * \n * @param fromIndex the start of the range (inclusive) to copy.\n * @param toIndex the end of the range (exclusive) to copy.\n * \n * @throws IndexOutOfBoundsException if [fromIndex] is less than zero or [toIndex] is greater than the size of this array.\n * @throws IllegalArgumentException if [fromIndex] is greater than [toIndex].\n */"} {"signature":"public actual fun DoubleArray . copyOfRange ( fromIndex : Int , toIndex : Int ) : DoubleArray","body":"{ AbstractList . checkRangeIndexes ( fromIndex , toIndex , size ) return this . asDynamic ( ) . slice ( fromIndex , toIndex ) }","docstring":"/**\n * Returns a new array which is a copy of the specified range of the original array.\n * \n * @param fromIndex the start of the range (inclusive) to copy.\n * @param toIndex the end of the range (exclusive) to copy.\n * \n * @throws IndexOutOfBoundsException if [fromIndex] is less than zero or [toIndex] is greater than the size of this array.\n * @throws IllegalArgumentException if [fromIndex] is greater than [toIndex].\n */"} {"signature":"public actual fun BooleanArray . copyOfRange ( fromIndex : Int , toIndex : Int ) : BooleanArray","body":"{ AbstractList . checkRangeIndexes ( fromIndex , toIndex , size ) return withType ( \"\" , this . asDynamic ( ) . slice ( fromIndex , toIndex ) ) }","docstring":"/**\n * Returns a new array which is a copy of the specified range of the original array.\n * \n * @param fromIndex the start of the range (inclusive) to copy.\n * @param toIndex the end of the range (exclusive) to copy.\n * \n * @throws IndexOutOfBoundsException if [fromIndex] is less than zero or [toIndex] is greater than the size of this array.\n * @throws IllegalArgumentException if [fromIndex] is greater than [toIndex].\n */"} {"signature":"public actual fun CharArray . copyOfRange ( fromIndex : Int , toIndex : Int ) : CharArray","body":"{ AbstractList . checkRangeIndexes ( fromIndex , toIndex , size ) return withType ( \"\" , this . asDynamic ( ) . slice ( fromIndex , toIndex ) ) }","docstring":"/**\n * Returns a new array which is a copy of the specified range of the original array.\n * \n * @param fromIndex the start of the range (inclusive) to copy.\n * @param toIndex the end of the range (exclusive) to copy.\n * \n * @throws IndexOutOfBoundsException if [fromIndex] is less than zero or [toIndex] is greater than the size of this array.\n * @throws IllegalArgumentException if [fromIndex] is greater than [toIndex].\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ Suppress ( \"\" ) public actual fun < T > Array < T > . fill ( element : T , fromIndex : Int = , toIndex : Int = size ) : Unit","body":"{ AbstractList . checkRangeIndexes ( fromIndex , toIndex , size ) nativeFill ( element , fromIndex , toIndex ) }","docstring":"/**\n * Fills this array or its subrange with the specified [element] value.\n * \n * @param fromIndex the start of the range (inclusive) to fill, 0 by default.\n * @param toIndex the end of the range (exclusive) to fill, size of this array by default.\n * \n * @throws IndexOutOfBoundsException if [fromIndex] is less than zero or [toIndex] is greater than the size of this array.\n * @throws IllegalArgumentException if [fromIndex] is greater than [toIndex].\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ Suppress ( \"\" ) public actual fun ByteArray . fill ( element : Byte , fromIndex : Int = , toIndex : Int = size ) : Unit","body":"{ AbstractList . checkRangeIndexes ( fromIndex , toIndex , size ) nativeFill ( element , fromIndex , toIndex ) }","docstring":"/**\n * Fills this array or its subrange with the specified [element] value.\n * \n * @param fromIndex the start of the range (inclusive) to fill, 0 by default.\n * @param toIndex the end of the range (exclusive) to fill, size of this array by default.\n * \n * @throws IndexOutOfBoundsException if [fromIndex] is less than zero or [toIndex] is greater than the size of this array.\n * @throws IllegalArgumentException if [fromIndex] is greater than [toIndex].\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ Suppress ( \"\" ) public actual fun ShortArray . fill ( element : Short , fromIndex : Int = , toIndex : Int = size ) : Unit","body":"{ AbstractList . checkRangeIndexes ( fromIndex , toIndex , size ) nativeFill ( element , fromIndex , toIndex ) }","docstring":"/**\n * Fills this array or its subrange with the specified [element] value.\n * \n * @param fromIndex the start of the range (inclusive) to fill, 0 by default.\n * @param toIndex the end of the range (exclusive) to fill, size of this array by default.\n * \n * @throws IndexOutOfBoundsException if [fromIndex] is less than zero or [toIndex] is greater than the size of this array.\n * @throws IllegalArgumentException if [fromIndex] is greater than [toIndex].\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ Suppress ( \"\" ) public actual fun IntArray . fill ( element : Int , fromIndex : Int = , toIndex : Int = size ) : Unit","body":"{ AbstractList . checkRangeIndexes ( fromIndex , toIndex , size ) nativeFill ( element , fromIndex , toIndex ) }","docstring":"/**\n * Fills this array or its subrange with the specified [element] value.\n * \n * @param fromIndex the start of the range (inclusive) to fill, 0 by default.\n * @param toIndex the end of the range (exclusive) to fill, size of this array by default.\n * \n * @throws IndexOutOfBoundsException if [fromIndex] is less than zero or [toIndex] is greater than the size of this array.\n * @throws IllegalArgumentException if [fromIndex] is greater than [toIndex].\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ Suppress ( \"\" ) public actual fun LongArray . fill ( element : Long , fromIndex : Int = , toIndex : Int = size ) : Unit","body":"{ AbstractList . checkRangeIndexes ( fromIndex , toIndex , size ) nativeFill ( element , fromIndex , toIndex ) }","docstring":"/**\n * Fills this array or its subrange with the specified [element] value.\n * \n * @param fromIndex the start of the range (inclusive) to fill, 0 by default.\n * @param toIndex the end of the range (exclusive) to fill, size of this array by default.\n * \n * @throws IndexOutOfBoundsException if [fromIndex] is less than zero or [toIndex] is greater than the size of this array.\n * @throws IllegalArgumentException if [fromIndex] is greater than [toIndex].\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ Suppress ( \"\" ) public actual fun FloatArray . fill ( element : Float , fromIndex : Int = , toIndex : Int = size ) : Unit","body":"{ AbstractList . checkRangeIndexes ( fromIndex , toIndex , size ) nativeFill ( element , fromIndex , toIndex ) }","docstring":"/**\n * Fills this array or its subrange with the specified [element] value.\n * \n * @param fromIndex the start of the range (inclusive) to fill, 0 by default.\n * @param toIndex the end of the range (exclusive) to fill, size of this array by default.\n * \n * @throws IndexOutOfBoundsException if [fromIndex] is less than zero or [toIndex] is greater than the size of this array.\n * @throws IllegalArgumentException if [fromIndex] is greater than [toIndex].\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ Suppress ( \"\" ) public actual fun DoubleArray . fill ( element : Double , fromIndex : Int = , toIndex : Int = size ) : Unit","body":"{ AbstractList . checkRangeIndexes ( fromIndex , toIndex , size ) nativeFill ( element , fromIndex , toIndex ) }","docstring":"/**\n * Fills this array or its subrange with the specified [element] value.\n * \n * @param fromIndex the start of the range (inclusive) to fill, 0 by default.\n * @param toIndex the end of the range (exclusive) to fill, size of this array by default.\n * \n * @throws IndexOutOfBoundsException if [fromIndex] is less than zero or [toIndex] is greater than the size of this array.\n * @throws IllegalArgumentException if [fromIndex] is greater than [toIndex].\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ Suppress ( \"\" ) public actual fun BooleanArray . fill ( element : Boolean , fromIndex : Int = , toIndex : Int = size ) : Unit","body":"{ AbstractList . checkRangeIndexes ( fromIndex , toIndex , size ) nativeFill ( element , fromIndex , toIndex ) }","docstring":"/**\n * Fills this array or its subrange with the specified [element] value.\n * \n * @param fromIndex the start of the range (inclusive) to fill, 0 by default.\n * @param toIndex the end of the range (exclusive) to fill, size of this array by default.\n * \n * @throws IndexOutOfBoundsException if [fromIndex] is less than zero or [toIndex] is greater than the size of this array.\n * @throws IllegalArgumentException if [fromIndex] is greater than [toIndex].\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ Suppress ( \"\" ) public actual fun CharArray . fill ( element : Char , fromIndex : Int = , toIndex : Int = size ) : Unit","body":"{ AbstractList . checkRangeIndexes ( fromIndex , toIndex , size ) nativeFill ( element . code , fromIndex , toIndex ) }","docstring":"/**\n * Fills this array or its subrange with the specified [element] value.\n * \n * @param fromIndex the start of the range (inclusive) to fill, 0 by default.\n * @param toIndex the end of the range (exclusive) to fill, size of this array by default.\n * \n * @throws IndexOutOfBoundsException if [fromIndex] is less than zero or [toIndex] is greater than the size of this array.\n * @throws IllegalArgumentException if [fromIndex] is greater than [toIndex].\n */"} {"signature":"@ Suppress ( \"\" , \"\" ) public actual inline operator fun < T > Array < out T > . plus ( element : T ) : Array < T >","body":"{ return this . asDynamic ( ) . concat ( arrayOf ( element ) ) }","docstring":"/**\n * Returns an array containing all elements of the original array and then the given [element].\n */"} {"signature":"@ Suppress ( \"\" ) public actual inline operator fun ByteArray . plus ( element : Byte ) : ByteArray","body":"{ return plus ( byteArrayOf ( element ) ) }","docstring":"/**\n * Returns an array containing all elements of the original array and then the given [element].\n */"} {"signature":"@ Suppress ( \"\" ) public actual inline operator fun ShortArray . plus ( element : Short ) : ShortArray","body":"{ return plus ( shortArrayOf ( element ) ) }","docstring":"/**\n * Returns an array containing all elements of the original array and then the given [element].\n */"} {"signature":"@ Suppress ( \"\" ) public actual inline operator fun IntArray . plus ( element : Int ) : IntArray","body":"{ return plus ( intArrayOf ( element ) ) }","docstring":"/**\n * Returns an array containing all elements of the original array and then the given [element].\n */"} {"signature":"@ Suppress ( \"\" ) public actual inline operator fun LongArray . plus ( element : Long ) : LongArray","body":"{ return plus ( longArrayOf ( element ) ) }","docstring":"/**\n * Returns an array containing all elements of the original array and then the given [element].\n */"} {"signature":"@ Suppress ( \"\" ) public actual inline operator fun FloatArray . plus ( element : Float ) : FloatArray","body":"{ return plus ( floatArrayOf ( element ) ) }","docstring":"/**\n * Returns an array containing all elements of the original array and then the given [element].\n */"} {"signature":"@ Suppress ( \"\" ) public actual inline operator fun DoubleArray . plus ( element : Double ) : DoubleArray","body":"{ return plus ( doubleArrayOf ( element ) ) }","docstring":"/**\n * Returns an array containing all elements of the original array and then the given [element].\n */"} {"signature":"@ Suppress ( \"\" ) public actual inline operator fun BooleanArray . plus ( element : Boolean ) : BooleanArray","body":"{ return plus ( booleanArrayOf ( element ) ) }","docstring":"/**\n * Returns an array containing all elements of the original array and then the given [element].\n */"} {"signature":"@ Suppress ( \"\" ) public actual inline operator fun CharArray . plus ( element : Char ) : CharArray","body":"{ return plus ( charArrayOf ( element ) ) }","docstring":"/**\n * Returns an array containing all elements of the original array and then the given [element].\n */"} {"signature":"@ Suppress ( \"\" ) public actual operator fun < T > Array < out T > . plus ( elements : Collection < T > ) : Array < T >","body":"{ return arrayPlusCollection ( this , elements ) }","docstring":"/**\n * Returns an array containing all elements of the original array and then all elements of the given [elements] collection.\n */"} {"signature":"public actual operator fun ByteArray . plus ( elements : Collection < Byte > ) : ByteArray","body":"{ var index = size val result = this . copyOf ( size + elements . size ) for ( element in elements ) result [ index ++ ] = element return result }","docstring":"/**\n * Returns an array containing all elements of the original array and then all elements of the given [elements] collection.\n */"} {"signature":"public actual operator fun ShortArray . plus ( elements : Collection < Short > ) : ShortArray","body":"{ var index = size val result = this . copyOf ( size + elements . size ) for ( element in elements ) result [ index ++ ] = element return result }","docstring":"/**\n * Returns an array containing all elements of the original array and then all elements of the given [elements] collection.\n */"} {"signature":"public actual operator fun IntArray . plus ( elements : Collection < Int > ) : IntArray","body":"{ var index = size val result = this . copyOf ( size + elements . size ) for ( element in elements ) result [ index ++ ] = element return result }","docstring":"/**\n * Returns an array containing all elements of the original array and then all elements of the given [elements] collection.\n */"} {"signature":"public actual operator fun LongArray . plus ( elements : Collection < Long > ) : LongArray","body":"{ return arrayPlusCollection ( this , elements ) }","docstring":"/**\n * Returns an array containing all elements of the original array and then all elements of the given [elements] collection.\n */"} {"signature":"public actual operator fun FloatArray . plus ( elements : Collection < Float > ) : FloatArray","body":"{ var index = size val result = this . copyOf ( size + elements . size ) for ( element in elements ) result [ index ++ ] = element return result }","docstring":"/**\n * Returns an array containing all elements of the original array and then all elements of the given [elements] collection.\n */"} {"signature":"public actual operator fun DoubleArray . plus ( elements : Collection < Double > ) : DoubleArray","body":"{ var index = size val result = this . copyOf ( size + elements . size ) for ( element in elements ) result [ index ++ ] = element return result }","docstring":"/**\n * Returns an array containing all elements of the original array and then all elements of the given [elements] collection.\n */"} {"signature":"public actual operator fun BooleanArray . plus ( elements : Collection < Boolean > ) : BooleanArray","body":"{ return arrayPlusCollection ( this , elements ) }","docstring":"/**\n * Returns an array containing all elements of the original array and then all elements of the given [elements] collection.\n */"} {"signature":"public actual operator fun CharArray . plus ( elements : Collection < Char > ) : CharArray","body":"{ var index = size val result = this . copyOf ( size + elements . size ) for ( element in elements ) result [ index ++ ] = element return result }","docstring":"/**\n * Returns an array containing all elements of the original array and then all elements of the given [elements] collection.\n */"} {"signature":"@ Suppress ( \"\" , \"\" ) public actual inline operator fun < T > Array < out T > . plus ( elements : Array < out T > ) : Array < T >","body":"{ return this . asDynamic ( ) . concat ( elements ) }","docstring":"/**\n * Returns an array containing all elements of the original array and then all elements of the given [elements] array.\n */"} {"signature":"@ Suppress ( \"\" ) public actual inline operator fun ByteArray . plus ( elements : ByteArray ) : ByteArray","body":"{ return primitiveArrayConcat ( this , elements ) }","docstring":"/**\n * Returns an array containing all elements of the original array and then all elements of the given [elements] array.\n */"} {"signature":"@ Suppress ( \"\" ) public actual inline operator fun ShortArray . plus ( elements : ShortArray ) : ShortArray","body":"{ return primitiveArrayConcat ( this , elements ) }","docstring":"/**\n * Returns an array containing all elements of the original array and then all elements of the given [elements] array.\n */"} {"signature":"@ Suppress ( \"\" ) public actual inline operator fun IntArray . plus ( elements : IntArray ) : IntArray","body":"{ return primitiveArrayConcat ( this , elements ) }","docstring":"/**\n * Returns an array containing all elements of the original array and then all elements of the given [elements] array.\n */"} {"signature":"@ Suppress ( \"\" ) public actual inline operator fun LongArray . plus ( elements : LongArray ) : LongArray","body":"{ return primitiveArrayConcat ( this , elements ) }","docstring":"/**\n * Returns an array containing all elements of the original array and then all elements of the given [elements] array.\n */"} {"signature":"@ Suppress ( \"\" ) public actual inline operator fun FloatArray . plus ( elements : FloatArray ) : FloatArray","body":"{ return primitiveArrayConcat ( this , elements ) }","docstring":"/**\n * Returns an array containing all elements of the original array and then all elements of the given [elements] array.\n */"} {"signature":"@ Suppress ( \"\" ) public actual inline operator fun DoubleArray . plus ( elements : DoubleArray ) : DoubleArray","body":"{ return primitiveArrayConcat ( this , elements ) }","docstring":"/**\n * Returns an array containing all elements of the original array and then all elements of the given [elements] array.\n */"} {"signature":"@ Suppress ( \"\" ) public actual inline operator fun BooleanArray . plus ( elements : BooleanArray ) : BooleanArray","body":"{ return primitiveArrayConcat ( this , elements ) }","docstring":"/**\n * Returns an array containing all elements of the original array and then all elements of the given [elements] array.\n */"} {"signature":"@ Suppress ( \"\" ) public actual inline operator fun CharArray . plus ( elements : CharArray ) : CharArray","body":"{ return primitiveArrayConcat ( this , elements ) }","docstring":"/**\n * Returns an array containing all elements of the original array and then all elements of the given [elements] array.\n */"} {"signature":"@ Suppress ( \"\" , \"\" ) public actual inline fun < T > Array < out T > . plusElement ( element : T ) : Array < T >","body":"{ return this . asDynamic ( ) . concat ( arrayOf ( element ) ) }","docstring":"/**\n * Returns an array containing all elements of the original array and then the given [element].\n */"} {"signature":"public actual fun IntArray . sort ( ) : Unit","body":"{ nativeSort ( ) }","docstring":"/**\n * Sorts the array in-place.\n * \n * @sample samples.collections.Arrays.Sorting.sortArray\n */"} {"signature":"public actual fun LongArray . sort ( ) : Unit","body":"{ @ Suppress ( \"\" ) if ( size > ) sort { a : Long , b : Long -> a . compareTo ( b ) } }","docstring":"/**\n * Sorts the array in-place.\n * \n * @sample samples.collections.Arrays.Sorting.sortArray\n */"} {"signature":"public actual fun ByteArray . sort ( ) : Unit","body":"{ nativeSort ( ) }","docstring":"/**\n * Sorts the array in-place.\n * \n * @sample samples.collections.Arrays.Sorting.sortArray\n */"} {"signature":"public actual fun ShortArray . sort ( ) : Unit","body":"{ nativeSort ( ) }","docstring":"/**\n * Sorts the array in-place.\n * \n * @sample samples.collections.Arrays.Sorting.sortArray\n */"} {"signature":"public actual fun DoubleArray . sort ( ) : Unit","body":"{ nativeSort ( ) }","docstring":"/**\n * Sorts the array in-place.\n * \n * @sample samples.collections.Arrays.Sorting.sortArray\n */"} {"signature":"public actual fun FloatArray . sort ( ) : Unit","body":"{ nativeSort ( ) }","docstring":"/**\n * Sorts the array in-place.\n * \n * @sample samples.collections.Arrays.Sorting.sortArray\n */"} {"signature":"public actual fun CharArray . sort ( ) : Unit","body":"{ nativeSort ( :: primitiveCompareTo ) }","docstring":"/**\n * Sorts the array in-place.\n * \n * @sample samples.collections.Arrays.Sorting.sortArray\n */"} {"signature":"public actual fun < T : Comparable < T > > Array < out T > . sort ( ) : Unit","body":"{ if ( size > ) sortArray ( this ) }","docstring":"/**\n * Sorts the array in-place according to the natural order of its elements.\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.Arrays.Sorting.sortArrayOfComparable\n */"} {"signature":"@ Deprecated ( \"\" , ReplaceWith ( \"\" ) ) @ DeprecatedSinceKotlin ( warningSince = \"\" ) public fun < T > Array < out T > . sort ( comparison : ( a : T , b : T ) -> Int ) : Unit","body":"{ if ( size > ) sortArrayWith ( this , comparison ) }","docstring":"/**\n * Sorts the array in-place according to the order specified by the given [comparison] function.\n * \n * The sort is _stable_. It means that equal elements preserve their order relative to each other after sorting.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ Suppress ( \"\" ) public actual fun < T : Comparable < T > > Array < out T > . sort ( fromIndex : Int = , toIndex : Int = size ) : Unit","body":"{ AbstractList . checkRangeIndexes ( fromIndex , toIndex , size ) sortArrayWith ( this , fromIndex , toIndex , naturalOrder ( ) ) }","docstring":"/**\n * Sorts a range in the array in-place.\n * \n * The sort is _stable_. It means that equal elements preserve their order relative to each other after sorting.\n * \n * @param fromIndex the start of the range (inclusive) to sort, 0 by default.\n * @param toIndex the end of the range (exclusive) to sort, size of this array by default.\n * \n * @throws IndexOutOfBoundsException if [fromIndex] is less than zero or [toIndex] is greater than the size of this array.\n * @throws IllegalArgumentException if [fromIndex] is greater than [toIndex].\n * \n * @sample samples.collections.Arrays.Sorting.sortRangeOfArrayOfComparable\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ Suppress ( \"\" ) public actual fun ByteArray . sort ( fromIndex : Int = , toIndex : Int = size ) : Unit","body":"{ AbstractList . checkRangeIndexes ( fromIndex , toIndex , size ) val subarray = this . asDynamic ( ) . subarray ( fromIndex , toIndex ) . unsafeCast < ByteArray > ( ) subarray . sort ( ) }","docstring":"/**\n * Sorts a range in the array in-place.\n * \n * @param fromIndex the start of the range (inclusive) to sort, 0 by default.\n * @param toIndex the end of the range (exclusive) to sort, size of this array by default.\n * \n * @throws IndexOutOfBoundsException if [fromIndex] is less than zero or [toIndex] is greater than the size of this array.\n * @throws IllegalArgumentException if [fromIndex] is greater than [toIndex].\n * \n * @sample samples.collections.Arrays.Sorting.sortRangeOfArray\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ Suppress ( \"\" ) public actual fun ShortArray . sort ( fromIndex : Int = , toIndex : Int = size ) : Unit","body":"{ AbstractList . checkRangeIndexes ( fromIndex , toIndex , size ) val subarray = this . asDynamic ( ) . subarray ( fromIndex , toIndex ) . unsafeCast < ShortArray > ( ) subarray . sort ( ) }","docstring":"/**\n * Sorts a range in the array in-place.\n * \n * @param fromIndex the start of the range (inclusive) to sort, 0 by default.\n * @param toIndex the end of the range (exclusive) to sort, size of this array by default.\n * \n * @throws IndexOutOfBoundsException if [fromIndex] is less than zero or [toIndex] is greater than the size of this array.\n * @throws IllegalArgumentException if [fromIndex] is greater than [toIndex].\n * \n * @sample samples.collections.Arrays.Sorting.sortRangeOfArray\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ Suppress ( \"\" ) public actual fun IntArray . sort ( fromIndex : Int = , toIndex : Int = size ) : Unit","body":"{ AbstractList . checkRangeIndexes ( fromIndex , toIndex , size ) val subarray = this . asDynamic ( ) . subarray ( fromIndex , toIndex ) . unsafeCast < IntArray > ( ) subarray . sort ( ) }","docstring":"/**\n * Sorts a range in the array in-place.\n * \n * @param fromIndex the start of the range (inclusive) to sort, 0 by default.\n * @param toIndex the end of the range (exclusive) to sort, size of this array by default.\n * \n * @throws IndexOutOfBoundsException if [fromIndex] is less than zero or [toIndex] is greater than the size of this array.\n * @throws IllegalArgumentException if [fromIndex] is greater than [toIndex].\n * \n * @sample samples.collections.Arrays.Sorting.sortRangeOfArray\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ Suppress ( \"\" ) public actual fun LongArray . sort ( fromIndex : Int = , toIndex : Int = size ) : Unit","body":"{ AbstractList . checkRangeIndexes ( fromIndex , toIndex , size ) sortArrayWith ( this . unsafeCast < Array < Long > > ( ) , fromIndex , toIndex , naturalOrder ( ) ) }","docstring":"/**\n * Sorts a range in the array in-place.\n * \n * @param fromIndex the start of the range (inclusive) to sort, 0 by default.\n * @param toIndex the end of the range (exclusive) to sort, size of this array by default.\n * \n * @throws IndexOutOfBoundsException if [fromIndex] is less than zero or [toIndex] is greater than the size of this array.\n * @throws IllegalArgumentException if [fromIndex] is greater than [toIndex].\n * \n * @sample samples.collections.Arrays.Sorting.sortRangeOfArray\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ Suppress ( \"\" ) public actual fun FloatArray . sort ( fromIndex : Int = , toIndex : Int = size ) : Unit","body":"{ AbstractList . checkRangeIndexes ( fromIndex , toIndex , size ) val subarray = this . asDynamic ( ) . subarray ( fromIndex , toIndex ) . unsafeCast < FloatArray > ( ) subarray . sort ( ) }","docstring":"/**\n * Sorts a range in the array in-place.\n * \n * @param fromIndex the start of the range (inclusive) to sort, 0 by default.\n * @param toIndex the end of the range (exclusive) to sort, size of this array by default.\n * \n * @throws IndexOutOfBoundsException if [fromIndex] is less than zero or [toIndex] is greater than the size of this array.\n * @throws IllegalArgumentException if [fromIndex] is greater than [toIndex].\n * \n * @sample samples.collections.Arrays.Sorting.sortRangeOfArray\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ Suppress ( \"\" ) public actual fun DoubleArray . sort ( fromIndex : Int = , toIndex : Int = size ) : Unit","body":"{ AbstractList . checkRangeIndexes ( fromIndex , toIndex , size ) val subarray = this . asDynamic ( ) . subarray ( fromIndex , toIndex ) . unsafeCast < DoubleArray > ( ) subarray . sort ( ) }","docstring":"/**\n * Sorts a range in the array in-place.\n * \n * @param fromIndex the start of the range (inclusive) to sort, 0 by default.\n * @param toIndex the end of the range (exclusive) to sort, size of this array by default.\n * \n * @throws IndexOutOfBoundsException if [fromIndex] is less than zero or [toIndex] is greater than the size of this array.\n * @throws IllegalArgumentException if [fromIndex] is greater than [toIndex].\n * \n * @sample samples.collections.Arrays.Sorting.sortRangeOfArray\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ Suppress ( \"\" ) public actual fun CharArray . sort ( fromIndex : Int = , toIndex : Int = size ) : Unit","body":"{ AbstractList . checkRangeIndexes ( fromIndex , toIndex , size ) sortArrayWith ( this . unsafeCast < Array < Char > > ( ) , fromIndex , toIndex , naturalOrder ( ) ) }","docstring":"/**\n * Sorts a range in the array in-place.\n * \n * @param fromIndex the start of the range (inclusive) to sort, 0 by default.\n * @param toIndex the end of the range (exclusive) to sort, size of this array by default.\n * \n * @throws IndexOutOfBoundsException if [fromIndex] is less than zero or [toIndex] is greater than the size of this array.\n * @throws IllegalArgumentException if [fromIndex] is greater than [toIndex].\n * \n * @sample samples.collections.Arrays.Sorting.sortRangeOfArray\n */"} {"signature":"@ Deprecated ( \"\" ) @ DeprecatedSinceKotlin ( warningSince = \"\" ) @ kotlin . internal . InlineOnly public inline fun ByteArray . sort ( noinline comparison : ( a : Byte , b : Byte ) -> Int ) : Unit","body":"{ nativeSort ( comparison ) }","docstring":"/**\n * Sorts the array in-place according to the order specified by the given [comparison] function.\n */"} {"signature":"@ Deprecated ( \"\" ) @ DeprecatedSinceKotlin ( warningSince = \"\" ) @ kotlin . internal . InlineOnly public inline fun ShortArray . sort ( noinline comparison : ( a : Short , b : Short ) -> Int ) : Unit","body":"{ nativeSort ( comparison ) }","docstring":"/**\n * Sorts the array in-place according to the order specified by the given [comparison] function.\n */"} {"signature":"@ Deprecated ( \"\" ) @ DeprecatedSinceKotlin ( warningSince = \"\" ) @ kotlin . internal . InlineOnly public inline fun IntArray . sort ( noinline comparison : ( a : Int , b : Int ) -> Int ) : Unit","body":"{ nativeSort ( comparison ) }","docstring":"/**\n * Sorts the array in-place according to the order specified by the given [comparison] function.\n */"} {"signature":"@ Deprecated ( \"\" ) @ DeprecatedSinceKotlin ( warningSince = \"\" ) @ kotlin . internal . InlineOnly public inline fun LongArray . sort ( noinline comparison : ( a : Long , b : Long ) -> Int ) : Unit","body":"{ nativeSort ( comparison ) }","docstring":"/**\n * Sorts the array in-place according to the order specified by the given [comparison] function.\n */"} {"signature":"@ Deprecated ( \"\" ) @ DeprecatedSinceKotlin ( warningSince = \"\" ) @ kotlin . internal . InlineOnly public inline fun FloatArray . sort ( noinline comparison : ( a : Float , b : Float ) -> Int ) : Unit","body":"{ nativeSort ( comparison ) }","docstring":"/**\n * Sorts the array in-place according to the order specified by the given [comparison] function.\n */"} {"signature":"@ Deprecated ( \"\" ) @ DeprecatedSinceKotlin ( warningSince = \"\" ) @ kotlin . internal . InlineOnly public inline fun DoubleArray . sort ( noinline comparison : ( a : Double , b : Double ) -> Int ) : Unit","body":"{ nativeSort ( comparison ) }","docstring":"/**\n * Sorts the array in-place according to the order specified by the given [comparison] function.\n */"} {"signature":"@ Deprecated ( \"\" ) @ DeprecatedSinceKotlin ( warningSince = \"\" ) @ kotlin . internal . InlineOnly public inline fun CharArray . sort ( noinline comparison : ( a : Char , b : Char ) -> Int ) : Unit","body":"{ nativeSort ( comparison ) }","docstring":"/**\n * Sorts the array in-place according to the order specified by the given [comparison] function.\n */"} {"signature":"public actual fun < T > Array < out T > . sortWith ( comparator : Comparator < in T > ) : Unit","body":"{ if ( size > ) sortArrayWith ( this , comparator ) }","docstring":"/**\n * Sorts the array in-place according to the order specified by the given [comparator].\n * \n * The sort is _stable_. It means that equal elements preserve their order relative to each other after sorting.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ Suppress ( \"\" ) public actual fun < T > Array < out T > . sortWith ( comparator : Comparator < in T > , fromIndex : Int = , toIndex : Int = size ) : Unit","body":"{ AbstractList . checkRangeIndexes ( fromIndex , toIndex , size ) sortArrayWith ( this , fromIndex , toIndex , comparator ) }","docstring":"/**\n * Sorts a range in the array in-place with the given [comparator].\n * \n * The sort is _stable_. It means that equal elements preserve their order relative to each other after sorting.\n * \n * @param fromIndex the start of the range (inclusive) to sort, 0 by default.\n * @param toIndex the end of the range (exclusive) to sort, size of this array by default.\n * \n * @throws IndexOutOfBoundsException if [fromIndex] is less than zero or [toIndex] is greater than the size of this array.\n * @throws IllegalArgumentException if [fromIndex] is greater than [toIndex].\n */"} {"signature":"public actual fun ByteArray . toTypedArray ( ) : Array < Byte >","body":"{ return js ( \"\" ) . slice . call ( this ) }","docstring":"/**\n * Returns a *typed* object array containing all of the elements of this primitive array.\n */"} {"signature":"public actual fun ShortArray . toTypedArray ( ) : Array < Short >","body":"{ return js ( \"\" ) . slice . call ( this ) }","docstring":"/**\n * Returns a *typed* object array containing all of the elements of this primitive array.\n */"} {"signature":"public actual fun IntArray . toTypedArray ( ) : Array < Int >","body":"{ return js ( \"\" ) . slice . call ( this ) }","docstring":"/**\n * Returns a *typed* object array containing all of the elements of this primitive array.\n */"} {"signature":"public actual fun LongArray . toTypedArray ( ) : Array < Long >","body":"{ return js ( \"\" ) . slice . call ( this ) }","docstring":"/**\n * Returns a *typed* object array containing all of the elements of this primitive array.\n */"} {"signature":"public actual fun FloatArray . toTypedArray ( ) : Array < Float >","body":"{ return js ( \"\" ) . slice . call ( this ) }","docstring":"/**\n * Returns a *typed* object array containing all of the elements of this primitive array.\n */"} {"signature":"public actual fun DoubleArray . toTypedArray ( ) : Array < Double >","body":"{ return js ( \"\" ) . slice . call ( this ) }","docstring":"/**\n * Returns a *typed* object array containing all of the elements of this primitive array.\n */"} {"signature":"public actual fun BooleanArray . toTypedArray ( ) : Array < Boolean >","body":"{ return js ( \"\" ) . slice . call ( this ) }","docstring":"/**\n * Returns a *typed* object array containing all of the elements of this primitive array.\n */"} {"signature":"public actual fun CharArray . toTypedArray ( ) : Array < Char >","body":"{ return Array ( size ) { index -> this [ index ] } }","docstring":"/**\n * Returns a *typed* object array containing all of the elements of this primitive array.\n */"} {"signature":"@ SinceKotlin ( \"\" ) public actual fun < T , K > Grouping < T , K > . eachCount ( ) : Map < K , Int >","body":"= fold ( ) { acc , _ -> acc + }","docstring":"/**\n * Groups elements from the [Grouping] source by key and counts elements in each group.\n *\n * @return a [Map] associating the key of each group with the count of elements in the group.\n *\n * @sample samples.collections.Grouping.groupingByEachCount\n */"} {"signature":"fun canBeEvaluatedAtCompileTime ( expression : FirExpression ? , session : FirSession , allowErrors : Boolean , calledOnCheckerStage : Boolean , ) : Boolean","body":"{ val result = computeConstantExpressionKind ( expression , session , calledOnCheckerStage ) return result == ConstantArgumentKind . VALID_CONST || allowErrors && result == ConstantArgumentKind . RESOLUTION_ERROR }","docstring":"/**\n * See the documentation to [computeConstantExpressionKind] function below\n */"} {"signature":"fun computeConstantExpressionKind ( expression : FirExpression ? , session : FirSession , calledOnCheckerStage : Boolean ) : ConstantArgumentKind","body":"{ if ( expression == null ) return ConstantArgumentKind . RESOLUTION_ERROR return expression . accept ( FirConstCheckVisitor ( session , calledOnCheckerStage ) , null ) }","docstring":"/**\n * This function computes if given [expression] can be counted as a constant expression or not\n * It returns a [ConstantArgumentKind], which can be used to understand why exactly the expression is not constant\n *\n * Precise computation of this [ConstantArgumentKind] may require resolution of initializer of non-const properties, which is allowed\n * to do only on BODY_RESOLVE phase and checkers phase. Without it, the result may be less precise but still correct (it may return\n * the general [ConstantArgumentKind.NOT_CONST] instead more specific [ConstantArgumentKind.NOT_KCLASS_LITERAL] for example)\n *\n * So, to allow using this function not only from checkers there is a @param [calledOnCheckerStage], which should be set to [true] ONLY\n * if this method is called from checkers\n */"} {"signature":"public inline fun < reified T : Node > forEach ( block : ( T ) -> Unit )","body":"{ var cur : Node = _next while ( cur != this ) { if ( cur is T ) block ( cur ) cur = cur . _next } }","docstring":"/**\n * Iterates over all elements in this list of a specified type.\n */"} {"signature":"fun main ( )","body":"{ val ( train , _ ) = mnist ( ) val inferenceModel = TensorFlowInferenceModel . load ( File ( PATH_TO_MODEL ) , loadOptimizerState = true ) var copiedInferenceModel : TensorFlowInferenceModel inferenceModel . use { var accuracy = val amountOfTestSet = for ( imageId in .. amountOfTestSet ) { val prediction = it . predict ( train . getX ( imageId ) ) if ( prediction == train . getY ( imageId ) . toInt ( ) ) accuracy += ( / amountOfTestSet ) } println ( \"\" ) copiedInferenceModel = inferenceModel . copy ( \"\" ) } copiedInferenceModel . use { var accuracy = val amountOfTestSet = for ( imageId in .. amountOfTestSet ) { val prediction = it . predict ( train . getX ( imageId ) ) if ( prediction == train . getY ( imageId ) . toInt ( ) ) accuracy += ( / amountOfTestSet ) } println ( \"\" ) } }","docstring":"/**\n * Inference model is used here,\n * separately from model training code to illustrate the ability\n * to load model graph and weights to start prediction process.\n *\n * After loading and evaluation, the Inference model is copied and evaluated again.\n *\n * NOTE: The example requires the saved model in the appropriate directory (run [lenetOnMnistDatasetExportImportToTxt] firstly).\n */"} {"signature":"fun getSmartCastVariantsExcludingReceiver ( context : ResolutionContext < * > , receiverToCast : ReceiverValue ) : Collection < KotlinType >","body":"{ return getSmartCastVariantsExcludingReceiver ( context . trace . bindingContext , context . scope . ownerDescriptor , context . dataFlowInfo , receiverToCast , context . languageVersionSettings , context . dataFlowValueFactory ) }","docstring":"/**\n * @return variants @param receiverToCast may be cast to according to context dataFlowInfo, receiverToCast itself is NOT included\n */"} {"signature":"private fun getSmartCastVariantsExcludingReceiver ( bindingContext : BindingContext , containingDeclarationOrModule : DeclarationDescriptor , dataFlowInfo : DataFlowInfo , receiverToCast : ReceiverValue , languageVersionSettings : LanguageVersionSettings , dataFlowValueFactory : DataFlowValueFactory ) : Collection < KotlinType >","body":"{ val dataFlowValue = dataFlowValueFactory . createDataFlowValue ( receiverToCast , bindingContext , containingDeclarationOrModule ) return dataFlowInfo . getCollectedTypes ( dataFlowValue , languageVersionSettings ) }","docstring":"/**\n * @return variants @param receiverToCast may be cast to according to @param dataFlowInfo, @param receiverToCast itself is NOT included\n */"} {"signature":"private fun initFragmentedScript ( charSeq : CharSequence = \"\" , randomCharPool : Boolean , lines : Int = charSeq . length ) : FragmentedText","body":"{ val generateFragment : FragmentedText . ( Int ) -> FragmentedText = when { randomCharPool -> { _ -> addRandomFragment ( ) } else -> { line : Int -> val index = line % charSeq . length addFragment ( charSeq [ index ] . toString ( ) . repeat ( ) ) } } return ( .. lines ) . fold ( FragmentedText ( ) ) { frag , line -> frag . generateFragment ( line ) } }","docstring":"/**\n * Generates text\n * if randomCharPool is false from charSequence\n * - for each char in [charSeq] it adds line of length of 3 to the generated text\n * if randomCharPool is true\n * - picks characters randomly, line count is [lines], line length is 28, some number bigger than alphabet size\n */"} {"signature":"internal suspend fun getCommonSourceSetsForMetadataCompilation ( project : Project ) : Set < KotlinSourceSet >","body":"{ if ( ! project . shouldCompileIntermediateSourceSetsToMetadata ) return setOf ( project . multiplatformExtension . awaitSourceSets ( ) . getByName ( KotlinSourceSet . COMMON_MAIN_SOURCE_SET_NAME ) ) val compilationsBySourceSet : Map < KotlinSourceSet , Set < KotlinCompilation < * > > > = project . kotlinExtension . awaitSourceSets ( ) . associateWith { it . internal . awaitPlatformCompilations ( ) } val sourceSetsUsedInMultipleTargets = compilationsBySourceSet . filterValues { compilations -> compilations . map { it . target . platformType } . distinct ( ) . run { size > || singleOrNull ( ) == KotlinPlatformType . native && compilations . map { it . target } . distinct ( ) . size > } } val publishedCompilations = getPublishedPlatformCompilations ( project ) . values return sourceSetsUsedInMultipleTargets . filterValues { compilations -> compilations . any { it in publishedCompilations } } . keys }","docstring":"/**\n * @return All common source sets that can potentially be published. Right now, not all combinations of platforms actually\n * support metadata compilation (see [KotlinMetadataTargetConfigurator.isMetadataCompilationSupported].\n * Those compilations will be created but the corresponding tasks will be disabled.\n */"} {"signature":"fun createStandaloneAnalysisApiSession ( tempDir : File , kotlinSourceModuleName : String = defaultKotlinSourceModuleName , kotlinSources : Map < String , String > , dependencyKlibs : List < Path > = emptyList ( ) , ) : StandaloneAnalysisAPISession","body":"{ val testModuleRoot = tempDir . resolve ( \"\" ) testModuleRoot . mkdirs ( ) kotlinSources . forEach { ( fileName , sourceCode ) -> testModuleRoot . resolve ( fileName ) . apply { writeText ( sourceCode ) } } return createStandaloneAnalysisApiSession ( kotlinSourceModuleName , listOf ( testModuleRoot ) , dependencyKlibs ) }","docstring":"/**\n * Creates a standalone analysis session from Kotlin source code passed as [kotlinSources]\n */"} {"signature":"fun createStandaloneAnalysisApiSession ( kotlinSourceModuleName : String = defaultKotlinSourceModuleName , kotlinFiles : List < File > , dependencyKlibs : List < Path > = emptyList ( ) , ) : StandaloneAnalysisAPISession","body":"{ val currentArchitectureTarget = HostManager . host val nativePlatform = NativePlatforms . nativePlatformByTargets ( listOf ( currentArchitectureTarget ) ) return buildStandaloneAnalysisAPISession { @ OptIn ( KtAnalysisApiInternals :: class ) registerProjectService ( KtLifetimeTokenProvider :: class . java , KtAlwaysAccessibleLifetimeTokenProvider ( ) ) buildKtModuleProvider { platform = nativePlatform val stdlibModule = addModule ( buildKtLibraryModule { addBinaryRoot ( Path ( kotlinNativeStdlibPath ) ) platform = nativePlatform libraryName = \"\" } ) val dependencyKlibModules = dependencyKlibs . map { klib -> buildKtLibraryModule { addBinaryRoot ( klib ) platform = nativePlatform libraryName = klib . nameWithoutExtension addRegularDependency ( stdlibModule ) } } addModule ( buildKtSourceModule { addSourceRoots ( kotlinFiles . map { it . toPath ( ) } ) addRegularDependency ( stdlibModule ) dependencyKlibModules . forEach { dependencyKlibModule -> addRegularDependency ( dependencyKlibModule ) } platform = nativePlatform moduleName = kotlinSourceModuleName } ) } } }","docstring":"/**\n * Creates a standalone analysis session from [kotlinFiles] on disk.\n * The Kotlin/Native stdlib will be provided as dependency\n */"} {"signature":"public fun merge ( providers : List < P > ) : P","body":"public fun merge ( providers : List < P > ) : P","docstring":"/**\n * Merges the given [providers] into a single provider. When possible, mergers will try to create a provider that is more efficient\n * compared to the naive sequential composite provider. Not all providers might be mergeable, or there might be multiple separate sets\n * of providers that can be merged individually, so the resulting provider may be a composite provider.\n */"} {"signature":"private fun CharSequence . findLineTerminator ( from : Int , to : Int ) : Int","body":"= ( from until to ) . firstOrNull { lineTerminator . isLineTerminator ( this [ it ] ) } ? : to","docstring":"/**\n * Find the first line terminator between [from] (inclusive) and [to] (exclusive) indices.\n * Returns [to] if no terminator found.\n */"} {"signature":"private fun findBackLineTerminator ( from : Int , to : Int , testString : CharSequence ) : Int","body":"= ( from until to ) . lastOrNull { lineTerminator . isLineTerminator ( testString [ it ] ) } ? : from - ","docstring":"/**\n * Find the first line terminator between [from] (inclusive) and [to] (exclusive) indices.\n * Returns [from - 1] if no terminator found.\n */"} {"signature":"internal fun tzdbPaths ( defaultTzdbPath : Path ? )","body":"= sequence { defaultTzdbPath ? . let { yield ( it ) } yieldAll ( listOf ( \"\" , \"\" , \"\" ) . map { Path . fromString ( it ) } ) pathToSystemDefault ( ) ? . first ? . let { yield ( it ) } }","docstring":"/** The directories checked for a valid timezone database. */"} {"signature":"private fun findResultTypeForInnerVariableIfNeeded ( provideDelegate : FirFunctionCall , candidate : Candidate ) : Pair < TypeConstructorMarker , ConeKotlinType > ?","body":"{ val returnTypeBasedOnVariable = components . typeFromCallee ( provideDelegate ) . type . let ( candidate . substitutor :: substituteOrSelf ) . unwrapTopLevelVariableType ( ) ? : return null val typeVariable = returnTypeBasedOnVariable . typeConstructor val candidateSystem = candidate . system val candidateStorage = candidateSystem . currentStorage ( ) val variableWithConstraints = candidateSystem . notFixedTypeVariables [ typeVariable ] ? : error ( \"\" ) var resultType : ConeKotlinType ? = null candidateSystem . withTypeVariablesThatAreCountedAsProperTypes ( candidateSystem . outerTypeVariables . orEmpty ( ) ) { resultType = inferenceComponents . resultTypeResolver . findResultTypeOrNull ( candidateSystem , variableWithConstraints , TypeVariableDirectionCalculator . ResolveDirection . UNKNOWN ) as? ConeKotlinType ? : return@withTypeVariablesThatAreCountedAsProperTypes check ( ! candidateStorage . hasContradiction ) { \"\" } candidateSystem . addEqualityConstraint ( returnTypeBasedOnVariable , resultType ! ! , ProvideDelegateFixationPosition ) check ( ! candidateStorage . hasContradiction ) { \"\" + \"\" } } return resultType ? . let { typeVariable to it } }","docstring":"/**\n * For supporting the case when `provideDelegate` has a signature with type variable as a return type, like\n * fun K.provideDelegate(receiver: Any?, property: kotlin.reflect.KProperty<*>): K = this\n *\n * Here, if delegate expression returns something like `Delegate` where Tv is a variable and the `Delegate` class contains\n * the member `getValue`, we need to fix `K` into `Delegate`, so that resulting `provideDelegate()` expression would have the type,\n * so we could look into its member scope (as we can't look into the member scope of `K` type variable).\n *\n * On another hand, we can't just actually fix `K` variable (or just run FULL completion there) as the current result might refer\n * other not fixed yet type variables, and we would break the contract that fixation results should not contain other type variables.\n *\n * Thus, to support exactly the case when we had to look into the member scope of `K`, we just pretend like we fixing it\n *\n * @see compiler/testData/diagnostics/tests/delegatedProperty/provideDelegate/provideDelegateResolutionWithStubTypes.kt\n *\n * In K1, it was working because we used stub types that are not counted as actual type variables, and we've been completing\n * `provideDelegate` FULLy in the context where outer type variables were stubs (thus counted as proper types).\n *\n * But in K2, we decided to get rid of the stub type concept and just stick to the type variables.\n *\n * @return K to Delegate or null in case return type of `provideDelegate` is not a type variable.\n *\n * TODO: reconsider the place where the function belong and it necessity after PCLA is implemented (KT-61740 for tracking)\n */"} {"signature":"private fun FirProperty . resolveAccessors ( mayResolveSetterBody : Boolean , shouldResolveEverything : Boolean = true , )","body":"{ resolveGetter ( shouldResolveEverything ) if ( returnTypeRef is FirImplicitTypeRef ) { storeVariableReturnType ( this ) getter ? . transformTypeWithPropertyType ( returnTypeRef , forceUpdateForNonImplicitTypes = true ) } resolveSetter ( mayResolveSetterBody , shouldResolveEverything ) }","docstring":"/**\n * Note that this function updates the return type of the property using type from setter, if the property itself had\n * an implicit return type\n *\n * In IDE there's a need to resolve setter's parameter types on the implicit-resolution stage\n * See ad183434137939a0c9eeea2f7df9ef522672a18e commit.\n * But for delegate inference case, we don't need both body of the setter and its parameter resolved (SKIP mode)\n */"} {"signature":"private fun graph ( vararg edges : Pair < Fun , Fun > )","body":"{ for ( ( from , to ) in edges ) { from . overriddenFunctions . add ( to ) } fun findAllReachableDeclarations ( from : Fun ) : MutableSet < Fun > { val handler = object : DFS . NodeHandlerWithListResult < Fun , Fun > ( ) { override fun afterChildren ( current : Fun ) { if ( current . isDeclaration ) { result . add ( current ) } } } DFS . dfs ( listOf ( from ) , { it . getOverridden ( ) } , handler ) val result = HashSet ( handler . result ( ) ) result . remove ( from ) return result } val vertices = edges . flatMapTo ( HashSet ( ) ) { pair -> listOf ( pair . first , pair . second ) } for ( vertex in vertices ) { val directConcreteSuperFunctions = vertex . overriddenFunctions . filter { ! it . isAbstract } assert ( directConcreteSuperFunctions . size <= ) { \"\" + \"\" + \"\" } if ( vertex . isDeclaration ) continue val superDeclarations = findAllReachableDeclarations ( vertex ) assert ( superDeclarations . isNotEmpty ( ) ) { \"\" } val toRemove = HashSet < Fun > ( ) for ( superDeclaration in superDeclarations ) { toRemove . addAll ( findAllReachableDeclarations ( superDeclaration ) ) } superDeclarations . removeAll ( toRemove ) val concreteDeclarations = superDeclarations . filter { ! it . isAbstract } if ( ! vertex . isAbstract ) { assert ( concreteDeclarations . isNotEmpty ( ) ) { \"\" } assert ( concreteDeclarations . size == ) { \"\" + \"\" } } } }","docstring":"/**\n * Constructs a graph out of the given pairs of vertices. First vertex should be a function in the derived class,\n * second -- the corresponding overridden function in a superclass.\n *\n * Checks that the graph satisfies the following conditions:\n * 1. Each fake override should have a super-declaration\n * 2. Each concrete fake override should have exactly one concrete super-declaration. More accurately, for each concrete\n * fake override F there is a concrete declaration D in supertypes such that every other concrete super-declaration of F\n * is either reachable from D or is reachable from any abstract super-declaration of F (or both). This condition is effectively\n * equivalent to the compiler guarantee that each class inherits not more than one implementation of each function.\n *\n * NOTE: the graph validation procedure probably doesn't cover all the possible cases compared to the analogous code in the compiler.\n * There may be bugs here and they should be fixed accordingly.\n *\n * TODO: also verify that no abstract fake override has a concrete super-declaration.\n * This was previously possible via traits with required classes.\n */"} {"signature":"fun findJvmAgentJar ( classpath : FileCollection , archiveOperations : ArchiveOperations ) : File","body":"fun findJvmAgentJar ( classpath : FileCollection , archiveOperations : ArchiveOperations ) : File","docstring":"/**\n * Find jar-file with JVM online instrumentation agent in classpath, loaded from [jvmAgentDependency].\n */"} {"signature":"fun jvmAgentArgs ( jarFile : File , tempDir : File , binReportFile : File , excludedClasses : Set < String > ) : List < String >","body":"fun jvmAgentArgs ( jarFile : File , tempDir : File , binReportFile : File , excludedClasses : Set < String > ) : List < String >","docstring":"/**\n * Generate additional JVM argument for test task.\n */"} {"signature":"fun xmlReport ( xmlFile : File , title : String , context : ReportContext )","body":"fun xmlReport ( xmlFile : File , title : String , context : ReportContext )","docstring":"/**\n * Generate XML report.\n */"} {"signature":"fun binaryReport ( binary : File , context : ReportContext )","body":"fun binaryReport ( binary : File , context : ReportContext )","docstring":"/**\n * Generate binary report in IntelliJ format (Kover-only).\n */"} {"signature":"fun htmlReport ( htmlDir : File , title : String , charset : String ? , context : ReportContext )","body":"fun htmlReport ( htmlDir : File , title : String , charset : String ? , context : ReportContext )","docstring":"/**\n * Generate HTML report.\n */"} {"signature":"fun verify ( rules : List < VerificationRule > , context : ReportContext ) : List < RuleViolations >","body":"fun verify ( rules : List < VerificationRule > , context : ReportContext ) : List < RuleViolations >","docstring":"/**\n * Perform verification.\n */"} {"signature":"fun collectCoverage ( request : CoverageRequest , outputFile : File , context : ReportContext )","body":"fun collectCoverage ( request : CoverageRequest , outputFile : File , context : ReportContext )","docstring":"/**\n * Calculate coverage according to the specified parameters [request], for each grouped entity.\n */"} {"signature":"private fun DocTag . firstParagraph ( ) : P ?","body":"{ val firstChildParagraph = children . mapNotNull { it . firstParagraph ( ) } . firstOrNull ( ) return if ( firstChildParagraph == null && this is P ) this else firstChildParagraph }","docstring":"/**\n * @return The very first, most inner paragraph. If any [P] is wrapped inside another [P], the inner one\n * is preferred.\n */"} {"signature":"@ JvmStatic fun doMain ( compiler : CLITool < * > , args : Array < String > )","body":"{ if ( System . getProperty ( \"\" ) == null ) { System . setProperty ( \"\" , \"\" ) } if ( CompilerSystemProperties . KOTLIN_COLORS_ENABLED_PROPERTY . value == null ) { CompilerSystemProperties . KOTLIN_COLORS_ENABLED_PROPERTY . value = \"\" } setupIdeaStandaloneExecution ( ) val exitCode = doMainNoExit ( compiler , args ) if ( exitCode != ExitCode . OK ) { exitProcess ( exitCode . code ) } }","docstring":"/**\n * Useful main for derived command line tools\n */"} {"signature":"fun tryConsumeNull ( doConsume : Boolean = true ) : Boolean","body":"{ var current = skipWhitespaces ( ) current = prefetchOrEof ( current ) val len = source . length - current if ( len < || current == - ) return false for ( i in .. ) { if ( NULL [ i ] != source [ current + i ] ) return false } if ( len > && charToTokenClass ( source [ current + ] ) == TC_OTHER ) return false if ( doConsume ) { currentPosition = current + } return true }","docstring":"/**\n * Tries to consume `null` token from input.\n * Returns `false` if the next 4 chars in input are not `null`,\n * `true` otherwise and consumes it if [doConsume] is `true`.\n */"} {"signature":"fun method ( )","body":"{ }","docstring":"/** method(). */"} {"signature":"fun method ( a : Int )","body":"{ }","docstring":"/** method(int). */"} {"signature":"fun method ( a : String )","body":"{ }","docstring":"/** method(String). */"} {"signature":"fun method ( )","body":"{ }","docstring":"/** method(). */"} {"signature":"fun test ( )","body":"{ }","docstring":"/** Documentation for 'test'. */"} {"signature":"public fun < T > upper ( column : ColumnReference < T > ) : PositionalMapping < T >","body":"{ return addPositionalMapping < T > ( UPPER , column . name ( ) , null ) }","docstring":"/**\n * Maps the `upper` 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 > upper ( column : KProperty < T > ) : PositionalMapping < T >","body":"{ return addPositionalMapping < T > ( UPPER , column . name , null ) }","docstring":"/**\n * Maps the `upper` 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 upper ( column : String ) : PositionalMapping < Any ? >","body":"{ return addPositionalMapping ( UPPER , column , null ) }","docstring":"/**\n * Maps the `upper` 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 > upper ( values : Iterable < T > ) : PositionalMapping < T >","body":"{ return addPositionalMapping < T > ( UPPER , values . toList ( ) , null , null ) }","docstring":"/**\n * Maps the `upper` 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 > upper ( values : DataColumn < T > ) : PositionalMapping < T >","body":"{ return addPositionalMapping < T > ( UPPER , values , null ) }","docstring":"/**\n * Maps the `upper` 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":"fun toUtcOffset ( ) : UtcOffset","body":"= UtcOffset ( seconds = totalSeconds )","docstring":"/**\n * Converts this offset to a [UtcOffset].\n *\n * @throws IllegalArgumentException if the offset is not in the range [-18 hours, +18 hours].\n */"} {"signature":"fun readIfPresent ( reader : BinaryDataReader ) : PosixTzString ?","body":"= reader . readPosixTzString ( )","docstring":"/**\n * Reads a POSIX TZ string from the [reader] if it is present, or returns `null` if it is not.\n *\n * The string format is described in https://pubs.opengroup.org/onlinepubs/9699919799/, section 8.3,\n * with additional extensions in https://datatracker.ietf.org/doc/html/rfc8536#section-3.3.1\n *\n * @throws IllegalArgumentException if the string is invalid\n * @throws IllegalStateException if the string is invalid\n */"} {"signature":"public abstract fun compile ( optimizer : Optimizer , loss : Losses , metric : Metrics )","body":"public abstract fun compile ( optimizer : Optimizer , loss : Losses , metric : Metrics )","docstring":"/**\n * Configures the model for training.\n *\n * NOTE: Set up [isModelCompiled] to True.\n *\n * @param [optimizer] Optimizer instance.\n * @param [loss] Loss function.\n * @param [metric] Metric to evaluate during training.\n */"} {"signature":"public abstract fun compile ( optimizer : Optimizer , loss : LossFunction , metric : Metric )","body":"public abstract fun compile ( optimizer : Optimizer , loss : LossFunction , metric : Metric )","docstring":"/**\n * Configures the model for training.\n *\n * NOTE: Set up [isModelCompiled] to True.\n *\n * @param [optimizer] Optimizer instance.\n * @param [loss] Loss function.\n * @param [metric] Metric to evaluate during training.\n */"} {"signature":"public abstract fun compile ( optimizer : Optimizer , loss : Losses , metric : Metric )","body":"public abstract fun compile ( optimizer : Optimizer , loss : Losses , metric : Metric )","docstring":"/**\n * Configures the model for training.\n *\n * NOTE: Set up [isModelCompiled] to True.\n *\n * @param [optimizer] Optimizer instance.\n * @param [loss] Loss function.\n * @param [metric] Metric to evaluate during training.\n */"} {"signature":"public abstract fun compile ( optimizer : Optimizer , loss : LossFunction , metric : Metrics )","body":"public abstract fun compile ( optimizer : Optimizer , loss : LossFunction , metric : Metrics )","docstring":"/**\n * Configures the model for training.\n *\n * NOTE: Set up [isModelCompiled] to True.\n *\n * @param [optimizer] Optimizer instance.\n * @param [loss] Loss function.\n * @param [metric] Metric to evaluate during training.\n */"} {"signature":"public abstract fun compile ( optimizer : Optimizer , loss : LossFunction , metrics : List < Metric > )","body":"public abstract fun compile ( optimizer : Optimizer , loss : LossFunction , metrics : List < Metric > )","docstring":"/**\n * Configures the model for training.\n *\n * NOTE: Set up [isModelCompiled] to True.\n *\n * @param [optimizer] Optimizer instance.\n * @param [loss] Loss function.\n * @param [metrics] Metrics to evaluate during training.\n */"} {"signature":"public fun fit ( dataset : Dataset , epochs : Int = , batchSize : Int = , callback : Callback ) : TrainingHistory","body":"{ return fit ( dataset , epochs , batchSize , listOf ( callback ) ) }","docstring":"/**\n * Trains the model for a fixed number of [epochs] (iterations over a dataset).\n *\n * @param [dataset] The train dataset that combines input data (X) and target data (Y).\n * @param [epochs] Number of epochs to train the model. An epoch is an iteration over the entire x and y data provided.\n * @param [batchSize] Number of samples per gradient update.\n * True (default) = Weights are initialized at the beginning of the training phase.\n * False = Weights are not initialized during training phase. It should be initialized before (via transfer learning or init() method call).\n * @param [callback] Callback to be used during training phase.\n *\n * @return A [TrainingHistory] object. Its [TrainingHistory.batchHistory] attribute is a record of training loss values and metrics values per each batch and epoch.\n */"} {"signature":"public abstract fun fit ( dataset : Dataset , epochs : Int = , batchSize : Int = , callbacks : List < Callback > = listOf ( ) ) : TrainingHistory","body":"public abstract fun fit ( dataset : Dataset , epochs : Int = , batchSize : Int = , callbacks : List < Callback > = listOf ( ) ) : TrainingHistory","docstring":"/**\n * Trains the model for a fixed number of [epochs] (iterations over a dataset).\n *\n * @param [dataset] The train dataset that combines input data (X) and target data (Y).\n * @param [epochs] Number of epochs to train the model. An epoch is an iteration over the entire x and y data provided.\n * @param [batchSize] Number of samples per gradient update.\n * True (default) = Weights are initialized at the beginning of the training phase.\n * False = Weights are not initialized during training phase. It should be initialized before (via transfer learning or init() method call).\n * @param [callbacks] Callbacks to be used during training phase.\n *\n * @return A [TrainingHistory] object. Its [TrainingHistory.batchHistory] attribute is a record of training loss values and metrics values per each batch and epoch.\n */"} {"signature":"public fun fit ( trainingDataset : Dataset , validationDataset : Dataset , epochs : Int = , trainBatchSize : Int = , validationBatchSize : Int = , callback : Callback ) : TrainingHistory","body":"{ return fit ( trainingDataset , validationDataset , epochs , trainBatchSize , validationBatchSize , listOf ( callback ) ) }","docstring":"/**\n * Trains the model for a fixed number of [epochs] (iterations over a dataset).\n *\n * @param [trainingDataset] The train dataset that combines input data (X) and target data (Y).\n * @param [validationDataset] The validation dataset that combines input data (X) and target data (Y).\n * @param [epochs] Number of epochs to train the model. An epoch is an iteration over the entire x and y data provided.\n * @param [trainBatchSize] Number of samples per gradient update.\n * @param [validationBatchSize] Number of samples per validation batch.\n * True (default) = optimizer variables are initialized at the beginning of the training phase.\n * False = optimizer variables are not initialized during training phase. It should be initialized before (via transfer learning).\n * @param [callback] Callback to be used during training phase.\n *\n * @return A [TrainingHistory] object. It contains records with training/validation loss values and metrics per each batch and epoch.\n */"} {"signature":"public abstract fun fit ( trainingDataset : Dataset , validationDataset : Dataset , epochs : Int = , trainBatchSize : Int = , validationBatchSize : Int = , callbacks : List < Callback > = listOf ( ) ) : TrainingHistory","body":"public abstract fun fit ( trainingDataset : Dataset , validationDataset : Dataset , epochs : Int = , trainBatchSize : Int = , validationBatchSize : Int = , callbacks : List < Callback > = listOf ( ) ) : TrainingHistory","docstring":"/**\n * Trains the model for a fixed number of [epochs] (iterations over a dataset).\n *\n * @param [trainingDataset] The train dataset that combines input data (X) and target data (Y).\n * @param [validationDataset] The validation dataset that combines input data (X) and target data (Y).\n * @param [epochs] Number of epochs to train the model. An epoch is an iteration over the entire x and y data provided.\n * @param [trainBatchSize] Number of samples per gradient update.\n * @param [validationBatchSize] Number of samples per validation batch.\n * True (default) = optimizer variables are initialized at the beginning of the training phase.\n * False = optimizer variables are not initialized during training phase. It should be initialized before (via transfer learning).\n * @param [callbacks] Callbacks to be used during training phase.\n *\n * @return A [TrainingHistory] object. It contains records with training/validation loss values and metrics per each batch and epoch.\n */"} {"signature":"public fun evaluate ( dataset : Dataset , batchSize : Int = , callback : Callback ) : EvaluationResult","body":"{ return evaluate ( dataset , batchSize , listOf ( callback ) ) }","docstring":"/**\n * Returns the metrics and loss values for the model in test (evaluation) mode.\n *\n * @param [dataset] The train dataset that combines input data (X) and target data (Y).\n * @param [batchSize] Number of samples per batch of computation.\n * @param [callback] Callback to be used during evaluation phase.\n *\n * @return Value of calculated metric and loss values.\n */"} {"signature":"public abstract fun evaluate ( dataset : Dataset , batchSize : Int = , callbacks : List < Callback > = listOf ( ) ) : EvaluationResult","body":"public abstract fun evaluate ( dataset : Dataset , batchSize : Int = , callbacks : List < Callback > = listOf ( ) ) : EvaluationResult","docstring":"/**\n * Returns the metrics and loss values for the model in test (evaluation) mode.\n *\n * @param [dataset] The train dataset that combines input data (X) and target data (Y).\n * @param [batchSize] Number of samples per batch of computation.\n * @param [callbacks] Callbacks to be used during evaluation phase.\n *\n * @return Value of calculated metric and loss values.\n */"} {"signature":"public fun predict ( dataset : Dataset , batchSize : Int , callback : Callback ) : IntArray","body":"{ return predict ( dataset , batchSize , listOf ( callback ) ) }","docstring":"/**\n * Generates output predictions for the input samples.\n *\n * @param [dataset] Data to predict on.\n * @param [batchSize] Number of samples per batch of computation.\n * @param [callback] Callback to be used during prediction phase.\n *\n * @return Array of labels. The length is equal to the Number of samples on the [dataset].\n */"} {"signature":"public abstract fun predict ( dataset : Dataset , batchSize : Int , callbacks : List < Callback > = listOf ( ) ) : IntArray","body":"public abstract fun predict ( dataset : Dataset , batchSize : Int , callbacks : List < Callback > = listOf ( ) ) : IntArray","docstring":"/**\n * Generates output predictions for the input samples.\n *\n * @param [dataset] Data to predict on.\n * @param [batchSize] Number of samples per batch of computation.\n * @param [callbacks] Callbacks to be used during prediction phase.\n *\n * @return Array of labels. The length is equal to the Number of samples on the [dataset].\n */"} {"signature":"public fun predictSoftly ( dataset : Dataset , batchSize : Int , callback : Callback ) : Array < FloatArray >","body":"{ return predictSoftly ( dataset , batchSize , listOf ( callback ) ) }","docstring":"/**\n * Generates output predictions for the input samples.\n * Each prediction is a vector of probabilities instead of specific class in [predict] method.\n *\n * @param [dataset] Data to predict on.\n * @param [batchSize] Number of samples per batch of computation.\n * @param [callback] Callback to be used during prediction phase.\n *\n * @return Array of labels. All labels are vectors that represents the probability distributions of a list of potential outcomes. The length is equal to the Number of samples on the [dataset].\n */"} {"signature":"public abstract fun predictSoftly ( dataset : Dataset , batchSize : Int , callbacks : List < Callback > = listOf ( ) ) : Array < FloatArray >","body":"public abstract fun predictSoftly ( dataset : Dataset , batchSize : Int , callbacks : List < Callback > = listOf ( ) ) : Array < FloatArray >","docstring":"/**\n * Generates output predictions for the input samples.\n * Each prediction is a vector of probabilities instead of specific class in [predict] method.\n *\n * @param [dataset] Data to predict on.\n * @param [batchSize] Number of samples per batch of computation.\n * @param [callbacks] Callbacks to be used during prediction phase.\n *\n * @return Array of labels. All labels are vectors that represents the probability distributions of a list of potential outcomes. The length is equal to the Number of samples on the [dataset].\n */"} {"signature":"public abstract fun predict ( inputData : FloatData , predictionTensorName : String ) : Int","body":"public abstract fun predict ( inputData : FloatData , predictionTensorName : String ) : Int","docstring":"/**\n * Generates output prediction for the input sample using output of the [predictionTensorName] tensor.\n *\n * @param [inputData] Unlabeled input data to define label.\n * @param [predictionTensorName] Name of output tensor to make prediction.\n */"} {"signature":"public abstract fun predictAndGetActivations ( inputData : FloatData , predictionTensorName : String = \"\" ) : Pair < Int , List < * > >","body":"public abstract fun predictAndGetActivations ( inputData : FloatData , predictionTensorName : String = \"\" ) : Pair < Int , List < * > >","docstring":"/**\n * Predicts and returns not only prediction but list of activations values from intermediate model layers\n * (for visualisation or debugging purposes).\n *\n * @param [inputData] Unlabeled input data to define label.\n * @param [predictionTensorName] Name of output tensor to make prediction.\n * @return Label (class index) and list of activations from intermediate model layers.\n */"} {"signature":"protected abstract fun predictSoftlyAndGetActivations ( inputData : FloatData , predictionTensorName : String ) : Pair < FloatArray , List < * > >","body":"protected abstract fun predictSoftlyAndGetActivations ( inputData : FloatData , predictionTensorName : String ) : Pair < FloatArray , List < * > >","docstring":"/**\n * Predicts and returns not only prediction but list of activations values from intermediate model layers\n * (for visualisation or debugging purposes).\n *\n * @param [inputData] Unlabeled input data to define label.\n * @param [predictionTensorName] Name of output tensor to make prediction.\n * @return Label (class index) and list of activations from intermediate model layers.\n */"} {"signature":"public abstract fun save ( modelDirectory : File , savingFormat : SavingFormat = SavingFormat . TfGraphCustomVariables , saveOptimizerState : Boolean = false , writingMode : WritingMode = WritingMode . FAIL_IF_EXISTS )","body":"public abstract fun save ( modelDirectory : File , savingFormat : SavingFormat = SavingFormat . TfGraphCustomVariables , saveOptimizerState : Boolean = false , writingMode : WritingMode = WritingMode . FAIL_IF_EXISTS )","docstring":"/**\n * Saves the model as graph and weights.\n *\n * @param [modelDirectory] Path to model directory.\n * @param [savingFormat] One of approaches to store model configurations and weights.\n * @param [saveOptimizerState] Saves internal optimizer states (variables) if true.\n * @param [writingMode] Default behaviour of handling different edge cases with existing directory before model saving.\n * @throws [FileNotFoundException] If [modelDirectory] does not contain all required files.\n */"} {"signature":"public open fun loadWeights ( modelDirectory : File , loadOptimizerState : Boolean = false )","body":"{ loadVariablesFromTxt ( modelDirectory . absolutePath , loadOptimizerState ) }","docstring":"/**\n * Loads variable data from .txt files.\n *\n * @param [modelDirectory] Path to directory with TensorFlow graph and variable data.\n * @param [loadOptimizerState] Loads optimizer internal variables data, if true.\n * @throws [FileNotFoundException] If file with weights is not found.\n */"} {"signature":"public fun fit ( dataset : OnHeapDataset , validationRate : Double , epochs : Int , trainBatchSize : Int , validationBatchSize : Int , callback : Callback ) : TrainingHistory","body":"{ require ( validationRate > && validationRate < ) { \"\" + \"\" } val ( validation , train ) = dataset . split ( validationRate ) return fit ( train , validation , epochs , trainBatchSize , validationBatchSize , listOf ( callback ) ) }","docstring":"/**\n * Trains the model for a fixed number of [epochs] (iterations on a dataset).\n *\n * @param [dataset] The dataset that combines input data (X) and target data (Y). It will be split on train and validation sub-datasets.\n * @param [validationRate] Number between 0.0 and 1.0. The proportion of validation data from initially passed [dataset].\n * @param [epochs] Number of epochs to train the model. An epoch is an iteration over the entire x and y data provided.\n * @param [trainBatchSize] Number of samples per gradient update.\n * @param [validationBatchSize] Number of samples per validation batch.\n * @param [callback] Callback to be used during training phase.\n *\n * @return A [TrainingHistory] object. It contains records with training/validation loss values and metrics per each batch and epoch.\n */"} {"signature":"public fun fit ( dataset : OnHeapDataset , validationRate : Double , epochs : Int , trainBatchSize : Int , validationBatchSize : Int , callbacks : List < Callback > = listOf ( ) ) : TrainingHistory","body":"{ require ( validationRate > && validationRate < ) { \"\" + \"\" } val ( validation , train ) = dataset . split ( validationRate ) return fit ( train , validation , epochs , trainBatchSize , validationBatchSize , callbacks ) }","docstring":"/**\n * Trains the model for a fixed number of [epochs] (iterations on a dataset).\n *\n * @param [dataset] The dataset that combines input data (X) and target data (Y). It will be split on train and validation sub-datasets.\n * @param [validationRate] Number between 0.0 and 1.0. The proportion of validation data from initially passed [dataset].\n * @param [epochs] Number of epochs to train the model. An epoch is an iteration over the entire x and y data provided.\n * @param [trainBatchSize] Number of samples per gradient update.\n * @param [validationBatchSize] Number of samples per validation batch.\n * @param [callbacks] Callbacks to be used during training phase.\n *\n * @return A [TrainingHistory] object. It contains records with training/validation loss values and metrics per each batch and epoch.\n */"} {"signature":"public inline fun plot ( dataset : Map < String , List < * > > = mapOf ( ) , block : DataFramePlotContext < * > . ( ) -> Unit ) : Plot","body":"{ return plot ( dataset . toDataFrame ( ) , block ) }","docstring":"/**\n * Returns a new [Plot].\n *\n * Creates a [DataFramePlotContext] plotting context, in which you can configure a plot.\n * Possible configuration parameters depend on the engine.\n *\n * @param dataset plot dataset.\n */"} {"signature":"@ JvmName ( \"\" ) public inline fun Map < String , List < * > > . plot ( block : DataFramePlotContext < * > . ( ) -> Unit ) : Plot","body":"{ return plot ( this , block ) }","docstring":"/**\n * Returns a new [Plot].\n *\n * Creates a [DataFramePlotContext] plotting context, in which you can configure a plot.\n * Possible configuration parameters depend on the engine.\n *\n * @receiver plot dataset.\n */"} {"signature":"public inline fun < T > DataFrame < T > . plot ( block : DataFramePlotContext < T > . ( ) -> Unit ) : Plot","body":"{ return plot ( this , block ) }","docstring":"/**\n * Returns a new [Plot].\n *\n * Creates a [DataFramePlotContext] plotting context, in which you can configure a plot.\n * Possible configuration parameters depend on the engine.\n *\n * @receiver plot dataset.\n */"} {"signature":"@ JvmName ( \"\" ) public inline fun < T > plot ( dataframe : DataFrame < T > , block : DataFramePlotContext < T > . ( ) -> Unit ) : Plot","body":"{ return DataFramePlotContext ( dataframe ) . apply ( block ) . toPlot ( ) }","docstring":"/**\n * Returns a new [Plot].\n *\n * Creates a [DataFramePlotContext] plotting context, in which you can configure a plot.\n * Possible configuration parameters depend on the engine.\n *\n * @param dataframe plot dataset.\n */"} {"signature":"public inline fun < T , G > GroupBy < T , G > . plot ( block : GroupByPlotContext < T , G > . ( ) -> Unit ) : Plot","body":"{ return GroupByPlotContext ( this ) . apply ( block ) . toPlot ( ) }","docstring":"/**\n * Returns a new [Plot].\n *\n * Creates a [GroupByPlotContext] plotting context, in which you can configure a plot.\n * Possible configuration parameters depend on the engine.\n *\n * @receiver plot dataset.\n */"} {"signature":"@ JvmName ( \"\" ) public inline fun < T , G > plot ( groupedDataframe : GroupBy < T , G > , block : GroupByPlotContext < T , G > . ( ) -> Unit ) : Plot","body":"{ return GroupByPlotContext ( groupedDataframe ) . apply ( block ) . toPlot ( ) }","docstring":"/**\n * Returns a new [Plot].\n *\n * Creates a [GroupByPlotContext] plotting context, in which you can configure a plot.\n * Possible configuration parameters depend on the engine.\n *\n * @param groupedDataframe plot dataset.\n */"} {"signature":"fun someFun ( x : Int )","body":"{ }","docstring":"/**\n *\n * @param x\n */"} {"signature":"internal fun isHostSpecificKonanTargetsSet ( konanTargets : Iterable < KonanTarget > ) : Boolean","body":"= konanTargets . none { target -> target in targetsEnabledOnAllHosts }","docstring":"/**\n * The set of konanTargets is considered 'host specific' if the shared compilation of said set can *not* be built\n * on *all* potential hosts. e.g. a set like (iosX64, macosX64) can only be built on macos hosts, and is therefore considered\n * 'host specific'.\n */"} {"signature":"internal suspend fun getHostSpecificMainSharedSourceSets ( project : Project ) : Set < KotlinSourceSet >","body":"{ fun KotlinSourceSet . testOnly ( ) : Boolean = internal . compilations . all { it . isTest ( ) } fun KotlinSourceSet . isCompiledToSingleTarget ( ) : Boolean { return internal . compilations . distinctBy { ( it . target as? KotlinNativeTarget ) ? . konanTarget ? : return false } . size == } return getHostSpecificSourceSets ( project ) . filterNot { it . testOnly ( ) } . filterNot { it . isCompiledToSingleTarget ( ) } . toSet ( ) }","docstring":"/**\n * Returns all host-specific source sets that will be compiled to two or more targets\n */"} {"signature":"@ ExperimentalCoroutinesApi @ Deprecated ( \"\" ) public fun cleanupTestCoroutines ( )","body":"@ ExperimentalCoroutinesApi @ Deprecated ( \"\" ) public fun cleanupTestCoroutines ( )","docstring":"/**\n * Called after the test completes.\n *\n * - It checks that there were no uncaught exceptions caught by its [CoroutineExceptionHandler].\n * If there were any, then the first one is thrown, whereas the rest are suppressed by it.\n * - It runs the tasks pending in the scheduler at the current time. If there are any uncompleted tasks afterwards,\n * it fails with [UncompletedCoroutinesError].\n * - It checks whether some new child [Job]s were created but not completed since this [TestCoroutineScope] was\n * created. If so, it fails with [UncompletedCoroutinesError].\n *\n * For backward compatibility, if the [CoroutineExceptionHandler] is an [UncaughtExceptionCaptor], its\n * [TestCoroutineExceptionHandler.cleanupTestCoroutines] behavior is performed.\n * Likewise, if the [ContinuationInterceptor] is a [DelayController], its [DelayController.cleanupTestCoroutines]\n * is called.\n *\n * @throws Throwable the first uncaught exception, if there are any uncaught exceptions.\n * @throws AssertionError if any pending tasks are active.\n * @throws IllegalStateException if called more than once.\n */"} {"signature":"fun reportException ( throwable : Throwable ) : Boolean","body":"= synchronized ( lock ) { if ( cleanedUp ) { false } else { exceptions . add ( throwable ) true } }","docstring":"/**\n * Reports an exception so that it is thrown on [cleanupTestCoroutines].\n *\n * If several exceptions are reported, only the first one will be thrown, and the other ones will be suppressed by\n * it.\n *\n * Returns `false` if [cleanupTestCoroutines] was already called.\n */"} {"signature":"@ Deprecated ( \"\" + \"\" , ReplaceWith ( \"\" , \"\" ) , level = DeprecationLevel . WARNING ) public fun TestCoroutineScope ( context : CoroutineContext = EmptyCoroutineContext ) : TestCoroutineScope","body":"{ val scheduler = context [ TestCoroutineScheduler ] ? : TestCoroutineScheduler ( ) return createTestCoroutineScope ( TestCoroutineDispatcher ( scheduler ) + TestCoroutineExceptionHandler ( ) + context ) }","docstring":"/**\n * A coroutine scope for launching test coroutines using [TestCoroutineDispatcher].\n *\n * [createTestCoroutineScope] is a similar function that defaults to [StandardTestDispatcher].\n */"} {"signature":"@ ExperimentalCoroutinesApi @ Deprecated ( \"\" + \"\" , level = DeprecationLevel . WARNING ) public fun createTestCoroutineScope ( context : CoroutineContext = EmptyCoroutineContext ) : TestCoroutineScope","body":"{ val ctxWithDispatcher = context . withDelaySkipping ( ) var scope : TestCoroutineScopeImpl ? = null val ownExceptionHandler = object : AbstractCoroutineContextElement ( CoroutineExceptionHandler ) , TestCoroutineScopeExceptionHandler { override fun handleException ( context : CoroutineContext , exception : Throwable ) { if ( ! scope ! ! . reportException ( exception ) ) throw exception } } val exceptionHandler = when ( val exceptionHandler = ctxWithDispatcher [ CoroutineExceptionHandler ] ) { is UncaughtExceptionCaptor -> exceptionHandler null -> ownExceptionHandler is TestCoroutineScopeExceptionHandler -> ownExceptionHandler else -> throw IllegalArgumentException ( \"\" + \"\" + \"\" ) } val job : Job = ctxWithDispatcher [ Job ] ? : Job ( ) return TestCoroutineScopeImpl ( ctxWithDispatcher + exceptionHandler + job ) . also { scope = it } }","docstring":"/**\n * A coroutine scope for launching test coroutines.\n *\n * This is a function for aiding in migration from [TestCoroutineScope] to [TestScope].\n * Please see the\n * [migration guide](https://github.com/Kotlin/kotlinx.coroutines/blob/master/kotlinx-coroutines-test/MIGRATION.md)\n * for an instruction on how to update the code for the new API.\n *\n * It ensures that all the test module machinery is properly initialized.\n * - If [context] doesn't define a [TestCoroutineScheduler] for orchestrating the virtual time used for delay-skipping,\n * a new one is created, unless either\n * - a [TestDispatcher] is provided, in which case [TestDispatcher.scheduler] is used;\n * - at the moment of the creation of the scope, [Dispatchers.Main] is delegated to a [TestDispatcher], in which case\n * its [TestCoroutineScheduler] is used.\n * - If [context] doesn't have a [ContinuationInterceptor], a [StandardTestDispatcher] is created.\n * - A [CoroutineExceptionHandler] is created that makes [TestCoroutineScope.cleanupTestCoroutines] throw if there were\n * any uncaught exceptions, or forwards the exceptions further in a platform-specific manner if the cleanup was\n * already performed when an exception happened. Passing a [CoroutineExceptionHandler] is illegal, unless it's an\n * [UncaughtExceptionCaptor], in which case the behavior is preserved for the time being for backward compatibility.\n * If you need to have a specific [CoroutineExceptionHandler], please pass it to [launch] on an already-created\n * [TestCoroutineScope] and share your use case at\n * [our issue tracker](https://github.com/Kotlin/kotlinx.coroutines/issues).\n * - If [context] provides a [Job], that job is used for the new scope; otherwise, a [CompletableJob] is created.\n *\n * @throws IllegalArgumentException if [context] has both [TestCoroutineScheduler] and a [TestDispatcher] linked to a\n * different scheduler.\n * @throws IllegalArgumentException if [context] has a [ContinuationInterceptor] that is not a [TestDispatcher].\n * @throws IllegalArgumentException if [context] has an [CoroutineExceptionHandler] that is not an\n * [UncaughtExceptionCaptor].\n */"} {"signature":"@ ExperimentalCoroutinesApi @ Deprecated ( \"\" + \"\" , ReplaceWith ( \"\" ) , DeprecationLevel . ERROR ) public fun TestCoroutineScope . advanceTimeBy ( delayTimeMillis : Long ) : Unit","body":"= when ( val controller = coroutineContext . delayController ) { null -> { testScheduler . advanceTimeBy ( delayTimeMillis ) testScheduler . runCurrent ( ) } else -> { controller . advanceTimeBy ( delayTimeMillis ) Unit } }","docstring":"/**\n * Advances the [testScheduler][TestCoroutineScope.testScheduler] by [delayTimeMillis] and runs the tasks up to that\n * moment (inclusive).\n *\n * @see TestCoroutineScheduler.advanceTimeBy\n */"} {"signature":"@ ExperimentalCoroutinesApi public fun TestCoroutineScope . advanceUntilIdle ( )","body":"{ coroutineContext . delayController ? . advanceUntilIdle ( ) ? : testScheduler . advanceUntilIdle ( ) }","docstring":"/**\n * Advances the [testScheduler][TestCoroutineScope.testScheduler] to the point where there are no tasks remaining.\n * @see TestCoroutineScheduler.advanceUntilIdle\n */"} {"signature":"@ ExperimentalCoroutinesApi public fun TestCoroutineScope . runCurrent ( )","body":"{ coroutineContext . delayController ? . runCurrent ( ) ? : testScheduler . runCurrent ( ) }","docstring":"/**\n * Run any tasks that are pending at the current virtual time, according to\n * the [testScheduler][TestCoroutineScope.testScheduler].\n *\n * @see TestCoroutineScheduler.runCurrent\n */"} {"signature":"internal inline fun < reified T : Any > automagicTypedProxy ( targetClassLoader : ClassLoader , delegate : Any ) : T","body":"= automagicProxy ( targetClassLoader , T :: class . java , delegate ) as T","docstring":"/**\n * Warning! Hard reflection magic used here.\n *\n * Creates [java.lang.reflect.Proxy] with pass through invocation algorithm,\n * to create access proxy for [delegate] into [targetClassLoader].\n */"} {"signature":"private fun automagicProxy ( targetClassLoader : ClassLoader , targetType : Class < * > , delegate : Any ) : Any","body":"= Proxy . newProxyInstance ( targetClassLoader , arrayOf ( targetType ) , DelegatedInvocationHandler ( delegate ) )","docstring":"/**\n * Warning! Hard reflection magic used here.\n *\n * Creates [java.lang.reflect.Proxy] with pass through invocation algorithm,\n * to create access proxy for [delegate] into [targetClassLoader].\n *\n */"} {"signature":"fun addIdleTask ( id : Int , priority : Int , queue : Packet ? , count : Int )","body":"{ this . addRunningTask ( id , priority , queue , IdleTask ( this , , count ) ) }","docstring":"/**\n * Add an idle task to this scheduler.\n * @param {int} id the identity of the task\n * @param {int} priority the task's priority\n * @param {Packet} queue the queue of work to be processed by the task\n * @param {int} count the number of times to schedule the task\n */"} {"signature":"fun addWorkerTask ( id : Int , priority : Int , queue : Packet ? )","body":"{ this . addTask ( id , priority , queue , WorkerTask ( this , ID_HANDLER_A , ) ) }","docstring":"/**\n * Add a work task to this scheduler.\n * @param {int} id the identity of the task\n * @param {int} priority the task's priority\n * @param {Packet} queue the queue of work to be processed by the task\n */"} {"signature":"fun addHandlerTask ( id : Int , priority : Int , queue : Packet ? )","body":"{ this . addTask ( id , priority , queue , HandlerTask ( this ) ) }","docstring":"/**\n * Add a handler task to this scheduler.\n * @param {int} id the identity of the task\n * @param {int} priority the task's priority\n * @param {Packet} queue the queue of work to be processed by the task\n */"} {"signature":"fun addDeviceTask ( id : Int , priority : Int , queue : Packet ? )","body":"{ this . addTask ( id , priority , queue , DeviceTask ( this ) ) }","docstring":"/**\n * Add a handler task to this scheduler.\n * @param {int} id the identity of the task\n * @param {int} priority the task's priority\n * @param {Packet} queue the queue of work to be processed by the task\n */"} {"signature":"fun addRunningTask ( id : Int , priority : Int , queue : Packet ? , task : Task )","body":"{ this . addTask ( id , priority , queue , task ) this . currentTcb ! ! . setRunning ( ) }","docstring":"/**\n * Add the specified task and mark it as running.\n * @param {int} id the identity of the task\n * @param {int} priority the task's priority\n * @param {Packet} queue the queue of work to be processed by the task\n * @param {Task} task the task to add\n */"} {"signature":"fun addTask ( id : Int , priority : Int , queue : Packet ? , task : Task )","body":"{ this . currentTcb = TaskControlBlock ( this . list , id , priority , queue , task ) this . list = this . currentTcb this . blocks [ id ] = this . currentTcb }","docstring":"/**\n * Add the specified task to this scheduler.\n * @param {int} id the identity of the task\n * @param {int} priority the task's priority\n * @param {Packet} queue the queue of work to be processed by the task\n * @param {Task} task the task to add\n */"} {"signature":"fun schedule ( )","body":"{ this . currentTcb = this . list while ( this . currentTcb != null ) { if ( this . currentTcb ! ! . isHeldOrSuspended ( ) ) { this . currentTcb = this . currentTcb ! ! . link } else { this . currentId = this . currentTcb ! ! . id this . currentTcb = this . currentTcb ! ! . run ( ) } } }","docstring":"/**\n * Execute the tasks managed by this scheduler.\n */"} {"signature":"fun release ( id : Int ) : TaskControlBlock ?","body":"{ val tcb = this . blocks [ id ] if ( tcb == null ) return tcb tcb . markAsNotHeld ( ) if ( tcb . priority > this . currentTcb ! ! . priority ) { return tcb } else { return this . currentTcb } }","docstring":"/**\n * Release a task that is currently blocked and return the next block to run.\n * @param {int} id the id of the task to suspend\n */"} {"signature":"fun holdCurrent ( ) : TaskControlBlock ?","body":"{ this . holdCount ++ this . currentTcb ! ! . markAsHeld ( ) return this . currentTcb ! ! . link }","docstring":"/**\n * Block the currently executing task and return the next task control block\n * to run. The blocked task will not be made runnable until it is explicitly\n * released, even if new work is added to it.\n */"} {"signature":"fun suspendCurrent ( ) : TaskControlBlock ?","body":"{ this . currentTcb ! ! . markAsSuspended ( ) return this . currentTcb }","docstring":"/**\n * Suspend the currently executing task and return the next task control block\n * to run. If new work is added to the suspended task it will be made runnable.\n */"} {"signature":"fun queue ( packet : Packet ) : TaskControlBlock ?","body":"{ val t = this . blocks [ packet . id ] if ( t == null ) return t this . queueCount ++ packet . link = null packet . id = this . currentId return t . checkPriorityAdd ( this . currentTcb ! ! , packet ) }","docstring":"/**\n * Add the specified packet to the end of the work list used by the task\n * associated with the packet and make the task runnable if it is currently\n * suspended.\n * @param {Packet} packet the packet to add\n */"} {"signature":"fun run ( ) : TaskControlBlock ?","body":"{ val packet : Packet ? if ( this . state == STATE_SUSPENDED_RUNNABLE ) { packet = this . queue this . queue = packet ? . link if ( this . queue == null ) { this . state = STATE_RUNNING } else { this . state = STATE_RUNNABLE } } else { packet = null } return this . task . run ( packet ) }","docstring":"/**\n * Runs this task, if it is ready to be run, and returns the next task to run.\n */"} {"signature":"fun checkPriorityAdd ( task : TaskControlBlock , packet : Packet ) : TaskControlBlock","body":"{ if ( this . queue == null ) { this . queue = packet this . markAsRunnable ( ) if ( this . priority > task . priority ) return this } else { this . queue = packet . addTo ( this . queue ) } return task }","docstring":"/**\n * Adds a packet to the work list of this block's task, marks this as runnable if\n * necessary, and returns the next runnable object to run (the one\n * with the highest priority).\n */"} {"signature":"fun addTo ( queue : Packet ? ) : Packet","body":"{ this . link = null if ( queue == null ) return this var next : Packet = queue var peek = next . link while ( peek != null ) { next = peek peek = next . link } next . link = this return queue }","docstring":"/**\n * Add this packet to the end of a work list, and return the work list.\n * @param {Packet} queue the work list to add this packet to\n */"} {"signature":"public fun conjugate ( ) : ComplexFloat","body":"= ComplexFloat ( re , - im )","docstring":"/**\n * Returns the complex conjugate value of the current complex number.\n *\n * @return a new ComplexFloat object representing the complex conjugate of the current complex number.\n * It has the same real part as the current number, but an opposite sign of its imaginary part.\n */"} {"signature":"public fun abs ( ) : Float","body":"= hypot ( re , im )","docstring":"/**\n * Returns the absolute value of the complex number.\n *\n * @return the absolute value of the complex number.\n */"} {"signature":"public fun angle ( ) : Float","body":"= atan2 ( im , re )","docstring":"/**\n * Returns the angle of the complex number.\n *\n * @return the angle of the complex number as a Float.\n */"} {"signature":"public operator fun plus ( other : Byte ) : ComplexFloat","body":"= ComplexFloat ( re + other , im )","docstring":"/**\n * Adds the other byte value to this value.\n *\n * @param other the [Byte] value to add to this one.\n * @return a new [ComplexFloat] with the result of the addition.\n */"} {"signature":"public operator fun plus ( other : Short ) : ComplexFloat","body":"= ComplexFloat ( re + other , im )","docstring":"/**\n * Adds the other short value to this value.\n *\n * @param other the [Short] value to add to this one.\n * @return a new [ComplexFloat] with the result of the addition.\n */"} {"signature":"public operator fun plus ( other : Int ) : ComplexFloat","body":"= ComplexFloat ( re + other , im )","docstring":"/**\n * Adds the other integer value to this value.\n *\n * @param other the [Int] value to add to this one.\n * @return a new [ComplexFloat] with the result of the addition.\n */"} {"signature":"public operator fun plus ( other : Long ) : ComplexFloat","body":"= ComplexFloat ( re + other , im )","docstring":"/**\n * Adds the other long value to this value.\n *\n * @param other the [Long] value to add to this one.\n * @return a new [ComplexFloat] with the result of the addition.\n */"} {"signature":"public operator fun plus ( other : Float ) : ComplexFloat","body":"= ComplexFloat ( re + other , im )","docstring":"/**\n * Adds the other float value to this value.\n *\n * @param other the [Float] value to add to this one.\n * @return a new [ComplexFloat] with the result of the addition.\n */"} {"signature":"public operator fun plus ( other : Double ) : ComplexDouble","body":"= ComplexDouble ( re + other , im . toDouble ( ) )","docstring":"/**\n * Adds the other double value to this value.\n *\n * @param other the [Double] value to add to this one.\n * @return a new [ComplexDouble] with the result of the addition.\n */"} {"signature":"public operator fun plus ( other : ComplexFloat ) : ComplexFloat","body":"= ComplexFloat ( re + other . re , im + other . im )","docstring":"/**\n * Adds the other ComplexFloat value to this value.\n *\n * @param other the [ComplexFloat] value to add to this one.\n * @return a new [ComplexFloat] with the result of the addition.\n */"} {"signature":"public operator fun plus ( other : ComplexDouble ) : ComplexDouble","body":"= ComplexDouble ( re + other . re , im + other . im )","docstring":"/**\n * Adds the other ComplexDouble value to this value.\n *\n * @param other the [ComplexDouble] value to add to this one.\n * @return a new [ComplexDouble] with the result of the addition.\n */"} {"signature":"public operator fun minus ( other : Byte ) : ComplexFloat","body":"= ComplexFloat ( re - other , im )","docstring":"/**\n * Subtracts the other byte value from this value.\n *\n * @param other the [Byte] value to be subtracted from this value.\n * @return a new [ComplexFloat] representing the result of the subtraction operation.\n */"} {"signature":"public operator fun minus ( other : Short ) : ComplexFloat","body":"= ComplexFloat ( re - other , im )","docstring":"/**\n * Subtracts the other short value from this value.\n *\n * @param other the [Short] value to be subtracted from this value.\n * @return a new [ComplexFloat] representing the result of the subtraction operation.\n */"} {"signature":"public operator fun minus ( other : Int ) : ComplexFloat","body":"= ComplexFloat ( re - other , im )","docstring":"/**\n * Subtracts the other integer value from this value.\n *\n * @param other the [Int] value to be subtracted from this value.\n * @return a new [ComplexFloat] representing the result of the subtraction operation.\n */"} {"signature":"public operator fun minus ( other : Long ) : ComplexFloat","body":"= ComplexFloat ( re - other , im )","docstring":"/**\n * Subtracts the other long value from this value.\n *\n * @param other the [Long] value to be subtracted from this value.\n * @return a new [ComplexFloat] representing the result of the subtraction operation.\n */"} {"signature":"public operator fun minus ( other : Float ) : ComplexFloat","body":"= ComplexFloat ( re - other , im )","docstring":"/**\n * Subtracts the other float value from this value.\n *\n * @param other the [Float] value to be subtracted from this value.\n * @return a new [ComplexFloat] representing the result of the subtraction operation.\n */"} {"signature":"public operator fun minus ( other : Double ) : ComplexDouble","body":"= ComplexDouble ( re - other , im . toDouble ( ) )","docstring":"/**\n * Subtracts the other double value from this value.\n *\n * @param other The [Double] value to be subtracted from this value.\n * @return A new [ComplexDouble] representing the result of the subtraction operation.\n */"} {"signature":"public operator fun minus ( other : ComplexFloat ) : ComplexFloat","body":"= ComplexFloat ( re - other . re , im - other . im )","docstring":"/**\n * Subtracts the other value from this value.\n *\n * @param other The value to be subtracted from this value.\n * @return A new [ComplexFloat] representing the result of the subtraction operation.\n */"} {"signature":"public operator fun minus ( other : ComplexDouble ) : ComplexDouble","body":"= ComplexDouble ( re - other . re , im - other . im )","docstring":"/**\n * Subtracts the other value from this value.\n *\n * @param other The value to be subtracted from this value.\n * @return A new [ComplexDouble] representing the result of the subtraction operation.\n */"} {"signature":"public operator fun times ( other : Byte ) : ComplexFloat","body":"= ComplexFloat ( re * other , im * other )","docstring":"/**\n * Multiplies this complex number by the given byte value.\n *\n * @param other the [Byte] value to multiply this complex number by\n * @return a new [ComplexFloat] representing the result of the multiplication\n */"} {"signature":"public operator fun times ( other : Short ) : ComplexFloat","body":"= ComplexFloat ( re * other , im * other )","docstring":"/**\n * Multiplies this complex number by the given short value.\n *\n * @param other the [Short] value to multiply this complex number by\n * @return a new [ComplexFloat] representing the result of the multiplication\n */"} {"signature":"public operator fun times ( other : Int ) : ComplexFloat","body":"= ComplexFloat ( re * other , im * other )","docstring":"/**\n * Multiplies this complex number by the given integer value.\n *\n * @param other the [Int] value to multiply this complex number by\n * @return a new [ComplexFloat] representing the result of the multiplication\n */"} {"signature":"public operator fun times ( other : Long ) : ComplexFloat","body":"= ComplexFloat ( re * other , im * other )","docstring":"/**\n * Multiplies this complex number by the given long value.\n *\n * @param other the [Long] value to multiply this complex number by\n * @return a new [ComplexFloat] representing the result of the multiplication\n */"} {"signature":"public operator fun times ( other : Float ) : ComplexFloat","body":"= ComplexFloat ( re * other , im * other )","docstring":"/**\n * Multiplies this complex number by the given float value.\n *\n * @param other the [Float] value to multiply this complex number by\n * @return a new [ComplexFloat] representing the result of the multiplication\n */"} {"signature":"public operator fun times ( other : Double ) : ComplexDouble","body":"= ComplexDouble ( re * other , im * other )","docstring":"/**\n * Multiplies this complex number by the given double value.\n *\n * @param other the [Double] value to multiply this complex number by\n * @return a new [ComplexDouble] representing the result of the multiplication\n */"} {"signature":"public operator fun times ( other : ComplexFloat ) : ComplexFloat","body":"= ComplexFloat ( re * other . re - im * other . im , re * other . im + other . re * im )","docstring":"/**\n * Multiplies this complex number by the given ComplexFloat value.\n *\n * @param other the [ComplexFloat] value to multiply this complex number by\n * @return a new [ComplexFloat] representing the result of the multiplication\n */"} {"signature":"public operator fun times ( other : ComplexDouble ) : ComplexDouble","body":"= ComplexDouble ( re * other . re - im * other . im , re * other . im + other . re * im )","docstring":"/**\n * Multiplies this complex number by the given ComplexDouble value.\n *\n * @param other the [ComplexDouble] value to multiply this complex number by\n * @return a new [ComplexDouble] representing the result of the multiplication\n */"} {"signature":"public operator fun div ( other : Byte ) : ComplexFloat","body":"= ComplexFloat ( re / other , im / other )","docstring":"/**\n * Divides this value by the given byte value.\n *\n * @param other the [Byte] value to divide this ComplexFloat by.\n * @return a new [ComplexFloat] value after division.\n */"} {"signature":"public operator fun div ( other : Short ) : ComplexFloat","body":"= ComplexFloat ( re / other , im / other )","docstring":"/**\n * Divides this value by the given short value.\n *\n * @param other the [Short] value to divide this ComplexFloat by.\n * @return a new [ComplexFloat] value after division.\n */"} {"signature":"public operator fun div ( other : Int ) : ComplexFloat","body":"= ComplexFloat ( re / other , im / other )","docstring":"/**\n * Divides this value by the given integer value.\n *\n * @param other the [Int] value to divide this ComplexFloat by.\n * @return a new [ComplexFloat] value after division.\n */"} {"signature":"public operator fun div ( other : Long ) : ComplexFloat","body":"= ComplexFloat ( re / other , im / other )","docstring":"/**\n * Divides this value by the given long value.\n *\n * @param other the [Long] value to divide this ComplexFloat by.\n * @return a new [ComplexFloat] value after division.\n */"} {"signature":"public operator fun div ( other : Float ) : ComplexFloat","body":"= ComplexFloat ( re / other , im / other )","docstring":"/**\n * Divides this value by the given float value.\n *\n * @param other the [Float] value to divide this ComplexFloat by.\n * @return a new [ComplexFloat] value after division.\n */"} {"signature":"public operator fun div ( other : Double ) : ComplexDouble","body":"= ComplexDouble ( re / other , im / other )","docstring":"/**\n * Divides this value by the given double value.\n *\n * @param other the [Double] value to divide this ComplexFloat by.\n * @return a new [ComplexDouble] value after division.\n */"} {"signature":"public operator fun div ( other : ComplexFloat ) : ComplexFloat","body":"= when { kotlin . math . abs ( other . re ) > kotlin . math . abs ( other . im ) -> { val dr = other . im / other . re val dd = other . re + dr * other . im if ( dd . isNaN ( ) || dd == ) throw ArithmeticException ( \"\" ) ComplexFloat ( ( re + im * dr ) / dd , ( im - re * dr ) / dd ) } other . im == -> throw ArithmeticException ( \"\" ) else -> { val dr = other . re / other . im val dd = other . im + dr * other . re if ( dd . isNaN ( ) || dd == ) throw ArithmeticException ( \"\" ) ComplexFloat ( ( re * dr + im ) / dd , ( im * dr - re ) / dd ) } }","docstring":"/**\n * Divides this value by the given ComplexFloat value.\n *\n * @param other the [ComplexFloat] value to divide this ComplexFloat by.\n * @return a new [ComplexFloat] value after division.\n */"} {"signature":"public operator fun div ( other : ComplexDouble ) : ComplexDouble","body":"= when { kotlin . math . abs ( other . re ) > kotlin . math . abs ( other . im ) -> { val dr = other . im / other . re val dd = other . re + dr * other . im if ( dd . isNaN ( ) || dd == ) throw ArithmeticException ( \"\" ) ComplexDouble ( ( re + im * dr ) / dd , ( im - re * dr ) / dd ) } other . im == -> throw ArithmeticException ( \"\" ) else -> { val dr = other . re / other . im val dd = other . im + dr * other . re if ( dd . isNaN ( ) || dd == ) throw ArithmeticException ( \"\" ) ComplexDouble ( ( re * dr + im ) / dd , ( im * dr - re ) / dd ) } }","docstring":"/**\n * Divides this value by the given ComplexDouble value.\n *\n * @param other the [ComplexDouble] value to divide this ComplexFloat by.\n * @return a new [ComplexDouble] value after division.\n */"} {"signature":"public operator fun unaryPlus ( ) : ComplexFloat","body":"= this","docstring":"/** Returns this value. */"} {"signature":"public operator fun unaryMinus ( ) : ComplexFloat","body":"= ComplexFloat ( - re , - im )","docstring":"/** Returns the negative of this value. */"} {"signature":"public operator fun component1 ( ) : Float","body":"= re","docstring":"/**\n * Returns the real component of a complex number.\n *\n * @return the real part of the complex number as a Float value.\n */"} {"signature":"public operator fun component2 ( ) : Float","body":"= im","docstring":"/**\n * Returns the imaginary component of a complex number.\n *\n * @return the imaginary part of the complex number as a Float value.\n */"} {"signature":"override fun toString ( ) : String","body":"= \"\"","docstring":"/**\n * Returns a string representation of the complex number object in the form of\n * \"real_part + (imaginary_part)i\"\n *\n * @return the string representation of the complex number object\n */"} {"signature":"fun lazyResolve ( target : FirElementWithResolveState , toPhase : FirResolvePhase )","body":"{ if ( target . resolvePhase >= toPhase ) return lazyResolve ( target , toPhase , LLFirResolveDesignationCollector :: getDesignationToResolve ) }","docstring":"/**\n * Lazily resolves the [target] to a given [toPhase].\n *\n * Might resolve additional required declarations.\n *\n * Resolution is performed under the lock specific to each declaration that is going to be resolved.\n */"} {"signature":"fun lazyResolveWithCallableMembers ( target : FirRegularClass , toPhase : FirResolvePhase )","body":"{ lazyResolve ( target , toPhase , LLFirResolveDesignationCollector :: getDesignationToResolveWithCallableMembers ) }","docstring":"/**\n * Lazily resolves the [target] with all callable members to a given [toPhase].\n *\n * Might resolve additional required declarations.\n *\n * Resolution is performed under the lock specific to each declaration that is going to be resolved.\n */"} {"signature":"fun lazyResolveRecursively ( target : FirElementWithResolveState , toPhase : FirResolvePhase )","body":"{ lazyResolve ( target , toPhase , LLFirResolveDesignationCollector :: getDesignationToResolveRecursively ) }","docstring":"/**\n * Lazily resolves the [target] with nested declarations to a given [toPhase] recursively.\n *\n * Might resolve additional required declarations.\n *\n * Resolution is performed under the lock specific to each declaration that is going to be resolved.\n */"} {"signature":"fun lazyResolveTarget ( target : LLFirResolveTarget , toPhase : FirResolvePhase , )","body":"{ try { target . firFile ? . let ( :: resolveFileToImportsWithLock ) if ( toPhase == FirResolvePhase . IMPORTS ) return lazyResolveTargets ( target , toPhase ) } catch ( e : Exception ) { handleExceptionFromResolve ( e , target , toPhase ) } }","docstring":"/**\n * Lazily resolves all the declarations which are specified for resolve by [target]\n *\n * Might resolve additional required declarations.\n *\n * Resolution is performed under the lock specific to each declaration which is going to be resolved.\n */"} {"signature":"@ JvmStatic fun newInstance ( param1 : String , param2 : String )","body":"= DestinationFragment2 ( ) . apply { arguments = Bundle ( ) . apply { putString ( ARG_PARAM1 , param1 ) putString ( ARG_PARAM2 , param2 ) } }","docstring":"/**\n * Use this factory method to create a new instance of\n * this fragment using the provided parameters.\n *\n * @param param1 Parameter 1.\n * @param param2 Parameter 2.\n * @return A new instance of fragment DestinationFragment2.\n */"} {"signature":"fun invalidateAggregating ( )","body":"{ aggregatingGenerated . forEach { it . delete ( ) } aggregatingGenerated . clear ( ) aggregatedTypes . clear ( ) }","docstring":"/**\n * Invalidates all data collected about aggregating APs, making the cache ready for the next round of data collection. Also,\n * all files generated by aggregating APs are deleted.\n */"} {"signature":"fun invalidateIsolatingForOriginTypes ( originatingTypes : Set < String > )","body":"{ val isolatingGenerated = mutableSetOf < File > ( ) isolatingMapping . forEach { ( file , type ) -> if ( type in originatingTypes ) { isolatingGenerated . add ( file ) } } isolatingGenerated . forEach { isolatingMapping . remove ( it ) it . delete ( ) } }","docstring":"/**\n * Prepares isolating processors for incremental compilation. The specified generated files are removed, and mapping\n * information is deleted for them. The invalidation is non-transitive.\n */"} {"signature":"fun getOriginForGeneratedIsolatingType ( generatedType : String , sourceFileProvider : ( String ) -> File ) : String","body":"{ val generatedFile = sourceFileProvider ( generatedType ) return isolatingMapping . getValue ( generatedFile ) }","docstring":"/** Gets the originating type for the specified type generated by isolating AP. */"} {"signature":"fun getAggregatingOrigins ( ) : Set < String >","body":"= aggregatedTypes","docstring":"/** Returns types that were processed by aggregating APs. */"} {"signature":"fun getAggregatingGeneratedTypes ( typeInfoProvider : ( Collection < File > ) -> Set < String > ) : Set < String >","body":"{ val generatedAggregating : MutableSet < File > = HashSet ( aggregatingGenerated . size ) aggregatingGenerated . forEach { if ( it . isJavaFileOrClass ( ) ) { generatedAggregating . add ( it ) } } return typeInfoProvider ( generatedAggregating ) }","docstring":"/** Returns all types generated by aggregating APs. */"} {"signature":"fun getIsolatingGeneratedTypes ( typeInfoProvider : ( Collection < File > ) -> Set < String > ) : Set < String >","body":"{ val generatedIsolating : MutableSet < File > = HashSet ( isolatingMapping . size ) isolatingMapping . keys . forEach { if ( it . isJavaFileOrClass ( ) ) { generatedIsolating . add ( it ) } } return typeInfoProvider ( generatedIsolating ) }","docstring":"/** Returns all types generated by isolating APs. */"} {"signature":"fun linkage ( messageWithoutHashes : String ) : FailurePattern","body":"fun linkage ( messageWithoutHashes : String ) : FailurePattern","docstring":"/** N.B. It is expected that [messageWithoutHashes] contains IR linkage error message without hashes in ID signatures. */"} {"signature":"abstract fun configureBuilders ( )","body":"abstract fun configureBuilders ( )","docstring":"/**\n * A customization point to fine-tune existing builder classes or add new ones.\n *\n * Override this method and use the following DSL methods to configure builder generation:\n * - [builder]\n * - [noBuilder]\n * - [configureFieldInAllLeafBuilders]\n */"} {"signature":"protected abstract fun builderFieldFromElementField ( elementField : ElementField ) : BuilderField","body":"protected abstract fun builderFieldFromElementField ( elementField : ElementField ) : BuilderField","docstring":"/**\n * Must return a copy of [elementField] that will be used in builder configuration.\n */"} {"signature":"protected fun builder ( config : IntermediateBuilderConfigurationContext . ( ) -> Unit )","body":"= IntermediateBuilderDelegateProvider ( config )","docstring":"/**\n * Provides a way to configure an intermediate builder class.\n *\n * @param config The configuration block. See [IntermediateBuilderConfigurationContext]'s documentation for description of its DSL\n * methods.\n */"} {"signature":"protected fun builder ( element : Element , type : String ? = null , config : LeafBuilderConfigurationContext . ( ) -> Unit )","body":"{ val implementation = element . extractImplementation ( type ) val builder = implementation . builder requireNotNull ( builder ) LeafBuilderConfigurationContext ( builder ) . apply ( config ) }","docstring":"/**\n * Provides a way to configure a leaf builder class, i.e. the builder class responsible for finally constructing an instance of\n * the corresponding implementation class.\n *\n * @param element The element for which to configure builder generation.\n * @param config The configuration block. See [LeafBuilderConfigurationContext]'s documentation for description of its DSL\n * methods.\n */"} {"signature":"protected fun noBuilder ( element : Element , type : String ? = null )","body":"{ val implementation = element . extractImplementation ( type ) implementation . builder = null }","docstring":"/**\n * Disables generating any builder classes for [element].\n */"} {"signature":"protected inline fun findImplementationsWithElementInParents ( element : Element , implementationPredicate : ( Implementation ) -> Boolean = { true } ) : Collection < Implementation >","body":"{ return elements . flatMap { it . implementations } . mapNotNullTo ( mutableSetOf ( ) ) { implementation -> if ( ! implementationPredicate ( implementation ) ) return@mapNotNullTo null if ( implementation . element == element ) return@mapNotNullTo null val hasElementInParents = implementation . element . elementAncestorsAndSelfDepthFirst ( ) . any { it == element } implementation . takeIf { hasElementInParents } } }","docstring":"/**\n * Out of all implementations, returns those for which [implementationPredicate] returns `true`\n * _and_ [element] is one of its non-immediate parents.\n */"} {"signature":"protected fun configureFieldInAllLeafBuilders ( field : String , builderPredicate : ( ( LeafBuilder < BuilderField , Element , Implementation > ) -> Boolean ) ? = null , fieldPredicate : ( ( BuilderField ) -> Boolean ) ? = null , config : LeafBuilderConfigurationContext . ( field : String ) -> Unit )","body":"{ for ( builder in allLeafBuilders ) { if ( builderPredicate != null && ! builderPredicate ( builder ) ) continue if ( ! builder . allFields . any { it . name == field } ) continue if ( fieldPredicate != null && ! fieldPredicate ( builder [ field ] ) ) continue LeafBuilderConfigurationContext ( builder ) . config ( field ) } }","docstring":"/**\n * Allows to batch-apply [config] to certain fields in _all_ the builders that satisfy the given\n * [builderPredicate].\n *\n * @param field The name of the field to configure across all builder classes.\n * @param builderPredicate Only builders satisfying this predicate will participate 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 [LeafBuilderConfigurationContext]'s documentation for description of its DSL methods.\n */"} {"signature":"protected fun configureAllLeafBuilders ( config : LeafBuilderConfigurationContext . ( ) -> Unit )","body":"{ for ( builder in allLeafBuilders ) { LeafBuilderConfigurationContext ( builder ) . config ( ) } }","docstring":"/**\n * Allows to batch-apply [config] to _all_ leaf builders.\n *\n * @param config The configuration block. See [LeafBuilderConfigurationContext]'s documentation for description of its DSL methods.\n */"} {"signature":"fun additionalImports ( vararg types : Importable )","body":"{ types . forEach { builder . usedTypes += it } }","docstring":"/**\n * Types/functions that you want to additionally import in the file with the builder 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":"fun default ( field : String , value : String )","body":"{ default ( field ) { this . value = value } }","docstring":"/**\n * Specifies the default value of [field] in this builder 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 )","body":"{ for ( field in fields ) { default ( field ) { value = \"\" } } }","docstring":"/**\n * Specifies that the default value of each field in [fields] in this builder class should be `true`.\n */"} {"signature":"fun defaultFalse ( vararg fields : String )","body":"{ for ( field in fields ) { default ( field ) { value = \"\" } } }","docstring":"/**\n * Specifies that the default value of each field in [fields] in this builder class should be `false`.\n */"} {"signature":"fun defaultNull ( vararg fields : String )","body":"{ for ( field in fields ) { default ( field ) { value = \"\" } require ( getField ( field ) . nullable ) { \"\" } } }","docstring":"/**\n * Specifies that the default value of each field of [fields] in this builder class should be `null`.\n *\n * Note: the field must be configured as nullable.\n */"} {"signature":"fun default ( field : String , init : DefaultValueContext . ( ) -> Unit )","body":"{ DefaultValueContext ( getField ( field ) ) . apply ( init ) . applyConfiguration ( ) }","docstring":"/**\n * Allows to configure the default value of [field] in this builder class.\n *\n * See the [DefaultValueContext] documentation for description of its DSL methods.\n */"} {"signature":"infix fun from ( element : Element ) : ExceptConfigurator","body":"{ builder . fields += element . allFields . map ( this @ AbstractBuilderConfigurator :: builderFieldFromElementField ) builder . packageName = \"\" builder . materializedElement = element return ExceptConfigurator ( ) }","docstring":"/**\n * Copy all fields from [element] to this builder class.\n */"} {"signature":"infix fun without ( name : String )","body":"{ without ( listOf ( name ) ) }","docstring":"/**\n * Exclude the field with [name] from this builder class.\n */"} {"signature":"infix fun without ( names : List < String > )","body":"{ builder . fields . removeAll { it . name in names } }","docstring":"/**\n * Exclude the fields with [names] from this builder class.\n */"} {"signature":"fun openBuilder ( )","body":"{ builder . isOpen = true }","docstring":"/**\n * Makes this builder an open class.\n */"} {"signature":"fun withCopy ( )","body":"{ builder . wantsCopy = true }","docstring":"/**\n * In addition to the regular `build*()` function, generate `build*Copy()` function that accepts\n * an instance of the corresponding tree element and copies values from that instance to the builder, allowing to change them\n * in the process.\n */"} {"signature":"fun < Dependency : KotlinLibrary , SourceFile > serializeModuleIntoKlib ( moduleName : String , irModuleFragment : IrModuleFragment ? , configuration : CompilerConfiguration , diagnosticReporter : DiagnosticReporter , compatibilityMode : CompatibilityMode , cleanFiles : List < KotlinFileSerializedData > , dependencies : List < Dependency > , createModuleSerializer : ( irDiagnosticReporter : IrDiagnosticReporter , irBuiltins : IrBuiltIns , compatibilityMode : CompatibilityMode , normalizeAbsolutePaths : Boolean , sourceBaseDirs : Collection < String > , languageVersionSettings : LanguageVersionSettings , shouldCheckSignaturesOnUniqueness : Boolean , ) -> IrModuleSerializer < * > , metadataSerializer : KlibSingleFileMetadataSerializer < SourceFile > , runKlibCheckers : ( IrModuleFragment , IrDiagnosticReporter , CompilerConfiguration ) -> Unit = { _ , _ , _ -> } , processCompiledFileData : ( ( File , KotlinFileSerializedData ) -> Unit ) ? = null , processKlibHeader : ( ByteArray ) -> Unit = { } , ) : SerializerOutput < Dependency >","body":"{ if ( irModuleFragment != null ) { assert ( metadataSerializer . numberOfSourceFiles == irModuleFragment . files . size ) { \"\" } } val sourceBaseDirs = configuration [ CommonConfigurationKeys . KLIB_RELATIVE_PATH_BASES ] ? : emptyList ( ) val normalizeAbsolutePath = configuration . getBoolean ( CommonConfigurationKeys . KLIB_NORMALIZE_ABSOLUTE_PATH ) val signatureClashChecks = configuration [ CommonConfigurationKeys . PRODUCE_KLIB_SIGNATURES_CLASH_CHECKS ] ? : true val serializedIr = irModuleFragment ? . let { val irDiagnosticReporter = KtDiagnosticReporterWithImplicitIrBasedContext ( diagnosticReporter , configuration . languageVersionSettings ) runKlibCheckers ( it , irDiagnosticReporter , configuration ) createModuleSerializer ( irDiagnosticReporter , it . irBuiltins , compatibilityMode , normalizeAbsolutePath , sourceBaseDirs , configuration . languageVersionSettings , signatureClashChecks , ) . serializedIrModule ( it ) } val serializedFiles = serializedIr ? . files ? . toList ( ) val compiledKotlinFiles = buildList { addAll ( cleanFiles ) metadataSerializer . forEachFile { i , sourceFile , ktSourceFile , packageFqName -> val binaryFile = serializedFiles ? . get ( i ) ? . also { assert ( ktSourceFile . path == it . path ) { \"\"\"\"\"\" . trimMargin ( ) } } val protoBuf = metadataSerializer . serializeSingleFileMetadata ( sourceFile ) val metadata = protoBuf . toByteArray ( ) val compiledKotlinFile = if ( binaryFile == null ) KotlinFileSerializedData ( metadata , ktSourceFile . path , packageFqName . asString ( ) ) else KotlinFileSerializedData ( metadata , binaryFile ) if ( processCompiledFileData != null ) { val ioFile = ktSourceFile . toIoFileOrNull ( ) ? : error ( \"\" ) processCompiledFileData ( ioFile , compiledKotlinFile ) } add ( compiledKotlinFile ) } } val header = serializeKlibHeader ( languageVersionSettings = configuration . languageVersionSettings , moduleName = moduleName , fragmentNames = compiledKotlinFiles . map { it . fqName } . distinct ( ) . sorted ( ) , emptyPackages = emptyList ( ) , ) . toByteArray ( ) processKlibHeader ( header ) val ( fragmentNames , fragmentParts ) = compiledKotlinFiles . groupBy { it . fqName } . map { ( fqn , data ) -> fqn to data . sortedBy { it . path } . map { it . metadata } } . sortedBy { it . first } . unzip ( ) val serializedMetadata = SerializedMetadata ( module = header , fragments = fragmentParts , fragmentNames = fragmentNames ) return SerializerOutput ( serializedMetadata = serializedMetadata , serializedIr = if ( serializedIr == null ) null else SerializedIrModule ( compiledKotlinFiles . mapNotNull { it . irData } ) , dataFlowGraph = null , neededLibraries = dependencies , ) }","docstring":"/**\n * Produces all the necessary binary data for writing a KLIB for a Kotlin module, including its metadata.\n *\n * If [irModuleFragment] is not `null`, serializes the module's IR into binary form by running [IrModuleSerializer].\n *\n * For producing a metadata-only KLIB, pass `null` to [irModuleFragment].\n *\n * @param moduleName The name of the module being serialized to be written into the KLIB header.\n * @param irModuleFragment The IR to be serialized into the KLIB being produced, or `null` if this is going to be a metadata-only KLIB.\n * @param configuration Used to determine certain serialization parameters and enable/disable serialization diagnostics.\n * @param diagnosticReporter Used for reporting serialization-time diagnostics, for example, about clashing IR signatures.\n * @param compatibilityMode The information about KLIB ABI.\n * @param cleanFiles In the case of incremental compilation, the list of files that were not changed and therefore don't need to be\n * serialized again.\n * @param dependencies The list of KLIBs that the KLIB being produced depends on.\n * @param createModuleSerializer Used for creating a backend-specific instance of [IrModuleSerializer].\n * @param metadataSerializer Something capable of serializing the metadata of the source files. See the corresponding interface KDoc.\n * @param runKlibCheckers Additional checks to be run before serializing [irModuleFragment]. Can be used to report serialization-time\n * diagnostics.\n * @param processCompiledFileData Called for each newly serialized file. Useful for incremental compilation.\n * @param processKlibHeader Called after serializing the KLIB header. Useful for incremental compilation.\n */"} {"signature":"override fun hasChildren ( ) : Boolean","body":"{ return base . hasChildren ( ) || base . nonJavaResources . any { obj -> obj is IFile && ( obj . name . endsWith ( \"\" ) || EclipseScriptDefinitionProvider . isScript ( FileScriptSource ( obj . asFile ) ) ) } }","docstring":"/**\n * Returns true also when a package contains any Kotlin source file.\n *\n * Used by [JavaElementImageProvider.getPackageFragmentIcon]\n */"} {"signature":"fun read ( library : MetadataLibraryProvider , readStrategy : KlibModuleFragmentReadStrategy = KlibModuleFragmentReadStrategy . DEFAULT ) : KlibModuleMetadata","body":"{ val moduleHeaderProto = parseModuleHeader ( library . moduleHeaderData ) val headerNameResolver = NameResolverImpl ( moduleHeaderProto . strings , moduleHeaderProto . qualifiedNames ) val moduleHeader = moduleHeaderProto . readHeader ( headerNameResolver ) val fileIndex = SourceFileIndexReadExtension ( moduleHeader . file ) val moduleFragments = moduleHeader . packageFragmentName . flatMap { packageFqName -> library . packageMetadataParts ( packageFqName ) . map { part -> val packageFragment = parsePackageFragment ( library . packageMetadata ( packageFqName , part ) ) val nameResolver = NameResolverImpl ( packageFragment . strings , packageFragment . qualifiedNames ) packageFragment . toKmModuleFragment ( nameResolver , listOf ( fileIndex ) ) } . let ( readStrategy :: processModuleParts ) } return KlibModuleMetadata ( moduleHeader . moduleName , moduleFragments , moduleHeader . annotation ) }","docstring":"/**\n * Deserializes metadata from the given [library].\n * @param readStrategy specifies the way module fragments of a single package are modified (e.g. merged) after deserialization.\n */"} {"signature":"fun write ( writeStrategy : KlibModuleFragmentWriteStrategy = KlibModuleFragmentWriteStrategy . DEFAULT ) : SerializedKlibMetadata","body":"{ val reverseIndex = ReverseSourceFileIndexWriteExtension ( ) val groupedFragments = fragments . groupBy ( KmModuleFragment :: fqNameOrFail ) . mapValues { writeStrategy . processPackageParts ( it . value ) } val header = KlibHeader ( name , reverseIndex . fileIndex , groupedFragments . map { it . key } , groupedFragments . filter { it . value . all ( KmModuleFragment :: isEmpty ) } . map { it . key } , annotations ) val groupedProtos = groupedFragments . mapValues { ( _ , fragments ) -> fragments . map { mf -> val c = WriteContext ( ApproximatingStringTable ( ) , listOf ( reverseIndex ) ) KlibModuleFragmentWriter ( c . strings as ApproximatingStringTable , c . contextExtensions ) . also { it . writeModuleFragment ( mf ) } . write ( ) } } val c = WriteContext ( ApproximatingStringTable ( ) , listOf ( reverseIndex ) ) return SerializedKlibMetadata ( header . writeHeader ( c ) . build ( ) . toByteArray ( ) , groupedProtos . map { it . value . map ( ProtoBuf . PackageFragment :: toByteArray ) } , header . packageFragmentName ) }","docstring":"/**\n * Writes metadata back to serialized representation.\n * @param writeStrategy specifies the way module fragments are modified (e.g. split) before serialization.\n */"} {"signature":"fun render ( notebook : Notebook ) : DisplayResult","body":"fun render ( notebook : Notebook ) : DisplayResult","docstring":"/**\n * Render to display result\n *\n * @param notebook Current notebook\n * @return Display result\n */"} {"signature":"fun toJson ( additionalMetadata : JsonObject = Json . EMPTY , overrideId : String ? = null , ) : JsonObject","body":"fun toJson ( additionalMetadata : JsonObject = Json . EMPTY , overrideId : String ? = null , ) : JsonObject","docstring":"/**\n * Converts display data to JSON object for `display_data` response\n *\n * @param additionalMetadata Additional reply metadata\n * @return Display JSON\n */"} {"signature":"override fun render ( notebook : Notebook ) : DisplayResult","body":"= this","docstring":"/**\n * Renders display result, generally should return `this`\n */"} {"signature":"@ Suppress ( \"\" ) fun DisplayResult ? . toJson ( ) : JsonObject","body":"{ if ( this != null ) return this . toJson ( Json . EMPTY , null ) return Json . encodeToJsonElement ( mapOf ( \"\" to null , \"\" to JsonObject ( mapOf ( ) ) ) ) as JsonObject }","docstring":"/**\n * Convenience method for converting nullable [DisplayResult] to JSON\n *\n * @return JSON for `display_data` response\n */"} {"signature":"fun MutableJsonObject . setDisplayId ( id : String ? = null , force : Boolean = false , ) : String ?","body":"{ val transient = get ( \"\" ) ? . let { Json . decodeFromJsonElement < MutableJsonObject > ( it ) } val oldId = ( transient ? . get ( \"\" ) as? JsonPrimitive ) ? . content if ( id == null ) return oldId if ( oldId != null && ! force ) return oldId val newTransient = transient ? : mutableMapOf ( ) newTransient [ \"\" ] = JsonPrimitive ( id ) this [ \"\" ] = Json . encodeToJsonElement ( newTransient ) return id }","docstring":"/**\n * Sets display ID to JSON.\n * If ID was not set, sets it to [id] and returns it back\n * If ID was set and [force] is false, just returns old ID\n * If ID was set, [force] is true and [id] is `null`, just returns old ID\n * If ID was set, [force] is true and [id] is not `null`, sets ID to [id] and returns it back\n */"} {"signature":"fun JsonObject . containsDisplayId ( id : String ) : Boolean","body":"{ val transient : JsonObject ? = get ( \"\" ) as? JsonObject return ( transient ? . get ( \"\" ) as? JsonPrimitive ) ? . content == id }","docstring":"/**\n * Check if the JSON object contains a `display_id` entry.\n */"} {"signature":"private fun markdownCodeBlockBackticksCount ( code : String ) : Int","body":"{ return markdownBackticksRegex . findAll ( code ) . maxOfOrNull { it . value . length + } ? : }","docstring":"/** Return minimum number of backticks that are required to wrap [code] in Markdown code block without escaping it. */"} {"signature":"fun Notebook . renderHtmlAsIFrameIfNeeded ( data : HtmlData ) : MimeTypedResult","body":"{ return if ( jupyterClientType == JupyterClientType . KOTLIN_NOTEBOOK ) { data . toIFrame ( currentColorScheme ) } else { data . toSimpleHtml ( currentColorScheme ) } }","docstring":"/**\n * Renders HTML as iframe in Kotlin Notebook or simply in other clients\n *\n * @param data\n */"} {"signature":"@ SlicedGeneratedTest ( allLanguages = true , allTools = true ) fun SlicedBuildConfigurator . testDisableInstrumentationOfTask ( )","body":"{ addProjectWithKover { sourcesFrom ( \"\" ) kover { currentProject { instrumentation { disabledForTestTasks . add ( defaultTestTaskName ( slice . type ) ) } } } } run ( \"\" ) { checkOutcome ( \"\" , \"\" ) checkOutcome ( \"\" , \"\" ) taskNotCalled ( defaultTestTaskName ( slice . type ) ) checkDefaultBinReport ( false ) } }","docstring":"/**\n * Compile tasks must be executed even if all test tasks are disabled.\n */"} {"signature":"private fun testWritableByteChannel ( isBuffer : Boolean , channel : WritableByteChannel )","body":"{ assertTrue ( channel . isOpen ( ) ) val byteBuffer = ByteBuffer . allocate ( ) byteBuffer . put ( \"\" . toByteArray ( UTF_8 ) ) byteBuffer . flip ( ) byteBuffer . position ( ) byteBuffer . limit ( ) val byteCount : Int = channel . write ( byteBuffer ) assertEquals ( , byteCount ) assertEquals ( , byteBuffer . position ( ) ) assertEquals ( , byteBuffer . limit ( ) ) channel . close ( ) assertEquals ( isBuffer , channel . isOpen ) }","docstring":"/**\n * Does some basic writes to `channel`. We execute this against both Okio's channels and\n * also a standard implementation from the JDK to confirm that their behavior is consistent.\n */"} {"signature":"private fun testReadableByteChannel ( isBuffer : Boolean , channel : ReadableByteChannel )","body":"{ assertTrue ( channel . isOpen ) val byteBuffer = ByteBuffer . allocate ( ) byteBuffer . position ( ) byteBuffer . limit ( ) val byteCount : Int = channel . read ( byteBuffer ) assertEquals ( , byteCount ) assertEquals ( , byteBuffer . position ( ) ) assertEquals ( , byteBuffer . limit ( ) ) channel . close ( ) assertEquals ( isBuffer , channel . isOpen ( ) ) byteBuffer . flip ( ) byteBuffer . position ( ) val data = ByteArray ( byteBuffer . remaining ( ) ) byteBuffer [ data ] assertEquals ( \"\" , String ( data , UTF_8 ) ) }","docstring":"/**\n * Does some basic reads from `channel`. We execute this against both Okio's channels and\n * also a standard implementation from the JDK to confirm that their behavior is consistent.\n */"} {"signature":"public fun get ( ) : V","body":"public fun get ( ) : V","docstring":"/**\n * Returns the current value of the property.\n */"} {"signature":"public fun set ( value : V )","body":"public fun set ( value : V )","docstring":"/**\n * Modifies the value of the property.\n *\n * @param value the new value to be assigned to this property.\n */"} {"signature":"public fun get ( receiver : T ) : V","body":"public fun get ( receiver : T ) : V","docstring":"/**\n * Returns the current value of the property.\n *\n * @param receiver the receiver which is used to obtain the value of the property.\n * For example, it should be a class instance if this is a member property of that class,\n * or an extension receiver if this is a top level extension property.\n */"} {"signature":"public fun set ( receiver : T , value : V )","body":"public fun set ( receiver : T , value : V )","docstring":"/**\n * Modifies the value of the property.\n *\n * @param receiver the receiver which is used to modify the value of the property.\n * For example, it should be a class instance if this is a member property of that class,\n * or an extension receiver if this is a top level extension property.\n * @param value the new value to be assigned to this property.\n */"} {"signature":"public fun get ( receiver1 : D , receiver2 : E ) : V","body":"public fun get ( receiver1 : D , receiver2 : E ) : V","docstring":"/**\n * Returns the current value of the property. In case of the extension property in a class,\n * the instance of the class should be passed first and the instance of the extension receiver second.\n *\n * @param receiver1 the instance of the first receiver.\n * @param receiver2 the instance of the second receiver.\n */"} {"signature":"public fun set ( receiver1 : D , receiver2 : E , value : V )","body":"public fun set ( receiver1 : D , receiver2 : E , value : V )","docstring":"/**\n * Modifies the value of the property.\n *\n * @param receiver1 the instance of the first receiver.\n * @param receiver2 the instance of the second receiver.\n * @param value the new value to be assigned to this property.\n */"} {"signature":"fun shouldCheckDeclaration ( declaration : Any ) : Boolean","body":"= when ( declaration ) { is KmFunction -> ! declaration . name . startsWith ( KNI_BRIDGE_FUNCTION_PREFIX ) else -> true }","docstring":"/**\n * Certain auxiliary metadata entities may be intentionally excluded from comparison.\n * Ex: Kotlin/Native interface bridge functions.\n */"} {"signature":"private fun KmFunction . dumpToString ( ) : String","body":"= buildString { receiverParameterType ? . classifier ? . let { classifier -> append ( classifier . dumpToString ( dumpClassifierType = true ) ) . append ( '' ) } append ( name ) if ( typeParameters . isNotEmpty ( ) ) { typeParameters . joinTo ( this , prefix = \"\" , postfix = \">\" ) { typeParameter -> val typeParameterText = \"\" if ( typeParameter . upperBounds . isNotEmpty ( ) ) { val upperBoundsText = typeParameter . upperBounds . joinToString { type -> type . dumpToString ( dumpExtras = false ) } \"\" } else typeParameterText } } valueParameters . joinTo ( this , prefix = \"\" , postfix = \"\" ) { valueParameter -> valueParameter . type . dumpToString ( dumpExtras = false ) } }","docstring":"/**\n * We need a stable order for overloaded functions.\n */"} {"signature":"fun < T : Number > around ( a : KtNDArray < T > , decimals : Int = ) : KtNDArray < T >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( a , decimals ) )","docstring":"/**\n * Evenly round to the given number of decimals.\n */"} {"signature":"fun < T : Number > rint ( a : KtNDArray < T > ) : KtNDArray < Double >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( a ) )","docstring":"/**\n * Round an array to the given number of decimals.\n */"} {"signature":"fun < T : Number > fix ( a : KtNDArray < T > ) : KtNDArray < Double >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( a ) )","docstring":"/**\n * Round to nearest integer towards zero.\n */"} {"signature":"fun < T : Number > floor ( a : KtNDArray < T > ) : KtNDArray < Double >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( a ) )","docstring":"/**\n * Return the floor of the input, element-wise.\n */"} {"signature":"fun < T : Number > ceil ( a : KtNDArray < T > ) : KtNDArray < Double >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( a ) )","docstring":"/**\n * Return the ceiling of the input, element-wise.\n */"} {"signature":"fun < T : Number > trunc ( a : KtNDArray < T > ) : KtNDArray < Double >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( a ) )","docstring":"/**\n * Return the truncated value of the input, element-wise.\n */"} {"signature":"fun parkedWorkersStackTopUpdate ( worker : Worker , oldIndex : Int , newIndex : Int )","body":"{ parkedWorkersStack . loop { top -> val index = ( top and PARKED_INDEX_MASK ) . toInt ( ) val updVersion = ( top + PARKED_VERSION_INC ) and PARKED_VERSION_MASK val updIndex = if ( index == oldIndex ) { if ( newIndex == ) { parkedWorkersStackNextIndex ( worker ) } else { newIndex } } else { index } if ( updIndex < ) return@loop if ( parkedWorkersStack . compareAndSet ( top , updVersion or updIndex . toLong ( ) ) ) return } }","docstring":"/**\n * Updates index of the worker at the top of [parkedWorkersStack].\n * It always updates version to ensure interference with [parkedWorkersStackPop] operation\n * that might have already decided to put this index to the top.\n *\n * Note, [newIndex] can be zero for the worker that is being terminated (removed from [workers]).\n */"} {"signature":"fun parkedWorkersStackPush ( worker : Worker ) : Boolean","body":"{ if ( worker . nextParkedWorker !== NOT_IN_STACK ) return false parkedWorkersStack . loop { top -> val index = ( top and PARKED_INDEX_MASK ) . toInt ( ) val updVersion = ( top + PARKED_VERSION_INC ) and PARKED_VERSION_MASK val updIndex = worker . indexInArray assert { updIndex != } worker . nextParkedWorker = workers [ index ] if ( parkedWorkersStack . compareAndSet ( top , updVersion or updIndex . toLong ( ) ) ) return true } }","docstring":"/**\n * Pushes worker into [parkedWorkersStack].\n * It does nothing is this worker is already physically linked to the stack.\n * This method is invoked only from the worker thread itself.\n * This invocation always precedes [LockSupport.parkNanos].\n * See [Worker.tryPark].\n *\n * Returns `true` if worker was added to the stack by this invocation, `false` if it was already\n * registered in the stack.\n */"} {"signature":"private fun parkedWorkersStackPop ( ) : Worker ?","body":"{ parkedWorkersStack . loop { top -> val index = ( top and PARKED_INDEX_MASK ) . toInt ( ) val worker = workers [ index ] ? : return null val updVersion = ( top + PARKED_VERSION_INC ) and PARKED_VERSION_MASK val updIndex = parkedWorkersStackNextIndex ( worker ) if ( updIndex < ) return@loop if ( parkedWorkersStack . compareAndSet ( top , updVersion or updIndex . toLong ( ) ) ) { worker . nextParkedWorker = NOT_IN_STACK return worker } } }","docstring":"/**\n * Pops worker from [parkedWorkersStack].\n * It can be invoked concurrently from any thread that is looking for help and needs to unpark some worker.\n * This invocation is always followed by an attempt to [LockSupport.unpark] resulting worker.\n * See [tryUnpark].\n */"} {"signature":"private fun parkedWorkersStackNextIndex ( worker : Worker ) : Int","body":"{ var next = worker . nextParkedWorker findNext @ while ( true ) { when { next === NOT_IN_STACK -> return - next === null -> return else -> { val nextWorker = next as Worker val updIndex = nextWorker . indexInArray if ( updIndex != ) return updIndex next = nextWorker . nextParkedWorker } } } }","docstring":"/**\n * Finds next usable index for [parkedWorkersStack]. The problem is that workers can\n * be terminated at their [Worker.indexInArray] becomes zero, so they cannot be\n * put at the top of the stack. In which case we are looking for next.\n *\n * Returns `index >= 0` or `-1` for retry.\n */"} {"signature":"fun dispatch ( block : Runnable , taskContext : TaskContext = NonBlockingContext , tailDispatch : Boolean = false )","body":"{ trackTask ( ) val task = createTask ( block , taskContext ) val isBlockingTask = task . isBlocking val stateSnapshot = if ( isBlockingTask ) incrementBlockingTasks ( ) else val currentWorker = currentWorker ( ) val notAdded = currentWorker . submitToLocalQueue ( task , tailDispatch ) if ( notAdded != null ) { if ( ! addToGlobalQueue ( notAdded ) ) { throw RejectedExecutionException ( \"\" ) } } val skipUnpark = tailDispatch && currentWorker != null if ( isBlockingTask ) { signalBlockingWork ( stateSnapshot , skipUnpark = skipUnpark ) } else { if ( skipUnpark ) return signalCpuWork ( ) } }","docstring":"/**\n * Dispatches execution of a runnable [block] with a hint to a scheduler whether\n * this [block] may execute blocking operations (IO, system calls, locking primitives etc.)\n *\n * [taskContext] -- concurrency context of given [block].\n * [tailDispatch] -- whether this [dispatch] call is the last action the (presumably) worker thread does in its current task.\n * If `true`, then the task will be dispatched in a FIFO manner and no additional workers will be requested,\n * but only if the current thread is a corresponding worker thread.\n * Note that caller cannot be ensured that it is being executed on worker thread for the following reasons:\n * - [CoroutineStart.UNDISPATCHED]\n * - Concurrent [close] that effectively shutdowns the worker thread\n */"} {"signature":"private fun createNewWorker ( ) : Int","body":"{ val worker : Worker return synchronized ( workers ) { if ( isTerminated ) return - val state = controlState . value val created = createdWorkers ( state ) val blocking = blockingTasks ( state ) val cpuWorkers = ( created - blocking ) . coerceAtLeast ( ) if ( cpuWorkers >= corePoolSize ) return if ( created >= maxPoolSize ) return val newIndex = createdWorkers + require ( newIndex > && workers [ newIndex ] == null ) worker = Worker ( newIndex ) workers . setSynchronized ( newIndex , worker ) require ( newIndex == incrementCreatedWorkers ( ) ) cpuWorkers + } . also { worker . start ( ) } }","docstring":"/**\n * Returns the number of CPU workers after this function (including new worker) or\n * 0 if no worker was created.\n */"} {"signature":"private fun Worker ? . submitToLocalQueue ( task : Task , tailDispatch : Boolean ) : Task ?","body":"{ if ( this == null ) return task if ( state === WorkerState . TERMINATED ) return task if ( task . mode == TASK_NON_BLOCKING && state === WorkerState . BLOCKING ) { return task } mayHaveLocalTasks = true return localQueue . add ( task , fair = tailDispatch ) }","docstring":"/**\n * Returns `null` if task was successfully added or an instance of the\n * task that was not added or replaced (thus should be added to global queue).\n */"} {"signature":"override fun toString ( ) : String","body":"{ var parkedWorkers = var blockingWorkers = var cpuWorkers = var dormant = var terminated = val queueSizes = arrayListOf < String > ( ) for ( index in until workers . currentLength ( ) ) { val worker = workers [ index ] ? : continue val queueSize = worker . localQueue . size when ( worker . state ) { WorkerState . PARKING -> ++ parkedWorkers WorkerState . BLOCKING -> { ++ blockingWorkers queueSizes += queueSize . toString ( ) + \"\" } WorkerState . CPU_ACQUIRED -> { ++ cpuWorkers queueSizes += queueSize . toString ( ) + \"\" } WorkerState . DORMANT -> { ++ dormant if ( queueSize > ) queueSizes += queueSize . toString ( ) + \"\" } WorkerState . TERMINATED -> ++ terminated } } val state = controlState . value return \"\" + \"\" + \"\" + \"\" + \"\" + \"\" + \"\" + \"\" + \"\" + \"\" + \"\" + \"\" + \"\" + \"\" + \"\" + \"\" + \"\" + \"\" }","docstring":"/**\n * Returns a string identifying the state of this scheduler for nicer debugging.\n * Note that this method is not atomic and represents rough state of pool.\n *\n * State of the queues:\n * b for blocking, c for CPU, r for retiring.\n * E.g. for [1b, 1b, 2c, 1d] means that pool has\n * two blocking workers with queue size 1, one worker with CPU permit and queue size 1\n * and one dormant (executing his local queue before parking) worker with queue size 1.\n */"} {"signature":"private fun tryAcquireCpuPermit ( ) : Boolean","body":"= when { state == WorkerState . CPU_ACQUIRED -> true this@CoroutineScheduler . tryAcquireCpuPermit ( ) -> { state = WorkerState . CPU_ACQUIRED true } else -> false }","docstring":"/**\n * Tries to acquire CPU token if worker doesn't have one\n * @return whether worker acquired (or already had) CPU token\n */"} {"signature":"fun tryReleaseCpu ( newState : WorkerState ) : Boolean","body":"{ val previousState = state val hadCpu = previousState == WorkerState . CPU_ACQUIRED if ( hadCpu ) releaseCpuPermit ( ) if ( previousState != newState ) state = newState return hadCpu }","docstring":"/**\n * Releases CPU token if worker has any and changes state to [newState].\n * Returns `true` if CPU permit was returned to the pool\n */"} {"signature":"fun runSingleTask ( ) : Long","body":"{ val stateSnapshot = state val isCpuThread = state == WorkerState . CPU_ACQUIRED val task = if ( isCpuThread ) { findCpuTask ( ) } else { findBlockingTask ( ) } if ( task == null ) { if ( minDelayUntilStealableTaskNs == ) return - return minDelayUntilStealableTaskNs } runSafely ( task ) if ( ! isCpuThread ) decrementBlockingTasks ( ) assert { state == stateSnapshot } return }","docstring":"/**\n * See [runSingleTaskFromCurrentSystemDispatcher] for rationale and details.\n * This is a fine-tailored method for a specific use-case not expected to be used widely.\n */"} {"signature":"private fun tryTerminateWorker ( )","body":"{ synchronized ( workers ) { if ( isTerminated ) return if ( createdWorkers <= corePoolSize ) return if ( ! workerCtl . compareAndSet ( PARKED , TERMINATED ) ) return val oldIndex = indexInArray indexInArray = parkedWorkersStackTopUpdate ( this , oldIndex , ) val lastIndex = decrementCreatedWorkers ( ) if ( lastIndex != oldIndex ) { val lastWorker = workers [ lastIndex ] ! ! workers . setSynchronized ( oldIndex , lastWorker ) lastWorker . indexInArray = oldIndex parkedWorkersStackTopUpdate ( lastWorker , lastIndex , oldIndex ) } workers . setSynchronized ( lastIndex , null ) } state = WorkerState . TERMINATED }","docstring":"/**\n * Stops execution of current thread and removes it from [createdWorkers].\n */"} {"signature":"@ JvmName ( \"\" ) internal fun isSchedulerWorker ( thread : Thread )","body":"= thread is CoroutineScheduler . Worker","docstring":"/**\n * Checks if the thread is part of a thread pool that supports coroutines.\n * This function is needed for integration with BlockHound.\n */"} {"signature":"@ JvmName ( \"\" ) internal fun mayNotBlock ( thread : Thread )","body":"= thread is CoroutineScheduler . Worker && thread . state == CoroutineScheduler . WorkerState . CPU_ACQUIRED","docstring":"/**\n * Checks if the thread is running a CPU-bound task.\n * This function is needed for integration with BlockHound.\n */"} {"signature":"private fun String . getRootLength ( ) : Int","body":"{ var first = indexOf ( File . separatorChar , ) if ( first == ) { if ( length > && this [ ] == File . separatorChar ) { first = indexOf ( File . separatorChar , ) if ( first >= ) { first = indexOf ( File . separatorChar , first + ) if ( first >= ) return first + else return length } } return } if ( first > && this [ first - ] == '' ) { first ++ return first } if ( first == - && endsWith ( '' ) ) return length return }","docstring":"/**\n * Estimation of a root name by a given file name.\n *\n * This implementation is able to find /, Drive:/, Drive: or\n * //network.name/root as possible root names.\n * / denotes File.separator here so \\ can be used instead.\n * All other possible roots cannot be identified by this implementation.\n * It's also not guaranteed (but possible) that function will be able to detect a root\n * which is incorrect for current OS. For instance, in Unix function cannot detect\n * network root names like //network.name/root, but can detect Windows roots like C:/.\n *\n * @return length or a substring representing the root for this path, or zero if this file name is relative.\n */"} {"signature":"public fun subPath ( beginIndex : Int , endIndex : Int ) : File","body":"{ if ( beginIndex < || beginIndex > endIndex || endIndex > size ) throw IllegalArgumentException ( ) return File ( segments . subList ( beginIndex , endIndex ) . joinToString ( File . separator ) ) }","docstring":"/**\n * Returns a sub-path of the path, starting with the directory at the specified [beginIndex] and up\n * to the specified [endIndex].\n */"} {"signature":"internal fun File . toComponents ( ) : FilePathComponents","body":"{ val path = path val rootLength = path . getRootLength ( ) val rootName = path . substring ( , rootLength ) val subPath = path . substring ( rootLength ) val list = if ( subPath . isEmpty ( ) ) listOf ( ) else subPath . split ( File . separatorChar ) . map ( :: File ) return FilePathComponents ( File ( rootName ) , list ) }","docstring":"/**\n * Splits the file into path components (the names of containing directories and the name of the file\n * itself) and returns the resulting collection of components.\n */"} {"signature":"internal fun File . subPath ( beginIndex : Int , endIndex : Int ) : File","body":"= toComponents ( ) . subPath ( beginIndex , endIndex )","docstring":"/**\n * Returns a relative pathname which is a subsequence of this pathname,\n * beginning from component [beginIndex], inclusive,\n * ending at component [endIndex], exclusive.\n * Number 0 belongs to a component closest to the root,\n * number count-1 belongs to a component farthest from the root.\n * @throws IllegalArgumentException if [beginIndex] is negative,\n * or [endIndex] is greater than existing number of components,\n * or [beginIndex] is greater than [endIndex].\n */"} {"signature":"@ Test fun `test - diamond hierarchy from documentation example` ( )","body":"{ kotlin . applyHierarchyTemplate { common { group ( \"\" ) { withIos ( ) } group ( \"\" ) { withJvm ( ) group ( \"\" ) } group ( \"\" ) { withMacos ( ) group ( \"\" ) } } } kotlin . iosX64 ( ) kotlin . iosArm64 ( ) kotlin . macosX64 ( ) kotlin . jvm ( ) assertEquals ( stringSetOf ( \"\" , \"\" ) , kotlin . dependingSourceSetNames ( \"\" ) ) assertEquals ( stringSetOf ( \"\" , \"\" ) , kotlin . dependingSourceSetNames ( \"\" ) ) assertEquals ( stringSetOf ( \"\" , \"\" ) , kotlin . dependingSourceSetNames ( \"\" ) ) assertEquals ( stringSetOf ( \"\" , \"\" ) , kotlin . dependingSourceSetNames ( \"\" ) ) }","docstring":"/**\n * Example from the documentation is supposed to create\n * commonMain\n * |\n * +------------+----------+\n * | |\n * frontendMain appleMain\n * | |\n * +---------+------------+-----------+----------+\n * | | |\n * jvmMain iosMain macosX64Main\n * |\n * |\n * +----+----+\n * | |\n * iosX64Main iosArm64Main\n */"} {"signature":"private fun ClassId . getOutermostClassName ( )","body":"= relativeClassName . pathSegments ( ) . first ( ) . asString ( )","docstring":"/**\n * Gets the short outermost class name. For example, `foo.bar.Foo` -> `Foo`. `foo.bar.Outer.Inner.InnerAgain` -> `Outer`.\n */"} {"signature":"internal fun artifactGenerationTaskName ( variant : String )","body":"= \"\"","docstring":"/**\n * Name for task for generating Kover artifact.\n */"} {"signature":"internal fun htmlReportTaskName ( variant : String )","body":"= \"\"","docstring":"/**\n * Name for HTML reporting task for specified report namespace.\n */"} {"signature":"internal fun xmlReportTaskName ( variant : String )","body":"= \"\"","docstring":"/**\n * Name for XML reporting task for specified report namespace.\n */"} {"signature":"internal fun binaryReportTaskName ( variant : String )","body":"= \"\"","docstring":"/**\n * Name for binary reporting task for specified report namespace.\n */"} {"signature":"internal fun verifyCachedTaskName ( variant : String )","body":"= \"\"","docstring":"/**\n * Name for cached verifying task for specified report namespace.\n */"} {"signature":"internal fun verifyTaskName ( variant : String )","body":"= \"\"","docstring":"/**\n * Name for verifying task for specified report namespace.\n */"} {"signature":"internal fun logTaskName ( variant : String )","body":"= \"\"","docstring":"/**\n * Name for coverage logging task.\n */"} {"signature":"internal fun printLogTaskName ( variant : String )","body":"= \"\"","docstring":"/**\n * Name for task to print coverage to the log.\n */"} {"signature":"internal fun binReportName ( taskName : String , toolVendor : CoverageToolVendor ) : String","body":"{ return \"\" }","docstring":"/**\n * Name of binary report for specified test task name (without directory path).\n */"} {"signature":"internal fun artifactConfigurationName ( variantName : String ) : String","body":"= \"\"","docstring":"/**\n * Name of the Gradle configuration for sharing Kover artifact.\n */"} {"signature":"internal fun externalArtifactConfigurationName ( variantName : String ) : String","body":"= \"\"","docstring":"/**\n * Name of the Gradle configuration for collecting Kover artifacts from dependencies.\n */"} {"signature":"public inline fun < M : ExecutionProviderCompatible , R > M . inferAndCloseUsing ( vararg providers : ExecutionProvider , block : ( M ) -> R ) : R","body":"{ this . initializeWith ( * providers ) return this . use ( block ) }","docstring":"/**\n * Extension function for explicitly specifying the execution provider for specific code block.\n * Follows [kotlin.use] semantics.\n */"} {"signature":"public inline fun < M : ExecutionProviderCompatible , R > M . inferUsing ( vararg providers : ExecutionProvider , block : ( M ) -> R ) : R","body":"{ this . initializeWith ( * providers ) return this . run ( block ) }","docstring":"/**\n * Extension function for explicitly specifying the execution provider for specific code block.\n * Follows [kotlin.run] semantics.\n */"} {"signature":"public fun BarContext . border ( block : BorderLayerContext . ( ) -> Unit )","body":"{ BorderLayerContext ( this ) . apply ( block ) }","docstring":"/**\n * Adds [border][BorderLayerContext] settings to [bars][org.jetbrains.kotlinx.kandy.echarts.layers.bars].\n */"} {"signature":"public fun PointContext . border ( block : BorderLayerContext . ( ) -> Unit )","body":"{ BorderLayerContext ( this ) . apply ( block ) }","docstring":"/**\n * Adds [border][BorderLayerContext] settings to [points][org.jetbrains.kotlinx.kandy.echarts.layers.points].\n */"} {"signature":"public operator fun get ( index : Int ) : MatchGroup ?","body":"public operator fun get ( index : Int ) : MatchGroup ?","docstring":"/** Returns a group with the specified [index].\n *\n * @return An instance of [MatchGroup] if the group with the specified [index] was matched or `null` otherwise.\n *\n * Groups are indexed from 1 to the count of groups in the regular expression. A group with the index 0\n * corresponds to the entire match.\n */"} {"signature":"public operator fun get ( name : String ) : MatchGroup ?","body":"public operator fun get ( name : String ) : MatchGroup ?","docstring":"/**\n * Returns a named group with the specified [name].\n * @return An instance of [MatchGroup] if the group with the specified [name] was matched or `null` otherwise.\n * @throws IllegalArgumentException if there is no group with the specified [name] defined in the regex pattern.\n * @throws UnsupportedOperationException if this match group collection doesn't support getting match groups by name,\n * for example, when it's not supported by the current platform.\n */"} {"signature":"public fun next ( ) : MatchResult ?","body":"public fun next ( ) : MatchResult ?","docstring":"/** Returns a new [MatchResult] with the results for the next match, starting at the position\n * at which the last match ended (at the character after the last matched character).\n */"} {"signature":"public fun toList ( ) : List < String >","body":"= match . groupValues . subList ( , match . groupValues . size )","docstring":"/**\n * Returns destructured group values as a list of strings.\n * First value in the returned list corresponds to the value of the first group, and so on.\n *\n * @sample samples.text.Regexps.matchDestructuringToGroupValues\n */"} {"signature":"public suspend inline fun < T > MaybeSource < T > . collect ( action : ( T ) -> Unit ) : Unit","body":"= toChannel ( ) . consumeEach ( action )","docstring":"/**\n * Subscribes to this [MaybeSource] and performs the specified action for each received element.\n *\n * If [action] throws an exception at some point or if the [MaybeSource] raises an error, the exception is rethrown from\n * [collect].\n */"} {"signature":"public suspend inline fun < T > ObservableSource < T > . collect ( action : ( T ) -> Unit ) : Unit","body":"= toChannel ( ) . consumeEach ( action )","docstring":"/**\n * Subscribes to this [ObservableSource] and performs the specified action for each received element.\n *\n * If [action] throws an exception at some point, the subscription is cancelled, and the exception is rethrown from\n * [collect]. Also, if the [ObservableSource] signals an error, that error is rethrown from [collect].\n */"} {"signature":"@ Deprecated ( message = \"\" , level = DeprecationLevel . HIDDEN ) public fun < T > ObservableSource < T & Any > . openSubscription ( ) : ReceiveChannel < T >","body":"{ val channel = SubscriptionChannel < T > ( ) subscribe ( channel ) return channel }","docstring":"/** @suppress */"} {"signature":"@ Deprecated ( message = \"\" , level = DeprecationLevel . HIDDEN ) public fun < T > MaybeSource < T & Any > . openSubscription ( ) : ReceiveChannel < T >","body":"{ val channel = SubscriptionChannel < T > ( ) subscribe ( channel ) return channel }","docstring":"/** @suppress */"} {"signature":"public inline fun EChartsLayout . tooltip ( crossinline block : Tooltip . ( ) -> Unit )","body":"{ this . tooltip = Tooltip ( ) . apply ( block ) }","docstring":"/**\n * Configures global tooltip.\n *\n * - [trigger][Tooltip.trigger] - [type][Trigger] of triggering\n * - [formatter][Tooltip.formatter] - the content formatter of tooltip's floating layer\n *\n * ```kotlin\n * plot {\n * layout {\n * tooltip {\n * trigger = Trigger.AXIS\n * formatter = \"layer {a}}\n * }\n * }\n * }\n * ```\n *\n * @see org.jetbrains.kotlinx.kandy.echarts.layers.layout\n * @see EChartsLayout\n */"} {"signature":"@ ContractsDsl public fun returns ( ) : Returns","body":"@ ContractsDsl public fun returns ( ) : Returns","docstring":"/**\n * Describes a situation when a function returns normally, without any exceptions thrown.\n *\n * Use [SimpleEffect.implies] function to describe a conditional effect that happens in such case.\n *\n */"} {"signature":"@ ContractsDsl public fun returns ( value : Any ? ) : Returns","body":"@ ContractsDsl public fun returns ( value : Any ? ) : Returns","docstring":"/**\n * Describes a situation when a function returns normally with the specified return [value].\n *\n * The possible values of [value] are limited to `true`, `false` or `null`.\n *\n * Use [SimpleEffect.implies] function to describe a conditional effect that happens in such case.\n *\n */"} {"signature":"@ ContractsDsl public fun returnsNotNull ( ) : ReturnsNotNull","body":"@ ContractsDsl public fun returnsNotNull ( ) : ReturnsNotNull","docstring":"/**\n * Describes a situation when a function returns normally with any value that is not `null`.\n *\n * Use [SimpleEffect.implies] function to describe a conditional effect that happens in such case.\n *\n */"} {"signature":"inline fun < reified E : Exception > assertThrows ( message : String = \"\" , body : ( ) -> Unit , ) : Throwable","body":"{ try { body ( ) } catch ( e : Throwable ) { if ( e is E ) { return e } } throw AssertionError ( message ) }","docstring":"/**\n * A replacement for the JUnit Jupiter function to be used in JUnit 4 tests.\n *\n * Asserts that the given code block throws an exception of the specified type.\n *\n * @param E the type of exception that is expected to be thrown\n * @param message the error message to be used if the exception is not thrown\n * @param body the code block to be executed and verified\n * @return the caught exception if it is of the specified type\n * @throws AssertionError if the specified exception is not thrown\n */"} {"signature":"fun < R > assertDoesNotThrow ( message : String = \"\" , body : ( ) -> R , ) : R","body":"{ try { return body ( ) } catch ( e : Throwable ) { throw AssertionError ( message . format ( e ) ) } }","docstring":"/**\n * A replacement for the JUnit Jupiter function to be used in JUnit 4 tests.\n *\n * Asserts that the specified code block does not throw any exception.\n *\n * @param message The message to be included in the AssertionError if an exception is thrown.\n * It can contain the \"{}\" placeholder, which will be replaced with the thrown exception.\n * @param body The code block to be executed.\n *\n * @return The result of executing the code block.\n *\n * @throws AssertionError If the code block throws an exception.\n */"} {"signature":"private fun createModules ( moduleStructure : TestModuleStructure , testServices : TestServices , project : Project , ) : List < KtTestModule >","body":"{ val moduleCount = moduleStructure . modules . size val existingModules = HashMap < String , KtTestModule > ( moduleCount ) val result = ArrayList < KtTestModule > ( moduleCount ) for ( testModule in moduleStructure . modules ) { val contextModuleName = testModule . directives . singleOrZeroValue ( AnalysisApiTestDirectives . CONTEXT_MODULE ) val contextModule = contextModuleName ? . let ( existingModules :: getValue ) val dependencyBinaryRoots = testModule . regularDependencies . flatMap { dependency -> val libraryModule = existingModules . getValue ( dependency . moduleName ) . ktModule as? KtLibraryModule libraryModule ? . getBinaryRoots ( ) . orEmpty ( ) } val ktTestModule = testServices . getKtModuleFactoryForTestModule ( testModule ) . createModule ( testModule , contextModule , dependencyBinaryRoots , testServices , project ) existingModules [ testModule . name ] = ktTestModule result . add ( ktTestModule ) } return result }","docstring":"/**\n * The test infrastructure ensures that the given [moduleStructure] contains properly ordered dependencies: a [TestModule] can only\n * depend on test modules which precede it. Hence, this function does not need to order dependencies itself.\n *\n * @return A list of [KtTestModule]s in the same order as [TestModuleStructure.modules].\n */"} {"signature":"private fun KtModule . addToLibraryCacheIfNeeded ( libraryCache : LibraryCache )","body":"{ if ( this is KtBinaryModule ) { libraryCache . put ( getBinaryRoots ( ) . toSet ( ) , this ) } }","docstring":"/**\n * A main module may be a binary library module, which may be a dependency of subsequent main modules. We need to add such a module to\n * the library cache before it is processed as a dependency. Otherwise, when another module's binary dependency is processed,\n * [addLibraryDependencies] will create a *duplicate* binary library module with the same roots and name as the already existing binary\n * library module.\n */"} {"signature":"private inline fun < reified T : PsiElement > PsiElement . forEachDescendantOfType ( noinline predicate : ( T ) -> Boolean = { true } , noinline action : ( T ) -> Unit , )","body":"= this . accept ( object : PsiRecursiveElementVisitor ( ) { override fun visitElement ( element : PsiElement ) { if ( element is T && predicate ( element ) ) { action ( element ) } super . visitElement ( element ) } } )","docstring":"/**\n * Processes the descendants of the element using the preorder implementation of tree traversal.\n */"} {"signature":"private fun isRelated ( a : KotlinType , b : KotlinType , platformToKotlinClassMapper : PlatformToKotlinClassMapper ) : Boolean","body":"{ val aClasses = mapToPlatformIndependentClasses ( a , platformToKotlinClassMapper ) val bClasses = mapToPlatformIndependentClasses ( b , platformToKotlinClassMapper ) return aClasses . any { DescriptorUtils . isSubtypeOfClass ( b , it ) } || bClasses . any { DescriptorUtils . isSubtypeOfClass ( a , it ) } }","docstring":"/**\n * Two types are related, roughly, when one of them is a subtype of the other constructing class\n *\n * Note that some types have platform-specific counterparts, i.e. kotlin.String is mapped to java.lang.String,\n * such types (and all their sub- and supertypes) are related too.\n *\n * Due to limitations in PlatformToKotlinClassMap, we only consider mapping of platform classes to Kotlin classed\n * (i.e. java.lang.String -> kotlin.String) and ignore mappings that go the other way.\n */"} {"signature":"@ JvmStatic fun isCastErased ( supertype : KotlinType , subtype : KotlinType , typeChecker : KotlinTypeChecker ) : Boolean","body":"{ val isNonReifiedTypeParameter = TypeUtils . isNonReifiedTypeParameter ( subtype ) val isUpcast = typeChecker . isSubtypeOf ( supertype , subtype ) if ( isNonReifiedTypeParameter && ! isUpcast ) { val nullableToDefinitelyNotNull = ! TypeUtils . isNullableType ( subtype ) && supertype . makeNotNullable ( ) == subtype if ( ! nullableToDefinitelyNotNull ) { return true } } if ( supertype . isMarkedNullable || subtype . isMarkedNullable ) { return isCastErased ( TypeUtils . makeNotNullable ( supertype ) , TypeUtils . makeNotNullable ( subtype ) , typeChecker ) } if ( isUpcast ) return false if ( isNonReifiedTypeParameter ) return true if ( allParametersReified ( subtype ) ) return false val staticallyKnownSubtype = findStaticallyKnownSubtype ( supertype , subtype . constructor ) . resultingType ? : return true return ! typeChecker . isSubtypeOf ( staticallyKnownSubtype , subtype ) }","docstring":"/**\n * Check if cast from supertype to subtype is erased.\n * It is an error in \"is\" statement and warning in \"as\".\n */"} {"signature":"@ JvmStatic fun findStaticallyKnownSubtype ( supertype : KotlinType , subtypeConstructor : TypeConstructor ) : TypeReconstructionResult","body":"{ assert ( ! supertype . isMarkedNullable ) { \"\" } val descriptor = subtypeConstructor . declarationDescriptor ? : error ( \"\" + subtypeConstructor ) val subtypeWithVariables = descriptor . defaultType val supertypeWithVariables = TypeCheckingProcedure . findCorrespondingSupertype ( subtypeWithVariables , supertype ) val variables = subtypeWithVariables . constructor . parameters val variableConstructors = variables . map ( TypeParameterDescriptor :: getTypeConstructor ) . toSet ( ) val substitution : MutableMap < TypeConstructor , TypeProjection > = if ( supertypeWithVariables != null ) { val solution = TypeUnifier . unify ( TypeProjectionImpl ( supertype ) , TypeProjectionImpl ( supertypeWithVariables ) , variableConstructors :: contains ) Maps . newHashMap ( solution . substitution ) } else { Maps . newHashMapWithExpectedSize < TypeConstructor , TypeProjection > ( variables . size ) } var allArgumentsInferred = true for ( variable in variables ) { val value = substitution [ variable . typeConstructor ] if ( value == null ) { substitution . put ( variable . typeConstructor , TypeUtils . makeStarProjection ( variable ) ) allArgumentsInferred = false } } val substituted = TypeSubstitutor . create ( substitution ) . substitute ( subtypeWithVariables , Variance . INVARIANT ) return TypeReconstructionResult ( substituted , allArgumentsInferred ) }","docstring":"/**\n * Remember that we are trying to cast something of type `supertype` to `subtype`.\n\n * Since at runtime we can only check the class (type constructor), the rest of the subtype should be known statically, from supertype.\n * This method reconstructs all static information that can be obtained from supertype.\n\n * Example 1:\n * supertype = Collection\n * subtype = List<...>\n * result = List, all arguments are inferred\n\n * Example 2:\n * supertype = Any\n * subtype = List<...>\n * result = List<*>, some arguments were not inferred, replaced with '*'\n */"} {"signature":"actual fun getTimesInMillis ( ) : String","body":"= Date . now ( ) . toString ( )","docstring":"/**\n * JS implementation of getTimeInMillis\n */"} {"signature":"actual fun getYear ( ) : String","body":"{ TODO ( \"\" ) }","docstring":"/**\n * JS custom kdoc\n */"} {"signature":"open fun nonReflectKind ( ) : FunctionTypeKind","body":"{ return if ( isReflectType ) error ( \"\" ) else this }","docstring":"/**\n * @return corresponding non-reflect kind for reflect kind\n * @return [this] if [isReflectType] is false\n *\n * Should be overridden for reflect kinds\n */"} {"signature":"open fun reflectKind ( ) : FunctionTypeKind","body":"{ return if ( isReflectType ) this else error ( \"\" ) }","docstring":"/**\n * @return corresponding reflect kind for non-reflect kind\n * @return [this] if [isReflectType] is true\n *\n * Should be overridden for non reflect kinds\n */"} {"signature":"private fun FirPropertySymbol . containingClassOrFile ( context : CheckerContext ) : FirBasedSymbol < * > ?","body":"{ return getContainingClassSymbol ( context . session ) ? : context . session . firProvider . getFirCallableContainerFile ( this ) ? . symbol }","docstring":"/**\n * Returns the containing class or file if the property is top-level.\n */"} {"signature":"abstract fun transformVariableAssignment ( variableAssignment : FirVariableAssignment ) : FirStatement ?","body":"abstract fun transformVariableAssignment ( variableAssignment : FirVariableAssignment ) : FirStatement ?","docstring":"/**\n * At this point [variableAssignment] contains resolved and completed lhs and calleeReference(lvalue)\n * and unresolved rValue expression\n *\n * It's allowed to transform [variableAssignment] into any kind of statement. This state should be unresolved\n * (modulo usages of already resolved parts, like lValue). Later this statement will be resolved by compiler\n * itself using regular resolution algorithms\n */"} {"signature":"public fun < T > color ( column : ColumnReference < T > , parameters : LetsPlotNonPositionalMappingParametersContinuous < T , Color > . ( ) -> Unit = { } ) : NonPositionalMapping < T , Color >","body":"{ return addNonPositionalMapping < T , Color > ( COLOR , column . name ( ) , LetsPlotNonPositionalMappingParametersContinuous < T , Color > ( ) . apply ( parameters ) ) }","docstring":"/**\n * Maps the `color` aesthetic to a data column by [ColumnReference].\n *\n * @param column the data column to map to the color.\n * @param parameters optional lambda to configure additional scale parameters.\n * @return a [NonPositionalMapping] object representing the mapping.\n */"} {"signature":"public fun < T > color ( column : KProperty < T > , parameters : LetsPlotNonPositionalMappingParametersContinuous < T , Color > . ( ) -> Unit = { } ) : NonPositionalMapping < T , Color >","body":"{ return addNonPositionalMapping < T , Color > ( COLOR , column . name , LetsPlotNonPositionalMappingParametersContinuous < T , Color > ( ) . apply ( parameters ) ) }","docstring":"/**\n * Maps the `color` aesthetic to a data column by [KProperty].\n *\n * @param column the data column to map to the color.\n * @param parameters optional lambda to configure additional scale parameters.\n * @return a [NonPositionalMapping] object representing the mapping.\n */"} {"signature":"public fun color ( column : String , parameters : LetsPlotNonPositionalMappingParametersContinuous < Any ? , Color > . ( ) -> Unit = { } ) : NonPositionalMapping < Any ? , Color >","body":"{ return addNonPositionalMapping < Any ? , Color > ( COLOR , column , LetsPlotNonPositionalMappingParametersContinuous < Any ? , Color > ( ) . apply ( parameters ) ) }","docstring":"/**\n * Maps the `color` aesthetic to a data column by [String].\n *\n * @param column the data column to map to the color.\n * @param parameters optional lambda to configure additional scale parameters.\n * @return a [NonPositionalMapping] object representing the mapping.\n */"} {"signature":"public fun < T > color ( values : Iterable < T > , name : String ? = null , parameters : LetsPlotNonPositionalMappingParametersContinuous < T , Color > . ( ) -> Unit = { } ) : NonPositionalMapping < T , Color >","body":"{ return addNonPositionalMapping < T , Color > ( COLOR , values . toList ( ) , name , LetsPlotNonPositionalMappingParametersContinuous < T , Color > ( ) . apply ( parameters ) ) }","docstring":"/**\n * Maps the `color` 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 > color ( values : DataColumn < T > , parameters : LetsPlotNonPositionalMappingParametersContinuous < T , Color > . ( ) -> Unit = { } ) : NonPositionalMapping < T , Color >","body":"{ return addNonPositionalMapping < T , Color > ( COLOR , values , LetsPlotNonPositionalMappingParametersContinuous < T , Color > ( ) . apply ( parameters ) ) }","docstring":"/**\n * Maps the `color` aesthetic to a data column.\n *\n * @param values the data column to map to the color.\n * @param parameters optional lambda to configure additional scale parameters.\n * @return a [NonPositionalMapping] object representing the mapping.\n */"} {"signature":"private fun KtDotQualifiedExpression . fqNameSegments ( ) : List < String > ?","body":"{ val qualifiers = generateSequence ( this as KtExpression ) { ( it as? KtDotQualifiedExpression ) ? . receiverExpression } . map { ( it as? KtDotQualifiedExpression ) ? . selectorExpression ? : it } . toList ( ) . asReversed ( ) val qualifyingReferences = qualifiers . mapIndexed { index , qualifier -> if ( qualifier is KtCallExpression && index != qualifiers . lastIndex ) return null qualifier . referenceExpression ( ) as? KtNameReferenceExpression ? : return null } return qualifyingReferences . map { it . getReferencedName ( ) } }","docstring":"/**\n * Returns the segments of a qualified access PSI. For example, given `foo.bar.OuterClass.InnerClass`, this returns `[\"foo\", \"bar\",\n * \"OuterClass\", \"InnerClass\"]`.\n */"} {"signature":"private fun ClassId . dropLastNestedClasses ( classesToDrop : Int )","body":"= generateSequence ( this ) { it . outerClassId } . drop ( classesToDrop ) . firstOrNull ( )","docstring":"/**\n * @return class id without [classesToDrop] last nested classes, or `null` if [classesToDrop] is too big.\n *\n * Example: `foo.bar.Baz.Inner` with 1 dropped class is `foo.bar.Baz`, and with 2 dropped class is `null`.\n */"} {"signature":"private fun countQualifiersToDrop ( wholeType : KtUserType , nestedType : KtUserType ) : Int","body":"{ val qualifierIndex = generateSequence ( wholeType ) { it . qualifier } . indexOf ( nestedType ) require ( qualifierIndex != - ) { \"\" } return qualifierIndex }","docstring":"/**\n * @return How many qualifiers needs to be dropped from [wholeType] to get [nestedType].\n *\n * Example: to get `foo.bar` from `foo.bar.Baz.Inner`, you need to drop 2 qualifiers (`Inner` and `Baz`).\n */"} {"signature":"fun collectDiagnostics ( file : KtFile , filter : DiagnosticCheckerFilter ) : List < KtPsiDiagnostic >","body":"fun collectDiagnostics ( file : KtFile , filter : DiagnosticCheckerFilter ) : List < KtPsiDiagnostic >","docstring":"/**\n * Returns all compiler diagnostics for the [file], matching the [filter].\n */"} {"signature":"fun getDiagnostics ( element : KtElement , filter : DiagnosticCheckerFilter ) : List < KtPsiDiagnostic >","body":"fun getDiagnostics ( element : KtElement , filter : DiagnosticCheckerFilter ) : List < KtPsiDiagnostic >","docstring":"/**\n * Returns all compiler diagnostics for the specific [element], matching the [filter].\n * This function is not recursive; diagnostics for nested elements are not returned.\n */"} {"signature":"fun < T : Number > median ( a : KtNDArray < T > ) : Double","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( a ) , kClass = Double :: class )","docstring":"/**\n * Compute the median along the specified axis.\n */"} {"signature":"fun < T : Number > median ( a : KtNDArray < T > , axis : Int ) : KtNDArray < Double >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( a , axis ) )","docstring":"/**\n *\n */"} {"signature":"fun < T : Number > average ( a : KtNDArray < T > ) : Double","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( a ) , kClass = Double :: class )","docstring":"/**\n * Compute the weighted average along the specified axis.\n */"} {"signature":"fun < T : Number > average ( a : KtNDArray < T > , axis : Int ) : KtNDArray < Double >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( a , axis ) )","docstring":"/**\n *\n */"} {"signature":"fun < T : Number > mean ( a : KtNDArray < T > ) : Double","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( a ) , kClass = Double :: class )","docstring":"/**\n * Compute the arithmetic mean along the specified axis.\n */"} {"signature":"fun < T : Number > mean ( a : KtNDArray < T > , axis : Int ) : KtNDArray < Double >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( a , axis ) )","docstring":"/**\n *\n */"} {"signature":"fun < T : Number > std ( a : KtNDArray < T > , ddof : Int = ) : Double","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( a , ddof ) , kClass = Double :: class )","docstring":"/**\n * Compute the standard deviation along the specified axis.\n */"} {"signature":"fun < T : Number > std ( a : KtNDArray < T > , axis : Int , ddof : Int = ) : KtNDArray < Double >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( a , axis , ddof ) )","docstring":"/**\n *\n */"} {"signature":"fun < T : Number > `var` ( a : KtNDArray < T > , ddof : Int = ) : Double","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( a , ddof ) , kClass = Double :: class )","docstring":"/**\n * Compute the variance along the specified axis.\n */"} {"signature":"fun < T : Number > `var` ( a : KtNDArray < T > , axis : Int , ddof : Int = ) : KtNDArray < Double >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( a , axis , ddof ) )","docstring":"/**\n *\n */"} {"signature":"fun < T : Number > nanMedian ( a : KtNDArray < T > ) : Double","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( a ) , kClass = Double :: class )","docstring":"/**\n * Compute the median along the specified axis, while ignoring NaNs.\n */"} {"signature":"fun < T : Number > nanMedian ( a : KtNDArray < T > , axis : Int ) : KtNDArray < Double >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( a , axis ) )","docstring":"/**\n *\n */"} {"signature":"fun < T : Number > nanMean ( a : KtNDArray < T > ) : Double","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( a ) , kClass = Double :: class )","docstring":"/**\n * Compute the arithmetic mean along the specified axis, ignoring NaNs.\n */"} {"signature":"fun < T : Number > nanMean ( a : KtNDArray < T > , axis : Int ) : KtNDArray < Double >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( a , axis ) )","docstring":"/**\n *\n */"} {"signature":"fun < T : Number > nanStd ( a : KtNDArray < T > , ddof : Int = ) : Double","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( a , ddof ) , kClass = Double :: class )","docstring":"/**\n * Compute the standard deviation along the specified axis, while ignoring NaNs.\n */"} {"signature":"fun < T : Number > nanStd ( a : KtNDArray < T > , axis : Int , ddof : Int = ) : KtNDArray < Double >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( a , axis , ddof ) )","docstring":"/**\n *\n */"} {"signature":"fun < T : Number > nanVar ( a : KtNDArray < T > , ddof : Int = ) : Double","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( a , ddof ) , kClass = Double :: class )","docstring":"/**\n * Compute the variance along the specified axis, while ignoring NaNs.\n */"} {"signature":"fun < T : Number > nanVar ( a : KtNDArray < T > , axis : Int , ddof : Int = ) : KtNDArray < Double >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( a , axis , ddof ) )","docstring":"/**\n *\n */"} {"signature":"fun looksLikeReplCommand ( code : String ) : Boolean","body":"= replCommandRegex . matches ( code )","docstring":"/**\n * If this function returns true for the [code], it will be interpreted as Jupyter REPL command\n */"} {"signature":"fun assertLooksLikeReplCommand ( code : String )","body":"{ require ( looksLikeReplCommand ( code ) ) { \"\" } }","docstring":"/**\n * Throws [IllegalArgumentException] in case [looksLikeReplCommand] returns false for [code]\n */"} {"signature":"fun replCommandOrNull ( code : String ) : Pair < ReplCommand ? , String >","body":"{ assertLooksLikeReplCommand ( code ) val match = replCommandRegex . matchEntire ( code ) ! ! val commandString = match . groupValues [ ] return ReplCommand . valueOfOrNull ( commandString ) ? . value to commandString }","docstring":"/**\n * Preprocesses REPL command and returns its value,\n * or null in case it's invalid, packed with string used for value\n * extraction\n *\n * @param code Code snippet for which [looksLikeReplCommand] should return true\n * @return Command value or null in case it is not valid, packed with value used for value extraction\n */"} {"signature":"@ DisplayName ( \"\" ) @ GradleTest fun testNoDeprecationOnAssociatedDep ( gradleVersion : GradleVersion )","body":"{ project ( \"\" , gradleVersion ) { build ( \"\" ) } }","docstring":"/** Regression test for KT-45787. **/"} {"signature":"override fun toProtobufMessage ( ) : TestData . MessageWithOptionals","body":"= TestData . MessageWithOptionals . newBuilder ( ) . also { builder -> if ( _a != null ) builder . a = _a if ( _b != null ) builder . b = _b if ( _c != null ) builder . c = _c . toProtoBuf ( ) if ( _d != null ) builder . d = _d if ( _e != null ) builder . addAllE ( _e ) } . build ( )","docstring":"/**\n * Convert this [Serializable] object to its expected [TestData.MessageWithOptionals] ProtoBuf message.\n *\n * For this test we expect that `null` values are not encoded.\n */"} {"signature":"fun deserializeAndSave ( data : SerializedCompiledScriptsData , scriptsDir : Path , sourcesDir : Path , ) : List < String >","body":"{ val classNames = mutableListOf < String > ( ) deserializeCompiledScripts ( data ) . forEach { ( script , bytes ) -> val file = scriptsDir . resolve ( script . fileName ) . toFile ( ) file . parentFile . mkdirs ( ) if ( script . isImplicitReceiver ) { classNames . add ( file . nameWithoutExtension ) } FileOutputStream ( file ) . use { fos -> BufferedOutputStream ( fos ) . use { out -> out . write ( bytes ) out . flush ( ) } } } data . sources . forEach { scriptSource -> val file = sourcesDir . resolve ( scriptSource . fileName ) . toFile ( ) file . parentFile . mkdirs ( ) file . writeText ( scriptSource . text ) } return classNames }","docstring":"/**\n * Deserializes [data] containing information about compiled scripts, saves\n * it to the [scriptsDir] directory, returns the list of names of classes\n * which are meant to be implicit receivers. Saves script sources to [sourcesDir].\n */"} {"signature":"@ Test fun testStringRepresentationWithConstants ( )","body":"{ val format = DateTimeComponents . Format { date ( LocalDate . Formats . ISO ) char ( '' ) time ( LocalTime . Formats . ISO ) optional { offset ( UtcOffset . Formats . ISO ) } } val kotlinCode = DateTimeFormat . formatAsKotlinBuilderDsl ( format ) assertEquals ( \"\"\"\"\"\" . trimIndent ( ) , kotlinCode ) }","docstring":"/**\n * Tests printing of a format that embeds some constants.\n */"} {"signature":"@ OptIn ( FormatStringsInDatetimeFormats :: class ) @ Test fun testStringRepresentationAfterIncorrectConversion ( )","body":"{ for ( format in listOf ( \"\" , \"\" ) ) { assertContains ( DateTimeFormat . formatAsKotlinBuilderDsl ( DateTimeComponents . Format { byUnicodePattern ( format ) } ) , \"\" ) } }","docstring":"/**\n * Check that we mention [byUnicodePattern] in the string representation of the format when the conversion is\n * incorrect.\n */"} {"signature":"fun < R : Any , T : Any > copyto ( dst : KtNDArray < R > , src : KtNDArray < T > , casting : Casting = Casting . SAME_KIND ) : Unit","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( dst , src , casting . str ) , kClass = Unit :: class )","docstring":"/**\n * Copies values from one array to another, broadcasting as necessary.\n *\n * Two arrays must be of the same type and match in size, otherwise raise ValueError.\n * @param dst the array into which values are copied.\n * @param src the array from which values are copied.\n * @param casting see [Casting].\n */"} {"signature":"fun < T : Any > ravel ( a : KtNDArray < T > , order : Order = Order . C )","body":"= a . ravel ( order )","docstring":"/**\n * Return a contiguous flattened array.\n *\n * @param a input array [KtNDArray] of type [T].\n * @return view of an array.\n * @see KtNDArray.ravel\n */"} {"signature":"fun < T : Any > moveAxis ( a : KtNDArray < T > , source : Int , destination : Int ) : KtNDArray < T >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( a , source , destination ) )","docstring":"/**\n * Move axis of an array to new positions.\n * Other axis remain in their original order.\n *\n * @param a input array [KtNDArray] of type [T]\n * @param source original positions of the axes to move. These must be unique.\n * @param destination destination positions for each of the original axes. These must be unique.\n * @return view of the input array.\n */"} {"signature":"fun < T : Any > rollAxis ( a : KtNDArray < T > , axis : Int , start : Int = ) : KtNDArray < T >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( a , axis , start ) )","docstring":"/**\n * Roll the specified axis backwards, until it lies in a given position.\n *\n * @param a - input array [KtNDArray] of type [T]\n * @param axis - the axis to roll backwards. The positions of the other axes do not change relative to one another.\n * @param start - the axis is rolled until it lies before this position. The default - 0.\n *\n * @return view of the input array.\n */"} {"signature":"fun < T : Any > swapAxes ( a : KtNDArray < T > , axis1 : Int , axis2 : Int ) : KtNDArray < T >","body":"= a . swapAxes ( axis1 , axis2 )","docstring":"/**\n * Interchange two axes of an array.\n *\n * @param a input array [KtNDArray] of type [T]\n * @param axis1 first axis.\n * @param axis2 second axis.\n * @return view of the input array.\n * @see KtNDArray.swapAxes\n */"} {"signature":"fun < T : Any > transpose ( a : KtNDArray < T > , vararg axis : Int ? = emptyArray ( ) ) : KtNDArray < T >","body":"= a . transpose ( * axis )","docstring":"/**\n * Permute the dimensions of an array.\n *\n * @param a input array [KtNDArray] of type [T]\n * @param axis permute the axes according to the values given. By default, reverse dimensions.\n * @return view of input array.\n * @see KtNDArray.transpose\n */"} {"signature":"fun atleast1D ( vararg arys : Any ) : List < KtNDArray < Any > >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( * arys ) , kClass = List :: class ) as List < KtNDArray < Any > >","docstring":"/**\n * Inputs are converted to list 1-dim [KtNDArray].\n *\n * @param arys one or more input arrays.\n * @return [List] of [KtNDArray].\n * @see atleast2D\n * @see atleast3D\n */"} {"signature":"fun atleast2D ( vararg arys : Any ) : List < KtNDArray < Any > >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( * arys ) , kClass = List :: class ) as List < KtNDArray < Any > >","docstring":"/**\n * Inputs are converted to list 2-dim [KtNDArray].\n *\n * @param arys one or more input arrays.\n * @return [List] of [KtNDArray].\n * @see atleast1D\n * @see atleast3D\n */"} {"signature":"fun atleast3D ( vararg arys : Any ) : List < KtNDArray < Any > >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( * arys ) , kClass = List :: class ) as List < KtNDArray < Any > >","docstring":"/**\n * Inputs are converted to list 1-dim [KtNDArray].\n *\n * @param arys one or more input arrays.\n * @return [List] of [KtNDArray].\n * @see atleast1D\n * @see atleast2D\n */"} {"signature":"inline fun < reified T : Any > asArray ( a : List < Any > , order : Order ? = null ) : KtNDArray < T >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( a , T :: class . javaObjectType ) , order = order )","docstring":"/**\n * Convert the input list to an [KtNDArray].\n *\n * @param a - [List] of type [T]\n * @param order [Order]. Default is 'C'.\n * @return The input will be returned uncopied iff it's a compatible.\n * @see asAnyArray\n * @see asContiguousArray\n * @see asFArray\n */"} {"signature":"inline fun < reified T : Any > asAnyArray ( a : Array < out Any > , order : Order ? = null ) : KtNDArray < T >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( a , T :: class . javaObjectType ) , order = order )","docstring":"/**\n * Convert the input [Array] to an [KtNDArray].\n *\n * @param a is [Array] of [Any].\n * @param order [Order]. Default is 'C'.\n * @return new [KtNDArray] of type [T].\n * @see asArray\n * @see asContiguousArray\n * @see asFArray\n */"} {"signature":"inline fun < reified T : Any > asAnyArray ( a : List < Any > , order : Order ? = null ) : KtNDArray < T >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( a , T :: class . javaObjectType ) , order = order )","docstring":"/**\n * Convert the input [List] to an [KtNDArray].\n *\n * @param a is [List] of [Any].\n * @param order [Order]. Default is 'C'.\n * @return new [KtNDArray] of type [T].\n * @see asArray\n * @see asContiguousArray\n * @see asFArray\n */"} {"signature":"inline fun < reified T : Any > asAnyArray ( a : KtNDArray < out Any > , order : Order ? = null ) : KtNDArray < T >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( a , T :: class . javaObjectType ) , order = order )","docstring":"/**\n * Convert the input [KtNDArray] to an [KtNDArray] of type [T].\n *\n * @param a is [KtNDArray] of [Any].\n * @param order [Order]. Default is 'C'.\n * @return new [KtNDArray] of type [T].\n * @see asArray\n * @see asContiguousArray\n * @see asFArray\n */"} {"signature":"inline fun < reified T : Any > asContiguousArray ( a : KtNDArray < out Any > ) : KtNDArray < T >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( a , T :: class . javaObjectType ) )","docstring":"/**\n * Return a contiguous array.\n *\n * @param a input array.\n * @return contiguous [KtNDArray].\n */"} {"signature":"fun < T : Any > asFArray ( a : KtNDArray < T > ) : KtNDArray < Double >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( a ) )","docstring":"/**\n * Return an array converted to a float type.\n *\n * @param a [KtNDArray] of type [T].\n * @return new [KtNDArray] of type [Double]\n */"} {"signature":"fun < T : Any > concatenate ( vararg arrs : KtNDArray < T > , axis : Int = ) : KtNDArray < T >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( arrs , axis ) )","docstring":"/**\n * Join a sequence of arrays along an existing axis.\n *\n * @param arrs the input arrays.\n * The arrays must have the same shape, except in the dimension corresponding to axis (the first, by default).\n * @param axis the axis along which the arrays will be joined. If axis is None, arrays are flattened before use. Default is 0.\n * @return new concatenated array.\n */"} {"signature":"fun < T : Any > stack ( vararg arrs : KtNDArray < T > , axis : Int = ) : KtNDArray < T >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( arrs , axis ) )","docstring":"/**\n * Join a sequence of arrays along a new axis.\n *\n * @param arrs the input arrays. Each array must have the same shape.\n * @param axis the axis in the result array along which the input arrays are stacked. Default is 0.\n * @return new [KtNDArray]. The stacked array has one more dimension than the input arrays.\n */"} {"signature":"fun < T : Any > columnStack ( vararg tup : KtNDArray < T > ) : KtNDArray < T >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( tup ) )","docstring":"/**\n * Stack 1-D arrays as columns into a 2-D array.\n *\n * @param tup arrays to stack. All of them must have the same first dimension.\n * @return 2D array. The array formed by stacking the given arrays.\n */"} {"signature":"fun < T : Any > dstack ( vararg tup : KtNDArray < T > ) : KtNDArray < T >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( tup ) )","docstring":"/**\n * Stack arrays in sequence depth wise (along third axis).\n *\n * @param tup the arrays must have the same shape along all but the third axis. 1-D or 2-D arrays must have the same shape.\n * @return The array formed by stacking the given arrays, will be at least 3-D.\n * @see stack\n * @see vstack\n * @see hstack\n * @see concatenate\n */"} {"signature":"fun < T : Any > hstack ( vararg tup : KtNDArray < T > ) : KtNDArray < T >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( tup ) )","docstring":"/**\n * Stack arrays in sequence horizontally (column wise).\n *\n * @param tup the arrays must have the same shape along all but the second axis, except 1-D arrays which can be any length.\n * @return The array formed by stacking the given arrays.\n */"} {"signature":"fun < T : Any > vstack ( vararg tup : KtNDArray < T > ) : KtNDArray < T >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( tup ) )","docstring":"/**\n * Stack arrays in sequence vertically (row wise).\n *\n * @param tup the arrays must have the same shape along all but the first axis. 1-D arrays must have the same length.\n * @return The array formed by stacking the given arrays, will be at least 2-D.\n */"} {"signature":"fun < T : Any > block ( list : List < KtNDArray < T > > ) : KtNDArray < T >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( list ) )","docstring":"/**\n * Assemble an [KtNDArray] from nested lists of blocks.\n *\n * @param list nested [List] of [KtNDArray].\n * @return [KtNDArray].\n * @see concatenate\n * @see stack\n * @see hstack\n * @see vstack\n * @see dstack\n */"} {"signature":"fun < T : Any > hsplit ( arr : KtNDArray < T > , idx : Int ) : List < KtNDArray < T > >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( arr , idx ) , kClass = List :: class ) as List < KtNDArray < T > >","docstring":"/**\n * Split an array into multiple sub-arrays horizontally (column-wise).\n *\n * [hsplit] is equivalent to [split] with axis=1.\n *\n * @param arr input data.\n * @param idx indices of sections.\n * @see split\n */"} {"signature":"fun < T : Any > tile ( a : KtNDArray < T > , reps : Int ) : KtNDArray < T >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( a , reps ) )","docstring":"/**\n * Construct an array by repeating [a] the number of times given by reps.\n *\n * @param a input array.\n * @param reps the number of repetitions array along each axis.\n * @return the tiled output array (view).\n */"} {"signature":"fun < T : Any > tile ( a : KtNDArray < T > , reps : IntArray ) : KtNDArray < T >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( a , reps ) )","docstring":"/**\n * Construct an array by repeating [a] the number of times given by reps.\n *\n * @param a input array.\n * @param reps the number of repetitions array along each axis.\n * @return the tiled output array (view).\n */"} {"signature":"fun < T : Any > repeat ( a : KtNDArray < T > , reps : Int , axis : Int ? = null ) : KtNDArray < T >","body":"= a . repeat ( reps , axis )","docstring":"/**\n * Repeat elements of an array.\n *\n * @param a input array.\n * @param reps the number of repetitions for each element. repeats is broadcasted to fit the shape of the given axis.\n * @param axis the axis along which to repeat values. By default, use the flattened input array, and return a flat output array.\n * @return output array which has the same shape as [a], except along the given axis.\n */"} {"signature":"fun < T : Any > repeat ( a : KtNDArray < T > , reps : IntArray , axis : Int ? = null ) : KtNDArray < T >","body":"= a . repeat ( reps , axis )","docstring":"/**\n * Repeat elements of an array.\n *\n * @param a input array.\n * @param reps the list number of repetitions for each element. repeats is broadcasted to fit the shape of the given axis.\n * @param axis the axis along which to repeat values. By default, use the flattened input array, and return a flat output array.\n * @return output array which has the same shape as [a], except along the given axis.\n */"} {"signature":"fun < T : Any > delete ( arr : KtNDArray < T > , obj : Int , axis : Int ? = null ) : KtNDArray < T >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( arr , obj , axis ? : None . none ) )","docstring":"/**\n * Return a new array with sub-arrays along an axis deleted. For a one dimensional array, this returns those entries not returned by arr.get(obj).\n *\n * @param arr input array.\n * @param obj index.\n * @param axis The axis along which to delete the subarray defined by obj. If axis is null, obj is applied to the flattened array.\n * @return A copy of [arr] with the elements specified by [obj] removed. Note that [delete] does not occur in-place.\n * If [axis] is null, return is a flattened array.\n */"} {"signature":"fun < T : Any > delete ( arr : KtNDArray < T > , obj : IntArray , axis : Int ? = null ) : KtNDArray < T >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( arr , obj , axis ? : None . none ) )","docstring":"/**\n * @param obj array of indices.\n */"} {"signature":"fun < T : Any > delete ( arr : KtNDArray < T > , obj : Array < Slice > , axis : Int ? = null ) : KtNDArray < T >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( arr , obj , axis ? : None . none ) )","docstring":"/**\n * @param obj array of [Slice].\n */"} {"signature":"fun < T : Any > insert ( arr : KtNDArray < T > , obj : Int , values : KtNDArray < T > , axis : Int ? = null ) : KtNDArray < T >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( arr , obj , values , axis ? : None . none ) )","docstring":"/**\n * Insert values along the given axis before the given indices.\n *\n * @param arr input array\n * @param obj object that defines the index before which [values] is inserted.\n * @param values values to insert into [arr].\n * @param axis axis along which to insert [values]. If axis is null then [arr] is flattened first.\n *\n * @return A copy of [arr] with [values] inserted. Note that insert does not occur in-place: a new array is returned.\n * If [axis] is null, return is a flattened array.\n */"} {"signature":"fun < T : Any > insert ( arr : KtNDArray < T > , obj : IntArray , values : KtNDArray < T > , axis : Int ? = null ) : KtNDArray < T >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( arr , obj , values , axis ? : None . none ) )","docstring":"/**\n * @param obj array of indices.\n */"} {"signature":"fun < T : Any > insert ( arr : KtNDArray < T > , obj : Array < Slice > , values : KtNDArray < T > , axis : Int ? = null ) : KtNDArray < T >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( arr , obj , values , axis ? : None . none ) )","docstring":"/**\n * @param obj array of [Slice].\n */"} {"signature":"fun < T : Any > append ( arr : KtNDArray < T > , values : KtNDArray < T > , axis : Int ? = null ) : KtNDArray < T >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( arr , values , axis ? : None . none ) )","docstring":"/**\n * Append values to the end of an array.\n *\n * @param arr input array.\n * @param values these values are appended to a copy of [arr]. It must be of the same shape as arr, excluding [axis].\n * If axis is not specified, [values] can be any shape and will be flattened before use.\n * @param axis the axis along which [values] are appended.\n * If [axis] is not given, both [arr] and [values] are flattened before use.\n * @return A copy of [arr] with [values] appended to [axis].\n * Note that append does not occur in-place: a new array is allocated and filled.\n * If [axis] is null, return is a flattened array.\n */"} {"signature":"fun < T : Any > resize ( a : KtNDArray < T > , vararg newshape : Int ) : KtNDArray < T >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( a , newshape ) )","docstring":"/**\n * Return a new array with the specified shape.\n *\n * @param a array to be resized.\n * @param newshape shape of resized array.\n * @return The new [KtNDArray] is formed from the data in the old array and new shape.\n * @see KtNDArray.resize\n */"} {"signature":"fun < T : Any > trimZeros ( filt : KtNDArray < T > , trim : String = \"\" ) : KtNDArray < T >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( filt , trim ) )","docstring":"/**\n * Trim the leading and/or trailing zeros from a 1-D array or sequence.\n *\n * @param filt 1-D input array.\n * @param trim a string with 'f' representing trim from front and 'b' to trim from back. Default is 'fb'.\n * @return The result of trimming the input.\n */"} {"signature":"fun < T : Any > unique ( ar : KtNDArray < T > , returnIndex : Boolean = false , returnInverse : Boolean = false , returnCounts : Boolean = false , axis : Int ? = null ) : KtNDArray < Long >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( ar , returnIndex , returnInverse , returnCounts , axis ? : None . none ) )","docstring":"/**\n * Find the unique elements of an array.\n *\n * @param ar input array.\n * @param returnIndex if True, also return the indices of [ar] (along the specified axis,\n * if provided, or in the flattened array) that result in the unique array.\n * @param returnInverse if True, also return the indices of the unique array (for the specified axis, if provided)\n * that can be used to reconstruct [ar].\n * @param returnCounts if True, also return the number of times each unique item appears in [ar].\n * @param axis the axis to operate on.\n * @return The sorted unique values.\n */"} {"signature":"fun < T : Any > flip ( m : KtNDArray < T > , vararg axis : Int ? = emptyArray ( ) ) : KtNDArray < T >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( m , if ( axis . isNotEmpty ( ) ) axis else None . none ) )","docstring":"/**\n * Reverse the order of elements in an array along the given axis.\n *\n * @param m input data.\n * @param axis or axes along which to flip over.\n * @return A view of [m] with the entries of axis reversed.\n * @see flipud\n * @see fliplr\n */"} {"signature":"fun < T : Any > fliplr ( m : KtNDArray < T > ) : KtNDArray < T >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( m ) )","docstring":"/**\n * Flip array in the left/right direction.\n * >Note that, input array, must be at least 2-D.\n *\n * @param m input array.\n * @return A view of m with the columns reversed.\n * @see flipud\n * @see rot90\n */"} {"signature":"fun < T : Any > flipud ( m : KtNDArray < T > ) : KtNDArray < T >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( m ) )","docstring":"/**\n * Flip array in the up/down direction.\n *\n * @param m input array.\n * @return A view of m with the columns reversed.\n * @see fliplr\n * @see rot90\n */"} {"signature":"fun < T : Any > reshape ( a : KtNDArray < T > , vararg newshape : Int , order : Order = Order . C ) : KtNDArray < T >","body":"= a . reshape ( * newshape , order = order )","docstring":"/**\n * Gives a new shape to an array without changing its data.\n *\n * @param a input array [KtNDArray] of type [T].\n * @param newshape the new shape should be compatible with the original shape.\n * If an integer, then the result will be a 1-D array of that length.\n * One shape dimension can be -1. In this case, the value is inferred from the length of the array and remaining dimensions.\n * @return view of an array containing the same data with a new shape.\n * @see KtNDArray.reshape\n */"} {"signature":"fun < T : Any > roll ( a : KtNDArray < T > , shift : IntArray , axes : IntArray ? = null ) : KtNDArray < T >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( a , shift , axes ? : None . none ) )","docstring":"/**\n * Roll array elements along a given axis.\n *\n * @param a input array.\n * @param shift the number of places by which elements are shifted.\n * @param axes along which elements are shifted.\n * @return Output [KtNDArray], with the same shape as a.\n * @see rollAxis\n */"} {"signature":"fun < T : Any > rot90 ( m : KtNDArray < T > , k : Int = , axes : IntArray = intArrayOf ( , ) ) : KtNDArray < T >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( m , k , axes ) )","docstring":"/**\n * Rotate an array by 90 degrees in the plane specified by axes.\n *\n * @param m [KtNDArray] of two or more dimensions.\n * @param k number of times the array is rotate by 90 degrees.\n * @param axes the array is rotated in the plane defined by the axes.\n * @return A rotated view of [m].\n * @see flip\n * @see fliplr\n * @see flipud\n */"} {"signature":"private fun KtFirPsiJavaClassSymbol . isVisibleByPsi ( useSiteFile : KtFirFileSymbol ) : Boolean ?","body":"{ when ( visibility ) { Visibilities . Private -> return false Visibilities . Public -> return when ( val outerClass = this . outerClass ) { null -> true else -> outerClass . isVisibleByPsi ( useSiteFile ) } JavaVisibilities . PackageVisibility -> { val isSamePackage = classIdIfNonLocal . packageFqName == useSiteFile . firSymbol . fir . packageFqName if ( ! isSamePackage ) return false return when ( val outerClass = this . outerClass ) { null -> true else -> outerClass . isVisibleByPsi ( useSiteFile ) } } } return null }","docstring":"/**\n * [isVisibleByPsi] is a heuristic that decides visibility for most [KtFirPsiJavaClassSymbol]s without deferring to its FIR symbol,\n * thereby avoiding lazy construction of the FIR class. The visibility rules are tailored specifically for Java classes accessed from\n * Kotlin. They cover the most popular visibilities `private`, `public`, and default (package) visibility for top-level and nested\n * classes.\n *\n * Returns `null` if visibility cannot be decided by the heuristic.\n */"} {"signature":"public fun < I > pipeline ( ) : Identity < I >","body":"= Identity ( )","docstring":"/**\n * An entry point for building the preprocessing pipeline.\n */"} {"signature":"internal fun ICConfiguration . extractIncrementalCompilationFeatures ( ) : IncrementalCompilationFeatures","body":"{ return IncrementalCompilationFeatures ( withAbiSnapshot = false , preciseCompilationResultsBackup = preciseCompilationResultsBackupEnabled , keepIncrementalCompilationCachesInMemory = incrementalCompilationCachesKeptInMemory , ) }","docstring":"/**\n * IncrementalJvmCompilationConfiguration provides single-property API for forward-compatibility.\n *\n * configurationAdapters are there to regroup the properties and work with higher-level interfaces.\n */"} {"signature":"protected open fun extractValueParameters ( blockBodyBuilder : IrBlockBodyBuilder , irFunction : IrSimpleFunction , bridge : IrSimpleFunction ) : List < IrValueDeclaration >","body":"= irFunction . valueParameters","docstring":"/**\n * Usually just returns [irFunction]'s value parameters, but special transformations may be required if,\n * for example, we're dealing with an external function, and that function contains a vararg,\n * which we must extract and convert to an array.\n */"} {"signature":"private fun IrSimpleFunction . copyValueParametersFrom ( bridge : IrSimpleFunction , substitutionMap : Map < IrTypeParameterSymbol , IrType > )","body":"{ var valueParametersToCopy = bridge . valueParameters if ( bridge . isEffectivelyExternal ( ) ) { val varargIndex = bridge . varargParameterIndex ( ) if ( varargIndex != - ) { valueParametersToCopy = bridge . valueParameters . take ( varargIndex ) } } valueParameters = valueParameters memoryOptimizedPlus valueParametersToCopy . map { p -> p . copyTo ( this , type = p . type . substitute ( substitutionMap ) ) } }","docstring":"/**\n * Copies the value parameters from [bridge] to [this]. If [bridge] is external and contains a vararg parameter,\n * only copies the parameters before the vararg.\n * The rest parameters are expected to be obtained later using the `arguments` object in JS.\n */"} {"signature":"private fun decodeSignedVarintInt ( input : ByteArrayInput ) : Int","body":"{ val raw = input . readVarint32 ( ) val temp = raw shl shr xor raw shr return temp xor ( raw and ( shl ) ) }","docstring":"/**\n * Source for all varint operations:\n * https://github.com/addthis/stream-lib/blob/master/src/main/java/com/clearspring/analytics/util/Varint.java\n */"} {"signature":"private fun PrettyPrinter . handleCompiledClassDeclaration ( classOrObject : KtClassOrObject , text : String )","body":"{ handleClassDeclaration ( classOrObject , text ) appendLine ( ) classOrObject . declarations . forEach { declaration -> when ( declaration ) { is KtEnumEntry -> { handleClassDeclaration ( declaration , text ) appendLine ( ) } is KtClassOrObject -> handleCompiledClassDeclaration ( declaration , text ) } } }","docstring":"/**\n * [handleCompiledClassDeclaration] uses a custom traversal instead of [forEachDescendantOfType] because trying to access the PSI of\n * compiled code in this test results in exceptions. Hence, we have to traverse nested classes and enum entries manually.\n */"} {"signature":"inline operator fun < reified T : Element > getValue ( x : Any ? , kProperty : KProperty < * > ) : T","body":"{ val id = kProperty . name val element = document . getElementById ( id ) ? : throw NullPointerException ( \"\" ) return element as? T ? : throw ClassCastException ( \"\" ) }","docstring":"/**\n * Implementation details of [Document.gettingElementById]. Delegated property\n * @see Document.gettingElementById\n */"} {"signature":"fun from ( vararg frameworks : Framework )","body":"= from ( frameworks . toList ( ) )","docstring":"/**\n * Adds the specified frameworks in this fat framework.\n */"} {"signature":"fun from ( frameworks : Iterable < Framework > )","body":"{ fromFrameworkDescriptors ( frameworks . map { FrameworkDescriptor ( it ) } ) frameworks . forEach { dependsOn ( it . linkTask ) } }","docstring":"/**\n * Adds the specified frameworks in this fat framework.\n */"} {"signature":"fun fromFrameworkDescriptors ( frameworks : Iterable < FrameworkDescriptor > )","body":"{ frameworks . forEach { framework -> val arch = framework . target . appleArchitecture val family = framework . target . family val fatFrameworkFamily = getFatFrameworkFamily ( ) require ( fatFrameworkFamily == null || family == fatFrameworkFamily ) { \"\" + \"\" + \"\" } require ( ! archToFramework . containsKey ( arch ) ) { val alreadyAdded = archToFramework . getValue ( arch ) \"\" + \"\" } require ( archToFramework . all { it . value . isStatic == framework . isStatic } ) { fun staticName ( isStatic : Boolean ) = if ( isStatic ) \"\" else \"\" buildString { append ( \"\" ) archToFramework . forEach { append ( \"\" ) } append ( \"\" ) append ( \"\" ) } } archToFramework [ arch ] = framework } }","docstring":"/**\n * Adds the specified frameworks in this fat framework.\n */"} {"signature":"fun usage ( )","body":"{ }","docstring":"/**\n * [test.ext]\n * [ext]\n *\n * [Foo.ext]\n * [test.Foo.ext]\n */"} {"signature":"@ kotlin . internal . InlineOnly public inline fun CharSequence . isEmpty ( ) : Boolean","body":"= length == ","docstring":"/**\n * Returns `true` if this char sequence is empty (contains no characters).\n */"} {"signature":"public inline fun < T , R > Array < out 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 to current accumulator value and each element.\n */"} {"signature":"@ SinceKotlin ( \"\" ) public fun Long . toString ( radix : Int ) : String","body":"= this . toStringImpl ( checkRadix ( radix ) )","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":"internal fun checkRadix ( radix : Int ) : Int","body":"{ if ( radix !in .. ) { throw IllegalArgumentException ( \"\" ) } return radix }","docstring":"/**\n * Checks whether the given [radix] is valid radix for string to number and number to string conversion.\n */"} {"signature":"public fun vgg16 ( imageSize : Long = , numberOfClasses : Int = , numberOfInputChannels : Long = , lastLayerActivation : Activations = Activations . Linear ) : Sequential","body":"{ return Sequential . of ( Input ( imageSize , imageSize , numberOfInputChannels ) , Conv2D ( filters = , kernelSize = intArrayOf ( , ) , strides = intArrayOf ( , , , ) , dilations = intArrayOf ( , , , ) , activation = Activations . Relu , kernelInitializer = GlorotUniform ( ) , biasInitializer = Zeros ( ) , padding = ConvPadding . SAME , name = \"\" ) , Conv2D ( filters = , kernelSize = intArrayOf ( , ) , strides = intArrayOf ( , , , ) , dilations = intArrayOf ( , , , ) , activation = Activations . Relu , kernelInitializer = GlorotUniform ( ) , biasInitializer = Zeros ( ) , padding = ConvPadding . SAME , name = \"\" ) , MaxPool2D ( poolSize = intArrayOf ( , , , ) , strides = intArrayOf ( , , , ) , padding = ConvPadding . VALID , name = \"\" ) , Conv2D ( filters = , kernelSize = intArrayOf ( , ) , strides = intArrayOf ( , , , ) , dilations = intArrayOf ( , , , ) , activation = Activations . Relu , kernelInitializer = GlorotUniform ( ) , biasInitializer = Zeros ( ) , padding = ConvPadding . SAME , name = \"\" ) , Conv2D ( filters = , kernelSize = intArrayOf ( , ) , strides = intArrayOf ( , , , ) , dilations = intArrayOf ( , , , ) , activation = Activations . Relu , kernelInitializer = GlorotUniform ( ) , biasInitializer = Zeros ( ) , padding = ConvPadding . SAME , name = \"\" ) , MaxPool2D ( poolSize = intArrayOf ( , , , ) , strides = intArrayOf ( , , , ) , padding = ConvPadding . VALID , name = \"\" ) , Conv2D ( filters = , kernelSize = intArrayOf ( , ) , strides = intArrayOf ( , , , ) , dilations = intArrayOf ( , , , ) , activation = Activations . Relu , kernelInitializer = GlorotUniform ( ) , biasInitializer = Zeros ( ) , padding = ConvPadding . SAME , name = \"\" ) , Conv2D ( filters = , kernelSize = intArrayOf ( , ) , strides = intArrayOf ( , , , ) , dilations = intArrayOf ( , , , ) , activation = Activations . Relu , kernelInitializer = GlorotUniform ( ) , biasInitializer = Zeros ( ) , padding = ConvPadding . SAME , name = \"\" ) , Conv2D ( filters = , kernelSize = intArrayOf ( , ) , strides = intArrayOf ( , , , ) , dilations = intArrayOf ( , , , ) , activation = Activations . Relu , kernelInitializer = GlorotUniform ( ) , biasInitializer = Zeros ( ) , padding = ConvPadding . SAME , name = \"\" ) , MaxPool2D ( poolSize = intArrayOf ( , , , ) , strides = intArrayOf ( , , , ) , padding = ConvPadding . VALID , name = \"\" ) , Conv2D ( filters = , kernelSize = intArrayOf ( , ) , strides = intArrayOf ( , , , ) , dilations = intArrayOf ( , , , ) , activation = Activations . Relu , kernelInitializer = GlorotUniform ( ) , biasInitializer = Zeros ( ) , padding = ConvPadding . SAME , name = \"\" ) , Conv2D ( filters = , kernelSize = intArrayOf ( , ) , strides = intArrayOf ( , , , ) , dilations = intArrayOf ( , , , ) , activation = Activations . Relu , kernelInitializer = GlorotUniform ( ) , biasInitializer = Zeros ( ) , padding = ConvPadding . SAME , name = \"\" ) , Conv2D ( filters = , kernelSize = intArrayOf ( , ) , strides = intArrayOf ( , , , ) , dilations = intArrayOf ( , , , ) , activation = Activations . Relu , kernelInitializer = GlorotUniform ( ) , biasInitializer = Zeros ( ) , padding = ConvPadding . SAME , name = \"\" ) , MaxPool2D ( poolSize = intArrayOf ( , , , ) , strides = intArrayOf ( , , , ) , padding = ConvPadding . VALID , name = \"\" ) , Conv2D ( filters = , kernelSize = intArrayOf ( , ) , strides = intArrayOf ( , , , ) , dilations = intArrayOf ( , , , ) , activation = Activations . Relu , kernelInitializer = GlorotUniform ( ) , biasInitializer = Zeros ( ) , padding = ConvPadding . SAME , name = \"\" ) , Conv2D ( filters = , kernelSize = intArrayOf ( , ) , strides = intArrayOf ( , , , ) , dilations = intArrayOf ( , , , ) , activation = Activations . Relu , kernelInitializer = GlorotUniform ( ) , biasInitializer = Zeros ( ) , padding = ConvPadding . SAME , name = \"\" ) , Conv2D ( filters = , kernelSize = intArrayOf ( , ) , strides = intArrayOf ( , , , ) , dilations = intArrayOf ( , , , ) , activation = Activations . Relu , kernelInitializer = GlorotUniform ( ) , biasInitializer = Zeros ( ) , padding = ConvPadding . SAME , name = \"\" ) , MaxPool2D ( poolSize = intArrayOf ( , , , ) , strides = intArrayOf ( , , , ) , padding = ConvPadding . VALID , name = \"\" ) , Flatten ( ) , Dense ( outputSize = , activation = Activations . Relu , kernelInitializer = GlorotUniform ( ) , biasInitializer = Zeros ( ) , name = \"\" ) , Dense ( outputSize = , activation = Activations . Relu , kernelInitializer = GlorotUniform ( ) , biasInitializer = Zeros ( ) , name = \"\" ) , Dense ( outputSize = numberOfClasses , activation = lastLayerActivation , kernelInitializer = GlorotUniform ( ) , biasInitializer = Zeros ( ) , name = \"\" ) ) }","docstring":"/**\n * Instantiates the VGG16 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 * Very Deep Convolutional Networks for Large-Scale Image Recognition (ICLR 2015).\n * @see \n * Detailed description of VGG'16 model and an approach to build it in Keras.\n */"} {"signature":"fun checkContractAndRecordIfPresent ( expression : KtExpression , trace : BindingTrace , ownerDescriptor : FunctionDescriptor )","body":"{ if ( ! expression . isContractDescriptionCallPsiCheck ( ) ) return val callContext = ContractCallContext ( expression , ownerDescriptor , trace , languageVersionSettings ) val contractProviderIfAny = ownerDescriptor . getUserData ( ContractProviderKey ) as? LazyContractProvider ? var resultingContractDescription : ContractDescription ? = null try { if ( ! callContext . isContractDescriptionCallPreciseCheck ( ) ) return resultingContractDescription = parseContractAndReportErrors ( callContext ) } finally { contractProviderIfAny ? . setContractDescription ( resultingContractDescription ) } }","docstring":"/**\n * ! IMPORTANT NOTICE !\n *\n * This function has very important non-obvious implicit contract:\n * it *must* call [org.jetbrains.kotlin.contracts.description.LazyContractProvider.setContractDescription]\n * if FunctionDescriptor had [LazyContractProvider] in the user data.\n *\n * Otherwise, it may lead to inconsistent resolve state and failed assertions\n */"} {"signature":"private fun parseContractAndReportErrors ( callContext : ContractCallContext ) : ContractDescription ?","body":"{ val collector = TraceBasedCollector ( callContext ) try { checkFeatureEnabled ( collector ) val contractNotAllowed = callContext . bindingContext [ BindingContext . CONTRACT_NOT_ALLOWED , callContext . contractCallExpression ] == true if ( collector . hasErrors ( ) || contractNotAllowed ) return null val parsedContract = PsiContractParserDispatcher ( collector , callContext , storageManager ) . parseContract ( ) if ( parsedContract == null ) collector . addFallbackErrorIfNecessary ( ) return parsedContract ? . takeUnless { collector . hasErrors ( ) } } finally { collector . flushDiagnostics ( ) } }","docstring":"/**\n * This function deals with some call that is guaranteed to resolve to 'contract' from stdlib, so,\n * ideally, it should satisfy following condition: null returned <=> at least one error was reported\n */"} {"signature":"@ OptIn ( ExperimentalNativeApi :: class ) fun codePointAt ( strIndex : Int , testString : CharSequence , rightBound : Int ) : Int","body":"{ var index = strIndex val curChar : Int readCharsForCodePoint = if ( index < rightBound - ) { val high = testString [ index ++ ] val low = testString [ index ] if ( Char . isSurrogatePair ( high , low ) ) { curChar = Char . toCodePoint ( high , low ) readCharsForCodePoint = } else { @ Suppress ( \"\" ) curChar = high . toInt ( ) } } else { @ Suppress ( \"\" ) curChar = testString [ index ] . toInt ( ) } return curChar }","docstring":"/** Reads Unicode codepoint from [testString] starting from [strIndex] until [rightBound]. */"} {"signature":"@ Test fun testThrowException ( )","body":"= runTest { expect ( ) try { ( wrappedCurrentDispatcher ( ) ) { expect ( ) throw AssertionError ( ) } } catch ( e : AssertionError ) { expect ( ) } yield ( ) finish ( ) }","docstring":"/**\n * Copy pasted from [WithContextTest.testThrowException],\n * then edited to use operator.\n */"} {"signature":"@ Test fun testWithContextChildWaitSameContext ( )","body":"= runTest { expect ( ) ( wrappedCurrentDispatcher ( ) ) { expect ( ) launch { expect ( ) } expect ( ) \"\" . wrap ( ) } . unwrap ( ) finish ( ) }","docstring":"/**\n * Copy pasted from [WithContextTest.testWithContextChildWaitSameContext],\n * then edited to use operator fun invoke for [CoroutineDispatcher].\n */"} {"signature":"public operator fun < C > ColumnsSelector < T , C > . invoke ( ) : ColumnsResolver < C >","body":"= this@invoke ( this @ ColumnsSelectionDsl , this @ ColumnsSelectionDsl )","docstring":"/**\n * Invokes the given [ColumnsSelector] using this [ColumnsSelectionDsl].\n */"} {"signature":"@ Deprecated ( message = COL_SELECT_DSL_LIST_DATACOLUMN_GET , replaceWith = ReplaceWith ( COL_SELECT_DSL_LIST_DATACOLUMN_GET_REPLACE ) , level = DeprecationLevel . ERROR , ) public operator fun < C > List < DataColumn < C > > . get ( range : IntRange ) : ColumnSet < C >","body":"= ColumnsList ( subList ( range . first , range . last + ) )","docstring":"/**\n * ## Deprecated: Columns by Index Range from List of Columns\n * Helper function to create a [ColumnSet] from a list of columns by specifying a range of indices.\n *\n * ### Deprecated\n *\n * Deprecated because it's too niche. Let us know if you have a good use for it!\n */"} {"signature":"public operator fun < C , R > SingleColumn < DataRow < C > > . invoke ( selector : ColumnsSelector < C , R > ) : ColumnSet < R >","body":"= select ( selector )","docstring":"/**\n * @include [SelectColumnsSelectionDsl.CommonSelectDocs]\n * @set [SelectColumnsSelectionDsl.CommonSelectDocs.ExampleArg]\n *\n * `df.`[select][DataFrame.select]` { myColGroup.`[`select`][SingleColumn.select]` { someCol `[`and`][ColumnsSelectionDsl.and]` `[`colsOf`][SingleColumn.colsOf]`<`[`String`][String]`>() } }`\n *\n * `df.`[select][DataFrame.select]` { myColGroup `[`{`][SingleColumn.select]` colA `[and][ColumnsSelectionDsl.and]` colB `[`}`][SingleColumn.select]` }`\n */"} {"signature":"@ Suppress ( \"\" ) @ JvmName ( \"\" ) public operator fun < C , R > KProperty < DataRow < C > > . invoke ( selector : ColumnsSelector < C , R > ) : ColumnSet < R >","body":"= select ( selector )","docstring":"/**\n * @include [SelectColumnsSelectionDsl.CommonSelectDocs]\n * @set [SelectColumnsSelectionDsl.CommonSelectDocs.ExampleArg]\n *\n * `df.`[select][DataFrame.select]` { Type::myColGroup.`[`select`][KProperty.select]` { someCol `[`and`][ColumnsSelectionDsl.and]` `[`colsOf`][SingleColumn.colsOf]`<`[`String`][String]`>() } }`\n *\n * `df.`[select][DataFrame.select]` { DataSchemaType::myColGroup `[`{`][KProperty.select]` colA `[`and`][ColumnsSelectionDsl.and]` colB `[`}`][KProperty.select]` }`\n *\n * ## NOTE: {@comment TODO fix warning}\n * If you get a warning `CANDIDATE_CHOSEN_USING_OVERLOAD_RESOLUTION_BY_LAMBDA_ANNOTATION`, you\n * can safely ignore this. It is caused by a workaround for a bug in the Kotlin compiler\n * ([KT-64092](https://youtrack.jetbrains.com/issue/KT-64092/OVERLOADRESOLUTIONAMBIGUITY-caused-by-lambda-argument)).\n */"} {"signature":"@ OptIn ( ExperimentalTypeInference :: class ) @ OverloadResolutionByLambdaReturnType public operator fun < C , R > KProperty < C > . invoke ( selector : ColumnsSelector < C , R > ) : ColumnSet < R >","body":"= columnGroup ( this ) . select ( selector )","docstring":"/**\n * @include [SelectColumnsSelectionDsl.CommonSelectDocs]\n * @set [SelectColumnsSelectionDsl.CommonSelectDocs.ExampleArg]\n *\n * `df.`[select][DataFrame.select]` { Type::myColGroup.`[`select`][KProperty.select]` { someCol `[`and`][ColumnsSelectionDsl.and]` `[`colsOf`][SingleColumn.colsOf]`<`[`String`][String]`>() } }`\n *\n * `df.`[select][DataFrame.select]` { DataSchemaType::myColGroup `[`{`][KProperty.select]` colA `[`and`][ColumnsSelectionDsl.and]` colB `[`}`][KProperty.select]` }`\n */"} {"signature":"public operator fun < R > String . invoke ( selector : ColumnsSelector < * , R > ) : ColumnSet < R >","body":"= select ( selector )","docstring":"/**\n * @include [SelectColumnsSelectionDsl.CommonSelectDocs]\n * @set [SelectColumnsSelectionDsl.CommonSelectDocs.ExampleArg]\n *\n * `df.`[select][DataFrame.select]` { \"myColGroup\".`[`select`][String.select]` { someCol `[`and`][ColumnsSelectionDsl.and]` `[`colsOf`][SingleColumn.colsOf]`<`[`String`][String]`>() } }`\n *\n * `df.`[select][DataFrame.select]` { \"myColGroup\" `[`{`][String.select]` colA `[`and`][ColumnsSelectionDsl.and]` colB `[`}`][String.select]` }`\n */"} {"signature":"public operator fun < R > ColumnPath . invoke ( selector : ColumnsSelector < * , R > ) : ColumnSet < R >","body":"= select ( selector )","docstring":"/**\n * @include [SelectColumnsSelectionDsl.CommonSelectDocs]\n * @set [SelectColumnsSelectionDsl.CommonSelectDocs.ExampleArg]\n *\n * `df.`[select][DataFrame.select]` { \"pathTo\"[\"myColGroup\"].`[`select`][ColumnPath.select]` { someCol `[`and`][ColumnsSelectionDsl.and]` `[`colsOf`][SingleColumn.colsOf]`<`[`String`][String]`>() } }`\n *\n * `df.`[select][DataFrame.select]` { \"pathTo\"[\"myColGroup\"] `[`{`][ColumnPath.select]` colA `[`and`][ColumnsSelectionDsl.and]` colB `[`}`][ColumnPath.select]` }`\n *\n * `df.`[select][DataFrame.select]` { `[`pathOf`][pathOf]`(\"pathTo\", \"myColGroup\").`[`select`][ColumnPath.select]` { someCol `[`and`][ColumnsSelectionDsl.and]` `[`colsOf`][SingleColumn.colsOf]`<`[`String`][String]`>() } }`\n *\n * `df.`[select][DataFrame.select]` { `[`pathOf`][pathOf]`(\"pathTo\", \"myColGroup\")`[`() {`][ColumnPath.select]` someCol `[`and`][ColumnsSelectionDsl.and]` `[`colsOf`][SingleColumn.colsOf]`<`[`String`][String]`>() `[`}`][ColumnPath.select]` }`\n */"} {"signature":"public abstract fun apply ( tf : Ops , yPred : Operand < Float > , yTrue : Operand < Float > , numberOfLabels : Operand < Float > ? ) : Operand < Float >","body":"public abstract fun apply ( tf : Ops , yPred : Operand < Float > , yTrue : Operand < Float > , numberOfLabels : Operand < Float > ? ) : Operand < Float >","docstring":"/**\n * Applies [Metric] to the [yPred] labels predicted by the model and known [yTrue] hidden during training.\n *\n * @param yPred The predicted values. shape = `[batch_size, d0, .. dN]`.\n * @param yTrue Ground truth values. Shape = `[batch_size, d0, .. dN]`.\n * @param [tf] TensorFlow graph API for building operations.\n */"} {"signature":"public fun convert ( metricType : Metrics ) : Metric","body":"{ return when ( metricType ) { Metrics . ACCURACY -> Accuracy ( ) Metrics . MAE -> MAE ( ) Metrics . MSE -> MSE ( ) Metrics . MSLE -> MSLE ( ) } }","docstring":"/** Converts enum value to subclass of [Metric]. */"} {"signature":"public fun convertBack ( metric : Metric ) : Metrics","body":"{ return when ( metric ) { is Accuracy -> Metrics . ACCURACY is MAE -> Metrics . MAE is MSE -> Metrics . MSE is MSLE -> Metrics . MSLE else -> Metrics . ACCURACY } }","docstring":"/** Converts subclass of [Metric] to enum value. */"} {"signature":"fun exports ( packageFqName : FqName ) : Boolean","body":"fun exports ( packageFqName : FqName ) : Boolean","docstring":"/**\n * `true` if this module exports the package with the given FQ name to all dependent modules.\n * For explicit modules, this means that there's an _unqualified_ (without the 'to' clause) exports statement in the module-info file.\n * For automatic modules, this is always `true`.\n *\n * Note that it's assumed that the module contains this package.\n */"} {"signature":"fun exportsTo ( packageFqName : FqName , moduleName : String ) : Boolean","body":"fun exportsTo ( packageFqName : FqName , moduleName : String ) : Boolean","docstring":"/**\n * `true` if this module exports the package with the given FQ name to a module with the given name.\n * For explicit modules, this means that there's either an unqualified exports statement (without the 'to' clause)\n * in the module-info file, or a _qualified_ statement (with the 'to' clause) with the given module name at the right hand side.\n * For automatic modules, this is always `true`.\n *\n * Note that it's assumed that the module contains this package.\n */"} {"signature":"override fun getLanguage ( documentable : Documentable , sourceSet : DokkaConfiguration . DokkaSourceSet , ) : DocumentableLanguage ?","body":"{ val documentableSource = ( documentable as? WithSources ) ? . sources ? . get ( sourceSet ) ? : return null return when ( documentableSource ) { is PsiDocumentableSource -> DocumentableLanguage . JAVA is KtPsiDocumentableSource -> DocumentableLanguage . KOTLIN else -> error ( \"\" ) } }","docstring":"/**\n * For members inherited from Java in Kotlin - it returns [DocumentableLanguage.KOTLIN]\n */"} {"signature":"public fun apply ( tf : Ops , features : Operand < Float > , name : String = \"\" ) : Operand < Float >","body":"{ return if ( name . isEmpty ( ) ) features else tf . withName ( \"\" ) . identity ( apply ( tf , features ) ) }","docstring":"/**\n * Applies the activation functions to the input [features] to produce the output.\n *\n * @param [tf] TensorFlow graph API for building operations.\n * @param [features] TensorFlow graph leaf node representing layer output before activation function.\n * @param [name] Activation name for TensorFlow graph building purposes.\n */"} {"signature":"public fun apply ( tf : Ops , features : Operand < Float > ) : Operand < Float >","body":"public fun apply ( tf : Ops , features : Operand < Float > ) : Operand < Float >","docstring":"/**\n * Applies the activation functions to the input [features] to produce the output.\n *\n * @param [tf] TensorFlow graph API for building operations.\n * @param [features] TensorFlow graph leaf node representing layer output before activation function.\n */"} {"signature":"actual fun getCurrentDate ( ) : String","body":"{ TODO ( \"\" ) }","docstring":"/**\n * Linux actual implementation for `getCurrentDate`\n */"} {"signature":"internal fun cartesianProductIndices ( x : Int , y : Int ) : List < Pair < Int , Int > >","body":"= List ( x ) { i -> List ( y ) { o -> Pair ( i , o ) } } . flatten ( )","docstring":"/**\n * Create a list of pairs that represents the cartesian product of numbers\n * from the ranges [0, x) and [0, y).\n *\n * @param x specifying the first range [0, x)\n * @param y specifying the second range [0, y)\n * @return list of pairs of numbers from cartesian product\n */"} {"signature":"internal fun extractXYInputOutputAxeSizes ( inputData : TensorImageData , permute : IntArray = intArrayOf ( , , , ) ) : IntArray","body":"= with ( IntArray ( ) ) { this [ permute [ ] ] = inputData . size this [ permute [ ] ] = inputData [ ] . size this [ permute [ ] ] = inputData [ ] [ ] . size this [ permute [ ] ] = inputData [ ] [ ] [ ] . size this }","docstring":"/**\n * Extract x, y, input, and output axe sizes from the tensor data that\n * is actual data of some weights from the model.\n *\n * @param inputData 4D tensor data representing the weights of some model\n * @param permute array of permutation of the result sizes. Defaults to identity\n * permutation that causes results in (x, y, input, output) sizes in returned sizes\n * @return array with 4 numbers representing the sizes (x, y, input, output) of\n * [inputData] according to given permutation\n */"} {"signature":"open fun DokkatooFormatPluginContext . configure ( )","body":"{ }","docstring":"/** Format specific configuration - to be implemented by subclasses */"} {"signature":"fun DependencyHandler . dokka ( module : String ) : Provider < Dependency >","body":"= dokkatooExtension . versions . jetbrainsDokka . map { version -> create ( \"\" ) }","docstring":"/** Create a [Dependency] for a Dokka module */"} {"signature":"fun DependencyHandler . dokkaPlugin ( dependency : Provider < Dependency > ) : Unit","body":"= addProvider ( dependencyContainerNames . dokkaPluginsClasspath , dependency )","docstring":"/** Add a dependency to the Dokka plugins classpath */"} {"signature":"fun DependencyHandler . dokkaPlugin ( dependency : String )","body":"{ add ( dependencyContainerNames . dokkaPluginsClasspath , dependency ) }","docstring":"/** Add a dependency to the Dokka plugins classpath */"} {"signature":"fun DependencyHandler . dokkaGenerator ( dependency : Provider < Dependency > )","body":"{ addProvider ( dependencyContainerNames . dokkaGeneratorClasspath , dependency ) }","docstring":"/** Add a dependency to the Dokka Generator classpath */"} {"signature":"fun DependencyHandler . dokkaGenerator ( dependency : String )","body":"{ add ( dependencyContainerNames . dokkaGeneratorClasspath , dependency ) }","docstring":"/** Add a dependency to the Dokka Generator classpath */"} {"signature":"public fun number ( number : Int ) : AreaPosition","body":"= AreaPosition ( singleOf ( number ) )","docstring":"/**\n * to fill between specified value and data.\n */"} {"signature":"public fun number ( number : Double ) : AreaPosition","body":"= AreaPosition ( singleOf ( number ) )","docstring":"/**\n * to fill between specified value and data.\n */"} {"signature":"private fun MockApplication . registerFileDocumentManager ( )","body":"{ picoContainer . unregisterComponent ( FileDocumentManager :: class . java . name ) registerService ( FileDocumentManager :: class . java , object : MockFileDocumentManagerImpl ( FileDocumentManagerBase . HARD_REF_TO_DOCUMENT_KEY , { DocumentImpl ( it ) } ) { override fun getDocument ( file : VirtualFile ) : Document ? { val document = super . getDocument ( file ) ? : return null file . putUserDataIfAbsent ( FileDocumentManagerBase . HARD_REF_TO_DOCUMENT_KEY , document ) return document } } , ) }","docstring":"/**\n * [MockFileDocumentManagerImpl] doesn't put the cached document as user data under [MockFileDocumentManagerImpl.myCachedDocumentKey] on\n * the virtual file, making [MockFileDocumentManagerImpl.getCachedDocument] effectively return `null`. We extend the file document\n * manager to simulate the behavior of [FileDocumentManagerBase], which puts [FileDocumentManagerBase.HARD_REF_TO_DOCUMENT_KEY] user\n * data on the virtual file.\n */"} {"signature":"fun applyDefaultHierarchyTemplate ( )","body":"= applyHierarchyTemplate ( KotlinHierarchyTemplate . default )","docstring":"/**\n * Sets up a 'natural'/'default' hierarchy withing [KotlinTarget]'s in the project.\n *\n * #### Example\n *\n * ```kotlin\n * kotlin {\n * applyDefaultHierarchyTemplate() // <- position of this call is not relevant!\n *\n * iosX64()\n * iosArm64()\n * linuxX64()\n * linuxArm64()\n * }\n * ```\n *\n * Will create the following SourceSets:\n * `[iosMain, iosTest, appleMain, appleTest, linuxMain, linuxTest, nativeMain, nativeTest]\n *\n *\n * Hierarchy:\n * ```\n * common\n * |\n * +-----------------+-------------------+\n * | |\n *\n * native ...\n *\n * |\n * |\n * |\n * +----------------------+--------------------+-----------------------+\n * | | | |\n *\n * apple linux mingw androidNative\n *\n * |\n * +-----------+------------+------------+\n * | | | |\n *\n * macos ios tvos watchos\n * ```\n *\n * @see KotlinHierarchyTemplate.extend\n */"} {"signature":"@ Test fun `global settings should overwrite package options in configuration` ( )","body":"{ val dokkaOutputDir = File ( projectDir , \"\" ) assertTrue ( dokkaOutputDir . mkdirs ( ) ) val resourcePath = javaClass . getResource ( \"\" ) ? . toURI ( ) ? : throw IllegalStateException ( \"\" ) val jsonPath = File ( resourcePath ) . absolutePath PrintWriter ( jsonPath ) . run { write ( jsonBuilder ( outputPath = dokkaOutputDir . invariantSeparatorsPath , pluginsClasspath = basePluginJarFile . invariantSeparatorsPath , projectPath = File ( projectDir , \"\" ) . invariantSeparatorsPath , globalSourceLinks = \"\"\"\"\"\" . trimIndent ( ) , globalExternalDocumentationLinks = \"\"\"\"\"\" . trimIndent ( ) , globalPerPackageOptions = \"\"\"\"\"\" . trimIndent ( ) , reportUndocumented = false ) , ) close ( ) } val process = ProcessBuilder ( \"\" , \"\" , cliJarFile . path , jsonPath ) . redirectErrorStream ( true ) . start ( ) val result = process . awaitProcessResult ( ) assertEquals ( , result . exitCode , \"\" ) val extensionLoadedRegex = Regex ( \"\"\"\"\"\" ) val amountOfExtensionsLoaded = extensionLoadedRegex . findAll ( result . output ) . count ( ) assertTrue ( amountOfExtensionsLoaded > , \"\" ) val undocumentedReportRegex = Regex ( \"\"\"\"\"\" ) val amountOfUndocumentedReports = undocumentedReportRegex . findAll ( result . output ) . count ( ) assertTrue ( amountOfUndocumentedReports > , \"\" ) assertTrue ( dokkaOutputDir . isDirectory , \"\" ) }","docstring":"/**\n * This test disables global `reportUndocumneted` property and set `reportUndocumented` via perPackageOptions to\n * make sure that global settings apply to dokka context.\n */"} {"signature":"private fun createMappingSubstitutor ( fromClass : FirRegularClass , toClass : FirRegularClass , session : FirSession ) : ConeSubstitutor","body":"= ConeSubstitutorByMap . create ( fromClass . typeParameters . zip ( toClass . typeParameters ) . associate { ( fromTypeParameter , toTypeParameter ) -> fromTypeParameter . symbol to ConeTypeParameterTypeImpl ( ConeTypeParameterLookupTag ( toTypeParameter . symbol ) , isNullable = false ) } , session )","docstring":"/**\n * For fromClass=A, toClass=B classes\n * @returns {T1 -> F1, T2 -> F2} substitution\n */"} {"signature":"public fun DokkaSourceSet . toDisplaySourceSet ( ) : DisplaySourceSet","body":"= DisplaySourceSet ( this )","docstring":"/**\n * Transforms the current [DokkaSourceSet] into [DisplaySourceSet],\n * matching the corresponding subset of its properties to [DisplaySourceSet] properties.\n */"} {"signature":"public fun Iterable < DokkaSourceSet > . toDisplaySourceSets ( ) : Set < DisplaySourceSet >","body":"= map { it . toDisplaySourceSet ( ) } . toSet ( )","docstring":"/**\n * Transforms all the given [DokkaSourceSet]s into [DisplaySourceSet]s.\n */"} {"signature":"private fun substituteArguments ( descriptorVariables : DescriptorVariables , arguments : List < Variable > , ) : Map < String , String >","body":"{ val result = mutableMapOf < String , String > ( ) fun addResult ( name : String , value : String , ) { result [ name ] = substituteKernelVars ( value ) } val parameters = descriptorVariables . properties if ( descriptorVariables . hasOrder ) { var namedPart = false for ( ( i , arg ) in arguments . withIndex ( ) ) { val isNamed = arg . name . isNotEmpty ( ) if ( namedPart ) { if ( ! isNamed ) throw ReplPreprocessingException ( \"\" ) } else { if ( isNamed ) namedPart = true } assert ( namedPart == isNamed ) { \"\" } if ( isNamed ) { addResult ( arg . name , arg . value ) } else { if ( parameters . lastIndex < i ) { throw ReplPreprocessingException ( \"\" , ) } addResult ( parameters [ i ] . name , arg . value ) } } } else { if ( arguments . any { it . name . isEmpty ( ) } ) { if ( parameters . count ( ) != ) { throw ReplPreprocessingException ( \"\" ) } if ( arguments . count ( ) != ) { throw ReplPreprocessingException ( \"\" ) } addResult ( parameters [ ] . name , arguments [ ] . value ) return result } arguments . forEach { addResult ( it . name , it . value ) } } parameters . forEach { if ( ! result . containsKey ( it . name ) ) { addResult ( it . name , it . value ) } } return result }","docstring":"/**\n * Matches a list of actual library arguments with declared library parameters\n * Arguments can be named or not. Named arguments should be placed after unnamed\n * Parameters may have default value\n *\n * @return A name-to-value map of library arguments\n */"} {"signature":"fun resnet50copyModelPrediction ( )","body":"{ val modelHub = TFModelHub ( cacheDirectory = File ( \"\" ) ) val modelType = TFModels . CV . ResNet50 ( ) val model = modelHub . loadModel ( modelType ) val fileDataLoader = modelType . createPreprocessing ( model ) . fileLoader ( ) val imageNetClassLabels = modelHub . loadClassLabels ( ) var copiedModel : Functional model . use { it . compile ( optimizer = Adam ( ) , loss = Losses . MAE , metric = Metrics . ACCURACY ) it . logSummary ( ) val hdfFile = modelHub . loadWeights ( modelType ) it . loadWeights ( hdfFile ) copiedModel = it . copy ( copyWeights = true ) for ( i in .. ) { val inputData = fileDataLoader . load ( getFileFromResource ( \"\" ) ) val res = it . predictLabel ( inputData ) println ( \"\" ) val top5 = it . predictTop5Labels ( inputData , imageNetClassLabels ) println ( top5 . toString ( ) ) } } copiedModel . use { for ( i in .. ) { val inputData = fileDataLoader . load ( getFileFromResource ( \"\" ) ) val res = it . predictLabel ( inputData ) println ( \"\" ) val top5 = it . predictTop5Labels ( inputData , imageNetClassLabels ) println ( top5 . toString ( ) ) } } }","docstring":"/**\n * This example demonstrates the inference concept on ResNet'50 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 * - No additional training.\n * - No new layers are added.\n * - Special preprocessing (used in ResNet'50 during training on ImageNet dataset) is applied to each image before prediction.\n * - Model copied and used for prediction.\n */"} {"signature":"fun main ( ) : Unit","body":"= resnet50copyModelPrediction ( )","docstring":"/** */"} {"signature":"private fun createGenericTypeQualifierCallIfApplicable ( firElement : FirElement , psiElement : KtElement ) : KtCallInfo ?","body":"{ if ( psiElement !is KtExpression ) return null if ( firElement !is FirResolvedQualifier ) return null val call = psiElement . getPossiblyQualifiedCallExpression ( ) ? : return null if ( call . typeArgumentList == null || call . valueArgumentList != null ) return null val parentReferenceExpression = psiElement . parent as? KtDoubleColonExpression ? : return null if ( parentReferenceExpression . lhs != psiElement ) return null return KtSuccessCallInfo ( KtGenericTypeQualifier ( token , psiElement ) ) }","docstring":"/**\n * Resolves call expressions like `Foo` or `test.Foo` in calls like `Foo::foo`, `test.Foo::foo` and class literals like `Foo`::class.java.\n *\n * We have a separate [KtGenericTypeQualifier] type of [KtCall].\n */"} {"signature":"private fun KtElement . getContainingCallExpressionForCalleeExpression ( ) : KtCallExpression ?","body":"{ if ( this !is KtExpression ) return null val calleeExpression = deparenthesize ( this ) ? : return null if ( calleeExpression is KtCallExpression ) return null val callExpression = parentOfType < KtCallExpression > ( ) ? : return null if ( deparenthesize ( callExpression . calleeExpression ) != calleeExpression ) return null return callExpression }","docstring":"/**\n * When resolving the calleeExpression of a `KtCallExpression`, we resolve the entire `KtCallExpression` instead. This way, the\n * corresponding FIR element is the `FirFunctionCall`, etc. Implicit invoke is then specially handled after obtaining the\n * `FirImplicitInvokeCall`.\n *\n * Note that, if the calleeExpression is already a KtCallExpression, then we don't do this because such a callExpression can be properly\n * resolved to the desired FIR element. That is, cases like `getHighLevelFunction()()` just works, where the both `KtCallExpression`\n * resolve to the desired FIR element.\n */"} {"signature":"private fun KtElement . getContainingBinaryExpressionForIncompleteLhs ( ) : KtBinaryExpression ?","body":"{ if ( this !is KtExpression ) return null val lhs = deparenthesize ( this ) val binaryExpression = parentOfType < KtBinaryExpression > ( ) ? : return null if ( binaryExpression . operationToken !in KtTokens . ALL_ASSIGNMENTS ) return null val leftOfBinary = deparenthesize ( binaryExpression . left ) if ( leftOfBinary != lhs && ! ( leftOfBinary is KtDotQualifiedExpression && leftOfBinary . selectorExpression == lhs ) ) return null val firBinaryExpression = binaryExpression . getOrBuildFir ( analysisSession . firResolveSession ) if ( firBinaryExpression is FirFunctionCall ) { if ( firBinaryExpression . origin == FirFunctionCallOrigin . Operator && firBinaryExpression . calleeReference . name in OperatorNameConventions . ASSIGNMENT_OPERATIONS ) { return null } } return binaryExpression }","docstring":"/**\n * For `=` and compound access like `+=`, `-=`, `*=`, `/=`, `%=`, the LHS of the binary expression is not a complete call. Hence we\n * find the containing binary expression and resolve that instead.\n *\n * However, if, say, `+=` resolves to `plusAssign`, then the LHS is self-contained. In this case we do not return the containing binary\n * expression so that the FIR element corresponding to the LHS is used directly.\n */"} {"signature":"private fun KtElement . getContainingUnaryIncOrDecExpression ( ) : KtUnaryExpression ?","body":"{ if ( this !is KtExpression ) return null val baseExpression = deparenthesize ( this ) val unaryExpression = parentOfType < KtUnaryExpression > ( ) ? : return null if ( deparenthesize ( unaryExpression . baseExpression ) != baseExpression || unaryExpression . operationToken !in KtTokens . INCREMENT_AND_DECREMENT ) return null return unaryExpression }","docstring":"/**\n * For prefix and postfix `++` and `--`, the idea is the same because FIR represents it as several operations. For example, for `i++`,\n * if the input PSI is `i`, we instead resolve `i++` and extract the read part of this access for `i`.\n */"} {"signature":"private fun KtElement . getContainingDotQualifiedExpressionForSelectorExpression ( ) : KtQualifiedExpression ?","body":"{ val parent = parent if ( parent is KtDotQualifiedExpression && parent . selectorExpression == this ) return parent if ( parent is KtSafeQualifiedExpression && parent . selectorExpression == this ) return parent return null }","docstring":"/**\n * When resolving selector expression of a [KtDotQualifiedExpression], we instead resolve the containing qualified expression. This way\n * the corresponding FIR element is the `FirFunctionCall` or `FirPropertyAccessExpression`, etc.\n */"} {"signature":"private fun toTypeArgumentsMapping ( typeArguments : List < FirTypeProjection > , partiallyAppliedSymbol : KtPartiallyAppliedSymbol < * , * > ) : Map < KtTypeParameterSymbol , KtType >","body":"{ val typeParameters = partiallyAppliedSymbol . symbol . typeParameters if ( typeParameters . isEmpty ( ) ) return emptyMap ( ) if ( typeArguments . size < typeParameters . size ) return emptyMap ( ) val result = mutableMapOf < KtTypeParameterSymbol , KtType > ( ) for ( ( index , typeParameter ) in typeParameters . withIndex ( ) ) { val typeArgument = typeArguments [ index ] if ( typeArgument !is FirTypeProjectionWithVariance || typeArgument . variance != Variance . INVARIANT ) return emptyMap ( ) result [ typeParameter ] = typeArgument . typeRef . coneType . asKtType ( ) } return result }","docstring":"/**\n * Maps [typeArguments] to the type parameters of [partiallyAppliedSymbol].\n *\n * If too many type arguments are provided, a mapping is still created. Extra type arguments are simply ignored. If this wasn't the\n * case, the resulting [KtCall] would contain no type arguments at all, which can cause problems later. If too few type arguments are\n * provided, an empty map is returned defensively so that [toTypeArgumentsMapping] doesn't conjure any error types. If you want to map\n * too few type arguments meaningfully, please provide filler types explicitly.\n */"} {"signature":"@ JvmName ( \"\" ) @ Deprecated ( \"\" , ReplaceWith ( \"\" ) ) internal fun < T : Task > registerTask ( project : Project , name : String , type : Class < T > , body : ( T ) -> ( Unit ) ) : TaskProvider < T >","body":"= project . registerTask ( name , type , emptyList ( ) , body )","docstring":"/**\n * Registers the task with [name] and [type] and initialization script [body]\n */"} {"signature":"internal inline fun < reified T : Task > Project . locateTask ( name : String ) : TaskProvider < T > ?","body":"= tasks . locateTask ( name )","docstring":"/**\n * Locates a task by [name] and [type], without triggering its creation or configuration.\n */"} {"signature":"internal inline fun < reified T : Task > TaskContainer . locateTask ( name : String ) : TaskProvider < T > ?","body":"= if ( names . contains ( name ) ) named ( name , T :: class . java ) else null","docstring":"/**\n * Locates a task by [name] and [type], without triggering its creation or configuration.\n */"} {"signature":"internal inline fun < reified T : Task > Project . locateOrRegisterTask ( name : String , noinline body : ( T ) -> ( Unit ) ) : TaskProvider < T >","body":"{ return project . locateTask ( name ) ? : project . registerTask ( name , T :: class . java , body = body ) }","docstring":"/**\n * Locates a task by [name] and [type], without triggering its creation or configuration or registers new task\n * with [name], type [T] and initialization script [body]\n */"} {"signature":"@ Benchmark fun removeAndPut ( ) : PersistentMap < IntWrapper , String >","body":"{ var map = persistentMapRemove ( persistentMap , keysToRemove ) for ( key in keysToRemove ) { map = map . put ( key , \"\" ) } return map }","docstring":"/**\n * Removes `keysToRemove.size` entries of the [persistentMap] and\n * then puts `keysToRemove.size` new entries.\n *\n * Measures mean time and memory spent per (roughly one) `remove` and `put` operations.\n *\n * Expected time: [Remove.remove] + [putAfterRemove]\n * Expected memory: [Remove.remove] + [putAfterRemove]\n */"} {"signature":"@ Benchmark fun removeAndIterateKeys ( bh : Blackhole )","body":"{ val map = persistentMapRemove ( persistentMap , keysToRemove ) var count = while ( count < size ) { for ( e in map ) { bh . consume ( e ) if ( ++ count == size ) break } } }","docstring":"/**\n * Removes `keysToRemove.size` entries of the [persistentMap] and\n * then iterates keys of the resulting map several times until iterating [size] elements.\n *\n * Measures mean time and memory spent per (roughly one) `remove` and `next` operations.\n *\n * Expected time: [Remove.remove] + [iterateKeysAfterRemove]\n * Expected memory: [Remove.remove] + [iterateKeysAfterRemove]\n */"} {"signature":"@ Benchmark fun putAfterRemove ( ) : PersistentMap < IntWrapper , String >","body":"{ var map = halfHeightPersistentMap repeat ( size - halfHeightPersistentMap . size ) { index -> map = map . put ( keys [ index ] , \"\" ) } return map }","docstring":"/**\n * Puts `size - halfHeightPersistentMap.size` new entries to the [Canonicalization.halfHeightPersistentMap].\n *\n * Measures mean time and memory spent per (roughly one) `put` operation.\n *\n * Expected time: [Put.put]\n * Expected memory: [Put.put]\n */"} {"signature":"@ Benchmark fun iterateKeysAfterRemove ( bh : Blackhole )","body":"{ var count = while ( count < size ) { for ( e in halfHeightPersistentMap ) { bh . consume ( e ) if ( ++ count == size ) break } } }","docstring":"/**\n * Iterates keys of the [Canonicalization.halfHeightPersistentMap] several times until iterating [size] elements.\n *\n * Measures mean time and memory spent per `iterate` operation.\n *\n * Expected time: [Iterate.iterateKeys] with [Iterate.size] = `halfHeightPersistentMap.size`\n * Expected memory: [Iterate.iterateKeys] with [Iterate.size] = `halfHeightPersistentMap.size`\n */"} {"signature":"fun addOnExceptionCallback ( owner : Any , callback : ( Throwable ) -> Unit )","body":"= synchronized ( lock ) { enabled = true val previousValue = callbacks . put ( owner , callback ) check ( previousValue === null ) unprocessedExceptions . forEach { reportException ( it ) } unprocessedExceptions . clear ( ) }","docstring":"/**\n * Registers [callback] to be executed when an uncaught exception happens.\n * [owner] is a key by which to distinguish different callbacks.\n */"} {"signature":"fun removeOnExceptionCallback ( owner : Any )","body":"= synchronized ( lock ) { if ( enabled ) { val existingValue = callbacks . remove ( owner ) check ( existingValue !== null ) } }","docstring":"/**\n * Unregisters the callback associated with [owner].\n */"} {"signature":"fun handleException ( exception : Throwable ) : Boolean","body":"= synchronized ( lock ) { if ( ! enabled ) return false if ( reportException ( exception ) ) return true unprocessedExceptions . add ( exception ) return false }","docstring":"/**\n * Tries to handle the exception by propagating it to an interested consumer.\n * Returns `true` if the exception does not need further processing.\n *\n * Doesn't throw.\n */"} {"signature":"private fun reportException ( exception : Throwable ) : Boolean","body":"{ var executedACallback = false for ( callback in callbacks . values ) { callback ( exception ) executedACallback = true } return executedACallback }","docstring":"/**\n * Try to report [exception] to the existing callbacks.\n */"} {"signature":"@ kotlin . internal . InlineOnly public actual inline fun Char . isDefined ( ) : Boolean","body":"= Character . isDefined ( this )","docstring":"/**\n * Returns `true` if this character (Unicode code point) is defined in Unicode.\n *\n * A character is considered to be defined in Unicode if its [category] is not [CharCategory.UNASSIGNED].\n */"} {"signature":"@ kotlin . internal . InlineOnly public actual inline fun Char . isLetter ( ) : Boolean","body":"= Character . isLetter ( this )","docstring":"/**\n * Returns `true` if this character is a letter.\n *\n * A character is considered to be a letter if its [category] is [CharCategory.UPPERCASE_LETTER],\n * [CharCategory.LOWERCASE_LETTER], [CharCategory.TITLECASE_LETTER], [CharCategory.MODIFIER_LETTER], or [CharCategory.OTHER_LETTER].\n *\n * @sample samples.text.Chars.isLetter\n */"} {"signature":"@ kotlin . internal . InlineOnly public actual inline fun Char . isLetterOrDigit ( ) : Boolean","body":"= Character . isLetterOrDigit ( this )","docstring":"/**\n * Returns `true` if this character is a letter or digit.\n *\n * @see isLetter\n * @see isDigit\n *\n * @sample samples.text.Chars.isLetterOrDigit\n */"} {"signature":"@ kotlin . internal . InlineOnly public actual inline fun Char . isDigit ( ) : Boolean","body":"= Character . isDigit ( this )","docstring":"/**\n * Returns `true` if this character is a digit.\n *\n * A character is considered to be a digit if its [category] is [CharCategory.DECIMAL_DIGIT_NUMBER].\n *\n * @sample samples.text.Chars.isDigit\n */"} {"signature":"@ kotlin . internal . InlineOnly public inline fun Char . isIdentifierIgnorable ( ) : Boolean","body":"= Character . isIdentifierIgnorable ( this )","docstring":"/**\n * Returns `true` if this character (Unicode code point) should be regarded as an ignorable\n * character in a Java identifier or a Unicode identifier.\n */"} {"signature":"@ kotlin . internal . InlineOnly public actual inline fun Char . isISOControl ( ) : Boolean","body":"= Character . isISOControl ( this )","docstring":"/**\n * Returns `true` if this character is an ISO control character.\n *\n * A character is considered to be an ISO control character if its [category] is [CharCategory.CONTROL],\n * meaning the Char is in the range `'\\u0000'..'\\u001F'` or in the range `'\\u007F'..'\\u009F'`.\n *\n * @sample samples.text.Chars.isISOControl\n */"} {"signature":"@ kotlin . internal . InlineOnly public inline fun Char . isJavaIdentifierPart ( ) : Boolean","body":"= Character . isJavaIdentifierPart ( this )","docstring":"/**\n * Returns `true` if this character (Unicode code point) may be part of a Java identifier as other than the first character.\n * @sample samples.text.Chars.isJavaIdentifierPart\n */"} {"signature":"@ kotlin . internal . InlineOnly public inline fun Char . isJavaIdentifierStart ( ) : Boolean","body":"= Character . isJavaIdentifierStart ( this )","docstring":"/**\n * Returns `true` if this character is permissible as the first character in a Java identifier.\n * @sample samples.text.Chars.isJavaIdentifierStart\n */"} {"signature":"public actual fun Char . isWhitespace ( ) : Boolean","body":"= Character . isWhitespace ( this ) || Character . isSpaceChar ( this )","docstring":"/**\n * Determines whether a character is whitespace.\n *\n * A character is considered whitespace if either its Unicode [category][Char.category]\n * is one of [CharCategory.SPACE_SEPARATOR], [CharCategory.LINE_SEPARATOR], [CharCategory.PARAGRAPH_SEPARATOR],\n * or it is a [CharCategory.CONTROL] character in range `U+0009..U+000D` or `U+001C..U+001F`.\n *\n * Returns `true` if the character is whitespace.\n *\n * @sample samples.text.Chars.isWhitespace\n */"} {"signature":"@ kotlin . internal . InlineOnly public actual inline fun Char . isUpperCase ( ) : Boolean","body":"= Character . isUpperCase ( this )","docstring":"/**\n * Returns `true` if this character is upper case.\n *\n * A character is considered to be an upper case character if its [category] is [CharCategory.UPPERCASE_LETTER],\n * or it has contributory property `Other_Uppercase` as defined by the Unicode Standard.\n *\n * @sample samples.text.Chars.isUpperCase\n */"} {"signature":"@ kotlin . internal . InlineOnly public actual inline fun Char . isLowerCase ( ) : Boolean","body":"= Character . isLowerCase ( this )","docstring":"/**\n * Returns `true` if this character is lower case.\n *\n * A character is considered to be a lower case character if its [category] is [CharCategory.LOWERCASE_LETTER],\n * or it has contributory property `Other_Lowercase` as defined by the Unicode Standard.\n *\n * @sample samples.text.Chars.isLowerCase\n */"} {"signature":"@ Deprecated ( \"\" , ReplaceWith ( \"\" ) ) @ DeprecatedSinceKotlin ( warningSince = \"\" ) @ kotlin . internal . InlineOnly public actual inline fun Char . toUpperCase ( ) : Char","body":"= uppercaseChar ( )","docstring":"/**\n * Converts this character to upper case using Unicode mapping rules of the invariant locale.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalStdlibApi :: class ) @ kotlin . internal . InlineOnly public actual inline fun Char . uppercaseChar ( ) : Char","body":"= Character . toUpperCase ( this )","docstring":"/**\n * Converts this character to upper case using Unicode mapping rules of the invariant locale.\n *\n * This function performs one-to-one character mapping.\n * To support one-to-many character mapping use the [uppercase] function.\n * If this character has no mapping equivalent, the character itself is returned.\n *\n * @sample samples.text.Chars.uppercase\n */"} {"signature":"@ Deprecated ( \"\" , ReplaceWith ( \"\" ) ) @ DeprecatedSinceKotlin ( warningSince = \"\" ) @ kotlin . internal . InlineOnly public actual inline fun Char . toLowerCase ( ) : Char","body":"= lowercaseChar ( )","docstring":"/**\n * Converts this character to lower case using Unicode mapping rules of the invariant locale.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalStdlibApi :: class ) @ kotlin . internal . InlineOnly public actual inline fun Char . lowercaseChar ( ) : Char","body":"= Character . toLowerCase ( this )","docstring":"/**\n * Converts this character to lower case using Unicode mapping rules of the invariant locale.\n *\n * This function performs one-to-one character mapping.\n * To support one-to-many character mapping use the [lowercase] function.\n * If this character has no mapping equivalent, the character itself is returned.\n *\n * @sample samples.text.Chars.lowercase\n */"} {"signature":"@ kotlin . internal . InlineOnly public actual inline fun Char . isTitleCase ( ) : Boolean","body":"= Character . isTitleCase ( this )","docstring":"/**\n * Returns `true` if this character is a title case letter.\n *\n * A character is considered to be a title case letter if its [category] is [CharCategory.TITLECASE_LETTER].\n *\n * @sample samples.text.Chars.isTitleCase\n */"} {"signature":"@ Deprecated ( \"\" , ReplaceWith ( \"\" ) ) @ DeprecatedSinceKotlin ( warningSince = \"\" ) @ kotlin . internal . InlineOnly public inline fun Char . toTitleCase ( ) : Char","body":"= titlecaseChar ( )","docstring":"/**\n * Converts this character to title case using Unicode mapping rules of the invariant locale.\n *\n * @see Character.toTitleCase\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalStdlibApi :: class ) @ kotlin . internal . InlineOnly public actual inline fun Char . titlecaseChar ( ) : Char","body":"= Character . toTitleCase ( this )","docstring":"/**\n * Converts this character to title case using Unicode mapping rules of the invariant locale.\n *\n * This function performs one-to-one character mapping.\n * To support one-to-many character mapping use the [titlecase] function.\n * If this character has no mapping equivalent, the result of calling [uppercaseChar] is returned.\n *\n * @sample samples.text.Chars.titlecase\n */"} {"signature":"@ kotlin . internal . InlineOnly public actual inline fun Char . isHighSurrogate ( ) : Boolean","body":"= Character . isHighSurrogate ( this )","docstring":"/**\n * Returns `true` if this character is a Unicode high-surrogate code unit (also known as leading-surrogate code unit).\n */"} {"signature":"@ kotlin . internal . InlineOnly public actual inline fun Char . isLowSurrogate ( ) : Boolean","body":"= Character . isLowSurrogate ( this )","docstring":"/**\n * Returns `true` if this character is a Unicode low-surrogate code unit (also known as trailing-surrogate code unit).\n */"} {"signature":"@ PublishedApi internal actual fun checkRadix ( radix : Int ) : Int","body":"{ if ( radix !in Character . MIN_RADIX .. Character . MAX_RADIX ) { throw IllegalArgumentException ( \"\" ) } return radix }","docstring":"/**\n * Checks whether the given [radix] is valid radix for string to number and number to string conversion.\n */"} {"signature":"fun main ( )","body":"{ visualizeFSDDWavFiles ( ) val ( train , test ) = freeSpokenDigits ( ) smallSoundNet . use { it . compile ( optimizer = Adam ( ) , loss = Losses . SOFT_MAX_CROSS_ENTROPY_WITH_LOGITS , metric = Metrics . ACCURACY ) it . logSummary ( ) it . fit ( dataset = train , validationRate = , epochs = EPOCHS , trainBatchSize = TRAINING_BATCH_SIZE , validationBatchSize = TEST_BATCH_SIZE ) val accuracy = it . evaluate ( dataset = test , batchSize = TEST_BATCH_SIZE ) . metrics [ Metrics . ACCURACY ] println ( \"\" ) } }","docstring":"/**\n * This example demonstrates model activations and Conv1D filters visualization.\n * Additionally, we present the visualization of sound files as the plots of the sound data.\n *\n * Model is trained on Free Spoken Digits Dataset.\n */"} {"signature":"private fun visualizeFSDDWavFiles ( personName : String = \"\" , samples : Int = )","body":"{ val fssd = freeSpokenDigitDatasetPath ( ) val wavFiles = File ( fssd ) . listFiles ( ) ? : arrayOf ( ) val grouped = wavFiles . filter { it . name . split ( \"\" ) [ ] == personName } . groupBy { it . name . split ( \"\" ) [ ] } . mapValues { it . value . sorted ( ) } val plots = listOf ( grouped [ \"\" ] ! ! . take ( samples ) , grouped [ \"\" ] ! ! . take ( samples ) , grouped [ \"\" ] ! ! . take ( samples ) , grouped [ \"\" ] ! ! . take ( samples ) ) . transpose ( ) . flatten ( ) . map ( :: WavFile ) . map { soundPlot ( it , beginDrop = ) } columnPlot ( plots , , ) . show ( ) }","docstring":"/** Create visualization plots of input sound files for selected data from Free Spoken Digits Dataset */"} {"signature":"private fun < T > List < List < T > > . transpose ( ) : List < List < T > >","body":"{ val size = getOrNull ( ) ? . size ? : require ( all { it . size == size } ) { \"\" } return List ( size ) { x -> List ( this . size ) { y -> this [ y ] [ x ] } } }","docstring":"/** Transpose list of lists when every element of list is a list of equal length */"} {"signature":"fun loadModelWithWeightsAndEvaluate ( )","body":"{ val ( _ , test ) = fashionMnist ( ) val jsonConfigFile = getJSONConfigFile ( ) val model = Sequential . loadModelConfiguration ( jsonConfigFile ) model . use { it . compile ( optimizer = Adam ( ) , loss = Losses . SOFT_MAX_CROSS_ENTROPY_WITH_LOGITS , metric = Metrics . ACCURACY ) it . logSummary ( ) val hdfFile = getWeightsFile ( ) it . loadWeights ( hdfFile ) val accuracy = it . evaluate ( dataset = test , batchSize = ) . metrics [ Metrics . ACCURACY ] println ( \"\" ) } }","docstring":"/**\n * This example demonstrates the inference concept:\n * - Weights are loaded from .h5 file, configuration is loaded from .json file.\n * - Model is evaluated after loading to obtain accuracy value.\n * - No additional training.\n * - No new layers are added.\n *\n * NOTE: Model and weights are resources in `examples` module.\n */"} {"signature":"fun main ( ) : Unit","body":"= loadModelWithWeightsAndEvaluate ( )","docstring":"/** */"} {"signature":"fun getJSONConfigFile ( ) : File","body":"{ val pathToConfig = \"\" val realPathToConfig = OnHeapDataset :: class . java . classLoader . getResource ( pathToConfig ) . path . toString ( ) return File ( realPathToConfig ) }","docstring":"/** Returns JSON file with model configuration, saved from Keras 2.x. */"} {"signature":"fun getWeightsFile ( ) : HdfFile","body":"{ val pathToWeights = \"\" val realPathToWeights = OnHeapDataset :: class . java . classLoader . getResource ( pathToWeights ) . path . toString ( ) val file = File ( realPathToWeights ) return HdfFile ( file ) }","docstring":"/** Returns .h5 file with model weights, saved from Keras 2.x. */"} {"signature":"fun getTypesForFiles ( files : Collection < File > ) : Set < String >","body":"{ val typesFromFiles = HashSet < String > ( files . size ) for ( file in files ) { sourceCache [ file . toURI ( ) ] ? . declaredTypes ? . let { typesFromFiles . addAll ( it ) } } return typesFromFiles }","docstring":"/** Returns all types defined in these files. */"} {"signature":"internal fun getStructure ( sourceFile : File )","body":"= sourceCache [ sourceFile . toURI ( ) ]","docstring":"/** Used for testing only. */"} {"signature":"fun getAllImpactedTypes ( changes : Changes ) : MutableSet < String >","body":"{ fun findImpactedTypes ( changedType : String , transitiveDeps : MutableSet < String > , nonTransitiveDeps : MutableSet < String > ) { dependencyCache [ changedType ] ? . let { impactedSources -> impactedSources . forEach { transitiveDeps . addAll ( sourceCache . getValue ( it ) . declaredTypes ) } } nonTransitiveCache [ changedType ] ? . let { impactedSources -> impactedSources . forEach { nonTransitiveDeps . addAll ( sourceCache . getValue ( it ) . declaredTypes ) } } } val allDirtyTypes = mutableSetOf < String > ( ) var currentDirtyTypes = getTypesForFiles ( changes . sourceChanges ) . toMutableSet ( ) changes . dirtyFqNamesFromClasspath . forEach { classpathChange -> findImpactedTypes ( classpathChange , currentDirtyTypes , allDirtyTypes ) } while ( currentDirtyTypes . isNotEmpty ( ) ) { val nextRound = mutableSetOf < String > ( ) for ( dirtyType in currentDirtyTypes ) { allDirtyTypes . add ( dirtyType ) findImpactedTypes ( dirtyType , nextRound , allDirtyTypes ) } currentDirtyTypes = nextRound . filterTo ( HashSet ( ) ) { it !in allDirtyTypes } } return allDirtyTypes }","docstring":"/**\n * Compute the list of types that are impacted by source changes i.e [Changes.sourceChanges] and [Changes.dirtyFqNamesFromClasspath]\n * i.e classpath changes. The search is transitive, if a file is impacted, all files referencing types defined in that file are\n * also considered impacted. Only original sources and generated sources are reported as impacted (final result does not contain\n * classpath types).\n */"} {"signature":"fun getSourceFileDefinedTypesCount ( ) : Int","body":"{ return sourceCache . values . sumOf { val structure = it as? SourceFileStructure ? : return@sumOf if ( structure . declaredTypes . size == && structure . declaredTypes . single ( ) == \"\" ) { return@sumOf } return@sumOf structure . declaredTypes . size } }","docstring":"/** Returns total number of declared types in .java source files that were processed. */"} {"signature":"public fun createOfflineInstrumenter ( ) : OfflineInstrumenter","body":"{ return OfflineInstrumenterImpl ( false ) }","docstring":"/**\n * Create instance to instrument already compiled class-files.\n *\n * @return instrumenter for offline instrumentation.\n */"} {"signature":"public fun resnet50Light ( 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 resnetLight ( stackFn = stackFn , imageSize = imageSize , numberOfClasses = numberOfClasses , numberOfInputChannels = numberOfInputChannels , lastLayerActivation = lastLayerActivation , preact = false ) }","docstring":"/**\n * Instantiates the ResNet50 architecture without BatchNorm layers 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 * High-Performance Large-Scale Image Recognition Without Normalization\n */"} {"signature":"public fun resnet101Light ( 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 resnetLight ( stackFn = stackFn , imageSize = imageSize , numberOfClasses = numberOfClasses , numberOfInputChannels = numberOfInputChannels , lastLayerActivation = lastLayerActivation , preact = false ) }","docstring":"/**\n * Instantiates the ResNet101 architecture without BatchNorm layers 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 * High-Performance Large-Scale Image Recognition Without Normalization\n */"} {"signature":"public fun resnet152Light ( 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 resnetLight ( stackFn = stackFn , imageSize = imageSize , numberOfClasses = numberOfClasses , numberOfInputChannels = numberOfInputChannels , lastLayerActivation = lastLayerActivation , preact = false ) }","docstring":"/**\n * Instantiates the ResNet152 architecture without BatchNorm layers 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 * High-Performance Large-Scale Image Recognition Without Normalization\n */"} {"signature":"public fun resnet50v2Light ( 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 resnetLight ( stackFn = stackFn , imageSize = imageSize , numberOfClasses = numberOfClasses , numberOfInputChannels = numberOfInputChannels , lastLayerActivation = lastLayerActivation , preact = true ) }","docstring":"/**\n * Instantiates the ResNet50V2 architecture without BatchNorm layers 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 * High-Performance Large-Scale Image Recognition Without Normalization\n */"} {"signature":"public fun resnet101v2Light ( 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 resnetLight ( stackFn = stackFn , imageSize = imageSize , numberOfClasses = numberOfClasses , numberOfInputChannels = numberOfInputChannels , lastLayerActivation = lastLayerActivation , preact = true ) }","docstring":"/**\n * Instantiates the ResNet101V2 architecture without BatchNorm layers 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 * High-Performance Large-Scale Image Recognition Without Normalization\n */"} {"signature":"public fun resnet152v2Light ( 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 resnetLight ( stackFn = stackFn , imageSize = imageSize , numberOfClasses = numberOfClasses , numberOfInputChannels = numberOfInputChannels , lastLayerActivation = lastLayerActivation , preact = true ) }","docstring":"/**\n * Instantiates the ResNet152V2 architecture without BatchNorm layers 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 * High-Performance Large-Scale Image Recognition Without Normalization\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 , convShortcut = 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 , 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":"override fun matches ( startIndex : Int , testString : CharSequence , matchResult : MatchResultImpl ) : Int","body":"{ matchResult . saveState ( ) return tryToMatch ( startIndex , testString , matchResult ) . also { if ( it < ) matchResult . rollbackState ( ) } }","docstring":"/** Returns startIndex+shift, the next position to match */"} {"signature":"@ ObsoleteDescriptorBasedAPI fun IrDeclaration . isFromInteropLibraryByDescriptor ( )","body":"= descriptor . isFromInteropLibrary ( )","docstring":"/**\n * This function should be equivalent to `IrDeclaration.isFromInteropLibrary` from `backend.native`, but in fact it is not for declarations\n * from Fir modules.\n *\n * This should be fixed in the future.\n */"} {"signature":"private fun compressedModules ( deserializers : Collection < IrModuleDeserializer > ) : Map < ResolvedDependencyId , ResolvedDependency >","body":"{ val compressedModules : MutableMap < ResolvedDependencyId , ResolvedDependency > = mergedModules ( deserializers ) var platformLibrariesVersion : ResolvedDependencyVersion ? = null val platformLibraries : MutableList < ResolvedDependency > = mutableListOf ( ) val outgoingDependencyIds : MutableSet < ResolvedDependencyId > = mutableSetOf ( ) for ( ( moduleId , module ) in compressedModules ) { if ( moduleId . isKonanPlatformLibrary ) { if ( sourceCodeModuleId !in module . requestedVersionsByIncomingDependencies ) { continue } platformLibrariesVersion = when ( platformLibrariesVersion ) { null , module . selectedVersion -> module . selectedVersion else -> { return compressedModules } } platformLibraries += module } else { module . requestedVersionsByIncomingDependencies . keys . forEach { incomingDependencyId -> if ( incomingDependencyId . isKonanPlatformLibrary ) { outgoingDependencyIds += moduleId } } } } if ( platformLibraries . isNotEmpty ( ) ) { platformLibraries . forEach { it . visibleAsFirstLevelDependency = false } val compressedModuleId = ResolvedDependencyId ( \"\" ) val compressedModule = ResolvedDependency ( id = compressedModuleId , selectedVersion = platformLibrariesVersion ! ! , requestedVersionsByIncomingDependencies = mutableMapOf ( sourceCodeModuleId to platformLibrariesVersion ) , artifactPaths = mutableSetOf ( ) ) outgoingDependencyIds . forEach { outgoingDependencyId -> val outgoingDependency = compressedModules . getValue ( outgoingDependencyId ) outgoingDependency . requestedVersionsByIncomingDependencies [ compressedModuleId ] = compressedModule . selectedVersion } compressedModules [ compressedModuleId ] = compressedModule } return compressedModules }","docstring":"/**\n * This is an optimization to avoid displaying 100+ Kotlin/Native platform libraries to the user.\n * Instead, lets compress them into a single row and avoid excessive output.\n */"} {"signature":"fun readAbiInfo ( library : File , vararg filters : AbiReadingFilter ) : LibraryAbi","body":"= readAbiInfo ( library , filters . asList ( ) )","docstring":"/**\n * Inspect the KLIB at [library]. The KLIB can be either in a directory (unzipped) or in a file (zipped) form.\n *\n * @param library The file representing the KLIB location.\n * @param filters The filters that are applied while reading the KLIB to exclude/ignore certain entities.\n */"} {"signature":"fun readAbiInfo ( library : File , filters : List < AbiReadingFilter > ) : LibraryAbi","body":"= LibraryAbiReaderImpl ( library , filters ) . readAbi ( )","docstring":"/** @see [readAbiInfo] */"} {"signature":"fun isPackageExcluded ( packageName : AbiCompoundName ) : Boolean","body":"= false","docstring":"/** Tests for each package being read by the ABI reader if it should be excluded/ignored. */"} {"signature":"fun isDeclarationExcluded ( declaration : AbiDeclaration ) : Boolean","body":"= false","docstring":"/** Tests for each declaration being read by the ABI reader if it should be excluded/ignored */"} {"signature":"@ Test fun verifySpecialIsRuleIsApplied ( )","body":"{ val writerPlugin = TestOutputWriterPlugin ( ) testInline ( \"\"\"\"\"\" . trimIndent ( ) , configuration , cleanupOutput = false , pluginOverrides = listOf ( writerPlugin , JavadocPlugin ( ) ) ) { renderingStage = { _ , _ -> val html = writerPlugin . writer . contents . getValue ( \"\" ) . let { Jsoup . parse ( it ) } val props = html . select ( \"\" ) . select ( \"\" ) . select ( \"\" ) . map { it . text ( ) } . toSet ( ) assertTrue ( setOf ( \"\" , \"\" , \"\" , \"\" , ) == props || setOf ( \"\" , \"\" , \"\" , \"\" , ) == props ) val descriptionLinks = html . select ( \"\" ) . select ( \"\" ) . select ( \"\" ) . eachAttr ( \"\" ) . map { a -> a . takeLastWhile { it != '' } } assertEquals ( setOf ( \"\" , \"\" , ) , descriptionLinks . toSet ( ) ) assertEquals ( , html . select ( \"\" ) . size ) assertEquals ( , html . select ( \"\" ) . size ) } } }","docstring":"/**\n * This is a quick sanity check for the AccessorMethodNamingTest\n */"} {"signature":"fun afterInvalidation ( modules : Set < KtModule > )","body":"fun afterInvalidation ( modules : Set < KtModule > )","docstring":"/**\n * [afterInvalidation] is published when sessions for the given [modules] have been invalidated. Because the sessions are already\n * invalid, the event carries their [KtModule][org.jetbrains.kotlin.analysis.project.structure.KtModule]s.\n *\n * @see LLFirSessionInvalidationTopics\n */"} {"signature":"fun afterGlobalInvalidation ( )","body":"fun afterGlobalInvalidation ( )","docstring":"/**\n * [afterGlobalInvalidation] is published when all sessions may have been invalidated. The event doesn't guarantee that all sessions\n * have been invalidated, but e.g. caches should be cleared as if this was the case. This event is published when the invalidated\n * sessions cannot be easily enumerated.\n *\n * @see LLFirSessionInvalidationTopics\n */"} {"signature":"internal fun ExpectActualMatchingContext < * > . matchSingleExpectAgainstPotentialActuals ( expectMember : DeclarationSymbolMarker , actualMembers : List < DeclarationSymbolMarker > , substitutor : TypeSubstitutorMarker ? , expectClassSymbol : RegularClassSymbolMarker ? , actualClassSymbol : RegularClassSymbolMarker ? , mismatchedMembers : MutableList < Pair < DeclarationSymbolMarker , Map < ExpectActualMatchingCompatibility . Mismatch , List < DeclarationSymbolMarker ? > > > > ? , ) : List < DeclarationSymbolMarker >","body":"{ val mapping = actualMembers . keysToMap { actualMember -> when ( expectMember ) { is CallableSymbolMarker -> getCallablesCompatibility ( expectMember , actualMember as CallableSymbolMarker , substitutor , expectClassSymbol , actualClassSymbol ) is RegularClassSymbolMarker -> { matchClassifiers ( expectMember , actualMember as ClassLikeSymbolMarker , this ) } else -> error ( \"\" ) } } val matched = ArrayList < DeclarationSymbolMarker > ( ) val mismatched = HashMap < ExpectActualMatchingCompatibility . Mismatch , MutableList < DeclarationSymbolMarker > > ( ) for ( ( actualMember , compatibility ) in mapping ) { when ( compatibility ) { ExpectActualMatchingCompatibility . MatchedSuccessfully -> { onMatchedMembers ( expectMember , actualMember , expectClassSymbol , actualClassSymbol ) matched . add ( actualMember ) } is ExpectActualMatchingCompatibility . Mismatch -> mismatched . getOrPut ( compatibility ) { SmartList ( ) } . add ( actualMember ) } } if ( matched . isNotEmpty ( ) ) { return matched } mismatchedMembers ? . add ( expectMember to mismatched ) onMismatchedMembersFromClassScope ( expectMember , mismatched , expectClassSymbol , actualClassSymbol ) return emptyList ( ) }","docstring":"/**\n * Besides returning the matched declarations, the function has an additional side effects:\n * - It adds mismatched members to `mismatchedMembers`\n * - It calls `onMatchedMembers` and `onMismatchedMembersFromClassScope` callbacks\n */"} {"signature":"fun FileLoweringPass . runOnFileInOrder ( irFile : IrFile )","body":"{ irFile . acceptVoid ( object : IrElementVisitorVoid { override fun visitElement ( element : IrElement ) { element . acceptChildrenVoid ( this ) } override fun visitFile ( declaration : IrFile ) { lower ( declaration ) declaration . acceptChildrenVoid ( this ) } } ) }","docstring":"/**\n * Copy of [runOnFilePostfix], but this implementation first lowers declaration, then its children.\n */"} {"signature":"public fun KtType . approximateToSuperPublicDenotable ( approximateLocalTypes : Boolean ) : KtType ?","body":"= withValidityAssertion { analysisSession . typeProvider . approximateToSuperPublicDenotableType ( this , approximateLocalTypes ) }","docstring":"/**\n * Approximates [KtType] with a supertype which can be rendered in a source code\n *\n * Return `null` if the type do not need approximation and can be rendered as is\n * Otherwise, for type `T` return type `S` such `T <: S` and `T` and every type argument is denotable\n */"} {"signature":"public fun KtType . approximateToSubPublicDenotable ( approximateLocalTypes : Boolean ) : KtType ?","body":"= withValidityAssertion { analysisSession . typeProvider . approximateToSubPublicDenotableType ( this , approximateLocalTypes ) }","docstring":"/**\n * Approximates [KtType] with a subtype which can be rendered in a source code\n *\n * Return `null` if the type do not need approximation and can be rendered as is\n * Otherwise, for type `T` return type `S` such `S <: T` and `T` and every type argument is denotable\n */"} {"signature":"public fun KtType . getEnhancedType ( ) : KtType ?","body":"= withValidityAssertion { analysisSession . typeProvider . getEnhancedType ( this ) }","docstring":"/**\n * Returns a warning-level enhanced type for [KtType] if it is present. Otherwise, returns `null`.\n */"} {"signature":"public fun commonSuperType ( types : Collection < KtType > ) : KtType ?","body":"= withValidityAssertion { analysisSession . typeProvider . commonSuperType ( types ) }","docstring":"/**\n * Computes the common super type of the given collection of [KtType].\n *\n * If the collection is empty, it returns `null`.\n */"} {"signature":"public fun KtTypeReference . getKtType ( ) : KtType","body":"= withValidityAssertion { analysisSession . typeProvider . getKtType ( this ) }","docstring":"/**\n * Resolve [KtTypeReference] and return corresponding [KtType] if resolved.\n *\n * This may raise an exception if the resolution ends up with an unexpected kind.\n */"} {"signature":"public fun KtDoubleColonExpression . getReceiverKtType ( ) : KtType ?","body":"= withValidityAssertion { analysisSession . typeProvider . getReceiverTypeForDoubleColonExpression ( this ) }","docstring":"/**\n * Resolve [KtDoubleColonExpression] and return [KtType] of its receiver.\n *\n * Return `null` if the resolution fails or the resolved callable reference is not a reflection type.\n */"} {"signature":"public fun KtType . hasCommonSubTypeWith ( that : KtType ) : Boolean","body":"= withValidityAssertion { analysisSession . typeProvider . haveCommonSubtype ( this , that ) }","docstring":"/** Check whether this type is compatible with that type. If they are compatible, it means they can have a common subtype. */"} {"signature":"public fun getImplicitReceiverTypesAtPosition ( position : KtElement ) : List < KtType >","body":"= withValidityAssertion { analysisSession . typeProvider . getImplicitReceiverTypesAtPosition ( position ) }","docstring":"/**\n * Gets all the implicit receiver types available at the given position. The type of the outermost receiver appears at the beginning\n * of the returned list.\n */"} {"signature":"public fun KtType . getDirectSuperTypes ( shouldApproximate : Boolean = false ) : List < KtType >","body":"= withValidityAssertion { analysisSession . typeProvider . getDirectSuperTypes ( this , shouldApproximate ) }","docstring":"/**\n * Gets the direct super types of the given type. For example, given `MutableList`, this returns `List` and\n * `MutableCollection`.\n *\n * Note that for flexible types, both direct super types of the upper and lower bounds are returned. If that's not desirable, please\n * first call [KtFlexibleType.upperBound] or [KtFlexibleType.lowerBound] and then call this method.\n *\n * @param shouldApproximate whether to approximate non-denotable types. For example, super type of `List` is\n * `Collection`. With approximation set to true, `Collection` is returned instead.\n */"} {"signature":"public fun KtType . getAllSuperTypes ( shouldApproximate : Boolean = false ) : List < KtType >","body":"= withValidityAssertion { analysisSession . typeProvider . getAllSuperTypes ( this , shouldApproximate ) }","docstring":"/**\n * Gets all the super types of the given type. The returned result is ordered by a BFS traversal of the class hierarchy, without any\n * duplicates.\n *\n * @param shouldApproximate see [getDirectSuperTypes]\n */"} {"signature":"@ Suppress ( \"\" ) @ Deprecated ( \"\" ) public fun KtCallableSymbol . getDispatchReceiverType ( ) : KtType ?","body":"= withValidityAssertion { analysisSession . typeProvider . getDispatchReceiverType ( this ) }","docstring":"/**\n * This function is provided for a few use-cases where it's hard to go without it.\n *\n * **Please avoid using it**; it will probably be removed in the future.\n *\n * The function is instantly deprecated, so it's not shown in the completion.\n *\n * @receiver A target callable symbol.\n * @return A dispatch receiver type for this symbol if it has any.\n */"} {"signature":"public fun KtType . getArrayElementType ( ) : KtType ?","body":"= withValidityAssertion { analysisSession . typeProvider . getArrayElementType ( this ) }","docstring":"/**\n * If provided [KtType] is a primitive type array or [Array], returns the type of the array's elements. Otherwise, returns null.\n */"} {"signature":"fun aa ( )","body":"{ }","docstring":"/**\n * [bb]\n */"} {"signature":"fun < Service > loadImplementations ( service : Class < out Service > , classLoader : URLClassLoader ) : List < Service >","body":"{ val files = classLoader . urLs . map { url -> try { Paths . get ( url . toURI ( ) ) . toFile ( ) } catch ( e : FileSystemNotFoundException ) { throw IllegalArgumentException ( \"\" ) } catch ( e : UnsupportedOperationException ) { throw IllegalArgumentException ( \"\" ) } } return loadImplementations ( service , files , classLoader ) }","docstring":"/**\n * Returns implementations for the given `service` declared in META-INF/services of the `classLoader` roots.\n *\n * Note that the behavior is radically different from what Java ServiceLoader does.\n * ServiceLoaderLite doesn't iterate over the whole ClassLoader hierarchy, it takes only the immediate roots of `classLoader`.\n * In fact, this is often the desired behavior.\n */"} {"signature":"abstract fun isEmpty ( ) : Boolean","body":"abstract fun isEmpty ( ) : Boolean","docstring":"/**\n * Check if values of argument are empty.\n */"} {"signature":"protected fun valueIsInitialized ( )","body":"= :: parsedValue . isInitialized","docstring":"/**\n * Check if value of argument was initialized.\n */"} {"signature":"protected abstract fun saveValue ( stringValue : String )","body":"protected abstract fun saveValue ( stringValue : String )","docstring":"/**\n * Sace value from command line.\n *\n * @param stringValue value from command line.\n */"} {"signature":"fun setDelegatedValue ( providedValue : TResult )","body":"{ parsedValue = providedValue valueOrigin = ArgParser . ValueOrigin . REDEFINED }","docstring":"/**\n * Set value of delegated property.\n */"} {"signature":"internal fun addValue ( stringValue : String )","body":"{ if ( descriptor is OptionDescriptor < * , * > && ! descriptor . multiple && ! isEmpty ( ) && descriptor . delimiter == null ) { throw ParsingException ( \"\" ) } descriptor . deprecatedWarning ? . let { if ( isEmpty ( ) ) println ( \"\" ) } if ( descriptor is OptionDescriptor < * , * > && descriptor . delimiter != null ) { stringValue . split ( descriptor . delimiter ) . forEach { saveValue ( it ) } } else { saveValue ( stringValue ) } }","docstring":"/**\n * Add parsed value from command line.\n *\n * @param stringValue value from command line.\n */"} {"signature":"fun addDefaultValue ( )","body":"{ if ( descriptor . defaultValueSet ) { parsedValue = descriptor . defaultValue ! ! valueOrigin = ArgParser . ValueOrigin . SET_DEFAULT_VALUE } }","docstring":"/**\n * Set default value to option.\n */"} {"signature":"fun provideName ( name : String )","body":"{ descriptor . fullName ? : run { descriptor . fullName = name } }","docstring":"/**\n * Provide name for CLI entity.\n *\n * @param name name for CLI entity.\n */"} {"signature":"fun require ( request : String ) : String","body":"{ return resolve ( request ) ? . canonicalPath ? : error ( \"\" ) }","docstring":"/**\n * Require [request] nodejs module and return canonical path to it's main js file.\n */"} {"signature":"internal fun resolve ( name : String , context : File = dir ) : File ?","body":"= if ( name . startsWith ( \"\" ) ) resolve ( name . removePrefix ( \"\" ) , File ( \"\" ) ) else resolveAsRelative ( \"\" , name , context ) ? : resolveAsRelative ( \"\" , name , context ) ? : resolveAsRelative ( \"\" , name , context ) ? : resolveInNodeModulesDir ( name , context . resolve ( NODE_MODULES ) ) ? : context . parentFile ? . let { resolve ( name , it ) }","docstring":"/**\n * Find node module according to https://nodejs.org/api/modules.html#modules_all_together\n */"} {"signature":"fun getDefinitionClasses ( ) : Iterable < String >","body":"fun getDefinitionClasses ( ) : Iterable < String >","docstring":"/**\n * Should return a list of the FQNs of the script definition template classes to load explicitly, if any\n */"} {"signature":"fun getDefinitionsClassPath ( ) : Iterable < File >","body":"fun getDefinitionsClassPath ( ) : Iterable < File >","docstring":"/**\n * Should return a classpath required for loading script definition template classes\n */"} {"signature":"fun useDiscovery ( ) : Boolean","body":"fun useDiscovery ( ) : Boolean","docstring":"/**\n * if returns true, the IntelliJ will scan the classpath from [getDefinitionClasses] to discover script definition templates\n * using definition markers in the \"META-INF/kotlin/script/templates/\" folder\n */"} {"signature":"fun provideDefinitions ( baseHostConfiguration : ScriptingHostConfiguration , loadedScriptDefinitions : List < ScriptDefinition > ) : Iterable < ScriptDefinition >","body":"= loadedScriptDefinitions","docstring":"/**\n * The callback to update/add/remove script definitions after loading, if needed\n */"} {"signature":"protected open fun IrDeclarationWithVisibility . accessorParent ( parent : IrDeclarationParent , scopes : List < ScopeWithIr > )","body":"= parent","docstring":"/**\n * In case of Java `protected static`, access could be done from a public inline function in the same package,\n * or a subclass of the Java class. Both cases require an accessor, which we cannot add to a Java class.\n */"} {"signature":"protected open fun fieldAccessorSuffix ( field : IrField , superQualifierSymbol : IrClassSymbol ? ) : String","body":"= field . run { if ( superQualifierSymbol != null ) { return \"\" } return \"\" + if ( isStatic && visibility . isProtected ) \"\" + parentAsClass . syntheticAccessorToSuperSuffix ( ) else \"\" }","docstring":"/**\n * For both _reading_ and _writing_ field accessors, the suffix that includes some of [field]'s important properties.\n */"} {"signature":"fun String . offsetOf ( position : CodePosition ) : Int","body":"{ var i = var lineCount = var offsetInLine = while ( i < length ) { val c = this [ i ] if ( lineCount == position . line && offsetInLine == position . offset ) { return i } i ++ offsetInLine ++ if ( Utils . isEndOfLine ( c . code ) ) { offsetInLine = lineCount ++ assert ( lineCount <= position . line ) } } return length }","docstring":"/**\n * Calculates an offset from the start of a text for a position,\n * defined by line and offset in that line.\n */"} {"signature":"fun < T : Any > all ( a : KtNDArray < T > ) : Boolean","body":"= callFunc ( arrayOf ( \"\" ) , args = arrayOf ( a ) , kClass = Boolean :: class )","docstring":"/**\n * Test whether all array elements along a given axis evaluate to *true*.\n */"} {"signature":"fun < T : Any > all ( a : KtNDArray < T > , axis : Int ) : KtNDArray < Boolean >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( a , axis ) )","docstring":"/**\n *\n */"} {"signature":"fun < T : Any > any ( a : KtNDArray < T > ) : Boolean","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( a ) , kClass = Boolean :: class )","docstring":"/**\n * Test whether any array element along a given axis evaluates to *true*.\n */"} {"signature":"fun < T : Any > any ( a : KtNDArray < T > , axis : Int ) : KtNDArray < Boolean >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( a , axis ) )","docstring":"/**\n *\n */"} {"signature":"fun < T : Any > isFinite ( x : KtNDArray < T > ) : KtNDArray < Boolean >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( x ) )","docstring":"/**\n * Test element-wise for finiteness (not infinity or not Not a Number).\n */"} {"signature":"fun < T : Any > isInf ( x : KtNDArray < T > ) : KtNDArray < Boolean >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( x ) )","docstring":"/**\n * Test element-wise for positive or negative infinity.\n */"} {"signature":"fun < T : Any > isNan ( x : KtNDArray < T > ) : KtNDArray < Boolean >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( x ) )","docstring":"/**\n * Test element-wise for NaN and return result as a boolean array.\n */"} {"signature":"fun < T : Any > isNegInf ( x : KtNDArray < T > ) : KtNDArray < Boolean >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( x ) )","docstring":"/**\n * Test element-wise for negative infinity, return result as bool array.\n */"} {"signature":"fun < T : Any > isPosInf ( x : KtNDArray < T > ) : KtNDArray < Boolean >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( x ) )","docstring":"/**\n * Test element-wise for positive infinity, return result as bool array.\n */"} {"signature":"fun < T : Any , E : Any > logicalAnd ( x1 : KtNDArray < T > , x2 : KtNDArray < E > ) : KtNDArray < Boolean >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( x1 , x2 ) )","docstring":"/**\n * Compute the truth value of x1 AND x2 element-wise.\n */"} {"signature":"fun < T : Any , E : Any > logicalOr ( x1 : KtNDArray < T > , x2 : KtNDArray < E > ) : KtNDArray < Boolean >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( x1 , x2 ) )","docstring":"/**\n * Compute the truth value of x1 OR x2 element-wise.\n */"} {"signature":"fun < T : Any > logicalNot ( x : KtNDArray < T > ) : KtNDArray < Boolean >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( x ) )","docstring":"/**\n * Compute the truth value of NOT x element-wise.\n */"} {"signature":"fun < T : Any , E : Any > logicalXor ( x1 : KtNDArray < T > , x2 : KtNDArray < E > ) : KtNDArray < Boolean >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( x1 , x2 ) )","docstring":"/**\n * Compute the truth value of x1 XOR x2, element-wise.\n */"} {"signature":"fun < T : Any , E : Any > allClose ( a : KtNDArray < T > , b : KtNDArray < E > , rtol : Double = , atol : Double = , equalNan : Boolean = false ) : Boolean","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( a , b , rtol , atol , equalNan ) , kClass = Boolean :: class )","docstring":"/**\n * Returns *true* if two arrays are element-wise equal within a tolerance.\n */"} {"signature":"fun < T : Any , E : Any > isClose ( a : KtNDArray < T > , b : KtNDArray < E > , rtol : Double = , atol : Double = , equalNan : Boolean = false ) : KtNDArray < Boolean >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( a , b , rtol , atol , equalNan ) )","docstring":"/**\n * Returns a boolean array where two arrays are element-wise equal within a tolerance.\n */"} {"signature":"fun < T : Any , E : Any > arrayEqual ( a1 : KtNDArray < T > , a2 : KtNDArray < E > ) : Boolean","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( a1 , a2 ) , kClass = Boolean :: class )","docstring":"/**\n * *true* if two arrays have the same shape and elements, *false* otherwise.\n */"} {"signature":"fun < T : Any , E : Any > arrayEquiv ( a1 : KtNDArray < T > , a2 : KtNDArray < E > ) : Boolean","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( a1 , a2 ) , kClass = Boolean :: class )","docstring":"/**\n * Returns *true* if input arrays are shape consistent and all elements equal.\n */"} {"signature":"fun < T : Any , E : Any > greater ( x1 : KtNDArray < T > , x2 : KtNDArray < E > ) : KtNDArray < Boolean >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( x1 , x2 ) )","docstring":"/**\n * Return the truth value of (x1 > x2) element-wise.\n */"} {"signature":"fun < T : Any , E : Any > greaterEqual ( x1 : KtNDArray < T > , x2 : KtNDArray < E > ) : KtNDArray < Boolean >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( x1 , x2 ) )","docstring":"/**\n * Return the truth value of (x1 >= x2) element-wise.\n */"} {"signature":"fun < T : Any , E : Any > less ( x1 : KtNDArray < T > , x2 : KtNDArray < E > ) : KtNDArray < Boolean >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( x1 , x2 ) )","docstring":"/**\n * Return the truth value of (x1 < x2) element-wise.\n */"} {"signature":"fun < T : Any , E : Any > lessEqual ( x1 : KtNDArray < T > , x2 : KtNDArray < E > ) : KtNDArray < Boolean >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( x1 , x2 ) )","docstring":"/**\n * Return the truth value of (x1 =< x2) element-wise.\n */"} {"signature":"fun < T : Any , E : Any > equal ( x1 : KtNDArray < T > , x2 : KtNDArray < E > ) : KtNDArray < Boolean >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( x1 , x2 ) )","docstring":"/**\n * Return (x1 == x2) element-wise.\n */"} {"signature":"fun < T : Any , E : Any > notEqual ( x1 : KtNDArray < T > , x2 : KtNDArray < E > ) : KtNDArray < Boolean >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( x1 , x2 ) )","docstring":"/**\n * Return (x1 != x2) element-wise.\n */"} {"signature":"@ HtmlTagMarker inline fun VIDEO . source ( classes : String ? = null , crossinline block : SOURCE . ( ) -> Unit = { } ) : Unit","body":"= SOURCE ( attributesMapOf ( \"\" , classes ) , consumer ) . visit ( block )","docstring":"/**\n * Media source for \n */"} {"signature":"public fun detectPose ( image : I ) : DetectedPose","body":"= predict ( image )","docstring":"/**\n * Detects a pose for the given [image].\n * @param [image] input image.\n */"} {"signature":"private fun dfgNodeToConstraintNode ( function : Function , node : DataFlowIR . Node ) : Node","body":"{ fun edgeToConstraintNode ( edge : DataFlowIR . Edge ) : Node = edgeToConstraintNode ( function , edge ) fun doCall ( callee : DataFlowIR . FunctionSymbol , arguments : List < Node > , returnType : DataFlowIR . Type . Declared ) = doCall ( function , callee , arguments , returnType ) fun readField ( field : DataFlowIR . Field , actualType : DataFlowIR . Type . Declared ) : Node { val fieldNode = fieldNode ( field ) val expectedType = field . type . resolved ( ) return if ( ! useTypes || actualType == expectedType ) fieldNode else doCast ( function , fieldNode , actualType ) } fun writeField ( field : DataFlowIR . Field , value : Node ) = addEdge ( value , fieldNode ( field ) ) if ( node is DataFlowIR . Node . Variable && node . kind != DataFlowIR . VariableKind . Temporary ) { return variables . getOrPut ( node ) { ordinaryNode { \"\" } } } return functionNodesMap . getOrPut ( node ) { when ( node ) { is DataFlowIR . Node . Const -> { val type = node . type . resolved ( ) addInstantiatingClass ( type ) sourceNode ( concreteType ( type ) ) { \"\" } } DataFlowIR . Node . Null -> constraintGraph . voidNode is DataFlowIR . Node . Parameter -> function . parameters [ node . index ] is DataFlowIR . Node . StaticCall -> { val arguments = node . arguments . map ( :: edgeToConstraintNode ) doCall ( node . callee , arguments , node . returnType . resolved ( ) ) } is DataFlowIR . Node . NewObject -> { val returnType = node . constructedType . resolved ( ) addInstantiatingClass ( returnType ) val instanceNode = concreteClass ( returnType ) val arguments = listOf ( instanceNode ) + node . arguments . map ( :: edgeToConstraintNode ) doCall ( node . callee , arguments , returnType ) instanceNode } is DataFlowIR . Node . VirtualCall -> { val callee = node . callee val receiverType = node . receiverType . resolved ( ) context . logMultiple { + \"\" + \"\" + \"\" + \"\" + \"\" forEachBitInBoth ( typeHierarchy . inheritorsOf ( receiverType ) , instantiatingClasses ) { + allTypes [ it ] . calleeAt ( node ) . toString ( ) } + \"\" } val returnType = node . returnType . resolved ( ) val arguments = node . arguments . map ( :: edgeToConstraintNode ) val receiverNode = arguments [ ] if ( receiverType == DataFlowIR . Type . Virtual ) addEdge ( constraintGraph . virtualNode , receiverNode ) if ( entryPoint == null && returnType . isFinal ) { addInstantiatingClass ( returnType ) } val returnsNode = ordinaryNode { \"\" } if ( receiverType != DataFlowIR . Type . Virtual ) typesVirtualCallSites [ receiverType . index ] . add ( ConstraintGraphVirtualCall ( function , node , arguments , returnsNode ) ) forEachBitInBoth ( typeHierarchy . inheritorsOf ( receiverType ) , instantiatingClasses ) { val actualCallee = allTypes [ it ] . calleeAt ( node ) addEdge ( doCall ( actualCallee , arguments , actualCallee . returnParameter . type . resolved ( ) ) , returnsNode ) } if ( entryPoint == null ) { if ( ! returnType . isFinal ) { receiverNode . addCastEdge ( Node . CastEdge ( returnsNode , virtualTypeFilter ) ) } else { constraintGraph . externalVirtualCalls . add ( ExternalVirtualCall ( receiverNode , returnsNode , returnType ) ) } } receiverNode . addCastEdge ( Node . CastEdge ( function . throws , virtualTypeFilter ) ) constraintGraph . virtualCallSiteReceivers [ node ] = receiverNode castIfNeeded ( function , returnsNode , node . callee . returnParameter . type . resolved ( ) , returnType ) } is DataFlowIR . Node . Singleton -> { val type = node . type . resolved ( ) addInstantiatingClass ( type ) val instanceNode = concreteClass ( type ) node . constructor ? . let { doCall ( it , buildList { add ( instanceNode ) node . arguments ? . forEach { add ( edgeToConstraintNode ( it ) ) } } , type ) } instanceNode } is DataFlowIR . Node . AllocInstance -> { val type = node . type . resolved ( ) addInstantiatingClass ( type ) concreteClass ( type ) } is DataFlowIR . Node . FunctionReference -> { concreteClass ( node . type . resolved ( ) ) } is DataFlowIR . Node . FieldRead -> { val type = node . field . type . resolved ( ) if ( entryPoint == null && type . isFinal ) addInstantiatingClass ( type ) readField ( node . field , node . type . resolved ( ) ) } is DataFlowIR . Node . FieldWrite -> { val type = node . field . type . resolved ( ) if ( entryPoint == null && type . isFinal ) addInstantiatingClass ( type ) writeField ( node . field , edgeToConstraintNode ( node . value ) ) constraintGraph . voidNode } is DataFlowIR . Node . ArrayRead -> readField ( constraintGraph . arrayItemField , node . type . resolved ( ) ) is DataFlowIR . Node . ArrayWrite -> { writeField ( constraintGraph . arrayItemField , edgeToConstraintNode ( node . value ) ) constraintGraph . voidNode } is DataFlowIR . Node . Variable -> node . values . map { edgeToConstraintNode ( it ) } . let { values -> ordinaryNode { \"\" } . also { node -> values . forEach { addEdge ( it , node ) } } } else -> error ( \"\" ) } } }","docstring":"/**\n * Takes a function DFG's node and creates a constraint graph node corresponding to it.\n * Also creates all necessary edges, except for variable nodes.\n * For variable nodes edges must be created separately, otherwise recursion can be too deep.\n */"} {"signature":"fun clearExtras ( )","body":"{ _builder . clearExtras ( ) }","docstring":"/**\n * optional .org.jetbrains.kotlin.gradle.idea.proto.generated.IdeaExtrasProto extras = 1;\n */"} {"signature":"fun hasExtras ( ) : kotlin . Boolean","body":"{ return _builder . hasExtras ( ) }","docstring":"/**\n * optional .org.jetbrains.kotlin.gradle.idea.proto.generated.IdeaExtrasProto extras = 1;\n * @return Whether the extras field is set.\n */"} {"signature":"fun clearCoordinates ( )","body":"{ _builder . clearCoordinates ( ) }","docstring":"/**\n * optional .org.jetbrains.kotlin.gradle.idea.proto.generated.tcs.IdeaKotlinBinaryCoordinatesProto coordinates = 2;\n */"} {"signature":"fun hasCoordinates ( ) : kotlin . Boolean","body":"{ return _builder . hasCoordinates ( ) }","docstring":"/**\n * optional .org.jetbrains.kotlin.gradle.idea.proto.generated.tcs.IdeaKotlinBinaryCoordinatesProto coordinates = 2;\n * @return Whether the coordinates field is set.\n */"} {"signature":"fun clearCause ( )","body":"{ _builder . clearCause ( ) }","docstring":"/**\n * optional string cause = 3;\n */"} {"signature":"fun hasCause ( ) : kotlin . Boolean","body":"{ return _builder . hasCause ( ) }","docstring":"/**\n * optional string cause = 3;\n * @return Whether the cause field is set.\n */"} {"signature":"private fun collectClassCategories ( classCursor : CValue < CXCursor > , className : String ) : List < CValue < CXCursor > >","body":"{ assert ( classCursor . kind == CXCursorKind . CXCursor_ObjCInterfaceDecl ) { classCursor . kind } val classFile = getContainingFile ( classCursor ) val result = mutableListOf < CValue < CXCursor > > ( ) val translationUnit = clang_getCursorLexicalParent ( classCursor ) visitChildren ( translationUnit ) { childCursor , _ -> if ( childCursor . kind == CXCursorKind . CXCursor_ObjCCategoryDecl ) { val categoryClassCursor = getObjCCategoryClassCursor ( childCursor ) val categoryClassName = clang_getCursorDisplayName ( categoryClassCursor ) . convertAndDispose ( ) if ( className == categoryClassName ) { val categoryFile = getContainingFile ( childCursor ) if ( clang_File_isEqual ( categoryFile , classFile ) != ) { result += childCursor } } } CXChildVisitResult . CXChildVisit_Continue } return result }","docstring":"/**\n * Find all categories for a class that is pointed by [classCursor] in the same file.\n * NB: Current implementation is rather slow as it walks the whole translation unit.\n */"} {"signature":"internal fun < C > TransformableColumnSet < C > . atAnyDepthImpl ( includeGroups : Boolean = true , includeTopLevel : Boolean = true , ) : ColumnSet < C >","body":"= object : ColumnSet < C > { override fun resolve ( context : ColumnResolutionContext ) : List < ColumnWithPath < C > > = this@atAnyDepthImpl . transformResolve ( context = context , transformer = AtAnyDepthTransformer ( includeGroups = includeGroups , includeTopLevel = includeTopLevel , ) , ) }","docstring":"/**\n * AtAnyDepth implementation for [TransformableColumnSet].\n * This converts a [TransformableColumnSet] into a [ColumnSet] by redirecting [ColumnSet.resolve]\n * to [TransformableColumnSet.transformResolve] with a correctly configured [AtAnyDepthTransformer].\n */"} {"signature":"internal fun < C > TransformableSingleColumn < C > . atAnyDepthImpl ( includeGroups : Boolean = true , includeTopLevel : Boolean = true , ) : SingleColumn < C >","body":"= object : SingleColumn < C > { override fun resolveSingle ( context : ColumnResolutionContext ) : ColumnWithPath < C > ? = this@atAnyDepthImpl . transformResolveSingle ( context = context , transformer = AtAnyDepthTransformer ( includeGroups = includeGroups , includeTopLevel = includeTopLevel , ) , ) }","docstring":"/**\n * AtAnyDepth implementation for [TransformableSingleColumn].\n * This converts a [TransformableSingleColumn] into a [SingleColumn] by redirecting [SingleColumn.resolveSingle]\n * to [TransformableSingleColumn.transformResolveSingle] with a correctly configured [AtAnyDepthTransformer].\n */"} {"signature":"internal fun ColumnsResolver < * > . flattenRecursively ( includeGroups : Boolean = true , includeTopLevel : Boolean = true , ) : ColumnsResolver < * >","body":"= allColumnsInternal ( ) . transform { cols -> if ( includeTopLevel ) { cols . flattenRecursively ( ) } else { cols . filter { it . isColumnGroup ( ) } . flatMap { it . cols ( ) . flattenRecursively ( ) } } . filter { includeGroups || ! it . isColumnGroup ( ) } }","docstring":"/**\n * Flattens a [ColumnsResolver] recursively.\n *\n * If [this] is a [SingleColumn] containing a single [ColumnGroup], the \"top-level\" is\n * considered to be the [ColumnGroup]'s children, otherwise, if this is a [ColumnsResolver],\n * the \"top-level\" is considered to be the columns in the [ColumnsResolver].\n *\n * @param includeGroups Whether to include [ColumnGroup]s in the result.\n * @param includeTopLevel Whether to include the \"top-level\" columns in the result.\n */"} {"signature":"public fun write ( source : ByteArray , startIndex : Int = , endIndex : Int = source . size )","body":"public fun write ( source : ByteArray , startIndex : Int = , endIndex : Int = source . size )","docstring":"/**\n * Writes bytes from [source] array or its subrange to this sink.\n *\n * @param source the array from which bytes will be written into this sink.\n * @param startIndex the start index (inclusive) of the [source] subrange to be written, 0 by default.\n * @param endIndex the endIndex (exclusive) of the [source] subrange to be written, size of the [source] by default.\n *\n * @throws IndexOutOfBoundsException when [startIndex] or [endIndex] is out of range of [source] array indices.\n * @throws IllegalArgumentException when `startIndex > endIndex`.\n * @throws IllegalStateException when the sink is closed.\n *\n * @sample kotlinx.io.samples.KotlinxIoCoreCommonSamples.writeByteArrayToSink\n */"} {"signature":"public fun transferFrom ( source : RawSource ) : Long","body":"public fun transferFrom ( source : RawSource ) : Long","docstring":"/**\n * Removes all bytes from [source] and write them to this sink.\n * Returns the number of bytes read which will be 0 if [source] is exhausted.\n *\n * @param source the source to consume data from.\n *\n * @throws IllegalStateException when the sink or [source] is closed.\n *\n * @sample kotlinx.io.samples.KotlinxIoCoreCommonSamples.transferFrom\n */"} {"signature":"public fun write ( source : RawSource , byteCount : Long )","body":"public fun write ( source : RawSource , byteCount : Long )","docstring":"/**\n * Removes [byteCount] bytes from [source] and write them to this sink.\n *\n * If [source] will be exhausted before reading [byteCount] from it then an exception throws on\n * an attempt to read remaining bytes will be propagated to a caller of this method.\n *\n * @param source the source to consume data from.\n * @param byteCount the number of bytes to read from [source] and to write into this sink.\n *\n * @throws IllegalArgumentException when [byteCount] is negative.\n * @throws IllegalStateException when the sink or [source] is closed.\n *\n * @sample kotlinx.io.samples.KotlinxIoCoreCommonSamples.writeSourceToSink\n */"} {"signature":"public fun writeByte ( byte : Byte )","body":"public fun writeByte ( byte : Byte )","docstring":"/**\n * Writes a byte to this sink.\n *\n * @param byte the byte to be written.\n *\n * @throws IllegalStateException when the sink is closed.\n *\n * @sample kotlinx.io.samples.KotlinxIoCoreCommonSamples.writeByte\n */"} {"signature":"public fun writeShort ( short : Short )","body":"public fun writeShort ( short : Short )","docstring":"/**\n * Writes two bytes containing [short], in the big-endian order, to this sink.\n *\n * @param short the short integer to be written.\n *\n * @throws IllegalStateException when the sink is closed.\n *\n * @sample kotlinx.io.samples.KotlinxIoCoreCommonSamples.writeShort\n */"} {"signature":"public fun writeInt ( int : Int )","body":"public fun writeInt ( int : Int )","docstring":"/**\n * Writes four bytes containing [int], in the big-endian order, to this sink.\n *\n * @param int the integer to be written.\n *\n * @throws IllegalStateException when the sink is closed.\n *\n * @sample kotlinx.io.samples.KotlinxIoCoreCommonSamples.writeInt\n */"} {"signature":"public fun writeLong ( long : Long )","body":"public fun writeLong ( long : Long )","docstring":"/**\n * Writes eight bytes containing [long], in the big-endian order, to this sink.\n *\n * @param long the long integer to be written.\n *\n * @throws IllegalStateException when the sink is closed.\n *\n * @sample kotlinx.io.samples.KotlinxIoCoreCommonSamples.writeLong\n */"} {"signature":"override fun flush ( )","body":"override fun flush ( )","docstring":"/**\n * Writes all buffered data to the underlying sink, if one exists.\n * Then the underlying sink is explicitly flushed.\n *\n * @throws IllegalStateException when the sink is closed.\n *\n * @sample kotlinx.io.samples.KotlinxIoCoreCommonSamples.flush\n */"} {"signature":"public fun emit ( )","body":"public fun emit ( )","docstring":"/**\n * Writes all buffered data to the underlying sink if one exists.\n * The underlying sink will not be explicitly flushed.\n *\n * This method behaves like [flush], but has weaker guarantees.\n * Call this method before a buffered sink goes out of scope so that its data can reach its destination.\n *\n * @throws IllegalStateException when the sink is closed.\n *\n * @sample kotlinx.io.samples.KotlinxIoCoreCommonSamples.emit\n */"} {"signature":"@ InternalIoApi public fun hintEmit ( )","body":"@ InternalIoApi public fun hintEmit ( )","docstring":"/**\n * Hints that the buffer may be *partially* emitted (see [emit]) to the underlying sink.\n * The underlying sink will not be explicitly flushed.\n * There are no guarantees that this call will cause emit of buffered data as well as\n * there are no guarantees how many bytes will be emitted.\n *\n * Typically, application code will not need to call this: it is only necessary when\n * application code writes directly to this [buffered].\n * Use this to limit the memory held in the buffer.\n *\n * Consider using [Sink.writeToInternalBuffer] for writes into [buffered] followed by [hintEmit] call.\n *\n * @throws IllegalStateException when the sink is closed.\n */"} {"signature":"fun getNameTextRange ( ) : TextRange","body":"{ val dot = node . findChildByType ( KtTokens . DOT ) val textRange = textRange val nameStart = if ( dot != null ) dot . textRange . endOffset - textRange . startOffset else return TextRange ( nameStart , textRange . length ) }","docstring":"/**\n * Returns the range within the element containing the name (in other words,\n * the range of the element excluding the qualifier and dot, if present).\n */"} {"signature":"fun getLibraryLatestVersionInLocalRepo ( path : String ) : String","body":"{ val metadataFile = File ( props . tipOfTreeMavenRepoPath ) . resolve ( path ) . resolve ( \"\" ) check ( metadataFile . exists ( ) ) { \"\" } check ( metadataFile . isFile ) { \"\" } val xmlDoc = DocumentBuilderFactory . newInstance ( ) . newDocumentBuilder ( ) . parse ( metadataFile ) val latestVersionNode = XPathFactory . newInstance ( ) . newXPath ( ) . compile ( \"\" ) . evaluate ( xmlDoc , XPathConstants . STRING ) check ( latestVersionNode is String ) { \"\"\"\"\"\" . trimIndent ( ) } return latestVersionNode }","docstring":"/**\n * Gets the latest version of a published library.\n *\n * Note that the library must have been locally published to locate its latest version, this\n * can be done in test by adding :publish as a test dependency, for example:\n * ```\n * tasks.findByPath(\"test\")\n * .dependsOn(tasks.findByPath(\":room:room-compiler:publish\")\n * ```\n *\n * @param path - The library m2 path e.g. \"androidx/room/room-compiler\"\n */"} {"signature":"public fun < T : Base > subclass ( subclass : KClass < T > , serializer : KSerializer < T > )","body":"{ subclasses . add ( subclass to serializer ) }","docstring":"/**\n * Registers a [subclass] [serializer] in the resulting module under the [base class][Base].\n */"} {"signature":"public fun defaultDeserializer ( defaultDeserializerProvider : ( className : String ? ) -> DeserializationStrategy < Base > ? )","body":"{ require ( this . defaultDeserializerProvider == null ) { \"\" } this . defaultDeserializerProvider = defaultDeserializerProvider }","docstring":"/**\n * Adds a default serializers provider associated with the given [baseClass] to the resulting module.\n * [defaultDeserializerProvider] is invoked when no polymorphic serializers associated with the `className`\n * were found. `className` could be `null` for formats that support nullable class discriminators\n * (currently only `Json` with `JsonBuilder.useArrayPolymorphism` set to `false`)\n *\n * Default deserializers provider affects only deserialization process. To affect serialization process, use\n * [SerializersModuleBuilder.polymorphicDefaultSerializer].\n *\n * [defaultDeserializerProvider] can be stateful and lookup a serializer for the missing type dynamically.\n *\n * Typically, if the class is not registered in advance, it is not possible to know the structure of the unknown\n * type and have a precise serializer, so the default serializer has limited capabilities.\n * If you're using `Json` format, you can get a structural access to the unknown data using `JsonContentPolymorphicSerializer`.\n *\n * @see SerializersModuleBuilder.polymorphicDefaultSerializer\n */"} {"signature":"@ Deprecated ( \"\" , ReplaceWith ( \"\" ) , DeprecationLevel . WARNING ) public fun default ( defaultSerializerProvider : ( className : String ? ) -> DeserializationStrategy < Base > ? )","body":"{ defaultDeserializer ( defaultSerializerProvider ) }","docstring":"/**\n * Adds a default deserializers provider associated with the given [baseClass] to the resulting module.\n * This function affect only deserialization process. To avoid confusion, it was deprecated and replaced with [defaultDeserializer].\n * To affect serialization process, use [SerializersModuleBuilder.polymorphicDefaultSerializer].\n *\n * [defaultSerializerProvider] is invoked when no polymorphic serializers associated with the `className`\n * were found. `className` could be `null` for formats that support nullable class discriminators\n * (currently only `Json` with `JsonBuilder.useArrayPolymorphism` set to `false`)\n *\n * [defaultSerializerProvider] can be stateful and lookup a serializer for the missing type dynamically.\n *\n * Typically, if the class is not registered in advance, it is not possible to know the structure of the unknown\n * type and have a precise serializer, so the default serializer has limited capabilities.\n * If you're using `Json` format, you can get a structural access to the unknown data using `JsonContentPolymorphicSerializer`.\n *\n * @see defaultDeserializer\n * @see SerializersModuleBuilder.polymorphicDefaultSerializer\n */"} {"signature":"public inline fun < Base : Any , reified T : Base > PolymorphicModuleBuilder < Base > . subclass ( serializer : KSerializer < T > ) : Unit","body":"= subclass ( T :: class , serializer )","docstring":"/**\n * Registers a [subclass] [serializer] in the resulting module under the [base class][Base].\n */"} {"signature":"public inline fun < Base : Any , reified T : Base > PolymorphicModuleBuilder < Base > . subclass ( clazz : KClass < T > ) : Unit","body":"= subclass ( clazz , serializer ( ) )","docstring":"/**\n * Registers a serializer for class [T] in the resulting module under the [base class][Base].\n */"} {"signature":"fun invokeOnCancellation ( segment : Segment < * > , index : Int )","body":"fun invokeOnCancellation ( segment : Segment < * > , index : Int )","docstring":"/**\n * When this waiter is cancelled, [Segment.onCancellation] with\n * the specified [segment] and [index] should be called.\n * This function installs the corresponding cancellation handler.\n */"} {"signature":"fun findClasses ( request : Request ) : List < JavaClass >","body":"fun findClasses ( request : Request ) : List < JavaClass >","docstring":"/**\n * Finds all classes with the specified [ClassId]. This function should be used if the search space permits such ambiguities and if\n * [findClass] is not guaranteed to disambiguate by itself. For example, in an IDE context, a broad search scope might lead to multiple\n * valid candidates, which need to be disambiguated according to classpath order.\n *\n * [findClasses] may return a single [JavaClass], even if more could be found, if the resulting [JavaClass] is guaranteed to be the\n * first in the dependency order.\n */"} {"signature":"fun canComputeKnownClassNamesInPackage ( ) : Boolean","body":"fun canComputeKnownClassNamesInPackage ( ) : Boolean","docstring":"/**\n * Whether [knownClassNamesInPackage] can be computed. When [canComputeKnownClassNamesInPackage] is `false`, [knownClassNamesInPackage]\n * will always return `null`.\n */"} {"signature":"public open fun addOptionsTo ( sessionOptions : OrtSession . SessionOptions ) : Unit","body":"= Unit","docstring":"/**\n * Adds execution provider options to the [OrtSession.SessionOptions].\n */"} {"signature":"operator fun provideDelegate ( thisRef : Any ? , prop : KProperty < * > ) : ArgumentValueDelegate < TResult >","body":"{ check ( ! delegateProvided ) { \"\" } ( delegate as ParsingValue < * , * > ) . provideName ( prop . name ) delegateProvided = true return delegate }","docstring":"/**\n * Returns the delegate object for property delegation and initializes it with the name of the delegated property.\n *\n * This operator makes it possible to delegate a property to this instance. It returns [delegate] object\n * to be used as an actual delegate and uses the name of the delegated property to initialize the full name\n * of the option/argument if it wasn't done during construction of that option/argument.\n *\n * @throws IllegalStateException in case of trying to use same delegate several times.\n */"} {"signature":"internal fun checkDescriptor ( descriptor : ArgDescriptor < * , * > )","body":"{ if ( descriptor . number == null || descriptor . number > ) { failAssertion ( \"\" ) } }","docstring":"/**\n * Check descriptor for this kind of argument.\n */"} {"signature":"fun < T : Any , TResult , DefaultRequired : DefaultRequiredType > AbstractSingleArgument < T , TResult , DefaultRequired > . multiple ( number : Int ) : MultipleArgument < T , DefaultRequired >","body":"{ require ( number >= ) { \"\" } val newArgument = with ( ( delegate . cast < ParsingValue < T , T > > ( ) ) . descriptor as ArgDescriptor ) { MultipleArgument < T , DefaultRequired > ( ArgDescriptor ( type , fullName , number , description , listOfNotNull ( defaultValue ) , required , deprecatedWarning ) , owner ) } owner . entity = newArgument return newArgument }","docstring":"/**\n * Allows the argument to have several values specified in command line string.\n *\n * @param number the exact number of values expected for this argument, but at least 2.\n *\n * @throws IllegalArgumentException if number of values expected for this argument less than 2.\n */"} {"signature":"fun < T : Any , TResult , DefaultRequired : DefaultRequiredType > AbstractSingleArgument < T , TResult , DefaultRequired > . vararg ( ) : MultipleArgument < T , DefaultRequired >","body":"{ val newArgument = with ( ( delegate . cast < ParsingValue < T , T > > ( ) ) . descriptor as ArgDescriptor ) { MultipleArgument < T , DefaultRequired > ( ArgDescriptor ( type , fullName , null , description , listOfNotNull ( defaultValue ) , required , deprecatedWarning ) , owner ) } owner . entity = newArgument return newArgument }","docstring":"/**\n * Allows the last argument to take all the trailing values in command line string.\n */"} {"signature":"fun < T : Any > SingleNullableArgument < T > . default ( value : T ) : SingleArgument < T , DefaultRequiredType . Default >","body":"{ val newArgument = with ( ( delegate . cast < ParsingValue < T , T > > ( ) ) . descriptor as ArgDescriptor ) { SingleArgument < T , DefaultRequiredType . Default > ( ArgDescriptor ( type , fullName , number , description , value , false , deprecatedWarning ) , owner ) } owner . entity = newArgument return newArgument }","docstring":"/**\n * Specifies the default value for the argument, that will be used when no value is provided for the argument\n * in command line string.\n *\n * Argument becomes optional, because value for it is set even if it isn't provided in command line.\n *\n * @param value the default value.\n */"} {"signature":"fun < T : Any > MultipleArgument < T , DefaultRequiredType . None > . default ( value : Collection < T > ) : MultipleArgument < T , DefaultRequiredType . Default >","body":"{ require ( value . isNotEmpty ( ) ) { \"\" } val newArgument = with ( ( delegate . cast < ParsingValue < T , List < T > > > ( ) ) . descriptor as ArgDescriptor ) { MultipleArgument < T , DefaultRequiredType . Default > ( ArgDescriptor ( type , fullName , number , description , value . toList ( ) , required , deprecatedWarning ) , owner ) } owner . entity = newArgument return newArgument }","docstring":"/**\n * Specifies the default value for the argument with multiple values, that will be used when no values are provided\n * for the argument in command line string.\n *\n * Argument becomes optional, because value for it is set even if it isn't provided in command line.\n *\n * @param value the default value, must be a non-empty collection.\n */"} {"signature":"fun < T : Any > SingleArgument < T , DefaultRequiredType . Required > . optional ( ) : SingleNullableArgument < T >","body":"{ val newArgument = with ( ( delegate . cast < ParsingValue < T , T > > ( ) ) . descriptor as ArgDescriptor ) { SingleNullableArgument ( ArgDescriptor ( type , fullName , number , description , defaultValue , false , deprecatedWarning ) , owner ) } owner . entity = newArgument return newArgument }","docstring":"/**\n * Allows the argument to have no value specified in command line string.\n *\n * The value of the argument is `null` in case if no value was specified in command line string.\n *\n * Note that only trailing arguments can be optional, i.e. no required arguments can follow optional ones.\n */"} {"signature":"fun < T : Any > MultipleArgument < T , DefaultRequiredType . Required > . optional ( ) : MultipleArgument < T , DefaultRequiredType . None >","body":"{ val newArgument = with ( ( delegate . cast < ParsingValue < T , List < T > > > ( ) ) . descriptor as ArgDescriptor ) { MultipleArgument < T , DefaultRequiredType . None > ( ArgDescriptor ( type , fullName , number , description , defaultValue ? . toList ( ) ? : listOf ( ) , false , deprecatedWarning ) , owner ) } owner . entity = newArgument return newArgument }","docstring":"/**\n * Allows the argument with multiple values to have no values specified in command line string.\n *\n * The value of the argument is an empty list in case if no value was specified in command line string.\n *\n * Note that only trailing arguments can be optional: no required arguments can follow the optional ones.\n */"} {"signature":"internal actual fun safeAdd ( a : Long , b : Long ) : Long","body":"{ val sum = a + b if ( ( a xor sum ) < && ( a xor b ) >= ) { throw ArithmeticException ( \"\" ) } return sum }","docstring":"/**\n * Safely adds two long values.\n * throws [ArithmeticException] if the result overflows a long\n */"} {"signature":"internal actual fun safeAdd ( a : Int , b : Int ) : Int","body":"{ val sum = a + b if ( ( a xor sum ) < && ( a xor b ) >= ) { throw ArithmeticException ( \"\" ) } return sum }","docstring":"/**\n * Safely adds two int values.\n * throws [ArithmeticException] if the result overflows an int\n */"} {"signature":"internal actual fun safeMultiply ( a : Long , b : Long ) : Long","body":"{ if ( b == ) { return a } if ( a == ) { return b } if ( a == || b == ) { return } val total = a * b if ( total / b != a || a == Long . MIN_VALUE && b == - || b == Long . MIN_VALUE && a == - ) { throw ArithmeticException ( \"\" ) } return total }","docstring":"/**\n * Safely multiply a long by a long.\n *\n * @param a the first value\n * @param b the second value\n * @return the new total\n * @throws ArithmeticException if the result overflows a long\n */"} {"signature":"internal actual fun safeMultiply ( a : Int , b : Int ) : Int","body":"{ val total = a . toLong ( ) * b . toLong ( ) if ( total < Int . MIN_VALUE || total > Int . MAX_VALUE ) { throw ArithmeticException ( \"\" ) } return total . toInt ( ) }","docstring":"/**\n * Safely multiply an int by an int.\n *\n * @param a the first value\n * @param b the second value\n * @return the new total\n * @throws ArithmeticException if the result overflows an int\n */"} {"signature":"public suspend fun await ( ) : T","body":"public suspend fun await ( ) : T","docstring":"/**\n * Awaits for completion of this value without blocking the thread and returns the resulting value or throws\n * the exception if the deferred was cancelled.\n *\n * Unless the calling coroutine is cancelled, [await] will return the same result on each invocation:\n * if the [Deferred] completed successfully, [await] will return the same value every time;\n * if the [Deferred] completed exceptionally, [await] will rethrow the same exception.\n *\n * This suspending function is itself cancellable: if the [Job] of the current coroutine is cancelled or completed\n * while this suspending function is waiting, this function immediately resumes with [CancellationException].\n *\n * This means that [await] can throw [CancellationException] in two cases:\n * - if the coroutine in which [await] was called got cancelled,\n * - or if the [Deferred] itself got completed with a [CancellationException].\n *\n * In both cases, the [CancellationException] will cancel the coroutine calling [await], unless it's caught.\n * The following idiom may be helpful to avoid this:\n * ```\n * try {\n * deferred.await()\n * } catch (e: CancellationException) {\n * currentCoroutineContext().ensureActive() // throws if the current coroutine was cancelled\n * processException(e) // if this line executes, the exception is the result of `await` itself\n * }\n * ```\n *\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 *\n * This function can be used in [select] invocations with an [onAwait] clause.\n * Use [isCompleted] to check for completion of this deferred value without waiting, and\n * [join] to wait for completion without returning the result.\n */"} {"signature":"@ ExperimentalCoroutinesApi public fun getCompleted ( ) : T","body":"@ ExperimentalCoroutinesApi public fun getCompleted ( ) : T","docstring":"/**\n * Returns *completed* result or throws [IllegalStateException] if this deferred value has not\n * [completed][isCompleted] yet. It throws the corresponding exception if this deferred was [cancelled][isCancelled].\n *\n * This function is designed to be used from [invokeOnCompletion] handlers, when there is an absolute certainty that\n * the value is already complete. See also [getCompletionExceptionOrNull].\n *\n * **Note: This is an experimental api.** This function may be removed or renamed in the future.\n */"} {"signature":"@ ExperimentalCoroutinesApi public fun getCompletionExceptionOrNull ( ) : Throwable ?","body":"@ ExperimentalCoroutinesApi public fun getCompletionExceptionOrNull ( ) : Throwable ?","docstring":"/**\n * Returns *completion exception* result if this deferred was [cancelled][isCancelled] and has [completed][isCompleted],\n * `null` if it had completed normally, or throws [IllegalStateException] if this deferred value has not\n * [completed][isCompleted] yet.\n *\n * This function is designed to be used from [invokeOnCompletion] handlers, when there is an absolute certainty that\n * the value is already complete. See also [getCompleted].\n *\n * **Note: This is an experimental api.** This function may be removed or renamed in the future.\n */"} {"signature":"public abstract fun clipGradient ( tf : Ops , gradient : Operand < Float > ) : Operand < Float >","body":"public abstract fun clipGradient ( tf : Ops , gradient : Operand < Float > ) : Operand < Float >","docstring":"/**\n * Clips [gradient].\n *\n * @param [tf] TensorFlow graph API for building operations.\n */"} {"signature":"public abstract fun < T : Any > getRegisteredExtensions ( module : KtSourceModule , extensionType : ProjectExtensionDescriptor < T > ) : List < T >","body":"public abstract fun < T : Any > getRegisteredExtensions ( module : KtSourceModule , extensionType : ProjectExtensionDescriptor < T > ) : List < T >","docstring":"/**\n * Returns a list of extensions of a base [extensionType] which are registered for [module]\n *\n * These extensions are used in addition to those provided by the extension descriptor's [ProjectExtensionDescriptor.getInstances].\n */"} {"signature":"public abstract fun isPluginOfTypeRegistered ( module : KtSourceModule , pluginType : CompilerPluginType ) : Boolean","body":"public abstract fun isPluginOfTypeRegistered ( module : KtSourceModule , pluginType : CompilerPluginType ) : Boolean","docstring":"/**\n * Returns `true` if at least one plugin with requested `pluginType` is registered, `false` otherwise\n */"} {"signature":"inline fun < reified T > extrasKeyOf ( name : String ? = null ) : Extras . Key < T >","body":"= Extras . Key ( extrasTypeOf ( ) , name )","docstring":"/**\n * Creates a value based key for accessing any [Extras] container\n *\n * @param T The type of data that is stored in the extras container\n * ```kotlin\n * extrasKeyOf() == extrasKeyOf()\n * extrasKeyOf() != extrasKeyOf()\n * extrasKeyOf>() == extrasKeyOf>()\n * extrasKeyOf>() != extrasKeyOf>()\n * ```\n *\n * @param name This typed keys can also be distinguished with an additional name. In this case\n * ```kotlin\n * extrasKeyOf() != extrasKeyOf(\"a\")\n * extrasKeyOf(\"a\") == extrasKeyOf(\"a\")\n * extrasKeyOf(\"b\") != extrasKeyOf(\"a\")\n * extrasKeyOf(\"a\") != extrasKeyOf(\"a\")\n * ```\n */"} {"signature":"fun removeDefaultInitializers ( arguments : List < JsExpression > , parameters : List < JsParameter > , body : JsBlock )","body":"{ val toRemove = getDefaultParamsNames ( arguments , parameters , initialized = true ) val toExpand = getDefaultParamsNames ( arguments , parameters , initialized = false ) val statements = body . statements val newStatements = statements . flatMap { val name = getNameFromInitializer ( it ) if ( name != null && ! isNameInitialized ( name , it ) ) { throw AssertionError ( \"\" ) } when { name != null && name in toRemove -> listOf < JsStatement > ( ) name != null && name in toExpand -> { val thenStatement = ( it as JsIf ) . thenStatement markAssignmentAsStaticRef ( name , thenStatement ) flattenStatement ( thenStatement ) } else -> listOf ( it ) } } statements . clear ( ) statements . addAll ( newStatements ) }","docstring":"/**\n * Removes initializers for default parameters with defined arguments given\n * Expands initializers for default parameters with undefined arguments given\n */"} {"signature":"private fun isNameInitialized ( name : JsName , initializer : JsStatement ) : Boolean","body":"{ val thenStmt = ( initializer as JsIf ) . thenStatement val lastThenStmt = flattenStatement ( thenStmt ) . last ( ) val expr = ( lastThenStmt as? JsExpressionStatement ) ? . expression if ( expr !is JsBinaryOperation ) return false val op = expr . operator if ( ! op . isAssignment ) return false val arg1 = expr . arg1 if ( arg1 is HasName && arg1 . name === name ) return true return false }","docstring":"/**\n * Tests if the last statement of initializer\n * is name assignment.\n */"} {"signature":"@ SinceKotlin ( \"\" ) fun KProperty1 < * , * > . getExtensionDelegate ( ) : Any ?","body":"{ @ Suppress ( \"\" ) return ( this as KProperty1 < Any ? , * > ) . getDelegate ( KPropertyImpl . EXTENSION_PROPERTY_DELEGATE ) }","docstring":"/**\n * Returns the instance of a delegated **extension property**, or `null` if this property is not delegated.\n * Throws an exception if this is not an extension property.\n *\n * @see [KProperty1.getDelegate]\n */"} {"signature":"@ SinceKotlin ( \"\" ) fun < D > KProperty2 < D , * , * > . getExtensionDelegate ( receiver : D ) : Any ?","body":"{ @ Suppress ( \"\" ) return ( this as KProperty2 < D , Any ? , * > ) . getDelegate ( receiver , KPropertyImpl . EXTENSION_PROPERTY_DELEGATE ) }","docstring":"/**\n * Returns the instance of a delegated **member extension property**, or `null` if this property is not delegated.\n * Throws an exception if this is not an extension property.\n *\n * @param receiver the instance of the class used to retrieve the value of the property delegate.\n *\n * @see [KProperty2.getDelegate]\n */"} {"signature":"internal fun BuildResult . assertTaskSuccess ( task : String )","body":"{ assertTaskOutcome ( TaskOutcome . SUCCESS , task ) }","docstring":"/**\n * Helper `fun` for asserting a [TaskOutcome] to be equal to [TaskOutcome.SUCCESS]\n */"} {"signature":"internal fun BuildResult . assertTaskFailure ( task : String )","body":"{ assertTaskOutcome ( TaskOutcome . FAILED , task ) }","docstring":"/**\n * Helper `fun` for asserting a [TaskOutcome] to be equal to [TaskOutcome.FAILED]\n */"} {"signature":"internal fun BuildResult . assertTaskSkipped ( task : String )","body":"{ assertTaskOutcome ( TaskOutcome . SKIPPED , task ) }","docstring":"/**\n * Helper `fun` for asserting a [TaskOutcome] to be equal to [TaskOutcome.SKIPPED]\n */"} {"signature":"internal fun BuildResult . assertTaskUpToDate ( task : String )","body":"{ assertTaskOutcome ( TaskOutcome . UP_TO_DATE , task ) }","docstring":"/**\n * Helper `fun` for asserting a [TaskOutcome] to be equal to [TaskOutcome.UP_TO_DATE]\n */"} {"signature":"internal fun BuildResult . assertTaskNotRun ( taskName : String )","body":"{ assertNull ( task ( taskName ) , \"\" ) }","docstring":"/**\n * Helper `fun` for asserting that a task was not run, which also happens if one of its dependencies failed before it\n * could be run.\n */"} {"signature":"protected fun < CANDIDATE > selectFirstElementInClasspathOrder ( candidates : Collection < CANDIDATE > , getElement : ( CANDIDATE ) -> PsiElement ? , ) : Pair < CANDIDATE , PROVIDER > ?","body":"{ if ( candidates . isEmpty ( ) ) return null var currentCandidate : CANDIDATE ? = null var currentPrecedence : Int = Int . MAX_VALUE var currentKtModule : KtModule ? = null for ( candidate in candidates ) { val element = getElement ( candidate ) ? : continue val ktModule = getModule ( element ) val precedence = modulePrecedenceMap [ ktModule ] ? : continue if ( precedence < currentPrecedence ) { currentCandidate = candidate currentPrecedence = precedence currentKtModule = ktModule } } val candidate = currentCandidate ? : return null val ktModule = currentKtModule ? : error ( \"\" ) val provider = providersByKtModule . getValue ( ktModule ) return Pair ( candidate , provider ) }","docstring":"/**\n * Selects the element with the highest module precedence in [candidates], returning the element and the provider to which resolution\n * should be delegated. This is a post-processing step that preserves classpath order when, for example, an index access with a combined\n * scope isn't guaranteed to return the first element in classpath order.\n */"} {"signature":"override fun visitCall ( expression : IrCall ) : IrExpression","body":"{ recordCompanionObjectAsDispatchReceiver ( expression ) expression . transformChildrenVoid ( this ) val superQualifier : IrClassSymbol ? = expression . superQualifierSymbol val callee = expression . symbol if ( callee . isAccessible ( withSuper = superQualifier != null ) ) { return expression } val isAccessToProperty = expression . symbol . owner . correspondingPropertySymbol != null return if ( isAccessToProperty && expression . origin == IrStatementOrigin . GET_PROPERTY ) { generateReflectiveAccessForGetter ( expression ) } else if ( isAccessToProperty && expression . origin ? . isAssignmentOperator ( ) == true ) { generateReflectiveAccessForSetter ( expression ) } else if ( expression . dispatchReceiver == null && expression . extensionReceiver == null ) { generateReflectiveStaticCall ( expression ) } else if ( superQualifier != null ) { generateInvokeSpecialForCall ( expression , superQualifier ) } else { generateReflectiveMethodInvocation ( expression ) } }","docstring":"/**\n * Fragment traversal\n */"} {"signature":"private fun generateReflectiveMethodInvocation ( declaringClass : IrType , methodName : String , parameterTypes : List < IrType > , receiver : IrExpression ? , arguments : List < IrExpression > , returnType : IrType , symbol : IrSymbol ) : IrExpression","body":"= context . createJvmIrBuilder ( symbol ) . irBlock ( resultType = returnType ) { val methodVar = createTmpVariable ( getDeclaredMethod ( javaClassObject ( declaringClass ) , methodName , parameterTypes ) , nameHint = \"\" , irType = reflectSymbols . javaLangReflectMethod . defaultType ) + methodSetAccessible ( irGet ( methodVar ) ) + methodInvoke ( irGet ( methodVar ) , receiver ? : irNull ( ) , arguments ) }","docstring":"/**\n * Specific reflective \"patches\"\n */"} {"signature":"@ Suppress ( \"\" ) private inline fun tryForbidNewElements ( ) : Int","body":"{ controlState . loop { if ( it . isClosed ( ) ) return if ( controlState . compareAndSet ( it , it or IS_CLOSED_MASK ) ) return it } }","docstring":"/**\n * Returns the number of elements that need to be cleaned up due to the pool being closed.\n */"} {"signature":"fun allocate ( ) : Boolean","body":"{ controlState . loop { ctl -> if ( ctl . isClosed ( ) ) return false if ( ctl >= maxCapacity ) return true if ( controlState . compareAndSet ( ctl , ctl + ) ) { elements [ ctl ] . value = create ( ctl ) return true } } }","docstring":"/**\n * Request that a new element is created.\n *\n * Returns `false` if the pool is closed.\n *\n * Note that it will still return `true` even if an element was not created due to reaching [maxCapacity].\n *\n * Rethrows the exceptions thrown from [create]. In this case, this operation has no effect.\n */"} {"signature":"fun close ( ) : List < T >","body":"{ val elementsExisting = tryForbidNewElements ( ) return ( until elementsExisting ) . map { i -> loop { val element = elements [ i ] . getAndSet ( null ) if ( element != null ) { return@map element } } } }","docstring":"/**\n * Close the pool.\n *\n * This will prevent any new elements from being created.\n * All the elements present in the pool will be returned.\n *\n * The function is thread-safe.\n *\n * [close] can be called multiple times, but only a single call will return a non-empty list.\n * This is due to the elements being cleaned out from the pool on the first invocation to avoid memory leaks,\n * and no new elements being created after.\n */"} {"signature":"fun configureAllExecutions ( configure : AggregatedExecutionType . ( ) -> Unit ) : Unit","body":"fun configureAllExecutions ( configure : AggregatedExecutionType . ( ) -> Unit ) : Unit","docstring":"/**\n * Configures all of the executions aggregated by this execution. If some of the executions are not yet created up to this point,\n * [configure] will be called on them later, once they are created.\n */"} {"signature":"fun getConfiguredExecutions ( ) : Iterable < AggregatedExecutionType >","body":"fun getConfiguredExecutions ( ) : Iterable < AggregatedExecutionType >","docstring":"/**\n * Returns the aggregated executions that are already configured up to this moment.\n * Some test runs may be missing from the results if they are not yet configured.\n */"} {"signature":"@ Test fun testCollect ( )","body":"= runTest { val x = val xSum = x * ( x + ) / val publisher = Publisher < Int > { subscriber -> var requested = var lastOutput = subscriber . onSubscribe ( object : Subscription { override fun request ( n : Long ) { requested += n if ( n <= ) { subscriber . onError ( IllegalArgumentException ( ) ) return } while ( lastOutput < x && lastOutput < requested ) { lastOutput += subscriber . onNext ( lastOutput ) } if ( lastOutput == x ) subscriber . onComplete ( ) } override fun cancel ( ) { } } ) } var sum = publisher . collect { sum += it } assertEquals ( xSum , sum ) }","docstring":"/** Tests the simple scenario where the publisher outputs a bounded stream of values to collect. */"} {"signature":"@ Test fun testCollectThrowingPublisher ( )","body":"= runTest { val errorString = \"\" val x = val xSum = x * ( x + ) / val publisher = Publisher < Int > { subscriber -> var requested = var lastOutput = subscriber . onSubscribe ( object : Subscription { override fun request ( n : Long ) { requested += n if ( n <= ) { subscriber . onError ( IllegalArgumentException ( ) ) return } while ( lastOutput < x && lastOutput < requested ) { lastOutput += subscriber . onNext ( lastOutput ) } if ( lastOutput == x ) subscriber . onError ( IllegalArgumentException ( errorString ) ) } override fun cancel ( ) { } } ) } var sum = try { publisher . collect { sum += it } } catch ( e : IllegalArgumentException ) { assertEquals ( errorString , e . message ) } assertEquals ( xSum , sum ) }","docstring":"/** Tests the behavior of [collect] when the publisher raises an error. */"} {"signature":"@ Test fun testCollectThrowingAction ( )","body":"= runTest { val errorString = \"\" val x = val xSum = x * ( x + ) / val publisher = Publisher < Int > { subscriber -> var requested = var lastOutput = subscriber . onSubscribe ( object : Subscription { override fun request ( n : Long ) { requested += n if ( n <= ) { subscriber . onError ( IllegalArgumentException ( ) ) return } while ( lastOutput < x && lastOutput < requested ) { lastOutput += subscriber . onNext ( lastOutput ) } } override fun cancel ( ) { assertEquals ( x , lastOutput ) expect ( x + ) } } ) } var sum = try { expect ( ) var i = publisher . collect { sum += it i += expect ( i ) if ( sum >= xSum ) { throw IllegalArgumentException ( errorString ) } } } catch ( e : IllegalArgumentException ) { expect ( x + ) assertEquals ( errorString , e . message ) } finish ( x + ) }","docstring":"/** Tests the behavior of [collect] when the action throws. */"} {"signature":"public fun < R > InferenceModel < R > . predictLabel ( inputData : FloatData ) : Int","body":"{ return predictProbabilities ( inputData ) . argmax ( ) }","docstring":"/**\n * Predicts the class of [inputData].\n *\n * @param [inputData] The single example with unknown label.\n * @return Predicted class index.\n */"} {"signature":"public fun < R > InferenceModel < R > . predictProbabilities ( inputData : FloatData ) : FloatArray","body":"{ return predict ( inputData ) { result -> resultConverter . getFloatArray ( result , ) } }","docstring":"/**\n * Predicts vector of probabilities instead of specific class in [predictLabel] method.\n *\n * @param [inputData] The single example with unknown vector of probabilities.\n * @return Vector that represents the probability distributions of possible outcomes.\n */"} {"signature":"public fun InferenceModel < * > . predictTopNLabels ( floatData : FloatData , labels : Map < Int , String > , n : Int = ) : List < Pair < String , Float > >","body":"{ val prediction = predictProbabilities ( floatData ) val topNIndexes = prediction . indexOfMaxN ( n ) return topNIndexes . map { index -> labels [ index ] ! ! to prediction [ index ] } }","docstring":"/** Returns top-N labels for the given [floatData] encoded with mapping [labels]. */"} {"signature":"public fun InferenceModel < * > . predictTop5Labels ( data : FloatData , classLabels : Map < Int , String > , ) : List < Pair < String , Float > >","body":"{ return predictTopNLabels ( data , classLabels , n = ) }","docstring":"/** Returns top-5 labels for the given [data] encoded with mapping [classLabels]. */"} {"signature":"operator fun invoke ( refName : String ) : MarkerResult","body":"operator fun invoke ( refName : String ) : MarkerResult","docstring":"/** Produces a [MarkerResult] (either [MarkerResult.CannotFindRefMarker] or [MarkerResult.OpenApiMarker]) for the\n * given [refName] representing a query to find a marker with that given name. */"} {"signature":"operator fun invoke ( validName : ValidFieldName , marker : OpenApiMarker , isTopLevelObject : Boolean , ) : String","body":"operator fun invoke ( validName : ValidFieldName , marker : OpenApiMarker , isTopLevelObject : Boolean , ) : String","docstring":"/**\n * Produces an additional Marker with the given [validName].\n *\n * @param isTopLevelObject only used in `allOf` cases. If true, the additionally produced marker is a top-level object\n * that is to be merged with another object.\n * @param marker the marker to produce.\n * @param validName the name of the marker.\n * @return the name of the produced marker. This name is guaranteed to be unique and might not be the same as the\n * provided [validName].\n */"} {"signature":"operator fun invoke ( getRefMarker : GetRefMarker , produceAdditionalMarker : ProduceAdditionalMarker , ) : MarkerResult","body":"operator fun invoke ( getRefMarker : GetRefMarker , produceAdditionalMarker : ProduceAdditionalMarker , ) : MarkerResult","docstring":"/**\n * Represents a call to [toMarker] that can be repeated until it returns a [MarkerResult.OpenApiMarker].\n *\n * @param getRefMarker A function that returns a [Marker] for a given reference name if successful.\n * @param produceAdditionalMarker A function that produces an additional [Marker] for a given name.\n * This is used for `object` types not present in the root of `components/schemas`.\n *\n * @return A [MarkerResult.OpenApiMarker] if successful, otherwise [MarkerResult.CannotFindRefMarker].\n */"} {"signature":"fun Project . intellijRuntimeAnnotations ( )","body":"= \"\"","docstring":"/**\n * Runtime version of annotations that are already in Kotlin stdlib (historically Kotlin has older version of this one).\n *\n * SHOULD NOT BE USED IN COMPILE CLASSPATH!\n *\n * `@NonNull`, `@Nullabe` from `idea/annotations.jar` has `TYPE` target which leads to different types treatment in Kotlin compiler.\n * On the other hand, `idea/annotations.jar` contains org/jetbrains/annotations/Async annations which is required for IDEA debugger.\n *\n * So, we are excluding `annotaions.jar` from all other `kotlin.build` and using this one for runtime only\n * to avoid accidentally including `annotations.jar` by calling `intellijDep()`.\n */"} {"signature":"internal fun IrClass . requiresRtti ( ) : Boolean","body":"= when { this . isExternalObjCClass ( ) -> false else -> true }","docstring":"/**\n * We don't need to generate RTTI in some cases, e.g. Objective-C external classes.\n */"} {"signature":"@ Test fun `test - custom compilation` ( )","body":"= buildProjectWithMPP ( ) . runLifecycleAwareTest { multiplatformExtension . jvm ( ) . apply { withJava ( ) var instanceUsedForConfigureBlock : KotlinJvmCompilation ? = null val instanceReturnedFromCreate = compilations . create ( \"\" ) { instance -> assertNull ( instanceUsedForConfigureBlock ) instanceUsedForConfigureBlock = instance } val instanceReturnedFromGet = compilations . getByName ( \"\" ) assertSame ( instanceReturnedFromCreate , instanceUsedForConfigureBlock ) assertSame ( instanceReturnedFromGet , instanceUsedForConfigureBlock ) } }","docstring":"/**\n * Regression was introduced by:\n *\n * ```\n * [Gradle] Ensure java source sets being created eagerly for 'withJava' Sebastian Sellmair* 07.07.23, 20:49\n * 817e3de8f546e34974b89fef0f4f93b425e7e607\n * ```\n *\n * The commit was ensuring that jvm compilations will create their associated java source sets\n * as eager as possible. The solution chosen in the commit was that already the construction of the compilation\n * will spawn a coroutine that waits for the `withJavaEnabled` callback to create the java source set.\n *\n * However, a buildscript like\n *\n * ```kotlin\n * kotlin {\n * jvm().withJava()\n * val customCompilation = jvm().compilations.create(\"custom\")\n * // ^\n * // Zombie\n * }\n * ```\n *\n * would therefore try to create the java source set right in the constructor call of the 'custom' compilation.\n * This would have triggered a listener on `javaSourceSets.all {}` which would ensure that all\n * java source sets have a corresponding kotlin compilation created.\n *\n * Since the current stack is currently inside the constructor of the first compilation, the\n * used `compilations.maybeCreate` would trigger the creation of another custom compilation.\n *\n * The initial buildscript call creating the initial custom compilation will therefore return a Zombie instance\n * ```kotlin\n * kotlin {\n * val customCompilation = jvm().compilations.create(\"custom\")\n * customCompilation != jvm().compilations.getByName(\"custom\")\n * // ^ ^\n * // Zombie Real instance created by the javaSourceSets.all listener\n * }\n * ```\n */"} {"signature":"private fun < T : FunctionDescriptor > addNonExistent ( result : MutableCollection < T > , toAdd : List < T > )","body":"{ toAdd . forEach { f -> if ( result . none { sameSignature ( it , f ) } ) { result += f } } }","docstring":"/**\n * Deduplicates generated functions using name and argument counts, as lombok does\n */"} {"signature":"private fun sameSignature ( a : FunctionDescriptor , b : FunctionDescriptor ) : Boolean","body":"{ val aVararg = a . valueParameters . any { it . varargElementType != null } val bVararg = b . valueParameters . any { it . varargElementType != null } return aVararg && bVararg || aVararg && b . valueParameters . size >= ( a . valueParameters . size - ) || bVararg && a . valueParameters . size >= ( b . valueParameters . size - ) || a . valueParameters . size == b . valueParameters . size }","docstring":"/**\n * Lombok treat functions as having the same signature by arguments count only\n * Corresponding code in lombok - https://github.com/projectlombok/lombok/blob/v1.18.20/src/core/lombok/javac/handlers/JavacHandlerUtil.java#L752\n */"} {"signature":"internal fun soundBlock ( filters : Int , kernelSize : Int , poolStride : Int ) : Array < Layer >","body":"= arrayOf ( Conv1D ( filters = filters , kernelLength = kernelSize , strides = intArrayOf ( , , ) , activation = Activations . Relu , kernelInitializer = HeNormal ( SEED ) , biasInitializer = HeNormal ( SEED ) , padding = ConvPadding . SAME ) , Conv1D ( filters = filters , kernelLength = kernelSize , strides = intArrayOf ( , , ) , activation = Activations . Relu , kernelInitializer = HeNormal ( SEED ) , biasInitializer = HeNormal ( SEED ) , padding = ConvPadding . SAME ) , MaxPool1D ( poolSize = intArrayOf ( , poolStride , ) , strides = intArrayOf ( , poolStride , ) , padding = ConvPadding . SAME ) )","docstring":"/**\n * Create a single building block for the SoundNet to simplify its structure.\n * Single block consists of two identical [Conv1D] layers followed by [MaxPool1D].\n *\n * @param filters number of filters in conv layers\n * @param kernelSize in conv layers\n * @param poolStride stride for poolSize and stride in maxpooling layer\n * @return array of layers to be registered in [Sequential] as vararg\n */"} {"signature":"fun soundNet ( )","body":"{ val ( train , test ) = freeSpokenDigits ( ) train . shuffle ( ) soundNet . use { it . compile ( optimizer = Adam ( ) , loss = Losses . SOFT_MAX_CROSS_ENTROPY_WITH_LOGITS , metric = Metrics . ACCURACY ) it . init ( ) var accuracy = it . evaluate ( dataset = test , batchSize = TEST_BATCH_SIZE ) . metrics [ Metrics . ACCURACY ] println ( \"\" ) it . fit ( dataset = train , epochs = EPOCHS , batchSize = TRAINING_BATCH_SIZE ) accuracy = it . evaluate ( dataset = test , batchSize = TEST_BATCH_SIZE ) . metrics [ Metrics . ACCURACY ] println ( \"\" ) } }","docstring":"/**\n * This example shows how to do audio classification from scratch using only Conv1D layers (without Conv2D)\n * and dense layers on the example of some toy network.\n * We demonstrate the workflow on the Free Spoken Digits Dataset.\n *\n * It includes:\n * - dataset loading from S3\n * - model compilation\n * - model training\n * - model evaluation\n */"} {"signature":"abstract fun visitInlineLambda ( argument : IrFunctionReference , callee : IrFunction , parameter : IrValueParameter , scope : IrDeclaration )","body":"abstract fun visitInlineLambda ( argument : IrFunctionReference , callee : IrFunction , parameter : IrValueParameter , scope : IrDeclaration )","docstring":"/**\n * Called by this visitor whenever a lambda is passed to an inline function.\n *\n * @param argument The lambda expression passed as an argument to [callee].\n * @param callee The inline function.\n * @param parameter The parameter of [callee] to which the lambda is passed.\n * @param scope The declaration in scope of which [callee] is being called.\n */"} {"signature":"fun findContainer ( scope : IrElement ) : IrDeclarationContainer ?","body":"= findContainer ( scope , approximateToPackage = false )","docstring":"/**\n * The class from which all accesses in [scope] will be done after bytecode generation.\n * If [scope] is a crossinline lambda, this is not possible, as the lambda may be inlined\n * into some other class; in that case, return at least the package fragment.\n *\n * @param scope [IrDeclaration] or [IrDeclarationParent].\n * @return [IrClass] or at least [IrPackageFragment] from which all accesses in the current scope will be done after bytecode\n * generation, or `null` if the space of potential call sites is unconstrained, e.g. if [scope] is referenced from an internal inline\n * function.\n */"} {"signature":"private tailrec fun findContainer ( scope : IrElement ? , approximateToPackage : Boolean ) : IrDeclarationContainer ?","body":"{ val callSite = inlineCallSites [ scope ] return when { callSite != null -> findContainer ( callSite . scope , approximateToPackage || callSite . approximateToPackage ) scope is IrFunction && scope . isInline -> { val callSites = privateInlineFunctionCallSites [ scope ] ? : return null inlineCallSites [ scope ] = CallSite ( scope = null , approximateToPackage = false ) val commonCallSite = when { callSites . isEmpty ( ) -> CallSite ( scope . parent , approximateToPackage = false ) callSites . size == -> CallSite ( callSites . single ( ) , approximateToPackage = false ) else -> { @ Suppress ( \"\" ) val results = callSites . map { findContainer ( it , approximateToPackage = false ) ? : return null } val single = results . first ( ) . takeIf { results . all { other -> it === other } } CallSite ( single ? : scope . parent , approximateToPackage = single == null ) } } inlineCallSites [ scope ] = commonCallSite findContainer ( commonCallSite . scope , approximateToPackage || commonCallSite . approximateToPackage ) } scope is IrClass && ! approximateToPackage -> scope scope is IrDeclaration -> findContainer ( scope . parent , approximateToPackage ) else -> scope as? IrPackageFragment } }","docstring":"/**\n * The class from which all accesses in [scope] will be done after bytecode generation.\n * If [scope] is a crossinline lambda, this is not possible, as the lambda may be inlined\n * into some other class; in that case, return at least the package fragment.\n *\n * @param scope [IrDeclaration] or [IrDeclarationParent]\n * @param approximateToPackage Whether the inline function being called can be inlined into some other class in the same package,\n * for example, if it's a crossinline lambda.\n * @return [IrClass] or at least [IrPackageFragment] from which all accesses in the current scope will be done after bytecode\n * generation, or `null` if the space of potential call sites is unconstrained, e.g. if [scope] is referenced from an internal inline\n * function.\n */"} {"signature":"inline fun IrFile . findInlineLambdas ( context : JvmBackendContext , crossinline onLambda : ( IrFunctionReference , IrFunction , IrValueParameter , IrDeclaration ) -> Unit , )","body":"= accept ( object : IrInlineReferenceLocator ( context ) { override fun visitInlineLambda ( argument : IrFunctionReference , callee : IrFunction , parameter : IrValueParameter , scope : IrDeclaration , ) = onLambda ( argument , callee , parameter , scope ) } , null , )","docstring":"/**\n * Calls [onLambda] for each place in the IR subtree where a lambda is passed to an inline function.\n *\n * @param context The backend context\n * @param onLambda The closure to execute for each such lambda. Accepts the lambda expression, the inline function being called,\n * the parameter of that inline function to which the lambda is passed, and the scope in which the inline function is called.\n */"} {"signature":"fun IrFile . findInlineCallSites ( context : JvmBackendContext )","body":"= IrInlineScopeResolver ( context ) . apply { accept ( this , null ) }","docstring":"/**\n * Runs [IrInlineScopeResolver] on this [IrFile] and returns the scope resolver instance.\n */"} {"signature":"private fun compareStringsAsVersions ( version1 : String , version2 : String ) : Int","body":"{ val splitVersion1 = version1 . split ( '' ) . map { it . toInt ( ) } val splitVersion2 = version2 . split ( '' ) . map { it . toInt ( ) } val minimalLength = min ( splitVersion1 . size , splitVersion2 . size ) for ( index in until minimalLength ) { if ( splitVersion1 [ index ] < splitVersion2 [ index ] ) return - if ( splitVersion1 [ index ] > splitVersion2 [ index ] ) return } return splitVersion1 . size . compareTo ( splitVersion2 . size ) }","docstring":"/**\n * Compares two strings assuming that both are representing numeric version strings.\n * Examples of numeric version strings: \"12.4.1.2\", \"9\", \"0.5\".\n */"} {"signature":"private fun Xcode . getSimulatorRuntimeDescriptors ( ) : List < SimulatorRuntimeDescriptor >","body":"= gson . fromJson ( simulatorRuntimes , ListRuntimesReport :: class . java ) . runtimes","docstring":"/**\n * Returns parsed output of `xcrun simctl list runtimes -j`.\n */"} {"signature":"fun Xcode . getLatestSimulatorRuntimeFor ( family : Family , osMinVersion : String ) : SimulatorRuntimeDescriptor ?","body":"= getLatestSimulatorRuntimeFor ( getSimulatorRuntimeDescriptors ( ) , family , osMinVersion )","docstring":"/**\n * Returns first available simulator runtime for [target] with at least [osMinVersion] OS version.\n * */"} {"signature":"fun checkAvailability ( ) : Boolean","body":"{ if ( isAvailable == true ) return true if ( availability ? . contains ( \"\" ) == true ) return false return false }","docstring":"/**\n * Different Xcode/macOS combinations give different fields that checks\n * runtime availability. This method is an umbrella for these fields.\n */"} {"signature":"fun getSimulatorDevices ( json : String ) : Map < String , List < SimulatorDeviceDescriptor > >","body":"= gson . fromJson ( json , ListDevicesReport :: class . java ) . devices","docstring":"/**\n * Returns map of simulator devices from the json input\n */"} {"signature":"internal inline fun < T > atomicfu_getValue ( `atomicfu$getter` : ( ) -> T , `atomicfu$setter` : ( T ) -> Unit ) : T","body":"{ return `atomicfu$getter` ( ) }","docstring":"/**\n * Inline functions that are substituted instead of the corresponding atomic functions defined in `kotlinx.atomicfu`\n * during Js/Ir transformation.\n *\n * Example of transformation:\n * ```\n * val a = atomic(0)\n * a.compareAndSet(expect, update)\n * ```\n * is transformed to:\n * ```\n * var a = 0\n * atomicfu_compareAndSet(expect, update, { return a }, { v: Int -> a.value = v })\n * ```\n */"} {"signature":"fun setExecutionSourceFrom ( compilation : T )","body":"fun setExecutionSourceFrom ( compilation : T )","docstring":"/**\n * Select a compilation to run the execution from.\n *\n * The [compilation]'s [KotlinCompilationToRunnableFiles.runtimeDependencyFiles]\n * will be treated as runtime dependencies, and its [output] as runnable files.\n *\n * This overrides other [KotlinExecution.executionSource] selection options.\n */"} {"signature":"private fun Map < ResolvedDependencyId , ResolvedDependency > . findMatchingModule ( moduleId : ResolvedDependencyId ) : ResolvedDependency","body":"{ this [ moduleId ] ? . let { module -> return module } return values . first { moduleId in it . id } }","docstring":"/**\n * Do the best effort to find a module that matches the given [moduleId]:\n * - If there is a node in the map with such [ResolvedDependencyId] as [moduleId], then return the value from this node.\n * - If not, then try to find a [ResolvedDependency] which contains all unique names from the given [moduleId]. This makes sense\n * for such cases when the map contains a node for \"org.jetbrains.kotlinx:kotlinx-coroutines-core (org.jetbrains.kotlinx:kotlinx-coroutines-core-macosx64)\"\n * but we are looking just for \"org.jetbrains.kotlinx:kotlinx-coroutines-core\".\n */"} {"signature":"private fun findPotentiallyConflictingOutgoingDependencies ( problemModuleId : ResolvedDependencyId , allModules : Map < ResolvedDependencyId , ResolvedDependency > ) : Map < ResolvedDependencyId , PotentialConflictDescription >","body":"{ data class OutgoingDependency ( val id : ResolvedDependencyId , val requestedVersion : ResolvedDependencyVersion , val selectedVersion : ResolvedDependencyVersion ) val outgoingDependenciesIndex : MutableMap < ResolvedDependencyId , MutableList < OutgoingDependency > > = hashMapOf ( ) allModules . values . forEach { module -> module . requestedVersionsByIncomingDependencies . forEach { ( incomingDependencyId , requestedVersion ) -> outgoingDependenciesIndex . getOrPut ( incomingDependencyId ) { mutableListOf ( ) } += OutgoingDependency ( id = module . id , requestedVersion = requestedVersion , selectedVersion = module . selectedVersion ) } } val dependencyStatesMap : MutableMap < ResolvedDependencyId , MutableSet < DependencyState > > = mutableMapOf ( ) fun recurse ( moduleId : ResolvedDependencyId , underConflictingDependency : Boolean ) { val outgoingDependencies : List < OutgoingDependency > = outgoingDependenciesIndex [ moduleId ] . orEmpty ( ) outgoingDependencies . forEach { outgoingDependency -> val dependencyState : DependencyState = when { underConflictingDependency -> { DependencyState ( conflictReason = PotentialConflictReason ( kind = BEHIND_CONFLICTING_DEPENDENCY , conflictingModuleId = outgoingDependency . id ) ) } outgoingDependency . selectedVersion . isEmpty ( ) -> { DependencyState ( conflictReason = PotentialConflictReason ( kind = UNKNOWN_SELECTED_VERSION , conflictingModuleId = outgoingDependency . id , requestedVersion = outgoingDependency . requestedVersion ) ) } outgoingDependency . requestedVersion != outgoingDependency . selectedVersion -> { DependencyState ( conflictReason = PotentialConflictReason ( kind = REQUESTED_SELECTED_VERSIONS_MISMATCH , conflictingModuleId = outgoingDependency . id , requestedVersion = outgoingDependency . requestedVersion , selectedVersion = outgoingDependency . selectedVersion ) ) } else -> DependencyState . SUCCESS } val dependencyStates : MutableSet < DependencyState > = dependencyStatesMap . getOrPut ( outgoingDependency . id ) { mutableSetOf ( ) } val notBeenHereYet = dependencyStates . add ( dependencyState ) if ( notBeenHereYet ) { recurse ( moduleId = outgoingDependency . id , underConflictingDependency = dependencyState . conflictReason != null ) } } } recurse ( moduleId = problemModuleId , underConflictingDependency = false ) return dependencyStatesMap . describeDependencyStates { potentialConflictReason -> when ( potentialConflictReason . kind ) { UNKNOWN_SELECTED_VERSION -> { \"\" } REQUESTED_SELECTED_VERSIONS_MISMATCH -> { val requested = potentialConflictReason . conflictingModuleId . withVersion ( potentialConflictReason . requestedVersion ) \"\" } BEHIND_CONFLICTING_DEPENDENCY -> { \"\" } } } }","docstring":"/**\n * Find all outgoing dependencies of [problemModuleId] that might conflict with [problemModuleId] because they have\n * different (overridden) selected version then the version that [problemModuleId] was initially compiled with.\n */"} {"signature":"private fun findPotentiallyConflictingIncomingDependencies ( problemModuleId : ResolvedDependencyId , allModules : Map < ResolvedDependencyId , ResolvedDependency > , sourceCodeModuleId : ResolvedDependencyId ) : Map < ResolvedDependencyId , PotentialConflictDescription >","body":"{ val dependencyStatesMap : MutableMap < ResolvedDependencyId , MutableSet < DependencyState > > = mutableMapOf ( ) fun recurse ( moduleId : ResolvedDependencyId , aboveConflictingDependency : Boolean ) { val module = allModules . findMatchingModule ( moduleId ) module . requestedVersionsByIncomingDependencies . forEach { ( incomingDependencyId , requestedVersion ) -> if ( incomingDependencyId == sourceCodeModuleId ) return@forEach val dependencyState : DependencyState = when { aboveConflictingDependency -> { DependencyState ( conflictReason = PotentialConflictReason ( kind = BEHIND_CONFLICTING_DEPENDENCY , conflictingModuleId = module . id ) ) } module . selectedVersion . isEmpty ( ) -> { DependencyState ( conflictReason = PotentialConflictReason ( kind = UNKNOWN_SELECTED_VERSION , conflictingModuleId = module . id , requestedVersion = requestedVersion ) ) } requestedVersion != module . selectedVersion -> { DependencyState ( conflictReason = PotentialConflictReason ( kind = REQUESTED_SELECTED_VERSIONS_MISMATCH , conflictingModuleId = module . id , requestedVersion = requestedVersion , selectedVersion = module . selectedVersion ) ) } else -> DependencyState . SUCCESS } val dependencyStates : MutableSet < DependencyState > = dependencyStatesMap . getOrPut ( incomingDependencyId ) { mutableSetOf ( ) } val notBeenHereYet = dependencyStates . add ( dependencyState ) if ( notBeenHereYet ) { recurse ( moduleId = incomingDependencyId , aboveConflictingDependency = dependencyState . isConflicting ) } } } recurse ( moduleId = problemModuleId , aboveConflictingDependency = false ) return dependencyStatesMap . describeDependencyStates { potentialConflictReason -> when ( potentialConflictReason . kind ) { UNKNOWN_SELECTED_VERSION -> { \"\" } REQUESTED_SELECTED_VERSIONS_MISMATCH -> { val requested = potentialConflictReason . conflictingModuleId . withVersion ( potentialConflictReason . requestedVersion ) val selected = potentialConflictReason . conflictingModuleId . withVersion ( potentialConflictReason . selectedVersion ) \"\" } BEHIND_CONFLICTING_DEPENDENCY -> { \"\" } } } }","docstring":"/**\n * Find all incoming dependencies of [problemModuleId] that might conflict with [problemModuleId] because they were\n * initially compiled with the different version of [problemModuleId] than the one used in the project.\n */"} {"signature":"public fun ColumnSet < * > . frameCols ( filter : Predicate < FrameColumn < * > > = { true } ) : TransformableColumnSet < DataFrame < * > >","body":"= frameColumnsInternal ( filter )","docstring":"/**\n * @include [CommonFrameColsDocs]\n * @set [CommonFrameColsDocs.ExampleArg]\n *\n * `df.`[select][DataFrame.select]` { `[cols][ColumnsSelectionDsl.cols]` { it.`[name][ColumnReference.name]`.`[startsWith][String.startsWith]`(\"my\") }.`[frameCols][ColumnSet.frameCols]`() }`\n *\n * `// NOTE: This can be shortened to just:`\n *\n * `df.`[select][DataFrame.select]` { `[frameCols][ColumnsSelectionDsl.frameCols]` { it.`[name][ColumnReference.name]`.`[startsWith][String.startsWith]`(\"my\") } }`\n */"} {"signature":"public fun ColumnsSelectionDsl < * > . frameCols ( filter : Predicate < FrameColumn < * > > = { true } ) : TransformableColumnSet < DataFrame < * > >","body":"= asSingleColumn ( ) . frameColumnsInternal ( filter )","docstring":"/**\n * @include [CommonFrameColsDocs]\n * @set [CommonFrameColsDocs.ExampleArg]\n *\n * `df.`[select][DataFrame.select]` { `[frameCols][ColumnsSelectionDsl.frameCols]`() }`\n *\n * `df.`[select][DataFrame.select]` { `[frameCols][ColumnsSelectionDsl.frameCols]` { it.`[name][ColumnReference.name]`.`[startsWith][String.startsWith]`(\"my\") } }`\n */"} {"signature":"public fun SingleColumn < DataRow < * > > . frameCols ( filter : Predicate < FrameColumn < * > > = { true } ) : TransformableColumnSet < DataFrame < * > >","body":"= this . ensureIsColumnGroup ( ) . frameColumnsInternal ( filter )","docstring":"/**\n * @include [CommonFrameColsDocs]\n * @set [CommonFrameColsDocs.ExampleArg]\n *\n * `df.`[select][DataFrame.select]` { myColGroup.`[frameCols][SingleColumn.frameCols]`() }`\n *\n * `df.`[select][DataFrame.select]` { myColGroup.`[frameCols][SingleColumn.frameCols]` { it.`[name][ColumnReference.name]`.`[startsWith][String.startsWith]`(\"my\") } }`\n */"} {"signature":"public fun String . frameCols ( filter : Predicate < FrameColumn < * > > = { true } ) : TransformableColumnSet < DataFrame < * > >","body":"= columnGroup ( this ) . frameCols ( filter )","docstring":"/**\n * @include [CommonFrameColsDocs]\n * @set [CommonFrameColsDocs.ExampleArg]\n *\n * `df.`[select][DataFrame.select]` { \"myColGroup\".`[frameCols][String.frameCols]` { it.`[name][ColumnReference.name]`.`[startsWith][String.startsWith]`(\"my\") } }`\n *\n * `df.`[select][DataFrame.select]` { \"myColGroup\".`[frameCols][String.frameCols]`() }`\n */"} {"signature":"public fun KProperty < * > . frameCols ( filter : Predicate < FrameColumn < * > > = { true } ) : TransformableColumnSet < DataFrame < * > >","body":"= columnGroup ( this ) . frameCols ( filter )","docstring":"/**\n * @include [CommonFrameColsDocs]\n * @set [CommonFrameColsDocs.ExampleArg]\n *\n * `df.`[select][DataFrame.select]` { `[colGroup][ColumnsSelectionDsl.colGroup]`(Type::myColGroup).`[frameCols][SingleColumn.frameCols]` { it.`[name][ColumnReference.name]`.`[startsWith][String.startsWith]`(\"my\") } }`\n *\n * `df.`[select][DataFrame.select]` { Type::myColGroup.`[frameCols][SingleColumn.frameCols]`() }`\n *\n * `df.`[select][DataFrame.select]` { DataSchemaType::myColGroup.`[frameCols][KProperty.frameCols]`() }`\n */"} {"signature":"public fun ColumnPath . frameCols ( filter : Predicate < FrameColumn < * > > = { true } ) : TransformableColumnSet < DataFrame < * > >","body":"= columnGroup ( this ) . frameCols ( filter )","docstring":"/**\n * @include [CommonFrameColsDocs]\n * @set [CommonFrameColsDocs.ExampleArg]\n *\n * `df.`[select][DataFrame.select]` { \"pathTo\"[\"myGroupCol\"].`[frameCols][ColumnPath.frameCols]`() }`\n */"} {"signature":"@ Suppress ( \"\" ) internal fun ColumnsResolver < * > . frameColumnsInternal ( filter : ( FrameColumn < * > ) -> Boolean ) : TransformableColumnSet < AnyFrame >","body":"= colsInternal { it . isFrameColumn ( ) && filter ( it . asFrameColumn ( ) ) } as TransformableColumnSet < AnyFrame >","docstring":"/**\n * Returns a TransformableColumnSet containing the frame columns that satisfy the given filter.\n *\n * @param filter The filter function to apply on each frame column. Must accept a FrameColumn object and return a Boolean.\n * @return A [TransformableColumnSet] containing the frame columns that satisfy the filter.\n */"} {"signature":"public fun < T > DataFrame < T > . renameToCamelCase ( ) : DataFrame < T >","body":"= this . rename { colsAtAnyDepth { it . name ( ) matches DELIMITED_STRING_REGEX || it . name [ ] . isUpperCase ( ) } } . toCamelCase ( ) . update { colsAtAnyDepth ( ) . colsOf < AnyFrame > ( ) } . with { it . renameToCamelCase ( ) }","docstring":"/**\n * ## Rename to camelCase\n *\n * This function renames all columns to `camelCase` by replacing all [delimiters][DELIMITERS_REGEX]\n * and converting the first char to lowercase.\n * Even [DataFrames][DataFrame] inside [FrameColumns][FrameColumn] are traversed recursively.\n */"} {"signature":"public fun < T , C > RenameClause < T , C > . toCamelCase ( ) : DataFrame < T >","body":"= into { it . name ( ) . toCamelCaseByDelimiters ( DELIMITERS_REGEX ) . replaceFirstChar { it . lowercaseChar ( ) } }","docstring":"/**\n * ## Rename to camelCase\n *\n * Renames the selected columns to `camelCase` by replacing all [delimiters][DELIMITERS_REGEX]\n * and converting the first char to lowercase.\n */"} {"signature":"public infix fun < C > ColumnReference < C > . named ( newName : String ) : ColumnReference < C >","body":"= renamedReference ( newName )","docstring":"/**\n * @include [CommonRenameDocs]\n * @include [CommonRenameDocs.NamedFunctionName]\n * @include [CommonRenameDocs.ColumnReferenceReceiver]\n * @include [CommonRenameDocs.StringParam]\n */"} {"signature":"public infix fun < C > ColumnReference < C > . named ( nameOf : ColumnReference < * > ) : ColumnReference < C >","body":"= named ( nameOf . name )","docstring":"/**\n * @include [CommonRenameDocs]\n * @include [CommonRenameDocs.NamedFunctionName]\n * @include [CommonRenameDocs.ColumnReferenceReceiver]\n * @include [CommonRenameDocs.ColumnReferenceParam]\n */"} {"signature":"public infix fun < C > ColumnReference < C > . named ( nameOf : KProperty < * > ) : ColumnReference < C >","body":"= named ( nameOf . columnName )","docstring":"/**\n * @include [CommonRenameDocs]\n * @include [CommonRenameDocs.NamedFunctionName]\n * @include [CommonRenameDocs.ColumnReferenceReceiver]\n * @include [CommonRenameDocs.KPropertyParam]\n */"} {"signature":"public infix fun String . named ( newName : String ) : ColumnReference < * >","body":"= toColumnAccessor ( ) . named ( newName )","docstring":"/**\n * @include [CommonRenameDocs]\n * @include [CommonRenameDocs.NamedFunctionName]\n * @include [CommonRenameDocs.StringReceiver]\n * @include [CommonRenameDocs.StringParam]\n */"} {"signature":"public infix fun String . named ( nameOf : ColumnReference < * > ) : ColumnReference < * >","body":"= toColumnAccessor ( ) . named ( nameOf . name )","docstring":"/**\n * @include [CommonRenameDocs]\n * @include [CommonRenameDocs.NamedFunctionName]\n * @include [CommonRenameDocs.StringReceiver]\n * @include [CommonRenameDocs.ColumnReferenceParam]\n */"} {"signature":"public infix fun String . named ( nameOf : KProperty < * > ) : ColumnReference < * >","body":"= toColumnAccessor ( ) . named ( nameOf . columnName )","docstring":"/**\n * @include [CommonRenameDocs]\n * @include [CommonRenameDocs.NamedFunctionName]\n * @include [CommonRenameDocs.StringReceiver]\n * @include [CommonRenameDocs.KPropertyParam]\n */"} {"signature":"public infix fun < C > KProperty < C > . named ( newName : String ) : ColumnReference < C >","body":"= toColumnAccessor ( ) . named ( newName )","docstring":"/**\n * @include [CommonRenameDocs]\n * @include [CommonRenameDocs.NamedFunctionName]\n * @include [CommonRenameDocs.KPropertyReceiver]\n * @include [CommonRenameDocs.StringParam]\n */"} {"signature":"public infix fun < C > KProperty < C > . named ( nameOf : ColumnReference < * > ) : ColumnReference < C >","body":"= toColumnAccessor ( ) . named ( nameOf . name )","docstring":"/**\n * @include [CommonRenameDocs]\n * @include [CommonRenameDocs.NamedFunctionName]\n * @include [CommonRenameDocs.KPropertyReceiver]\n * @include [CommonRenameDocs.ColumnReferenceParam]\n */"} {"signature":"public infix fun < C > KProperty < C > . named ( nameOf : KProperty < * > ) : ColumnReference < C >","body":"= toColumnAccessor ( ) . named ( nameOf . columnName )","docstring":"/**\n * @include [CommonRenameDocs]\n * @include [CommonRenameDocs.NamedFunctionName]\n * @include [CommonRenameDocs.KPropertyReceiver]\n * @include [CommonRenameDocs.KPropertyParam]\n */"} {"signature":"public infix fun < C > ColumnReference < C > . into ( newName : String ) : ColumnReference < C >","body":"= named ( newName )","docstring":"/**\n * @include [CommonRenameDocs]\n * @include [CommonRenameDocs.IntoFunctionName]\n * @include [CommonRenameDocs.ColumnReferenceReceiver]\n * @include [CommonRenameDocs.StringParam]\n */"} {"signature":"public infix fun < C > ColumnReference < C > . into ( nameOf : ColumnReference < * > ) : ColumnReference < C >","body":"= named ( nameOf )","docstring":"/**\n * @include [CommonRenameDocs]\n * @include [CommonRenameDocs.IntoFunctionName]\n * @include [CommonRenameDocs.ColumnReferenceReceiver]\n * @include [CommonRenameDocs.ColumnReferenceParam]\n */"} {"signature":"public infix fun < C > ColumnReference < C > . into ( nameOf : KProperty < * > ) : ColumnReference < C >","body":"= named ( nameOf )","docstring":"/**\n * @include [CommonRenameDocs]\n * @include [CommonRenameDocs.IntoFunctionName]\n * @include [CommonRenameDocs.ColumnReferenceReceiver]\n * @include [CommonRenameDocs.KPropertyParam]\n */"} {"signature":"public infix fun String . into ( newName : String ) : ColumnReference < * >","body":"= named ( newName )","docstring":"/**\n * @include [CommonRenameDocs]\n * @include [CommonRenameDocs.IntoFunctionName]\n * @include [CommonRenameDocs.StringReceiver]\n * @include [CommonRenameDocs.StringParam]\n */"} {"signature":"public infix fun String . into ( nameOf : ColumnReference < * > ) : ColumnReference < * >","body":"= named ( nameOf )","docstring":"/**\n * @include [CommonRenameDocs]\n * @include [CommonRenameDocs.IntoFunctionName]\n * @include [CommonRenameDocs.StringReceiver]\n * @include [CommonRenameDocs.ColumnReferenceParam]\n */"} {"signature":"public infix fun String . into ( nameOf : KProperty < * > ) : ColumnReference < * >","body":"= named ( nameOf )","docstring":"/**\n * @include [CommonRenameDocs]\n * @include [CommonRenameDocs.IntoFunctionName]\n * @include [CommonRenameDocs.StringReceiver]\n * @include [CommonRenameDocs.KPropertyParam]\n */"} {"signature":"public infix fun < C > KProperty < C > . into ( newName : String ) : ColumnReference < C >","body":"= named ( newName )","docstring":"/**\n * @include [CommonRenameDocs]\n * @include [CommonRenameDocs.IntoFunctionName]\n * @include [CommonRenameDocs.KPropertyReceiver]\n * @include [CommonRenameDocs.StringParam]\n */"} {"signature":"public infix fun < C > KProperty < C > . into ( nameOf : ColumnReference < * > ) : ColumnReference < C >","body":"= named ( nameOf )","docstring":"/**\n * @include [CommonRenameDocs]\n * @include [CommonRenameDocs.IntoFunctionName]\n * @include [CommonRenameDocs.KPropertyReceiver]\n * @include [CommonRenameDocs.ColumnReferenceParam]\n */"} {"signature":"public infix fun < C > KProperty < C > . into ( nameOf : KProperty < * > ) : ColumnReference < C >","body":"= named ( nameOf )","docstring":"/**\n * @include [CommonRenameDocs]\n * @include [CommonRenameDocs.IntoFunctionName]\n * @include [CommonRenameDocs.KPropertyReceiver]\n * @include [CommonRenameDocs.KPropertyParam]\n */"} {"signature":"public fun KtClassOrObject . calculateMetadata ( mapping : Multimap < KtElement , PsiElement > ) : Metadata","body":"= withValidityAssertion { analysisSession . metadataCalculator . calculateMetadata ( this , mapping ) }","docstring":"/**\n * Calculates metadata that would be generated by the compiler in case this class was compiled to the JVM class file.\n *\n * @param mapping map containing the light elements ([KtLightElement]) for each callable declaration in this class.\n */"} {"signature":"public fun KtFile . calculateMetadata ( mapping : Multimap < KtElement , PsiElement > ) : Metadata","body":"= withValidityAssertion { analysisSession . metadataCalculator . calculateMetadata ( this , mapping ) }","docstring":"/**\n * Calculates metadata that would be generated by the compiler in case this file was compiled to the JVM class file.\n *\n * @param mapping map containing the light elements ([KtLightElement]) for each callable declaration in this file.\n */"} {"signature":"fun main ( args : Array < String > )","body":"{ fun readLines ( url : String ) : List < String > { return URL ( url ) . openStream ( ) . reader ( ) . readLines ( ) } val unicodeDataLines = readLines ( unicodeDataUrl ) . map { line -> UnicodeDataLine ( line . split ( \"\" ) ) } val bmpUnicodeDataLines = unicodeDataLines . filter { line -> line . char . length <= } fun String . isEmptyOrComment ( ) : Boolean = isEmpty ( ) || startsWith ( \"\" ) val specialCasingLines = readLines ( specialCasingUrl ) . filterNot ( String :: isEmptyOrComment ) . map { line -> SpecialCasingLine ( line . split ( \"\" ) ) } val propListLines = readLines ( propListUrl ) . filterNot ( String :: isEmptyOrComment ) . map { line -> PropertyLine ( line . split ( \"\" ) . map { it . trim ( ) } ) } val wordBreakPropertyLines = readLines ( wordBreakPropertyUrl ) . filterNot ( String :: isEmptyOrComment ) . map { line -> PropertyLine ( line . split ( \"\" ) . map { it . trim ( ) } ) } val derivedCorePropertiesLines = readLines ( derivedCorePropertiesUrl ) . filterNot ( String :: isEmptyOrComment ) . map { line -> PropertyLine ( line . split ( \"\" ) . map { it . trim ( ) } ) } val categoryRangesGenerators = mutableListOf < RangesGenerator > ( ) val otherLowercaseGenerators = mutableListOf < OtherLowercaseRangesGenerator > ( ) val otherUppercaseGenerators = mutableListOf < OtherUppercaseRangesGenerator > ( ) fun addRangesGenerators ( generatedDir : File , target : KotlinTarget ) { val category = RangesGenerator . forCharCategory ( generatedDir . resolve ( \"\" ) , target ) val digit = RangesGenerator . forDigit ( generatedDir . resolve ( \"\" ) , target ) val letter = RangesGenerator . forLetter ( generatedDir . resolve ( \"\" ) , target ) val whitespace = RangesGenerator . forWhitespace ( generatedDir . resolve ( \"\" ) ) categoryRangesGenerators . add ( category ) categoryRangesGenerators . add ( digit ) categoryRangesGenerators . add ( letter ) categoryRangesGenerators . add ( whitespace ) otherLowercaseGenerators . add ( OtherLowercaseRangesGenerator ( generatedDir . resolve ( \"\" ) , target ) ) otherUppercaseGenerators . add ( OtherUppercaseRangesGenerator ( generatedDir . resolve ( \"\" ) , target ) ) } val oneToOneMappingsGenerators = mutableListOf < MappingsGenerator > ( ) fun addOneToOneMappingsGenerators ( generatedDir : File , target : KotlinTarget ) { val uppercase = MappingsGenerator . forUppercase ( generatedDir . resolve ( \"\" ) , target ) val lowercase = MappingsGenerator . forLowercase ( generatedDir . resolve ( \"\" ) , target ) val titlecase = MappingsGenerator . forTitlecase ( generatedDir . resolve ( \"\" ) ) oneToOneMappingsGenerators . add ( uppercase ) oneToOneMappingsGenerators . add ( lowercase ) oneToOneMappingsGenerators . add ( titlecase ) } val oneToManyMappingsGenerators = mutableListOf < OneToManyMappingsGenerator > ( ) fun addOneToManyMappingsGenerators ( generatedDir : File , target : KotlinTarget ) { val uppercase = OneToManyMappingsGenerator . forUppercase ( generatedDir . resolve ( \"\" ) , target , bmpUnicodeDataLines ) val lowercase = OneToManyMappingsGenerator . forLowercase ( generatedDir . resolve ( \"\" ) , target , bmpUnicodeDataLines ) oneToManyMappingsGenerators . add ( uppercase ) oneToManyMappingsGenerators . add ( lowercase ) } val stringUppercaseGenerators = mutableListOf < StringUppercaseGenerator > ( ) val stringLowercaseGenerators = mutableListOf < StringLowercaseGenerator > ( ) val categoryTestGenerator : CharCategoryTestGenerator val stringCasingTestGenerator : StringCasingTestGenerator when ( args . size ) { -> { val baseDir = File ( args . first ( ) ) val categoryTestFile = baseDir . resolve ( \"\" ) categoryTestGenerator = CharCategoryTestGenerator ( categoryTestFile ) val commonGeneratedDir = baseDir . resolve ( \"\" ) oneToManyMappingsGenerators . add ( OneToManyMappingsGenerator . forTitlecase ( commonGeneratedDir . resolve ( \"\" ) , bmpUnicodeDataLines ) ) val jsGeneratedDir = baseDir . resolve ( \"\" ) addRangesGenerators ( jsGeneratedDir , KotlinTarget . JS ) oneToOneMappingsGenerators . add ( MappingsGenerator . forTitlecase ( jsGeneratedDir . resolve ( \"\" ) ) ) val nativeGeneratedDir = baseDir . resolve ( \"\" ) addRangesGenerators ( nativeGeneratedDir , KotlinTarget . Native ) addOneToOneMappingsGenerators ( nativeGeneratedDir , KotlinTarget . Native ) addOneToManyMappingsGenerators ( nativeGeneratedDir , KotlinTarget . Native ) stringUppercaseGenerators . add ( StringUppercaseGenerator ( nativeGeneratedDir . resolve ( \"\" ) , unicodeDataLines , KotlinTarget . Native ) ) stringLowercaseGenerators . add ( StringLowercaseGenerator ( nativeGeneratedDir . resolve ( \"\" ) , unicodeDataLines , KotlinTarget . Native ) ) val wasmGeneratedDir = baseDir . resolve ( \"\" ) addRangesGenerators ( wasmGeneratedDir , KotlinTarget . WASM ) addOneToOneMappingsGenerators ( wasmGeneratedDir , KotlinTarget . WASM ) addOneToManyMappingsGenerators ( wasmGeneratedDir , KotlinTarget . WASM ) stringUppercaseGenerators . add ( StringUppercaseGenerator ( wasmGeneratedDir . resolve ( \"\" ) , unicodeDataLines , KotlinTarget . WASM ) ) stringLowercaseGenerators . add ( StringLowercaseGenerator ( wasmGeneratedDir . resolve ( \"\" ) , unicodeDataLines , KotlinTarget . WASM ) ) val nativeTestDir = baseDir . resolve ( \"\" ) stringCasingTestGenerator = StringCasingTestGenerator ( nativeTestDir ) fun downloadFile ( fromUrl : String ) { val fileName = File ( fromUrl ) . name val dest = baseDir . resolve ( \"\" ) dest . writeText ( readLines ( fromUrl ) . joinToString ( separator = \"\" ) ) } downloadFile ( unicodeDataUrl ) downloadFile ( specialCasingUrl ) } else -> { println ( \"\"\"\"\"\" ) exitProcess ( ) } } categoryRangesGenerators . forEach { bmpUnicodeDataLines . forEach { line -> it . appendLine ( line ) } it . generate ( ) } otherLowercaseGenerators . forEach { propListLines . forEach { line -> it . appendLine ( line ) } it . generate ( ) } otherUppercaseGenerators . forEach { propListLines . forEach { line -> it . appendLine ( line ) } it . generate ( ) } categoryTestGenerator . let { bmpUnicodeDataLines . forEach { line -> it . appendLine ( line ) } propListLines . forEach { line -> it . appendPropertyLine ( line ) } it . generate ( ) } oneToOneMappingsGenerators . forEach { unicodeDataLines . forEach { line -> it . appendLine ( line ) } it . generate ( ) } oneToManyMappingsGenerators . forEach { specialCasingLines . forEach { line -> it . appendLine ( line ) } it . generate ( ) } stringUppercaseGenerators . forEach { specialCasingLines . forEach { line -> it . appendSpecialCasingLine ( line ) } it . generate ( ) } stringLowercaseGenerators . forEach { specialCasingLines . forEach { line -> it . appendSpecialCasingLine ( line ) } wordBreakPropertyLines . forEach { line -> it . appendWordBreakPropertyLine ( line ) } it . generate ( ) } stringCasingTestGenerator . let { derivedCorePropertiesLines . forEach { line -> it . appendDerivedCorePropertiesLine ( line ) } it . generate ( ) } }","docstring":"/**\n * This program generates sources related to UnicodeData.txt and SpecialCasing.txt.\n * Pass the root directory of the project to generate sources for js, js-ir and native.\n * _CharCategoryTest.kt and supporting files are also generated to test the generated sources.\n * The generated test is meant to be run after updating Unicode version and should not be merged to master.\n */"} {"signature":"fun applyChanges ( )","body":"fun applyChanges ( )","docstring":"/**\n * Applies in-memory changes to the underlying [PersistentStorage], then calls [clearChanges].\n *\n * Note that the changes are only propagated to the underlying [PersistentStorage], they may not be written to [storageFile] yet. If\n * you want to propagate the changes to [storageFile], call [flush] instead.\n */"} {"signature":"fun clearChanges ( )","body":"fun clearChanges ( )","docstring":"/** Removes all in-memory changes. */"} {"signature":"public override fun < T : InferenceModel < * > , U > loadModel ( modelType : ModelType < T , U > , loadingMode : LoadingMode ) : T","body":"{ val jsonConfigFile = getJSONConfigFile ( modelType , loadingMode ) return ( modelType as TFModelType ) . loadModelConfiguration ( jsonConfigFile ) }","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 via [loadWeights] before usage.\n */"} {"signature":"public fun loadClassLabels ( ) : Map < Int , String >","body":"{ return Imagenet . V1k . labels ( ) }","docstring":"/** Forms mapping of class label to class name for the ImageNet dataset. */"} {"signature":"public fun loadWeights ( modelType : ModelType < * , * > , loadingMode : LoadingMode = LoadingMode . SKIP_LOADING_IF_EXISTS ) : HdfFile","body":"{ val modelDirectory = \"\" + modelType . modelRelativePath val relativeWeightsPath = modelDirectory + WEIGHTS_FILE_NAME val weightsURL = awsS3Url + modelDirectory + WEIGHTS_FILE_NAME val fileName = cacheDirectory . absolutePath + relativeWeightsPath val file = File ( fileName ) if ( ! file . exists ( ) || loadingMode == LoadingMode . OVERRIDE_IF_EXISTS ) { val inputStream = URL ( weightsURL ) . openStream ( ) logger . info { \"\" } Files . copy ( inputStream , Paths . get ( fileName ) , StandardCopyOption . REPLACE_EXISTING ) logger . info { \"\" } } return HdfFile ( File ( fileName ) ) }","docstring":"/**\n * Loads model 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 Compiled model with initialized weights.\n */"} {"signature":"private fun getJSONConfigFile ( modelType : ModelType < * , * > , loadingMode : LoadingMode ) : File","body":"{ val modelDirectory = \"\" + modelType . modelRelativePath val relativeConfigPath = modelDirectory + MODEL_CONFIG_FILE_NAME val configURL = awsS3Url + modelDirectory + MODEL_CONFIG_FILE_NAME val dir = File ( cacheDirectory . absolutePath + modelDirectory ) if ( ! dir . exists ( ) ) Files . createDirectories ( dir . toPath ( ) ) val fileName = cacheDirectory . absolutePath + relativeConfigPath val file = File ( fileName ) if ( ! file . exists ( ) || loadingMode == LoadingMode . OVERRIDE_IF_EXISTS ) { val inputStream = URL ( configURL ) . openStream ( ) logger . debug { \"\" } Files . copy ( inputStream , Paths . get ( fileName ) , StandardCopyOption . REPLACE_EXISTING ) logger . debug { \"\" } } return File ( fileName ) }","docstring":"/** Returns JSON file with model configuration, saved from Keras 2.x. */"} {"signature":"public fun onModification ( )","body":"public fun onModification ( )","docstring":"/**\n * [onModification] is invoked in a write action before or after global module state modification.\n *\n * The module structure, source code, and binary content of all [KtModule]s in the project should be considered modified when this event\n * is received. This includes source files being moved or removed, binary content being added, removed, or changed, and modules possibly\n * being removed. Thus, all caches related to module structure, source code, and binaries should be invalidated.\n *\n * @see KotlinTopics\n */"} {"signature":"private fun getFunctionTypeArity ( kotlinType : KotlinType ) : Int","body":"= getFunctionTypeArityByRegex ( kotlinType , KOTLIN_FUNCTION_INTERFACE_REGEX )","docstring":"/**\n * @return function type arity (non-negative), or -1 if the given type is not a function type\n */"} {"signature":"private fun getSuspendFunctionTypeArity ( kotlinType : KotlinType ) : Int","body":"= getFunctionTypeArityByRegex ( kotlinType , KOTLIN_SUSPEND_FUNCTION_INTERFACE_REGEX )","docstring":"/**\n * @return function type arity (non-negative, not counting continuation), or -1 if the given type is not a function type\n */"} {"signature":"fun createImagePanel ( bufferedImage : BufferedImage , draw : Graphics2D . ( ) -> Unit ) : JPanel","body":"{ return object : ImagePanel ( bufferedImage ) { override fun paint ( graphics : Graphics ) { super . paint ( graphics ) ( graphics as Graphics2D ) . draw ( ) } } }","docstring":"/**\n * Creates an [ImagePanel] instance which displays given [bufferedImage]\n * and allows to draw on it using the given [draw] function.\n */"} {"signature":"@ Deprecated ( level = DeprecationLevel . ERROR , message = \"\" , replaceWith = ReplaceWith ( \"\" ) ) public fun < T > SharedFlow < T > . cancellable ( ) : Flow < T >","body":"= noImpl ( )","docstring":"/**\n * Applying [cancellable][Flow.cancellable] to a [SharedFlow] has no effect.\n * See the [SharedFlow] documentation on Operator Fusion.\n * @suppress\n */"} {"signature":"@ Deprecated ( level = DeprecationLevel . ERROR , message = \"\" , replaceWith = ReplaceWith ( \"\" ) ) public fun < T > SharedFlow < T > . flowOn ( context : CoroutineContext ) : Flow < T >","body":"= noImpl ( )","docstring":"/**\n * Applying [flowOn][Flow.flowOn] to [SharedFlow] has no effect.\n * See the [SharedFlow] documentation on Operator Fusion.\n * @suppress\n */"} {"signature":"@ Deprecated ( level = DeprecationLevel . ERROR , message = \"\" , replaceWith = ReplaceWith ( \"\" ) ) public fun < T > StateFlow < T > . conflate ( ) : Flow < T >","body":"= noImpl ( )","docstring":"/**\n * Applying [conflate][Flow.conflate] to [StateFlow] has no effect.\n * See the [StateFlow] documentation on Operator Fusion.\n * @suppress\n */"} {"signature":"@ Deprecated ( level = DeprecationLevel . ERROR , message = \"\" , replaceWith = ReplaceWith ( \"\" ) ) public fun < T > StateFlow < T > . distinctUntilChanged ( ) : Flow < T >","body":"= noImpl ( )","docstring":"/**\n * Applying [distinctUntilChanged][Flow.distinctUntilChanged] to [StateFlow] has no effect.\n * See the [StateFlow] documentation on Operator Fusion.\n * @suppress\n */"} {"signature":"@ Deprecated ( message = \"\" + \"\" , level = DeprecationLevel . ERROR , replaceWith = ReplaceWith ( \"\" ) ) public fun FlowCollector < * > . cancel ( cause : CancellationException ? = null ) : Unit","body":"= noImpl ( )","docstring":"/**\n * @suppress\n */"} {"signature":"@ Deprecated ( message = \"\" + \"\" , level = DeprecationLevel . WARNING , replaceWith = ReplaceWith ( \"\" ) ) @ InlineOnly public inline fun < T > SharedFlow < T > . catch ( noinline action : suspend FlowCollector < T > . ( cause : Throwable ) -> Unit ) : Flow < T >","body":"= ( this as Flow < T > ) . catch ( action )","docstring":"/**\n * @suppress\n */"} {"signature":"@ Deprecated ( message = \"\" , level = DeprecationLevel . WARNING , replaceWith = ReplaceWith ( \"\" ) ) @ InlineOnly public inline fun < T > SharedFlow < T > . retry ( retries : Long = Long . MAX_VALUE , noinline predicate : suspend ( cause : Throwable ) -> Boolean = { true } ) : Flow < T >","body":"= ( this as Flow < T > ) . retry ( retries , predicate )","docstring":"/**\n * @suppress\n */"} {"signature":"@ Deprecated ( message = \"\" , level = DeprecationLevel . WARNING , replaceWith = ReplaceWith ( \"\" ) ) @ InlineOnly public inline fun < T > SharedFlow < T > . retryWhen ( noinline predicate : suspend FlowCollector < T > . ( cause : Throwable , attempt : Long ) -> Boolean ) : Flow < T >","body":"= ( this as Flow < T > ) . retryWhen ( predicate )","docstring":"/**\n * @suppress\n */"} {"signature":"@ Suppress ( \"\" ) @ Deprecated ( message = \"\" , level = DeprecationLevel . WARNING ) @ InlineOnly public suspend inline fun < T > SharedFlow < T > . toList ( ) : List < T >","body":"= ( this as Flow < T > ) . toList ( )","docstring":"/**\n * @suppress\n */"} {"signature":"@ InlineOnly public suspend inline fun < T > SharedFlow < T > . toList ( destination : MutableList < T > ) : Nothing","body":"{ ( this as Flow < T > ) . toList ( destination ) throw IllegalStateException ( \"\" ) }","docstring":"/**\n * A specialized version of [Flow.toList] that returns [Nothing]\n * to indicate that [SharedFlow] collection never completes.\n */"} {"signature":"@ Suppress ( \"\" ) @ Deprecated ( message = \"\" , level = DeprecationLevel . WARNING ) @ InlineOnly public suspend inline fun < T > SharedFlow < T > . toSet ( ) : Set < T >","body":"= ( this as Flow < T > ) . toSet ( )","docstring":"/**\n * @suppress\n */"} {"signature":"@ InlineOnly public suspend inline fun < T > SharedFlow < T > . toSet ( destination : MutableSet < T > ) : Nothing","body":"{ ( this as Flow < T > ) . toSet ( destination ) throw IllegalStateException ( \"\" ) }","docstring":"/**\n * A specialized version of [Flow.toSet] that returns [Nothing]\n * to indicate that [SharedFlow] collection never completes.\n */"} {"signature":"@ Suppress ( \"\" ) @ Deprecated ( message = \"\" , level = DeprecationLevel . WARNING ) @ InlineOnly public suspend inline fun < T > SharedFlow < T > . count ( ) : Int","body":"= ( this as Flow < T > ) . count ( )","docstring":"/**\n * @suppress\n */"} {"signature":"fun generateAnnotationValueAsExpression ( startOffset : Int , endOffset : Int , constantValue : ConstantValue < * > , valueParameter : ValueParameterDescriptor , ) : IrExpression ?","body":"= generateConstantOrAnnotationValueAsExpression ( startOffset , endOffset , constantValue , valueParameter . type , valueParameter . varargElementType )","docstring":"/**\n * @return null if the constant value is an unresolved annotation or an unresolved class literal\n */"} {"signature":"protected abstract fun SerialDescriptor . getTag ( index : Int ) : Tag","body":"protected abstract fun SerialDescriptor . getTag ( index : Int ) : Tag","docstring":"/**\n * Provides a tag object for given serial descriptor and index.\n * Tag object allows associating given user information with a particular element of composite serializable entity.\n */"} {"signature":"protected open fun endEncode ( descriptor : SerialDescriptor )","body":"{ }","docstring":"/**\n * Format-specific replacement for [endStructure], because latter is overridden to manipulate tag stack.\n */"} {"signature":"protected abstract fun SerialDescriptor . getTag ( index : Int ) : Tag","body":"protected abstract fun SerialDescriptor . getTag ( index : Int ) : Tag","docstring":"/**\n * Provides a tag object for given serial descriptor and index.\n * Tag object allows associating given user information with a particular element of composite serializable entity.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ InlineOnly public actual inline fun < T > ( suspend ( ) -> T ) . startCoroutineUninterceptedOrReturn ( completion : Continuation < T > ) : Any ?","body":"= if ( this !is BaseContinuationImpl ) wrapWithContinuationImpl ( completion ) else ( this as Function1 < Continuation < T > , Any ? > ) . invoke ( completion )","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 ( \"\" ) @ InlineOnly public actual inline fun < R , T > ( suspend R . ( ) -> T ) . startCoroutineUninterceptedOrReturn ( receiver : R , completion : Continuation < T > ) : Any ?","body":"= if ( this !is BaseContinuationImpl ) wrapWithContinuationImpl ( receiver , completion ) else ( this as Function2 < R , Continuation < T > , Any ? > ) . invoke ( receiver , completion )","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 actual fun < T > ( suspend ( ) -> T ) . createCoroutineUnintercepted ( completion : Continuation < T > ) : Continuation < Unit >","body":"{ val probeCompletion = probeCoroutineCreated ( completion ) return if ( this is BaseContinuationImpl ) create ( probeCompletion ) else createCoroutineFromSuspendFunction ( probeCompletion ) { ( this as Function1 < Continuation < T > , Any ? > ) . invoke ( it ) } }","docstring":"/**\n * Creates unintercepted coroutine without receiver and with result type [T].\n * This function creates a new, fresh instance of suspendable computation every time it is invoked.\n *\n * To start executing the created coroutine, invoke `resume(Unit)` on the returned [Continuation] instance.\n * The [completion] continuation is invoked when coroutine completes with result or exception.\n *\n * This function returns unintercepted continuation.\n * Invocation of `resume(Unit)` starts coroutine immediately in the invoker's call stack without going through the\n * [ContinuationInterceptor] that might be present in the completion's [CoroutineContext].\n * It is the invoker's responsibility to ensure that a proper invocation context is established.\n * Note that [completion] of this function may get invoked in an arbitrary context.\n *\n * [Continuation.intercepted] can be used to acquire the intercepted continuation.\n * Invocation of `resume(Unit)` on intercepted continuation guarantees that execution of\n * both the coroutine and [completion] happens in the invocation context established by\n * [ContinuationInterceptor].\n *\n * Repeated invocation of any resume function on the resulting continuation corrupts the\n * state machine of the coroutine and may result in arbitrary behaviour or exception.\n */"} {"signature":"@ SinceKotlin ( \"\" ) public actual fun < R , T > ( suspend R . ( ) -> T ) . createCoroutineUnintercepted ( receiver : R , completion : Continuation < T > ) : Continuation < Unit >","body":"{ val probeCompletion = probeCoroutineCreated ( completion ) return if ( this is BaseContinuationImpl ) create ( receiver , probeCompletion ) else { createCoroutineFromSuspendFunction ( probeCompletion ) { ( this as Function2 < R , Continuation < T > , Any ? > ) . invoke ( receiver , it ) } } }","docstring":"/**\n * Creates unintercepted coroutine with receiver type [R] and result type [T].\n * This function creates a new, fresh instance of suspendable computation every time it is invoked.\n *\n * To start executing the created coroutine, invoke `resume(Unit)` on the returned [Continuation] instance.\n * The [completion] continuation is invoked when coroutine completes with result or exception.\n *\n * This function returns unintercepted continuation.\n * Invocation of `resume(Unit)` starts coroutine immediately in the invoker's call stack without going through the\n * [ContinuationInterceptor] that might be present in the completion's [CoroutineContext].\n * It is the invoker's responsibility to ensure that a proper invocation context is established.\n * Note that [completion] of this function may get invoked in an arbitrary context.\n *\n * [Continuation.intercepted] can be used to acquire the intercepted continuation.\n * Invocation of `resume(Unit)` on intercepted continuation guarantees that execution of\n * both the coroutine and [completion] happens in the invocation context established by\n * [ContinuationInterceptor].\n *\n * Repeated invocation of any resume function on the resulting continuation corrupts the\n * state machine of the coroutine and may result in arbitrary behaviour or exception.\n */"} {"signature":"@ SinceKotlin ( \"\" ) public actual fun < T > Continuation < T > . intercepted ( ) : Continuation < T >","body":"= ( this as? ContinuationImpl ) ? . intercepted ( ) ? : this","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 ( \"\" ) private inline fun < T > createCoroutineFromSuspendFunction ( completion : Continuation < T > , crossinline block : ( Continuation < T > ) -> Any ? ) : Continuation < Unit >","body":"{ val context = completion . context return if ( context === EmptyCoroutineContext ) object : RestrictedContinuationImpl ( completion as Continuation < Any ? > ) { private var label = override fun invokeSuspend ( result : Result < Any ? > ) : Any ? = when ( label ) { -> { label = result . getOrThrow ( ) block ( this ) } -> { label = result . getOrThrow ( ) } else -> error ( \"\" ) } } else object : ContinuationImpl ( completion as Continuation < Any ? > , context ) { private var label = override fun invokeSuspend ( result : Result < Any ? > ) : Any ? = when ( label ) { -> { label = result . getOrThrow ( ) block ( this ) } -> { label = result . getOrThrow ( ) } else -> error ( \"\" ) } } }","docstring":"/**\n * This function is used when [createCoroutineUnintercepted] encounters suspending lambda that does not extend BaseContinuationImpl.\n *\n * It happens in two cases:\n * 1. Callable reference to suspending function,\n * 2. Suspending function reference implemented by Java code.\n *\n * We must wrap it into an instance that extends [BaseContinuationImpl], because that is an expectation of all coroutines machinery.\n * As an optimization we use lighter-weight [RestrictedContinuationImpl] base class (it has less fields) if the context is\n * [EmptyCoroutineContext], and a full-blown [ContinuationImpl] class otherwise.\n *\n * The instance of [BaseContinuationImpl] is passed to the [block] so that it can be passed to the corresponding invocation.\n */"} {"signature":"private fun < T > createSimpleCoroutineForSuspendFunction ( completion : Continuation < T > ) : Continuation < T >","body":"{ val context = completion . context return if ( context === EmptyCoroutineContext ) object : RestrictedContinuationImpl ( completion as Continuation < Any ? > ) { override fun invokeSuspend ( result : Result < Any ? > ) : Any ? { return result . getOrThrow ( ) } } else object : ContinuationImpl ( completion as Continuation < Any ? > , context ) { override fun invokeSuspend ( result : Result < Any ? > ) : Any ? { return result . getOrThrow ( ) } } }","docstring":"/**\n * This function is used when [startCoroutineUninterceptedOrReturn] encounters suspending lambda that does not extend BaseContinuationImpl.\n *\n * It happens in two cases:\n * 1. Callable reference to suspending function or tail-call lambdas,\n * 2. Suspending function reference implemented by Java code.\n *\n * This function is the same as above, but does not run lambda itself - the caller is expected to call [invoke] manually.\n */"} {"signature":"internal fun invalidateAfterInBlockModification ( declaration : FirDeclaration ) : Boolean","body":"= when ( declaration ) { is FirSimpleFunction -> declaration . inBodyInvalidation ( ) is FirPropertyAccessor -> declaration . inBodyInvalidation ( ) is FirProperty -> declaration . inBodyInvalidation ( ) is FirCodeFragment -> declaration . inBodyInvalidation ( ) else -> errorWithFirSpecificEntries ( \"\" , fir = declaration , psi = declaration . psi ) }","docstring":"/**\n * Must be called in a write action.\n * @return **false** if it is not in-block modification\n */"} {"signature":"private fun FirSimpleFunction . inBodyInvalidation ( ) : Boolean","body":"{ val body = body ? : return false invalidateBody ( body ) return true }","docstring":"/**\n * Drop body and all related stuff.\n * We should drop:\n * * body\n * * control flow graph reference, because it depends on the body\n * * reduce phase if needed\n *\n * Depends on the body, but we shouldn't drop:\n * * implicit type, because the change mustn't change the resulting type\n * * contract, because a change inside a contract description is OOBM, so this function won't be called in this case\n *\n * Also, we shouldn't update somehow value parameters because they have their own \"bodies\" (a default value) and\n * changes in them are OOBM, so it is not our case.\n *\n * @return **false** if it is an out-of-block change\n */"} {"signature":"private fun FirProperty . inBodyInvalidation ( ) : Boolean","body":"{ val initializerState = invalidateInitializer ( ) val delegateState = invalidateDelegate ( ) when { initializerState == PropertyExpressionState . ABSENT && delegateState == PropertyExpressionState . ABSENT -> return false initializerState == PropertyExpressionState . LAZY || delegateState == PropertyExpressionState . LAZY -> return true } decreasePhase ( phaseWithoutBody ) replaceControlFlowGraphReference ( null ) replaceBodyResolveState ( FirPropertyBodyResolveState . NOTHING_RESOLVED ) return true }","docstring":"/**\n * Drop body and all related stuff.\n * We should drop:\n * * initializer or delegate expression\n * * control flow graph reference, because it depends on the initializer or delegate\n * * body resolution state\n * * reduce phase if needed\n *\n * Depends on the body, but we shouldn't drop:\n * * implicit type, because the change mustn't change the resulting type\n *\n * Also, we shouldn't update the property accessors because they don't depend on the initializer or delegate.\n * So it is fine to leave the phase of setter/getter/backing field as it is.\n *\n * @return **false** if it is an out-of-block change\n */"} {"signature":"private fun FirPropertyAccessor . inBodyInvalidation ( ) : Boolean","body":"{ val body = body ? : return false val newPhase = invalidateBody ( body ) ? : return true val property = propertySymbol . fir property . decreasePhase ( newPhase ) val newPropertyResolveState = if ( isGetter ) { FirPropertyBodyResolveState . INITIALIZER_RESOLVED } else { FirPropertyBodyResolveState . INITIALIZER_AND_GETTER_RESOLVED } property . replaceBodyResolveState ( minOf ( property . bodyResolveState , newPropertyResolveState ) ) return true }","docstring":"/**\n * Drop body and all related stuff.\n * We should drop:\n * * body\n * * control flow graph reference, because it depends on the body\n * * property body resolution state\n * * reduce phase if needed\n *\n * Depends on the body, but we shouldn't drop:\n * * implicit type, because the change mustn't change the resulting type\n * * contract, because a change inside a contract description is OOBM, so this function won't be called in this case\n *\n * @return **false** if it is an out-of-block change\n */"} {"signature":"@ JvmStatic fun newInstance ( param1 : String , param2 : String )","body":"= StartFragment ( ) . apply { arguments = Bundle ( ) . apply { putString ( ARG_PARAM1 , param1 ) putString ( ARG_PARAM2 , param2 ) } }","docstring":"/**\n * Use this factory method to create a new instance of\n * this fragment using the provided parameters.\n *\n * @param param1 Parameter 1.\n * @param param2 Parameter 2.\n * @return A new instance of fragment StartFragment.\n */"} {"signature":"fun createScriptDefinitionFromTemplate ( baseClassType : KotlinType , baseHostConfiguration : ScriptingHostConfiguration , contextClass : KClass < * > = ScriptDefinition :: class , compilation : ScriptCompilationConfiguration . Builder . ( ) -> Unit = { } , evaluation : ScriptEvaluationConfiguration . Builder . ( ) -> Unit = { } ) : ScriptDefinition","body":"{ val templateClass : KClass < * > = baseClassType . getTemplateClass ( baseHostConfiguration , contextClass ) val mainAnnotation = templateClass . kotlinScriptAnnotation val hostConfiguration = constructHostConfiguration ( mainAnnotation . hostConfiguration , baseHostConfiguration ) { } val compilationConfiguration = constructCompilationConfiguration ( mainAnnotation , hostConfiguration , templateClass , baseClassType , compilation ) val evaluationConfiguration = constructEvaluationConfiguration ( mainAnnotation , hostConfiguration , evaluation ) return ScriptDefinition ( compilationConfiguration , evaluationConfiguration ) }","docstring":"/**\n * Creates script compilation and evaluation configuration from annotated script base class\n * @param baseClassType the annotated script base class to construct the configuration from\n * @param baseHostConfiguration base scripting host configuration properties\n * @param contextClass optional context class to extract classloading strategy from\n * @param compilation optional configuration function to add more properties to the compilation configuration\n * @param evaluation optional configuration function to add more properties to the evaluation configuration\n */"} {"signature":"fun createCompilationConfigurationFromTemplate ( baseClassType : KotlinType , baseHostConfiguration : ScriptingHostConfiguration , contextClass : KClass < * > = ScriptCompilationConfiguration :: class , body : ScriptCompilationConfiguration . Builder . ( ) -> Unit = { } ) : ScriptCompilationConfiguration","body":"{ val templateClass : KClass < * > = baseClassType . getTemplateClass ( baseHostConfiguration , contextClass ) val mainAnnotation = templateClass . kotlinScriptAnnotation val hostConfiguration = constructHostConfiguration ( mainAnnotation . hostConfiguration , baseHostConfiguration ) { } return constructCompilationConfiguration ( mainAnnotation , hostConfiguration , templateClass , baseClassType , body ) }","docstring":"/**\n * Creates compilation configuration from annotated script base class\n * NOTE: it is preferable to use createScriptDefinitionFromTemplate for creating all configurations at once\n * @param baseClassType the annotated script base class to construct the configuration from\n * @param baseHostConfiguration scripting host configuration properties\n * @param contextClass optional context class to extract classloading strategy from\n * @param body optional configuration function to add more properties to the compilation configuration\n */"} {"signature":"fun createEvaluationConfigurationFromTemplate ( baseClassType : KotlinType , baseHostConfiguration : ScriptingHostConfiguration , contextClass : KClass < * > = ScriptEvaluationConfiguration :: class , body : ScriptEvaluationConfiguration . Builder . ( ) -> Unit = { } ) : ScriptEvaluationConfiguration","body":"{ val templateClass : KClass < * > = baseClassType . getTemplateClass ( baseHostConfiguration , contextClass ) val mainAnnotation = templateClass . kotlinScriptAnnotation val hostConfiguration = constructHostConfiguration ( mainAnnotation . hostConfiguration , baseHostConfiguration ) { } return constructEvaluationConfiguration ( mainAnnotation , hostConfiguration , body ) }","docstring":"/**\n * Creates evaluation configuration from annotated script base class\n * NOTE: it is preferable to use createScriptDefinitionFromTemplate for creating all configurations at once\n * @param baseClassType the annotated script base class to construct the configuration from\n * @param baseHostConfiguration scripting host configuration properties\n * @param contextClass optional context class to extract classloading strategy from\n * @param body optional configuration function to add more properties to the evaluation configuration\n */"} {"signature":"public inline fun < reified DomainType : Comparable < DomainType > > continuousColorGrey ( paletteRange : ClosedRange < Double > ? = null , domain : ClosedRange < DomainType > , nullValue : Color ? = null , transform : Transformation ? = null ) : ScaleContinuousColorGrey < DomainType >","body":"= ScaleContinuousColorGrey ( paletteRange ? . let { it . start to it . endInclusive } , domain . let { it . start to it . endInclusive } , nullValue , transform )","docstring":"/**\n * Sequential grey continuous color scale for color aesthetic.\n * The palette is computed using an HSV (hue, saturation, value) color model.\n *\n * @param DomainType type of domain\n * @param paletteRange grey values range (between [0, 1]).\n * @param domain [ClosedRange] defining the scale domain.\n * @param nullValue value which null is mapped to.\n * @param transform scale transformation.\n *\n * @return new continuous color scale.\n */"} {"signature":"public inline fun < reified DomainType : Comparable < DomainType > > continuousColorGrey ( paletteRange : ClosedRange < Double > ? = null , domainMin : DomainType ? = null , domainMax : DomainType ? = null , nullValue : Color ? = null , transform : Transformation ? = null ) : ScaleContinuousColorGrey < DomainType >","body":"= ScaleContinuousColorGrey ( paletteRange ? . let { it . start to it . endInclusive } , domainMin to domainMax , nullValue , transform )","docstring":"/**\n * Sequential grey color continuous scale for color aesthetic.\n * The palette is computed using an HSV (hue, saturation, value) color model.\n *\n * @param DomainType type of domain\n * @param paletteRange grey values range (between [0, 1]).\n * @param domainMin scale domain minimum.\n * @param domainMax scale domain maximum.\n * @param nullValue value which null is mapped to.\n * @param transform scale transformation.\n *\n * @return new continuous color scale.\n */"} {"signature":"public inline fun < reified DomainType > categoricalColorGrey ( paletteRange : Pair < Double , Double > ? = null , ) : ScaleCategoricalColorGrey < DomainType >","body":"= ScaleCategoricalColorGrey < DomainType > ( paletteRange , )","docstring":"/**\n * Sequential grey color categorical scale for color aesthetic.\n * The palette is computed using HSV (hue, saturation, value) color model.\n *\n * @param DomainType type of domain\n * @param paletteRange grey values range (between [0, 1]).\n *\n * @return new categorical color scale.\n */"} {"signature":"fun flush ( @ Suppress ( \"\" ) memoryCachesOnly : Boolean )","body":"{ flush ( ) }","docstring":"/**\n * DEPRECATED: This API should be removed because\n * - It's not clear what [memoryCachesOnly] means.\n * - In the past, when `memoryCachesOnly=true` we applied a small optimization: Checking\n * [com.intellij.util.io.PersistentHashMap.isDirty] before calling [com.intellij.util.io.PersistentHashMap.force]. However, if that\n * optimization is useful, it's better to always do it (perhaps inside the [com.intellij.util.io.PersistentHashMap.force] method\n * itself) rather than doing it based on the value of this parameter.\n *\n * Instead, just call [flush] (without a parameter) directly.\n */"} {"signature":"fun clean ( )","body":"{ close ( ) deleteStorageFiles ( ) }","docstring":"/**\n * DEPRECATED: This API should be removed because:\n * - It's not obvious what \"clean\" means: It does not exactly describe the current implementation, and it also sounds similar to\n * \"clear\" which means removing all the map entries, but this method does not do that.\n * - This method currently calls [close] (and [deleteStorageFiles]). However, [close] is often already called separately and\n * automatically, so this API makes it more likely for [close] to be accidentally called twice.\n *\n * Instead, just call [close] and/or [deleteStorageFiles] explicitly.\n */"} {"signature":"public actual fun < T > MutableList < T > . reverse ( ) : Unit","body":"{ val midPoint = ( size / ) - if ( midPoint < ) return var reverseIndex = lastIndex for ( index in .. midPoint ) { val tmp = this [ index ] this [ index ] = this [ reverseIndex ] this [ reverseIndex ] = tmp reverseIndex -- } }","docstring":"/**\n * Reverses elements in the list in-place.\n */"} {"signature":"internal suspend fun Project . createCommonizedCInteropDependencyConfigurationView ( sourceSet : KotlinSourceSet ) : FileCollection","body":"{ @ OptIn ( UnsafeApi :: class ) val configuration = locateOrCreateCommonizedCInteropDependencyConfiguration ( sourceSet ) ? : return files ( ) return configuration . incoming . artifactView { view -> view . isLenient = true } . files }","docstring":"/**\n * Gives access the 'commonized cinterop dependency configuration' of the given [sourceSet].\n * The access is forced through this 'view' because the provided 'artifact view' is forced to be lenient as protective measure.\n *\n * If dependencies do not provide corresponding commonized cinterop element configurations then we should not fail the build!\n */"} {"signature":"protected fun < T : FirCallableSymbol < * > > ResultOfIntersection < T > . collectNonOverriddenDeclarations ( explicitlyDeclared : Set < FirCallableSymbol < * > > , destination : MutableList < in T > , )","body":"{ when ( this ) { is ResultOfIntersection . SingleMember -> { val chosenSymbol = chosenSymbol if ( chosenSymbol . isInvisible ( ) ) return val overriddenBy = chosenSymbol . getOverridden ( explicitlyDeclared ) if ( overriddenBy == null ) { destination += chosenSymbol } } is ResultOfIntersection . NonTrivial -> { val ( visibleNotOverridden , overriddenOrInvisible ) = overriddenMembers . partition { ! it . member . isInvisible ( ) && it . member . getOverridden ( explicitlyDeclared ) == null } if ( overriddenOrInvisible . isEmpty ( ) ) { destination += chosenSymbol } else if ( visibleNotOverridden . isNotEmpty ( ) ) { destination += supertypeScopeContext . convertGroupedCallablesToIntersectionResults ( visibleNotOverridden . map { it . baseScope to listOf ( it . member ) } ) . map { it . chosenSymbol } } } } }","docstring":"/**\n * If the receiver [ResultOfIntersection] is not overridden by any symbol in [explicitlyDeclared],\n * adds its [ResultOfIntersection.chosenSymbol] to [destination].\n *\n * If the [ResultOfIntersection] is [ResultOfIntersection.NonTrivial] and only some of the intersected symbols are overridden,\n * constructs a new [ResultOfIntersection] consisting of the non-overridden symbols and adds its [ResultOfIntersection.chosenSymbol]\n * to [destination].\n *\n * It's the opposite operation of [collectDirectOverriddenForDeclared].\n */"} {"signature":"protected inline fun < T : FirCallableSymbol < * > > ResultOfIntersection < T > . collectDirectOverriddenForDeclared ( declared : T , result : MutableList < in ResultOfIntersection < T > > , isOverridden : ( T , T ) -> Boolean , )","body":"{ when ( this ) { is ResultOfIntersection . SingleMember -> { val symbolFromSupertype = chosenSymbol if ( isOverridden ( declared , symbolFromSupertype ) ) { result . add ( this ) } } is ResultOfIntersection . NonTrivial -> { val ( overridden , nonOverridden ) = overriddenMembers . partition { isOverridden ( declared , it . member ) } if ( nonOverridden . isEmpty ( ) ) { result += this } else if ( overridden . isNotEmpty ( ) ) { result += supertypeScopeContext . convertGroupedCallablesToIntersectionResults ( overridden . map { it . baseScope to listOf ( it . member ) } ) } } } }","docstring":"/**\n * If [declared] overrides the receiver [ResultOfIntersection], adds it to [result].\n * If the [ResultOfIntersection] is [ResultOfIntersection.NonTrivial] and [declared] only overrides some of the intersected symbols,\n * a new [ResultOfIntersection] is constructed containing only the overridden symbols.\n *\n * Opposite operation to [collectNonOverriddenDeclarations].\n */"} {"signature":"protected open fun FirNamedFunctionSymbol . replaceWithWrapperSymbolIfNeeded ( ) : FirNamedFunctionSymbol","body":"{ return this }","docstring":"/**\n * This function is currently used only for creating suspend views in Java.\n */"} {"signature":"internal fun ConfigurationContainer . configureStdlibVersionAlignment ( )","body":"= all { configuration -> configuration . withDependencies { dependencySet -> dependencySet . withType < ExternalDependency > ( ) . configureEach { dependency -> if ( dependency . group == KOTLIN_MODULE_GROUP && ( dependency . name == KOTLIN_STDLIB_MODULE_NAME || dependency . name == KOTLIN_STDLIB_JDK7_MODULE_NAME ) && dependency . version != null && SemVer . fromGradleRichVersion ( dependency . version ! ! ) . let { it >= kotlin180Version && it < kotlin1920Version } ) { if ( configuration . isCanBeResolved ) configuration . alignStdlibJvmVariantVersions ( dependency ) filter { it . isCanBeResolved && it . hierarchy . contains ( configuration ) } . forEach { it . alignStdlibJvmVariantVersions ( dependency ) } } } } }","docstring":"/**\n * Aligning kotlin-stdlib-jdk8 and kotlin-stdlib-jdk7 dependencies versions with kotlin-stdlib (or kotlin-stdlib-jdk7)\n * when project stdlib version is >= 1.8.0\n */"} {"signature":"fun NamedDomainObjectContainer < KotlinSourceSet > . groupSourceSets ( groupName : String , reverseDependencies : List < String > , dependencies : List < String > )","body":"{ val sourceSetSuffixes = listOf ( \"\" , \"\" ) for ( suffix in sourceSetSuffixes ) { register ( groupName + suffix ) { for ( dep in dependencies ) { dependsOn ( get ( dep + suffix ) ) } for ( revDep in reverseDependencies ) { get ( revDep + suffix ) . dependsOn ( this ) } } } }","docstring":"/**\n * Creates shared source sets for a group of source sets.\n *\n * [reverseDependencies] is a list of prefixes of names of source sets that depend on the new source set.\n * [dependencies] is a list of prefixes of names of source sets that the new source set depends on.\n * [groupName] is the prefix of the names of the new source sets.\n *\n * The suffixes of the source sets are \"Main\" and \"Test\".\n */"} {"signature":"public fun onModification ( module : KtModule , modificationKind : KotlinModuleStateModificationKind )","body":"public fun onModification ( module : KtModule , modificationKind : KotlinModuleStateModificationKind )","docstring":"/**\n * [onModification] is invoked in a write action *before* the [module] is updated or removed (see [modificationKind] for specifics).\n *\n * @see KotlinTopics\n */"} {"signature":"public fun createInheritanceTypeSubstitutor ( subClass : KtClassOrObjectSymbol , superClass : KtClassOrObjectSymbol , ) : KtSubstitutor ?","body":"= withValidityAssertion { analysisSession . substitutorProvider . createSubstitutor ( subClass , superClass ) }","docstring":"/**\n * Creates a [KtSubstitutor] based on the inheritance relationship between [subClass] and [superClass].\n *\n * The semantic of resulted [KtSubstitutor] is the substitutor that should be applied to a member of [superClass],\n * so it can be called on an instance of [subClass].\n *\n * Basically, it's a composition of inheritance-based substitutions for all the inheritance chain.\n *\n * On the following code:\n * ```\n * class A : B\n * class B : C\n * class C\n * ```\n *\n * * `createInheritanceTypeSubstitutor(A, B)` returns `KtSubstitutor {T -> String}`\n * * `createInheritanceTypeSubstitutor(B, C)` returns `KtSubstitutor {X -> T, Y -> Int}`\n * * `createInheritanceTypeSubstitutor(A, C)` returns `KtSubstitutor {X -> T, Y -> Int} andThen KtSubstitutor {T -> String}`\n *\n * @param subClass the subClass or object symbol.\n * @param superClass the super class symbol.\n * @return [KtSubstitutor] if [subClass] inherits [superClass] and there are no error types in the inheritance path. Returns `null` otherwise.\n */"} {"signature":"fun vgg19additionalTraining ( )","body":"{ val modelHub = TFModelHub ( cacheDirectory = File ( \"\" ) ) val modelType = TFModels . CV . VGG19 ( ) val model = modelHub . loadModel ( modelType ) val layers = model . layers . dropLast ( ) . toMutableList ( ) layers . forEach ( Layer :: freeze ) layers . add ( Dense ( name = \"\" , kernelInitializer = HeNormal ( ) , biasInitializer = HeNormal ( ) , outputSize = , activation = Activations . Relu ) ) layers . add ( Dense ( name = \"\" , kernelInitializer = HeNormal ( ) , biasInitializer = HeNormal ( ) , outputSize = , activation = Activations . Linear ) ) val newModel = Sequential . of ( layers ) val dataset = OnFlyImageDataset . create ( File ( dogsCatsSmallDatasetPath ( ) ) , FromFolders ( mapping = mapOf ( \"\" to , \"\" to ) ) , modelType . createPreprocessing ( newModel ) ) . shuffle ( ) val ( train , test ) = dataset . split ( TRAIN_TEST_SPLIT_RATIO ) newModel . use { it . compile ( optimizer = Adam ( ) , loss = Losses . SOFT_MAX_CROSS_ENTROPY_WITH_LOGITS , metric = Metrics . ACCURACY ) val hdfFile = modelHub . loadWeights ( modelType ) it . loadWeightsForFrozenLayers ( hdfFile ) val accuracyBeforeTraining = it . evaluate ( dataset = test , batchSize = TEST_BATCH_SIZE ) . metrics [ Metrics . ACCURACY ] println ( \"\" ) it . fit ( dataset = train , batchSize = TRAINING_BATCH_SIZE , epochs = EPOCHS ) val accuracyAfterTraining = it . evaluate ( dataset = test , batchSize = TEST_BATCH_SIZE ) . metrics [ Metrics . ACCURACY ] println ( \"\" ) } }","docstring":"/**\n * This example demonstrates the transfer learning concept on VGG'19 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 * - All layers, excluding the last [Dense], are added to the new Neural Network, its weights are frozen.\n * - New Dense layers are added and initialized via defined initializers.\n * - Model is re-trained on [dogsCatsSmallDatasetPath] dataset.\n *\n * We use the preprocessing DSL to describe the dataset generation pipeline.\n * We demonstrate the workflow on the subset of Kaggle Cats vs Dogs binary classification dataset.\n *\n * @see \n * Very Deep Convolutional Networks for Large-Scale Image Recognition (ICLR 2015).\n * @see \n * Detailed description of VGG'19 model and an approach to build it in Keras.\n */"} {"signature":"fun main ( ) : Unit","body":"= vgg19additionalTraining ( )","docstring":"/** */"} {"signature":"private fun KTestMessageProto3Oneof . verify ( verificationFunction : ( KTestMessageProto3Oneof , TestMessagesProto3 . TestAllTypesProto3 ) -> Unit , )","body":"{ val bytes = ProtoBuf . encodeToByteArray ( this ) val restored = TestMessagesProto3 . TestAllTypesProto3 . parseFrom ( bytes ) verificationFunction . invoke ( this , restored ) val restoredMessage = ProtoBuf . decodeFromByteArray < KTestMessageProto3Oneof > ( restored . toByteArray ( ) ) assertEquals ( this , restoredMessage . copy ( oneofBytes = this . oneofBytes ) ) assertContentEquals ( this . oneofBytes , restoredMessage . oneofBytes ) }","docstring":"/**\n * Verify that the given [KTestMessageProto3Oneof] is correctly encoded and decoded as\n * [TestMessagesProto3.TestAllTypesProto3] by running the [verificationFunction]. This\n * method also verifies that the encoded and decoded message is equal to the original message.\n *\n * @param verificationFunction a function that verifies the encoded and decoded message. First parameter\n * is the original message and the second parameter is the decoded protobuf library message.\n * @receiver the [KTestMessageProto3Oneof] to verify\n */"} {"signature":"fun resnet50additionalTraining ( )","body":"{ val modelHub = ONNXModelHub ( cacheDirectory = File ( \"\" ) ) val modelType = ONNXModels . CVnoTop . ResNet50Custom modelHub . loadModel ( modelType ) . use { model -> println ( model ) val preprocessing = modelType . createPreprocessing ( longArrayOf ( , , ) ) . onnx { onnxModel = model } val dogsVsCatsDatasetPath = dogsCatsSmallDatasetPath ( ) val dataset = OnFlyImageDataset . create ( File ( dogsVsCatsDatasetPath ) , FromFolders ( mapping = mapOf ( \"\" to , \"\" to ) ) , preprocessing ) . shuffle ( ) val ( train , test ) = dataset . split ( TRAIN_TEST_SPLIT_RATIO ) topModel . use { topModel . compile ( optimizer = Adam ( ) , loss = Losses . SOFT_MAX_CROSS_ENTROPY_WITH_LOGITS , metric = Metrics . ACCURACY ) topModel . fit ( dataset = train , epochs = EPOCHS , batchSize = TRAINING_BATCH_SIZE ) val accuracy = topModel . evaluate ( dataset = test , batchSize = TEST_BATCH_SIZE ) . metrics [ Metrics . ACCURACY ] println ( \"\" ) } } }","docstring":"/**\n * This examples demonstrates the transfer learning concept on ResNet'50 model:\n * - Model configuration, model weights and labels are obtained from [ONNXModelHub].\n * - All layers, excluding the last [Dense], are added to the new Neural Network, its weights are frozen.\n * - ONNX frozen model is used as a preprocessing stage via `onnx` stage of the Image Preprocessing DSL.\n * - New Dense layers are added and initialized via defined initializers.\n * - Model is re-trained on [dogsCatsDatasetPath] dataset.\n *\n *\n * We use the preprocessing DSL to describe the dataset generation pipeline.\n * We demonstrate the workflow on the subset of Kaggle Cats vs Dogs binary classification dataset.\n */"} {"signature":"fun main ( ) : Unit","body":"= resnet50additionalTraining ( )","docstring":"/** */"} {"signature":"fun reloadScriptConfiguration ( scriptFile : PsiFile , updateEditorWithoutNotification : Boolean = false )","body":"{ val extensions = scriptFile . project . extensionArea . getExtensionPoint ( IdeScriptConfigurationControlFacade . EP_NAME ) . extensions for ( extension in extensions ) { extension . reloadScriptConfiguration ( scriptFile , updateEditorWithoutNotification ) } }","docstring":"/**\n * Force reloading the script definition associated with the passed [scriptFile] in the Kotlin plugin\n *\n * [updateEditorWithoutNotification] controls whether the update of the indexes and highlighting of the script files\n * based on the reloaded definition should be reloaded automatically or using notification and explicit reload action\n */"} {"signature":"fun reloadScriptConfiguration ( scriptFile : PsiFile , updateEditorWithoutNotification : Boolean = false )","body":"fun reloadScriptConfiguration ( scriptFile : PsiFile , updateEditorWithoutNotification : Boolean = false )","docstring":"/**\n * Force reloading the script definition associated with the passed [scriptFile] in the Kotlin plugin\n *\n * [updateEditorWithoutNotification] controls whether the update of the indexes and highlighting of the script files\n * based on the reloaded definition should be reloaded automatically or using notification and explicit reload action\n */"} {"signature":"public inline fun < T , D : Dimension > MultiArray < T , D > . all ( predicate : ( T ) -> Boolean ) : Boolean","body":"{ if ( 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 * If an ndarray is empty, then always returns `true`.\n */"} {"signature":"public fun < T , D : Dimension > MultiArray < T , D > . any ( ) : Boolean","body":"{ return isNotEmpty ( ) }","docstring":"/**\n * Returns `true` if collection has at least one element.\n * @see NDArray.isNotEmpty\n */"} {"signature":"public inline fun < T , D : Dimension > MultiArray < T , D > . any ( predicate : ( T ) -> Boolean ) : Boolean","body":"{ if ( 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 * If an ndarray is empty, then always returns `false`.\n */"} {"signature":"public fun < T , D : Dimension > MultiArray < T , D > . 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 */"} {"signature":"public inline fun < T , D : Dimension , K , V > MultiArray < T , D > . associate ( transform : ( T ) -> Pair < K , V > ) : Map < K , V >","body":"{ val capacity = mapCapacity ( this . size ) . coerceAtLeast ( ) return associateTo ( LinkedHashMap ( 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 */"} {"signature":"public inline fun < T , D : Dimension , K > MultiArray < T , D > . associateBy ( keySelector : ( T ) -> K ) : Map < K , T >","body":"{ val capacity = mapCapacity ( size ) . coerceAtLeast ( ) return associateByTo ( LinkedHashMap ( 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 */"} {"signature":"public inline fun < T , D : Dimension , K , V > MultiArray < T , D > . associateBy ( keySelector : ( T ) -> K , valueTransform : ( T ) -> V ) : Map < K , V >","body":"{ val capacity = mapCapacity ( size ) . coerceAtLeast ( ) return associateByTo ( LinkedHashMap ( 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 */"} {"signature":"public inline fun < T , D : Dimension , K , M : MutableMap < in K , in T > > MultiArray < T , D > . 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 */"} {"signature":"public inline fun < T , D : Dimension , K , V , M : MutableMap < in K , in V > > MultiArray < T , D > . 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 */"} {"signature":"public inline fun < T , D : Dimension , K , V , M : MutableMap < in K , in V > > MultiArray < T , D > . 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 */"} {"signature":"public inline fun < K , D : Dimension , V > MultiArray < K , D > . associateWith ( valueSelector : ( K ) -> V ) : Map < K , V >","body":"{ val capacity = mapCapacity ( size ) . coerceAtLeast ( ) return associateWithTo ( LinkedHashMap ( capacity ) , 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 */"} {"signature":"public inline fun < K , D : Dimension , V , M : MutableMap < in K , in V > > MultiArray < K , D > . 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 */"} {"signature":"public fun < T : Number , D : Dimension > MultiArray < T , D > . average ( ) : Double","body":"{ var sum = var count = for ( element in this ) { sum += element . toDouble ( ) if ( ++ count < ) throw ArithmeticException ( \"\" ) } return if ( count == ) Double . NaN else sum / count }","docstring":"/**\n * Returns an average value of elements in the ndarray.\n */"} {"signature":"public fun < T , D : Dimension > MultiArray < T , D > . chunked ( size : Int ) : NDArray < T , D2 >","body":"{ return windowed ( size , size , limit = false ) }","docstring":"/**\n * Splits this ndarray into a 2-D ndarray.\n * The last elements in the resulting ndarray may be zero.\n *\n * @param size number of elements in axis 1.\n */"} {"signature":"public operator fun < T , D : Dimension > MultiArray < T , D > . contains ( element : T ) : Boolean","body":"{ return indexOf ( element ) >= }","docstring":"/**\n * Returns `true` if [element] is found in the collection.\n */"} {"signature":"@ Suppress ( \"\" ) public inline fun < T , D : Dimension > MultiArray < T , D > . count ( ) : Int","body":"= size","docstring":"/**\n * Returns the number of elements in an ndarray.\n */"} {"signature":"public inline fun < T , D : Dimension > MultiArray < T , D > . count ( predicate : ( T ) -> Boolean ) : Int","body":"{ if ( isEmpty ( ) ) return var count = for ( element in this ) if ( predicate ( element ) ) if ( ++ count < ) throw ArithmeticException ( \"\" ) return count }","docstring":"/**\n * Returns the number of elements matching the given [predicate].\n */"} {"signature":"public fun < T , D : Dimension > MultiArray < T , D > . distinct ( ) : NDArray < T , D1 >","body":"= this . toMutableSet ( ) . toCommonNDArray ( this . dtype )","docstring":"/**\n * Returns a new array containing only distinct elements from the given array.\n */"} {"signature":"public inline fun < T , D : Dimension , K > MultiArray < T , D > . distinctBy ( selector : ( T ) -> K ) : NDArray < T , D1 >","body":"{ val set = HashSet < K > ( ) val list = ArrayList < T > ( ) for ( e in this ) { val key = selector ( e ) if ( set . add ( key ) ) list . add ( e ) } val dtype = DataType . of ( list . first ( ) ) return list . toCommonNDArray ( dtype ) }","docstring":"/**\n * Returns a new array containing only elements from the given array\n * having distinct keys returned by the given [selector] function.\n */"} {"signature":"public fun < T > MultiArray < T , D1 > . drop ( n : Int ) : D1Array < T >","body":"{ if ( n == ) return D1Array ( this . data . copyOf ( ) , shape = shape . copyOf ( ) , dim = D1 ) val resultSize = size - abs ( n ) if ( resultSize < ) return D1Array ( initMemoryView ( , dtype ) , shape = intArrayOf ( ) , dim = D1 ) val k = if ( n < ) else n val d = initMemoryView ( resultSize , dtype ) { this [ it + k ] } val shape = intArrayOf ( resultSize ) return D1Array ( d , shape = shape , dim = D1 ) }","docstring":"/**\n * Drops first n elements.\n */"} {"signature":"public inline fun < T > MultiArray < T , D1 > . dropWhile ( predicate : ( T ) -> Boolean ) : NDArray < T , D1 >","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 ndarrayCommon ( list , intArrayOf ( list . size ) , D1 ) }","docstring":"/**\n * Drops elements that don't satisfy the [predicate].\n */"} {"signature":"public inline fun < T , D : Dimension > MultiArray < T , D > . filter ( predicate : ( T ) -> Boolean ) : D1Array < T >","body":"{ val list = ArrayList < T > ( ) forEach { if ( predicate ( it ) ) list . add ( it ) } val dtype = DataType . of ( list . first ( ) ) return list . toCommonNDArray ( dtype ) }","docstring":"/**\n * Return a new array contains elements matching filter.\n */"} {"signature":"@ JvmName ( \"\" ) public inline fun < T > MultiArray < T , D1 > . filterIndexed ( predicate : ( index : Int , T ) -> Boolean ) : D1Array < T >","body":"{ val list = ArrayList < T > ( ) forEachIndexed { index , element -> if ( predicate ( index , element ) ) list . add ( element ) } val dtype = DataType . of ( list . first ( ) ) return list . toCommonNDArray ( dtype ) }","docstring":"/**\n * Return a new array contains elements matching filter.\n */"} {"signature":"@ JvmName ( \"\" ) public inline fun < T , D : Dimension > MultiArray < T , D > . filterMultiIndexed ( predicate : ( index : IntArray , T ) -> Boolean ) : D1Array < T >","body":"{ val list = ArrayList < T > ( ) forEachMultiIndexed { index , element -> if ( predicate ( index , element ) ) list . add ( element ) } val dtype = DataType . of ( list . first ( ) ) return list . toCommonNDArray ( dtype ) }","docstring":"/**\n * Return a new array contains elements matching filter.\n */"} {"signature":"public inline fun < T , D : Dimension > MultiArray < T , D > . filterNot ( predicate : ( T ) -> Boolean ) : D1Array < T >","body":"{ val list = ArrayList < T > ( ) for ( element in this ) if ( ! predicate ( element ) ) list . add ( element ) val dtype = DataType . of ( list . first ( ) ) return list . toCommonNDArray ( dtype ) }","docstring":"/**\n * Return a new array contains elements matching filter.\n */"} {"signature":"public inline fun < T , D : Dimension > MultiArray < T , D > . 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 */"} {"signature":"public inline fun < T , D : Dimension > MultiArray < T , D > . 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 */"} {"signature":"public fun < T , D : Dimension > MultiArray < T , D > . first ( ) : T","body":"{ if ( isEmpty ( ) ) throw NoSuchElementException ( \"\" ) return this . data [ this . offset ] }","docstring":"/**\n * Returns first element.\n * @throws [NoSuchElementException] if the collection is empty.\n */"} {"signature":"public inline fun < T , D : Dimension > MultiArray < T , D > . 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":"public fun < T , D : Dimension > MultiArray < T , D > . firstOrNull ( ) : T ?","body":"{ return if ( isEmpty ( ) ) null else return this . first ( ) }","docstring":"/**\n * Returns the first element, or `null` if the collection is empty.\n */"} {"signature":"public inline fun < T , D : Dimension > MultiArray < T , D > . 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":"public inline fun < T , D : Dimension , reified R > MultiArray < T , D > . flatMap ( transform : ( T ) -> Iterable < R > ) : D1Array < R >","body":"{ val destination = ArrayList < R > ( ) for ( element in this ) { val list = transform ( element ) destination . addAll ( list ) } val dtype = DataType . of ( destination . first ( ) ) return destination . toCommonNDArray ( dtype ) }","docstring":"/**\n * Returns a flat ndarray of all elements resulting from calling the [transform] function on each element\n * in this ndarray.\n */"} {"signature":"@ JvmName ( \"\" ) public inline fun < T , reified R > MultiArray < T , D1 > . flatMapIndexed ( transform : ( index : Int , T ) -> Iterable < R > ) : D1Array < R >","body":"{ var index = val destination = ArrayList < R > ( ) for ( element in this ) { val list = transform ( checkIndexOverflow ( index ++ ) , element ) destination . addAll ( list ) } val dtype = DataType . of ( destination . first ( ) ) return destination . toCommonNDArray ( dtype ) }","docstring":"/**\n * Returns a flat ndarray of all elements resulting from calling the [transform] function on each element and its single\n * index in this d1 ndarray.\n */"} {"signature":"@ JvmName ( \"\" ) public inline fun < T , reified R > MultiArray < T , D1 > . flatMapMultiIndexed ( transform : ( index : IntArray , T ) -> Iterable < R > ) : D1Array < R >","body":"{ val indexIter = this . multiIndices . iterator ( ) val destination = ArrayList < R > ( ) for ( element in this ) { if ( indexIter . hasNext ( ) ) { val list = transform ( indexIter . next ( ) , element ) destination . addAll ( list ) } else { throw ArithmeticException ( \"\" ) } } val dtype = DataType . of ( destination . first ( ) ) return destination . toCommonNDArray ( dtype ) }","docstring":"/**\n * Returns a flat ndarray of all elements resulting from calling the [transform] function on each element and its multi\n * index in this dn ndarray.\n */"} {"signature":"public inline fun < T , D : Dimension , R > MultiArray < T , D > . 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 to current accumulator value and each element.\n */"} {"signature":"@ JvmName ( \"\" ) public inline fun < T , R > MultiArray < T , D1 > . 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 ndarray.\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":"@ JvmName ( \"\" ) public inline fun < T , D : Dimension , R > MultiArray < T , D > . foldMultiIndexed ( initial : R , operation : ( index : IntArray , acc : R , T ) -> R ) : R","body":"{ val indexIter = this . multiIndices . iterator ( ) var accumulator = initial for ( element in this ) { if ( indexIter . hasNext ( ) ) accumulator = operation ( indexIter . next ( ) , accumulator , element ) else throw ArithmeticException ( \"\" ) } 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 ndarray.\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 , D : Dimension > MultiArray < T , D > . forEach ( action : ( T ) -> Unit )","body":"{ for ( element in this ) action ( element ) }","docstring":"/**\n * Performs the given [action] on each element.\n */"} {"signature":"@ JvmName ( \"\" ) public inline fun < T > MultiArray < T , D1 > . forEachIndexed ( action : ( index : Int , T ) -> 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 desired action on the element.\n */"} {"signature":"@ JvmName ( \"\" ) public inline fun < T , D : Dimension > MultiArray < T , D > . forEachMultiIndexed ( action : ( index : IntArray , T ) -> Unit )","body":"{ val indexIter = this . multiIndices . iterator ( ) for ( item in this ) { if ( indexIter . hasNext ( ) ) action ( indexIter . next ( ) , item ) else throw ArithmeticException ( \"\" ) } }","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 desired action on the element.\n */"} {"signature":"public inline fun < T , D : Dimension , K > MultiArray < T , D > . groupNDArrayBy ( keySelector : ( T ) -> K ) : Map < K , NDArray < T , D1 > >","body":"{ return groupNDArrayByTo ( LinkedHashMap ( ) , keySelector ) }","docstring":"/**\n * Groups elements of a given ndarray by the key returned by [keySelector] for each element,\n * and returns a map where each group key is associated with an ndarray of matching elements.\n */"} {"signature":"public inline fun < T , D : Dimension , K , V : Number > MultiArray < T , D > . groupNDArrayBy ( keySelector : ( T ) -> K , valueTransform : ( T ) -> V ) : Map < K , NDArray < V , D1 > >","body":"{ return groupNDArrayByTo ( LinkedHashMap ( ) , keySelector , valueTransform ) }","docstring":"/**\n * Groups values returned by [valueTransform] applied to each element of the given ndarray\n * with the key returned by [keySelector] applied to each element,\n * and returns a map where each group key is associated with an ndarray of matching values.\n */"} {"signature":"public inline fun < T , D : Dimension , K , M : MutableMap < in K , NDArray < T , D1 > > > MultiArray < T , D > . groupNDArrayByTo ( destination : M , keySelector : ( T ) -> K ) : M","body":"{ val map = LinkedHashMap < K , MutableList < T > > ( ) for ( element in this ) { val key = keySelector ( element ) val list = map . getOrPut ( key ) { ArrayList ( ) } list . add ( element ) } for ( item in map ) { val dtype = DataType . of ( item . value . first ( ) ) destination . put ( item . key , item . value . toCommonNDArray ( dtype = dtype ) ) } return destination }","docstring":"/**\n * Groups elements of the given array by the key returned by [keySelector] function applied to each\n * element and puts to the [destination] map each group key associated with an ndarray of corresponding elements.\n */"} {"signature":"public inline fun < T , D : Dimension , K , V , M : MutableMap < in K , NDArray < V , D1 > > > MultiArray < T , D > . groupNDArrayByTo ( destination : M , keySelector : ( T ) -> K , valueTransform : ( T ) -> V ) : M","body":"{ val map = LinkedHashMap < K , MutableList < V > > ( ) for ( element in this ) { val key = keySelector ( element ) val list = map . getOrPut ( key ) { ArrayList ( ) } list . add ( valueTransform ( element ) ) } for ( item in map ) { val dtype = DataType . of ( item . value . first ( ) ) destination . put ( item . key , item . value . toCommonNDArray ( dtype = dtype ) ) } return destination }","docstring":"/**\n * Groups values returned by the [valueTransform] function applied to each element of the given ndarray by the key\n * returned by [keySelector] function applied to the element and puts to the destination map each group key\n * associated with an ndarray of corresponding values.\n */"} {"signature":"public inline fun < T , D : Dimension , K > MultiArray < T , D > . groupingNDArrayBy ( crossinline keySelector : ( T ) -> K ) : Grouping < T , K >","body":"{ return object : Grouping < T , K > { override fun sourceIterator ( ) : Iterator < T > = this@groupingNDArrayBy . iterator ( ) override fun keyOf ( element : T ) : K = keySelector ( element ) } }","docstring":"/**\n * Creates a [Grouping] source from an ndarray to be used later with one of group-and-fold operations using the\n * specified [keySelector] function to extract a key from each element.\n */"} {"signature":"public fun < T , D : Dimension > MultiArray < T , D > . indexOf ( element : T ) : Int","body":"{ 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":"public inline fun < T , D : Dimension > MultiArray < T , D > . 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 , D : Dimension > MultiArray < T , D > . 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 infix fun < T , D : Dimension > MultiArray < T , D > . 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 fun < T , D : Dimension , A : Appendable > MultiArray < T , D > . 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 ) { when { transform != null -> buffer . append ( transform ( element ) ) element is CharSequence -> buffer . append ( element ) else -> buffer . append ( element . toString ( ) ) } } else break } if ( limit in until count ) 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 */"} {"signature":"public fun < T , D : Dimension > MultiArray < T , D > . 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 */"} {"signature":"public fun < T , D : Dimension > MultiArray < T , D > . last ( ) : T","body":"{ if ( isEmpty ( ) ) throw NoSuchElementException ( \"\" ) val index = IntArray ( dim . d ) { shape [ it ] - } return this . asDNArray ( ) [ index ] }","docstring":"/**\n * Returns the last element.\n * @throws [NoSuchElementException] if the collection is empty.\n */"} {"signature":"public inline fun < T , D : Dimension > MultiArray < T , D > . last ( predicate : ( T ) -> Boolean ) : T","body":"{ val ndarray = this . asDNArray ( ) for ( i in this . multiIndices . reverse ) { val element = ndarray [ i ] if ( predicate ( element ) ) return element } throw NoSuchElementException ( \"\" ) }","docstring":"/**\n * Returns the last element matching the given [predicate].\n * @throws [NoSuchElementException] if no such element is found.\n */"} {"signature":"public fun < T , D : Dimension > MultiArray < T , D > . lastIndexOf ( element : T ) : Int","body":"{ var lastIndex = - var index = for ( item in this ) { if ( index < ) throw ArithmeticException ( \"\" ) 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":"public fun < T , D : Dimension > MultiArray < T , D > . lastOrNull ( ) : T ?","body":"{ return if ( isEmpty ( ) ) null else this . asDNArray ( ) [ this . multiIndices . last ] }","docstring":"/**\n * Returns the last element, or `null` if the list is empty.\n */"} {"signature":"public inline fun < T , D : Dimension > MultiArray < T , D > . 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 */"} {"signature":"public inline fun < T , D : Dimension , reified R : Any > MultiArray < T , D > . map ( transform : ( T ) -> R ) : NDArray < R , D >","body":"{ val newDtype = DataType . ofKClass ( R :: class ) val data = initMemoryView < R > ( size , newDtype ) var count = for ( el in this ) data [ count ++ ] = transform ( el ) return NDArray ( data , shape = shape , dim = dim ) }","docstring":"/**\n * Return a new array contains elements after applying [transform].\n */"} {"signature":"@ Suppress ( \"\" ) public fun < T : Number , D : Dimension > MultiArray < T , D > . minimum ( other : MultiArray < T , D > ) : NDArray < T , D >","body":"{ requireEqualShape ( this . shape , other . shape ) val ret = ( this as NDArray ) . deepCopy ( ) when ( dtype ) { DataType . DoubleDataType -> ( ret as NDArray < Double , D > ) . commonAssignOp ( other . iterator ( ) as Iterator < Double > ) { a , b -> min ( a , b ) } DataType . FloatDataType -> ( ret as NDArray < Float , D > ) . commonAssignOp ( other . iterator ( ) as Iterator < Float > ) { a , b -> min ( a , b ) } DataType . IntDataType -> ( ret as NDArray < Int , D > ) . commonAssignOp ( other . iterator ( ) as Iterator < Int > ) { a , b -> min ( a , b ) } DataType . LongDataType -> ( ret as NDArray < Long , D > ) . commonAssignOp ( other . iterator ( ) as Iterator < Long > ) { a , b -> min ( a , b ) } DataType . ShortDataType -> ( ret as NDArray < Short , D > ) . commonAssignOp ( other . iterator ( ) as Iterator < Short > ) { a , b -> ( minOf ( a , b ) ) } DataType . ByteDataType -> ( ret as NDArray < Byte , D > ) . commonAssignOp ( other . iterator ( ) as Iterator < Byte > ) { a , b -> ( minOf ( a , b ) ) } else -> throw UnsupportedOperationException ( \"\" ) } return ret }","docstring":"/**\n * Returns the element-wise minimum of array elements for [this] and [other].\n */"} {"signature":"public fun < T : Number , D : Dimension > MultiArray < T , D > . maximum ( other : MultiArray < T , D > ) : NDArray < T , D >","body":"{ requireEqualShape ( this . shape , other . shape ) val ret = ( this as NDArray ) . deepCopy ( ) when ( dtype ) { DataType . DoubleDataType -> ( ret as NDArray < Double , D > ) . commonAssignOp ( other . iterator ( ) as Iterator < Double > ) { a , b -> max ( a , b ) } DataType . FloatDataType -> ( ret as NDArray < Float , D > ) . commonAssignOp ( other . iterator ( ) as Iterator < Float > ) { a , b -> max ( a , b ) } DataType . IntDataType -> ( ret as NDArray < Int , D > ) . commonAssignOp ( other . iterator ( ) as Iterator < Int > ) { a , b -> max ( a , b ) } DataType . LongDataType -> ( ret as NDArray < Long , D > ) . commonAssignOp ( other . iterator ( ) as Iterator < Long > ) { a , b -> max ( a , b ) } DataType . ShortDataType -> ( ret as NDArray < Short , D > ) . commonAssignOp ( other . iterator ( ) as Iterator < Short > ) { a , b -> ( maxOf ( a , b ) ) } DataType . ByteDataType -> ( ret as NDArray < Byte , D > ) . commonAssignOp ( other . iterator ( ) as Iterator < Byte > ) { a , b -> ( maxOf ( a , b ) ) } else -> throw UnsupportedOperationException ( \"\" ) } return ret }","docstring":"/**\n * Returns the element-wise maximum of array elements for [this] and [other].\n */"} {"signature":"@ JvmName ( \"\" ) public inline fun < T , reified R : Any > MultiArray < T , D1 > . mapIndexed ( transform : ( index : Int , T ) -> R ) : D1Array < R >","body":"{ val newDtype = DataType . ofKClass ( R :: class ) val data = initMemoryView < R > ( size , newDtype ) var index = for ( item in this ) data [ index ] = transform ( index ++ , item ) return D1Array ( data , shape = shape , dim = D1 ) }","docstring":"/**\n * Return a new array contains elements after applying [transform].\n */"} {"signature":"@ JvmName ( \"\" ) public inline fun < T , D : Dimension , reified R : Any > MultiArray < T , D > . mapMultiIndexed ( transform : ( index : IntArray , T ) -> R ) : NDArray < R , D >","body":"{ val newDtype = DataType . ofKClass ( R :: class ) val data = initMemoryView < R > ( size , newDtype ) val indexIter = this . multiIndices . iterator ( ) var index = for ( item in this ) { if ( indexIter . hasNext ( ) ) { data [ index ++ ] = transform ( indexIter . next ( ) , item ) } else { throw ArithmeticException ( \"\" ) } } return NDArray ( data , shape = shape , dim = dim ) }","docstring":"/**\n * Return a new array contains elements after applying [transform].\n */"} {"signature":"@ JvmName ( \"\" ) public inline fun < T , reified R : Any > MultiArray < T , D1 > . mapIndexedNotNull ( transform : ( index : Int , T ) -> R ? ) : D1Array < R >","body":"{ val newDtype = DataType . ofKClass ( R :: class ) val data = initMemoryView < R > ( size , newDtype ) var count = forEachIndexed { index , element -> transform ( index , element ) ? . let { data [ count ++ ] = it } } return D1Array ( data , shape = shape , dim = D1 ) }","docstring":"/**\n * Return a new array contains elements after applying [transform].\n */"} {"signature":"@ JvmName ( \"\" ) public inline fun < T , D : Dimension , reified R : Any > MultiArray < T , D > . mapMultiIndexedNotNull ( transform : ( index : IntArray , T ) -> R ? ) : NDArray < R , D >","body":"{ val newDtype = DataType . ofKClass ( R :: class ) val data = initMemoryView < R > ( size , newDtype ) var count = forEachMultiIndexed { index , element -> transform ( index , element ) ? . let { data [ count ++ ] = it } } return NDArray ( data , shape = shape . copyOf ( ) , dim = dim ) }","docstring":"/**\n * Return a new array contains elements after applying [transform].\n */"} {"signature":"public inline fun < T , D : Dimension , reified R : Any > MultiArray < T , D > . mapNotNull ( transform : ( T ) -> R ? ) : NDArray < R , D >","body":"{ val newDtype = DataType . ofKClass ( R :: class ) val data = initMemoryView < R > ( size , newDtype ) var index = forEach { element -> transform ( element ) ? . let { data [ index ++ ] = it } } return NDArray ( data , shape = shape , dim = dim ) }","docstring":"/**\n * Return a new array contains elements after applying [transform].\n */"} {"signature":"public fun < T : Number , D : Dimension > MultiArray < T , D > . max ( ) : 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":"public inline fun < T , D : Dimension , R : Comparable < R > > MultiArray < T , D > . maxBy ( 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 */"} {"signature":"public fun < T , D : Dimension > MultiArray < T , D > . maxWith ( 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":"public fun < T , D : Dimension > MultiArray < T , D > . min ( ) : T ? where T : Number , T : Comparable < 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":"public inline fun < T , D : Dimension , R : Comparable < R > > MultiArray < T , D > . minBy ( 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 */"} {"signature":"public fun < T , D : Dimension > MultiArray < T , D > . minWith ( 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 inline fun < T , D : Dimension , C : MultiArray < T , D > > 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":"public inline fun < T , D : Dimension > MultiArray < T , D > . partition ( predicate : ( T ) -> Boolean ) : Pair < NDArray < T , D1 > , NDArray < T , D1 > >","body":"{ val first = ArrayList < T > ( ) val second = ArrayList < T > ( ) for ( element in this ) { if ( predicate ( element ) ) { first . add ( element ) } else { second . add ( element ) } } val dtype = DataType . of ( first . first ( ) ) return Pair ( first . toCommonNDArray ( dtype ) , second . toCommonNDArray ( dtype ) ) }","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 */"} {"signature":"public fun < T , D : Dimension > MultiArray < T , D > . windowed ( size : Int , step : Int = , limit : Boolean = true ) : NDArray < T , D2 >","body":"{ require ( size > && step > ) { if ( size != step ) \"\" else \"\" } val thisSize = this . size val rSize = min ( thisSize , size ) val rStep = min ( thisSize , step ) val resultCapacity = when { limit -> thisSize / rStep * rSize thisSize % rStep == -> thisSize / rStep * rSize else -> ( thisSize / rStep + ) * rSize } val resData = initMemoryView < T > ( resultCapacity , this . dtype ) val thisNDArray = this . flatten ( ) var index = var resIndex = while ( index in until thisSize ) { for ( i in until rSize ) { if ( i + index >= thisSize ) { resIndex ++ continue } resData [ resIndex ++ ] = thisNDArray [ i + index ] } index += rStep } return D2Array ( resData , , intArrayOf ( resultCapacity / rSize , rSize ) , dim = D2 ) }","docstring":"/**\n * Returns a 2-D ndarray of window segments of the specified size, sliding over this ndarray with the specified step.\n *\n * The last few arrays are filled with zeros if limit is false.\n * The [size] and [step] must be positive and can be greater than the number of elements in this ndarray.\n *\n * @param size the size and step must be positive and can be greater than the number of elements in this array\n * @param step the number of elements to move the window forward by on an each step, by default 1\n * @param limit sets a limit on the set of significant elements in the result, otherwise it fills in with zeros\n */"} {"signature":"public inline fun < S , D : Dimension , T : S > MultiArray < T , D > . 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 to current accumulator value and each element.\n */"} {"signature":"@ JvmName ( \"\" ) public inline fun < S , T : S > MultiArray < T , D1 > . 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 * @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":"@ JvmName ( \"\" ) public inline fun < S , D : Dimension , T : S > MultiArray < T , D > . reduceMultiIndexed ( operation : ( index : IntArray , acc : S , T ) -> S ) : S","body":"{ val iterator = this . iterator ( ) if ( ! iterator . hasNext ( ) ) throw UnsupportedOperationException ( \"\" ) val indexIter = this . multiIndices . iterator ( ) var accumulator : S = iterator . next ( ) while ( iterator . hasNext ( ) && indexIter . hasNext ( ) ) { accumulator = operation ( indexIter . next ( ) , 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 * @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 < S , D : Dimension , T : S > MultiArray < T , D > . 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 to current accumulator value and each element. Returns null if the collection is empty.\n */"} {"signature":"public fun < T , D : Dimension > MultiArray < T , D > . reversed ( ) : NDArray < T , D >","body":"{ if ( size <= ) return this . copy ( ) as NDArray < T , D > val data = initMemoryView < T > ( this . size , this . dtype ) var index = this . size - for ( element in this ) data [ index -- ] = element return NDArray ( data , , this . shape . copyOf ( ) , dim = this . dim ) }","docstring":"/**\n *\n */"} {"signature":"public inline fun < T , D : Dimension , reified R : Any > MultiArray < T , D > . scan ( initial : R , operation : ( acc : R , T ) -> R ) : NDArray < R , D >","body":"{ val dataType = DataType . ofKClass ( R :: class ) val data = initMemoryView < R > ( this . size + , dataType ) data [ ] = initial var index = var accumulator = initial for ( element in this ) { accumulator = operation ( accumulator , element ) data [ index ++ ] = accumulator } return NDArray ( data , , this . shape . copyOf ( ) , dim = this . dim ) }","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 ndarray.\n *\n * @param [operation] function that takes current accumulator value and an element, and calculates the next accumulator value.\n */"} {"signature":"@ JvmName ( \"\" ) @ Suppress ( \"\" ) public inline fun < T , reified R : Any > MultiArray < T , D1 > . scanIndexed ( initial : R , operation : ( index : Int , acc : R , T ) -> R ) : D1Array < R >","body":"{ val dataType = DataType . ofKClass ( R :: class ) val data = initMemoryView < R > ( this . size + , dataType ) data [ ] = initial var count = var accumulator = initial val ndarrayIter = this . iterator ( ) while ( ndarrayIter . hasNext ( ) ) { accumulator = operation ( count , accumulator , ndarrayIter . next ( ) ) data [ count ++ ] = accumulator } return D1Array ( data , , this . shape . copyOf ( ) , dim = D1 ) }","docstring":"/**\n * Return a flat ndarray containing successive accumulation values generated by applying [operation] from left to right to\n * each element, its index in this d1 ndarray and current accumulator value that starts with [initial] value.\n */"} {"signature":"@ Suppress ( \"\" ) public inline fun < T , D : Dimension , reified R : Any > MultiArray < T , D > . scanMultiIndexed ( initial : R , operation : ( index : IntArray , acc : R , T ) -> R ) : NDArray < R , D >","body":"{ val dataType = DataType . ofKClass ( R :: class ) val data = initMemoryView < R > ( this . size + , dataType ) data [ ] = initial var count = var accumulator = initial val ndarrayIter = this . iterator ( ) val indexIter = this . multiIndices . iterator ( ) while ( ndarrayIter . hasNext ( ) && indexIter . hasNext ( ) ) { accumulator = operation ( indexIter . next ( ) , accumulator , ndarrayIter . next ( ) ) data [ count ++ ] = accumulator } return NDArray ( data , , this . shape . copyOf ( ) , dim = this . dim ) }","docstring":"/**\n * Return a flat ndarray containing successive accumulation values generated by applying [operation] from left to right to\n * each element, its multi index in this dn ndarray and current accumulator value that starts with [initial] value.\n */"} {"signature":"public fun < T : Number , D : Dimension > MultiArray < T , D > . sorted ( ) : NDArray < T , D >","body":"{ val ret = this . deepCopy ( ) as NDArray < T , D > when ( this . dtype ) { DataType . ByteDataType -> ret . data . getByteArray ( ) . sort ( ) DataType . ShortDataType -> ret . data . getShortArray ( ) . sort ( ) DataType . IntDataType -> ret . data . getIntArray ( ) . sort ( ) DataType . LongDataType -> ret . data . getLongArray ( ) . sort ( ) DataType . FloatDataType -> ret . data . getFloatArray ( ) . sort ( ) DataType . DoubleDataType -> ret . data . getDoubleArray ( ) . sort ( ) DataType . ComplexFloatDataType , DataType . ComplexDoubleDataType -> throw Exception ( \"\" ) } return ret }","docstring":"/**\n *\n */"} {"signature":"public fun < T : Number , D : Dimension > MultiArray < T , D > . sum ( ) : T","body":"= mk . math . sum ( this )","docstring":"/**\n * Returns the sum of all elements in the collection.\n */"} {"signature":"public inline fun < T : Number , D : Dimension > MultiArray < T , D > . sumBy ( selector : ( T ) -> Int ) : Int","body":"{ var sum = 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 inline fun < T : Number , D : Dimension > MultiArray < T , D > . sumBy ( selector : ( T ) -> Double ) : Double","body":"{ var sum = 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 inline fun < T , D : Dimension > MultiArray < T , D > . sumBy ( selector : ( T ) -> ComplexFloat ) : ComplexFloat","body":"{ var sum = ComplexFloat . zero 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 inline fun < T , D : Dimension > MultiArray < T , D > . sumBy ( selector : ( T ) -> ComplexDouble ) : ComplexDouble","body":"{ var sum = ComplexDouble . zero 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 , D : Dimension , C : MutableCollection < in T > > MultiArray < T , D > . 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 , D : Dimension > MultiArray < T , D > . toHashSet ( ) : HashSet < T >","body":"{ return toCollection ( HashSet ( mapCapacity ( size ) ) ) }","docstring":"/**\n * Returns a [HashSet] of all elements.\n */"} {"signature":"public fun < T , D : Dimension > MultiArray < T , D > . toList ( ) : List < T >","body":"{ return when ( size ) { -> emptyList ( ) -> listOf ( this . first ( ) ) else -> this . toMutableList ( ) } }","docstring":"/**\n * Returns a [List] containing all elements.\n */"} {"signature":"public fun < T > MultiArray < T , D2 > . toListD2 ( ) : List < List < T > >","body":"= List ( shape [ ] ) { i -> List ( shape [ ] ) { j -> this [ i , j ] } }","docstring":"/**\n * Returns a List> containing all elements.\n */"} {"signature":"public fun < T > MultiArray < T , D3 > . toListD3 ( ) : List < List < List < T > > >","body":"= List ( shape [ ] ) { i -> List ( shape [ ] ) { j -> List ( shape [ ] ) { k -> this [ i , j , k ] } } }","docstring":"/**\n * Returns a List>> containing all elements.\n */"} {"signature":"public fun < T > MultiArray < T , D4 > . toListD4 ( ) : List < List < List < List < T > > > >","body":"= List ( shape [ ] ) { i -> List ( shape [ ] ) { j -> List ( shape [ ] ) { k -> List ( shape [ ] ) { l -> this [ i , j , k , l ] } } } }","docstring":"/**\n * Returns a List>>> containing all elements.\n */"} {"signature":"public fun < T , D : Dimension > MultiArray < T , D > . toMutableList ( ) : MutableList < T >","body":"{ return toCollection ( ArrayList ( ) ) }","docstring":"/**\n * Returns a [MutableList] filled with all elements of this collection.\n */"} {"signature":"public fun < T , D : Dimension > MultiArray < T , D > . toMutableSet ( ) : MutableSet < T >","body":"{ return toCollection ( LinkedHashSet ( ) ) }","docstring":"/**\n * Returns a mutable set 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 fun < T , D : Dimension > MultiArray < T , D > . toSet ( ) : Set < T >","body":"{ return when ( size ) { -> emptySet ( ) -> setOf ( this . first ( ) ) else -> toCollection ( LinkedHashSet ( mapCapacity ( size ) ) ) } }","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 , reified O : Any , D : Dimension > MultiArray < T , D > . toType ( copy : CopyStrategy = CopyStrategy . FULL ) : NDArray < O , D >","body":"{ val dtype = DataType . ofKClass ( O :: class ) return this . toType ( dtype , copy ) }","docstring":"/**\n *\n */"} {"signature":"public fun < T , O : Any , D : Dimension > MultiArray < T , D > . toType ( dtype : DataType , copy : CopyStrategy = CopyStrategy . FULL ) : NDArray < O , D >","body":"{ if ( this . dtype == dtype ) { return ( if ( copy == CopyStrategy . FULL ) this . copy ( ) else this . deepCopy ( ) ) as NDArray < O , D > } val size : Int val iterData : Iterator < T > val offset : Int val strides : IntArray if ( copy == CopyStrategy . FULL ) { size = this . data . size iterData = this . data . iterator ( ) offset = this . offset strides = this . strides . copyOf ( ) } else { size = this . size iterData = this . iterator ( ) offset = strides = computeStrides ( this . shape ) } val isNumber = this . dtype . isNumber ( ) val view = initMemoryView < O > ( size , dtype ) when { isNumber && dtype == DataType . FloatDataType -> { val d = view . getFloatArray ( ) var count = ( iterData as Iterator < Number > ) . apply { while ( hasNext ( ) ) { d [ count ++ ] = next ( ) . toFloat ( ) } } } isNumber && dtype == DataType . DoubleDataType -> { val d = view . getDoubleArray ( ) var count = ( iterData as Iterator < Number > ) . apply { while ( hasNext ( ) ) { d [ count ++ ] = next ( ) . toDouble ( ) } } } isNumber && dtype == DataType . IntDataType -> { val d = view . getIntArray ( ) var count = ( iterData as Iterator < Number > ) . apply { while ( hasNext ( ) ) { d [ count ++ ] = next ( ) . toInt ( ) } } } isNumber && dtype == DataType . LongDataType -> { val d = view . getLongArray ( ) var count = ( iterData as Iterator < Number > ) . apply { while ( hasNext ( ) ) { d [ count ++ ] = next ( ) . toLong ( ) } } } ! isNumber && dtype == DataType . ComplexFloatDataType -> { val d = view . getComplexFloatArray ( ) var count = ( iterData as Iterator < ComplexDouble > ) . apply { while ( hasNext ( ) ) { val c = next ( ) d [ count ++ ] = ComplexFloat ( c . re , c . im ) } } } ! isNumber && dtype == DataType . ComplexDoubleDataType -> { val d = view . getComplexDoubleArray ( ) var count = ( iterData as Iterator < ComplexFloat > ) . apply { while ( hasNext ( ) ) { val c = next ( ) d [ count ++ ] = ComplexDouble ( c . re , c . im ) } } } isNumber && dtype == DataType . ComplexFloatDataType -> { val d = view . getComplexFloatArray ( ) var count = ( iterData as Iterator < Number > ) . apply { while ( hasNext ( ) ) { d [ count ++ ] = ComplexFloat ( next ( ) , ) } } } isNumber && dtype == DataType . ComplexDoubleDataType -> { val d = view . getComplexDoubleArray ( ) var count = ( iterData as Iterator < Number > ) . apply { while ( hasNext ( ) ) { d [ count ++ ] = ComplexDouble ( next ( ) , ) } } } isNumber && dtype == DataType . ShortDataType -> { val d = view . getShortArray ( ) var count = ( iterData as Iterator < Number > ) . apply { while ( hasNext ( ) ) { d [ count ++ ] = next ( ) . toShort ( ) } } } isNumber && dtype == DataType . ByteDataType -> { val d = view . getByteArray ( ) var count = ( iterData as Iterator < Number > ) . apply { while ( hasNext ( ) ) { d [ count ++ ] = next ( ) . toByte ( ) } } } else -> throw Exception ( ) } return NDArray ( view , offset , this . shape . copyOf ( ) , strides , this . dim ) }","docstring":"/**\n *\n */"} {"signature":"@ HtmlTagMarker inline fun AUDIO . source ( classes : String ? = null , crossinline block : SOURCE . ( ) -> Unit = { } ) : Unit","body":"= SOURCE ( attributesMapOf ( \"\" , classes ) , consumer ) . visit ( block )","docstring":"/**\n * Media source for \n */"} {"signature":"private suspend fun processLevel ( towerLevel : TowerScopeLevel , callInfo : CallInfo , group : TowerGroup , explicitReceiverKind : ExplicitReceiverKind ) : Boolean","body":"{ val finalGroup = interceptTowerGroup ( group ) manager . requestGroup ( finalGroup ) val result = handler . handleLevel ( collector , candidateFactory , callInfo , explicitReceiverKind , finalGroup , towerLevel ) if ( collector . isSuccess ) onSuccessfulLevel ( finalGroup ) return result == ProcessResult . SCOPE_EMPTY }","docstring":"/**\n * @return true if level is empty\n */"} {"signature":"public fun String . deserializeJson ( className : String ? = null ) : DeserializeThis","body":"{ return DeserializeThis ( jsonString = this , className = className ) }","docstring":"/**\n * Variables with values returned by this function get replaced by deserialized value **in the next cell**.\n * [className] is a simple name of the class to be generated that [jsonString] will be deserialized into.\n *\n * Usage:\n * ```kotlin\n * val user = \"\"\"{\"address\":{\"street\",\"Baker Street\",\"number\":\"221B\"}}\"\"\".deserializeJson()\n * // IN THE NEXT CELL:\n * println(user.address.number + \" \" + user.address.street)\n * ```\n */"} {"signature":"internal suspend fun Project . createCInteropMetadataDependencyClasspath ( sourceSet : DefaultKotlinSourceSet , forIde : Boolean ) : FileCollection","body":"{ val dependencyTransformationTask = if ( forIde ) locateOrRegisterCInteropMetadataDependencyTransformationTaskForIde ( sourceSet ) else locateOrRegisterCInteropMetadataDependencyTransformationTask ( sourceSet ) if ( dependencyTransformationTask == null ) return project . files ( ) val dependencyTransformationTaskOutputs = project . files ( dependencyTransformationTask . map { it . outputLibraryFiles } ) return dependencyTransformationTaskOutputs + createCInteropMetadataDependencyClasspathFromAssociatedCompilations ( sourceSet , forIde ) + createCommonizedCInteropDependencyConfigurationView ( sourceSet ) }","docstring":"/**\n * @param forIde: A different task for dependency transformation will be used. This task will not use the regular 'build' directory\n * as transformation output to ensure IDE still being able to resolve the dependencies even when the project is cleaned.\n */"} {"signature":"private fun cleanUpWeakMap ( )","body":"{ val size = jsonToCache . size if ( size <= ) return if ( Random . nextInt ( , size ) == ) { val iter = jsonToCache . iterator ( ) while ( iter . hasNext ( ) ) { if ( iter . next ( ) . key . isDead ) iter . remove ( ) } } }","docstring":"/**\n * To maintain O(1) access, we cleanup the table from dead references with 1/size probability\n */"} {"signature":"private fun ConstraintSystemCompletionContext . tryToCompleteWithPCLA ( completionMode : ConstraintSystemCompletionMode , postponedArguments : List < PostponedResolvedAtom > , analyzer : PostponedAtomAnalyzer , ) : Boolean","body":"{ if ( ! completionMode . allLambdasShouldBeAnalyzed ) return false val lambdaArguments = postponedArguments . filterIsInstance < ResolvedLambdaAtom > ( ) . takeIf { it . isNotEmpty ( ) } ? : return false var anyAnalyzed = false for ( argument in lambdaArguments ) { val notFixedInputTypeVariables = argument . inputTypes . flatMap { it . extractTypeVariables ( ) } . filter { it !in fixedTypeVariables } if ( notFixedInputTypeVariables . isEmpty ( ) ) continue analyzer . analyze ( argument , withPCLASession = true ) anyAnalyzed = true } return anyAnalyzed }","docstring":"/**\n * General documentation for builder inference algorithm is located at `/docs/fir/builder_inference.md`\n *\n * This function checks if any of the postponed arguments are suitable for builder inference, and performs it for all eligible lambda arguments\n * @return true if we got new proper constraints after builder inference\n */"} {"signature":"internal open fun shouldKeepTypeVariableBasedType ( marker : TypeVariableTypeConstructorMarker , isK2 : Boolean ) : Boolean","body":"= false","docstring":"/**\n * This function determines the approximator behavior if a type variable based type is encountered.\n *\n * @param marker type variable encountered\n * @param isK2 true for K2 compiler, false for K1 compiler\n * @return true if the type variable based type should be kept, false if it should be approximated\n */"} {"signature":"public fun clear ( )","body":"{ pointer = null }","docstring":"/**\n * Clears reference to an object.\n */"} {"signature":"@ Suppress ( \"\" ) public fun get ( ) : T ?","body":"= pointer ? . get ( ) as T ?","docstring":"/**\n * Returns either reference to an object or null, if it was collected.\n */"} {"signature":"private fun transformToNativeIr ( module : TestModule , inputArtifact : ClassicFrontendOutputArtifact ) : IrBackendInput","body":"{ val ( psiFiles , analysisResult , project , _ ) = inputArtifact val configuration = testServices . compilerConfigurationProvider . getCompilerConfiguration ( module ) val sourceFiles : List < KtFile > = psiFiles . values . toList ( ) val translator = Psi2IrTranslator ( configuration . languageVersionSettings , Psi2IrConfiguration ( ignoreErrors = CodegenTestDirectives . IGNORE_ERRORS in module . directives , configuration . partialLinkageConfig . isEnabled ) , configuration . irMessageLogger :: checkNoUnboundSymbols ) val manglerDesc = KonanManglerDesc val konanIdSignaturerClass = kotlinNativeClass ( \"\" ) val konanIdSignaturerConstructor = konanIdSignaturerClass . constructors . single ( ) val konanIdSignaturerClassInstance = konanIdSignaturerConstructor . call ( manglerDesc ) as IdSignatureComposer val symbolTable = SymbolTable ( konanIdSignaturerClassInstance , IrFactoryImpl ) val generatorContext = translator . createGeneratorContext ( analysisResult . moduleDescriptor , analysisResult . bindingContext , symbolTable ) val konanStubGeneratorExtensionsClass = kotlinNativeClass ( \"\" ) val stubGenerator = DeclarationStubGeneratorImpl ( analysisResult . moduleDescriptor , symbolTable , generatorContext . irBuiltIns , DescriptorByIdSignatureFinderImpl ( analysisResult . moduleDescriptor , manglerDesc ) , konanStubGeneratorExtensionsClass . objectInstance as StubGeneratorExtensions ) . apply { unboundSymbolGeneration = true } val irDeserializer = object : IrDeserializer { override fun getDeclaration ( symbol : IrSymbol ) = stubGenerator . getDeclaration ( symbol ) override fun resolveBySignatureInModule ( signature : IdSignature , kind : IrDeserializer . TopLevelSymbolKind , moduleName : Name ) : Nothing = shouldNotBeCalled ( ) override fun postProcess ( inOrAfterLinkageStep : Boolean ) = Unit } val pluginExtensions = IrGenerationExtension . getInstances ( project ) val moduleFragment = translator . generateModuleFragment ( generatorContext , sourceFiles , irProviders = listOf ( irDeserializer ) , linkerExtensions = pluginExtensions , ) val pluginContext = IrPluginContextImpl ( generatorContext . moduleDescriptor , generatorContext . bindingContext , generatorContext . languageVersionSettings , generatorContext . symbolTable , generatorContext . typeTranslator , generatorContext . irBuiltIns , linker = irDeserializer , diagnosticReporter = configuration . irMessageLogger ) return IrBackendInput . NativeBackendInput ( moduleFragment , pluginContext , diagnosticReporter = DiagnosticReporterFactory . createReporter ( ) , descriptorMangler = ( pluginContext . symbolTable as SymbolTable ) . signaturer ! ! . mangler , irMangler = KonanManglerIr , firMangler = null , metadataSerializer = null ) }","docstring":"/**\n * Mostly mimics [org.jetbrains.kotlin.backend.konan.psiToIr], since direct call is impossible due to:\n * - prohibited import of module `:kotlin-native:backend.native` here to `:native:native.tests`\n * - invocation via reflection is complicated due to moving [com.intellij.openapi.project.Project] to another subpackage during compiler\n * JAR embedding.\n *\n * It's unlikely that [org.jetbrains.kotlin.backend.konan.psiToIr] would be ever significantly changed before reaching its end-of-life,\n * so it's plausible to have a reduced copy here in the test pipeline.\n */"} {"signature":"private fun getSinceKotlinVersionByOverridden ( descriptor : CallableMemberDescriptor ) : SinceKotlinValue ?","body":"{ return DescriptorUtils . getAllOverriddenDeclarations ( descriptor ) . map { it . getOwnSinceKotlinVersion ( ) ? : return null } . minByOrNull { it . apiVersion } }","docstring":"/**\n * @return null if there are no overridden members or if there's at least one declaration in the hierarchy not annotated with [SinceKotlin],\n * or the minimal value of the version from all declarations annotated with [SinceKotlin] otherwise.\n */"} {"signature":"private fun DeclarationDescriptor . getOwnSinceKotlinVersion ( ) : SinceKotlinValue ?","body":"{ var result : SinceKotlinValue ? = null fun DeclarationDescriptor . consider ( ) { val apiVersion = ( annotations . findAnnotation ( SINCE_KOTLIN_FQ_NAME ) ? . allValueArguments ? . values ? . singleOrNull ( ) ? . value as? String ) ? . let ( ApiVersion . Companion :: parse ) if ( apiVersion != null ) { if ( result == null || apiVersion > result ! ! . apiVersion ) { result = SinceKotlinValue ( apiVersion , loadWasExperimentalMarkerClasses ( ) ) } } } this . consider ( ) ( this as? ConstructorDescriptor ) ? . containingDeclaration ? . consider ( ) ( this as? PropertyAccessorDescriptor ) ? . correspondingProperty ? . consider ( ) val typeAlias = this as? TypeAliasDescriptor ? : ( this as? TypeAliasConstructorDescriptor ) ? . typeAliasDescriptor ? : ( this as? FakeCallableDescriptorForTypeAliasObject ) ? . typeAliasDescriptor typeAlias ? . consider ( ) typeAlias ? . classDescriptor ? . consider ( ) ( this as? TypeAliasConstructorDescriptor ) ? . underlyingConstructorDescriptor ? . consider ( ) ( this as? FakeCallableDescriptorForTypeAliasObject ) ? . getReferencedObject ( ) ? . consider ( ) return result }","docstring":"/**\n * @return the maximal value of API version required by the declaration or any of its \"associated\" declarations (class for constructor,\n * property for accessor, underlying class for type alias) along with experimental marker FQ names mentioned in the @WasExperimental\n */"} {"signature":"public operator fun get ( index : Int ) : UShort","body":"= storage [ index ] . toUShort ( )","docstring":"/**\n * Returns the array element at the given [index]. This method can be called using the index operator.\n *\n * If the [index] is out of bounds of this array, throws an [IndexOutOfBoundsException] except in Kotlin/JS\n * where the behavior is unspecified.\n */"} {"signature":"public operator fun set ( index : Int , value : UShort )","body":"{ storage [ index ] = value . toShort ( ) }","docstring":"/**\n * Sets the element at the given [index] to the given [value]. This method can be called using the index operator.\n *\n * If the [index] is out of bounds of this array, throws an [IndexOutOfBoundsException] except in Kotlin/JS\n * where the behavior is unspecified.\n */"} {"signature":"public override operator fun iterator ( ) : kotlin . collections . Iterator < UShort >","body":"= Iterator ( storage )","docstring":"/** Creates an iterator over the elements of the array. */"} {"signature":"@ SinceKotlin ( \"\" ) @ ExperimentalUnsignedTypes @ kotlin . internal . InlineOnly public inline fun UShortArray ( size : Int , init : ( Int ) -> UShort ) : UShortArray","body":"{ return UShortArray ( ShortArray ( size ) { index -> init ( index ) . toShort ( ) } ) }","docstring":"/**\n * Creates a new array of the specified [size], where each element is calculated by calling the specified\n * [init] function.\n *\n * The function [init] is called for each array element sequentially starting from the first one.\n * It should return the value for an array element given its index.\n */"} {"signature":"public operator fun IntArray . rangeTo ( other : IntArray ) : MultiIndexProgression","body":"{ return MultiIndexProgression ( this , other ) }","docstring":"/**\n * Returns a multidimensional index based on given arrays.\n */"} {"signature":"public infix fun MultiIndexProgression . step ( step : Int ) : MultiIndexProgression","body":"{ return MultiIndexProgression ( first , last , step ) }","docstring":"/**\n * Returns a multidimensional index with a given [step].\n */"} {"signature":"public infix fun IntArray . downTo ( to : IntArray ) : MultiIndexProgression","body":"{ return MultiIndexProgression ( this , to , - ) }","docstring":"/**\n * Returns multidimensional index from highest to lowest in the step of -1.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ ExperimentalUnsignedTypes @ kotlin . internal . InlineOnly public actual inline fun UIntArray . elementAt ( index : Int ) : UInt","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 array.\n * \n * @sample samples.collections.Collections.Elements.elementAt\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ ExperimentalUnsignedTypes @ kotlin . internal . InlineOnly public actual inline fun ULongArray . elementAt ( index : Int ) : ULong","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 array.\n * \n * @sample samples.collections.Collections.Elements.elementAt\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ ExperimentalUnsignedTypes @ kotlin . internal . InlineOnly public actual inline fun UByteArray . elementAt ( index : Int ) : UByte","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 array.\n * \n * @sample samples.collections.Collections.Elements.elementAt\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ ExperimentalUnsignedTypes @ kotlin . internal . InlineOnly public actual inline fun UShortArray . elementAt ( index : Int ) : UShort","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 array.\n * \n * @sample samples.collections.Collections.Elements.elementAt\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ ExperimentalUnsignedTypes public actual fun UIntArray . asList ( ) : List < UInt >","body":"{ return object : AbstractList < UInt > ( ) , RandomAccess { override val size : Int get ( ) = this@asList . size override fun isEmpty ( ) : Boolean = this@asList . isEmpty ( ) override fun contains ( element : UInt ) : Boolean = this@asList . contains ( element ) override fun get ( index : Int ) : UInt = this@asList [ index ] override fun indexOf ( element : UInt ) : Int = this@asList . indexOf ( element ) override fun lastIndexOf ( element : UInt ) : Int = this@asList . lastIndexOf ( element ) } }","docstring":"/**\n * Returns a [List] that wraps the original array.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ ExperimentalUnsignedTypes public actual fun ULongArray . asList ( ) : List < ULong >","body":"{ return object : AbstractList < ULong > ( ) , RandomAccess { override val size : Int get ( ) = this@asList . size override fun isEmpty ( ) : Boolean = this@asList . isEmpty ( ) override fun contains ( element : ULong ) : Boolean = this@asList . contains ( element ) override fun get ( index : Int ) : ULong = this@asList [ index ] override fun indexOf ( element : ULong ) : Int = this@asList . indexOf ( element ) override fun lastIndexOf ( element : ULong ) : Int = this@asList . lastIndexOf ( element ) } }","docstring":"/**\n * Returns a [List] that wraps the original array.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ ExperimentalUnsignedTypes public actual fun UByteArray . asList ( ) : List < UByte >","body":"{ return object : AbstractList < UByte > ( ) , RandomAccess { override val size : Int get ( ) = this@asList . size override fun isEmpty ( ) : Boolean = this@asList . isEmpty ( ) override fun contains ( element : UByte ) : Boolean = this@asList . contains ( element ) override fun get ( index : Int ) : UByte = this@asList [ index ] override fun indexOf ( element : UByte ) : Int = this@asList . indexOf ( element ) override fun lastIndexOf ( element : UByte ) : Int = this@asList . lastIndexOf ( element ) } }","docstring":"/**\n * Returns a [List] that wraps the original array.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ ExperimentalUnsignedTypes public actual fun UShortArray . asList ( ) : List < UShort >","body":"{ return object : AbstractList < UShort > ( ) , RandomAccess { override val size : Int get ( ) = this@asList . size override fun isEmpty ( ) : Boolean = this@asList . isEmpty ( ) override fun contains ( element : UShort ) : Boolean = this@asList . contains ( element ) override fun get ( index : Int ) : UShort = this@asList [ index ] override fun indexOf ( element : UShort ) : Int = this@asList . indexOf ( element ) override fun lastIndexOf ( element : UShort ) : Int = this@asList . lastIndexOf ( element ) } }","docstring":"/**\n * Returns a [List] that wraps the original array.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ ExperimentalUnsignedTypes public fun UIntArray . binarySearch ( element : UInt , fromIndex : Int = , toIndex : Int = size ) : Int","body":"{ AbstractList . checkRangeIndexes ( fromIndex , toIndex , size ) val signedElement = element . toInt ( ) var low = fromIndex var high = toIndex - while ( low <= high ) { val mid = ( low + high ) . ushr ( ) val midVal = storage [ mid ] val cmp = uintCompare ( midVal , signedElement ) if ( cmp < ) low = mid + else if ( cmp > ) high = mid - else return mid } return - ( low + ) }","docstring":"/**\n * Searches the array or the range of the array for the provided [element] using the binary search algorithm.\n * The array is expected to be sorted, otherwise the result is undefined.\n * \n * If the array contains multiple elements equal to the specified [element], there is no guarantee which one will be found.\n * \n * @param element the to search for.\n * @param fromIndex the start of the range (inclusive) to search in, 0 by default.\n * @param toIndex the end of the range (exclusive) to search in, size of this array by default.\n * \n * @return the index of the element, if it is contained in the array within the specified range;\n * otherwise, the inverted insertion point `(-insertion point - 1)`.\n * The insertion point is defined as the index at which the element should be inserted,\n * so that the array (or the specified subrange of array) still remains sorted.\n * \n * @throws IndexOutOfBoundsException if [fromIndex] is less than zero or [toIndex] is greater than the size of this array.\n * @throws IllegalArgumentException if [fromIndex] is greater than [toIndex].\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ ExperimentalUnsignedTypes public fun ULongArray . binarySearch ( element : ULong , fromIndex : Int = , toIndex : Int = size ) : Int","body":"{ AbstractList . checkRangeIndexes ( fromIndex , toIndex , size ) val signedElement = element . toLong ( ) var low = fromIndex var high = toIndex - while ( low <= high ) { val mid = ( low + high ) . ushr ( ) val midVal = storage [ mid ] val cmp = ulongCompare ( midVal , signedElement ) if ( cmp < ) low = mid + else if ( cmp > ) high = mid - else return mid } return - ( low + ) }","docstring":"/**\n * Searches the array or the range of the array for the provided [element] using the binary search algorithm.\n * The array is expected to be sorted, otherwise the result is undefined.\n * \n * If the array contains multiple elements equal to the specified [element], there is no guarantee which one will be found.\n * \n * @param element the to search for.\n * @param fromIndex the start of the range (inclusive) to search in, 0 by default.\n * @param toIndex the end of the range (exclusive) to search in, size of this array by default.\n * \n * @return the index of the element, if it is contained in the array within the specified range;\n * otherwise, the inverted insertion point `(-insertion point - 1)`.\n * The insertion point is defined as the index at which the element should be inserted,\n * so that the array (or the specified subrange of array) still remains sorted.\n * \n * @throws IndexOutOfBoundsException if [fromIndex] is less than zero or [toIndex] is greater than the size of this array.\n * @throws IllegalArgumentException if [fromIndex] is greater than [toIndex].\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ ExperimentalUnsignedTypes public fun UByteArray . binarySearch ( element : UByte , fromIndex : Int = , toIndex : Int = size ) : Int","body":"{ AbstractList . checkRangeIndexes ( fromIndex , toIndex , size ) val signedElement = element . toInt ( ) var low = fromIndex var high = toIndex - while ( low <= high ) { val mid = ( low + high ) . ushr ( ) val midVal = storage [ mid ] val cmp = uintCompare ( midVal . toInt ( ) , signedElement ) if ( cmp < ) low = mid + else if ( cmp > ) high = mid - else return mid } return - ( low + ) }","docstring":"/**\n * Searches the array or the range of the array for the provided [element] using the binary search algorithm.\n * The array is expected to be sorted, otherwise the result is undefined.\n * \n * If the array contains multiple elements equal to the specified [element], there is no guarantee which one will be found.\n * \n * @param element the to search for.\n * @param fromIndex the start of the range (inclusive) to search in, 0 by default.\n * @param toIndex the end of the range (exclusive) to search in, size of this array by default.\n * \n * @return the index of the element, if it is contained in the array within the specified range;\n * otherwise, the inverted insertion point `(-insertion point - 1)`.\n * The insertion point is defined as the index at which the element should be inserted,\n * so that the array (or the specified subrange of array) still remains sorted.\n * \n * @throws IndexOutOfBoundsException if [fromIndex] is less than zero or [toIndex] is greater than the size of this array.\n * @throws IllegalArgumentException if [fromIndex] is greater than [toIndex].\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ ExperimentalUnsignedTypes public fun UShortArray . binarySearch ( element : UShort , fromIndex : Int = , toIndex : Int = size ) : Int","body":"{ AbstractList . checkRangeIndexes ( fromIndex , toIndex , size ) val signedElement = element . toInt ( ) var low = fromIndex var high = toIndex - while ( low <= high ) { val mid = ( low + high ) . ushr ( ) val midVal = storage [ mid ] val cmp = uintCompare ( midVal . toInt ( ) , signedElement ) if ( cmp < ) low = mid + else if ( cmp > ) high = mid - else return mid } return - ( low + ) }","docstring":"/**\n * Searches the array or the range of the array for the provided [element] using the binary search algorithm.\n * The array is expected to be sorted, otherwise the result is undefined.\n * \n * If the array contains multiple elements equal to the specified [element], there is no guarantee which one will be found.\n * \n * @param element the to search for.\n * @param fromIndex the start of the range (inclusive) to search in, 0 by default.\n * @param toIndex the end of the range (exclusive) to search in, size of this array by default.\n * \n * @return the index of the element, if it is contained in the array within the specified range;\n * otherwise, the inverted insertion point `(-insertion point - 1)`.\n * The insertion point is defined as the index at which the element should be inserted,\n * so that the array (or the specified subrange of array) still remains sorted.\n * \n * @throws IndexOutOfBoundsException if [fromIndex] is less than zero or [toIndex] is greater than the size of this array.\n * @throws IllegalArgumentException if [fromIndex] is greater than [toIndex].\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ OptIn ( kotlin . experimental . ExperimentalTypeInference :: class ) @ OverloadResolutionByLambdaReturnType @ Suppress ( \"\" ) @ kotlin . jvm . JvmName ( \"\" ) @ ExperimentalUnsignedTypes @ kotlin . internal . InlineOnly public inline fun UIntArray . sumOf ( selector : ( UInt ) -> 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 array.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ OptIn ( kotlin . experimental . ExperimentalTypeInference :: class ) @ OverloadResolutionByLambdaReturnType @ Suppress ( \"\" ) @ kotlin . jvm . JvmName ( \"\" ) @ ExperimentalUnsignedTypes @ kotlin . internal . InlineOnly public inline fun ULongArray . sumOf ( selector : ( ULong ) -> 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 array.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ OptIn ( kotlin . experimental . ExperimentalTypeInference :: class ) @ OverloadResolutionByLambdaReturnType @ Suppress ( \"\" ) @ kotlin . jvm . JvmName ( \"\" ) @ ExperimentalUnsignedTypes @ kotlin . internal . InlineOnly public inline fun UByteArray . sumOf ( selector : ( UByte ) -> 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 array.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ OptIn ( kotlin . experimental . ExperimentalTypeInference :: class ) @ OverloadResolutionByLambdaReturnType @ Suppress ( \"\" ) @ kotlin . jvm . JvmName ( \"\" ) @ ExperimentalUnsignedTypes @ kotlin . internal . InlineOnly public inline fun UShortArray . sumOf ( selector : ( UShort ) -> 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 array.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ OptIn ( kotlin . experimental . ExperimentalTypeInference :: class ) @ OverloadResolutionByLambdaReturnType @ Suppress ( \"\" ) @ kotlin . jvm . JvmName ( \"\" ) @ ExperimentalUnsignedTypes @ kotlin . internal . InlineOnly public inline fun UIntArray . sumOf ( selector : ( UInt ) -> 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 array.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ OptIn ( kotlin . experimental . ExperimentalTypeInference :: class ) @ OverloadResolutionByLambdaReturnType @ Suppress ( \"\" ) @ kotlin . jvm . JvmName ( \"\" ) @ ExperimentalUnsignedTypes @ kotlin . internal . InlineOnly public inline fun ULongArray . sumOf ( selector : ( ULong ) -> 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 array.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ OptIn ( kotlin . experimental . ExperimentalTypeInference :: class ) @ OverloadResolutionByLambdaReturnType @ Suppress ( \"\" ) @ kotlin . jvm . JvmName ( \"\" ) @ ExperimentalUnsignedTypes @ kotlin . internal . InlineOnly public inline fun UByteArray . sumOf ( selector : ( UByte ) -> 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 array.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ OptIn ( kotlin . experimental . ExperimentalTypeInference :: class ) @ OverloadResolutionByLambdaReturnType @ Suppress ( \"\" ) @ kotlin . jvm . JvmName ( \"\" ) @ ExperimentalUnsignedTypes @ kotlin . internal . InlineOnly public inline fun UShortArray . sumOf ( selector : ( UShort ) -> 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 array.\n */"} {"signature":"fun formatter ( ) : FormatterStructure < Target >","body":"fun formatter ( ) : FormatterStructure < Target >","docstring":"/**\n * The formatter operation that formats the field.\n */"} {"signature":"fun parser ( ) : ParserStructure < Target >","body":"fun parser ( ) : ParserStructure < Target >","docstring":"/**\n * The parser structure that parses the field.\n */"} {"signature":"private fun testRequestSizeWithBuffer ( capacity : Int , onBufferOverflow : BufferOverflow , expectedRequestSize : Long )","body":"= runTest { val m = val publisher = Publisher < Int > { s -> s . onSubscribe ( object : Subscription { var lastSent = var remaining = override fun request ( n : Long ) { assertEquals ( expectedRequestSize , n ) remaining += n check ( remaining >= ) while ( lastSent < m && remaining > ) { s . onNext ( ++ lastSent ) remaining -- } if ( lastSent == m ) s . onComplete ( ) } override fun cancel ( ) { } } ) } val flow = publisher . asFlow ( ) . buffer ( capacity , onBufferOverflow ) val list = flow . toList ( ) val runSize = if ( capacity == Channel . BUFFERED ) else capacity val expected = when ( onBufferOverflow ) { BufferOverflow . SUSPEND -> ( .. m ) . toList ( ) BufferOverflow . DROP_OLDEST -> ( m - runSize + .. m ) . toList ( ) BufferOverflow . DROP_LATEST -> ( .. runSize ) . toList ( ) } assertEquals ( expected , list ) }","docstring":"/**\n * Tests `publisher.asFlow.buffer(...)` chain, verifying expected requests size and that only expected\n * values are delivered.\n */"} {"signature":"fun markFilesForCurrentRound ( target : ModuleBuildTarget , files : Collection < File > )","body":"{ require ( target in chunk . targets ) val targetDirtyFiles = dirtyFilesHolder . byTarget . getValue ( target ) val dirtyFileToRoot = HashMap < File , JavaSourceRootDescriptor > ( ) files . forEach { file -> val root = compileContext . projectDescriptor . buildRootIndex . findAllParentDescriptors < BuildRootDescriptor > ( file , compileContext ) . single { sourceRoot -> sourceRoot . target == target } targetDirtyFiles . _markDirty ( file , root as JavaSourceRootDescriptor ) dirtyFileToRoot [ file ] = root } markFilesImpl ( files , currentRound = true ) { it . exists ( ) } cleanOutputsForNewDirtyFilesInCurrentRound ( target , dirtyFileToRoot ) }","docstring":"/**\n * Marks given [files] as dirty for current round and given [target] of [chunk].\n */"} {"signature":"public operator fun iterator ( ) : ComplexFloatIterator","body":"= iterator ( this )","docstring":"/** Creates an iterator over the elements of the array. */"} {"signature":"public operator fun iterator ( ) : ComplexDoubleIterator","body":"= iterator ( this )","docstring":"/** Creates an iterator over the elements of the array. */"} {"signature":"public fun < T , D : Dimension > MultiArray < T , D > . append ( vararg value : T ) : D1Array < T >","body":"{ val newSize = this . size + value . size val data = this . copyFromTwoArrays ( value . iterator ( ) , newSize ) return D1Array ( data , shape = intArrayOf ( newSize ) , dim = D1 ) }","docstring":"/**\n *\n */"} {"signature":"public infix fun < T , D : Dimension , ID : Dimension > MultiArray < T , D > . append ( arr : MultiArray < T , ID > ) : D1Array < T >","body":"{ val newSize = this . size + arr . size val data = this . copyFromTwoArrays ( arr . iterator ( ) , newSize ) return D1Array ( data , shape = intArrayOf ( newSize ) , dim = D1 ) }","docstring":"/**\n *\n */"} {"signature":"public fun < T , D : Dimension > MultiArray < T , D > . append ( arr : MultiArray < T , D > , axis : Int ) : NDArray < T , D >","body":"= this . cat ( arr , axis )","docstring":"/**\n *\n */"} {"signature":"public fun < T , D : Dimension > MultiArray < T , D > . repeat ( n : Int ) : D1Array < T >","body":"{ require ( n >= ) { \"\" } val data = initMemoryView < T > ( size * n , dtype ) if ( consistent ) { this . data . copyInto ( data ) } else { var index = for ( el in this ) data [ index ++ ] = el } for ( i in size until ( size * n ) step size ) { val startIndex = i - size val endIndex = i val startIndexComplex = startIndex * val endIndexComplex = startIndexComplex + ( size * ) when ( this . dtype ) { DataType . ComplexFloatDataType -> data . getFloatArray ( ) . copyInto ( data . getFloatArray ( ) , i * , startIndexComplex , endIndexComplex ) DataType . ComplexDoubleDataType -> data . getDoubleArray ( ) . copyInto ( data . getDoubleArray ( ) , i * , startIndexComplex , endIndexComplex ) else -> data . copyInto ( data , i , i - size , endIndex ) } } return D1Array ( data , shape = intArrayOf ( size * n ) , dim = D1 ) }","docstring":"/**\n *\n */"} {"signature":"public fun < T , D : Dimension > MultiArray < T , D > . clip ( min : T , max : T ) : NDArray < T , D > where T : Comparable < T > , T : Number","body":"{ require ( min <= max ) { \"\" } val clippedData = initMemoryView ( size , dtype ) { index -> val e = data [ index ] if ( e < min ) min else if ( e > max ) max else e } return NDArray ( data = clippedData , shape = shape . copyOf ( ) , dim = dim ) }","docstring":"/**\n * Clips the values in ndarray if value is not in range min..max\n *\n * values bigger than [max] are set to [max]\n *\n * values smaller than [min] are set to [min]\n *\n * @param min minimum value for clipping where any value in ndarray\n * that is smaller than [min] are clipped and set to [min]\n * @param max maximum value for clipping where any value in ndarray\n * that is bigger than [max] are clipped and set to [max]\n * @return NDArray of which all of its elements are in range min..max\n * @throws IllegalArgumentException if min > max\n */"} {"signature":"@ JvmName ( \"\" ) public fun < T > MultiArray < T , D1 > . expandDims ( axis : Int ) : MultiArray < T , D2 >","body":"{ val newShape = shape . toMutableList ( ) . apply { add ( axis , ) } . toIntArray ( ) val newData = if ( consistent ) this . data else this . deepCopy ( ) . data val newBase = if ( consistent ) this . base ? : this else null val newOffset = if ( consistent ) this . offset else return D2Array ( newData , newOffset , newShape , dim = D2 , base = newBase ) }","docstring":"/**\n * Returns a ndarray with an expanded shape.\n */"} {"signature":"@ JvmName ( \"\" ) public fun < T > MultiArray < T , D2 > . expandDims ( axis : Int ) : MultiArray < T , D3 >","body":"{ val newShape = shape . toMutableList ( ) . apply { add ( axis , ) } . toIntArray ( ) val newData = if ( consistent ) this . data else this . deepCopy ( ) . data val newBase = if ( consistent ) this . base ? : this else null val newOffset = if ( consistent ) this . offset else return D3Array ( newData , newOffset , newShape , dim = D3 , base = newBase ) }","docstring":"/**\n * Returns a ndarray with an expanded shape.\n */"} {"signature":"@ JvmName ( \"\" ) public fun < T > MultiArray < T , D3 > . expandDims ( axis : Int ) : MultiArray < T , D4 >","body":"{ val newShape = shape . toMutableList ( ) . apply { add ( axis , ) } . toIntArray ( ) val newData = if ( consistent ) this . data else this . deepCopy ( ) . data val newBase = if ( consistent ) this . base ? : this else null val newOffset = if ( consistent ) this . offset else return D4Array ( newData , newOffset , newShape , dim = D4 , base = newBase ) }","docstring":"/**\n * Returns a ndarray with an expanded shape.\n */"} {"signature":"@ JvmName ( \"\" ) public fun < T > MultiArray < T , D4 > . expandDims ( axis : Int ) : MultiArray < T , DN >","body":"= this . unsqueeze ( )","docstring":"/**\n * Returns a ndarray with an expanded shape.\n */"} {"signature":"@ JvmName ( \"\" ) public fun < T , D : Dimension > MultiArray < T , D > . expandNDims ( vararg axes : Int ) : MultiArray < T , DN >","body":"= this . unsqueeze ( )","docstring":"/**\n * Returns a ndarray with an expanded shape.\n *\n * @see MultiArray.unsqueeze\n */"} {"signature":"fun getKind ( module : KtModule ) : LLModuleResolutionStrategy","body":"fun getKind ( module : KtModule ) : LLModuleResolutionStrategy","docstring":"/**\n * Returns [LLModuleResolutionStrategy.STATIC] if the [module] is treated as a binary for the current session,\n * and [LLModuleResolutionStrategy.LAZY] otherwise.\n *\n * In some cases, modules of the same type might be treated differently by the session, and have a different [LLModuleResolutionStrategy].\n * For instance, for a resolvable library session, only the target library is considered resolvable, and its dependencies are binary.\n */"} {"signature":"public fun < T > xIntercept ( column : ColumnAccessor < T > ) : PositionalMapping < T >","body":"{ return addPositionalMapping < T > ( X_INTERCEPT , column . name ( ) , null ) }","docstring":"/**\n * Maps the `xIntercept` aesthetic to a data column by [ColumnAccessor].\n *\n * @param column the data column to be mapped.\n * @return a [PositionalMapping] object representing the mapping.\n */"} {"signature":"public fun < T > xIntercept ( column : KProperty < T > ) : PositionalMapping < T >","body":"{ return addPositionalMapping < T > ( X_INTERCEPT , column . name , null ) }","docstring":"/**\n * Maps the `xIntercept` 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 xIntercept ( column : String ) : PositionalMapping < Any ? >","body":"{ return addPositionalMapping ( X_INTERCEPT , column , null ) }","docstring":"/**\n * Maps the `xIntercept` 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 > xIntercept ( values : Iterable < T > ) : PositionalMapping < T >","body":"{ return addPositionalMapping < T > ( X_INTERCEPT , values . toList ( ) , null , null ) }","docstring":"/**\n * Maps the `xIntercept` 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 > xIntercept ( values : DataColumn < T > ) : PositionalMapping < T >","body":"{ return addPositionalMapping < T > ( X_INTERCEPT , values , null ) }","docstring":"/**\n * Maps the `xIntercept` 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":"override fun hashCode ( ) : Int","body":"= super < AbstractMap > . hashCode ( )","docstring":"/**\n * We provide [equals], so as a matter of style, we should also provide [hashCode].\n * However, the implementation from [AbstractMap] is enough.\n */"} {"signature":"fun ScriptingHostConfiguration ? . with ( body : ScriptingHostConfiguration . Builder . ( ) -> Unit ) : ScriptingHostConfiguration","body":"{ val newConfiguration = if ( this == null ) ScriptingHostConfiguration ( body = body ) else ScriptingHostConfiguration ( this , body = body ) return if ( newConfiguration != this ) newConfiguration else this }","docstring":"/**\n * An alternative to the constructor with base configuration, which returns a new configuration only if [body] adds anything\n * to the original one, otherwise returns original\n */"} {"signature":"fun ScriptingHostConfiguration ? . withDefaultsFrom ( defaults : ScriptingHostConfiguration ) : ScriptingHostConfiguration","body":"= when { this == defaults || defaults . isEmpty ( ) -> this ? : defaults this == null || this . isEmpty ( ) -> defaults else -> ScriptingHostConfiguration ( defaults , this ) }","docstring":"/**\n * Add the values not explicitly set in the receiver from the [defaults] configuration\n */"} {"signature":"fun ScriptingHostConfiguration . Builder . getEvaluationContext ( handler : GetEvaluationContext )","body":"{ ScriptingHostConfiguration . getEvaluationContext . put ( handler ) }","docstring":"/**\n * A helper to enable passing lambda directly to the getEvaluationContext \"keyword\"\n */"} {"signature":"fun computeMangle ( declaration : Declaration ) : String","body":"fun computeMangle ( declaration : Declaration ) : String","docstring":"/**\n * Computes the mangled name of [declaration].\n *\n * @param declaration The Kotlin declaration to compute a mangle name for.\n * @return The mangled name of [declaration].\n */"} {"signature":"fun copy ( newMode : MangleMode ) : KotlinMangleComputer < Declaration >","body":"fun copy ( newMode : MangleMode ) : KotlinMangleComputer < Declaration >","docstring":"/**\n * Creates a copy of this mangle computer with a different mangle mode but otherwise the same state.\n *\n * Useful for temporarily switching the mangle mode.\n *\n * @param newMode The mangle mode to use in the new mangle computer.\n * @return A copy of this mangle computer.\n */"} {"signature":"public fun < T : ComplexFloat > complexFloatArrayOf ( vararg elements : T ) : ComplexFloatArray","body":"= if ( elements . isEmpty ( ) ) ComplexFloatArray ( ) else ComplexFloatArray ( elements . size ) { elements [ it ] }","docstring":"/**\n * Creates a new [ComplexFloatArray] from the provided vararg [elements].\n *\n * @param elements the elements to be included in the new [ComplexFloatArray].\n * @return a new [ComplexFloatArray] containing all the provided [elements],\n * or an empty [ComplexFloatArray] if no [elements] were provided.\n */"} {"signature":"@ Suppress ( \"\" ) public inline operator fun ComplexFloatArray . component1 ( ) : ComplexFloat","body":"= get ( )","docstring":"/**\n * Returns 1st element from the array.\n *\n * If the size of this array is less than 1, throws an [IndexOutOfBoundsException].\n */"} {"signature":"@ Suppress ( \"\" ) public inline operator fun ComplexDoubleArray . component1 ( ) : ComplexDouble","body":"= get ( )","docstring":"/**\n * Returns 1st element from the array.\n *\n * If the size of this array is less than 1, throws an [IndexOutOfBoundsException].\n */"} {"signature":"@ Suppress ( \"\" ) public inline operator fun ComplexFloatArray . component2 ( ) : ComplexFloat","body":"= get ( )","docstring":"/**\n * Returns 2nd *element* from the array.\n *\n * If the size of this array is less than 2, throws an [IndexOutOfBoundsException].\n */"} {"signature":"@ Suppress ( \"\" ) public inline operator fun ComplexDoubleArray . component2 ( ) : ComplexDouble","body":"= get ( )","docstring":"/**\n * Returns 2nd *element* from the array.\n *\n * If the size of this array is less than 2, throws an [IndexOutOfBoundsException].\n */"} {"signature":"@ Suppress ( \"\" ) public inline operator fun ComplexFloatArray . component3 ( ) : ComplexFloat","body":"= get ( )","docstring":"/**\n * Returns 3rd *element* from the array.\n *\n * If the size of this array is less than 3, throws an [IndexOutOfBoundsException].\n */"} {"signature":"@ Suppress ( \"\" ) public inline operator fun ComplexDoubleArray . component3 ( ) : ComplexDouble","body":"= get ( )","docstring":"/**\n * Returns 3rd *element* from the array.\n *\n * If the size of this array is less than 3, throws an [IndexOutOfBoundsException].\n */"} {"signature":"@ Suppress ( \"\" ) public inline operator fun ComplexFloatArray . component4 ( ) : ComplexFloat","body":"= get ( )","docstring":"/**\n * Returns 4th *element* from the array.\n *\n * If the size of this array is less than 4, throws an [IndexOutOfBoundsException].\n */"} {"signature":"@ Suppress ( \"\" ) public inline operator fun ComplexDoubleArray . component4 ( ) : ComplexDouble","body":"= get ( )","docstring":"/**\n * Returns 4th *element* from the array.\n *\n * If the size of this array is less than 4, throws an [IndexOutOfBoundsException].\n */"} {"signature":"@ Suppress ( \"\" ) public inline operator fun ComplexFloatArray . component5 ( ) : ComplexFloat","body":"= get ( )","docstring":"/**\n * Returns 5th *element* from the array.\n *\n * If the size of this array is less than 5, throws an [IndexOutOfBoundsException].\n */"} {"signature":"@ Suppress ( \"\" ) public inline operator fun ComplexDoubleArray . component5 ( ) : ComplexDouble","body":"= get ( )","docstring":"/**\n * Returns 5th *element* from the array.\n *\n * If the size of this array is less than 5, throws an [IndexOutOfBoundsException].\n */"} {"signature":"public operator fun ComplexFloatArray . contains ( element : ComplexFloat ) : Boolean","body":"= indexOf ( element ) >= ","docstring":"/**\n * Returns `true` if [element] is found in the array.\n */"} {"signature":"public operator fun ComplexDoubleArray . contains ( element : ComplexDouble ) : Boolean","body":"= indexOf ( element ) >= ","docstring":"/**\n * Returns `true` if [element] is found in the array.\n */"} {"signature":"public fun ComplexFloatArray . elementAt ( index : Int ) : ComplexFloat","body":"= get ( index )","docstring":"/**\n * Returns an element at the given [index] or throws an [IndexOutOfBoundsException] if the [index] is out of bounds of this array.\n */"} {"signature":"public fun ComplexDoubleArray . elementAt ( index : Int ) : ComplexDouble","body":"= get ( index )","docstring":"/**\n * Returns an element at the given [index] or throws an [IndexOutOfBoundsException] if the [index] is out of bounds of this array.\n */"} {"signature":"public inline fun ComplexFloatArray . elementAtOrElse ( index : Int , defaultValue : ( Int ) -> ComplexFloat ) : ComplexFloat","body":"= if ( index in .. lastIndex ) 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 array.\n */"} {"signature":"public inline fun ComplexDoubleArray . elementAtOrElse ( index : Int , defaultValue : ( Int ) -> ComplexDouble ) : ComplexDouble","body":"= if ( index in .. lastIndex ) 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 array.\n */"} {"signature":"@ Suppress ( \"\" ) public inline fun ComplexFloatArray . elementAtOrNull ( index : Int ) : ComplexFloat ?","body":"= this . getOrNull ( index )","docstring":"/**\n * Returns an element at the given [index] or `null` if the [index] is out of bounds of this array.\n */"} {"signature":"@ Suppress ( \"\" ) public inline fun ComplexDoubleArray . elementAtOrNull ( index : Int ) : ComplexDouble ?","body":"= this . getOrNull ( index )","docstring":"/**\n * Returns an element at the given [index] or `null` if the [index] is out of bounds of this array.\n */"} {"signature":"public inline fun ComplexFloatArray . find ( predicate : ( ComplexFloat ) -> Boolean ) : ComplexFloat ?","body":"= firstOrNull ( predicate )","docstring":"/**\n * Returns the first element matching the given [predicate], or `null` if no such element was found.\n */"} {"signature":"public inline fun ComplexDoubleArray . find ( predicate : ( ComplexDouble ) -> Boolean ) : ComplexDouble ?","body":"= firstOrNull ( predicate )","docstring":"/**\n * Returns the first element matching the given [predicate], or `null` if no such element was found.\n */"} {"signature":"public inline fun ComplexFloatArray . findLast ( predicate : ( ComplexFloat ) -> Boolean ) : ComplexFloat ?","body":"= lastOrNull ( predicate )","docstring":"/**\n * Returns the last element matching the given [predicate], or `null` if no such element was found.\n */"} {"signature":"public inline fun ComplexDoubleArray . findLast ( predicate : ( ComplexDouble ) -> Boolean ) : ComplexDouble ?","body":"= lastOrNull ( predicate )","docstring":"/**\n * Returns the last element matching the given [predicate], or `null` if no such element was found.\n */"} {"signature":"public fun ComplexFloatArray . first ( ) : ComplexFloat","body":"= if ( isEmpty ( ) ) throw NoSuchElementException ( \"\" ) else this [ ]","docstring":"/**\n * Returns first element.\n * @throws [NoSuchElementException] if the array is empty.\n */"} {"signature":"public fun ComplexDoubleArray . first ( ) : ComplexDouble","body":"= if ( isEmpty ( ) ) throw NoSuchElementException ( \"\" ) else this [ ]","docstring":"/**\n * Returns first element.\n * @throws [NoSuchElementException] if the array is empty.\n */"} {"signature":"public inline fun ComplexFloatArray . first ( predicate : ( ComplexFloat ) -> Boolean ) : ComplexFloat","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":"public inline fun ComplexDoubleArray . first ( predicate : ( ComplexDouble ) -> Boolean ) : ComplexDouble","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":"public fun ComplexFloatArray . firstOrNull ( ) : ComplexFloat ?","body":"= if ( isEmpty ( ) ) null else this [ ]","docstring":"/**\n * Returns the first element, or `null` if the array is empty.\n */"} {"signature":"public fun ComplexDoubleArray . firstOrNull ( ) : ComplexDouble ?","body":"= if ( isEmpty ( ) ) null else this [ ]","docstring":"/**\n * Returns the first element, or `null` if the array is empty.\n */"} {"signature":"public inline fun ComplexFloatArray . firstOrNull ( predicate : ( ComplexFloat ) -> Boolean ) : ComplexFloat ?","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":"public inline fun ComplexDoubleArray . firstOrNull ( predicate : ( ComplexDouble ) -> Boolean ) : ComplexDouble ?","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":"public inline fun ComplexFloatArray . getOrElse ( index : Int , defaultValue : ( Int ) -> ComplexFloat ) : ComplexFloat","body":"= if ( index in .. lastIndex ) 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 array.\n */"} {"signature":"public inline fun ComplexDoubleArray . getOrElse ( index : Int , defaultValue : ( Int ) -> ComplexDouble ) : ComplexDouble","body":"= if ( index in .. lastIndex ) 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 array.\n */"} {"signature":"public fun ComplexFloatArray . getOrNull ( index : Int ) : ComplexFloat ?","body":"= if ( index in .. lastIndex ) get ( index ) else null","docstring":"/**\n * Returns an element at the given [index] or `null` if the [index] is out of bounds of this array.\n */"} {"signature":"public fun ComplexDoubleArray . getOrNull ( index : Int ) : ComplexDouble ?","body":"= if ( index in .. lastIndex ) get ( index ) else null","docstring":"/**\n * Returns an element at the given [index] or `null` if the [index] is out of bounds of this array.\n */"} {"signature":"public fun ComplexFloatArray . indexOf ( element : ComplexFloat ) : Int","body":"{ for ( index in indices ) { if ( element == this [ index ] ) { return index } } return - }","docstring":"/**\n * Returns first index of [element], or -1 if the array does not contain element.\n */"} {"signature":"public fun ComplexDoubleArray . indexOf ( element : ComplexDouble ) : Int","body":"{ for ( index in indices ) { if ( element == this [ index ] ) { return index } } return - }","docstring":"/**\n * Returns first index of [element], or -1 if the array does not contain element.\n */"} {"signature":"public inline fun ComplexFloatArray . indexOfFirst ( predicate : ( ComplexFloat ) -> Boolean ) : Int","body":"{ for ( index in indices ) { if ( predicate ( this [ index ] ) ) { return index } } return - }","docstring":"/**\n * Returns index of the first element matching the given [predicate], or -1 if the array does not contain such element.\n */"} {"signature":"public inline fun ComplexDoubleArray . indexOfFirst ( predicate : ( ComplexDouble ) -> Boolean ) : Int","body":"{ for ( index in indices ) { if ( predicate ( this [ index ] ) ) { return index } } return - }","docstring":"/**\n * Returns index of the first element matching the given [predicate], or -1 if the array does not contain such element.\n */"} {"signature":"public inline fun ComplexFloatArray . indexOfLast ( predicate : ( ComplexFloat ) -> Boolean ) : Int","body":"{ for ( index in indices . reversed ( ) ) { if ( predicate ( this [ index ] ) ) { return index } } return - }","docstring":"/**\n * Returns index of the last element matching the given [predicate], or -1 if the array does not contain such element.\n */"} {"signature":"public inline fun ComplexDoubleArray . indexOfLast ( predicate : ( ComplexDouble ) -> Boolean ) : Int","body":"{ for ( index in indices . reversed ( ) ) { if ( predicate ( this [ index ] ) ) { return index } } return - }","docstring":"/**\n * Returns index of the last element matching the given [predicate], or -1 if the array does not contain such element.\n */"} {"signature":"public fun ComplexFloatArray . last ( ) : ComplexFloat","body":"{ if ( isEmpty ( ) ) throw NoSuchElementException ( \"\" ) return this [ lastIndex ] }","docstring":"/**\n * Returns the last element.\n *\n * @throws NoSuchElementException if the array is empty.\n */"} {"signature":"public fun ComplexDoubleArray . last ( ) : ComplexDouble","body":"{ if ( isEmpty ( ) ) throw NoSuchElementException ( \"\" ) return this [ lastIndex ] }","docstring":"/**\n * Returns the last element.\n *\n * @throws NoSuchElementException if the array is empty.\n */"} {"signature":"public inline fun ComplexFloatArray . last ( predicate : ( ComplexFloat ) -> Boolean ) : ComplexFloat","body":"{ for ( index in this . indices . reversed ( ) ) { val element = this [ index ] 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 */"} {"signature":"public inline fun ComplexDoubleArray . last ( predicate : ( ComplexDouble ) -> Boolean ) : ComplexDouble","body":"{ for ( index in this . indices . reversed ( ) ) { val element = this [ index ] 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 */"} {"signature":"public fun ComplexFloatArray . lastIndexOf ( element : ComplexFloat ) : Int","body":"{ for ( index in indices . reversed ( ) ) { if ( element == this [ index ] ) { return index } } return - }","docstring":"/**\n * Returns last index of [element], or -1 if the array does not contain element.\n */"} {"signature":"public fun ComplexDoubleArray . lastIndexOf ( element : ComplexDouble ) : Int","body":"{ for ( index in indices . reversed ( ) ) { if ( element == this [ index ] ) { return index } } return - }","docstring":"/**\n * Returns last index of [element], or -1 if the array does not contain element.\n */"} {"signature":"public fun ComplexFloatArray . lastOrNull ( ) : ComplexFloat ?","body":"{ return if ( isEmpty ( ) ) null else this [ size - ] }","docstring":"/** Returns the last element, or `null` if the array is empty. */"} {"signature":"public fun ComplexDoubleArray . lastOrNull ( ) : ComplexDouble ?","body":"{ return if ( isEmpty ( ) ) null else this [ size - ] }","docstring":"/** Returns the last element, or `null` if the array is empty. */"} {"signature":"public inline fun ComplexFloatArray . lastOrNull ( predicate : ( ComplexFloat ) -> Boolean ) : ComplexFloat ?","body":"{ for ( index in this . indices . reversed ( ) ) { val element = this [ index ] 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 */"} {"signature":"public inline fun ComplexDoubleArray . lastOrNull ( predicate : ( ComplexDouble ) -> Boolean ) : ComplexDouble ?","body":"{ for ( index in this . indices . reversed ( ) ) { val element = this [ index ] 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 */"} {"signature":"@ Suppress ( \"\" ) public inline fun ComplexFloatArray . random ( ) : ComplexFloat","body":"= random ( Random )","docstring":"/**\n * Returns a random element from this array.\n *\n * @throws NoSuchElementException if this array is empty.\n */"} {"signature":"@ Suppress ( \"\" ) public inline fun ComplexDoubleArray . random ( ) : ComplexDouble","body":"= random ( Random )","docstring":"/**\n * Returns a random element from this array.\n *\n * @throws NoSuchElementException if this array is empty.\n */"} {"signature":"public fun ComplexFloatArray . random ( random : Random ) : ComplexFloat","body":"= if ( isEmpty ( ) ) throw NoSuchElementException ( \"\" ) else get ( random . nextInt ( size ) )","docstring":"/**\n * Returns a random element from this array using the specified source of randomness.\n *\n * @throws NoSuchElementException if this array is empty.\n */"} {"signature":"public fun ComplexDoubleArray . random ( random : Random ) : ComplexDouble","body":"= if ( isEmpty ( ) ) throw NoSuchElementException ( \"\" ) else get ( random . nextInt ( size ) )","docstring":"/**\n * Returns a random element from this array using the specified source of randomness.\n *\n * @throws NoSuchElementException if this array is empty.\n */"} {"signature":"@ Suppress ( \"\" ) public inline fun ComplexFloatArray . randomOrNull ( ) : ComplexFloat ?","body":"= randomOrNull ( Random )","docstring":"/**\n * Returns a random element from this array, or `null` if this array is empty.\n */"} {"signature":"@ Suppress ( \"\" ) public inline fun ComplexDoubleArray . randomOrNull ( ) : ComplexDouble ?","body":"= randomOrNull ( Random )","docstring":"/**\n * Returns a random element from this array, or `null` if this array is empty.\n */"} {"signature":"public fun ComplexFloatArray . randomOrNull ( random : Random ) : ComplexFloat ?","body":"= if ( isEmpty ( ) ) null else get ( random . nextInt ( size ) )","docstring":"/**\n * Returns a random element from this array using the specified source of randomness, or `null` if this array is empty.\n */"} {"signature":"public fun ComplexDoubleArray . randomOrNull ( random : Random ) : ComplexDouble ?","body":"= if ( isEmpty ( ) ) null else get ( random . nextInt ( size ) )","docstring":"/**\n * Returns a random element from this array using the specified source of randomness, or `null` if this array is empty.\n */"} {"signature":"public fun ComplexFloatArray . single ( ) : ComplexFloat","body":"= when ( size ) { -> throw NoSuchElementException ( \"\" ) -> this [ ] else -> throw IllegalArgumentException ( \"\" ) }","docstring":"/**\n * Returns the single element, or throws an exception if the array is empty or has more than one element.\n */"} {"signature":"public fun ComplexDoubleArray . single ( ) : ComplexDouble","body":"= when ( size ) { -> throw NoSuchElementException ( \"\" ) -> this [ ] else -> throw IllegalArgumentException ( \"\" ) }","docstring":"/**\n * Returns the single element, or throws an exception if the array is empty or has more than one element.\n */"} {"signature":"public inline fun ComplexFloatArray . single ( predicate : ( ComplexFloat ) -> Boolean ) : ComplexFloat","body":"{ var single : ComplexFloat ? = null var found = false for ( element in this ) { if ( predicate ( element ) ) { if ( found ) throw IllegalArgumentException ( \"\" ) single = element found = true } } if ( ! found ) throw NoSuchElementException ( \"\" ) return single as ComplexFloat }","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 inline fun ComplexDoubleArray . single ( predicate : ( ComplexDouble ) -> Boolean ) : ComplexDouble","body":"{ var single : ComplexDouble ? = null var found = false for ( element in this ) { if ( predicate ( element ) ) { if ( found ) throw IllegalArgumentException ( \"\" ) single = element found = true } } if ( ! found ) throw NoSuchElementException ( \"\" ) return single as ComplexDouble }","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 ComplexFloatArray . singleOrNull ( ) : ComplexFloat ?","body":"= if ( size == ) this [ ] else null","docstring":"/**\n * Returns single element, or `null` if the array is empty or has more than one element.\n */"} {"signature":"public fun ComplexDoubleArray . singleOrNull ( ) : ComplexDouble ?","body":"= if ( size == ) this [ ] else null","docstring":"/**\n * Returns single element, or `null` if the array is empty or has more than one element.\n */"} {"signature":"public inline fun ComplexFloatArray . singleOrNull ( predicate : ( ComplexFloat ) -> Boolean ) : ComplexFloat ?","body":"{ var single : ComplexFloat ? = 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 inline fun ComplexDoubleArray . singleOrNull ( predicate : ( ComplexDouble ) -> Boolean ) : ComplexDouble ?","body":"{ var single : ComplexDouble ? = 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 ComplexFloatArray . drop ( n : Int ) : List < ComplexFloat >","body":"{ require ( n >= ) { \"\" } return takeLast ( ( size - n ) . coerceAtLeast ( ) ) }","docstring":"/**\n * Returns a list containing all elements except first [n] elements.\n *\n * @throws IllegalArgumentException if [n] is negative.\n */"} {"signature":"public fun ComplexDoubleArray . drop ( n : Int ) : List < ComplexDouble >","body":"{ require ( n >= ) { \"\" } return takeLast ( ( size - n ) . coerceAtLeast ( ) ) }","docstring":"/**\n * Returns a list containing all elements except first [n] elements.\n *\n * @throws IllegalArgumentException if [n] is negative.\n */"} {"signature":"public fun ComplexFloatArray . dropLast ( n : Int ) : List < ComplexFloat >","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 */"} {"signature":"public fun ComplexDoubleArray . dropLast ( n : Int ) : List < ComplexDouble >","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 */"} {"signature":"public inline fun ComplexFloatArray . dropLastWhile ( predicate : ( ComplexFloat ) -> Boolean ) : List < ComplexFloat >","body":"{ for ( index in lastIndex downTo ) { if ( ! predicate ( this [ index ] ) ) { return take ( index + ) } } return emptyList ( ) }","docstring":"/**\n * Returns a list containing all elements except last elements that satisfy the given [predicate].\n */"} {"signature":"public inline fun ComplexDoubleArray . dropLastWhile ( predicate : ( ComplexDouble ) -> Boolean ) : List < ComplexDouble >","body":"{ for ( index in lastIndex downTo ) { if ( ! predicate ( this [ index ] ) ) { return take ( index + ) } } return emptyList ( ) }","docstring":"/**\n * Returns a list containing all elements except last elements that satisfy the given [predicate].\n */"} {"signature":"public inline fun ComplexFloatArray . dropWhile ( predicate : ( ComplexFloat ) -> Boolean ) : List < ComplexFloat >","body":"{ var yielding = false val list = ArrayList < ComplexFloat > ( ) 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 */"} {"signature":"public inline fun ComplexDoubleArray . dropWhile ( predicate : ( ComplexDouble ) -> Boolean ) : List < ComplexDouble >","body":"{ var yielding = false val list = ArrayList < ComplexDouble > ( ) 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 */"} {"signature":"public inline fun ComplexFloatArray . filter ( predicate : ( ComplexFloat ) -> Boolean ) : List < ComplexFloat >","body":"= filterTo ( ArrayList ( ) , predicate )","docstring":"/**\n * Returns a list containing only elements matching the given [predicate].\n */"} {"signature":"public inline fun ComplexDoubleArray . filter ( predicate : ( ComplexDouble ) -> Boolean ) : List < ComplexDouble >","body":"= filterTo ( ArrayList ( ) , predicate )","docstring":"/**\n * Returns a list containing only elements matching the given [predicate].\n */"} {"signature":"public inline fun ComplexFloatArray . filterIndexed ( predicate : ( index : Int , ComplexFloat ) -> Boolean ) : List < ComplexFloat >","body":"= filterIndexedTo ( ArrayList ( ) , 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 */"} {"signature":"public inline fun ComplexDoubleArray . filterIndexed ( predicate : ( index : Int , ComplexDouble ) -> Boolean ) : List < ComplexDouble >","body":"= filterIndexedTo ( ArrayList ( ) , 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 */"} {"signature":"public inline fun < C : MutableCollection < in ComplexFloat > > ComplexFloatArray . filterIndexedTo ( destination : C , predicate : ( index : Int , ComplexFloat ) -> 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 */"} {"signature":"public inline fun < C : MutableCollection < in ComplexDouble > > ComplexDoubleArray . filterIndexedTo ( destination : C , predicate : ( index : Int , ComplexDouble ) -> 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 */"} {"signature":"public inline fun ComplexFloatArray . filterNot ( predicate : ( ComplexFloat ) -> Boolean ) : List < ComplexFloat >","body":"= filterNotTo ( ArrayList ( ) , predicate )","docstring":"/**\n * Returns a list containing all elements not matching the given [predicate].\n */"} {"signature":"public inline fun ComplexDoubleArray . filterNot ( predicate : ( ComplexDouble ) -> Boolean ) : List < ComplexDouble >","body":"= filterNotTo ( ArrayList ( ) , predicate )","docstring":"/**\n * Returns a list containing all elements not matching the given [predicate].\n */"} {"signature":"public inline fun < C : MutableCollection < in ComplexFloat > > ComplexFloatArray . filterNotTo ( destination : C , predicate : ( ComplexFloat ) -> 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 */"} {"signature":"public inline fun < C : MutableCollection < in ComplexDouble > > ComplexDoubleArray . filterNotTo ( destination : C , predicate : ( ComplexDouble ) -> 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 */"} {"signature":"public inline fun < C : MutableCollection < in ComplexFloat > > ComplexFloatArray . filterTo ( destination : C , predicate : ( ComplexFloat ) -> 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 */"} {"signature":"public inline fun < C : MutableCollection < in ComplexDouble > > ComplexDoubleArray . filterTo ( destination : C , predicate : ( ComplexDouble ) -> 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 */"} {"signature":"public fun ComplexFloatArray . slice ( indices : IntRange ) : List < ComplexFloat >","body":"{ if ( indices . isEmpty ( ) ) return listOf ( ) return copyOfRange ( indices . first , indices . last + ) . asList ( ) }","docstring":"/**\n * Returns a list containing elements at indices in the specified [indices] range.\n */"} {"signature":"public fun ComplexDoubleArray . slice ( indices : IntRange ) : List < ComplexDouble >","body":"{ if ( indices . isEmpty ( ) ) return listOf ( ) return copyOfRange ( indices . first , indices . last + ) . asList ( ) }","docstring":"/**\n * Returns a list containing elements at indices in the specified [indices] range.\n */"} {"signature":"public fun ComplexFloatArray . slice ( indices : Iterable < Int > ) : List < ComplexFloat >","body":"{ val size = if ( indices is Collection < * > ) indices . size else if ( size == ) return emptyList ( ) val list = ArrayList < ComplexFloat > ( 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 ComplexDoubleArray . slice ( indices : Iterable < Int > ) : List < ComplexDouble >","body":"{ val size = if ( indices is Collection < * > ) indices . size else if ( size == ) return emptyList ( ) val list = ArrayList < ComplexDouble > ( 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 ComplexFloatArray . sliceArray ( indices : Collection < Int > ) : ComplexFloatArray","body":"{ val result = ComplexFloatArray ( indices . size ) var targetIndex = for ( sourceIndex in indices ) { result [ targetIndex ++ ] = this [ sourceIndex ] } return result }","docstring":"/**\n * Returns an array containing elements of this array at specified [indices].\n */"} {"signature":"public fun ComplexDoubleArray . sliceArray ( indices : Collection < Int > ) : ComplexDoubleArray","body":"{ val result = ComplexDoubleArray ( indices . size ) var targetIndex = for ( sourceIndex in indices ) { result [ targetIndex ++ ] = this [ sourceIndex ] } return result }","docstring":"/**\n * Returns an array containing elements of this array at specified [indices].\n */"} {"signature":"public fun ComplexFloatArray . sliceArray ( indices : IntRange ) : ComplexFloatArray","body":"= if ( indices . isEmpty ( ) ) ComplexFloatArray ( ) else copyOfRange ( indices . first , indices . last + )","docstring":"/**\n * Returns an array containing elements at indices in the specified [indices] range.\n */"} {"signature":"public fun ComplexDoubleArray . sliceArray ( indices : IntRange ) : ComplexDoubleArray","body":"= if ( indices . isEmpty ( ) ) ComplexDoubleArray ( ) else copyOfRange ( indices . first , indices . last + )","docstring":"/**\n * Returns an array containing elements at indices in the specified [indices] range.\n */"} {"signature":"public fun ComplexFloatArray . take ( n : Int ) : List < ComplexFloat >","body":"{ require ( n >= ) { \"\" } if ( n == ) return emptyList ( ) if ( n >= size ) return toList ( ) if ( n == ) return listOf ( this [ ] ) var count = val list = ArrayList < ComplexFloat > ( n ) for ( item in this ) { list . add ( item ) if ( ++ count == n ) break } return list }","docstring":"/**\n * Returns a list containing first [n] elements.\n *\n * @throws IllegalArgumentException if [n] is negative.\n */"} {"signature":"public fun ComplexDoubleArray . take ( n : Int ) : List < ComplexDouble >","body":"{ require ( n >= ) { \"\" } if ( n == ) return emptyList ( ) if ( n >= size ) return toList ( ) if ( n == ) return listOf ( this [ ] ) var count = val list = ArrayList < ComplexDouble > ( n ) for ( item in this ) { list . add ( item ) if ( ++ count == n ) break } return list }","docstring":"/**\n * Returns a list containing first [n] elements.\n *\n * @throws IllegalArgumentException if [n] is negative.\n */"} {"signature":"public fun ComplexFloatArray . takeLast ( n : Int ) : List < ComplexFloat >","body":"{ require ( n >= ) { \"\" } if ( n == ) return emptyList ( ) val size = size if ( n >= size ) return toList ( ) if ( n == ) return listOf ( this [ size - ] ) val list = ArrayList < ComplexFloat > ( n ) for ( index in size - n until size ) list . add ( this [ index ] ) return list }","docstring":"/**\n * Returns a list containing last [n] elements.\n *\n * @throws IllegalArgumentException if [n] is negative.\n */"} {"signature":"public fun ComplexDoubleArray . takeLast ( n : Int ) : List < ComplexDouble >","body":"{ require ( n >= ) { \"\" } if ( n == ) return emptyList ( ) val size = size if ( n >= size ) return toList ( ) if ( n == ) return listOf ( this [ size - ] ) val list = ArrayList < ComplexDouble > ( n ) for ( index in size - n until size ) list . add ( this [ index ] ) return list }","docstring":"/**\n * Returns a list containing last [n] elements.\n *\n * @throws IllegalArgumentException if [n] is negative.\n */"} {"signature":"public inline fun ComplexFloatArray . takeLastWhile ( predicate : ( ComplexFloat ) -> Boolean ) : List < ComplexFloat >","body":"{ for ( index in lastIndex downTo ) { if ( ! predicate ( this [ index ] ) ) { return drop ( index + ) } } return toList ( ) }","docstring":"/**\n * Returns a list containing last elements satisfying the given [predicate].\n */"} {"signature":"public inline fun ComplexDoubleArray . takeLastWhile ( predicate : ( ComplexDouble ) -> Boolean ) : List < ComplexDouble >","body":"{ for ( index in lastIndex downTo ) { if ( ! predicate ( this [ index ] ) ) { return drop ( index + ) } } return toList ( ) }","docstring":"/**\n * Returns a list containing last elements satisfying the given [predicate].\n */"} {"signature":"public inline fun ComplexFloatArray . takeWhile ( predicate : ( ComplexFloat ) -> Boolean ) : List < ComplexFloat >","body":"{ val list = ArrayList < ComplexFloat > ( ) 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 */"} {"signature":"public inline fun ComplexDoubleArray . takeWhile ( predicate : ( ComplexDouble ) -> Boolean ) : List < ComplexDouble >","body":"{ val list = ArrayList < ComplexDouble > ( ) 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 */"} {"signature":"public fun ComplexFloatArray . reverse ( ) : Unit","body":"{ val midPoint = ( size / ) - if ( midPoint < ) return var reverseIndex = lastIndex for ( index in .. midPoint ) { val tmp = this [ index ] this [ index ] = this [ reverseIndex ] this [ reverseIndex ] = tmp reverseIndex -- } }","docstring":"/**\n * Reverses elements in the array in-place.\n */"} {"signature":"public fun ComplexDoubleArray . reverse ( ) : Unit","body":"{ val midPoint = ( size / ) - if ( midPoint < ) return var reverseIndex = lastIndex for ( index in .. midPoint ) { val tmp = this [ index ] this [ index ] = this [ reverseIndex ] this [ reverseIndex ] = tmp reverseIndex -- } }","docstring":"/**\n * Reverses elements in the array in-place.\n */"} {"signature":"public fun ComplexFloatArray . reverse ( fromIndex : Int , toIndex : Int ) : Unit","body":"{ checkRangeIndexes ( fromIndex , toIndex , size ) val midPoint = ( fromIndex + toIndex ) / if ( fromIndex == midPoint ) return var reverseIndex = toIndex - for ( index in fromIndex until midPoint ) { val tmp = this [ index ] this [ index ] = this [ reverseIndex ] this [ reverseIndex ] = tmp reverseIndex -- } }","docstring":"/**\n * Reverses elements of the array in the specified range in-place.\n *\n * @param fromIndex the start of the range (inclusive) to reverse.\n * @param toIndex the end of the range (exclusive) to reverse.\n *\n * @throws IndexOutOfBoundsException if [fromIndex] is less than zero or [toIndex] is greater than the size of this array.\n * @throws IllegalArgumentException if [fromIndex] is greater than [toIndex].\n */"} {"signature":"public fun ComplexDoubleArray . reverse ( fromIndex : Int , toIndex : Int ) : Unit","body":"{ checkRangeIndexes ( fromIndex , toIndex , size ) val midPoint = ( fromIndex + toIndex ) / if ( fromIndex == midPoint ) return var reverseIndex = toIndex - for ( index in fromIndex until midPoint ) { val tmp = this [ index ] this [ index ] = this [ reverseIndex ] this [ reverseIndex ] = tmp reverseIndex -- } }","docstring":"/**\n * Reverses elements of the array in the specified range in-place.\n *\n * @param fromIndex the start of the range (inclusive) to reverse.\n * @param toIndex the end of the range (exclusive) to reverse.\n *\n * @throws IndexOutOfBoundsException if [fromIndex] is less than zero or [toIndex] is greater than the size of this array.\n * @throws IllegalArgumentException if [fromIndex] is greater than [toIndex].\n */"} {"signature":"public fun ComplexFloatArray . reversed ( ) : List < ComplexFloat >","body":"{ if ( isEmpty ( ) ) return emptyList ( ) val list = toMutableList ( ) list . reverse ( ) return list }","docstring":"/**\n * Returns a list with elements in reversed order.\n */"} {"signature":"public fun ComplexDoubleArray . reversed ( ) : List < ComplexDouble >","body":"{ if ( isEmpty ( ) ) return emptyList ( ) val list = toMutableList ( ) list . reverse ( ) return list }","docstring":"/**\n * Returns a list with elements in reversed order.\n */"} {"signature":"public fun ComplexFloatArray . reversedArray ( ) : ComplexFloatArray","body":"{ if ( isEmpty ( ) ) return this val result = ComplexFloatArray ( size ) val lastIndex = lastIndex for ( i in .. lastIndex ) result [ lastIndex - i ] = this [ i ] return result }","docstring":"/**\n * Returns an array with elements of this array in reversed order.\n */"} {"signature":"public fun ComplexDoubleArray . reversedArray ( ) : ComplexDoubleArray","body":"{ if ( isEmpty ( ) ) return this val result = ComplexDoubleArray ( size ) val lastIndex = lastIndex for ( i in .. lastIndex ) result [ lastIndex - i ] = this [ i ] return result }","docstring":"/**\n * Returns an array with elements of this array in reversed order.\n */"} {"signature":"public fun ComplexFloatArray . shuffle ( ) : Unit","body":"{ shuffle ( Random ) }","docstring":"/**\n * Randomly shuffles elements in this array in-place.\n */"} {"signature":"public fun ComplexDoubleArray . shuffle ( ) : Unit","body":"{ shuffle ( Random ) }","docstring":"/**\n * Randomly shuffles elements in this array in-place.\n */"} {"signature":"public fun ComplexFloatArray . shuffle ( random : Random ) : Unit","body":"{ for ( i in lastIndex downTo ) { val j = random . nextInt ( i + ) val copy = this [ i ] this [ i ] = this [ j ] this [ j ] = copy } }","docstring":"/**\n * Randomly shuffles elements in this array 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 fun ComplexDoubleArray . shuffle ( random : Random ) : Unit","body":"{ for ( i in lastIndex downTo ) { val j = random . nextInt ( i + ) val copy = this [ i ] this [ i ] = this [ j ] this [ j ] = copy } }","docstring":"/**\n * Randomly shuffles elements in this array 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 < R : Comparable < R > > ComplexFloatArray . sortedBy ( crossinline selector : ( ComplexFloat ) -> R ? ) : List < ComplexFloat >","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 */"} {"signature":"public inline fun < R : Comparable < R > > ComplexDoubleArray . sortedBy ( crossinline selector : ( ComplexDouble ) -> R ? ) : List < ComplexDouble >","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 */"} {"signature":"public inline fun < R : Comparable < R > > ComplexFloatArray . sortedByDescending ( crossinline selector : ( ComplexFloat ) -> R ? ) : List < ComplexFloat >","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 */"} {"signature":"public inline fun < R : Comparable < R > > ComplexDoubleArray . sortedByDescending ( crossinline selector : ( ComplexDouble ) -> R ? ) : List < ComplexDouble >","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 */"} {"signature":"public fun ComplexFloatArray . sortedWith ( comparator : Comparator < in ComplexFloat > ) : List < ComplexFloat >","body":"{ return toTypedArray ( ) . apply { sortWith ( comparator ) } . asList ( ) }","docstring":"/**\n * Returns a list of all elements sorted according to the specified [comparator].\n */"} {"signature":"public fun ComplexDoubleArray . sortedWith ( comparator : Comparator < in ComplexDouble > ) : List < ComplexDouble >","body":"{ return toTypedArray ( ) . apply { sortWith ( comparator ) } . asList ( ) }","docstring":"/**\n * Returns a list of all elements sorted according to the specified [comparator].\n */"} {"signature":"public fun ComplexFloatArray . asList ( ) : List < ComplexFloat >","body":"= object : AbstractList < ComplexFloat > ( ) , RandomAccess { override val size : Int get ( ) = this@asList . size override fun isEmpty ( ) : Boolean = this@asList . isEmpty ( ) override fun contains ( element : ComplexFloat ) : Boolean = this@asList . contains ( element ) override fun get ( index : Int ) : ComplexFloat = this@asList [ index ] override fun indexOf ( element : ComplexFloat ) : Int = this@asList . indexOf ( element ) override fun lastIndexOf ( element : ComplexFloat ) : Int = this@asList . lastIndexOf ( element ) }","docstring":"/**\n * Returns a [List] that wraps the original array.\n */"} {"signature":"public fun ComplexDoubleArray . asList ( ) : List < ComplexDouble >","body":"= object : AbstractList < ComplexDouble > ( ) , RandomAccess { override val size : Int get ( ) = this@asList . size override fun isEmpty ( ) : Boolean = this@asList . isEmpty ( ) override fun contains ( element : ComplexDouble ) : Boolean = this@asList . contains ( element ) override fun get ( index : Int ) : ComplexDouble = this@asList [ index ] override fun indexOf ( element : ComplexDouble ) : Int = this@asList . indexOf ( element ) override fun lastIndexOf ( element : ComplexDouble ) : Int = this@asList . lastIndexOf ( element ) }","docstring":"/**\n * Returns a [List] that wraps the original array.\n */"} {"signature":"public infix fun ComplexFloatArray ? . contentEquals ( other : ComplexFloatArray ? ) : Boolean","body":"= this ? . getFlatArray ( ) contentEquals other ? . getFlatArray ( )","docstring":"/**\n * Returns `true` if the two specified arrays are *structurally* equal to one another,\n * i.e. contain the same number of the same elements in the same order.\n *\n * The elements are compared for equality with the [equals][Any.equals] function.\n */"} {"signature":"public infix fun ComplexDoubleArray ? . contentEquals ( other : ComplexDoubleArray ? ) : Boolean","body":"= this ? . getFlatArray ( ) contentEquals other ? . getFlatArray ( )","docstring":"/**\n * Returns `true` if the two specified arrays are *structurally* equal to one another,\n * i.e. contain the same number of the same elements in the same order.\n *\n * The elements are compared for equality with the [equals][Any.equals] function.\n */"} {"signature":"public fun ComplexFloatArray ? . contentHashCode ( ) : Int","body":"= this ? . getFlatArray ( ) . contentHashCode ( )","docstring":"/**\n * Returns a hash code based on the contents of this array as if it is [List].\n */"} {"signature":"public fun ComplexDoubleArray ? . contentHashCode ( ) : Int","body":"= this ? . getFlatArray ( ) . contentHashCode ( )","docstring":"/**\n * Returns a hash code based on the contents of this array as if it is [List].\n */"} {"signature":"public fun ComplexFloatArray . copyInto ( destination : ComplexFloatArray , destinationOffset : Int = , startIndex : Int = , endIndex : Int = size ) : ComplexFloatArray","body":"{ this . getFlatArray ( ) . copyInto ( destination . getFlatArray ( ) , destinationOffset * , startIndex * , endIndex * ) return destination }","docstring":"/**\n * Copies this array or its subrange into the [destination] array and returns that array.\n *\n * It's allowed to pass the same array in the [destination] and even specify the subrange so that it overlaps with the destination range.\n *\n * @param destination the array to copy to.\n * @param destinationOffset the position in the [destination] array to copy to, 0 by default.\n * @param startIndex the beginning (inclusive) of the subrange to copy, 0 by default.\n * @param endIndex the end (exclusive) of the subrange to copy, size of this array by default.\n *\n * @throws IndexOutOfBoundsException or [IllegalArgumentException] when [startIndex] or [endIndex] is out of range of this array 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 *\n * @return the [destination] array.\n */"} {"signature":"public fun ComplexDoubleArray . copyInto ( destination : ComplexDoubleArray , destinationOffset : Int = , startIndex : Int = , endIndex : Int = size ) : ComplexDoubleArray","body":"{ this . getFlatArray ( ) . copyInto ( destination . getFlatArray ( ) , destinationOffset * , startIndex * , endIndex * ) return destination }","docstring":"/**\n * Copies this array or its subrange into the [destination] array and returns that array.\n *\n * It's allowed to pass the same array in the [destination] and even specify the subrange so that it overlaps with the destination range.\n *\n * @param destination the array to copy to.\n * @param destinationOffset the position in the [destination] array to copy to, 0 by default.\n * @param startIndex the beginning (inclusive) of the subrange to copy, 0 by default.\n * @param endIndex the end (exclusive) of the subrange to copy, size of this array by default.\n *\n * @throws IndexOutOfBoundsException or [IllegalArgumentException] when [startIndex] or [endIndex] is out of range of this array 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 *\n * @return the [destination] array.\n */"} {"signature":"@ Suppress ( \"\" ) public inline fun ComplexFloatArray . copyOf ( ) : ComplexFloatArray","body":"{ val ret = ComplexFloatArray ( size ) this . getFlatArray ( ) . copyInto ( ret . getFlatArray ( ) , , , ret . size * ) return ret }","docstring":"/**\n * Returns new array which is a copy of the original array.\n */"} {"signature":"@ Suppress ( \"\" ) public inline fun ComplexDoubleArray . copyOf ( ) : ComplexDoubleArray","body":"{ val ret = ComplexDoubleArray ( size ) this . getFlatArray ( ) . copyInto ( ret . getFlatArray ( ) , , , ret . size * ) return ret }","docstring":"/**\n * Returns new array which is a copy of the original array.\n */"} {"signature":"@ Suppress ( \"\" ) public inline fun ComplexFloatArray . copyOf ( newSize : Int ) : ComplexFloatArray","body":"{ val ret = ComplexFloatArray ( newSize ) this . getFlatArray ( ) . copyInto ( ret . getFlatArray ( ) , , , min ( this . size , newSize ) * ) return ret }","docstring":"/**\n * Returns new array which is a copy of the original array, resized to the given [newSize].\n * The copy is either truncated or padded at the end with zero values if necessary.\n *\n * - If [newSize] is less than the size of the original array, the copy array is truncated to the [newSize].\n * - If [newSize] is greater than the size of the original array, the extra elements in the copy array are filled with zero values.\n */"} {"signature":"@ Suppress ( \"\" ) public inline fun ComplexDoubleArray . copyOf ( newSize : Int ) : ComplexDoubleArray","body":"{ val ret = ComplexDoubleArray ( newSize ) this . getFlatArray ( ) . copyInto ( ret . getFlatArray ( ) , , , min ( this . size , newSize ) * ) return ret }","docstring":"/**\n * Returns new array which is a copy of the original array, resized to the given [newSize].\n * The copy is either truncated or padded at the end with zero values if necessary.\n *\n * - If [newSize] is less than the size of the original array, the copy array is truncated to the [newSize].\n * - If [newSize] is greater than the size of the original array, the extra elements in the copy array are filled with zero values.\n */"} {"signature":"@ Suppress ( \"\" ) public inline fun ComplexFloatArray . copyOfRange ( fromIndex : Int , toIndex : Int ) : ComplexFloatArray","body":"{ if ( toIndex > size ) throw IndexOutOfBoundsException ( \"\" ) val newLength = toIndex - fromIndex require ( newLength >= ) { \"\" } val ret = ComplexFloatArray ( newLength ) this . copyInto ( ret , , fromIndex , toIndex ) return ret }","docstring":"/**\n * Returns a new array which is a copy of the specified range of the original array.\n *\n * @param fromIndex the start of the range (inclusive) to copy.\n * @param toIndex the end of the range (exclusive) to copy.\n *\n * @throws IndexOutOfBoundsException if [fromIndex] is less than zero or [toIndex] is greater than the size of this array.\n * @throws IllegalArgumentException if [fromIndex] is greater than [toIndex].\n */"} {"signature":"@ Suppress ( \"\" ) public inline fun ComplexDoubleArray . copyOfRange ( fromIndex : Int , toIndex : Int ) : ComplexDoubleArray","body":"{ if ( toIndex > size ) throw IndexOutOfBoundsException ( \"\" ) val newLength = toIndex - fromIndex require ( newLength >= ) { \"\" } val ret = ComplexDoubleArray ( newLength ) this . copyInto ( ret , , fromIndex , toIndex ) return ret }","docstring":"/**\n * Returns a new array which is a copy of the specified range of the original array.\n *\n * @param fromIndex the start of the range (inclusive) to copy.\n * @param toIndex the end of the range (exclusive) to copy.\n *\n * @throws IndexOutOfBoundsException if [fromIndex] is less than zero or [toIndex] is greater than the size of this array.\n * @throws IllegalArgumentException if [fromIndex] is greater than [toIndex].\n */"} {"signature":"public fun ComplexFloatArray . fill ( element : ComplexFloat , fromIndex : Int = , toIndex : Int = size ) : Unit","body":"{ checkRangeIndexes ( fromIndex , toIndex , size ) for ( i in fromIndex until toIndex ) this [ i ] = element }","docstring":"/**\n * Fills this array or its subrange with the specified [element] value.\n *\n * @param fromIndex the start of the range (inclusive) to fill, 0 by default.\n * @param toIndex the end of the range (exclusive) to fill, size of this array by default.\n *\n * @throws IndexOutOfBoundsException if [fromIndex] is less than zero or [toIndex] is greater than the size of this array.\n * @throws IllegalArgumentException if [fromIndex] is greater than [toIndex].\n */"} {"signature":"public fun ComplexDoubleArray . fill ( element : ComplexDouble , fromIndex : Int = , toIndex : Int = size ) : Unit","body":"{ checkRangeIndexes ( fromIndex , toIndex , size ) for ( i in fromIndex until toIndex ) this [ i ] = element }","docstring":"/**\n * Fills this array or its subrange with the specified [element] value.\n *\n * @param fromIndex the start of the range (inclusive) to fill, 0 by default.\n * @param toIndex the end of the range (exclusive) to fill, size of this array by default.\n *\n * @throws IndexOutOfBoundsException if [fromIndex] is less than zero or [toIndex] is greater than the size of this array.\n * @throws IllegalArgumentException if [fromIndex] is greater than [toIndex].\n */"} {"signature":"@ Suppress ( \"\" ) public inline fun ComplexFloatArray . isEmpty ( ) : Boolean","body":"= size == ","docstring":"/**\n * Returns `true` if the array is empty.\n */"} {"signature":"@ Suppress ( \"\" ) public inline fun ComplexDoubleArray . isEmpty ( ) : Boolean","body":"= size == ","docstring":"/**\n * Returns `true` if the array is empty.\n */"} {"signature":"@ Suppress ( \"\" ) public inline fun ComplexFloatArray . isNotEmpty ( ) : Boolean","body":"= ! isEmpty ( )","docstring":"/**\n * Returns `true` if the array is not empty.\n */"} {"signature":"@ Suppress ( \"\" ) public inline fun ComplexDoubleArray . isNotEmpty ( ) : Boolean","body":"= ! isEmpty ( )","docstring":"/**\n * Returns `true` if the array is not empty.\n */"} {"signature":"public operator fun ComplexFloatArray . plus ( element : ComplexFloat ) : ComplexFloatArray","body":"{ val index = size val result = this . copyOf ( index + ) result [ index ] = element return result }","docstring":"/**\n * Returns an array containing all elements of the original array and then the given [element].\n */"} {"signature":"public operator fun ComplexDoubleArray . plus ( element : ComplexDouble ) : ComplexDoubleArray","body":"{ val index = size val result = this . copyOf ( index + ) result [ index ] = element return result }","docstring":"/**\n * Returns an array containing all elements of the original array and then the given [element].\n */"} {"signature":"public operator fun ComplexFloatArray . plus ( elements : Collection < ComplexFloat > ) : ComplexFloatArray","body":"{ var index = size val result = this . copyOf ( index + elements . size ) for ( element in elements ) result [ index ++ ] = element return result }","docstring":"/**\n * Returns an array containing all elements of the original array and then all elements of the given [elements] collection.\n */"} {"signature":"public operator fun ComplexDoubleArray . plus ( elements : Collection < ComplexDouble > ) : ComplexDoubleArray","body":"{ var index = size val result = this . copyOf ( index + elements . size ) for ( element in elements ) result [ index ++ ] = element return result }","docstring":"/**\n * Returns an array containing all elements of the original array and then all elements of the given [elements] collection.\n */"} {"signature":"public operator fun ComplexFloatArray . plus ( elements : ComplexFloatArray ) : ComplexFloatArray","body":"{ val thisSize = size val arraySize = elements . size val result = this . copyOf ( thisSize + arraySize ) elements . copyInto ( result , thisSize , , arraySize ) return result }","docstring":"/**\n * Returns an array containing all elements of the original array and then all elements of the given [elements] array.\n */"} {"signature":"public operator fun ComplexDoubleArray . plus ( elements : ComplexDoubleArray ) : ComplexDoubleArray","body":"{ val thisSize = size val arraySize = elements . size val result = this . copyOf ( thisSize + arraySize ) elements . copyInto ( result , thisSize , , arraySize ) return result }","docstring":"/**\n * Returns an array containing all elements of the original array and then all elements of the given [elements] array.\n */"} {"signature":"public fun Array < out ComplexFloat > . toComplexFloatArray ( ) : ComplexFloatArray","body":"= ComplexFloatArray ( size ) { index -> this [ index ] }","docstring":"/**\n * Returns an array of ComplexFloat containing all of the elements of this generic array.\n */"} {"signature":"public fun Array < out ComplexDouble > . toComplexDoubleArray ( ) : ComplexDoubleArray","body":"= ComplexDoubleArray ( size ) { index -> this [ index ] }","docstring":"/**\n * Returns an array of ComplexDouble containing all of the elements of this generic array.\n */"} {"signature":"public fun FloatArray . toComplexFloatArray ( ) : ComplexFloatArray","body":"= ComplexFloatArray ( size ) . apply { this@toComplexFloatArray . copyInto ( this . getFlatArray ( ) ) }","docstring":"/**\n * Returns an array of ComplexFloat containing all of the elements of this generic array.\n */"} {"signature":"public fun DoubleArray . toComplexDoubleArray ( ) : ComplexDoubleArray","body":"= ComplexDoubleArray ( size ) . apply { this@toComplexDoubleArray . copyInto ( this . getFlatArray ( ) ) }","docstring":"/**\n * Returns an array of ComplexDouble containing all of the elements of this generic array.\n */"} {"signature":"public fun Collection < ComplexFloat > . toComplexFloatArray ( ) : ComplexFloatArray","body":"{ val result = ComplexFloatArray ( size ) var index = for ( element in this ) result [ index ++ ] = element return result }","docstring":"/**\n * Returns an array of ComplexFloat containing all of the elements of this collection.\n */"} {"signature":"public fun Collection < ComplexDouble > . toComplexDoubleArray ( ) : ComplexDoubleArray","body":"{ val result = ComplexDoubleArray ( size ) var index = for ( element in this ) result [ index ++ ] = element return result }","docstring":"/**\n * Returns an array of ComplexDouble containing all of the elements of this generic array.\n */"} {"signature":"@ Suppress ( \"\" ) public fun ComplexFloatArray . toTypedArray ( ) : Array < ComplexFloat >","body":"{ val result = arrayOfNulls < ComplexFloat > ( size ) for ( index in indices ) result [ index ] = this [ index ] return result as Array < ComplexFloat > }","docstring":"/**\n * Returns a *typed* object array containing all of the elements of this primitive array.\n */"} {"signature":"@ Suppress ( \"\" ) public fun ComplexDoubleArray . toTypedArray ( ) : Array < ComplexDouble >","body":"{ val result = arrayOfNulls < ComplexDouble > ( size ) for ( index in indices ) result [ index ] = this [ index ] return result as Array < ComplexDouble > }","docstring":"/**\n * Returns a *typed* object array containing all of the elements of this primitive array.\n */"} {"signature":"public inline fun < K , V > ComplexFloatArray . associate ( transform : ( ComplexFloat ) -> Pair < K , V > ) : Map < K , V >","body":"{ val capacity = mapCapacity ( size ) . coerceAtLeast ( ) return associateTo ( LinkedHashMap ( capacity ) , transform ) }","docstring":"/**\n * Returns a [Map] containing key-value pairs provided by [transform] function\n * applied to elements of the given array.\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 array.\n */"} {"signature":"public inline fun < K , V > ComplexDoubleArray . associate ( transform : ( ComplexDouble ) -> Pair < K , V > ) : Map < K , V >","body":"{ val capacity = mapCapacity ( size ) . coerceAtLeast ( ) return associateTo ( LinkedHashMap ( capacity ) , transform ) }","docstring":"/**\n * Returns a [Map] containing key-value pairs provided by [transform] function\n * applied to elements of the given array.\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 array.\n */"} {"signature":"public inline fun < K > ComplexFloatArray . associateBy ( keySelector : ( ComplexFloat ) -> K ) : Map < K , ComplexFloat >","body":"{ val capacity = mapCapacity ( size ) . coerceAtLeast ( ) return associateByTo ( LinkedHashMap ( capacity ) , keySelector ) }","docstring":"/**\n * Returns a [Map] containing the elements from the given array 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 array.\n */"} {"signature":"public inline fun < K > ComplexDoubleArray . associateBy ( keySelector : ( ComplexDouble ) -> K ) : Map < K , ComplexDouble >","body":"{ val capacity = mapCapacity ( size ) . coerceAtLeast ( ) return associateByTo ( LinkedHashMap ( capacity ) , keySelector ) }","docstring":"/**\n * Returns a [Map] containing the elements from the given array 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 array.\n */"} {"signature":"public inline fun < K , V > ComplexFloatArray . associateBy ( keySelector : ( ComplexFloat ) -> K , valueTransform : ( ComplexFloat ) -> V ) : Map < K , V >","body":"{ val capacity = mapCapacity ( size ) . coerceAtLeast ( ) return associateByTo ( LinkedHashMap ( 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 array.\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 array.\n */"} {"signature":"public inline fun < K , V > ComplexDoubleArray . associateBy ( keySelector : ( ComplexDouble ) -> K , valueTransform : ( ComplexDouble ) -> V ) : Map < K , V >","body":"{ val capacity = mapCapacity ( size ) . coerceAtLeast ( ) return associateByTo ( LinkedHashMap ( 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 array.\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 array.\n */"} {"signature":"public inline fun < K , M : MutableMap < in K , in ComplexFloat > > ComplexFloatArray . associateByTo ( destination : M , keySelector : ( ComplexFloat ) -> 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 array\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 */"} {"signature":"public inline fun < K , M : MutableMap < in K , in ComplexDouble > > ComplexDoubleArray . associateByTo ( destination : M , keySelector : ( ComplexDouble ) -> 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 array\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 */"} {"signature":"public inline fun < K , V , M : MutableMap < in K , in V > > ComplexFloatArray . associateByTo ( destination : M , keySelector : ( ComplexFloat ) -> K , valueTransform : ( ComplexFloat ) -> 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 array.\n *\n * If any two elements would have the same key returned by [keySelector] the last one gets added to the map.\n */"} {"signature":"public inline fun < K , V , M : MutableMap < in K , in V > > ComplexDoubleArray . associateByTo ( destination : M , keySelector : ( ComplexDouble ) -> K , valueTransform : ( ComplexDouble ) -> 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 array.\n *\n * If any two elements would have the same key returned by [keySelector] the last one gets added to the map.\n */"} {"signature":"public inline fun < K , V , M : MutableMap < in K , in V > > ComplexFloatArray . associateTo ( destination : M , transform : ( ComplexFloat ) -> 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 array.\n *\n * If any of two pairs would have the same key the last one gets added to the map.\n */"} {"signature":"public inline fun < K , V , M : MutableMap < in K , in V > > ComplexDoubleArray . associateTo ( destination : M , transform : ( ComplexDouble ) -> 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 array.\n *\n * If any of two pairs would have the same key the last one gets added to the map.\n */"} {"signature":"public inline fun < V > ComplexFloatArray . associateWith ( valueSelector : ( ComplexFloat ) -> V ) : Map < ComplexFloat , V >","body":"{ val result = LinkedHashMap < ComplexFloat , V > ( mapCapacity ( size ) . coerceAtLeast ( ) ) return associateWithTo ( result , valueSelector ) }","docstring":"/**\n * Returns a [Map] where keys are elements from the given array 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 array.\n */"} {"signature":"public inline fun < V > ComplexDoubleArray . associateWith ( valueSelector : ( ComplexDouble ) -> V ) : Map < ComplexDouble , V >","body":"{ val result = LinkedHashMap < ComplexDouble , V > ( mapCapacity ( size ) . coerceAtLeast ( ) ) return associateWithTo ( result , valueSelector ) }","docstring":"/**\n * Returns a [Map] where keys are elements from the given array 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 array.\n */"} {"signature":"public inline fun < V , M : MutableMap < in ComplexFloat , in V > > ComplexFloatArray . associateWithTo ( destination : M , valueSelector : ( ComplexFloat ) -> 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 array,\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 */"} {"signature":"public inline fun < V , M : MutableMap < in ComplexDouble , in V > > ComplexDoubleArray . associateWithTo ( destination : M , valueSelector : ( ComplexDouble ) -> 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 array,\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 */"} {"signature":"public fun < C : MutableCollection < in ComplexFloat > > ComplexFloatArray . 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 < C : MutableCollection < in ComplexDouble > > ComplexDoubleArray . 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 ComplexFloatArray . toHashSet ( ) : HashSet < ComplexFloat >","body":"{ return toCollection ( HashSet ( mapCapacity ( size ) ) ) }","docstring":"/**\n * Returns a new [HashSet] of all elements.\n */"} {"signature":"public fun ComplexDoubleArray . toHashSet ( ) : HashSet < ComplexDouble >","body":"{ return toCollection ( HashSet ( mapCapacity ( size ) ) ) }","docstring":"/**\n * Returns a new [HashSet] of all elements.\n */"} {"signature":"public fun ComplexFloatArray . toList ( ) : List < ComplexFloat >","body":"{ return when ( size ) { -> emptyList ( ) -> listOf ( this [ ] ) else -> this . toMutableList ( ) } }","docstring":"/**\n * Returns a [List] containing all elements.\n */"} {"signature":"public fun ComplexDoubleArray . toList ( ) : List < ComplexDouble >","body":"{ return when ( size ) { -> emptyList ( ) -> listOf ( this [ ] ) else -> this . toMutableList ( ) } }","docstring":"/**\n * Returns a [List] containing all elements.\n */"} {"signature":"public fun ComplexFloatArray . toMutableList ( ) : MutableList < ComplexFloat >","body":"{ val list = ArrayList < ComplexFloat > ( size ) for ( item in this ) list . add ( item ) return list }","docstring":"/**\n * Returns a new [MutableList] filled with all elements of this array.\n */"} {"signature":"public fun ComplexDoubleArray . toMutableList ( ) : MutableList < ComplexDouble >","body":"{ val list = ArrayList < ComplexDouble > ( size ) for ( item in this ) list . add ( item ) return list }","docstring":"/**\n * Returns a new [MutableList] filled with all elements of this array.\n */"} {"signature":"public fun ComplexFloatArray . toSet ( ) : Set < ComplexFloat >","body":"{ return when ( size ) { -> emptySet ( ) -> setOf ( this [ ] ) else -> toCollection ( LinkedHashSet ( mapCapacity ( size ) ) ) } }","docstring":"/**\n * Returns a [Set] of all elements.\n *\n * The returned set preserves the element iteration order of the original array.\n */"} {"signature":"public fun ComplexDoubleArray . toSet ( ) : Set < ComplexDouble >","body":"{ return when ( size ) { -> emptySet ( ) -> setOf ( this [ ] ) else -> toCollection ( LinkedHashSet ( mapCapacity ( size ) ) ) } }","docstring":"/**\n * Returns a [Set] of all elements.\n *\n * The returned set preserves the element iteration order of the original array.\n */"} {"signature":"public inline fun < R > ComplexFloatArray . flatMap ( transform : ( ComplexFloat ) -> Iterable < R > ) : List < R >","body":"{ return flatMapTo ( ArrayList ( ) , transform ) }","docstring":"/**\n * Returns a single list of all elements yielded from results of [transform] function being invoked on each element of original array.\n */"} {"signature":"public inline fun < R > ComplexDoubleArray . flatMap ( transform : ( ComplexDouble ) -> Iterable < R > ) : List < R >","body":"{ return flatMapTo ( ArrayList ( ) , transform ) }","docstring":"/**\n * Returns a single list of all elements yielded from results of [transform] function being invoked on each element of original array.\n */"} {"signature":"public inline fun < R > ComplexFloatArray . flatMapIndexed ( transform : ( index : Int , ComplexFloat ) -> Iterable < R > ) : List < R >","body":"= flatMapIndexedTo ( ArrayList ( ) , 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 array.\n */"} {"signature":"public inline fun < R > ComplexDoubleArray . flatMapIndexed ( transform : ( index : Int , ComplexDouble ) -> Iterable < R > ) : List < R >","body":"= flatMapIndexedTo ( ArrayList ( ) , 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 array.\n */"} {"signature":"public inline fun < R , C : MutableCollection < in R > > ComplexFloatArray . flatMapIndexedTo ( destination : C , transform : ( index : Int , ComplexFloat ) -> Iterable < R > ) : C","body":"{ var index = for ( element in this ) { val list = transform ( 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 array, to the given [destination].\n */"} {"signature":"public inline fun < R , C : MutableCollection < in R > > ComplexDoubleArray . flatMapIndexedTo ( destination : C , transform : ( index : Int , ComplexDouble ) -> Iterable < R > ) : C","body":"{ var index = for ( element in this ) { val list = transform ( 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 array, to the given [destination].\n */"} {"signature":"public inline fun < R , C : MutableCollection < in R > > ComplexFloatArray . flatMapTo ( destination : C , transform : ( ComplexFloat ) -> 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 array, to the given [destination].\n */"} {"signature":"public inline fun < R , C : MutableCollection < in R > > ComplexDoubleArray . flatMapTo ( destination : C , transform : ( ComplexDouble ) -> 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 array, to the given [destination].\n */"} {"signature":"public inline fun < K > ComplexFloatArray . groupBy ( keySelector : ( ComplexFloat ) -> K ) : Map < K , List < ComplexFloat > >","body":"{ return groupByTo ( LinkedHashMap ( ) , keySelector ) }","docstring":"/**\n * Groups elements of the original array 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 array.\n */"} {"signature":"public inline fun < K > ComplexDoubleArray . groupBy ( keySelector : ( ComplexDouble ) -> K ) : Map < K , List < ComplexDouble > >","body":"{ return groupByTo ( LinkedHashMap ( ) , keySelector ) }","docstring":"/**\n * Groups elements of the original array 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 array.\n */"} {"signature":"public inline fun < K , V > ComplexFloatArray . groupBy ( keySelector : ( ComplexFloat ) -> K , valueTransform : ( ComplexFloat ) -> V ) : Map < K , List < V > >","body":"{ return groupByTo ( LinkedHashMap ( ) , keySelector , valueTransform ) }","docstring":"/**\n * Groups values returned by the [valueTransform] function applied to each element of the original array\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 array.\n */"} {"signature":"public inline fun < K , V > ComplexDoubleArray . groupBy ( keySelector : ( ComplexDouble ) -> K , valueTransform : ( ComplexDouble ) -> V ) : Map < K , List < V > >","body":"{ return groupByTo ( LinkedHashMap ( ) , keySelector , valueTransform ) }","docstring":"/**\n * Groups values returned by the [valueTransform] function applied to each element of the original array\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 array.\n */"} {"signature":"public inline fun < K , M : MutableMap < in K , MutableList < ComplexFloat > > > ComplexFloatArray . groupByTo ( destination : M , keySelector : ( ComplexFloat ) -> K ) : M","body":"{ for ( element in this ) { val key = keySelector ( element ) val list = destination . getOrPut ( key ) { ArrayList ( ) } list . add ( element ) } return destination }","docstring":"/**\n * Groups elements of the original array 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 */"} {"signature":"public inline fun < K , M : MutableMap < in K , MutableList < ComplexDouble > > > ComplexDoubleArray . groupByTo ( destination : M , keySelector : ( ComplexDouble ) -> K ) : M","body":"{ for ( element in this ) { val key = keySelector ( element ) val list = destination . getOrPut ( key ) { ArrayList ( ) } list . add ( element ) } return destination }","docstring":"/**\n * Groups elements of the original array 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 */"} {"signature":"public inline fun < K , V , M : MutableMap < in K , MutableList < V > > > ComplexFloatArray . groupByTo ( destination : M , keySelector : ( ComplexFloat ) -> K , valueTransform : ( ComplexFloat ) -> V ) : M","body":"{ for ( element in this ) { val key = keySelector ( element ) val list = destination . getOrPut ( key ) { ArrayList ( ) } list . add ( valueTransform ( element ) ) } return destination }","docstring":"/**\n * Groups values returned by the [valueTransform] function applied to each element of the original array\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 */"} {"signature":"public inline fun < K , V , M : MutableMap < in K , MutableList < V > > > ComplexDoubleArray . groupByTo ( destination : M , keySelector : ( ComplexDouble ) -> K , valueTransform : ( ComplexDouble ) -> V ) : M","body":"{ for ( element in this ) { val key = keySelector ( element ) val list = destination . getOrPut ( key ) { ArrayList ( ) } list . add ( valueTransform ( element ) ) } return destination }","docstring":"/**\n * Groups values returned by the [valueTransform] function applied to each element of the original array\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 */"} {"signature":"public inline fun < R > ComplexFloatArray . map ( transform : ( ComplexFloat ) -> R ) : List < R >","body":"{ return mapTo ( ArrayList ( size ) , transform ) }","docstring":"/**\n * Returns a list containing the results of applying the given [transform] function\n * to each element in the original array.\n */"} {"signature":"public inline fun < R > ComplexDoubleArray . map ( transform : ( ComplexDouble ) -> R ) : List < R >","body":"{ return mapTo ( ArrayList ( size ) , transform ) }","docstring":"/**\n * Returns a list containing the results of applying the given [transform] function\n * to each element in the original array.\n */"} {"signature":"public inline fun < R > ComplexFloatArray . mapIndexed ( transform : ( index : Int , ComplexFloat ) -> R ) : List < R >","body":"{ return mapIndexedTo ( ArrayList ( size ) , 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 array.\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 < R > ComplexDoubleArray . mapIndexed ( transform : ( index : Int , ComplexDouble ) -> R ) : List < R >","body":"{ return mapIndexedTo ( ArrayList ( size ) , 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 array.\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 < R , C : MutableCollection < in R > > ComplexFloatArray . mapIndexedTo ( destination : C , transform : ( index : Int , ComplexFloat ) -> R ) : C","body":"{ var index = for ( item in this ) destination . add ( transform ( index ++ , item ) ) return destination }","docstring":"/**\n * Applies the given [transform] function to each element and its index in the original array\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 < R , C : MutableCollection < in R > > ComplexDoubleArray . mapIndexedTo ( destination : C , transform : ( index : Int , ComplexDouble ) -> R ) : C","body":"{ var index = for ( item in this ) destination . add ( transform ( index ++ , item ) ) return destination }","docstring":"/**\n * Applies the given [transform] function to each element and its index in the original array\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 < R , C : MutableCollection < in R > > ComplexFloatArray . mapTo ( destination : C , transform : ( ComplexFloat ) -> 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 array\n * and appends the results to the given [destination].\n */"} {"signature":"public inline fun < R , C : MutableCollection < in R > > ComplexDoubleArray . mapTo ( destination : C , transform : ( ComplexDouble ) -> 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 array\n * and appends the results to the given [destination].\n */"} {"signature":"public fun ComplexFloatArray . withIndex ( ) : Iterable < IndexedValue < ComplexFloat > >","body":"= object : Iterable < IndexedValue < ComplexFloat > > { override fun iterator ( ) : Iterator < IndexedValue < ComplexFloat > > = object : Iterator < IndexedValue < ComplexFloat > > { private var index = private val iterator = this@withIndex . iterator ( ) override fun hasNext ( ) : Boolean = iterator . hasNext ( ) override fun next ( ) : IndexedValue < ComplexFloat > = IndexedValue ( if ( index ++ < ) throw ArithmeticException ( \"\" ) else index , iterator . next ( ) ) } }","docstring":"/**\n * Returns a lazy [Iterable] that wraps each element of the original array\n * into an [IndexedValue] containing the index of that element and the element itself.\n */"} {"signature":"public fun ComplexDoubleArray . withIndex ( ) : Iterable < IndexedValue < ComplexDouble > >","body":"= object : Iterable < IndexedValue < ComplexDouble > > { override fun iterator ( ) : Iterator < IndexedValue < ComplexDouble > > = object : Iterator < IndexedValue < ComplexDouble > > { private var index = private val iterator = this@withIndex . iterator ( ) override fun hasNext ( ) : Boolean = iterator . hasNext ( ) override fun next ( ) : IndexedValue < ComplexDouble > = IndexedValue ( if ( index ++ < ) throw ArithmeticException ( \"\" ) else index , iterator . next ( ) ) } }","docstring":"/**\n * Returns a lazy [Iterable] that wraps each element of the original array\n * into an [IndexedValue] containing the index of that element and the element itself.\n */"} {"signature":"public fun ComplexFloatArray . distinct ( ) : List < ComplexFloat >","body":"{ return this . toMutableSet ( ) . toList ( ) }","docstring":"/**\n * Returns a list containing only distinct elements from the given array.\n *\n * The elements in the resulting list are in the same order as they were in the source array.\n */"} {"signature":"public fun ComplexDoubleArray . distinct ( ) : List < ComplexDouble >","body":"{ return this . toMutableSet ( ) . toList ( ) }","docstring":"/**\n * Returns a list containing only distinct elements from the given array.\n *\n * The elements in the resulting list are in the same order as they were in the source array.\n */"} {"signature":"public inline fun < K > ComplexFloatArray . distinctBy ( selector : ( ComplexFloat ) -> K ) : List < ComplexFloat >","body":"{ val set = HashSet < K > ( ) val list = ArrayList < ComplexFloat > ( ) 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 array\n * having distinct keys returned by the given [selector] function.\n *\n * The elements in the resulting list are in the same order as they were in the source array.\n */"} {"signature":"public inline fun < K > ComplexDoubleArray . distinctBy ( selector : ( ComplexDouble ) -> K ) : List < ComplexDouble >","body":"{ val set = HashSet < K > ( ) val list = ArrayList < ComplexDouble > ( ) 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 array\n * having distinct keys returned by the given [selector] function.\n *\n * The elements in the resulting list are in the same order as they were in the source array.\n */"} {"signature":"public infix fun ComplexFloatArray . intersect ( other : Iterable < ComplexFloat > ) : Set < ComplexFloat >","body":"{ val set = this . toMutableSet ( ) set . retainAll ( other ) return set }","docstring":"/**\n * Returns a set containing all elements that are contained by both this array and the specified collection.\n *\n * The returned set preserves the element iteration order of the original array.\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 ComplexDoubleArray . intersect ( other : Iterable < ComplexDouble > ) : Set < ComplexDouble >","body":"{ val set = this . toMutableSet ( ) set . retainAll ( other ) return set }","docstring":"/**\n * Returns a set containing all elements that are contained by both this array and the specified collection.\n *\n * The returned set preserves the element iteration order of the original array.\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 ComplexFloatArray . subtract ( other : Iterable < ComplexFloat > ) : Set < ComplexFloat >","body":"{ val set = this . toMutableSet ( ) set . removeAll ( other ) return set }","docstring":"/**\n * Returns a set containing all elements that are contained by this array and not contained by the specified collection.\n *\n * The returned set preserves the element iteration order of the original array.\n */"} {"signature":"public infix fun ComplexDoubleArray . subtract ( other : Iterable < ComplexDouble > ) : Set < ComplexDouble >","body":"{ val set = this . toMutableSet ( ) set . removeAll ( other ) return set }","docstring":"/**\n * Returns a set containing all elements that are contained by this array and not contained by the specified collection.\n *\n * The returned set preserves the element iteration order of the original array.\n */"} {"signature":"public fun ComplexFloatArray . toMutableSet ( ) : MutableSet < ComplexFloat >","body":"{ return toCollection ( LinkedHashSet ( mapCapacity ( size ) ) ) }","docstring":"/**\n * Returns a new [MutableSet] containing all distinct elements from the given array.\n *\n * The returned set preserves the element iteration order of the original array.\n */"} {"signature":"public fun ComplexDoubleArray . toMutableSet ( ) : MutableSet < ComplexDouble >","body":"{ return toCollection ( LinkedHashSet ( mapCapacity ( size ) ) ) }","docstring":"/**\n * Returns a new [MutableSet] containing all distinct elements from the given array.\n *\n * The returned set preserves the element iteration order of the original array.\n */"} {"signature":"public infix fun ComplexFloatArray . union ( other : Iterable < ComplexFloat > ) : Set < ComplexFloat >","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 array.\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 infix fun ComplexDoubleArray . union ( other : Iterable < ComplexDouble > ) : Set < ComplexDouble >","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 array.\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 ComplexFloatArray . all ( predicate : ( ComplexFloat ) -> Boolean ) : Boolean","body":"{ for ( element in this ) if ( ! predicate ( element ) ) return false return true }","docstring":"/**\n * Returns `true` if all elements match the given [predicate].\n */"} {"signature":"public inline fun ComplexDoubleArray . all ( predicate : ( ComplexDouble ) -> Boolean ) : Boolean","body":"{ for ( element in this ) if ( ! predicate ( element ) ) return false return true }","docstring":"/**\n * Returns `true` if all elements match the given [predicate].\n */"} {"signature":"public fun ComplexFloatArray . any ( ) : Boolean","body":"= ! isEmpty ( )","docstring":"/**\n * Returns `true` if array has at least one element.\n */"} {"signature":"public fun ComplexDoubleArray . any ( ) : Boolean","body":"= ! isEmpty ( )","docstring":"/**\n * Returns `true` if array has at least one element.\n */"} {"signature":"public inline fun ComplexFloatArray . any ( predicate : ( ComplexFloat ) -> Boolean ) : Boolean","body":"{ 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 */"} {"signature":"public inline fun ComplexDoubleArray . any ( predicate : ( ComplexDouble ) -> Boolean ) : Boolean","body":"{ 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 */"} {"signature":"@ Suppress ( \"\" ) public inline fun ComplexFloatArray . count ( ) : Int","body":"= size","docstring":"/**\n * Returns the number of elements in this array.\n */"} {"signature":"@ Suppress ( \"\" ) public inline fun ComplexDoubleArray . count ( ) : Int","body":"= size","docstring":"/**\n * Returns the number of elements in this array.\n */"} {"signature":"public inline fun ComplexFloatArray . count ( predicate : ( ComplexFloat ) -> Boolean ) : Int","body":"{ var count = for ( element in this ) if ( predicate ( element ) ) ++ count return count }","docstring":"/**\n * Returns the number of elements matching the given [predicate].\n */"} {"signature":"public inline fun ComplexDoubleArray . count ( predicate : ( ComplexDouble ) -> Boolean ) : Int","body":"{ var count = for ( element in this ) if ( predicate ( element ) ) ++ count return count }","docstring":"/**\n * Returns the number of elements matching the given [predicate].\n */"} {"signature":"public inline fun < R > ComplexFloatArray . fold ( initial : R , operation : ( acc : R , ComplexFloat ) -> 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 array 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 < R > ComplexDoubleArray . fold ( initial : R , operation : ( acc : R , ComplexDouble ) -> 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 array 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 < R > ComplexFloatArray . foldIndexed ( initial : R , operation : ( index : Int , acc : R , ComplexFloat ) -> R ) : R","body":"{ var index = var accumulator = initial for ( element in this ) accumulator = operation ( 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 array.\n *\n * Returns the specified [initial] value if the array 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 < R > ComplexDoubleArray . foldIndexed ( initial : R , operation : ( index : Int , acc : R , ComplexDouble ) -> R ) : R","body":"{ var index = var accumulator = initial for ( element in this ) accumulator = operation ( 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 array.\n *\n * Returns the specified [initial] value if the array 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 < R > ComplexFloatArray . foldRight ( initial : R , operation : ( ComplexFloat , acc : R ) -> R ) : R","body":"{ var index = lastIndex var accumulator = initial while ( index >= ) { accumulator = operation ( get ( index -- ) , 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 array 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 < R > ComplexDoubleArray . foldRight ( initial : R , operation : ( ComplexDouble , acc : R ) -> R ) : R","body":"{ var index = lastIndex var accumulator = initial while ( index >= ) { accumulator = operation ( get ( index -- ) , 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 array 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 < R > ComplexFloatArray . foldRightIndexed ( initial : R , operation : ( index : Int , ComplexFloat , acc : R ) -> R ) : R","body":"{ var index = lastIndex var accumulator = initial while ( index >= ) { accumulator = operation ( index , get ( index ) , accumulator ) -- index } 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 array and current accumulator value.\n *\n * Returns the specified [initial] value if the array 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":"public inline fun < R > ComplexDoubleArray . foldRightIndexed ( initial : R , operation : ( index : Int , ComplexDouble , acc : R ) -> R ) : R","body":"{ var index = lastIndex var accumulator = initial while ( index >= ) { accumulator = operation ( index , get ( index ) , accumulator ) -- index } 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 array and current accumulator value.\n *\n * Returns the specified [initial] value if the array 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":"public inline fun ComplexFloatArray . forEach ( action : ( ComplexFloat ) -> Unit ) : Unit","body":"{ for ( element in this ) action ( element ) }","docstring":"/**\n * Performs the given [action] on each element.\n */"} {"signature":"public inline fun ComplexDoubleArray . forEach ( action : ( ComplexDouble ) -> Unit ) : Unit","body":"{ for ( element in this ) action ( element ) }","docstring":"/**\n * Performs the given [action] on each element.\n */"} {"signature":"public inline fun ComplexFloatArray . forEachIndexed ( action : ( index : Int , ComplexFloat ) -> Unit ) : Unit","body":"{ var index = for ( item in this ) action ( 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":"public inline fun ComplexDoubleArray . forEachIndexed ( action : ( index : Int , ComplexDouble ) -> Unit ) : Unit","body":"{ var index = for ( item in this ) action ( 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":"public inline fun < R : Comparable < R > > ComplexFloatArray . maxByOrNull ( selector : ( ComplexFloat ) -> R ) : ComplexFloat ?","body":"{ if ( isEmpty ( ) ) return null var maxElem = this [ ] val lastIndex = this . lastIndex if ( lastIndex == ) return maxElem var maxValue = selector ( maxElem ) for ( i in .. lastIndex ) { val e = this [ i ] val v = selector ( e ) if ( maxValue < v ) { maxElem = e maxValue = v } } return maxElem }","docstring":"/**\n * Returns the first element yielding the largest value of the given function or `null` if there are no elements.\n */"} {"signature":"public inline fun < R : Comparable < R > > ComplexDoubleArray . maxByOrNull ( selector : ( ComplexDouble ) -> R ) : ComplexDouble ?","body":"{ if ( isEmpty ( ) ) return null var maxElem = this [ ] val lastIndex = this . lastIndex if ( lastIndex == ) return maxElem var maxValue = selector ( maxElem ) for ( i in .. lastIndex ) { val e = this [ i ] val v = selector ( e ) if ( maxValue < v ) { maxElem = e maxValue = v } } return maxElem }","docstring":"/**\n * Returns the first element yielding the largest value of the given function or `null` if there are no elements.\n */"} {"signature":"public inline fun < R : Comparable < R > > ComplexFloatArray . maxOf ( selector : ( ComplexFloat ) -> R ) : R","body":"{ if ( isEmpty ( ) ) throw NoSuchElementException ( ) var maxValue = selector ( this [ ] ) for ( i in .. lastIndex ) { val v = selector ( this [ i ] ) 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 array.\n *\n * @throws NoSuchElementException if the array is empty.\n */"} {"signature":"public inline fun < R : Comparable < R > > ComplexDoubleArray . maxOf ( selector : ( ComplexDouble ) -> R ) : R","body":"{ if ( isEmpty ( ) ) throw NoSuchElementException ( ) var maxValue = selector ( this [ ] ) for ( i in .. lastIndex ) { val v = selector ( this [ i ] ) 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 array.\n *\n * @throws NoSuchElementException if the array is empty.\n */"} {"signature":"public inline fun < R : Comparable < R > > ComplexFloatArray . maxOfOrNull ( selector : ( ComplexFloat ) -> R ) : R ?","body":"{ if ( isEmpty ( ) ) return null var maxValue = selector ( this [ ] ) for ( i in .. lastIndex ) { val v = selector ( this [ i ] ) 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 array or `null` if there are no elements.\n */"} {"signature":"public inline fun < R : Comparable < R > > ComplexDoubleArray . maxOfOrNull ( selector : ( ComplexDouble ) -> R ) : R ?","body":"{ if ( isEmpty ( ) ) return null var maxValue = selector ( this [ ] ) for ( i in .. lastIndex ) { val v = selector ( this [ i ] ) 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 array or `null` if there are no elements.\n */"} {"signature":"public inline fun < R > ComplexFloatArray . maxOfWith ( comparator : Comparator < in R > , selector : ( ComplexFloat ) -> R ) : R","body":"{ if ( isEmpty ( ) ) throw NoSuchElementException ( ) var maxValue = selector ( this [ ] ) for ( i in .. lastIndex ) { val v = selector ( this [ i ] ) 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 array.\n *\n * @throws NoSuchElementException if the array is empty.\n */"} {"signature":"public inline fun < R > ComplexDoubleArray . maxOfWith ( comparator : Comparator < in R > , selector : ( ComplexDouble ) -> R ) : R","body":"{ if ( isEmpty ( ) ) throw NoSuchElementException ( ) var maxValue = selector ( this [ ] ) for ( i in .. lastIndex ) { val v = selector ( this [ i ] ) 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 array.\n *\n * @throws NoSuchElementException if the array is empty.\n */"} {"signature":"public inline fun < R > ComplexFloatArray . maxOfWithOrNull ( comparator : Comparator < in R > , selector : ( ComplexFloat ) -> R ) : R ?","body":"{ if ( isEmpty ( ) ) return null var maxValue = selector ( this [ ] ) for ( i in .. lastIndex ) { val v = selector ( this [ i ] ) 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 array or `null` if there are no elements.\n */"} {"signature":"public inline fun < R > ComplexDoubleArray . maxOfWithOrNull ( comparator : Comparator < in R > , selector : ( ComplexDouble ) -> R ) : R ?","body":"{ if ( isEmpty ( ) ) return null var maxValue = selector ( this [ ] ) for ( i in .. lastIndex ) { val v = selector ( this [ i ] ) 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 array or `null` if there are no elements.\n */"} {"signature":"public inline fun < R : Comparable < R > > ComplexFloatArray . minByOrNull ( selector : ( ComplexFloat ) -> R ) : ComplexFloat ?","body":"{ if ( isEmpty ( ) ) return null var minElem = this [ ] val lastIndex = this . lastIndex if ( lastIndex == ) return minElem var minValue = selector ( minElem ) for ( i in .. lastIndex ) { val e = this [ i ] val v = selector ( e ) if ( minValue > v ) { minElem = e minValue = v } } return minElem }","docstring":"/**\n * Returns the first element yielding the smallest value of the given function or `null` if there are no elements.\n */"} {"signature":"public inline fun < R : Comparable < R > > ComplexDoubleArray . minByOrNull ( selector : ( ComplexDouble ) -> R ) : ComplexDouble ?","body":"{ if ( isEmpty ( ) ) return null var minElem = this [ ] val lastIndex = this . lastIndex if ( lastIndex == ) return minElem var minValue = selector ( minElem ) for ( i in .. lastIndex ) { val e = this [ i ] val v = selector ( e ) if ( minValue > v ) { minElem = e minValue = v } } return minElem }","docstring":"/**\n * Returns the first element yielding the smallest value of the given function or `null` if there are no elements.\n */"} {"signature":"public inline fun < R : Comparable < R > > ComplexFloatArray . minOf ( selector : ( ComplexFloat ) -> R ) : R","body":"{ if ( isEmpty ( ) ) throw NoSuchElementException ( ) var minValue = selector ( this [ ] ) for ( i in .. lastIndex ) { val v = selector ( this [ i ] ) 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 array.\n *\n * @throws NoSuchElementException if the array is empty.\n */"} {"signature":"public inline fun < R : Comparable < R > > ComplexDoubleArray . minOf ( selector : ( ComplexDouble ) -> R ) : R","body":"{ if ( isEmpty ( ) ) throw NoSuchElementException ( ) var minValue = selector ( this [ ] ) for ( i in .. lastIndex ) { val v = selector ( this [ i ] ) 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 array.\n *\n * @throws NoSuchElementException if the array is empty.\n */"} {"signature":"public inline fun < R : Comparable < R > > ComplexFloatArray . minOfOrNull ( selector : ( ComplexFloat ) -> R ) : R ?","body":"{ if ( isEmpty ( ) ) return null var minValue = selector ( this [ ] ) for ( i in .. lastIndex ) { val v = selector ( this [ i ] ) 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 array or `null` if there are no elements.\n */"} {"signature":"public inline fun < R : Comparable < R > > ComplexDoubleArray . minOfOrNull ( selector : ( ComplexDouble ) -> R ) : R ?","body":"{ if ( isEmpty ( ) ) return null var minValue = selector ( this [ ] ) for ( i in .. lastIndex ) { val v = selector ( this [ i ] ) 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 array or `null` if there are no elements.\n */"} {"signature":"public inline fun < R > ComplexFloatArray . minOfWith ( comparator : Comparator < in R > , selector : ( ComplexFloat ) -> R ) : R","body":"{ if ( isEmpty ( ) ) throw NoSuchElementException ( ) var minValue = selector ( this [ ] ) for ( i in .. lastIndex ) { val v = selector ( this [ i ] ) 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 array.\n *\n * @throws NoSuchElementException if the array is empty.\n */"} {"signature":"public inline fun < R > ComplexDoubleArray . minOfWith ( comparator : Comparator < in R > , selector : ( ComplexDouble ) -> R ) : R","body":"{ if ( isEmpty ( ) ) throw NoSuchElementException ( ) var minValue = selector ( this [ ] ) for ( i in .. lastIndex ) { val v = selector ( this [ i ] ) 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 array.\n *\n * @throws NoSuchElementException if the array is empty.\n */"} {"signature":"public inline fun < R > ComplexFloatArray . minOfWithOrNull ( comparator : Comparator < in R > , selector : ( ComplexFloat ) -> R ) : R ?","body":"{ if ( isEmpty ( ) ) return null var minValue = selector ( this [ ] ) for ( i in .. lastIndex ) { val v = selector ( this [ i ] ) 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 array or `null` if there are no elements.\n */"} {"signature":"public inline fun < R > ComplexDoubleArray . minOfWithOrNull ( comparator : Comparator < in R > , selector : ( ComplexDouble ) -> R ) : R ?","body":"{ if ( isEmpty ( ) ) return null var minValue = selector ( this [ ] ) for ( i in .. lastIndex ) { val v = selector ( this [ i ] ) 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 array or `null` if there are no elements.\n */"} {"signature":"public fun ComplexFloatArray . none ( ) : Boolean","body":"= isEmpty ( )","docstring":"/**\n * Returns `true` if the array has no elements.\n */"} {"signature":"public fun ComplexDoubleArray . none ( ) : Boolean","body":"= isEmpty ( )","docstring":"/**\n * Returns `true` if the array has no elements.\n */"} {"signature":"public inline fun ComplexFloatArray . none ( predicate : ( ComplexFloat ) -> Boolean ) : Boolean","body":"{ for ( element in this ) if ( predicate ( element ) ) return false return true }","docstring":"/**\n * Returns `true` if no elements match the given [predicate].\n */"} {"signature":"public inline fun ComplexDoubleArray . none ( predicate : ( ComplexDouble ) -> Boolean ) : Boolean","body":"{ for ( element in this ) if ( predicate ( element ) ) return false return true }","docstring":"/**\n * Returns `true` if no elements match the given [predicate].\n */"} {"signature":"public inline fun ComplexFloatArray . onEach ( action : ( ComplexFloat ) -> Unit ) : ComplexFloatArray","body":"= apply { for ( element in this ) action ( element ) }","docstring":"/**\n * Performs the given [action] on each element and returns the array itself afterwards.\n */"} {"signature":"public inline fun ComplexDoubleArray . onEach ( action : ( ComplexDouble ) -> Unit ) : ComplexDoubleArray","body":"= apply { for ( element in this ) action ( element ) }","docstring":"/**\n * Performs the given [action] on each element and returns the array itself afterwards.\n */"} {"signature":"public inline fun ComplexFloatArray . onEachIndexed ( action : ( index : Int , ComplexFloat ) -> Unit ) : ComplexFloatArray","body":"= apply { forEachIndexed ( action ) }","docstring":"/**\n * Performs the given [action] on each element, providing sequential index with the element,\n * and returns the array 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 ComplexDoubleArray . onEachIndexed ( action : ( index : Int , ComplexDouble ) -> Unit ) : ComplexDoubleArray","body":"= apply { forEachIndexed ( action ) }","docstring":"/**\n * Performs the given [action] on each element, providing sequential index with the element,\n * and returns the array 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 ComplexFloatArray . reduce ( operation : ( acc : ComplexFloat , ComplexFloat ) -> ComplexFloat ) : ComplexFloat","body":"{ if ( isEmpty ( ) ) throw UnsupportedOperationException ( \"\" ) var accumulator = this [ ] for ( index in .. lastIndex ) { accumulator = operation ( accumulator , this [ index ] ) } 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 array is empty. If the array 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 */"} {"signature":"public inline fun ComplexDoubleArray . reduce ( operation : ( acc : ComplexDouble , ComplexDouble ) -> ComplexDouble ) : ComplexDouble","body":"{ if ( isEmpty ( ) ) throw UnsupportedOperationException ( \"\" ) var accumulator = this [ ] for ( index in .. lastIndex ) { accumulator = operation ( accumulator , this [ index ] ) } 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 array is empty. If the array 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 */"} {"signature":"public inline fun ComplexFloatArray . reduceIndexed ( operation : ( index : Int , acc : ComplexFloat , ComplexFloat ) -> ComplexFloat ) : ComplexFloat","body":"{ if ( isEmpty ( ) ) throw UnsupportedOperationException ( \"\" ) var accumulator = this [ ] for ( index in .. lastIndex ) { accumulator = operation ( index , accumulator , this [ index ] ) } 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 array.\n *\n * Throws an exception if this array is empty. If the array 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 */"} {"signature":"public inline fun ComplexDoubleArray . reduceIndexed ( operation : ( index : Int , acc : ComplexDouble , ComplexDouble ) -> ComplexDouble ) : ComplexDouble","body":"{ if ( isEmpty ( ) ) throw UnsupportedOperationException ( \"\" ) var accumulator = this [ ] for ( index in .. lastIndex ) { accumulator = operation ( index , accumulator , this [ index ] ) } 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 array.\n *\n * Throws an exception if this array is empty. If the array 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 */"} {"signature":"public inline fun ComplexFloatArray . reduceIndexedOrNull ( operation : ( index : Int , acc : ComplexFloat , ComplexFloat ) -> ComplexFloat ) : ComplexFloat ?","body":"{ if ( isEmpty ( ) ) return null var accumulator = this [ ] for ( index in .. lastIndex ) { accumulator = operation ( index , accumulator , this [ index ] ) } 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 array.\n *\n * Returns `null` if the array 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 */"} {"signature":"public inline fun ComplexDoubleArray . reduceIndexedOrNull ( operation : ( index : Int , acc : ComplexDouble , ComplexDouble ) -> ComplexDouble ) : ComplexDouble ?","body":"{ if ( isEmpty ( ) ) return null var accumulator = this [ ] for ( index in .. lastIndex ) { accumulator = operation ( index , accumulator , this [ index ] ) } 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 array.\n *\n * Returns `null` if the array 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 */"} {"signature":"public inline fun ComplexFloatArray . reduceOrNull ( operation : ( acc : ComplexFloat , ComplexFloat ) -> ComplexFloat ) : ComplexFloat ?","body":"{ if ( isEmpty ( ) ) return null var accumulator = this [ ] for ( index in .. lastIndex ) { accumulator = operation ( accumulator , this [ index ] ) } 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 array is empty.\n *\n * @param [operation] function that takes current accumulator value and an element,\n * and calculates the next accumulator value.\n */"} {"signature":"public inline fun ComplexDoubleArray . reduceOrNull ( operation : ( acc : ComplexDouble , ComplexDouble ) -> ComplexDouble ) : ComplexDouble ?","body":"{ if ( isEmpty ( ) ) return null var accumulator = this [ ] for ( index in .. lastIndex ) { accumulator = operation ( accumulator , this [ index ] ) } 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 array is empty.\n *\n * @param [operation] function that takes current accumulator value and an element,\n * and calculates the next accumulator value.\n */"} {"signature":"public inline fun ComplexFloatArray . reduceRight ( operation : ( ComplexFloat , acc : ComplexFloat ) -> ComplexFloat ) : ComplexFloat","body":"{ var index = lastIndex if ( index < ) throw UnsupportedOperationException ( \"\" ) var accumulator = get ( index -- ) while ( index >= ) { accumulator = operation ( get ( index -- ) , 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 array is empty. If the array 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 */"} {"signature":"public inline fun ComplexDoubleArray . reduceRight ( operation : ( ComplexDouble , acc : ComplexDouble ) -> ComplexDouble ) : ComplexDouble","body":"{ var index = lastIndex if ( index < ) throw UnsupportedOperationException ( \"\" ) var accumulator = get ( index -- ) while ( index >= ) { accumulator = operation ( get ( index -- ) , 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 array is empty. If the array 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 */"} {"signature":"public inline fun ComplexFloatArray . reduceRightIndexed ( operation : ( index : Int , ComplexFloat , acc : ComplexFloat ) -> ComplexFloat ) : ComplexFloat","body":"{ var index = lastIndex if ( index < ) throw UnsupportedOperationException ( \"\" ) var accumulator = get ( index -- ) while ( index >= ) { accumulator = operation ( index , get ( index ) , accumulator ) -- index } 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 array and current accumulator value.\n *\n * Throws an exception if this array is empty. If the array 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 */"} {"signature":"public inline fun ComplexDoubleArray . reduceRightIndexed ( operation : ( index : Int , ComplexDouble , acc : ComplexDouble ) -> ComplexDouble ) : ComplexDouble","body":"{ var index = lastIndex if ( index < ) throw UnsupportedOperationException ( \"\" ) var accumulator = get ( index -- ) while ( index >= ) { accumulator = operation ( index , get ( index ) , accumulator ) -- index } 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 array and current accumulator value.\n *\n * Throws an exception if this array is empty. If the array 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 */"} {"signature":"public inline fun ComplexFloatArray . reduceRightIndexedOrNull ( operation : ( index : Int , ComplexFloat , acc : ComplexFloat ) -> ComplexFloat ) : ComplexFloat ?","body":"{ var index = lastIndex if ( index < ) return null var accumulator = get ( index -- ) while ( index >= ) { accumulator = operation ( index , get ( index ) , accumulator ) -- index } 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 array and current accumulator value.\n *\n * Returns `null` if the array 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 */"} {"signature":"public inline fun ComplexDoubleArray . reduceRightIndexedOrNull ( operation : ( index : Int , ComplexDouble , acc : ComplexDouble ) -> ComplexDouble ) : ComplexDouble ?","body":"{ var index = lastIndex if ( index < ) return null var accumulator = get ( index -- ) while ( index >= ) { accumulator = operation ( index , get ( index ) , accumulator ) -- index } 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 array and current accumulator value.\n *\n * Returns `null` if the array 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 */"} {"signature":"public inline fun ComplexFloatArray . reduceRightOrNull ( operation : ( ComplexFloat , acc : ComplexFloat ) -> ComplexFloat ) : ComplexFloat ?","body":"{ var index = lastIndex if ( index < ) return null var accumulator = get ( index -- ) while ( index >= ) { accumulator = operation ( get ( index -- ) , 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 array is empty.\n *\n * @param [operation] function that takes an element and current accumulator value,\n * and calculates the next accumulator value.\n */"} {"signature":"public inline fun ComplexDoubleArray . reduceRightOrNull ( operation : ( ComplexDouble , acc : ComplexDouble ) -> ComplexDouble ) : ComplexDouble ?","body":"{ var index = lastIndex if ( index < ) return null var accumulator = get ( index -- ) while ( index >= ) { accumulator = operation ( get ( index -- ) , 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 array is empty.\n *\n * @param [operation] function that takes an element and current accumulator value,\n * and calculates the next accumulator value.\n */"} {"signature":"public inline fun < R > ComplexFloatArray . runningFold ( initial : R , operation : ( acc : R , ComplexFloat ) -> R ) : List < R >","body":"{ if ( isEmpty ( ) ) return listOf ( initial ) val result = ArrayList < R > ( size + ) . 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 */"} {"signature":"public inline fun < R > ComplexDoubleArray . runningFold ( initial : R , operation : ( acc : R , ComplexDouble ) -> R ) : List < R >","body":"{ if ( isEmpty ( ) ) return listOf ( initial ) val result = ArrayList < R > ( size + ) . 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 */"} {"signature":"public inline fun < R > ComplexFloatArray . runningFoldIndexed ( initial : R , operation : ( index : Int , acc : R , ComplexFloat ) -> R ) : List < R >","body":"{ if ( isEmpty ( ) ) return listOf ( initial ) val result = ArrayList < R > ( size + ) . apply { add ( initial ) } var accumulator = initial for ( index in indices ) { accumulator = operation ( index , accumulator , this [ index ] ) 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 array 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 */"} {"signature":"public inline fun < R > ComplexDoubleArray . runningFoldIndexed ( initial : R , operation : ( index : Int , acc : R , ComplexDouble ) -> R ) : List < R >","body":"{ if ( isEmpty ( ) ) return listOf ( initial ) val result = ArrayList < R > ( size + ) . apply { add ( initial ) } var accumulator = initial for ( index in indices ) { accumulator = operation ( index , accumulator , this [ index ] ) 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 array 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 */"} {"signature":"public inline fun ComplexFloatArray . runningReduce ( operation : ( acc : ComplexFloat , ComplexFloat ) -> ComplexFloat ) : List < ComplexFloat >","body":"{ if ( isEmpty ( ) ) return emptyList ( ) var accumulator = this [ ] val result = ArrayList < ComplexFloat > ( size ) . apply { add ( accumulator ) } for ( index in until size ) { accumulator = operation ( accumulator , this [ index ] ) 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 array.\n *\n * @param [operation] function that takes current accumulator value and an element, and calculates the next accumulator value.\n */"} {"signature":"public inline fun ComplexDoubleArray . runningReduce ( operation : ( acc : ComplexDouble , ComplexDouble ) -> ComplexDouble ) : List < ComplexDouble >","body":"{ if ( isEmpty ( ) ) return emptyList ( ) var accumulator = this [ ] val result = ArrayList < ComplexDouble > ( size ) . apply { add ( accumulator ) } for ( index in until size ) { accumulator = operation ( accumulator , this [ index ] ) 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 array.\n *\n * @param [operation] function that takes current accumulator value and an element, and calculates the next accumulator value.\n */"} {"signature":"public inline fun ComplexFloatArray . runningReduceIndexed ( operation : ( index : Int , acc : ComplexFloat , ComplexFloat ) -> ComplexFloat ) : List < ComplexFloat >","body":"{ if ( isEmpty ( ) ) return emptyList ( ) var accumulator = this [ ] val result = ArrayList < ComplexFloat > ( size ) . apply { add ( accumulator ) } for ( index in until size ) { accumulator = operation ( index , accumulator , this [ index ] ) 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 array and current accumulator value that starts with the first element of this array.\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 ComplexDoubleArray . runningReduceIndexed ( operation : ( index : Int , acc : ComplexDouble , ComplexDouble ) -> ComplexDouble ) : List < ComplexDouble >","body":"{ if ( isEmpty ( ) ) return emptyList ( ) var accumulator = this [ ] val result = ArrayList < ComplexDouble > ( size ) . apply { add ( accumulator ) } for ( index in until size ) { accumulator = operation ( index , accumulator , this [ index ] ) 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 array and current accumulator value that starts with the first element of this array.\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 < R > ComplexFloatArray . scan ( initial : R , operation : ( acc : R , ComplexFloat ) -> R ) : List < R >","body":"= 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 */"} {"signature":"public inline fun < R > ComplexDoubleArray . scan ( initial : R , operation : ( acc : R , ComplexDouble ) -> R ) : List < R >","body":"= 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 */"} {"signature":"public inline fun < R > ComplexFloatArray . scanIndexed ( initial : R , operation : ( index : Int , acc : R , ComplexFloat ) -> R ) : List < R >","body":"= 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 array 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 */"} {"signature":"public inline fun < R > ComplexDoubleArray . scanIndexed ( initial : R , operation : ( index : Int , acc : R , ComplexDouble ) -> R ) : List < R >","body":"= 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 array 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 */"} {"signature":"public inline fun ComplexFloatArray . partition ( predicate : ( ComplexFloat ) -> Boolean ) : Pair < List < ComplexFloat > , List < ComplexFloat > >","body":"{ val first = ArrayList < ComplexFloat > ( ) val second = ArrayList < ComplexFloat > ( ) for ( element in this ) { if ( predicate ( element ) ) { first . add ( element ) } else { second . add ( element ) } } return Pair ( first , second ) }","docstring":"/**\n * Splits the original array 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 */"} {"signature":"public inline fun ComplexDoubleArray . partition ( predicate : ( ComplexDouble ) -> Boolean ) : Pair < List < ComplexDouble > , List < ComplexDouble > >","body":"{ val first = ArrayList < ComplexDouble > ( ) val second = ArrayList < ComplexDouble > ( ) for ( element in this ) { if ( predicate ( element ) ) { first . add ( element ) } else { second . add ( element ) } } return Pair ( first , second ) }","docstring":"/**\n * Splits the original array 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 */"} {"signature":"public infix fun < R > ComplexFloatArray . zip ( other : Array < out R > ) : List < Pair < ComplexFloat , R > >","body":"= zip ( other ) { t1 , t2 -> t1 to t2 }","docstring":"/**\n * Returns a list of pairs built from the elements of `this` array and the [other] array with the same index.\n * The returned list has length of the shortest collection.\n */"} {"signature":"public infix fun < R > ComplexDoubleArray . zip ( other : Array < out R > ) : List < Pair < ComplexDouble , R > >","body":"= zip ( other ) { t1 , t2 -> t1 to t2 }","docstring":"/**\n * Returns a list of pairs built from the elements of `this` array and the [other] array with the same index.\n * The returned list has length of the shortest collection.\n */"} {"signature":"public inline fun < R , V > ComplexFloatArray . zip ( other : Array < out R > , transform : ( a : ComplexFloat , b : R ) -> V ) : List < V >","body":"{ val size = minOf ( size , other . size ) val list = ArrayList < V > ( size ) for ( i in until size ) { list . add ( transform ( this [ i ] , other [ i ] ) ) } return list }","docstring":"/**\n * Returns a list of values built from the elements of `this` array 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 */"} {"signature":"public inline fun < R , V > ComplexDoubleArray . zip ( other : Array < out R > , transform : ( a : ComplexDouble , b : R ) -> V ) : List < V >","body":"{ val size = minOf ( size , other . size ) val list = ArrayList < V > ( size ) for ( i in until size ) { list . add ( transform ( this [ i ] , other [ i ] ) ) } return list }","docstring":"/**\n * Returns a list of values built from the elements of `this` array 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 */"} {"signature":"public infix fun < R > ComplexFloatArray . zip ( other : Iterable < R > ) : List < Pair < ComplexFloat , R > >","body":"= zip ( other ) { t1 , t2 -> t1 to t2 }","docstring":"/**\n * Returns a list of pairs built from the elements of `this` collection and [other] array with the same index.\n * The returned list has length of the shortest collection.\n */"} {"signature":"public infix fun < R > ComplexDoubleArray . zip ( other : Iterable < R > ) : List < Pair < ComplexDouble , R > >","body":"= zip ( other ) { t1 , t2 -> t1 to t2 }","docstring":"/**\n * Returns a list of pairs built from the elements of `this` collection and [other] array with the same index.\n * The returned list has length of the shortest collection.\n */"} {"signature":"public inline fun < R , V > ComplexFloatArray . zip ( other : Iterable < R > , transform : ( a : ComplexFloat , b : R ) -> V ) : List < V >","body":"{ val arraySize = size val list = ArrayList < V > ( minOf ( if ( other is Collection < * > ) other . size else , arraySize ) ) var i = for ( element in other ) { if ( i >= arraySize ) break list . add ( transform ( this [ i ++ ] , element ) ) } return list }","docstring":"/**\n * Returns a list of values built from the elements of `this` array 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 */"} {"signature":"public inline fun < R , V > ComplexDoubleArray . zip ( other : Iterable < R > , transform : ( a : ComplexDouble , b : R ) -> V ) : List < V >","body":"{ val arraySize = size val list = ArrayList < V > ( minOf ( if ( other is Collection < * > ) other . size else , arraySize ) ) var i = for ( element in other ) { if ( i >= arraySize ) break list . add ( transform ( this [ i ++ ] , element ) ) } return list }","docstring":"/**\n * Returns a list of values built from the elements of `this` array 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 */"} {"signature":"public infix fun ComplexFloatArray . zip ( other : ComplexFloatArray ) : List < Pair < ComplexFloat , ComplexFloat > >","body":"= zip ( other ) { t1 , t2 -> t1 to t2 }","docstring":"/**\n * Returns a list of pairs built from the elements of `this` array and the [other] array with the same index.\n * The returned list has length of the shortest collection.\n */"} {"signature":"public infix fun ComplexDoubleArray . zip ( other : ComplexDoubleArray ) : List < Pair < ComplexDouble , ComplexDouble > >","body":"= zip ( other ) { t1 , t2 -> t1 to t2 }","docstring":"/**\n * Returns a list of pairs built from the elements of `this` array and the [other] array with the same index.\n * The returned list has length of the shortest collection.\n */"} {"signature":"public inline fun < V > ComplexFloatArray . zip ( other : ComplexFloatArray , transform : ( a : ComplexFloat , b : ComplexFloat ) -> V ) : List < V >","body":"{ val size = minOf ( size , other . size ) val list = ArrayList < V > ( size ) for ( i in until size ) { list . add ( transform ( this [ i ] , other [ i ] ) ) } return list }","docstring":"/**\n * Returns a list of values built from the elements of `this` array 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 array.\n */"} {"signature":"public inline fun < V > ComplexDoubleArray . zip ( other : ComplexDoubleArray , transform : ( a : ComplexDouble , b : ComplexDouble ) -> V ) : List < V >","body":"{ val size = minOf ( size , other . size ) val list = ArrayList < V > ( size ) for ( i in until size ) { list . add ( transform ( this [ i ] , other [ i ] ) ) } return list }","docstring":"/**\n * Returns a list of values built from the elements of `this` array 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 array.\n */"} {"signature":"public fun < A : Appendable > ComplexFloatArray . joinTo ( buffer : A , separator : CharSequence = \"\" , prefix : CharSequence = \"\" , postfix : CharSequence = \"\" , limit : Int = - , truncated : CharSequence = \"\" , transform : ( ( ComplexFloat ) -> CharSequence ) ? = null ) : A","body":"{ buffer . append ( prefix ) var count = for ( element in this ) { if ( ++ count > ) buffer . append ( separator ) if ( limit < || count <= limit ) { if ( transform != null ) buffer . append ( transform ( element ) ) else buffer . append ( element . toString ( ) ) } else break } if ( limit in until count ) 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 */"} {"signature":"public fun < A : Appendable > ComplexDoubleArray . joinTo ( buffer : A , separator : CharSequence = \"\" , prefix : CharSequence = \"\" , postfix : CharSequence = \"\" , limit : Int = - , truncated : CharSequence = \"\" , transform : ( ( ComplexDouble ) -> CharSequence ) ? = null ) : A","body":"{ buffer . append ( prefix ) var count = for ( element in this ) { if ( ++ count > ) buffer . append ( separator ) if ( limit < || count <= limit ) { if ( transform != null ) buffer . append ( transform ( element ) ) else buffer . append ( element . toString ( ) ) } else break } if ( limit in until count ) 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 */"} {"signature":"public fun ComplexFloatArray . joinToString ( separator : CharSequence = \"\" , prefix : CharSequence = \"\" , postfix : CharSequence = \"\" , limit : Int = - , truncated : CharSequence = \"\" , transform : ( ( ComplexFloat ) -> CharSequence ) ? = null ) : String","body":"= 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 */"} {"signature":"public fun ComplexDoubleArray . joinToString ( separator : CharSequence = \"\" , prefix : CharSequence = \"\" , postfix : CharSequence = \"\" , limit : Int = - , truncated : CharSequence = \"\" , transform : ( ( ComplexDouble ) -> CharSequence ) ? = null ) : String","body":"= 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 */"} {"signature":"public fun ComplexFloatArray . asIterable ( ) : Iterable < ComplexFloat >","body":"{ if ( isEmpty ( ) ) return emptyList ( ) return Iterable { this . iterator ( ) } }","docstring":"/**\n * Creates an [Iterable] instance that wraps the original array returning its elements when being iterated.\n */"} {"signature":"public fun ComplexDoubleArray . asIterable ( ) : Iterable < ComplexDouble >","body":"{ if ( isEmpty ( ) ) return emptyList ( ) return Iterable { this . iterator ( ) } }","docstring":"/**\n * Creates an [Iterable] instance that wraps the original array returning its elements when being iterated.\n */"} {"signature":"public fun ComplexFloatArray . asSequence ( ) : Sequence < ComplexFloat >","body":"{ if ( isEmpty ( ) ) return emptySequence ( ) return Sequence { this . iterator ( ) } }","docstring":"/**\n * Creates a [Sequence] instance that wraps the original array returning its elements when being iterated.\n */"} {"signature":"public fun ComplexDoubleArray . asSequence ( ) : Sequence < ComplexDouble >","body":"{ if ( isEmpty ( ) ) return emptySequence ( ) return Sequence { this . iterator ( ) } }","docstring":"/**\n * Creates a [Sequence] instance that wraps the original array returning its elements when being iterated.\n */"} {"signature":"public fun ComplexFloatArray . sum ( ) : ComplexFloat","body":"{ var sum = ComplexFloat ( , ) for ( element in this ) { sum += element } return sum }","docstring":"/**\n * Returns the sum of all elements in the array.\n */"} {"signature":"public fun ComplexDoubleArray . sum ( ) : ComplexDouble","body":"{ var sum = ComplexDouble ( , ) for ( element in this ) { sum += element } return sum }","docstring":"/**\n * Returns the sum of all elements in the array.\n */"} {"signature":"fun genAnnotations ( annotated : IrAnnotationContainer ? , returnType : Type ? , typeForTypeAnnotations : IrType ? )","body":"{ if ( annotated == null ) return val annotationDescriptorsAlreadyPresent = mutableSetOf < String > ( ) val annotations = annotated . annotations for ( annotation in annotations ) { val applicableTargets = annotation . applicableTargetSet ( ) if ( annotated is IrSimpleFunction && annotated . origin === IrDeclarationOrigin . LOCAL_FUNCTION_FOR_LAMBDA && KotlinTarget . FUNCTION !in applicableTargets && KotlinTarget . PROPERTY_GETTER !in applicableTargets && KotlinTarget . PROPERTY_SETTER !in applicableTargets ) { assert ( KotlinTarget . EXPRESSION in applicableTargets ) { \"\" } continue } if ( annotated is IrClass && KotlinTarget . CLASS !in applicableTargets && KotlinTarget . ANNOTATION_CLASS !in applicableTargets ) { if ( annotated . visibility == DescriptorVisibilities . LOCAL ) { assert ( KotlinTarget . EXPRESSION in applicableTargets ) { \"\" } continue } } genAnnotation ( annotation , null , false ) ? . let { descriptor -> annotationDescriptorsAlreadyPresent . add ( descriptor ) } } if ( ! skipNullabilityAnnotations && annotated is IrDeclaration && returnType != null && ! AsmUtil . isPrimitive ( returnType ) ) { generateNullabilityAnnotationForCallable ( annotated , annotationDescriptorsAlreadyPresent ) } generateTypeAnnotations ( annotated , typeForTypeAnnotations ) }","docstring":"/**\n * @param returnType can be null if not applicable (e.g. [annotated] is a class)\n */"} {"signature":"private fun isCastToAForwardDeclaration ( session : FirSession , forwardDeclarationType : ConeKotlinType ) : Boolean","body":"{ return forwardDeclarationType . toRegularClassSymbol ( session ) ? . forwardDeclarationKindOrNull ( ) != null }","docstring":"/**\n * Here, we only check that we are casting to a forward declaration to suppress a CAST_NEVER_SUCCEEDS warning.\n * The cast would be further checked with FirNativeForwardDeclarationTypeOperatorChecker and FirNativeForwardDeclarationGetClassCallChecker.\n */"} {"signature":"@ Test fun `should no merge prop and method with the same name` ( )","body":"{ testInline ( \"\"\"\"\"\" . trimMargin ( ) , configuration ( true ) , cleanupOutput = true ) { pagesTransformationStage = { root -> val allChildren = root . childrenRec ( ) . filterIsInstance < MemberPageNode > ( ) assertEquals ( , allChildren . filter { it . name == \"\" } . size , \"\" ) } } }","docstring":"/**\n * There is a case when a property and fun from different source sets\n * have the same name so pages have the same urls respectively.\n */"} {"signature":"fun String . decapitalizeSmartForCompiler ( asciiOnly : Boolean = false ) : String","body":"{ if ( isEmpty ( ) || ! isUpperCaseCharAt ( , asciiOnly ) ) return this if ( length == || ! isUpperCaseCharAt ( , asciiOnly ) ) { return if ( asciiOnly ) decapitalizeAsciiOnly ( ) else replaceFirstChar ( Char :: lowercaseChar ) } val secondWordStart = ( indices . firstOrNull { ! isUpperCaseCharAt ( it , asciiOnly ) } ? : return toLowerCase ( this , asciiOnly ) ) - return toLowerCase ( substring ( , secondWordStart ) , asciiOnly ) + substring ( secondWordStart ) }","docstring":"/**\n * \"FooBar\" -> \"fooBar\"\n * \"FOOBar\" -> \"fooBar\"\n * \"FOO\" -> \"foo\"\n * \"FOO_BAR\" -> \"foO_BAR\"\n */"} {"signature":"fun String . decapitalizeSmart ( asciiOnly : Boolean = false ) : String","body":"{ return decapitalizeWithUnderscores ( this , asciiOnly ) ? : decapitalizeSmartForCompiler ( asciiOnly ) }","docstring":"/**\n * \"FooBar\" -> \"fooBar\"\n * \"FOOBar\" -> \"fooBar\"\n * \"FOO\" -> \"foo\"\n * \"FOO_BAR\" -> \"fooBar\"\n * \"__F_BAR\" -> \"fBar\"\n */"} {"signature":"fun String . capitalizeFirstWord ( asciiOnly : Boolean = false ) : String","body":"{ val secondWordStart = indices . drop ( ) . firstOrNull { ! isLowerCaseCharAt ( it , asciiOnly ) } ? : return toUpperCase ( this , asciiOnly ) return toUpperCase ( substring ( , secondWordStart ) , asciiOnly ) + substring ( secondWordStart ) }","docstring":"/**\n * \"fooBar\" -> \"FOOBar\"\n * \"FooBar\" -> \"FOOBar\"\n * \"foo\" -> \"FOO\"\n */"} {"signature":"private fun decapitalizeWithUnderscores ( str : String , asciiOnly : Boolean ) : String ?","body":"{ val words = str . split ( \"\" ) . filter { it . isNotEmpty ( ) } if ( words . size <= ) return null val builder = StringBuilder ( ) words . forEachIndexed { index , word -> if ( index == ) { builder . append ( toLowerCase ( word , asciiOnly ) ) } else { builder . append ( toUpperCase ( word . first ( ) . toString ( ) , asciiOnly ) ) builder . append ( toLowerCase ( word . drop ( ) , asciiOnly ) ) } } return builder . toString ( ) }","docstring":"/**\n * FOOBAR -> null\n * FOO_BAR -> \"fooBar\"\n * FOO_BAR_BAZ -> \"fooBarBaz\"\n * \"__F_BAR\" -> \"fBar\"\n * \"_F_BAR\" -> \"fBar\"\n * \"F_BAR\" -> \"fBar\"\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < HTMLElement > . a ( href : String ? = null , target : String ? = null , classes : String ? = null , crossinline block : A . ( ) -> Unit = { } , ) : HTMLAnchorElement","body":"= A ( attributesMapOf ( \"\" , href , \"\" , target , \"\" , classes ) , this ) . visitAndFinalize ( this , block ) as HTMLAnchorElement","docstring":"/**\n * Anchor\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < HTMLElement > . abbr ( classes : String ? = null , crossinline block : ABBR . ( ) -> Unit = { } ) : HTMLElement","body":"= ABBR ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block )","docstring":"/**\n * Abbreviated form (e.g., WWW, HTTP,etc.)\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < HTMLElement > . address ( classes : String ? = null , crossinline block : ADDRESS . ( ) -> Unit = { } ) : HTMLElement","body":"= ADDRESS ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block )","docstring":"/**\n * Information on author\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < HTMLElement > . area ( shape : AreaShape ? = null , alt : String ? = null , classes : String ? = null , crossinline block : AREA . ( ) -> Unit = { } , ) : HTMLAreaElement","body":"= AREA ( attributesMapOf ( \"\" , shape ? . enumEncode ( ) , \"\" , alt , \"\" , classes ) , this ) . visitAndFinalize ( this , block ) as HTMLAreaElement","docstring":"/**\n * Client-side image map area\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < HTMLElement > . article ( classes : String ? = null , crossinline block : ARTICLE . ( ) -> Unit = { } ) : HTMLElement","body":"= ARTICLE ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block )","docstring":"/**\n * Self-contained syndicatable or reusable composition\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < HTMLElement > . aside ( classes : String ? = null , crossinline block : ASIDE . ( ) -> Unit = { } ) : HTMLElement","body":"= ASIDE ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block )","docstring":"/**\n * Sidebar for tangentially related content\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < HTMLElement > . audio ( classes : String ? = null , crossinline block : AUDIO . ( ) -> Unit = { } ) : HTMLAudioElement","body":"= AUDIO ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block ) as HTMLAudioElement","docstring":"/**\n * Audio player\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < HTMLElement > . b ( classes : String ? = null , crossinline block : B . ( ) -> Unit = { } ) : HTMLElement","body":"= B ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block )","docstring":"/**\n * Bold text style\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < HTMLElement > . base ( classes : String ? = null , crossinline block : BASE . ( ) -> Unit = { } ) : HTMLBaseElement","body":"= BASE ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block ) as HTMLBaseElement","docstring":"/**\n * Document base URI\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < HTMLElement > . bdi ( classes : String ? = null , crossinline block : BDI . ( ) -> Unit = { } ) : HTMLElement","body":"= BDI ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block )","docstring":"/**\n * Text directionality isolation\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < HTMLElement > . bdo ( classes : String ? = null , crossinline block : BDO . ( ) -> Unit = { } ) : HTMLElement","body":"= BDO ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block )","docstring":"/**\n * I18N BiDi over-ride\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < HTMLElement > . blockQuote ( classes : String ? = null , crossinline block : BLOCKQUOTE . ( ) -> Unit = { } ) : HTMLElement","body":"= BLOCKQUOTE ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block )","docstring":"/**\n * Long quotation\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < HTMLElement > . body ( classes : String ? = null , crossinline block : BODY . ( ) -> Unit = { } ) : HTMLBodyElement","body":"= BODY ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block ) as HTMLBodyElement","docstring":"/**\n * Document body\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < HTMLElement > . br ( classes : String ? = null , crossinline block : BR . ( ) -> Unit = { } ) : HTMLBRElement","body":"= BR ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block ) as HTMLBRElement","docstring":"/**\n * Forced line break\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < HTMLElement > . button ( formEncType : ButtonFormEncType ? = null , formMethod : ButtonFormMethod ? = null , name : String ? = null , type : ButtonType ? = null , classes : String ? = null , crossinline block : BUTTON . ( ) -> Unit = { } , ) : HTMLButtonElement","body":"= BUTTON ( attributesMapOf ( \"\" , formEncType ? . enumEncode ( ) , \"\" , formMethod ? . enumEncode ( ) , \"\" , name , \"\" , type ? . enumEncode ( ) , \"\" , classes ) , this ) . visitAndFinalize ( this , block ) as HTMLButtonElement","docstring":"/**\n * Push button\n */"} {"signature":"@ HtmlTagMarker public fun TagConsumer < HTMLElement > . canvas ( classes : String ? = null , content : String = \"\" ) : HTMLCanvasElement","body":"= CANVAS ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , { + content } ) as HTMLCanvasElement","docstring":"/**\n * Scriptable bitmap canvas\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < HTMLElement > . canvas ( classes : String ? = null , crossinline block : CANVAS . ( ) -> Unit = { } ) : HTMLCanvasElement","body":"= CANVAS ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block ) as HTMLCanvasElement","docstring":"/**\n * Scriptable bitmap canvas\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < HTMLElement > . caption ( classes : String ? = null , crossinline block : CAPTION . ( ) -> Unit = { } ) : HTMLElement","body":"= CAPTION ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block )","docstring":"/**\n * Table caption\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < HTMLElement > . cite ( classes : String ? = null , crossinline block : CITE . ( ) -> Unit = { } ) : HTMLElement","body":"= CITE ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block )","docstring":"/**\n * Citation\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < HTMLElement > . code ( classes : String ? = null , crossinline block : CODE . ( ) -> Unit = { } ) : HTMLElement","body":"= CODE ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block )","docstring":"/**\n * Computer code fragment\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < HTMLElement > . col ( classes : String ? = null , crossinline block : COL . ( ) -> Unit = { } ) : HTMLTableColElement","body":"= COL ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block ) as HTMLTableColElement","docstring":"/**\n * Table column\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < HTMLElement > . colGroup ( classes : String ? = null , crossinline block : COLGROUP . ( ) -> Unit = { } ) : HTMLTableColElement","body":"= COLGROUP ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block ) as HTMLTableColElement","docstring":"/**\n * Table column group\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < HTMLElement > . dataList ( classes : String ? = null , crossinline block : DATALIST . ( ) -> Unit = { } ) : HTMLDataListElement","body":"= DATALIST ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block ) as HTMLDataListElement","docstring":"/**\n * Container for options for \n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < HTMLElement > . dd ( classes : String ? = null , crossinline block : DD . ( ) -> Unit = { } ) : HTMLElement","body":"= DD ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block )","docstring":"/**\n * Definition description\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < HTMLElement > . del ( classes : String ? = null , crossinline block : DEL . ( ) -> Unit = { } ) : HTMLElement","body":"= DEL ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block )","docstring":"/**\n * Deleted text\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < HTMLElement > . details ( classes : String ? = null , crossinline block : DETAILS . ( ) -> Unit = { } ) : HTMLDetailsElement","body":"= DETAILS ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block ) as HTMLDetailsElement","docstring":"/**\n * Disclosure control for hiding details\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < HTMLElement > . dfn ( classes : String ? = null , crossinline block : DFN . ( ) -> Unit = { } ) : HTMLElement","body":"= DFN ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block )","docstring":"/**\n * Instance definition\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < HTMLElement > . dialog ( classes : String ? = null , crossinline block : DIALOG . ( ) -> Unit = { } ) : HTMLDialogElement","body":"= DIALOG ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block ) as HTMLDialogElement","docstring":"/**\n * Dialog box or window\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < HTMLElement > . div ( classes : String ? = null , crossinline block : DIV . ( ) -> Unit = { } ) : HTMLDivElement","body":"= DIV ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block ) as HTMLDivElement","docstring":"/**\n * Generic language/style container\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < HTMLElement > . dl ( classes : String ? = null , crossinline block : DL . ( ) -> Unit = { } ) : HTMLElement","body":"= DL ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block )","docstring":"/**\n * Definition list\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < HTMLElement > . dt ( classes : String ? = null , crossinline block : DT . ( ) -> Unit = { } ) : HTMLElement","body":"= DT ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block )","docstring":"/**\n * Definition term\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < HTMLElement > . em ( classes : String ? = null , crossinline block : EM . ( ) -> Unit = { } ) : HTMLElement","body":"= EM ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block )","docstring":"/**\n * Emphasis\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < HTMLElement > . embed ( classes : String ? = null , crossinline block : EMBED . ( ) -> Unit = { } ) : HTMLEmbedElement","body":"= EMBED ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block ) as HTMLEmbedElement","docstring":"/**\n * Plugin\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < HTMLElement > . fieldSet ( classes : String ? = null , crossinline block : FIELDSET . ( ) -> Unit = { } ) : HTMLFieldSetElement","body":"= FIELDSET ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block ) as HTMLFieldSetElement","docstring":"/**\n * Form control group\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < HTMLElement > . figcaption ( classes : String ? = null , crossinline block : FIGCAPTION . ( ) -> Unit = { } ) : HTMLElement","body":"= FIGCAPTION ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block )","docstring":"/**\n * Caption for \n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < HTMLElement > . figure ( classes : String ? = null , crossinline block : FIGURE . ( ) -> Unit = { } ) : HTMLElement","body":"= FIGURE ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block )","docstring":"/**\n * Figure with optional caption\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < HTMLElement > . footer ( classes : String ? = null , crossinline block : FOOTER . ( ) -> Unit = { } ) : HTMLElement","body":"= FOOTER ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block )","docstring":"/**\n * Footer for a page or section\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < HTMLElement > . form ( action : String ? = null , encType : FormEncType ? = null , method : FormMethod ? = null , classes : String ? = null , crossinline block : FORM . ( ) -> Unit = { } , ) : HTMLFormElement","body":"= FORM ( attributesMapOf ( \"\" , action , \"\" , encType ? . enumEncode ( ) , \"\" , method ? . enumEncode ( ) , \"\" , classes ) , this ) . visitAndFinalize ( this , block ) as HTMLFormElement","docstring":"/**\n * Interactive form\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < HTMLElement > . h1 ( classes : String ? = null , crossinline block : H1 . ( ) -> Unit = { } ) : HTMLHeadingElement","body":"= H1 ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block ) as HTMLHeadingElement","docstring":"/**\n * Heading\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < HTMLElement > . h2 ( classes : String ? = null , crossinline block : H2 . ( ) -> Unit = { } ) : HTMLHeadingElement","body":"= H2 ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block ) as HTMLHeadingElement","docstring":"/**\n * Heading\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < HTMLElement > . h3 ( classes : String ? = null , crossinline block : H3 . ( ) -> Unit = { } ) : HTMLHeadingElement","body":"= H3 ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block ) as HTMLHeadingElement","docstring":"/**\n * Heading\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < HTMLElement > . h4 ( classes : String ? = null , crossinline block : H4 . ( ) -> Unit = { } ) : HTMLHeadingElement","body":"= H4 ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block ) as HTMLHeadingElement","docstring":"/**\n * Heading\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < HTMLElement > . h5 ( classes : String ? = null , crossinline block : H5 . ( ) -> Unit = { } ) : HTMLHeadingElement","body":"= H5 ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block ) as HTMLHeadingElement","docstring":"/**\n * Heading\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < HTMLElement > . h6 ( classes : String ? = null , crossinline block : H6 . ( ) -> Unit = { } ) : HTMLHeadingElement","body":"= H6 ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block ) as HTMLHeadingElement","docstring":"/**\n * Heading\n */"} {"signature":"@ HtmlTagMarker @ Suppress ( \"\" ) @ Deprecated ( \"\" ) public fun TagConsumer < HTMLElement > . head ( content : String = \"\" ) : HTMLHeadElement","body":"= HEAD ( emptyMap , this ) . visitAndFinalize ( this , { + content } ) as HTMLHeadElement","docstring":"/**\n * Document head\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < HTMLElement > . head ( crossinline block : HEAD . ( ) -> Unit = { } ) : HTMLHeadElement","body":"= HEAD ( emptyMap , this ) . visitAndFinalize ( this , block ) as HTMLHeadElement","docstring":"/**\n * Document head\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < HTMLElement > . `header` ( classes : String ? = null , crossinline block : HEADER . ( ) -> Unit = { } ) : HTMLElement","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 TagConsumer < HTMLElement > . hr ( classes : String ? = null , crossinline block : HR . ( ) -> Unit = { } ) : HTMLHRElement","body":"= HR ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block ) as HTMLHRElement","docstring":"/**\n * Horizontal rule\n */"} {"signature":"@ HtmlTagMarker @ Suppress ( \"\" ) @ Deprecated ( \"\" ) public fun TagConsumer < HTMLElement > . html ( content : String = \"\" , namespace : String ? = null ) : HTMLHtmlElement","body":"= HTML ( emptyMap , this , namespace ) . visitAndFinalize ( this , { + content } ) as HTMLHtmlElement","docstring":"/**\n * Document root element\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < HTMLElement > . html ( namespace : String ? = null , crossinline block : HTML . ( ) -> Unit = { } ) : HTMLHtmlElement","body":"= HTML ( emptyMap , this , namespace ) . visitAndFinalize ( this , block ) as HTMLHtmlElement","docstring":"/**\n * Document root element\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < HTMLElement > . i ( classes : String ? = null , crossinline block : I . ( ) -> Unit = { } ) : HTMLElement","body":"= I ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block )","docstring":"/**\n * Italic text style\n */"} {"signature":"@ HtmlTagMarker public fun TagConsumer < HTMLElement > . iframe ( sandbox : IframeSandbox ? = null , classes : String ? = null , content : String = \"\" , ) : HTMLElement","body":"= IFRAME ( attributesMapOf ( \"\" , sandbox ? . enumEncode ( ) , \"\" , classes ) , this ) . visitAndFinalize ( this , { + content } )","docstring":"/**\n * Inline subwindow\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < HTMLElement > . iframe ( sandbox : IframeSandbox ? = null , classes : String ? = null , crossinline block : IFRAME . ( ) -> Unit = { } , ) : HTMLElement","body":"= IFRAME ( attributesMapOf ( \"\" , sandbox ? . enumEncode ( ) , \"\" , classes ) , this ) . visitAndFinalize ( this , block )","docstring":"/**\n * Inline subwindow\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < HTMLElement > . img ( alt : String ? = null , src : String ? = null , loading : ImgLoading ? = null , classes : String ? = null , crossinline block : IMG . ( ) -> Unit = { } , ) : HTMLImageElement","body":"= IMG ( attributesMapOf ( \"\" , alt , \"\" , src , \"\" , loading ? . enumEncode ( ) , \"\" , classes ) , this ) . visitAndFinalize ( this , block ) as HTMLImageElement","docstring":"/**\n * Embedded image\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < HTMLElement > . input ( type : InputType ? = null , formEncType : InputFormEncType ? = null , formMethod : InputFormMethod ? = null , name : String ? = null , classes : String ? = null , crossinline block : INPUT . ( ) -> Unit = { } , ) : HTMLInputElement","body":"= INPUT ( attributesMapOf ( \"\" , type ? . enumEncode ( ) , \"\" , formEncType ? . enumEncode ( ) , \"\" , formMethod ? . enumEncode ( ) , \"\" , name , \"\" , classes ) , this ) . visitAndFinalize ( this , block ) as HTMLInputElement","docstring":"/**\n * Form control\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < HTMLElement > . ins ( classes : String ? = null , crossinline block : INS . ( ) -> Unit = { } ) : HTMLElement","body":"= INS ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block )","docstring":"/**\n * Inserted text\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < HTMLElement > . kbd ( classes : String ? = null , crossinline block : KBD . ( ) -> Unit = { } ) : HTMLElement","body":"= KBD ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block )","docstring":"/**\n * Text to be entered by the user\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < HTMLElement > . keyGen ( keyType : KeyGenKeyType ? = null , classes : String ? = null , crossinline block : KEYGEN . ( ) -> Unit = { } , ) : HTMLElement","body":"= KEYGEN ( attributesMapOf ( \"\" , keyType ? . enumEncode ( ) , \"\" , classes ) , this ) . visitAndFinalize ( this , block )","docstring":"/**\n * Cryptographic key-pair generator form control\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < HTMLElement > . label ( classes : String ? = null , crossinline block : LABEL . ( ) -> Unit = { } ) : HTMLLabelElement","body":"= LABEL ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block ) as HTMLLabelElement","docstring":"/**\n * Form field label text\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < HTMLElement > . legend ( classes : String ? = null , crossinline block : LEGEND . ( ) -> Unit = { } ) : HTMLLegendElement","body":"= LEGEND ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block ) as HTMLLegendElement","docstring":"/**\n * Fieldset legend\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < HTMLElement > . li ( classes : String ? = null , crossinline block : LI . ( ) -> Unit = { } ) : HTMLLIElement","body":"= LI ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block ) as HTMLLIElement","docstring":"/**\n * List item\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < HTMLElement > . link ( href : String ? = null , rel : String ? = null , type : String ? = null , crossinline block : LINK . ( ) -> Unit = { } , ) : HTMLLinkElement","body":"= LINK ( attributesMapOf ( \"\" , href , \"\" , rel , \"\" , type ) , this ) . visitAndFinalize ( this , block ) as HTMLLinkElement","docstring":"/**\n * A media-independent link\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < HTMLElement > . main ( classes : String ? = null , crossinline block : MAIN . ( ) -> Unit = { } ) : HTMLElement","body":"= MAIN ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block )","docstring":"/**\n * Container for the dominant contents of another element\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < HTMLElement > . map ( name : String ? = null , classes : String ? = null , crossinline block : MAP . ( ) -> Unit = { } , ) : HTMLMapElement","body":"= MAP ( attributesMapOf ( \"\" , name , \"\" , classes ) , this ) . visitAndFinalize ( this , block ) as HTMLMapElement","docstring":"/**\n * Client-side image map\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < HTMLElement > . mark ( classes : String ? = null , crossinline block : MARK . ( ) -> Unit = { } ) : HTMLElement","body":"= MARK ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block )","docstring":"/**\n * Highlight\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < HTMLElement > . meta ( name : String ? = null , content : String ? = null , charset : String ? = null , crossinline block : META . ( ) -> Unit = { } , ) : HTMLMetaElement","body":"= META ( attributesMapOf ( \"\" , name , \"\" , content , \"\" , charset ) , this ) . visitAndFinalize ( this , block ) as HTMLMetaElement","docstring":"/**\n * Generic metainformation\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < HTMLElement > . meter ( classes : String ? = null , crossinline block : METER . ( ) -> Unit = { } ) : HTMLMeterElement","body":"= METER ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block ) as HTMLMeterElement","docstring":"/**\n * Gauge\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < HTMLElement > . nav ( classes : String ? = null , crossinline block : NAV . ( ) -> Unit = { } ) : HTMLElement","body":"= NAV ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block )","docstring":"/**\n * Section with navigational links\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < HTMLElement > . noScript ( classes : String ? = null , crossinline block : NOSCRIPT . ( ) -> Unit = { } ) : HTMLElement","body":"= NOSCRIPT ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block )","docstring":"/**\n * Generic metainformation\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < HTMLElement > . htmlObject ( classes : String ? = null , crossinline block : OBJECT . ( ) -> Unit = { } ) : HTMLElement","body":"= OBJECT ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block )","docstring":"/**\n * Generic embedded object\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < HTMLElement > . ol ( classes : String ? = null , crossinline block : OL . ( ) -> Unit = { } ) : HTMLElement","body":"= OL ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block )","docstring":"/**\n * Ordered list\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < HTMLElement > . optGroup ( label : String ? = null , classes : String ? = null , crossinline block : OPTGROUP . ( ) -> Unit = { } , ) : HTMLOptGroupElement","body":"= OPTGROUP ( attributesMapOf ( \"\" , label , \"\" , classes ) , this ) . visitAndFinalize ( this , block ) as HTMLOptGroupElement","docstring":"/**\n * Option group\n */"} {"signature":"@ HtmlTagMarker public fun TagConsumer < HTMLElement > . option ( classes : String ? = null , content : String = \"\" ) : HTMLOptionElement","body":"= OPTION ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , { + content } ) as HTMLOptionElement","docstring":"/**\n * Selectable choice\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < HTMLElement > . option ( classes : String ? = null , crossinline block : OPTION . ( ) -> Unit = { } ) : HTMLOptionElement","body":"= OPTION ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block ) as HTMLOptionElement","docstring":"/**\n * Selectable choice\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < HTMLElement > . output ( classes : String ? = null , crossinline block : OUTPUT . ( ) -> Unit = { } ) : HTMLOutputElement","body":"= OUTPUT ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block ) as HTMLOutputElement","docstring":"/**\n * Calculated output value\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < HTMLElement > . p ( classes : String ? = null , crossinline block : P . ( ) -> Unit = { } ) : HTMLParagraphElement","body":"= P ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block ) as HTMLParagraphElement","docstring":"/**\n * Paragraph\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < HTMLElement > . `param` ( name : String ? = null , `value` : String ? = null , crossinline block : PARAM . ( ) -> Unit = { } , ) : HTMLParamElement","body":"= PARAM ( attributesMapOf ( \"\" , name , \"\" , value ) , this ) . visitAndFinalize ( this , block ) as HTMLParamElement","docstring":"/**\n * Named property value\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < HTMLElement > . picture ( crossinline block : PICTURE . ( ) -> Unit = { } ) : HTMLPictureElement","body":"= PICTURE ( emptyMap , this ) . visitAndFinalize ( this , block ) as HTMLPictureElement","docstring":"/**\n * Pictures container\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < HTMLElement > . pre ( classes : String ? = null , crossinline block : PRE . ( ) -> Unit = { } ) : HTMLPreElement","body":"= PRE ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block ) as HTMLPreElement","docstring":"/**\n * Preformatted text\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < HTMLElement > . progress ( classes : String ? = null , crossinline block : PROGRESS . ( ) -> Unit = { } ) : HTMLProgressElement","body":"= PROGRESS ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block ) as HTMLProgressElement","docstring":"/**\n * Progress bar\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < HTMLElement > . q ( classes : String ? = null , crossinline block : Q . ( ) -> Unit = { } ) : HTMLElement","body":"= Q ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block )","docstring":"/**\n * Short inline quotation\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < HTMLElement > . rp ( classes : String ? = null , crossinline block : RP . ( ) -> Unit = { } ) : HTMLElement","body":"= RP ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block )","docstring":"/**\n * Parenthesis for ruby annotation text\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < HTMLElement > . rt ( classes : String ? = null , crossinline block : RT . ( ) -> Unit = { } ) : HTMLElement","body":"= RT ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block )","docstring":"/**\n * Ruby annotation text\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < HTMLElement > . ruby ( classes : String ? = null , crossinline block : RUBY . ( ) -> Unit = { } ) : HTMLElement","body":"= RUBY ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block )","docstring":"/**\n * Ruby annotation(s)\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < HTMLElement > . s ( classes : String ? = null , crossinline block : S . ( ) -> Unit = { } ) : HTMLElement","body":"= S ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block )","docstring":"/**\n * Strike-through text style\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < HTMLElement > . samp ( classes : String ? = null , crossinline block : SAMP . ( ) -> Unit = { } ) : HTMLElement","body":"= SAMP ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block )","docstring":"/**\n * Sample or quote text style\n */"} {"signature":"@ HtmlTagMarker @ Suppress ( \"\" ) @ Deprecated ( \"\" ) public fun TagConsumer < HTMLElement > . script ( type : String ? = null , src : String ? = null , crossorigin : ScriptCrossorigin ? = null , content : String = \"\" , ) : HTMLScriptElement","body":"= SCRIPT ( attributesMapOf ( \"\" , type , \"\" , src , \"\" , crossorigin ? . enumEncode ( ) ) , this ) . visitAndFinalize ( this , { + content } ) as HTMLScriptElement","docstring":"/**\n * Script statements\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < HTMLElement > . script ( type : String ? = null , src : String ? = null , crossorigin : ScriptCrossorigin ? = null , crossinline block : SCRIPT . ( ) -> Unit = { } , ) : HTMLScriptElement","body":"= SCRIPT ( attributesMapOf ( \"\" , type , \"\" , src , \"\" , crossorigin ? . enumEncode ( ) ) , this ) . visitAndFinalize ( this , block ) as HTMLScriptElement","docstring":"/**\n * Script statements\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < HTMLElement > . section ( classes : String ? = null , crossinline block : SECTION . ( ) -> Unit = { } ) : HTMLElement","body":"= SECTION ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block )","docstring":"/**\n * Generic document or application section\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < HTMLElement > . select ( classes : String ? = null , crossinline block : SELECT . ( ) -> Unit = { } ) : HTMLSelectElement","body":"= SELECT ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block ) as HTMLSelectElement","docstring":"/**\n * Option selector\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < HTMLElement > . small ( classes : String ? = null , crossinline block : SMALL . ( ) -> Unit = { } ) : HTMLElement","body":"= SMALL ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block )","docstring":"/**\n * Small text style\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < HTMLElement > . source ( classes : String ? = null , crossinline block : SOURCE . ( ) -> Unit = { } ) : HTMLSourceElement","body":"= SOURCE ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block ) as HTMLSourceElement","docstring":"/**\n * Media source for \n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < HTMLElement > . span ( classes : String ? = null , crossinline block : SPAN . ( ) -> Unit = { } ) : HTMLSpanElement","body":"= SPAN ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block ) as HTMLSpanElement","docstring":"/**\n * Generic language/style container\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < HTMLElement > . strong ( classes : String ? = null , crossinline block : STRONG . ( ) -> Unit = { } ) : HTMLElement","body":"= STRONG ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block )","docstring":"/**\n * Strong emphasis\n */"} {"signature":"@ HtmlTagMarker @ Suppress ( \"\" ) @ Deprecated ( \"\" ) public fun TagConsumer < HTMLElement > . style ( type : String ? = null , content : String = \"\" ) : HTMLStyleElement","body":"= STYLE ( attributesMapOf ( \"\" , type ) , this ) . visitAndFinalize ( this , { + content } ) as HTMLStyleElement","docstring":"/**\n * Style info\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < HTMLElement > . style ( type : String ? = null , crossinline block : STYLE . ( ) -> Unit = { } ) : HTMLStyleElement","body":"= STYLE ( attributesMapOf ( \"\" , type ) , this ) . visitAndFinalize ( this , block ) as HTMLStyleElement","docstring":"/**\n * Style info\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < HTMLElement > . sub ( classes : String ? = null , crossinline block : SUB . ( ) -> Unit = { } ) : HTMLElement","body":"= SUB ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block )","docstring":"/**\n * Subscript\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < HTMLElement > . summary ( classes : String ? = null , crossinline block : SUMMARY . ( ) -> Unit = { } ) : HTMLElement","body":"= SUMMARY ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block )","docstring":"/**\n * Caption for \n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < HTMLElement > . sup ( classes : String ? = null , crossinline block : SUP . ( ) -> Unit = { } ) : HTMLElement","body":"= SUP ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block )","docstring":"/**\n * Superscript\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < HTMLElement > . table ( classes : String ? = null , crossinline block : TABLE . ( ) -> Unit = { } ) : HTMLTableElement","body":"= TABLE ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block ) as HTMLTableElement","docstring":"/**\n *\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < HTMLElement > . tbody ( classes : String ? = null , crossinline block : TBODY . ( ) -> Unit = { } ) : HTMLTableSectionElement","body":"= TBODY ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block ) as HTMLTableSectionElement","docstring":"/**\n * Table body\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < HTMLElement > . td ( classes : String ? = null , crossinline block : TD . ( ) -> Unit = { } ) : HTMLTableCellElement","body":"= TD ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block ) as HTMLTableCellElement","docstring":"/**\n * Table data cell\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < HTMLElement > . template ( classes : String ? = null , crossinline block : TEMPLATE . ( ) -> Unit = { } ) : HTMLTemplateElement","body":"= TEMPLATE ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block ) as HTMLTemplateElement","docstring":"/**\n * Template\n */"} {"signature":"@ HtmlTagMarker public fun TagConsumer < HTMLElement > . textArea ( rows : String ? = null , cols : String ? = null , wrap : TextAreaWrap ? = null , classes : String ? = null , content : String = \"\" , ) : HTMLTextAreaElement","body":"= TEXTAREA ( attributesMapOf ( \"\" , rows , \"\" , cols , \"\" , wrap ? . enumEncode ( ) , \"\" , classes ) , this ) . visitAndFinalize ( this , { + content } ) as HTMLTextAreaElement","docstring":"/**\n * Multi-line text field\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < HTMLElement > . textArea ( rows : String ? = null , cols : String ? = null , wrap : TextAreaWrap ? = null , classes : String ? = null , crossinline block : TEXTAREA . ( ) -> Unit = { } , ) : HTMLTextAreaElement","body":"= TEXTAREA ( attributesMapOf ( \"\" , rows , \"\" , cols , \"\" , wrap ? . enumEncode ( ) , \"\" , classes ) , this ) . visitAndFinalize ( this , block ) as HTMLTextAreaElement","docstring":"/**\n * Multi-line text field\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < HTMLElement > . tfoot ( classes : String ? = null , crossinline block : TFOOT . ( ) -> Unit = { } ) : HTMLTableSectionElement","body":"= TFOOT ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block ) as HTMLTableSectionElement","docstring":"/**\n * Table footer\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < HTMLElement > . th ( scope : ThScope ? = null , classes : String ? = null , crossinline block : TH . ( ) -> Unit = { } , ) : HTMLTableCellElement","body":"= TH ( attributesMapOf ( \"\" , scope ? . enumEncode ( ) , \"\" , classes ) , this ) . visitAndFinalize ( this , block ) as HTMLTableCellElement","docstring":"/**\n * Table header cell\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < HTMLElement > . thead ( classes : String ? = null , crossinline block : THEAD . ( ) -> Unit = { } ) : HTMLTableSectionElement","body":"= THEAD ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block ) as HTMLTableSectionElement","docstring":"/**\n * Table header\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < HTMLElement > . time ( classes : String ? = null , crossinline block : TIME . ( ) -> Unit = { } ) : HTMLTimeElement","body":"= TIME ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block ) as HTMLTimeElement","docstring":"/**\n * Machine-readable equivalent of date- or time-related data\n */"} {"signature":"@ HtmlTagMarker public fun TagConsumer < HTMLElement > . title ( content : String = \"\" ) : HTMLTitleElement","body":"= TITLE ( emptyMap , this ) . visitAndFinalize ( this , { + content } ) as HTMLTitleElement","docstring":"/**\n * Document title\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < HTMLElement > . title ( crossinline block : TITLE . ( ) -> Unit = { } ) : HTMLTitleElement","body":"= TITLE ( emptyMap , this ) . visitAndFinalize ( this , block ) as HTMLTitleElement","docstring":"/**\n * Document title\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < HTMLElement > . tr ( classes : String ? = null , crossinline block : TR . ( ) -> Unit = { } ) : HTMLTableRowElement","body":"= TR ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block ) as HTMLTableRowElement","docstring":"/**\n * Table row\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < HTMLElement > . u ( classes : String ? = null , crossinline block : U . ( ) -> Unit = { } ) : HTMLElement","body":"= U ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block )","docstring":"/**\n * Underlined text style\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < HTMLElement > . ul ( classes : String ? = null , crossinline block : UL . ( ) -> Unit = { } ) : HTMLElement","body":"= UL ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block )","docstring":"/**\n * Unordered list\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < HTMLElement > . htmlVar ( classes : String ? = null , crossinline block : VAR . ( ) -> Unit = { } ) : HTMLElement","body":"= VAR ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block )","docstring":"/**\n * Unordered list\n */"} {"signature":"@ HtmlTagMarker public inline fun TagConsumer < HTMLElement > . video ( classes : String ? = null , crossinline block : VIDEO . ( ) -> Unit = { } ) : HTMLVideoElement","body":"= VIDEO ( attributesMapOf ( \"\" , classes ) , this ) . visitAndFinalize ( this , block ) as HTMLVideoElement","docstring":"/**\n * Video player\n */"} {"signature":"public abstract fun getModule ( element : PsiElement , contextualModule : KtModule ? ) : KtModule","body":"public abstract fun getModule ( element : PsiElement , contextualModule : KtModule ? ) : KtModule","docstring":"/**\n * Returns a [KtModule] for a given [element] in the context of the [contextualModule].\n *\n * The contextual module is the [KtModule] from which [getModule] is called. It is a way to disambiguate the [KtModule] of [element]s\n * with whom multiple modules might be associated. In particular:\n *\n * 1. It allows replacing the original [KtModule] of [element] with another module, e.g. for supporting outsider files (see below).\n * 2. It helps to distinguish between multiple possible [KtModule]s for library elements.\n *\n * #### Outsider Modules\n *\n * Normally, every Kotlin source file either belongs to some module (e.g. a source module, or a library module), or is self-contained\n * (a script file, or a file outside content roots). However, in certain cases there might be special modules that include both\n * existing source files, and also some additional files.\n *\n * An example of such a module is one that owns an 'outsider' source file. Outsiders are used in IntelliJ for displaying files that\n * technically belong to some module, but are not included in the module's content roots (e.g. a file from a previous VCS revision).\n * As there might be cross-references between the outsider file and other files in the module, they need to be analyzed as a single\n * synthetic module. Inside an analysis session for such a module (which would be the [contextualModule]), sources that originally\n * belong to a source module should be treated rather as a part of the synthetic one.\n */"} {"signature":"@ KtModuleStructureInternals public fun < R > withDanglingFileResolutionMode ( file : KtFile , mode : DanglingFileResolutionMode , action : ( ) -> R ) : R","body":"{ require ( file . isDangling ) { \"\" } require ( file . originalFile != file ) { \"\" } val modeState = getOrCreateDanglingFileResolutionModeState ( file ) val oldValue = modeState . get ( ) try { modeState . set ( mode ) return action ( ) } finally { modeState . set ( oldValue ) } }","docstring":"/**\n * Runs the [action] with a resolution mode being explicitly set for the dangling [file].\n *\n * Avoid using this function in client-side code. Use `analyzeCopy {}` from Analysis API instead.\n */"} {"signature":"actual override public fun addAll ( elements : Collection < E > ) : Boolean","body":"{ var changed = false for ( v in elements ) { if ( add ( v ) ) changed = true } return changed }","docstring":"/**\n * Adds all of the elements of the specified collection to this collection.\n *\n * @return `true` if any of the specified elements was added to the collection, `false` if the collection was not modified.\n */"} {"signature":"actual override fun remove ( element : E ) : Boolean","body":"{ val it = iterator ( ) while ( it . hasNext ( ) ) { if ( it . next ( ) == element ) { it . remove ( ) return true } } return false }","docstring":"/**\n * Removes a single instance of the specified element from this\n * collection, if it is present.\n *\n * @return `true` if the element has been successfully removed; `false` if it was not present in the collection.\n */"} {"signature":"actual override public fun removeAll ( elements : Collection < E > ) : Boolean","body":"= ( this as MutableIterable < E > ) . removeAll { it in elements }","docstring":"/**\n * Removes all of this collection's elements that are also contained in the specified collection.\n *\n * @return `true` if any of the specified elements was removed from the collection, `false` if the collection was not modified.\n */"} {"signature":"actual override public fun retainAll ( elements : Collection < E > ) : Boolean","body":"= ( this as MutableIterable < E > ) . retainAll { it in elements }","docstring":"/**\n * Retains only the elements in this collection that are contained in the specified collection.\n *\n * @return `true` if any element was removed from the collection, `false` if the collection was not modified.\n */"} {"signature":"actual override fun clear ( ) : Unit","body":"{ val it = iterator ( ) while ( it . hasNext ( ) ) { it . next ( ) it . remove ( ) } }","docstring":"/**\n * Removes all elements from this collection.\n */"} {"signature":"fun Canvas . drawObject ( detectedObject : DetectedObject , paint : Paint , labelPaint : TextPaint , bounds : PreviewImageBounds = bounds ( ) )","body":"{ val rect = RectF ( bounds . toViewX ( detectedObject . xMin ) , bounds . toViewY ( detectedObject . yMin ) , bounds . toViewX ( detectedObject . xMax ) , bounds . toViewY ( detectedObject . yMax ) ) val frameWidth = paint . strokeWidth * detectedObject . probability drawRect ( rect , Paint ( paint ) . apply { strokeWidth = frameWidth } ) if ( detectedObject . label != null ) { val label = \"\" + \"\" . format ( detectedObject . probability ) drawText ( label , rect . left , rect . top - labelPaint . fontMetrics . descent - frameWidth / , labelPaint ) } }","docstring":"/**\n * Draw given [detectedObject] on the [Canvas] using [paint] for the bounding box and [labelPaint] for the label.\n *\n * If the preview image coordinates do not match the [Canvas] coordinates,\n * [bounds] of the image preview should be provided.\n *\n * @see [PreviewImageBounds]\n */"} {"signature":"fun Canvas . drawObjects ( detectedObjects : List < DetectedObject > , paint : Paint , labelPaint : TextPaint , bounds : PreviewImageBounds = bounds ( ) )","body":"{ detectedObjects . forEach { drawObject ( it , paint , labelPaint , bounds ) } }","docstring":"/**\n * Draw given [detectedObjects] on the [Canvas] using [paint] for the bounding box and [labelPaint] for the label.\n *\n * If the preview image coordinates do not match the [Canvas] coordinates,\n * [bounds] of the image preview should be provided.\n *\n * @see [PreviewImageBounds]\n */"} {"signature":"fun Canvas . drawPose ( detectedPose : DetectedPose , landmarkPaint : Paint , edgePaint : Paint , landmarkRadius : Float , bounds : PreviewImageBounds = bounds ( ) )","body":"{ detectedPose . edges . forEach { edge -> drawLine ( bounds . toViewX ( edge . start . x ) , bounds . toViewY ( edge . start . y ) , bounds . toViewX ( edge . end . x ) , bounds . toViewY ( edge . end . y ) , edgePaint ) } detectedPose . landmarks . forEach { landmark -> drawCircle ( bounds . toViewX ( landmark . x ) , bounds . toViewY ( landmark . y ) , landmarkRadius , landmarkPaint ) } }","docstring":"/**\n * Draw given [detectedPose] on the [Canvas] using [landmarkPaint] and [landmarkRadius] for the pose vertices,\n * and [edgePaint] for the pose edges.\n *\n * If the preview image coordinates do not match the [Canvas] coordinates,\n * [bounds] of the image preview should be provided.\n *\n * @see [PreviewImageBounds]\n */"} {"signature":"fun Canvas . drawMultiplePoses ( detectedPoses : MultiPoseDetectionResult , landmarkPaint : Paint , edgePaint : Paint , objectPaint : Paint , labelPaint : TextPaint , landmarkRadius : Float , bounds : PreviewImageBounds = bounds ( ) )","body":"{ detectedPoses . poses . forEach { ( detectedObject , detectedPose ) -> drawPose ( detectedPose , landmarkPaint , edgePaint , landmarkRadius , bounds ) drawObject ( detectedObject , objectPaint , labelPaint , bounds ) } }","docstring":"/**\n * Draw given [detectedPoses] on the [Canvas] using [landmarkPaint] and [landmarkRadius] for the pose vertices,\n * [edgePaint] for the poses edges, [objectPaint] for the bounding box and [labelPaint] for the label.\n *\n * If the preview image coordinates do not match the [Canvas] coordinates,\n * [bounds] of the image preview should be provided.\n *\n * @see [PreviewImageBounds]\n */"} {"signature":"fun Canvas . drawLandmarks ( landmarks : List < Landmark > , paint : Paint , radius : Float , bounds : PreviewImageBounds = bounds ( ) )","body":"{ landmarks . forEach { landmark -> drawLandmark ( landmark , paint , radius , bounds ) } }","docstring":"/**\n * Draw given [landmarks] on the [Canvas] using [paint] and [radius].\n *\n * If the preview image coordinates do not match the [Canvas] coordinates,\n * [bounds] of the image preview should be provided.\n *\n * @see [PreviewImageBounds]\n */"} {"signature":"fun Canvas . drawLandmark ( landmark : Landmark , paint : Paint , radius : Float , bounds : PreviewImageBounds = bounds ( ) )","body":"{ drawCircle ( bounds . toViewX ( landmark . x ) , bounds . toViewY ( landmark . y ) , radius , paint ) }","docstring":"/**\n * Draw a given [landmark] on the [Canvas] using [paint] and [radius].\n *\n * If the preview image coordinates do not match the [Canvas] coordinates,\n * [bounds] of the image preview should be provided.\n *\n * @see [PreviewImageBounds]\n */"} {"signature":"fun Canvas . bounds ( )","body":"= PreviewImageBounds ( , , width . toFloat ( ) , height . toFloat ( ) )","docstring":"/**\n * Create [PreviewImageBounds] originating in the top-left corner of this [Canvas] object and matching its dimensions.\n */"} {"signature":"override fun transform ( internalClassName : String , methodNode : MethodNode )","body":"{ val insns = methodNode . instructions . toArray ( ) . apply { reverse ( ) } val insnsToRemove = arrayListOf < AbstractInsnNode > ( ) val currentLabels = hashSetOf < LabelNode > ( ) val labelsToReplace = hashMapOf < LabelNode , JumpInsnNode > ( ) var pendingGoto : JumpInsnNode ? = null for ( insn in insns ) { when { insn is LabelNode -> { currentLabels . add ( insn ) pendingGoto ? . let { labelsToReplace [ insn ] = it } } insn . opcode == Opcodes . GOTO -> { pendingGoto = insn as JumpInsnNode if ( insn . label in currentLabels ) { insnsToRemove . add ( insn ) } else { currentLabels . clear ( ) } } insn is LineNumberNode || ( insn . isMeaningful && insn . opcode != Opcodes . NOP ) -> { currentLabels . clear ( ) pendingGoto = null } } } if ( labelsToReplace . isNotEmpty ( ) ) { insns . filterIsInstance < JumpInsnNode > ( ) . forEach { rewriteLabelIfNeeded ( it , labelsToReplace ) } } for ( insnToRemove in insnsToRemove ) { methodNode . instructions . insertBefore ( insnToRemove , InsnNode ( Opcodes . NOP ) ) methodNode . instructions . remove ( insnToRemove ) } }","docstring":"/**\n * Removes redundant GOTO's in the following cases:\n * (1) subsequent labels\n * ...\n * goto Label (can be removed)\n * nop (any number of them, or maybe none; will be removed by RedundantNopsCleanupMethodTransformer)\n * Label:\n * ...\n * (2) indirect goto\n * ...\n * Label (can be rewrote to Label2)\n * ...\n * Label:\n * goto Label2 (must not be removed due to the previous instruction that can fallthrough on this goto)\n * ...\n */"} {"signature":"fun reluLenetOnMnistWithIntermediateSave ( )","body":"{ val ( train , test ) = mnist ( ) SaveTrainedModelHelper ( ) . trainAndSave ( train , test , lenet5 ( ) , 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":"override fun tryToMatch ( startIndex : Int , testString : CharSequence , matchResult : MatchResultImpl ) : Int","body":"{ children . forEach { val shift = it . matches ( startIndex , testString , matchResult ) if ( shift >= ) { 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":"{ children . forEach { if ( it . matches ( startIndex , testString , matchResult ) >= ) { return - } } return next . matches ( startIndex , testString , matchResult ) }","docstring":"/** Returns startIndex+shift, the next position to match */"} {"signature":"fun KotlinTypeMarker . getAnnotationFirstArgumentValue ( fqName : FqName ) : Any ?","body":"fun KotlinTypeMarker . getAnnotationFirstArgumentValue ( fqName : FqName ) : Any ?","docstring":"/**\n * @return value of the first argument of the annotation with the given [fqName], if the annotation is present and\n * the argument is of a primitive type or a String, or null otherwise.\n *\n * Note that this method returns null if no arguments are provided, even if the corresponding annotation parameter has a default value.\n *\n * TODO: provide a more granular & elaborate API here to reduce confusion\n */"} {"signature":"override fun createCandidate ( towerCandidate : CandidateWithBoundDispatchReceiver , explicitReceiverKind : ExplicitReceiverKind , extensionReceiverCandidates : List < ReceiverValueWithSmartCastInfo > ) : MyCandidate","body":"= error ( \"\" )","docstring":"/**\n * The function is called only inside [NoExplicitReceiverScopeTowerProcessor] with [TowerData.BothTowerLevelAndContextReceiversGroup].\n * This case involves only [SimpleCandidateFactory].\n */"} {"signature":"@ kotlin . internal . InlineOnly internal actual inline fun String . nativeIndexOf ( ch : Char , fromIndex : Int ) : Int","body":"= ( this as java . lang . String ) . indexOf ( ch . code , fromIndex )","docstring":"/**\n * Returns the index within this string of the first occurrence of the specified character, starting from the specified offset.\n */"} {"signature":"@ kotlin . internal . InlineOnly internal actual inline fun String . nativeIndexOf ( str : String , fromIndex : Int ) : Int","body":"= ( this as java . lang . String ) . indexOf ( str , fromIndex )","docstring":"/**\n * Returns the index within this string of the first occurrence of the specified substring, starting from the specified offset.\n */"} {"signature":"@ kotlin . internal . InlineOnly internal actual inline fun String . nativeLastIndexOf ( ch : Char , fromIndex : Int ) : Int","body":"= ( this as java . lang . String ) . lastIndexOf ( ch . code , fromIndex )","docstring":"/**\n * Returns the index within this string of the last occurrence of the specified character.\n */"} {"signature":"@ kotlin . internal . InlineOnly internal actual inline fun String . nativeLastIndexOf ( str : String , fromIndex : Int ) : Int","body":"= ( this as java . lang . String ) . lastIndexOf ( str , fromIndex )","docstring":"/**\n * Returns the index within this string of the last occurrence of the specified character, starting from the specified offset.\n */"} {"signature":"@ Suppress ( \"\" ) public actual fun String ? . equals ( other : String ? , ignoreCase : Boolean = false ) : Boolean","body":"{ if ( this === null ) return other === null return if ( ! ignoreCase ) ( this as java . lang . String ) . equals ( other ) else ( this as java . lang . String ) . equalsIgnoreCase ( other ) }","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":"@ Suppress ( \"\" ) public actual fun String . replace ( oldChar : Char , newChar : Char , ignoreCase : Boolean = false ) : String","body":"{ if ( ! ignoreCase ) return ( this as java . lang . String ) . replace ( oldChar , newChar ) return buildString ( length ) { this@replace . forEach { c -> append ( if ( c . equals ( oldChar , ignoreCase ) ) newChar else c ) } } }","docstring":"/**\n * Returns a new string with all occurrences of [oldChar] replaced with [newChar].\n *\n * @sample samples.text.Strings.replace\n */"} {"signature":"@ Suppress ( \"\" ) public actual fun String . replace ( oldValue : String , newValue : String , ignoreCase : Boolean = false ) : String","body":"{ run { var occurrenceIndex : Int = indexOf ( oldValue , , ignoreCase ) if ( occurrenceIndex < ) return this val oldValueLength = oldValue . length val searchStep = oldValueLength . coerceAtLeast ( ) val newLengthHint = length - oldValueLength + newValue . length if ( newLengthHint < ) throw OutOfMemoryError ( ) val stringBuilder = StringBuilder ( newLengthHint ) var i = do { stringBuilder . append ( this , i , occurrenceIndex ) . append ( newValue ) i = occurrenceIndex + oldValueLength if ( occurrenceIndex >= length ) break occurrenceIndex = indexOf ( oldValue , occurrenceIndex + searchStep , ignoreCase ) } while ( occurrenceIndex > ) return stringBuilder . append ( this , i , length ) . toString ( ) } }","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":"@ Suppress ( \"\" ) public actual fun String . replaceFirst ( oldChar : Char , newChar : Char , ignoreCase : Boolean = false ) : String","body":"{ val index = indexOf ( oldChar , ignoreCase = ignoreCase ) return if ( index < ) this else this . replaceRange ( index , index + , newChar . toString ( ) ) }","docstring":"/**\n * Returns a new string with the first occurrence of [oldChar] replaced with [newChar].\n */"} {"signature":"@ Suppress ( \"\" ) public actual fun String . replaceFirst ( oldValue : String , newValue : String , ignoreCase : Boolean = false ) : String","body":"{ val index = indexOf ( oldValue , ignoreCase = ignoreCase ) return if ( index < ) this else this . replaceRange ( index , index + oldValue . length , newValue ) }","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":"@ Deprecated ( \"\" , ReplaceWith ( \"\" , \"\" ) ) @ DeprecatedSinceKotlin ( warningSince = \"\" ) @ kotlin . internal . InlineOnly public actual inline fun String . toUpperCase ( ) : String","body":"= ( this as java . lang . String ) . toUpperCase ( )","docstring":"/**\n * Returns a copy of this string converted to upper case using the rules of the default locale.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalStdlibApi :: class ) @ kotlin . internal . InlineOnly public actual inline fun String . uppercase ( ) : String","body":"= ( this as java . lang . String ) . toUpperCase ( Locale . ROOT )","docstring":"/**\n * Returns a copy of this string converted to upper case using Unicode mapping rules of the invariant locale.\n *\n * This function supports one-to-many and many-to-one character mapping,\n * thus the length of the returned string can be different from the length of the original string.\n *\n * @sample samples.text.Strings.uppercase\n */"} {"signature":"@ Deprecated ( \"\" , ReplaceWith ( \"\" , \"\" ) ) @ DeprecatedSinceKotlin ( warningSince = \"\" ) @ kotlin . internal . InlineOnly public actual inline fun String . toLowerCase ( ) : String","body":"= ( this as java . lang . String ) . toLowerCase ( )","docstring":"/**\n * Returns a copy of this string converted to lower case using the rules of the default locale.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalStdlibApi :: class ) @ kotlin . internal . InlineOnly public actual inline fun String . lowercase ( ) : String","body":"= ( this as java . lang . String ) . toLowerCase ( Locale . ROOT )","docstring":"/**\n * Returns a copy of this string converted to lower case using Unicode mapping rules of the invariant locale.\n *\n * This function supports one-to-many and many-to-one character mapping,\n * thus the length of the returned string can be different from the length of the original string.\n *\n * @sample samples.text.Strings.lowercase\n */"} {"signature":"@ SinceKotlin ( \"\" ) public actual fun CharArray . concatToString ( ) : String","body":"{ return String ( this ) }","docstring":"/**\n * Concatenates characters in this [CharArray] into a String.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ Suppress ( \"\" ) public actual fun CharArray . concatToString ( startIndex : Int = , endIndex : Int = this . size ) : String","body":"{ AbstractList . checkBoundsIndexes ( startIndex , endIndex , this . size ) return String ( this , startIndex , endIndex - startIndex ) }","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 ( \"\" ) @ Suppress ( \"\" ) public actual fun String . toCharArray ( startIndex : Int = , endIndex : Int = this . length ) : CharArray","body":"{ AbstractList . checkBoundsIndexes ( startIndex , endIndex , length ) return toCharArray ( CharArray ( endIndex - startIndex ) , , startIndex , endIndex ) }","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 actual fun ByteArray . decodeToString ( ) : String","body":"{ return String ( this ) }","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 ( \"\" ) @ Suppress ( \"\" ) public actual fun ByteArray . decodeToString ( startIndex : Int = , endIndex : Int = this . size , throwOnInvalidSequence : Boolean = false ) : String","body":"{ AbstractList . checkBoundsIndexes ( startIndex , endIndex , this . size ) if ( ! throwOnInvalidSequence ) { return String ( this , startIndex , endIndex - startIndex ) } val decoder = Charsets . UTF_8 . newDecoder ( ) . onMalformedInput ( CodingErrorAction . REPORT ) . onUnmappableCharacter ( CodingErrorAction . REPORT ) return decoder . decode ( ByteBuffer . wrap ( this , startIndex , endIndex - startIndex ) ) . toString ( ) }","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 actual fun String . encodeToByteArray ( ) : ByteArray","body":"{ return this . toByteArray ( Charsets . UTF_8 ) }","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 ( \"\" ) @ Suppress ( \"\" ) public actual fun String . encodeToByteArray ( startIndex : Int = , endIndex : Int = this . length , throwOnInvalidSequence : Boolean = false ) : ByteArray","body":"{ AbstractList . checkBoundsIndexes ( startIndex , endIndex , length ) if ( ! throwOnInvalidSequence ) { return this . substring ( startIndex , endIndex ) . toByteArray ( Charsets . UTF_8 ) } val encoder = Charsets . UTF_8 . newEncoder ( ) . onMalformedInput ( CodingErrorAction . REPORT ) . onUnmappableCharacter ( CodingErrorAction . REPORT ) val byteBuffer = encoder . encode ( CharBuffer . wrap ( this , startIndex , endIndex ) ) return if ( byteBuffer . hasArray ( ) && byteBuffer . arrayOffset ( ) == && byteBuffer . remaining ( ) == byteBuffer . array ( ) ! ! . size ) { byteBuffer . array ( ) } else { ByteArray ( byteBuffer . remaining ( ) ) . also { byteBuffer . get ( it ) } } }","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":"@ kotlin . internal . InlineOnly public actual inline fun String . toCharArray ( ) : CharArray","body":"= ( this as java . lang . String ) . toCharArray ( )","docstring":"/**\n * Returns a [CharArray] containing characters of this string.\n */"} {"signature":"@ Suppress ( \"\" ) @ kotlin . internal . InlineOnly public actual inline fun String . toCharArray ( destination : CharArray , destinationOffset : Int = , startIndex : Int = , endIndex : Int = length ) : CharArray","body":"{ ( this as java . lang . String ) . getChars ( startIndex , endIndex , destination , destinationOffset ) return destination }","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":"@ kotlin . internal . InlineOnly public inline fun String . format ( vararg args : Any ? ) : String","body":"= java . lang . String . format ( this , * args )","docstring":"/**\n * Uses this string as a format string and returns a string obtained\n * by substituting format specifiers in the format string with the provided arguments,\n * using the default locale.\n *\n * See [java.util.Formatter] class documentation\n * for the syntax of format specifiers for the format string.\n *\n * @sample samples.text.Strings.formatExtension\n */"} {"signature":"@ kotlin . internal . InlineOnly public inline fun String . Companion . format ( format : String , vararg args : Any ? ) : String","body":"= java . lang . String . format ( format , * args )","docstring":"/**\n * Uses the provided [format] as a format string and returns a string obtained\n * by substituting format specifiers in the format string with the provided arguments,\n * using the default locale.\n *\n * See [java.util.Formatter] class documentation\n * for the syntax of format specifiers for the format string.\n *\n * @sample samples.text.Strings.formatStatic\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . internal . InlineOnly public inline fun String . format ( locale : Locale ? , vararg args : Any ? ) : String","body":"= java . lang . String . format ( locale , this , * args )","docstring":"/**\n * Uses this string as a format string and returns a string obtained\n * by substituting format specifiers in the format string with the provided arguments,\n * using the specified locale. If [locale] is `null` then no localization is applied.\n *\n * See [java.util.Formatter] class documentation\n * for the syntax of format specifiers for the format string.\n *\n * @sample samples.text.Strings.formatWithLocaleExtension\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . internal . InlineOnly public inline fun String . Companion . format ( locale : Locale ? , format : String , vararg args : Any ? ) : String","body":"= java . lang . String . format ( locale , format , * args )","docstring":"/**\n * Uses the provided [format] as a format string and returns a string obtained\n * by substituting format specifiers in the format string with the provided arguments,\n * using the specified locale. If [locale] is `null` then no localization is applied.\n *\n * See [java.util.Formatter] class documentation\n * for the syntax of format specifiers for the format string.\n *\n * @sample samples.text.Strings.formatWithLocaleStatic\n */"} {"signature":"public fun CharSequence . split ( regex : Pattern , limit : Int = ) : List < String >","body":"{ requireNonNegativeLimit ( limit ) return regex . split ( this , if ( limit == ) - else limit ) . asList ( ) }","docstring":"/**\n * Splits this char sequence around matches of the given regular expression.\n *\n * This function has two notable differences from the method [Pattern.split]:\n * - the function returns the result as a `List` rather than an `Array`;\n * - when the [limit] is not specified or specified as 0,\n * this function doesn't drop trailing empty strings from the result.\n\n * @param limit Non-negative value specifying the maximum number of substrings to return.\n * Zero by default means no limit is set.\n */"} {"signature":"@ kotlin . internal . InlineOnly public actual inline fun String . substring ( startIndex : Int ) : String","body":"= ( this as java . lang . String ) . substring ( startIndex )","docstring":"/**\n * Returns a substring of this string that starts at the specified [startIndex] and continues to the end of the string.\n */"} {"signature":"@ kotlin . internal . InlineOnly public actual inline fun String . substring ( startIndex : Int , endIndex : Int ) : String","body":"= ( this as java . lang . String ) . substring ( startIndex , endIndex )","docstring":"/**\n * Returns the substring of this string starting at the [startIndex] and ending right before the [endIndex].\n *\n * @param startIndex the start index (inclusive).\n * @param endIndex the end index (exclusive).\n */"} {"signature":"@ Suppress ( \"\" ) public actual fun String . startsWith ( prefix : String , ignoreCase : Boolean = false ) : Boolean","body":"{ if ( ! ignoreCase ) return ( this as java . lang . String ) . startsWith ( prefix ) else return regionMatches ( , prefix , , prefix . length , ignoreCase ) }","docstring":"/**\n * Returns `true` if this string starts with the specified prefix.\n */"} {"signature":"@ Suppress ( \"\" ) public actual fun String . startsWith ( prefix : String , startIndex : Int , ignoreCase : Boolean = false ) : Boolean","body":"{ if ( ! ignoreCase ) return ( this as java . lang . String ) . startsWith ( prefix , startIndex ) else return regionMatches ( startIndex , prefix , , prefix . length , ignoreCase ) }","docstring":"/**\n * Returns `true` if a substring of this string starting at the specified offset [startIndex] starts with the specified prefix.\n */"} {"signature":"@ Suppress ( \"\" ) public actual fun String . endsWith ( suffix : String , ignoreCase : Boolean = false ) : Boolean","body":"{ if ( ! ignoreCase ) return ( this as java . lang . String ) . endsWith ( suffix ) else return regionMatches ( length - suffix . length , suffix , , suffix . length , ignoreCase = true ) }","docstring":"/**\n * Returns `true` if this string ends with the specified suffix.\n */"} {"signature":"@ kotlin . internal . InlineOnly public inline fun String ( bytes : ByteArray , offset : Int , length : Int , charset : Charset ) : String","body":"= java . lang . String ( bytes , offset , length , charset ) as String","docstring":"/**\n * Converts the data from a portion of the specified array of bytes to characters using the specified character set\n * and returns the conversion result as a string.\n *\n * @param bytes the source array for the conversion.\n * @param offset the offset in the array of the data to be converted.\n * @param length the number of bytes to be converted.\n * @param charset the character set to use.\n */"} {"signature":"@ kotlin . internal . InlineOnly public inline fun String ( bytes : ByteArray , charset : Charset ) : String","body":"= java . lang . String ( bytes , charset ) as String","docstring":"/**\n * Converts the data from the specified array of bytes to characters using the specified character set\n * and returns the conversion result as a string.\n */"} {"signature":"@ kotlin . internal . InlineOnly public inline fun String ( bytes : ByteArray , offset : Int , length : Int ) : String","body":"= java . lang . String ( bytes , offset , length , Charsets . UTF_8 ) as String","docstring":"/**\n * Converts the data from a portion of the specified array of bytes to characters using the UTF-8 character set\n * and returns the conversion result as a string.\n *\n * @param bytes the source array for the conversion.\n * @param offset the offset in the array of the data to be converted.\n * @param length the number of bytes to be converted.\n */"} {"signature":"@ kotlin . internal . InlineOnly public inline fun String ( bytes : ByteArray ) : String","body":"= java . lang . String ( bytes , Charsets . UTF_8 ) as String","docstring":"/**\n * Converts the data from the specified array of bytes to characters using the UTF-8 character set\n * and returns the conversion result as a string.\n */"} {"signature":"@ kotlin . internal . InlineOnly public actual inline fun String ( chars : CharArray ) : String","body":"= java . lang . String ( chars ) as String","docstring":"/**\n * Converts the characters in the specified array to a string.\n */"} {"signature":"@ kotlin . internal . InlineOnly public actual inline fun String ( chars : CharArray , offset : Int , length : Int ) : String","body":"= java . lang . String ( chars , offset , length ) as 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":"@ kotlin . internal . InlineOnly public inline fun String ( codePoints : IntArray , offset : Int , length : Int ) : String","body":"= java . lang . String ( codePoints , offset , length ) as String","docstring":"/**\n * Converts the code points from a portion of the specified Unicode code point array to a string.\n */"} {"signature":"@ kotlin . internal . InlineOnly public inline fun String ( stringBuffer : java . lang . StringBuffer ) : String","body":"= java . lang . String ( stringBuffer ) as String","docstring":"/**\n * Converts the contents of the specified StringBuffer to a string.\n */"} {"signature":"@ kotlin . internal . InlineOnly public inline fun String ( stringBuilder : java . lang . StringBuilder ) : String","body":"= java . lang . String ( stringBuilder ) as String","docstring":"/**\n * Converts the contents of the specified StringBuilder to a string.\n */"} {"signature":"@ kotlin . internal . InlineOnly public inline fun String . codePointAt ( index : Int ) : Int","body":"= ( this as java . lang . String ) . codePointAt ( index )","docstring":"/**\n * Returns the character (Unicode code point) at the specified index.\n */"} {"signature":"@ kotlin . internal . InlineOnly public inline fun String . codePointBefore ( index : Int ) : Int","body":"= ( this as java . lang . String ) . codePointBefore ( index )","docstring":"/**\n * Returns the character (Unicode code point) before the specified index.\n */"} {"signature":"@ kotlin . internal . InlineOnly public inline fun String . codePointCount ( beginIndex : Int , endIndex : Int ) : Int","body":"= ( this as java . lang . String ) . codePointCount ( beginIndex , endIndex )","docstring":"/**\n * Returns the number of Unicode code points in the specified text range of this String.\n */"} {"signature":"@ Suppress ( \"\" ) public actual fun String . compareTo ( other : String , ignoreCase : Boolean = false ) : Int","body":"{ if ( ignoreCase ) return ( this as java . lang . String ) . compareToIgnoreCase ( other ) else return ( this as java . lang . String ) . compareTo ( other ) }","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":"@ kotlin . internal . InlineOnly public inline fun String . contentEquals ( charSequence : CharSequence ) : Boolean","body":"= ( this as java . lang . String ) . contentEquals ( charSequence )","docstring":"/**\n * Returns `true` if this string is equal to the contents of the specified [CharSequence], `false` otherwise.\n *\n * Note that if the [CharSequence] argument is a [StringBuffer] then the comparison may be performed in a synchronized block\n * that acquires that [StringBuffer]'s monitor.\n */"} {"signature":"@ kotlin . internal . InlineOnly public inline fun String . contentEquals ( stringBuilder : StringBuffer ) : Boolean","body":"= ( this as java . lang . String ) . contentEquals ( stringBuilder )","docstring":"/**\n * Returns `true` if this string is equal to the contents of the specified [StringBuffer], `false` otherwise.\n *\n * This function compares this string and the specified [StringBuffer] in a synchronized block\n * that acquires that [StringBuffer]'s monitor.\n */"} {"signature":"@ SinceKotlin ( \"\" ) public actual infix fun CharSequence ? . contentEquals ( other : CharSequence ? ) : Boolean","body":"{ return if ( this is String && other != null ) contentEquals ( other ) else contentEqualsImpl ( other ) }","docstring":"/**\n * Returns `true` if the contents of this char sequence are equal to the contents of the specified [other],\n * i.e. both char sequences contain the same number of the same characters in the same order.\n *\n * If this [CharSequence] is a [String] and [other] is not `null`\n * then this function behaves the same as [String.contentEquals].\n *\n * @sample samples.text.Strings.contentEquals\n */"} {"signature":"@ SinceKotlin ( \"\" ) public actual fun CharSequence ? . contentEquals ( other : CharSequence ? , ignoreCase : Boolean ) : Boolean","body":"{ return if ( ignoreCase ) contentEqualsIgnoreCaseImpl ( other ) else contentEquals ( other ) }","docstring":"/**\n * Returns `true` if the contents of this char sequence are equal to the contents of the specified [other], optionally ignoring case difference.\n *\n * If this [CharSequence] is a [String], [other] is not `null` and [ignoreCase] is `false`\n * then this function behaves the same as [String.contentEquals].\n *\n * @param ignoreCase `true` to ignore character case when comparing contents.\n *\n * @sample samples.text.Strings.contentEquals\n */"} {"signature":"@ kotlin . internal . InlineOnly public inline fun String . intern ( ) : String","body":"= ( this as java . lang . String ) . intern ( )","docstring":"/**\n * Returns a canonical representation for this string object.\n */"} {"signature":"@ kotlin . internal . InlineOnly public inline fun String . offsetByCodePoints ( index : Int , codePointOffset : Int ) : Int","body":"= ( this as java . lang . String ) . offsetByCodePoints ( index , codePointOffset )","docstring":"/**\n * Returns the index within this string that is offset from the given [index] by [codePointOffset] code points.\n */"} {"signature":"@ Suppress ( \"\" ) public actual fun CharSequence . regionMatches ( thisOffset : Int , other : CharSequence , otherOffset : Int , length : Int , ignoreCase : Boolean = false ) : Boolean","body":"{ if ( this is String && other is String ) return this . regionMatches ( thisOffset , other , otherOffset , length , ignoreCase ) else return regionMatchesImpl ( thisOffset , other , otherOffset , length , ignoreCase ) }","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":"@ Suppress ( \"\" ) public actual fun String . regionMatches ( thisOffset : Int , other : String , otherOffset : Int , length : Int , ignoreCase : Boolean = false ) : Boolean","body":"= if ( ! ignoreCase ) ( this as java . lang . String ) . regionMatches ( thisOffset , other , otherOffset , length ) else ( this as java . lang . String ) . regionMatches ( ignoreCase , thisOffset , other , otherOffset , length )","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":"@ Deprecated ( \"\" , ReplaceWith ( \"\" ) ) @ DeprecatedSinceKotlin ( warningSince = \"\" ) @ kotlin . internal . InlineOnly public inline fun String . toLowerCase ( locale : java . util . Locale ) : String","body":"= lowercase ( locale )","docstring":"/**\n * Returns a copy of this string converted to lower case using the rules of the specified locale.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalStdlibApi :: class ) @ kotlin . internal . InlineOnly public inline fun String . lowercase ( locale : Locale ) : String","body":"= ( this as java . lang . String ) . toLowerCase ( locale )","docstring":"/**\n * Returns a copy of this string converted to lower case using the rules of the specified [locale].\n *\n * This function supports one-to-many and many-to-one character mapping,\n * thus the length of the returned string can be different from the length of the original string.\n *\n * @sample samples.text.Strings.lowercaseLocale\n */"} {"signature":"@ Deprecated ( \"\" , ReplaceWith ( \"\" ) ) @ DeprecatedSinceKotlin ( warningSince = \"\" ) @ kotlin . internal . InlineOnly public inline fun String . toUpperCase ( locale : java . util . Locale ) : String","body":"= uppercase ( locale )","docstring":"/**\n * Returns a copy of this string converted to upper case using the rules of the specified locale.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalStdlibApi :: class ) @ kotlin . internal . InlineOnly public inline fun String . uppercase ( locale : Locale ) : String","body":"= ( this as java . lang . String ) . toUpperCase ( locale )","docstring":"/**\n * Returns a copy of this string converted to upper case using the rules of the specified [locale].\n *\n * This function supports one-to-many and many-to-one character mapping,\n * thus the length of the returned string can be different from the length of the original string.\n *\n * @sample samples.text.Strings.uppercaseLocale\n */"} {"signature":"@ kotlin . internal . InlineOnly public inline fun String . toByteArray ( charset : Charset = Charsets . UTF_8 ) : ByteArray","body":"= ( this as java . lang . String ) . getBytes ( charset )","docstring":"/**\n * Encodes the contents of this string using the specified character set and returns the resulting byte array.\n * @sample samples.text.Strings.stringToByteArray\n */"} {"signature":"@ kotlin . internal . InlineOnly public inline fun String . toPattern ( flags : Int = ) : java . util . regex . Pattern","body":"{ return java . util . regex . Pattern . compile ( this , flags ) }","docstring":"/**\n * Converts the string into a regular expression [Pattern] optionally\n * with the specified [flags] from [Pattern] or'd together\n * so that strings can be split or matched on.\n */"} {"signature":"@ Deprecated ( \"\" , ReplaceWith ( \"\" , \"\" ) ) @ DeprecatedSinceKotlin ( warningSince = \"\" ) public actual fun String . capitalize ( ) : String","body":"{ @ Suppress ( \"\" ) return capitalize ( Locale . getDefault ( ) ) }","docstring":"/**\n * Returns a copy of this string having its first letter titlecased using the rules of the default locale,\n * or the original string if it's empty or already starts with a title case letter.\n *\n * The title case of a character is usually the same as its upper case with several exceptions.\n * The particular list of characters with the special title case form depends on the underlying platform.\n *\n * @sample samples.text.Strings.capitalize\n */"} {"signature":"@ Deprecated ( \"\" , ReplaceWith ( \"\" ) ) @ DeprecatedSinceKotlin ( warningSince = \"\" ) @ SinceKotlin ( \"\" ) @ kotlin . internal . LowPriorityInOverloadResolution public fun String . capitalize ( locale : Locale ) : String","body":"{ if ( isNotEmpty ( ) ) { val firstChar = this [ ] if ( firstChar . isLowerCase ( ) ) { return buildString { val titleChar = firstChar . titlecaseChar ( ) if ( titleChar != firstChar . uppercaseChar ( ) ) { append ( titleChar ) } else { append ( this @ capitalize . substring ( , ) . uppercase ( locale ) ) } append ( this @ capitalize . substring ( ) ) } } } return this }","docstring":"/**\n * Returns a copy of this string having its first letter titlecased using the rules of the specified [locale],\n * or the original string if it's empty or already starts with a title case letter.\n *\n * The title case of a character is usually the same as its upper case with several exceptions.\n * The particular list of characters with the special title case form depends on the underlying platform.\n */"} {"signature":"@ Deprecated ( \"\" , ReplaceWith ( \"\" , \"\" ) ) @ DeprecatedSinceKotlin ( warningSince = \"\" ) public actual fun String . decapitalize ( ) : String","body":"{ @ Suppress ( \"\" ) return if ( isNotEmpty ( ) && ! this [ ] . isLowerCase ( ) ) substring ( , ) . toLowerCase ( ) + substring ( ) else this }","docstring":"/**\n * Returns a copy of this string having its first letter lowercased using the rules of the default locale,\n * or the original string if it's empty or already starts with a lower case letter.\n *\n * @sample samples.text.Strings.decapitalize\n */"} {"signature":"@ Deprecated ( \"\" , ReplaceWith ( \"\" ) ) @ DeprecatedSinceKotlin ( warningSince = \"\" ) @ SinceKotlin ( \"\" ) @ kotlin . internal . LowPriorityInOverloadResolution public fun String . decapitalize ( locale : Locale ) : String","body":"{ return if ( isNotEmpty ( ) && ! this [ ] . isLowerCase ( ) ) substring ( , ) . lowercase ( locale ) + substring ( ) else this }","docstring":"/**\n * Returns a copy of this string having its first letter lowercased using the rules of the specified [locale],\n * or the original string, if it's empty or already starts with a lower case letter.\n */"} {"signature":"public actual fun CharSequence . repeat ( n : Int ) : String","body":"{ require ( n >= ) { \"\" } return when ( n ) { -> \"\" -> this . toString ( ) else -> { when ( length ) { -> \"\" -> this [ ] . let { char -> String ( CharArray ( n ) { char } ) } else -> { val sb = StringBuilder ( n * length ) for ( i in .. n ) { sb . append ( this ) } sb . toString ( ) } } } } }","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":"@ InternalCoroutinesApi public expect inline fun < T > synchronizedImpl ( lock : SynchronizedObject , block : ( ) -> T ) : T","body":"@ InternalCoroutinesApi public expect inline fun < T > synchronizedImpl ( lock : SynchronizedObject , block : ( ) -> T ) : T","docstring":"/**\n * @suppress **This an internal API and should not be used from general code.**\n */"} {"signature":"@ OptIn ( ExperimentalContracts :: class ) @ InternalCoroutinesApi public inline fun < T > synchronized ( lock : SynchronizedObject , block : ( ) -> T ) : T","body":"{ contract { callsInPlace ( block , InvocationKind . EXACTLY_ONCE ) } return synchronizedImpl ( lock , block ) }","docstring":"/**\n * @suppress **This an internal API and should not be used from general code.**\n */"} {"signature":"fun Path . modify ( transform : ( currentContent : String ) -> String )","body":"{ assert ( Files . isRegularFile ( this ) ) { \"\" } val file = toFile ( ) file . writeText ( transform ( file . readText ( ) ) ) }","docstring":"/**\n * Modify file content under [Path].\n *\n * @param transform function receiving current file content and outputting new file content\n */"} {"signature":"fun Path . append ( textToAppend : String )","body":"{ modify { \"\"\"\"\"\" . trimIndent ( ) } }","docstring":"/**\n * Append [textToAppend] to the file content under [Path].\n */"} {"signature":"fun inceptionV3Prediction ( )","body":"{ runImageRecognitionPrediction ( modelType = TFModels . CV . Inception ( ) ) }","docstring":"/**\n * This example demonstrates the inference concept on InceptionV3 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 InceptionV3 during training on ImageNet dataset) is applied to the images before prediction.\n *\n * NOTE: Input resolution is 299*299\n */"} {"signature":"fun main ( ) : Unit","body":"= inceptionV3Prediction ( )","docstring":"/** */"} {"signature":"internal fun < T > ProviderFactory . changing ( code : ( ) -> T ) : Provider < T >","body":"{ @ Suppress ( \"\" ) val adhocValueSourceClass = AdhocValueSource :: class . java as Class < AdhocValueSource < T > > return of ( adhocValueSourceClass ) { valueSourceSpec -> valueSourceSpec . parameters { it . producingLambda . set ( code ) } } }","docstring":"/**\n * Changing Provider will be evaluated every time it accessed.\n *\n * And its producing [code] will be serilalised to Configuration Cache as is\n * So that it still will be evaluated during Task Execution phase.\n * It is very convenient for Configuration Cache compatibility.\n *\n * It is recommended to use Task Output's and map/flatMap them to other Task Inputs but in cases when TaskOutput's is not available\n * as Gradle's Properties or Providers then this [changing] provider can be used.\n *\n * name `changing` and overall concept is borrowed from Gradle internal API [org.gradle.api.internal.provider.Providers.changing]\n *\n * @see org.gradle.api.internal.provider.ChangingProvider\n */"} {"signature":"public fun onModification ( )","body":"public fun onModification ( )","docstring":"/**\n * [onModification] is invoked in a write action before or after global source module state modification.\n *\n * The module structure and source code of all source [KtModule]s in the project should be considered modified when this event is\n * received. This includes source files being moved or removed, and source modules possibly being removed. Thus, all caches related to\n * source module structure and source code should be invalidated.\n *\n * Library modules (including library sources) do not need to be considered modified, so any caches related to library modules and their\n * contents may be kept.\n *\n * @see KotlinTopics\n */"} {"signature":"override fun isEmpty ( ) : Boolean","body":"= first > last","docstring":"/** \n * Checks whether the range is empty.\n *\n * The range is empty if its start value is greater than the end value.\n */"} {"signature":"override fun isEmpty ( ) : Boolean","body":"= first > last","docstring":"/** \n * Checks whether the range is empty.\n *\n * The range is empty if its start value is greater than the end value.\n */"} {"signature":"override fun isEmpty ( ) : Boolean","body":"= first > last","docstring":"/** \n * Checks whether the range is empty.\n *\n * The range is empty if its start value is greater than the end value.\n */"} {"signature":"public abstract fun preprocessing ( channelsLast : Boolean = true ) : Operation < FloatData , FloatData >","body":"public abstract fun preprocessing ( channelsLast : Boolean = true ) : Operation < FloatData , FloatData >","docstring":"/**\n * Returns preprocessing [Operation] corresponding to this preprocessing type.\n * @param [channelsLast] reflects whether channel dimension is the first or the last.\n */"} {"signature":"public fun calculateClasspathSnapshot ( classpathEntry : File , granularity : ClassSnapshotGranularity ) : ClasspathEntrySnapshot","body":"public fun calculateClasspathSnapshot ( classpathEntry : File , granularity : ClassSnapshotGranularity ) : ClasspathEntrySnapshot","docstring":"/**\n * Calculates JVM classpath snapshot for [classpathEntry] used for detecting changes in incremental compilation with specified [granularity].\n *\n * The [ClassSnapshotGranularity.CLASS_LEVEL] granularity should be preferred for rarely changing dependencies as more lightweight in terms of the resulting snapshot size.\n *\n * @param classpathEntry path to existent classpath entry\n * @param granularity determines granularity of tracking.\n */"} {"signature":"public fun makeCompilerExecutionStrategyConfiguration ( ) : CompilerExecutionStrategyConfiguration","body":"public fun makeCompilerExecutionStrategyConfiguration ( ) : CompilerExecutionStrategyConfiguration","docstring":"/**\n * Provides a default [CompilerExecutionStrategyConfiguration] allowing to use it as is or customizing for specific requirements.\n * Could be used as an overview to default values of the options (as they are implementation-specific).\n */"} {"signature":"public fun makeJvmCompilationConfiguration ( ) : JvmCompilationConfiguration","body":"public fun makeJvmCompilationConfiguration ( ) : JvmCompilationConfiguration","docstring":"/**\n * Provides a default [CompilerExecutionStrategyConfiguration] allowing to use it as is or customizing for specific requirements.\n * Could be used as an overview to default values of the options (as they are implementation-specific).\n */"} {"signature":"public fun compileJvm ( projectId : ProjectId , strategyConfig : CompilerExecutionStrategyConfiguration , compilationConfig : JvmCompilationConfiguration , sources : List < File > , arguments : List < String > , ) : CompilationResult","body":"public fun compileJvm ( projectId : ProjectId , strategyConfig : CompilerExecutionStrategyConfiguration , compilationConfig : JvmCompilationConfiguration , sources : List < File > , arguments : List < String > , ) : CompilationResult","docstring":"/**\n * Compiles Kotlin code targeting JVM platform and using specified options.\n *\n * The [finishProjectCompilation] must be called with the same [projectId] after the entire project is compiled.\n * @param projectId The unique identifier of the project to be compiled. It may be the same for different modules of the project.\n * @param strategyConfig an instance of [CompilerExecutionStrategyConfiguration] initially obtained from [makeCompilerExecutionStrategyConfiguration]\n * @param compilationConfig an instance of [JvmCompilationConfiguration] initially obtained from [makeJvmCompilationConfiguration]\n * @param sources a list of all sources of the compilation unit\n * @param arguments a list of Kotlin JVM compiler arguments\n */"} {"signature":"public fun finishProjectCompilation ( projectId : ProjectId )","body":"public fun finishProjectCompilation ( projectId : ProjectId )","docstring":"/**\n * A finalization function that must be called when all the modules of the project are compiled.\n *\n * May perform cache clean-ups and resource freeing.\n *\n * @param projectId The unique identifier of the compiled project.\n */"} {"signature":"public fun getCustomKotlinScriptFilenameExtensions ( classpath : List < File > ) : Collection < String >","body":"public fun getCustomKotlinScriptFilenameExtensions ( classpath : List < File > ) : Collection < String >","docstring":"/**\n * Retrieves the custom Kotlin script filename extensions based on script definitions from the specified classpath.\n *\n * @param classpath The list of files representing the classpath.\n * @return A collection of strings representing the custom Kotlin script filename extensions.\n */"} {"signature":"public fun getCompilerVersion ( ) : String","body":"public fun getCompilerVersion ( ) : String","docstring":"/**\n * Returns the version of the Kotlin compiler used to run compilation.\n *\n * @return A string representing the version of the Kotlin compiler, for example `2.0.0-Beta4`.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalUnsignedTypes :: class ) public fun maxOf ( a : UInt , b : UInt ) : UInt","body":"{ return if ( a >= b ) a else b }","docstring":"/**\n * Returns the greater of two values.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalUnsignedTypes :: class ) public fun maxOf ( a : ULong , b : ULong ) : ULong","body":"{ return if ( a >= b ) a else b }","docstring":"/**\n * Returns the greater of two values.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalUnsignedTypes :: class ) public fun maxOf ( a : UByte , b : UByte ) : UByte","body":"{ return if ( a >= b ) a else b }","docstring":"/**\n * Returns the greater of two values.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalUnsignedTypes :: class ) public fun maxOf ( a : UShort , b : UShort ) : UShort","body":"{ return if ( a >= b ) a else b }","docstring":"/**\n * Returns the greater of two values.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalUnsignedTypes :: class ) @ kotlin . internal . InlineOnly public inline fun maxOf ( a : UInt , b : UInt , c : UInt ) : UInt","body":"{ return maxOf ( a , maxOf ( b , c ) ) }","docstring":"/**\n * Returns the greater of three values.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalUnsignedTypes :: class ) @ kotlin . internal . InlineOnly public inline fun maxOf ( a : ULong , b : ULong , c : ULong ) : ULong","body":"{ return maxOf ( a , maxOf ( b , c ) ) }","docstring":"/**\n * Returns the greater of three values.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalUnsignedTypes :: class ) @ kotlin . internal . InlineOnly public inline fun maxOf ( a : UByte , b : UByte , c : UByte ) : UByte","body":"{ return maxOf ( a , maxOf ( b , c ) ) }","docstring":"/**\n * Returns the greater of three values.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalUnsignedTypes :: class ) @ kotlin . internal . InlineOnly public inline fun maxOf ( a : UShort , b : UShort , c : UShort ) : UShort","body":"{ return maxOf ( a , maxOf ( b , c ) ) }","docstring":"/**\n * Returns the greater of three values.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ ExperimentalUnsignedTypes public fun maxOf ( a : UInt , vararg other : UInt ) : UInt","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 ( \"\" ) @ ExperimentalUnsignedTypes public fun maxOf ( a : ULong , vararg other : ULong ) : ULong","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 ( \"\" ) @ ExperimentalUnsignedTypes public fun maxOf ( a : UByte , vararg other : UByte ) : UByte","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 ( \"\" ) @ ExperimentalUnsignedTypes public fun maxOf ( a : UShort , vararg other : UShort ) : UShort","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 ( \"\" ) @ WasExperimental ( ExperimentalUnsignedTypes :: class ) public fun minOf ( a : UInt , b : UInt ) : UInt","body":"{ return if ( a <= b ) a else b }","docstring":"/**\n * Returns the smaller of two values.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalUnsignedTypes :: class ) public fun minOf ( a : ULong , b : ULong ) : ULong","body":"{ return if ( a <= b ) a else b }","docstring":"/**\n * Returns the smaller of two values.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalUnsignedTypes :: class ) public fun minOf ( a : UByte , b : UByte ) : UByte","body":"{ return if ( a <= b ) a else b }","docstring":"/**\n * Returns the smaller of two values.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalUnsignedTypes :: class ) public fun minOf ( a : UShort , b : UShort ) : UShort","body":"{ return if ( a <= b ) a else b }","docstring":"/**\n * Returns the smaller of two values.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalUnsignedTypes :: class ) @ kotlin . internal . InlineOnly public inline fun minOf ( a : UInt , b : UInt , c : UInt ) : UInt","body":"{ return minOf ( a , minOf ( b , c ) ) }","docstring":"/**\n * Returns the smaller of three values.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalUnsignedTypes :: class ) @ kotlin . internal . InlineOnly public inline fun minOf ( a : ULong , b : ULong , c : ULong ) : ULong","body":"{ return minOf ( a , minOf ( b , c ) ) }","docstring":"/**\n * Returns the smaller of three values.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalUnsignedTypes :: class ) @ kotlin . internal . InlineOnly public inline fun minOf ( a : UByte , b : UByte , c : UByte ) : UByte","body":"{ return minOf ( a , minOf ( b , c ) ) }","docstring":"/**\n * Returns the smaller of three values.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalUnsignedTypes :: class ) @ kotlin . internal . InlineOnly public inline fun minOf ( a : UShort , b : UShort , c : UShort ) : UShort","body":"{ return minOf ( a , minOf ( b , c ) ) }","docstring":"/**\n * Returns the smaller of three values.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ ExperimentalUnsignedTypes public fun minOf ( a : UInt , vararg other : UInt ) : UInt","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 ( \"\" ) @ ExperimentalUnsignedTypes public fun minOf ( a : ULong , vararg other : ULong ) : ULong","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 ( \"\" ) @ ExperimentalUnsignedTypes public fun minOf ( a : UByte , vararg other : UByte ) : UByte","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 ( \"\" ) @ ExperimentalUnsignedTypes public fun minOf ( a : UShort , vararg other : UShort ) : UShort","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":"actual override suspend fun emit ( value : T )","body":"{ return suspendCoroutineUninterceptedOrReturn sc @ { uCont -> try { emit ( uCont , value ) } catch ( e : Throwable ) { lastEmissionContext = DownstreamExceptionContext ( e , uCont . context ) throw e } } }","docstring":"/**\n * This is a crafty implementation of state-machine reusing.\n *\n * First it checks that it is not used concurrently (which we explicitly prohibit), and\n * then just caches an instance of the completion_ in order to avoid extra allocation on each emit,\n * making it effectively garbage-free on its hot-path.\n *\n * See `emit` overload.\n */"} {"signature":"private fun emit ( uCont : Continuation < Unit > , value : T ) : Any ?","body":"{ val currentContext = uCont . context currentContext . ensureActive ( ) val previousContext = lastEmissionContext if ( previousContext !== currentContext ) { checkContext ( currentContext , previousContext , value ) lastEmissionContext = currentContext } completion_ = uCont val result = emitFun ( collector as FlowCollector < Any ? > , value , this as Continuation < Unit > ) if ( result != COROUTINE_SUSPENDED ) { completion_ = null } return result }","docstring":"/**\n * Here we use the following trick:\n * - Perform all the required checks\n * - Having a non-intercepted, non-cancellable caller's `uCont`, we leverage our implementation knowledge\n * and invoke `collector.emit(T)` as `collector.emit(value: T, completion: Continuation), passing `this`\n * as the completion. We also setup `this` state, so if the `completion.resume` is invoked, we are\n * invoking `uCont.resume` properly in accordance with `ContinuationImpl`/`BaseContinuationImpl` internal invariants.\n *\n * Note that in such scenarios, `collector.emit` completion is the current instance of SafeCollector and thus is reused.\n */"} {"signature":"fun BuildResult . extractProjectsAndTheirDiagnostics ( ) : String","body":"= buildString { var diagnosticStarted = false var stacktraceStarted = false val currentDiagnostic = mutableListOf < String > ( ) fun startDiagnostic ( line : String , lineIndex : Int ) { require ( ! diagnosticStarted ) { printBuildOutput ( ) \"\" } currentDiagnostic += line diagnosticStarted = true } fun continueDiagnostic ( line : String ) { when { line == KOTLIN_DIAGNOSTIC_STACKTRACE_START -> { stacktraceStarted = true currentDiagnostic += line currentDiagnostic += DIAGNOSTIC_STACKTRACE_REPLACEMENT_STUB } line == KOTLIN_DIAGNOSTIC_STACKTRACE_END_SEPARATOR -> { stacktraceStarted = false } stacktraceStarted -> return else -> currentDiagnostic += line } } fun endDiagnostic ( line : String , lineIndex : Int ) { require ( diagnosticStarted ) { printBuildOutput ( ) \"\" } currentDiagnostic += line if ( KotlinToolingDiagnostics . InternalKotlinGradlePluginPropertiesUsed . id in currentDiagnostic . first ( ) ) { val cleanedDiagnostic = filterKgpUtilityPropertiesFromDiagnostic ( currentDiagnostic ) if ( cleanedDiagnostic . isNotEmpty ( ) ) appendLine ( cleanedDiagnostic . joinToString ( separator = \"\" , postfix = \"\" ) ) } else { appendLine ( currentDiagnostic . joinToString ( separator = \"\" , postfix = \"\" ) ) } currentDiagnostic . clear ( ) diagnosticStarted = false } for ( ( index , line ) in output . lines ( ) . withIndex ( ) ) { when { line . trim ( ) == VERBOSE_DIAGNOSTIC_SEPARATOR -> endDiagnostic ( line , index ) DIAGNOSTIC_START_REGEX . containsMatchIn ( line ) -> startDiagnostic ( line , index ) diagnosticStarted -> continueDiagnostic ( line ) line . startsWith ( CONFIGURE_PROJECT_PREFIX ) || ( line . contains ( ENSURE_NO_KOTLIN_GRADLE_PLUGIN_ERRORS_TASK_NAME ) && line . startsWith ( TASK_EXECUTION_PREFIX ) ) -> { appendLine ( ) appendLine ( line ) } } } } . trim ( )","docstring":"/**\n * NB: Needs parsable formatting of diagnostics, see [org.jetbrains.kotlin.gradle.plugin.PropertiesProvider.internalDiagnosticsUseParsableFormat]\n * Because this mode is enabled by the 'kotlin.internal'-property, actual output will always contain\n * [org.jetbrains.kotlin.gradle.plugin.diagnostics.KotlinToolingDiagnostics.InternalKotlinGradlePluginPropertiesUsed].\n * For the sake of clarity, this diagnostic is filtered by default.\n */"} {"signature":"private fun filterKgpUtilityPropertiesFromDiagnostic ( diagnosticLines : List < String > ) : List < String >","body":"{ val diagnosticWithUtilityPropertiesFiltered = diagnosticLines . filter { line -> ! utilityInternalProperties . any { line . startsWith ( it ) } } return if ( diagnosticWithUtilityPropertiesFiltered . none { it . startsWith ( \"\" ) } ) { emptyList ( ) } else { diagnosticWithUtilityPropertiesFiltered } }","docstring":"/**\n * Filters from the report all internal utility-properties that KGP uses in tests.\n * If no properties aside from utility-properties were reported, the whole report is hidden\n */"} {"signature":"private fun IrFunction . externallyTransformed ( ) : Boolean","body":"= decoysEnabled && valueParameters . firstOrNull { it . name == KtxNameConventions . COMPOSER_PARAMETER } != null","docstring":"/**\n * With klibs, composable functions are always deserialized from IR instead of being restored\n * into stubs.\n * In this case, we need to avoid transforming those functions twice (because synthetic\n * parameters are being added). We know however, that all the other modules were compiled\n * before, so if the function comes from other [IrModuleFragment], we must skip it.\n *\n * NOTE: [ModuleDescriptor] will not work here, as incremental compilation of the same module\n * can contain some functions that were transformed during previous compilation in a\n * different module fragment with the same [ModuleDescriptor]\n */"} {"signature":"private fun commitPendingDiagnosticsOnNestedDeclarations ( element : FirElement )","body":"{ val declarationContainer = when ( element ) { is FirFile -> element . declarations . singleOrNull ( ) as? FirScript ? : element is FirScript , is FirRegularClass -> element else -> return } @ Suppress ( \"\" ) ( declarationContainer as FirDeclaration ) . forEachDeclaration { declaration -> withAnnotationContainer ( declaration ) { declaration . accept ( components . reportCommitter , context ) } } }","docstring":"/**\n * File and class checkers may report diagnostics on top-level declarations and class members, such as conflicting overload errors.\n * Because we are collecting diagnostics for each structure element separately, this visitor will not visit these nested declarations by\n * default, as the file/class and its nested declarations are different structure elements. Instead, all diagnostics produced during the\n * visitor run will be committed at the end (see [FileStructureElementDiagnosticsCollector.collectForStructureElement]).\n *\n * Skipping nested declarations circumvents error suppression with `@Suppress` on top-level declarations and class members. This is\n * because suppression usually works as such: When a diagnostic is first reported on an element `E`, it is \"pending\". Once element `E`\n * is visited by the diagnostic visitor, it commits all pending diagnostics for `E`, including those reported by a file/class checker.\n * Diagnostics which are suppressed in the current context are instead removed. Without committing pending diagnostics on each element\n * `E`, suppression cannot take effect.\n *\n * [commitPendingDiagnosticsOnNestedDeclarations] commits pending diagnostics for directly nested elements, allowing the report\n * committer to take suppression into account.\n *\n * It suffices to commit pending diagnostics for directly nested declarations, because checkers can only report diagnostics on directly\n * accessible children. For example, a file checker can report a diagnostic on a top-level class, but not its member function.\n */"} {"signature":"public fun < T > xEnd ( column : ColumnReference < T > ) : PositionalMapping < T >","body":"{ return addPositionalMapping < T > ( X_END , column . name ( ) , null ) }","docstring":"/**\n * Maps the `xEnd` 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 > xEnd ( column : KProperty < T > ) : PositionalMapping < T >","body":"{ return addPositionalMapping < T > ( X_END , column . name , null ) }","docstring":"/**\n * Maps the `xEnd` 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 xEnd ( column : String ) : PositionalMapping < Any ? >","body":"{ return addPositionalMapping ( X_END , column , null ) }","docstring":"/**\n * Maps the `xEnd` 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 > xEnd ( values : Iterable < T > ) : PositionalMapping < T >","body":"{ return addPositionalMapping < T > ( X_END , values . toList ( ) , null , null ) }","docstring":"/**\n * Maps the `xEnd` 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 > xEnd ( values : DataColumn < T > ) : PositionalMapping < T >","body":"{ return addPositionalMapping < T > ( X_END , values , null ) }","docstring":"/**\n * Maps the `xEnd` 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":"fun getKotlinName ( decl : StructDecl ) : String","body":"{ val spelling = decl . spelling if ( decl . isAnonymous ) { val names = anonymousStructKotlinNames return names . getOrPut ( decl ) { \"\" } } val strippedCName = if ( spelling . startsWith ( \"\" ) || spelling . startsWith ( \"\" ) ) { spelling . substringAfter ( '' ) } else { spelling } return if ( strippedCName !in forbiddenStructNames ) strippedCName else ( strippedCName + \"\" ) }","docstring":"/**\n * The name to be used for this struct in Kotlin\n */"} {"signature":"fun addAllAnnotations ( currentRawAnnotations : MutableList < in PsiAnnotation > , foundQualifiers : MutableSet < String > , owner : PsiElement )","body":"fun addAllAnnotations ( currentRawAnnotations : MutableList < in PsiAnnotation > , foundQualifiers : MutableSet < String > , owner : PsiElement )","docstring":"/**\n * Adds new annotations to [currentRawAnnotations] and [foundQualifiers].\n * [currentRawAnnotations] and [foundQualifiers] must be consistent with each other.\n * A parent for all new annotations must be [owner].\n *\n * @param currentRawAnnotations a list of already presented annotations\n * @param foundQualifiers a list of already presented qualifiers. Used to optimize computation\n * @param owner an owner for new annotations\n */"} {"signature":"fun isSpecialQualifier ( qualifiedName : String ) : Boolean","body":"fun isSpecialQualifier ( qualifiedName : String ) : Boolean","docstring":"/**\n * @return **true** if this qualifier should be treated as a **special** in [GranularAnnotationsBox.findAnnotation]\n * (should be processed without [GranularAnnotationsBox.getOrComputeCachedAnnotations] call)\n */"} {"signature":"fun findSpecialAnnotation ( annotationsBox : GranularAnnotationsBox , qualifiedName : String , owner : PsiElement ) : PsiAnnotation ?","body":"fun findSpecialAnnotation ( annotationsBox : GranularAnnotationsBox , qualifiedName : String , owner : PsiElement ) : PsiAnnotation ?","docstring":"/**\n * The resulted annotation must be presented among all annotations after [addAllAnnotations]\n *\n * @param annotationsBox an owner of [AdditionalAnnotationsProvider]\n * @param qualifiedName a **special** ([isSpecialQualifier] must be **true** for it) qualified name for a new annotation\n * @param owner an owner for a new annotation\n *\n * @return a new annotation with [qualifiedName]\n */"} {"signature":"fun addSimpleAnnotationIfMissing ( qualifier : String , currentRawAnnotations : MutableList < in PsiAnnotation > , foundQualifiers : MutableSet < String > , owner : PsiElement , )","body":"{ val isNewQualifier = foundQualifiers . add ( qualifier ) if ( ! isNewQualifier ) return currentRawAnnotations += SymbolLightSimpleAnnotation ( qualifier , owner ) }","docstring":"/**\n * Adds a new annotation with [qualifier] name to [currentRawAnnotations] and [foundQualifiers] if not already present\n */"} {"signature":"public abstract fun createProjectWideOutOfBlockModificationTracker ( ) : ModificationTracker","body":"public abstract fun createProjectWideOutOfBlockModificationTracker ( ) : ModificationTracker","docstring":"/**\n * Creates an out-of-block modification tracker which is incremented every time there is an out-of-block change in some source project\n * module.\n *\n * ### Out-of-block Modification (OOBM)\n *\n * Out-of-block modification is a source code modification which may change the resolution of other non-local declarations.\n *\n * #### Example 1\n *\n * ```\n * val x = 10\n * val z = x\n * ```\n *\n * If we change the initializer of `x` to `\"str\"` the return type of `x` will become `String` instead of the initial `Int`. This will\n * change the return type of `z` as it does not have an explicit type. So, it is an **OOBM**.\n *\n * #### Example 2\n *\n * ```\n * val x: Int = 10\n * val z = x\n * ```\n *\n * If we change `10` to `\"str\"` as in the first example, it would not change the type of `z`, so it is not an **OOBM**.\n *\n * #### Examples of source code modifications which result in an **OOBM**\n *\n * - Modification inside non-local (i.e. accessible outside) declaration without explicit return type specified\n * - Modification of a package\n * - Creation of a new declaration\n * - Moving a declaration to another package\n *\n * Generally, all modifications which happen outside the body of a callable declaration (functions, accessors, or properties) with an\n * explicit type are considered **OOBM**.\n *\n * @see ModificationTracker\n */"} {"signature":"public abstract fun createLibrariesWideModificationTracker ( ) : ModificationTracker","body":"public abstract fun createLibrariesWideModificationTracker ( ) : ModificationTracker","docstring":"/**\n * Creates a modification tracker which is incremented every time libraries in the project are changed.\n *\n * @see ModificationTracker\n */"} {"signature":"public fun Project . createProjectWideOutOfBlockModificationTracker ( ) : ModificationTracker","body":"= KotlinModificationTrackerFactory . getInstance ( this ) . createProjectWideOutOfBlockModificationTracker ( )","docstring":"/**\n * Creates an **OOBM** tracker which is incremented every time there is an OOB change in some source project module.\n *\n * See [KotlinModificationTrackerFactory.createProjectWideOutOfBlockModificationTracker] for the definition of **OOBM**.\n * @see ModificationTracker\n */"} {"signature":"public fun Project . createAllLibrariesModificationTracker ( ) : ModificationTracker","body":"= KotlinModificationTrackerFactory . getInstance ( this ) . createLibrariesWideModificationTracker ( )","docstring":"/**\n * Creates a modification tracker which is incremented every time libraries in the project are changed.\n *\n * See [KotlinModificationTrackerFactory] for the definition of **OOBM**.\n * @see ModificationTracker\n */"} {"signature":"@ K2Only override fun < R > withTypeVariablesThatAreCountedAsProperTypes ( typeVariables : Set < TypeConstructorMarker > , block : ( ) -> R ) : R","body":"{ checkState ( State . BUILDING ) properTypesCache . clear ( ) notProperTypesCache . clear ( ) require ( typeVariablesThatAreCountedAsProperTypes == null ) { \"\" } typeVariablesThatAreCountedAsProperTypes = typeVariables val result = block ( ) typeVariablesThatAreCountedAsProperTypes = null properTypesCache . clear ( ) notProperTypesCache . clear ( ) return result }","docstring":"/**\n * @see [org.jetbrains.kotlin.resolve.calls.inference.components.VariableFixationFinder.Context.typeVariablesThatAreNotCountedAsProperTypes]\n * @see [org.jetbrains.kotlin.fir.resolve.transformers.body.resolve.FirDeclarationsResolveTransformer.fixInnerVariablesForProvideDelegateIfNeeded]\n */"} {"signature":"override fun resolveForkPointsConstraints ( )","body":"{ if ( constraintsFromAllForkPoints . isEmpty ( ) ) return val allForkPointsData = constraintsFromAllForkPoints . toList ( ) constraintsFromAllForkPoints . clear ( ) for ( ( position , forkPointData ) in allForkPointsData ) { if ( ! applyConstraintsFromFirstSuccessfulBranchOfTheFork ( forkPointData , position ) ) { addError ( NoSuccessfulFork ( position ) ) } } }","docstring":"/**\n * This function tries to find the solution (set of constraints) that is consistent with some branch of each fork\n * And those constraints are being immediately applied to the system\n */"} {"signature":"fun checkIfForksMightBeSuccessfullyResolved ( ) : ConstraintSystemError ?","body":"{ if ( constraintsFromAllForkPoints . isEmpty ( ) ) return null val allForkPointsData = constraintsFromAllForkPoints . toList ( ) constraintsFromAllForkPoints . clear ( ) var result : ConstraintSystemError ? = null runTransaction { for ( ( position , forkPointData ) in allForkPointsData ) { if ( ! applyConstraintsFromFirstSuccessfulBranchOfTheFork ( forkPointData , position ) ) { result = NoSuccessfulFork ( position ) break } } false } constraintsFromAllForkPoints . addAll ( allForkPointsData ) return result }","docstring":"/**\n * Checks if current state of forked constraints is not contradictory.\n *\n * That function is expected to be pure, i.e. it should leave the system in the same state it was found before the call.\n *\n * @return null if for each fork we found a possible branch that doesn't contradict with all other constraints\n * @return non-nullable error if there's a contradiction we didn't manage to resolve\n */"} {"signature":"private fun applyConstraintsFromFirstSuccessfulBranchOfTheFork ( forkPointData : ForkPointData , position : IncorporationConstraintPosition , ) : Boolean","body":"{ return forkPointData . any { constraintSetForForkBranch -> runTransaction { constraintInjector . processGivenForkPointBranchConstraints ( this @ NewConstraintSystemImpl . apply { checkState ( State . BUILDING , State . COMPLETION , State . TRANSACTION ) } , constraintSetForForkBranch , position , ) resolveForkPointsConstraints ( ) ! hasContradiction } } }","docstring":"/**\n * @return true if there is a successful constraints set for the fork\n */"} {"signature":"public fun FieldType . isNullable ( ) : Boolean","body":"= when ( this ) { is FieldType . FrameFieldType -> markerName . endsWith ( \"\" ) || markerName == \"\" is FieldType . GroupFieldType -> markerName . endsWith ( \"\" ) || markerName == \"\" is FieldType . ValueFieldType -> typeFqName . endsWith ( \"\" ) || typeFqName == \"\" }","docstring":"/**\n * Returns whether the column type ends with `?` or not.\n * NOTE: for [FieldType.FrameFieldType], the `nullable` property indicates the nullability of the frame itself, not the type of the column.\n */"} {"signature":"public fun FieldType . isNotNullable ( ) : Boolean","body":"= ! isNullable ( )","docstring":"/**\n * Returns whether the column type doesn't end with `?` or whether it does.\n * NOTE: for [FieldType.FrameFieldType], the `nullable` property indicates the nullability of the frame itself, not the type of the column.\n */"} {"signature":"public fun FieldType . toNullable ( ) : FieldType","body":"= if ( isNotNullable ( ) ) { when ( this ) { is FieldType . FrameFieldType -> FieldType . FrameFieldType ( markerName . toNullable ( ) , nullable ) is FieldType . GroupFieldType -> FieldType . GroupFieldType ( markerName . toNullable ( ) ) is FieldType . ValueFieldType -> FieldType . ValueFieldType ( typeFqName . toNullable ( ) ) } } else this","docstring":"/**\n * Returns a new fieldType with the same type but with nullability in the column type.\n * NOTE: for [FieldType.FrameFieldType], the `nullable` property indicates the nullability of the frame itself, not the type of the column.\n */"} {"signature":"public fun FieldType . toNotNullable ( ) : FieldType","body":"= if ( isNullable ( ) ) { when ( this ) { is FieldType . FrameFieldType -> FieldType . FrameFieldType ( markerName = markerName . let { if ( it == \"\" ) \"\" else it . removeSuffix ( \"\" ) } , nullable = nullable , ) is FieldType . GroupFieldType -> FieldType . GroupFieldType ( markerName = markerName . let { if ( it == \"\" ) \"\" else it . removeSuffix ( \"\" ) } , ) is FieldType . ValueFieldType -> FieldType . ValueFieldType ( typeFqName = typeFqName . let { if ( it == \"\" ) \"\" else it . removeSuffix ( \"\" ) } , ) } } else this","docstring":"/**\n * Returns a new fieldType with the same type but with nullability disabled in the column type.\n * NOTE: for [FieldType.FrameFieldType], the `nullable` property indicates the nullability of the frame itself, not the type of the column.\n */"} {"signature":"override fun isEmpty ( ) : Boolean","body":"= first > last","docstring":"/** \n * Checks if the range is empty.\n \n * The range is empty if its start value is greater than the end value.\n */"} {"signature":"public open fun isEmpty ( ) : Boolean","body":"= if ( step > ) first > last else first < last","docstring":"/** \n * Checks if the progression is empty.\n \n * Progression with a positive step is empty if its first element is greater than the last element.\n * Progression with a negative step is empty if its first element is less than the last element.\n */"} {"signature":"public fun fromClosedRange ( rangeStart : ULong , rangeEnd : ULong , step : Long ) : ULongProgression","body":"= ULongProgression ( rangeStart , rangeEnd , step )","docstring":"/**\n * Creates ULongProgression within the specified bounds of a closed range.\n\n * The progression starts with the [rangeStart] value and goes toward the [rangeEnd] value not excluding it, with the specified [step].\n * In order to go backwards the [step] must be negative.\n *\n * [step] must be greater than `Long.MIN_VALUE` and not equal to zero.\n */"} {"signature":"fun main ( )","body":"{ val ( train , test ) = fashionMnist ( ) val ( newTrain , validation ) = train . split ( ) val sampleIndex = val x = test . getX ( sampleIndex ) val y = test . getY ( sampleIndex ) . toInt ( ) lenet5 ( ) . use { it . compile ( optimizer = Adam ( ) , loss = Losses . SOFT_MAX_CROSS_ENTROPY_WITH_LOGITS , metric = Metrics . ACCURACY ) it . fit ( trainingDataset = newTrain , validationDataset = validation , epochs = EPOCHS , trainBatchSize = TRAINING_BATCH_SIZE , validationBatchSize = TEST_BATCH_SIZE ) val fashionPlots = List ( ) { imageIndex -> flattenImagePlot ( imageIndex , test , predict = it :: predictLabel , labelEncoding = fashionMnistLabelEncoding :: get , plotFeature = PlotFeature . GRAY ) } columnPlot ( fashionPlots , , ) . show ( ) val accuracy = it . evaluate ( dataset = test , batchSize = TEST_BATCH_SIZE ) . metrics [ Metrics . ACCURACY ] println ( \"\" ) val fstConv2D = it . layers [ ] as Conv2D val sndConv2D = it . layers [ ] as Conv2D filtersPlot ( fstConv2D , columns = ) . show ( ) filtersPlot ( sndConv2D , columns = ) . show ( ) drawFilters ( fstConv2D . weights . values . toTypedArray ( ) [ ] , colorCoefficient = ) drawFilters ( sndConv2D . weights . values . toTypedArray ( ) [ ] , colorCoefficient = ) val layersActivations = modelActivationOnLayersPlot ( it , x ) val ( prediction , activations ) = it . predictAndGetActivations ( x ) println ( \"\" ) println ( \"\" ) layersActivations [ ] . show ( ) layersActivations [ ] . show ( ) drawActivations ( activations ) } }","docstring":"/**\n * This examples demonstrates model activations and Conv2D filters visualisation.\n *\n * Model is trained on FashionMnist dataset.\n */"} {"signature":"protected abstract fun selectDeserializer ( element : JsonElement ) : DeserializationStrategy < T >","body":"protected abstract fun selectDeserializer ( element : JsonElement ) : DeserializationStrategy < T >","docstring":"/**\n * Determines a particular strategy for deserialization by looking on a parsed JSON [element].\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalTime :: class ) public inline fun measureTime ( block : ( ) -> Unit ) : Duration","body":"{ contract { callsInPlace ( block , InvocationKind . EXACTLY_ONCE ) } return TimeSource . Monotonic . measureTime ( block ) }","docstring":"/**\n * Executes the given function [block] and returns the duration of elapsed time interval.\n *\n * The elapsed time is measured with [TimeSource.Monotonic].\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalTime :: class ) public inline fun TimeSource . measureTime ( block : ( ) -> Unit ) : Duration","body":"{ contract { callsInPlace ( block , InvocationKind . EXACTLY_ONCE ) } val mark = markNow ( ) block ( ) return mark . elapsedNow ( ) }","docstring":"/**\n * Executes the given function [block] and returns the duration of elapsed time interval.\n *\n * The elapsed time is measured with the specified `this` [TimeSource] instance.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalTime :: class ) public inline fun TimeSource . Monotonic . measureTime ( block : ( ) -> Unit ) : Duration","body":"{ contract { callsInPlace ( block , InvocationKind . EXACTLY_ONCE ) } val mark = markNow ( ) block ( ) return mark . elapsedNow ( ) }","docstring":"/**\n * Executes the given function [block] and returns the duration of elapsed time interval.\n *\n * The elapsed time is measured with the specified `this` [TimeSource.Monotonic] instance.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalTime :: class ) public inline fun < T > measureTimedValue ( block : ( ) -> T ) : TimedValue < T >","body":"{ contract { callsInPlace ( block , InvocationKind . EXACTLY_ONCE ) } return TimeSource . Monotonic . measureTimedValue ( block ) }","docstring":"/**\n * Executes the given function [block] and returns an instance of [TimedValue] class, containing both\n * the result of the function execution and the duration of elapsed time interval.\n *\n * The elapsed time is measured with [TimeSource.Monotonic].\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalTime :: class ) public inline fun < T > TimeSource . measureTimedValue ( block : ( ) -> T ) : TimedValue < T >","body":"{ contract { callsInPlace ( block , InvocationKind . EXACTLY_ONCE ) } val mark = markNow ( ) val result = block ( ) return TimedValue ( result , mark . elapsedNow ( ) ) }","docstring":"/**\n * Executes the given function [block] and returns an instance of [TimedValue] class, containing both\n * the result of function execution and the duration of elapsed time interval.\n *\n * The elapsed time is measured with the specified `this` [TimeSource] instance.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalTime :: class ) public inline fun < T > TimeSource . Monotonic . measureTimedValue ( block : ( ) -> T ) : TimedValue < T >","body":"{ contract { callsInPlace ( block , InvocationKind . EXACTLY_ONCE ) } val mark = markNow ( ) val result = block ( ) return TimedValue ( result , mark . elapsedNow ( ) ) }","docstring":"/**\n * Executes the given function [block] and returns an instance of [TimedValue] class, containing both\n * the result of function execution and the duration of elapsed time interval.\n *\n * The elapsed time is measured with the specified `this` [TimeSource.Monotonic] instance.\n */"} {"signature":"public fun exists ( path : Path ) : Boolean","body":"public fun exists ( path : Path ) : Boolean","docstring":"/**\n * Returns `true` if there is a filesystem entity a [path] points to,\n * otherwise returns `false`.\n *\n * @param path the path that should be checked for existence.\n *\n * @throws kotlinx.io.IOException when the attempt to check the existence of the [path] failed.\n */"} {"signature":"public fun delete ( path : Path , mustExist : Boolean = true )","body":"public fun delete ( path : Path , mustExist : Boolean = true )","docstring":"/**\n * Deletes a file or directory the [path] points to from a filesystem.\n * If there is no filesystem entity represented by the [path]\n * this method throws [kotlinx.io.files.FileNotFoundException] when [mustExist] is `true`.\n *\n * Note that in the case of a directory, this method will not attempt to delete it recursively,\n * so deletion of non-empty directory will fail.\n *\n * @param path the path to a file or directory to be deleted.\n * @param mustExist the flag indicating whether missing [path] is an error, `true` by default.\n *\n * @throws kotlinx.io.files.FileNotFoundException when [path] does not exist and [mustExist] is `true`.\n * @throws kotlinx.io.IOException if deletion failed.\n */"} {"signature":"public fun createDirectories ( path : Path , mustCreate : Boolean = false )","body":"public fun createDirectories ( path : Path , mustCreate : Boolean = false )","docstring":"/**\n * Creates a directory tree represented by the [path].\n * If [path] already exists then the method throws [kotlinx.io.IOException] when [mustCreate] is `true`.\n * The call will attempt to create only missing directories.\n * The method is not atomic and if it fails after creating some\n * directories, these directories will not be deleted automatically.\n * Permissions for created directories are platform-specific.\n *\n * @param path the path to be created.\n * @param mustCreate the flag indicating that existence of [path] should be treated as an error,\n * by default it is `false`.\n *\n * @throws kotlinx.io.IOException when [path] already exists and [mustCreate] is `true`.\n * @throws kotlinx.io.IOException when the creation of one of the directories fails.\n * @throws kotlinx.io.IOException when [path] is an existing file and [mustCreate] is `false`.\n */"} {"signature":"public fun atomicMove ( source : Path , destination : Path )","body":"public fun atomicMove ( source : Path , destination : Path )","docstring":"/**\n * Atomically renames [source] to [destination] overriding [destination] if it already exists.\n *\n * When the filesystem does not support atomic move of [source] and [destination] corresponds to different\n * filesystems (or different volumes, on Windows) and the operation could not be performed atomically,\n * [UnsupportedOperationException] is thrown.\n *\n * On some platforms, like Wasm-WASI, there is no way to tell if the underlying filesystem supports atomic move.\n * In such cases, the move will be performed and no [UnsupportedOperationException] will be thrown.\n *\n * When [destination] is an existing directory, the operation may fail on some platforms\n * (on Windows, particularly).\n *\n * @param source the path to rename.\n * @param destination desired path name.\n *\n * @throws kotlinx.io.files.FileNotFoundException when the [source] does not exist.\n * @throws kotlinx.io.IOException when the move failed.\n * @throws kotlin.UnsupportedOperationException when the filesystem does not support atomic move.\n */"} {"signature":"public fun source ( path : Path ) : RawSource","body":"public fun source ( path : Path ) : RawSource","docstring":"/**\n * Returns [RawSource] to read from a file the [path] points to.\n *\n * How a source will read the data is implementation-specific and failures caused\n * by the missing file or, for example, lack of permissions may not be reported immediately,\n * but postponed until the source will try to fetch data.\n *\n * If [path] points to a directory, this method will fail with [IOException].\n *\n * @param path the path to read from.\n *\n * @throws kotlinx.io.files.FileNotFoundException when the file does not exist.\n * @throws kotlinx.io.IOException when it's not possible to open the file for reading.\n */"} {"signature":"public fun sink ( path : Path , append : Boolean = false ) : RawSink","body":"public fun sink ( path : Path , append : Boolean = false ) : RawSink","docstring":"/**\n * Returns [RawSink] to write into a file the [path] points to.\n * Depending on [append] value, the file will be overwritten or data will be appened to it.\n * File will be created if it does not exist yet.\n *\n * How a sink will write the data is implementation-specific and failures caused,\n * for example, by the lack of permissions may not be reported immediately,\n * but postponed until the sink will try to store data.\n *\n * If [path] points to a directory, this method will fail with [IOException]\n *\n * @param path the path to a file to write data to.\n * @param append the flag indicating whether the data should be appended to an existing file or it\n * should be overwritten, `false` by default, meaning the file will be overwritten.\n *\n * @throws kotlinx.io.IOException when it's not possible to open the file for writing.\n */"} {"signature":"public fun metadataOrNull ( path : Path ) : FileMetadata ?","body":"public fun metadataOrNull ( path : Path ) : FileMetadata ?","docstring":"/**\n * Return [FileMetadata] associated with a file or directory the [path] points to.\n * If there is no such file or directory, or it's impossible to fetch metadata,\n * `null` is returned.\n *\n * @param path the path to get the metadata for.\n */"} {"signature":"public fun resolve ( path : Path ) : Path","body":"public fun resolve ( path : Path ) : Path","docstring":"/**\n * Returns an absolute path to the same file or directory the [path] is pointing to.\n * All symbolic links are solved, extra path separators and references to current (`.`) or\n * parent (`..`) directories are removed.\n * If the [path] is a relative path then it'll be resolved against current working directory.\n * If there is no file or directory to which the [path] is pointing to then [FileNotFoundException] will be thrown.\n *\n * @param path the path to resolve.\n * @return a resolved path.\n * @throws FileNotFoundException if there is no file or directory corresponding to the specified path.\n */"} {"signature":"fun fixInconsistentValue ( key : K , context : CONTEXT & Any , inconsistencyMessage : String , mapping : ( oldValue : V , newValue : V & Any ) -> V & Any , ) : V & Any","body":"fun fixInconsistentValue ( key : K , context : CONTEXT & Any , inconsistencyMessage : String , mapping : ( oldValue : V , newValue : V & Any ) -> V & Any , ) : V & Any","docstring":"/**\n * Drops the incorrect value from the cache and add a new value instead.\n */"} {"signature":"internal fun < KEY : Any , VALUE , CONTEXT > FirCache < KEY , VALUE , CONTEXT > . getNotNullValueForNotNullContext ( key : KEY , context : CONTEXT , ) : VALUE","body":"{ val value = getValue ( key , context ) @ Suppress ( \"\" ) return if ( value != null || context == null || this !is FirCacheWithInvalidation < KEY , VALUE , CONTEXT > ) { value } else { fixInconsistentValue ( key = key , context = context , inconsistencyMessage = \"\" , mapping = { old , new -> old ? : new } , ) } }","docstring":"/**\n * Return cached value or created a new one from [context].\n * This method assumes that we can't return null for not-null context.\n * Logs inconsistency error if it is present.\n *\n * @return not-null [VALUE] in case of [FirCacheWithInvalidation] cache.\n */"} {"signature":"fun checkUpperBoundViolated ( typeRef : FirTypeRef ? , context : CheckerContext , reporter : DiagnosticReporter , isIgnoreTypeParameters : Boolean = false )","body":"{ val type = typeRef ? . coneTypeSafe < ConeClassLikeType > ( ) ? : return checkUpperBoundViolated ( typeRef , type , context , reporter , isIgnoreTypeParameters ) }","docstring":"/**\n * Recursively analyzes type parameters and reports the diagnostic on the given source calculated using typeRef\n */"} {"signature":"fun serialize ( ) : String","body":"= buildString { serializeTo ( SchemeStringSerializationWriter ( this ) ) }","docstring":"/**\n * Produce a string serialization of the scheme. This is not necessarily readable, use\n * [toString] for debugging instead.\n */"} {"signature":"override fun equals ( other : Any ? ) : Boolean","body":"{ val o = other as? Scheme ? : return false return this . alphaRename ( ) . simpleEquals ( o . alphaRename ( ) ) }","docstring":"/**\n * Compare to [Scheme] instances for equality. Two [Scheme]s are considered equal if they are\n * [alpha equivalent][https://en.wikipedia.org/wiki/Lambda_calculus#%CE%B1-conversion]. This\n * is accomplished by normalizing both schemes and then comparing them simply for equality.\n * See [alphaRename] for details.\n */"} {"signature":"private fun alphaRename ( ) : Scheme","body":"{ if ( ( target !is Open || target . index in - .. ) && parameters . isEmpty ( ) ) return this val alphaRenameMap = mutableMapOf < Int , Int > ( ) var next = fun scan ( scheme : Scheme ) { val target = scheme . target val parameters = scheme . parameters val result = scheme . result if ( target is Open ) { val index = target . index if ( index in alphaRenameMap ) { if ( index >= && alphaRenameMap [ index ] == - ) alphaRenameMap [ index ] = next ++ } else alphaRenameMap [ index ] = - } parameters . forEach { scan ( it ) } result ? . let { scan ( it ) } } scan ( this ) if ( alphaRenameMap . isEmpty ( ) ) return this fun rename ( scheme : Scheme ) : Scheme { val target = scheme . target val parameters = scheme . parameters val result = scheme . result val newTarget = if ( target is Open && target . index != alphaRenameMap [ target . index ] ) Open ( alphaRenameMap [ target . index ] ! ! ) else target val newParameters = parameters . map { rename ( it ) } val newResult = result ? . let { rename ( it ) } return if ( target !== newTarget || newParameters . zip ( parameters ) . any { ( a , b ) -> a !== b } || newResult != result ) Scheme ( newTarget , newParameters , newResult ) else scheme } return rename ( this ) }","docstring":"/**\n * Both hashCode and equals are in terms of alpha rename equivalents. That means that the scheme\n * [0, [0]] and [2, [2]] should be treated as equal even though they have different indexes\n * because they are alpha rename equivalent. This method will rename all variables\n * consistently so that if they are alpha equivalent then they will have the same open\n * indexes in the same location. If the scheme is already alpha rename consistent then this is\n * returned.\n */"} {"signature":"fun deserializeScheme ( value : String ) : Scheme ?","body":"{ val reader = SchemeStringSerializationReader ( value ) fun item ( ) : Item = when ( reader . kind ) { ItemKind . Token -> Token ( reader . token ( ) ) ItemKind . Number -> Open ( reader . number ( ) ) else -> schemeParseError ( ) } fun < T > list ( content : ( ) -> T ) : List < T > { if ( reader . kind != ItemKind . Open ) return emptyList ( ) val result = mutableListOf < T > ( ) while ( reader . kind == ItemKind . Open ) { result . add ( content ( ) ) } return result } fun < T > delimited ( prefix : ItemKind , postfix : ItemKind , content : ( ) -> T ) = run { reader . expect ( prefix ) content ( ) . also { reader . expect ( postfix ) } } fun < T > optional ( prefix : ItemKind , postfix : ItemKind = ItemKind . Invalid , content : ( ) -> T ) : T ? = if ( reader . kind == prefix ) { delimited ( prefix , postfix , content ) } else null fun isItem ( kind : ItemKind ) : Boolean = if ( reader . kind == kind ) { reader . expect ( kind ) true } else false fun scheme ( ) : Scheme = delimited ( ItemKind . Open , ItemKind . Close ) { val target = item ( ) val anyParameters = isItem ( ItemKind . AnyParameters ) val parameters = if ( anyParameters ) emptyList ( ) else list { scheme ( ) } val result = optional ( ItemKind . ResultPrefix ) { scheme ( ) } Scheme ( target , parameters , result , anyParameters ) } return try { scheme ( ) . also { reader . end ( ) } } catch ( _ : SchemeParseError ) { null } }","docstring":"/**\n * Given a string produce a [Scheme] if the string is a valid serialization of a [Scheme] or null\n * otherwise.\n */"} {"signature":"fun jvm ( )","body":"{ }","docstring":"/**\n * Function declared in JVM source set\n *\n * also see the [Foo] class\n * @see org.kotlintestmpp.common.Foo\n */"} {"signature":"fun shared ( )","body":"{ }","docstring":"/**\n * Function declared in JVM source set\n *\n * Function with the same name exists in another source set as well.\n */"} {"signature":"fun CoroutineScope . startConnectionPipeline ( input : String ) : Job","body":"= launch { TODO ( ) }","docstring":"/**\n * Extension declared in JVM source set\n */"} {"signature":"fun String . myExtension ( )","body":"= println ( \"\" )","docstring":"/**\n * Extension declared in JVM source set\n */"} {"signature":"@ Test fun mainIsAsync ( )","body":"= runTest { ReflectionHelpers . setStaticField ( Build . VERSION :: class . java , \"\" , ) val mainLooper = shadowOf ( Looper . getMainLooper ( ) ) mainLooper . pause ( ) val mainMessageQueue = shadowOf ( Looper . getMainLooper ( ) . queue ) val job = launch ( Dispatchers . Main ) { expect ( ) } val message = mainMessageQueue . head assertTrue ( message . isAsynchronous ) job . join ( mainLooper ) }","docstring":"/**\n * Because [Dispatchers.Main] is a singleton, we cannot vary its initialization behavior. As a\n * result we only test its behavior on the newest API level and assert that it uses async\n * messages. We rely on the other tests to exercise the variance of the mechanism that the main\n * dispatcher uses to ensure it has correct behavior on all API levels.\n */"} {"signature":"public fun CoroutineScope . launch ( context : CoroutineContext = EmptyCoroutineContext , start : CoroutineStart = CoroutineStart . DEFAULT , block : suspend CoroutineScope . ( ) -> Unit ) : Job","body":"{ val newContext = newCoroutineContext ( context ) val coroutine = if ( start . isLazy ) LazyStandaloneCoroutine ( newContext , block ) else StandaloneCoroutine ( newContext , active = true ) coroutine . start ( start , coroutine , block ) return coroutine }","docstring":"/**\n * Launches a new coroutine without blocking the current thread and returns a reference to the coroutine as a [Job].\n * The coroutine is cancelled when the resulting job is [cancelled][Job.cancel].\n *\n * The coroutine context is inherited from a [CoroutineScope]. Additional context elements can be specified with [context] argument.\n * If the context does not have any dispatcher nor any other [ContinuationInterceptor], then [Dispatchers.Default] is used.\n * The parent job is inherited from a [CoroutineScope] as well, but it can also be overridden\n * with a corresponding [context] element.\n *\n * By default, the coroutine is immediately scheduled for execution.\n * Other start options can be specified via `start` parameter. See [CoroutineStart] for details.\n * An optional [start] parameter can be set to [CoroutineStart.LAZY] to start coroutine _lazily_. In this case,\n * the coroutine [Job] is created in _new_ state. It can be explicitly started with [start][Job.start] function\n * and will be started implicitly on the first invocation of [join][Job.join].\n *\n * Uncaught exceptions in this coroutine cancel the parent job in the context by default\n * (unless [CoroutineExceptionHandler] is explicitly specified), which means that when `launch` is used with\n * the context of another coroutine, then any uncaught exception leads to the cancellation of the parent coroutine.\n *\n * See [newCoroutineContext] for a description of debugging facilities that are available for a newly created coroutine.\n *\n * @param context additional to [CoroutineScope.coroutineContext] context of the coroutine.\n * @param start coroutine start option. The default value is [CoroutineStart.DEFAULT].\n * @param block the coroutine code which will be invoked in the context of the provided scope.\n **/"} {"signature":"public fun < T > CoroutineScope . async ( context : CoroutineContext = EmptyCoroutineContext , start : CoroutineStart = CoroutineStart . DEFAULT , block : suspend CoroutineScope . ( ) -> T ) : Deferred < T >","body":"{ val newContext = newCoroutineContext ( context ) val coroutine = if ( start . isLazy ) LazyDeferredCoroutine ( newContext , block ) else DeferredCoroutine < T > ( newContext , active = true ) coroutine . start ( start , coroutine , block ) return coroutine }","docstring":"/**\n * Creates a coroutine and returns its future result as an implementation of [Deferred].\n * The running coroutine is cancelled when the resulting deferred is [cancelled][Job.cancel].\n * The resulting coroutine has a key difference compared with similar primitives in other languages\n * and frameworks: it cancels the parent job (or outer scope) on failure to enforce *structured concurrency* paradigm.\n * To change that behaviour, supervising parent ([SupervisorJob] or [supervisorScope]) can be used.\n *\n * Coroutine context is inherited from a [CoroutineScope], additional context elements can be specified with [context] argument.\n * If the context does not have any dispatcher nor any other [ContinuationInterceptor], then [Dispatchers.Default] is used.\n * The parent job is inherited from a [CoroutineScope] as well, but it can also be overridden\n * with corresponding [context] element.\n *\n * By default, the coroutine is immediately scheduled for execution.\n * Other options can be specified via `start` parameter. See [CoroutineStart] for details.\n * An optional [start] parameter can be set to [CoroutineStart.LAZY] to start coroutine _lazily_. In this case,\n * the resulting [Deferred] is created in _new_ state. It can be explicitly started with [start][Job.start]\n * function and will be started implicitly on the first invocation of [join][Job.join], [await][Deferred.await] or [awaitAll].\n *\n * @param block the coroutine code.\n */"} {"signature":"public suspend fun < T > withContext ( context : CoroutineContext , block : suspend CoroutineScope . ( ) -> T ) : T","body":"{ contract { callsInPlace ( block , InvocationKind . EXACTLY_ONCE ) } return suspendCoroutineUninterceptedOrReturn sc @ { uCont -> val oldContext = uCont . context val newContext = oldContext . newCoroutineContext ( context ) newContext . ensureActive ( ) if ( newContext === oldContext ) { val coroutine = ScopeCoroutine ( newContext , uCont ) return@sc coroutine . startUndispatchedOrReturn ( coroutine , block ) } if ( newContext [ ContinuationInterceptor ] == oldContext [ ContinuationInterceptor ] ) { val coroutine = UndispatchedCoroutine ( newContext , uCont ) withCoroutineContext ( coroutine . context , null ) { return@sc coroutine . startUndispatchedOrReturn ( coroutine , block ) } } val coroutine = DispatchedCoroutine ( newContext , uCont ) block . startCoroutineCancellable ( coroutine , coroutine ) coroutine . getResult ( ) } }","docstring":"/**\n * Calls the specified suspending block with a given coroutine context, suspends until it completes, and returns\n * the result.\n *\n * The resulting context for the [block] is derived by merging the current [coroutineContext] with the\n * specified [context] using `coroutineContext + context` (see [CoroutineContext.plus]).\n * This suspending function is cancellable. It immediately checks for cancellation of\n * the resulting context and throws [CancellationException] if it is not [active][CoroutineContext.isActive].\n *\n * Calls to [withContext] whose [context] argument provides a [CoroutineDispatcher] that is\n * different from the current one, by necessity, perform additional dispatches: the [block]\n * can not be executed immediately and needs to be dispatched for execution on\n * the passed [CoroutineDispatcher], and then when the [block] completes, the execution\n * has to shift back to the original dispatcher.\n *\n * Note that the result of `withContext` invocation is dispatched into the original context in a cancellable way\n * with a **prompt cancellation guarantee**, which means that if the original [coroutineContext]\n * in which `withContext` was invoked is cancelled by the time its dispatcher starts to execute the code,\n * it discards the result of `withContext` and throws [CancellationException].\n *\n * The cancellation behaviour described above is enabled if and only if the dispatcher is being changed.\n * For example, when using `withContext(NonCancellable) { ... }` there is no change in dispatcher and\n * this call will not be cancelled neither on entry to the block inside `withContext` nor on exit from it.\n */"} {"signature":"public suspend inline operator fun < T > CoroutineDispatcher . invoke ( noinline block : suspend CoroutineScope . ( ) -> T ) : T","body":"= withContext ( this , block )","docstring":"/**\n * Calls the specified suspending block with the given [CoroutineDispatcher], suspends until it\n * completes, and returns the result.\n *\n * This inline function calls [withContext].\n */"} {"signature":"fun FirBasedSymbol < * > . getOwnDeprecation ( session : FirSession , callSite : FirElement ? ) : DeprecationInfo ?","body":"{ return getOwnDeprecationForCallSite ( session , * getUseSitesForCallSite ( callSite ) ) }","docstring":"/**\n * Returns deprecation that is declared on the\n * corresponding declaration.\n */"} {"signature":"fun FirBasedSymbol < * > . getDeprecation ( session : FirSession , callSite : FirElement ? ) : DeprecationInfo ?","body":"{ return getDeprecationForCallSite ( session , * getUseSitesForCallSite ( callSite ) ) }","docstring":"/**\n * Returns deprecation that is declared on\n * the corresponding declaration directly\n * or, in case of a typealias, on any of\n * its expansions.\n */"} {"signature":"private fun FirBasedSymbol < * > . getOwnDeprecationForCallSite ( session : FirSession , vararg sites : AnnotationUseSiteTarget ) : DeprecationInfo ?","body":"{ val deprecations = when ( this ) { is FirCallableSymbol < * > -> getDeprecation ( session ) is FirClassLikeSymbol < * > -> getOwnDeprecation ( session ) else -> null } return ( deprecations ? : EmptyDeprecationsPerUseSite ) . forUseSite ( * sites ) }","docstring":"/**\n * Returns deprecation that is declared on the\n * corresponding declaration.\n */"} {"signature":"fun FirBasedSymbol < * > . getDeprecationForCallSite ( session : FirSession , vararg sites : AnnotationUseSiteTarget , ) : DeprecationInfo ?","body":"{ return when ( this ) { !is FirTypeAliasSymbol -> getOwnDeprecationForCallSite ( session , * sites ) else -> { var worstDeprecationInfo = getOwnDeprecationForCallSite ( session , * sites ) val visited = mutableMapOf < ConeKotlinType , DeprecationInfo ? > ( ) resolvedExpandedTypeRef . type . forEachType { val deprecationInfo = visited . getOrPut ( it ) { val symbol = it . toSymbol ( session ) ? : return@forEachType symbol . getDeprecationForCallSite ( session , * sites ) } ? : return@forEachType val currentWorstDeprecation = worstDeprecationInfo if ( currentWorstDeprecation == null || deprecationInfo > currentWorstDeprecation ) { worstDeprecationInfo = deprecationInfo } } worstDeprecationInfo } } }","docstring":"/**\n * Returns deprecation that is declared on\n * the corresponding declaration directly\n * or, in case of a typealias, on any of\n * its expansions.\n */"} {"signature":"fun FirCallableSymbol < * > . hiddenStatusOfCall ( isSuperCall : Boolean , isCallToOverride : Boolean ) : CallToPotentiallyHiddenSymbolResult","body":"{ val fir = fir if ( fir . isHiddenToOvercomeSignatureClash == true ) { return CallToPotentiallyHiddenSymbolResult . Hidden } val status = fir . hiddenEverywhereBesideSuperCallsStatus ? : return CallToPotentiallyHiddenSymbolResult . Visible return when ( status ) { HiddenEverywhereBesideSuperCallsStatus . HIDDEN -> if ( isSuperCall ) CallToPotentiallyHiddenSymbolResult . Visible else CallToPotentiallyHiddenSymbolResult . Hidden HiddenEverywhereBesideSuperCallsStatus . HIDDEN_IN_DECLARING_CLASS_ONLY -> if ( isSuperCall || isCallToOverride ) CallToPotentiallyHiddenSymbolResult . VisibleWithDeprecation else CallToPotentiallyHiddenSymbolResult . Hidden HiddenEverywhereBesideSuperCallsStatus . HIDDEN_FAKE -> if ( isCallToOverride ) CallToPotentiallyHiddenSymbolResult . VisibleWithDeprecation else CallToPotentiallyHiddenSymbolResult . Hidden } }","docstring":"/**\n * To check whether a symbol is visible and if it's deprecated, the method needs to be called for the symbol and all its\n * overridden symbols.\n * [isSuperCall] must be set to `true` when the receiver is `super`.\n * [isCallToOverride] must be set to `false` for the original symbol and to `true` for all its overridden symbols.\n *\n * Given the following hierarchy\n *\n * ```\n * public class A {\n * public String getX() { return \"\"; } // HIDDEN\n * public String getY() { return \"\"; } // HIDDEN_IN_DECLARING_CLASS_ONLY\n * public String getZ() { return \"\"; } // HIDDEN_FAKE\n * }\n *\n * class B extends A {\n * @Override public String getX() { return super.getX(); }\n * @Override public String getY() { return super.getY(); }\n * @Override public String getZ() { return super.getZ(); }\n * }\n * ```\n *\n * the results will be as follows\n *\n * | Receiver \\ Symbol | getX | getY | getZ |\n * |-------------------|---------|------------------------|------------------------|\n * | A | Hidden | Hidden | Hidden |\n * | super | Visible | VisibleWithDeprecation | Hidden |\n * | B | Hidden | VisibleWithDeprecation | VisibleWithDeprecation |\n *\n */"} {"signature":"override fun getCompilerPluginId ( )","body":"= \"\"","docstring":"/** Get ID of the Kotlin Compiler plugin */"} {"signature":"fun getResolutionFacadeWithForcedPlatform ( elements : List < KtElement > , platform : TargetPlatform ) : ResolutionFacade","body":"fun getResolutionFacadeWithForcedPlatform ( elements : List < KtElement > , platform : TargetPlatform ) : ResolutionFacade","docstring":"/**\n * Provides resolution facade for [elements], guaranteeing that the resolution will be seen from the [platform]-perspective.\n *\n * This allows to get resolution for common sources in MPP from the perspective of given platform (with expects substituted to actuals,\n * declarations resolved from platform-specific artifacts, ModuleDescriptors will contain only platform dependencies, etc.)\n *\n * It is equivalent to usual [getResolutionFacade]-overloads if platform(s) of module(s) containing [elements] are equal to [platform]\n *\n * Doesn't support scripts or any other 'special' files.\n */"} {"signature":"public fun fuse ( context : CoroutineContext = EmptyCoroutineContext , capacity : Int = Channel . OPTIONAL_CHANNEL , onBufferOverflow : BufferOverflow = BufferOverflow . SUSPEND ) : Flow < T >","body":"public fun fuse ( context : CoroutineContext = EmptyCoroutineContext , capacity : Int = Channel . OPTIONAL_CHANNEL , onBufferOverflow : BufferOverflow = BufferOverflow . SUSPEND ) : Flow < T >","docstring":"/**\n * This function is called by [flowOn] (with context) and [buffer] (with capacity) operators\n * that are applied to this flow. Should not be used with [capacity] of [Channel.CONFLATED]\n * (it shall be desugared to `capacity = 0, onBufferOverflow = DROP_OLDEST`).\n */"} {"signature":"public open fun dropChannelOperators ( ) : Flow < T > ?","body":"= null","docstring":"/**\n * When this [ChannelFlow] implementation can work without a channel (supports [Channel.OPTIONAL_CHANNEL]),\n * then it should return a non-null value from this function, so that a caller can use it without the effect of\n * additional [flowOn] and [buffer] operators, by incorporating its\n * [context], [capacity], and [onBufferOverflow] into its own implementation.\n */"} {"signature":"public open fun produceImpl ( scope : CoroutineScope ) : ReceiveChannel < T >","body":"= scope . produce ( context , produceCapacity , onBufferOverflow , start = CoroutineStart . ATOMIC , block = collectToFun )","docstring":"/**\n * Here we use ATOMIC start for a reason (#1825).\n * NB: [produceImpl] is used for [flowOn].\n * For non-atomic start it is possible to observe the situation,\n * where the pipeline after the [flowOn] call successfully executes (mostly, its `onCompletion`)\n * handlers, while the pipeline before does not, because it was cancelled during its dispatch.\n * Thus `onCompletion` and `finally` blocks won't be executed and it may lead to a different kinds of memory leaks.\n */"} {"signature":"fun denseNet121Prediction ( )","body":"{ val modelHub = TFModelHub ( cacheDirectory = File ( \"\" ) ) val modelType = TFModels . CV . DenseNet121 ( ) val model = modelHub . loadModel ( modelType ) val imageNetClassLabels = Imagenet . V1k . labels ( ) model . use { it . compile ( optimizer = Adam ( ) , loss = Losses . MAE , metric = Metrics . ACCURACY ) it . logSummary ( ) val hdfFile = modelHub . loadWeights ( modelType ) val weightPaths = listOf ( LayerConvOrDensePaths ( \"\" , \"\" , \"\" ) , LayerBatchNormPaths ( \"\" , \"\" , \"\" , \"\" , \"\" ) ) recursivePrintGroupInHDF5File ( hdfFile , hdfFile ) it . loadWeightsByPaths ( hdfFile , weightPaths , missedWeights = MissedWeightsStrategy . LOAD_CUSTOM_PATH ) val fileDataLoader = modelType . createPreprocessing ( model ) . fileLoader ( ) for ( i in .. ) { val inputData = fileDataLoader . load ( getFileFromResource ( \"\" ) ) val res = it . predictLabel ( inputData ) println ( \"\" ) val top5 = it . predictTop5Labels ( inputData , imageNetClassLabels ) println ( top5 . toString ( ) ) } } }","docstring":"/**\n * This example demonstrates the inference concept on DenseNet121 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 DenseNet121 during training on ImageNet dataset) is applied to the images before prediction.\n *\n * NOTE: Input resolution is 224*224\n */"} {"signature":"fun main ( ) : Unit","body":"= denseNet121Prediction ( )","docstring":"/** */"} {"signature":"@ Suppress ( \"\" ) @ kotlin . internal . InlineOnly public actual inline fun < T > ( suspend ( ) -> T ) . startCoroutineUninterceptedOrReturn ( completion : Continuation < T > ) : Any ?","body":"= startCoroutineUninterceptedOrReturnIntrinsic0 ( this , if ( this !is CoroutineImpl ) createSimpleCoroutineFromSuspendFunction ( completion ) else completion )","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":"@ Suppress ( \"\" ) @ kotlin . internal . InlineOnly public actual inline fun < R , T > ( suspend R . ( ) -> T ) . startCoroutineUninterceptedOrReturn ( receiver : R , completion : Continuation < T > ) : Any ?","body":"= startCoroutineUninterceptedOrReturnIntrinsic1 ( this , receiver , if ( this !is CoroutineImpl ) createSimpleCoroutineFromSuspendFunction ( completion ) else completion )","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":"@ Suppress ( \"\" ) public actual fun < T > ( suspend ( ) -> T ) . createCoroutineUnintercepted ( completion : Continuation < T > ) : Continuation < Unit >","body":"{ return createCoroutineFromSuspendFunction ( completion ) { this . startCoroutineUninterceptedOrReturn ( completion ) } }","docstring":"/**\n * Creates unintercepted coroutine without receiver and with result type [T].\n * This function creates a new, fresh instance of suspendable computation every time it is invoked.\n *\n * To start executing the created coroutine, invoke `resume(Unit)` on the returned [Continuation] instance.\n * The [completion] continuation is invoked when coroutine completes with result or exception.\n *\n * This function returns unintercepted continuation.\n * Invocation of `resume(Unit)` starts coroutine immediately in the invoker's call stack without going through the\n * [ContinuationInterceptor] that might be present in the completion's [CoroutineContext].\n * It is the invoker's responsibility to ensure that a proper invocation context is established.\n * Note that [completion] of this function may get invoked in an arbitrary context.\n *\n * [Continuation.intercepted] can be used to acquire the intercepted continuation.\n * Invocation of `resume(Unit)` on intercepted continuation guarantees that execution of\n * both the coroutine and [completion] happens in the invocation context established by\n * [ContinuationInterceptor].\n *\n * Repeated invocation of any resume function on the resulting continuation corrupts the\n * state machine of the coroutine and may result in arbitrary behaviour or exception.\n */"} {"signature":"@ Suppress ( \"\" ) public actual fun < R , T > ( suspend R . ( ) -> T ) . createCoroutineUnintercepted ( receiver : R , completion : Continuation < T > ) : Continuation < Unit >","body":"{ return createCoroutineFromSuspendFunction ( completion ) { this . startCoroutineUninterceptedOrReturn ( receiver , completion ) } }","docstring":"/**\n * Creates unintercepted coroutine with receiver type [R] and result type [T].\n * This function creates a new, fresh instance of suspendable computation every time it is invoked.\n *\n * To start executing the created coroutine, invoke `resume(Unit)` on the returned [Continuation] instance.\n * The [completion] continuation is invoked when coroutine completes with result or exception.\n *\n * This function returns unintercepted continuation.\n * Invocation of `resume(Unit)` starts coroutine immediately in the invoker's call stack without going through the\n * [ContinuationInterceptor] that might be present in the completion's [CoroutineContext].\n * It is the invoker's responsibility to ensure that a proper invocation context is established.\n * Note that [completion] of this function may get invoked in an arbitrary context.\n *\n * [Continuation.intercepted] can be used to acquire the intercepted continuation.\n * Invocation of `resume(Unit)` on intercepted continuation guarantees that execution of\n * both the coroutine and [completion] happens in the invocation context established by\n * [ContinuationInterceptor].\n *\n * Repeated invocation of any resume function on the resulting continuation corrupts the\n * state machine of the coroutine and may result in arbitrary behaviour or exception.\n */"} {"signature":"public actual fun < T > Continuation < T > . intercepted ( ) : Continuation < T >","body":"= ( this as? CoroutineImpl ) ? . intercepted ( ) ? : this","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":"fun nativeCacheKindForTarget ( target : KonanTarget ) : NativeCacheKind ?","body":"= property ( \"\" ) . orNull ? . let { NativeCacheKind . byCompilerArgument ( it ) }","docstring":"/**\n * Dependencies caching strategy for [target].\n */"} {"signature":"fun jsKarmaBrowsers ( target : KotlinTarget ? = null ) : String ?","body":"= target ? . name ? . prefixIfNot ( \"\" ) ? . let { property ( it ) . orNull } ? : property ( KOTLIN_JS_KARMA_BROWSERS ) . orNull","docstring":"/**\n * Retrieves a comma-separated list of browsers to use when running karma tests for [target]\n * @see KOTLIN_JS_KARMA_BROWSERS\n */"} {"signature":"public fun Multik . ndarray ( args : Array < ByteArray > ) : D2Array < Byte >","body":"{ val dim0 = args . size val dim1 = args [ ] . size require ( args . all { dim1 == it . size } ) { \"\" } val array = ByteArray ( dim0 * dim1 ) var index = for ( i in until dim0 ) { for ( j in until dim1 ) { array [ index ++ ] = args [ i ] [ j ] } } val data = MemoryViewByteArray ( array ) return D2Array ( data , shape = intArrayOf ( dim0 , dim1 ) , dim = D2 ) }","docstring":"/**\n * Returns an D2Array from Array.\n */"} {"signature":"public fun Multik . ndarray ( args : Array < ShortArray > ) : D2Array < Short >","body":"{ val dim0 = args . size val dim1 = args [ ] . size require ( args . all { dim1 == it . size } ) { \"\" } val array = ShortArray ( dim0 * dim1 ) var index = for ( i in until dim0 ) { for ( j in until dim1 ) { array [ index ++ ] = args [ i ] [ j ] } } val data = MemoryViewShortArray ( array ) return D2Array ( data , shape = intArrayOf ( dim0 , dim1 ) , dim = D2 ) }","docstring":"/**\n * Returns an D2Array from Array.\n */"} {"signature":"public fun Multik . ndarray ( args : Array < IntArray > ) : D2Array < Int >","body":"{ val dim0 = args . size val dim1 = args [ ] . size require ( args . all { dim1 == it . size } ) { \"\" } val array = IntArray ( dim0 * dim1 ) var index = for ( i in until dim0 ) { for ( j in until dim1 ) { array [ index ++ ] = args [ i ] [ j ] } } val data = MemoryViewIntArray ( array ) return D2Array ( data , shape = intArrayOf ( dim0 , dim1 ) , dim = D2 ) }","docstring":"/**\n * Returns an D2Array from Array.\n */"} {"signature":"public fun Multik . ndarray ( args : Array < LongArray > ) : D2Array < Long >","body":"{ val dim0 = args . size val dim1 = args [ ] . size require ( args . all { dim1 == it . size } ) { \"\" } val array = LongArray ( dim0 * dim1 ) var index = for ( i in until dim0 ) { for ( j in until dim1 ) { array [ index ++ ] = args [ i ] [ j ] } } val data = MemoryViewLongArray ( array ) return D2Array ( data , shape = intArrayOf ( dim0 , dim1 ) , dim = D2 ) }","docstring":"/**\n * Returns an D2Array from Array.\n */"} {"signature":"public fun Multik . ndarray ( args : Array < FloatArray > ) : D2Array < Float >","body":"{ val dim0 = args . size val dim1 = args [ ] . size require ( args . all { dim1 == it . size } ) { \"\" } val array = FloatArray ( dim0 * dim1 ) var index = for ( i in until dim0 ) { for ( j in until dim1 ) { array [ index ++ ] = args [ i ] [ j ] } } val data = MemoryViewFloatArray ( array ) return D2Array ( data , shape = intArrayOf ( dim0 , dim1 ) , dim = D2 ) }","docstring":"/**\n * Returns an D2Array from Array.\n */"} {"signature":"public fun Multik . ndarray ( args : Array < DoubleArray > ) : D2Array < Double >","body":"{ val dim0 = args . size val dim1 = args [ ] . size require ( args . all { dim1 == it . size } ) { \"\" } val array = DoubleArray ( dim0 * dim1 ) var index = for ( i in until dim0 ) { for ( j in until dim1 ) { array [ index ++ ] = args [ i ] [ j ] } } val data = MemoryViewDoubleArray ( array ) return D2Array ( data , shape = intArrayOf ( dim0 , dim1 ) , dim = D2 ) }","docstring":"/**\n * Returns an D2Array from Array.\n */"} {"signature":"public fun Array < ByteArray > . toNDArray ( ) : D2Array < Byte >","body":"= Multik . ndarray ( this )","docstring":"/**\n * Returns an D2Array.\n */"} {"signature":"public fun Array < ShortArray > . toNDArray ( ) : D2Array < Short >","body":"= Multik . ndarray ( this )","docstring":"/**\n * Returns an D2Array.\n */"} {"signature":"public fun Array < IntArray > . toNDArray ( ) : D2Array < Int >","body":"= Multik . ndarray ( this )","docstring":"/**\n * Returns an D2Array.\n */"} {"signature":"public fun Array < LongArray > . toNDArray ( ) : D2Array < Long >","body":"= Multik . ndarray ( this )","docstring":"/**\n * Returns an D2Array.\n */"} {"signature":"public fun Array < FloatArray > . toNDArray ( ) : D2Array < Float >","body":"= Multik . ndarray ( this )","docstring":"/**\n * Returns an D2Array.\n */"} {"signature":"public fun Array < DoubleArray > . toNDArray ( ) : D2Array < Double >","body":"= Multik . ndarray ( this )","docstring":"/**\n * Returns an D2Array.\n */"} {"signature":"public fun < T > List < T > . asReversed ( ) : List < T >","body":"= ReversedListReadOnly ( this )","docstring":"/**\n * Returns a reversed read-only view of the original List.\n * All changes made in the original list will be reflected in the reversed one.\n * @sample samples.collections.ReversedViews.asReversedList\n */"} {"signature":"@ kotlin . jvm . JvmName ( \"\" ) public fun < T > MutableList < T > . asReversed ( ) : MutableList < T >","body":"= ReversedList ( this )","docstring":"/**\n * Returns a reversed mutable view of the original mutable List.\n * All changes made in the original list will be reflected in the reversed one and vice versa.\n * @sample samples.collections.ReversedViews.asReversedMutableList\n */"} {"signature":"fun getCustomKotlinRepositoryURL ( project : Project ) : String ?","body":"{ val communityPluginKotlinRepoURL = project . findProperty ( \"\" ) as? String val gradlePropertyKotlinRepoURL = project . findProperty ( \"\" ) as? String val kotlinRepoURL = when { communityPluginKotlinRepoURL != null -> communityPluginKotlinRepoURL gradlePropertyKotlinRepoURL != null -> gradlePropertyKotlinRepoURL else -> return null } LOGGER . info ( \"\" ) return kotlinRepoURL }","docstring":"/**\n * Should be used for running against a non-released Kotlin compiler on a system test level.\n *\n * @return a custom repository with development builds of the Kotlin compiler taken from:\n *\n * 1. the Kotlin community project Gradle plugin,\n * 2. or `kotlin_repo_url` Gradle property (from command line or from `gradle.properties`),\n *\n * or null otherwise\n */"} {"signature":"fun addCustomKotlinRepositoryIfEnabled ( repositoryHandler : RepositoryHandler , project : Project )","body":"{ val kotlinRepoURL = getCustomKotlinRepositoryURL ( project ) ? : return repositoryHandler . maven { url = URI . create ( kotlinRepoURL ) } }","docstring":"/**\n * Should be used for running against a non-released Kotlin compiler on a system test level.\n *\n * Adds a custom repository with development builds of the Kotlin compiler to [repositoryHandler]\n * if the URL is provided (see [getCustomKotlinRepositoryURL]).\n */"} {"signature":"fun getOverridingKotlinVersion ( project : Project ) : String ?","body":"{ val communityPluginKotlinVersion = project . findProperty ( \"\" ) as? String val kotlinVersion = when { communityPluginKotlinVersion != null -> communityPluginKotlinVersion else -> return null } LOGGER . info ( \"\" ) return kotlinVersion }","docstring":"/**\n * Should be used for running against a non-released Kotlin compiler on a system test level.\n *\n * @return a Kotlin version taken from the Kotlin community project Gradle plugin,\n * or null otherwise\n */"} {"signature":"fun getOverridingKotlinLanguageVersion ( project : Project ) : String ?","body":"{ val communityPluginLanguageVersion = project . findProperty ( \"\" ) as? String val gradlePropertyLanguageVersion = project . findProperty ( \"\" ) as? String val languageVersion = when { communityPluginLanguageVersion != null -> communityPluginLanguageVersion gradlePropertyLanguageVersion != null -> gradlePropertyLanguageVersion else -> return null } LOGGER . info ( \"\" ) return languageVersion }","docstring":"/**\n * Should be used for running against a non-released Kotlin compiler on a system test level.\n *\n * @return a Kotlin language version taken from:\n *\n * 1. the Kotlin community project Gradle plugin,\n * 2. or `kotlin_language_version` Gradle property (from command line or from `gradle.properties`),\n *\n * or null otherwise\n */"} {"signature":"fun getOverridingKotlinApiVersion ( project : Project ) : String ?","body":"{ val communityPluginApiVersion = project . findProperty ( \"\" ) as? String val gradlePropertyApiVersion = project . findProperty ( \"\" ) as? String val apiVersion = when { communityPluginApiVersion != null -> communityPluginApiVersion gradlePropertyApiVersion != null -> gradlePropertyApiVersion else -> return null } LOGGER . info ( \"\" ) return apiVersion }","docstring":"/**\n * Should be used for running against a non-released Kotlin compiler on a system test level.\n *\n * @return a Kotlin API version taken from:\n *\n * 1. the Kotlin community project Gradle plugin,\n * 2. or `kotlin_language_version` Gradle property (from command line or from `gradle.properties`),\n *\n * or null otherwise\n */"} {"signature":"@ JvmName ( \"\" ) fun com . google . protobuf . kotlin . DslMap < kotlin . String , kotlin . String , AttributesProxy > . put ( key : kotlin . String , value : kotlin . String )","body":"{ _builder . putAttributes ( key , value ) }","docstring":"/**\n * map<string, string> attributes = 1;\n */"} {"signature":"@ kotlin . jvm . JvmSynthetic @ JvmName ( \"\" ) @ Suppress ( \"\" ) inline operator fun com . google . protobuf . kotlin . DslMap < kotlin . String , kotlin . String , AttributesProxy > . set ( key : kotlin . String , value : kotlin . String )","body":"{ put ( key , value ) }","docstring":"/**\n * map<string, string> attributes = 1;\n */"} {"signature":"@ kotlin . jvm . JvmSynthetic @ JvmName ( \"\" ) fun com . google . protobuf . kotlin . DslMap < kotlin . String , kotlin . String , AttributesProxy > . remove ( key : kotlin . String )","body":"{ _builder . removeAttributes ( key ) }","docstring":"/**\n * map<string, string> attributes = 1;\n */"} {"signature":"@ kotlin . jvm . JvmSynthetic @ JvmName ( \"\" ) fun com . google . protobuf . kotlin . DslMap < kotlin . String , kotlin . String , AttributesProxy > . putAll ( map : kotlin . collections . Map < kotlin . String , kotlin . String > )","body":"{ _builder . putAllAttributes ( map ) }","docstring":"/**\n * map<string, string> attributes = 1;\n */"} {"signature":"@ kotlin . jvm . JvmSynthetic @ JvmName ( \"\" ) fun com . google . protobuf . kotlin . DslMap < kotlin . String , kotlin . String , AttributesProxy > . clear ( )","body":"{ _builder . clearAttributes ( ) }","docstring":"/**\n * map<string, string> attributes = 1;\n */"} {"signature":"public abstract fun getDirectDependents ( module : KtModule ) : Set < KtModule >","body":"public abstract fun getDirectDependents ( module : KtModule ) : Set < KtModule >","docstring":"/**\n * Returns all direct dependents of [module], excluding [module] if it depends on itself.\n */"} {"signature":"public abstract fun getTransitiveDependents ( module : KtModule ) : Set < KtModule >","body":"public abstract fun getTransitiveDependents ( module : KtModule ) : Set < KtModule >","docstring":"/**\n * Returns all direct and indirect dependents of [module], excluding [module] if it depends on itself.\n */"} {"signature":"public abstract fun getRefinementDependents ( module : KtModule ) : Set < KtModule >","body":"public abstract fun getRefinementDependents ( module : KtModule ) : Set < KtModule >","docstring":"/**\n * Returns all refinement/depends-on dependents of [module], excluding [module] itself. The result is transitive because refinement\n * dependencies are implicitly transitive.\n */"} {"signature":"fun getAsMap ( ) : Map < KtTypeParameterSymbol , KtType >","body":"fun getAsMap ( ) : Map < KtTypeParameterSymbol , KtType >","docstring":"/**\n * Substitution rules in a form of a `Map`\n */"} {"signature":"public fun onModification ( )","body":"public fun onModification ( )","docstring":"/**\n * [onModification] is invoked in a write action before or after global out-of-block modification of all sources.\n *\n * The source code of all source [KtModule]s in the project should be considered modified when this event is received. This includes\n * source files being moved or removed. Thus, all caches related to source code and source files should be invalidated.\n *\n * Library modules (including library sources) do not need to be considered modified, so any caches related to library modules and their\n * contents may be kept.\n *\n * @see KotlinTopics\n */"} {"signature":"fun < S > GroupState < S > . getOrNull ( ) : S ?","body":"= if ( exists ( ) ) get ( ) else null","docstring":"/**\n * (Kotlin-specific)\n * Returns the group state value if it exists, else `null`.\n * This is comparable to [GroupState.getOption], but instead utilises Kotlin's nullability features\n * to get the same result.\n */"} {"signature":"operator fun < S > GroupState < S > . getValue ( thisRef : Any ? , property : KProperty < * > ) : S ?","body":"= getOrNull ( )","docstring":"/**\n * (Kotlin-specific)\n * Allows the group state object to be used as a delegate. Will be `null` if it does not exist.\n *\n * For example:\n * ```kotlin\n * groupedDataset.mapGroupsWithState(GroupStateTimeout.NoTimeout()) { key, values, state: GroupState ->\n * var s by state\n * ...\n * }\n * ```\n */"} {"signature":"operator fun < S > GroupState < S > . setValue ( thisRef : Any ? , property : KProperty < * > , value : S ? ) : Unit","body":"= update ( value )","docstring":"/**\n * (Kotlin-specific)\n * Allows the group state object to be used as a delegate. Will be `null` if it does not exist.\n *\n * For example:\n * ```kotlin\n * groupedDataset.mapGroupsWithState(GroupStateTimeout.NoTimeout()) { key, values, state: GroupState ->\n * var s by state\n * ...\n * }\n * ```\n */"} {"signature":"public fun resolve ( context : ColumnResolutionContext ) : List < ColumnWithPath < C > >","body":"public fun resolve ( context : ColumnResolutionContext ) : List < ColumnWithPath < C > >","docstring":"/**\n * Resolves this [ColumnsResolver] as a [List]<[ColumnWithPath]<[C]>>.\n * In many cases this function [transforms][ColumnsResolver.transform] a parent [ColumnsResolver] to reach\n * the current [ColumnsResolver] result.\n */"} {"signature":"fun testFailed ( reportTaskPath : String , testTaskPath : String )","body":"{ reportHasFailedTests [ reportTaskPath ] = true previouslyFailedTestTasks . add ( testTaskPath ) }","docstring":"/**\n * Marks [KotlinTestReport] with [reportTaskPath] as a report containing failed tests during the build.\n * [testTaskPath] is a path of the actual test task with failed tests.\n */"} {"signature":"fun hasFailedTests ( path : String ) : Boolean","body":"{ return reportHasFailedTests [ path ] ? : false }","docstring":"/**\n * Checks whether [KotlinTestReport] defined by [path] contains any children test tasks that failed during the build\n */"} {"signature":"fun reportFailure ( failedTaskPath : String , parentTaskPath : String , failure : Error )","body":"{ testTaskSuppressedFailures . computeIfAbsent ( parentTaskPath ) { mutableListOf ( ) } . add ( failedTaskPath to failure ) }","docstring":"/**\n * Reports a test task execution failure (not test failure).\n * @param failedTaskPath is a path of the failed test task\n * @param parentTaskPath is a path of a [KotlinTestReport] that the task reports to\n */"} {"signature":"fun getAggregatedTaskFailures ( taskPath : String ) : List < TaskError >","body":"{ return testTaskSuppressedFailures [ taskPath ] ? : emptyList ( ) }","docstring":"/**\n * Returns all the test task execution failures (not test failures) related to the [KotlinTestReport] defined by [taskPath]\n */"} {"signature":"fun hasTestTaskFailedPreviously ( path : String )","body":"= previouslyFailedTestTasks . remove ( path )","docstring":"/**\n * Checks whether the test task defined by [path] had failed previously (doesn't matter if it's caused by failed test or any runtime problem).\n * This function is not idempotent as it resets the task's failed state.\n */"} {"signature":"public fun ContextView . asCoroutineContext ( ) : ReactorContext","body":"= ReactorContext ( this )","docstring":"/**\n * Wraps the given [ContextView] into [ReactorContext], so it can be added to the coroutine's context\n * and later used via `coroutineContext[ReactorContext]`.\n */"} {"signature":"@ Deprecated ( \"\" , level = DeprecationLevel . HIDDEN ) public fun Context . asCoroutineContext ( ) : ReactorContext","body":"= readOnly ( ) . asCoroutineContext ( )","docstring":"/** @suppress */"} {"signature":"internal fun CoroutineContext . extendReactorContext ( extensions : ContextView ) : CoroutineContext","body":"= ( this [ ReactorContext ] ? . context ? . putAll ( extensions ) ? : extensions ) . asCoroutineContext ( )","docstring":"/**\n * Updates the Reactor context in this [CoroutineContext], adding (or possibly replacing) some values.\n */"} {"signature":"public fun TestBase . withVirtualTime ( block : suspend CoroutineScope . ( ) -> Unit )","body":"= runTest { withContext ( Dispatchers . Unconfined ) { val dispatcher = VirtualTimeDispatcher ( this ) withContext ( dispatcher ) { block ( ) } checkFinishCall ( allowNotUsingExpect = false ) } }","docstring":"/**\n * Runs a test ([TestBase.runTest]) with a virtual time source.\n * This runner has the following constraints:\n * 1) It works only in the event-loop environment and it is relying on it.\n * None of the coroutines should be launched in any dispatcher different from a current\n * 2) Regular tasks always dominate delayed ones. It means that\n * `launch { while(true) yield() }` will block the progress of the delayed tasks\n * 3) [TestBase.finish] should always be invoked.\n * Given all the constraints into account, it is easy to mess up with a test and actually\n * return from [withVirtualTime] before the test is executed completely.\n * To decrease the probability of such error, additional `finish` constraint is added.\n */"} {"signature":"override fun FirDeclaration . isPlatformSpecificExported ( ) : Boolean","body":"{ if ( this is FirCallableDeclaration && isSubstitutionOrIntersectionOverride ) return false return ANNOTATIONS_TO_TREAT_AS_EXPORTED . any { hasAnnotation ( it , moduleData . session ) } }","docstring":"/**\n * mimics AbstractKonanDescriptorMangler::DeclarationDescriptor.isPlatformSpecificExport()\n */"} {"signature":"internal fun findMacros ( nativeIndex : NativeIndexImpl , compilation : CompilationWithPCH , translationUnits : List < CXTranslationUnit > , headers : Set < CXFile ? > )","body":"{ val names = collectMacroNames ( nativeIndex , translationUnits , headers ) val macros = expandMacros ( compilation , names , typeConverter = { nativeIndex . convertType ( it ) } ) macros . filterIsInstanceTo ( nativeIndex . macroConstants ) macros . filterIsInstanceTo ( nativeIndex . wrappedMacros ) }","docstring":"/**\n * Finds all \"macro constants\" and registers them as [NativeIndex.constants] in given index.\n */"} {"signature":"private fun expandMacros ( library : CompilationWithPCH , names : List < String > , typeConverter : TypeConverter ) : List < MacroDef >","body":"{ withIndex ( excludeDeclarationsFromPCH = true ) { index -> val sourceFile = library . createTempSource ( ) val compilerArgs = library . compilerArgs . toMutableList ( ) compilerArgs += \"\" compilerArgs += \"\" val translationUnit = parseTranslationUnit ( index , sourceFile , compilerArgs , options = CXTranslationUnit_DetailedPreprocessingRecord ) try { val nameToMacroDef = mutableMapOf < String , MacroDef > ( ) val unprocessedMacros = names . toMutableList ( ) while ( unprocessedMacros . isNotEmpty ( ) ) { val processedMacros = tryExpandMacros ( library , translationUnit , sourceFile , unprocessedMacros , typeConverter ) unprocessedMacros -= ( processedMacros . keys + unprocessedMacros . first ( ) ) processedMacros . forEach { ( name , macroDef ) -> if ( macroDef != null ) nameToMacroDef [ name ] = macroDef } } return names . mapNotNull { nameToMacroDef [ it ] } } finally { clang_disposeTranslationUnit ( translationUnit ) } } }","docstring":"/**\n * For each name expands the macro with this name declared in the library,\n * checking if it gets expanded to a constant expression.\n *\n * Note: in the worst case this method parses the code against the library a lot of times,\n * so it requires library headers precompiled to significantly speed up the parsing and avoid visiting headers' AST.\n *\n * @return the list of constants.\n */"} {"signature":"private fun tryExpandMacros ( library : CompilationWithPCH , translationUnit : CXTranslationUnit , sourceFile : File , names : List < String > , typeConverter : TypeConverter ) : Map < String , MacroDef ? >","body":"{ reparseWithCodeSnippets ( library , translationUnit , sourceFile , names ) val macrosWithErrorsInSnippetFunctionHeader = mutableSetOf < String > ( ) val macrosWithErrorsInSnippetFunctionBody = mutableSetOf < String > ( ) val preambleSize = library . preambleLines . size translationUnit . getErrorLineNumbers ( ) . map { it - preambleSize - } . forEach { lineNumber -> val index = lineNumber / CODE_SNIPPET_LINES_NUMBER if ( index >= && index < names . size ) { when ( lineNumber % CODE_SNIPPET_LINES_NUMBER ) { -> macrosWithErrorsInSnippetFunctionHeader += names [ index ] -> macrosWithErrorsInSnippetFunctionBody += names [ index ] else -> { } } } } val result = mutableMapOf < String , MacroDef ? > ( ) visitChildren ( translationUnit ) { cursor , _ -> if ( cursor . kind == CXCursorKind . CXCursor_FunctionDecl ) { val functionName = getCursorSpelling ( cursor ) if ( functionName . startsWith ( CODE_SNIPPET_FUNCTION_NAME_PREFIX ) ) { val macroName = functionName . removePrefix ( CODE_SNIPPET_FUNCTION_NAME_PREFIX ) if ( macroName in macrosWithErrorsInSnippetFunctionHeader ) { } else { result [ macroName ] = if ( macroName in macrosWithErrorsInSnippetFunctionBody ) { null } else { processCodeSnippet ( cursor , macroName , typeConverter ) } } } } CXChildVisitResult . CXChildVisit_Continue } return result }","docstring":"/**\n * Tries to expand macros [names] defined in [library].\n * Returns the map of successfully processed macros with resulting constant as a value\n * or `null` if the result is not a constant (expression).\n *\n * As a side effect, modifies the [sourceFile] and reparses the [translationUnit].\n */"} {"signature":"private fun reparseWithCodeSnippets ( library : CompilationWithPCH , translationUnit : CXTranslationUnit , sourceFile : File , names : List < String > )","body":"{ sourceFile . bufferedWriter ( ) . use { writer -> writer . appendPreamble ( library ) names . forEach { name -> val codeSnippetLines = when ( library . language ) { Language . C , Language . CPP , Language . OBJECTIVE_C -> listOf ( \"\" , \"\" , \"\" ) } assert ( codeSnippetLines . size == CODE_SNIPPET_LINES_NUMBER ) codeSnippetLines . forEach { writer . appendLine ( it ) } } } clang_reparseTranslationUnit ( translationUnit , , null , CXTranslationUnit_DetailedPreprocessingRecord ) }","docstring":"/**\n * Adds code snippets to be then processed with [processCodeSnippet] to the [sourceFile]\n * and reparses the [translationUnit].\n *\n * - If a code snippet allows extracting the constant value using libclang API, we'll add a [ConstantDef] in the\n * native index and generate a Kotlin constant for it.\n * - If the expression type can be inferred by libclang, we'll add a [WrappedMacroDef] in the native index and\n * generate a bridge for this macro.\n * - Otherwise the macro is skipped.\n */"} {"signature":"private fun processCodeSnippet ( functionCursor : CValue < CXCursor > , name : String , typeConverter : TypeConverter ) : MacroDef ?","body":"{ val kindsToSkip = setOf ( CXCursorKind . CXCursor_CompoundStmt ) var state = VisitorState . EXPECT_NODES_TO_SKIP var evalResultOrNull : CXEvalResult ? = null var typeOrNull : Type ? = null val visitor : CursorVisitor = { cursor , _ -> val kind = cursor . kind when { state == VisitorState . EXPECT_VARIABLE && kind == CXCursorKind . CXCursor_VarDecl -> { evalResultOrNull = clang_Cursor_Evaluate ( cursor ) state = VisitorState . EXPECT_VARIABLE_VALUE CXChildVisitResult . CXChildVisit_Recurse } state == VisitorState . EXPECT_VARIABLE_VALUE && clang_isExpression ( kind ) != -> { typeOrNull = typeConverter ( clang_getCursorType ( cursor ) ) state = VisitorState . EXPECT_END CXChildVisitResult . CXChildVisit_Continue } state == VisitorState . EXPECT_NODES_TO_SKIP && kind in kindsToSkip -> CXChildVisitResult . CXChildVisit_Recurse state == VisitorState . EXPECT_NODES_TO_SKIP && kind == CXCursorKind . CXCursor_DeclStmt -> { state = VisitorState . EXPECT_VARIABLE CXChildVisitResult . CXChildVisit_Recurse } else -> { state = VisitorState . INVALID CXChildVisitResult . CXChildVisit_Break } } } try { visitChildren ( functionCursor , visitor ) if ( state != VisitorState . EXPECT_END ) { return null } val type = typeOrNull ! ! return if ( evalResultOrNull == null ) { when ( type . unwrapTypedefs ( ) ) { is PrimitiveType , is PointerType , is ObjCPointer -> WrappedMacroDef ( name , type ) else -> null } } else { val evalResult = evalResultOrNull ! ! val evalResultKind = clang_EvalResult_getKind ( evalResult ) when ( evalResultKind ) { CXEvalResultKind . CXEval_Int -> IntegerConstantDef ( name , type , clang_EvalResult_getAsLongLong ( evalResult ) ) CXEvalResultKind . CXEval_Float -> FloatingConstantDef ( name , type , clang_EvalResult_getAsDouble ( evalResult ) ) CXEvalResultKind . CXEval_CFStr , CXEvalResultKind . CXEval_ObjCStrLiteral , CXEvalResultKind . CXEval_StrLiteral -> if ( evalResultKind == CXEvalResultKind . CXEval_StrLiteral && ! type . canonicalIsPointerToChar ( ) ) { null } else { StringConstantDef ( name , type , clang_EvalResult_getAsStr ( evalResult ) ! ! . toKString ( ) ) } CXEvalResultKind . CXEval_Other , CXEvalResultKind . CXEval_UnExposed -> null } } } finally { evalResultOrNull ? . let { clang_EvalResult_dispose ( it ) } } }","docstring":"/**\n * Checks that [functionCursor] is parsed exactly as expected for the code appended by [reparseWithCodeSnippets],\n * and returns the constant on success.\n */"} {"signature":"public fun KtType . asPsiType ( useSitePosition : PsiElement , allowErrorTypes : Boolean , mode : KtTypeMappingMode = KtTypeMappingMode . DEFAULT , isAnnotationMethod : Boolean = false , suppressWildcards : Boolean ? = null , preserveAnnotations : Boolean = true , ) : PsiType ?","body":"= withValidityAssertion { analysisSession . psiTypeProvider . asPsiType ( type = this , useSitePosition = useSitePosition , allowErrorTypes = allowErrorTypes , mode = mode , isAnnotationMethod = isAnnotationMethod , suppressWildcards = suppressWildcards , preserveAnnotations = preserveAnnotations , ) }","docstring":"/**\n * Converts the given [KtType] to [PsiType] under [useSitePosition] context.\n *\n * Note: [PsiType] is JVM conception, so this method will return `null` for non-JVM platforms.\n *\n * @receiver type to convert\n *\n * @param useSitePosition is used to determine if the given [KtType] needs to be approximated.\n * For instance, if the given type is local yet available in the same scope of use site,\n * we can still use such a local type.\n * Otherwise, e.g., exposed to public as a return type, the resulting type will be approximated accordingly.\n *\n * @param allowErrorTypes if **false** the result will be null in the case of an error type inside the [type][this].\n * Erroneous types will be replaced with `error.NonExistentClass` type.\n *\n * @param suppressWildcards indicates whether wild cards in type arguments need to be suppressed or not,\n * e.g., according to the annotation on the containing declarations.\n * - `true` means they should be suppressed.\n * - `false` means they should appear.\n * - `null` is no-op by default, i.e., their suppression/appearance is determined by type annotations.\n *\n * @param preserveAnnotations if **true** the result [PsiType] will have converted annotations from the original [type][this]\n */"} {"signature":"public fun PsiType . asKtType ( useSitePosition : PsiElement ) : KtType ?","body":"= withValidityAssertion { analysisSession . psiTypeProvider . asKtType ( this , useSitePosition ) }","docstring":"/**\n * Converts given [PsiType] to [KtType].\n *\n * [useSitePosition] may be used to clarify how to resolve some parts of [PsiType].\n * For instance, it can be used to collect type parameters and use them during the conversion.\n *\n * @receiver [PsiType] to be converted.\n * @return The converted [KtType], or null if conversion is not possible e.g., [PsiType] is not resolved\n */"} {"signature":"private inline fun deserializeIrStatementOrigin ( hasOriginName : Boolean , protoName : ( ) -> Int ) : IrStatementOrigin ?","body":"= if ( hasOriginName ) deserializeIrStatementOrigin ( protoName ( ) ) else null","docstring":"/**\n * This is more compact form of deserializeIrStatementOrigin() that allows writing\n * val origin = deserializeIrStatementOrigin(proto.hasOriginName()) { proto.originName }\n * instead of (as it was before)\n * val origin = if (proto.hasOriginName()) deserializeIrStatementOrigin(proto.originName) else null\n */"} {"signature":"private inline fun < reified S : IrSymbol > deserializeTypedSymbol ( code : Long , fallbackSymbolKind : SymbolKind ? , remap : Boolean = true ) : S","body":"= with ( declarationDeserializer ) { val symbol = if ( remap ) deserializeIrSymbolAndRemap ( code ) else deserializeIrSymbol ( code ) symbol . checkSymbolType ( fallbackSymbolKind ) }","docstring":"/**\n * This function allows to check deserialized symbols. If the deserialized symbol mismatches the symbol kind\n * at the call site in the deserializer then generate and reference another symbol with\n * the same signature. In case PL is off, just throw [IrSymbolTypeMismatchException].\n *\n * Note: [fallbackSymbolKind] must not completely match [S], but it should represent a subclass of [S].\n *\n * Example: [S] is [IrClassifierSymbol] and [fallbackSymbolKind] is [CLASS_SYMBOL],\n * which is only one possible option along with [TYPE_PARAMETER_SYMBOL].\n *\n * Note, that for local IR declarations such as [IrValueDeclaration] [fallbackSymbolKind] can be left null.\n */"} {"signature":"fun main ( )","body":"{ val ( train , test ) = fashionMnist ( ) model . use { it . compile ( optimizer = Adam ( ) , loss = Losses . SOFT_MAX_CROSS_ENTROPY_WITH_LOGITS , metric = Metrics . ACCURACY ) it . init ( ) println ( it . kGraph ) var accuracy = it . evaluate ( dataset = test , batchSize = TEST_BATCH_SIZE ) . metrics [ Metrics . ACCURACY ] println ( it . kGraph ) println ( \"\" ) it . fit ( dataset = train , epochs = EPOCHS , batchSize = TRAINING_BATCH_SIZE ) println ( it . kGraph ) 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 [model] with [BatchNorm] layer, without leveraging pre-trained weights or a pre-made model.\n * We demonstrate the workflow on the FashionMnist classification dataset.\n *\n * It includes:\n * - dataset loading from S3\n * - model compilation\n * - model training\n * - model evaluation\n */"} {"signature":"private fun transformUrlToFile ( url : URL )","body":"= url . toURI ( ) . toPath ( ) . toFile ( )","docstring":"/**\n * Transforms a given URL to a File object with proper handling of escapable characters like whitespace, hashbang.\n *\n * Example: URL containing \"some%20path\" should be transformed to a File object pointing to \"some path\"\n */"} {"signature":"private fun FirElementWithResolveState . shouldBeResolved ( )","body":"= when ( this ) { is FirDeclaration -> shouldBeResolved ( ) else -> throwUnexpectedFirElementError ( this ) }","docstring":"/**\n * @see isLazyResolvable\n */"} {"signature":"@ Suppress ( \"\" ) fun registerDisposable ( disposable : PluginDisposable )","body":"{ _disposables += disposable }","docstring":"/**\n * Passed [disposable] will be called when the plugin is no longer needed:\n *\n * - In the CLI mode: At the end of the compilation process.\n * - In the IDE mode: When the whole project is closed, or when the module\n * with the corresponding compiler plugin enabled is removed from the project.\n */"} {"signature":"@ Test fun testOnCompletionBetweenLimitingOperators ( )","body":"= runTest { flowOf ( , , ) . zip ( flowOf ( , ) ) { a , b -> a + b } . onCompletion { expect ( ) assertNotNull ( it ) } . take ( ) . collect { expect ( ) } flowOf ( , , ) . take ( ) . onCompletion { expect ( ) assertNotNull ( it ) } . zip ( flowOf ( ) ) { a , b -> a + b } . collect { expect ( ) } flowOf ( , , ) . take ( ) . onCompletion { expect ( ) assertNotNull ( it ) } . first ( ) flowOf ( , , ) . zip ( flowOf ( , ) ) { a , b -> a + b } . onCompletion { expect ( ) assertNotNull ( it ) } . first ( ) flowOf ( , , ) . take ( ) . onCompletion { expect ( ) assertNotNull ( it ) } . take ( ) . collect { expect ( ) } flowOf ( , , ) . zip ( flowOf ( , ) ) { a , b -> a + b } . onCompletion { expect ( ) assertNotNull ( it ) } . zip ( flowOf ( ) ) { a , b -> a + b } . collect { expect ( ) } finish ( ) }","docstring":"/**\n * Tests that the operators that are used to limit the flow (like [take] and [zip]) faithfully propagate the\n * cancellation exception to the original owner.\n */"} {"signature":"@ Test fun testEmittingElementsAfterCancellation ( )","body":"= runTest { assertEquals ( , flowOf ( , , ) . take ( ) . onCompletion { emit ( ) } . first ( ) ) }","docstring":"/**\n * Tests that emitting new elements after completion doesn't overwrite the old elements.\n */"} {"signature":"internal expect fun Double . format ( precision : Int , useGrouping : Boolean = true ) : String","body":"internal expect fun Double . format ( precision : Int , useGrouping : Boolean = true ) : String","docstring":"/**\n * Pretty formats a number.\n *\n * The locale must be fixed, so that decimals will be consistently formatted.\n * - `.` - decimal separator\n * - `,` - thousands separator\n */"} {"signature":"fun foo ( )","body":"{ }","docstring":"/**\n * [this]\n */"} {"signature":"@ Test fun testChecksCorrectChangingStringMetricsVersion ( )","body":"{ val actualStringMetricsVersionAndHash = Pair ( StringMetrics . VERSION , calculateFileChecksum ( STRING_METRICS_RELATIVE_PATH ) ) assertEquals ( STRING_METRICS_EXPECTED_VERSION_AND_HASH , actualStringMetricsVersionAndHash , \"\" + \"\" ) }","docstring":"/**\n * Test checks for that the version of [StringMetrics] was increased after changes in this file\n */"} {"signature":"@ Test fun testChecksCorrectChangingBooleanMetricsVersion ( )","body":"{ val actualBooleanMetricsVersionAndHash = Pair ( BooleanMetrics . VERSION , calculateFileChecksum ( BOOLEAN_METRICS_RELATIVE_PATH ) ) assertEquals ( BOOLEAN_METRICS_EXPECTED_VERSION_AND_HASH , actualBooleanMetricsVersionAndHash , \"\" + \"\" ) }","docstring":"/**\n * Test checks for that the version of [BooleanMetrics] was increased after changes in this file\n */"} {"signature":"@ Test fun testChecksCorrectChangingNumericalMetricsVersion ( )","body":"{ val actualNumericalMetricsVersionAndHash = Pair ( NumericalMetrics . VERSION , calculateFileChecksum ( NUMERICAL_METRICS_RELATIVE_PATH ) ) assertEquals ( NUMERICAL_METRICS_EXPECTED_VERSION_AND_HASH , actualNumericalMetricsVersionAndHash , \"\" + \"\" ) }","docstring":"/**\n * Test checks for that the version of [NumericalMetrics] was increased after changes in this file\n */"} {"signature":"fun < E > MutableList < E > . offer ( element : E )","body":"= this . add ( element )","docstring":"/**\n * Let's Walk Through a Maze.\n *\n * Imagine there is a maze whose walls are the big 'O' letters.\n * Now, I stand where a big 'I' stands and some cool prize lies\n * somewhere marked with a '$' sign. Like this:\n *\n * OOOOOOOOOOOOOOOOO\n * O O\n * O$ O O\n * OOOOO O\n * O O\n * O OOOOOOOOOOOOOO\n * O O I O\n * O O\n * OOOOOOOOOOOOOOOOO\n *\n * I want to get the prize, and this program helps me do so as soon\n * as I possibly can by finding a shortest path through the maze.\n */"} {"signature":"fun findPath ( maze : Maze ) : List < Pair < Int , Int > > ?","body":"{ val previous = HashMap < Pair < Int , Int > , Pair < Int , Int > > ( ) val queue = ArrayDeque < Pair < Int , Int > > ( ) val visited = HashSet < Pair < Int , Int > > ( ) queue . offer ( maze . start ) visited . add ( maze . start ) while ( ! queue . isEmpty ( ) ) { val cell = queue . poll ( ) if ( cell == maze . end ) break for ( newCell in maze . neighbors ( cell . first , cell . second ) ) { if ( newCell in visited ) continue previous [ newCell ] = cell queue . offer ( newCell ) visited . add ( cell ) } } if ( previous [ maze . end ] == null ) return null val path = ArrayList < Pair < Int , Int > > ( ) var current = previous [ maze . end ] while ( current != maze . start ) { path . add ( , current ! ! ) current = previous [ current ] } return path }","docstring":"/**\n * This function looks for a path from max.start to maze.end through\n * free space (a path does not go through walls). One can move only\n * straightly up, down, left or right, no diagonal moves allowed.\n */"} {"signature":"fun Maze . neighbors ( i : Int , j : Int ) : List < Pair < Int , Int > >","body":"{ val result = ArrayList < Pair < Int , Int > > ( ) addIfFree ( i - , j , result ) addIfFree ( i , j - , result ) addIfFree ( i + , j , result ) addIfFree ( i , j + , result ) return result }","docstring":"/**\n * Find neighbors of the (i, j) cell that are not walls\n */"} {"signature":"fun main ( args : Array < String > )","body":"{ printMaze ( \"\" ) printMaze ( \"\" ) printMaze ( \"\"\"\"\"\" . trimIndent ( ) ) printMaze ( \"\"\"\"\"\" . trimIndent ( ) ) printMaze ( \"\"\"\"\"\" . trimIndent ( ) ) }","docstring":"/** A few maze examples here */"} {"signature":"fun makeMaze ( s : String ) : Maze","body":"{ val lines = s . split ( \"\" ) ! ! val w = lines . maxWithOrNull ( Comparator { o1 , o2 -> val l1 : Int = o1 ? . length ? : val l2 = o2 ? . length ? : l1 - l2 } ) ! ! val data = Array < Array < Boolean > > ( lines . size ) { Array < Boolean > ( w . length ) { false } } var start : Pair < Int , Int > ? = null var end : Pair < Int , Int > ? = null for ( line in lines . indices ) { for ( x in lines [ line ] . indices ) { val c = lines [ line ] ! ! [ x ] data [ line ] [ x ] = c == '' when ( c ) { '' -> start = Pair ( line , x ) '' -> end = Pair ( line , x ) else -> { } } } } if ( start == null ) { throw IllegalArgumentException ( \"\" ) } if ( end == null ) { throw IllegalArgumentException ( \"\" ) } return Maze ( w . length , lines . size , data , start ! ! , end ! ! ) }","docstring":"/**\n * A maze is encoded in the string s: the big 'O' letters are walls.\n * I stand where a big 'I' stands and the prize is marked with\n * a '$' sign.\n *\n * Example:\n *\n * OOOOOOOOOOOOOOOOO\n * O O\n * O$ O O\n * OOOOO O\n * O O\n * O OOOOOOOOOOOOOO\n * O O I O\n * O O\n * OOOOOOOOOOOOOOOOO\n */"} {"signature":"private fun < A , B > matchSymmetricallyByNames ( containerA : NamedDomainObjectCollection < out A > , containerB : NamedDomainObjectCollection < out B > , whenMatched : ( A , B ) -> Unit )","body":"{ val matchedNames = mutableSetOf < String > ( ) fun < T , R > NamedDomainObjectCollection < T > . matchAllWith ( other : NamedDomainObjectCollection < R > , match : ( T , R ) -> Unit ) { this@matchAllWith . all { item -> val itemName = this@matchAllWith . namer . determineName ( item ) if ( itemName !in matchedNames ) { val otherItem = other . findByName ( itemName ) if ( otherItem != null ) { matchedNames += itemName match ( item , otherItem ) } } } } containerA . matchAllWith ( containerB ) { a , b -> whenMatched ( a , b ) } containerB . matchAllWith ( containerA ) { b , a -> whenMatched ( a , b ) } }","docstring":"/**\n * Applies [whenMatched] to pairs of items with the same name in [containerA] and [containerB],\n * regardless of the order in which they are added to the containers.\n */"} {"signature":"override fun apply ( target : Project )","body":"{ target . gradle . checkVersion ( ) val context = prepare ( target ) target . afterEvaluate { context . prepareMerging ( ) } ProvidedVariantsLocator ( target ) { provided -> context . finalizing ( provided ) } }","docstring":"/**\n * Apply plugin to a given project.\n */"} {"signature":"private fun Gradle . checkVersion ( )","body":"{ val current = SemVer . ofVariableOrNull ( gradleVersion ) ! ! val min = SemVer . ofVariableOrNull ( MINIMUM_GRADLE_VERSION ) ! ! if ( current < min ) throw GradleException ( \"\" + \"\" ) }","docstring":"/**\n * Check supported Gradle versions.\n */"} {"signature":"fun mdFile ( pathFromProjectRoot : String , fillFile : MarkdownTestDataFile . ( ) -> Unit )","body":"fun mdFile ( pathFromProjectRoot : String , fillFile : MarkdownTestDataFile . ( ) -> Unit )","docstring":"/**\n * Creates an `.md` (Markdown) file.\n *\n * If you want to use this file for module and package documentation, it must be included\n * in [TestDokkaConfiguration.includes] or [TestDokkaSourceSet.includes].\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: `/docs/core-package.md`\n */"} {"signature":"fun < T > enter ( part : String , block : ( ) -> T ) : T","body":"{ val prev = current val prevSibling = sibling val prevParent = parent val next = PathPartInfo ( part ) try { when { prevParent != null && prevSibling == null -> { next . parent = prevParent sibling = next parent = null } prevParent != null && prevSibling != null -> { next . prev = prevSibling sibling = next parent = null } else -> { next . parent = prev parent = null } } current = next return block ( ) } finally { current = prev parent = prevParent } }","docstring":"/**\n * Enter into a new scope with path part [part].\n */"} {"signature":"fun < T > siblings ( block : ( ) -> T ) : T","body":"{ if ( parent != null ) { return block ( ) } val prevSibling = sibling val prevParent = parent val prevCurrent = current try { parent = current sibling = null return block ( ) } finally { parent = prevParent sibling = prevSibling current = prevCurrent } }","docstring":"/**\n * Inside this block, treat all entered path parts as siblings of the current path part.\n */"} {"signature":"fun < T > siblings ( part : String , block : ( ) -> T ) : T","body":"= enter ( part ) { siblings ( block ) }","docstring":"/**\n * Enter into a new scope with path part [part] and assume entered paths to be children of\n * that path.\n *\n * This is shorthand for `enter(part) { siblings(block) } }`.\n */"} {"signature":"fun < T > root ( keys : MutableSet < String > = mutableSetOf ( ) , block : ( ) -> T ) : T","body":"{ val prevKeys = this . keys val prevCurrent = current val prevParent = parent val prevSibling = sibling try { this . keys = keys current = PathPartInfo . ROOT parent = null sibling = null return siblings ( block ) } finally { this . keys = prevKeys current = prevCurrent parent = prevParent sibling = prevSibling } }","docstring":"/**\n * This API is meant to allow for a sub-hierarchy of the tree to be treated as its own scope.\n * This will use the provided [keys] Set as the container for keys that are built while in\n * this scope. Inside of this scope, the previous scope will be completely ignored.\n */"} {"signature":"fun buildPath ( prefix : String , pathSeparator : String = \"\" , siblingSeparator : String = \"\" ) : Pair < String , Boolean >","body":"{ return buildString { append ( prefix ) current . print ( this , pathSeparator , siblingSeparator ) } . let { it to keys . add ( it ) } }","docstring":"/**\n * Build a path at the current position in the tree.\n *\n * @param prefix A string to prefix the path with\n * @param pathSeparator The string used to separate parts of the path\n * @param siblingSeparator When duplicate siblings are found an incrementing index is used to\n * make the path unique. This string will be used to separate the path part from the\n * incrementing index.\n *\n * @return A pair with `first` being the built key, and `second` being whether or not the key\n * was absent in the dictionary of already built keys. If `second` is false, this key is a\n * duplicate.\n */"} {"signature":"private fun classDeclaredInUnexpectedPosition ( classOrObject : KtClassOrObject ) : Boolean","body":"{ if ( classOrObject is KtObjectDeclaration ) return false val classParent = classOrObject . parent return classParent !is KtBlockExpression && classParent !is KtDeclarationContainer }","docstring":"/**\n * If class is declared in some strange context (for example, in expression like `10 < class A`),\n * we don't want to try to build a light class for it.\n *\n * The expression itself is incorrect and won't compile, but the parser is able the parse the class nonetheless.\n *\n * This does not concern objects, since object literals are expressions and can be used almost anywhere.\n */"} {"signature":"inline fun Executor . runProcess ( executableAbsolutePath : String , vararg args : String , block : ExecuteRequest . ( ) -> Unit = { } , ) : RunProcessResult","body":"{ ByteArrayOutputStream ( ) . use { stdout -> ByteArrayOutputStream ( ) . use { stderr -> val request = ExecuteRequest ( executableAbsolutePath ) . apply { this . args . addAll ( args ) this . stdout = stdout this . stderr = stderr this . workingDirectory = File ( \"\" ) . absoluteFile this . block ( ) } val response = this . execute ( request ) val result = RunProcessResult ( executionTime = response . executionTime , stdout = stdout . toString ( \"\" ) . trim ( ) , stderr = stderr . toString ( \"\" ) . trim ( ) , ) try { response . assertSuccess ( ) } catch ( e : IllegalStateException ) { throw RunProcessException ( e . message ! ! , result , response . exitCode ) } return result } } }","docstring":"/**\n * Run [executableAbsolutePath] with [Executor] using current process' working directory with [args] and capture the full output.\n *\n * A simplified version of [Executor.execute].\n *\n * @param executableAbsolutePath Path to the executable\n * @param args Command line args\n * @param block optional block to additionally customize [ExecuteRequest]\n *\n * @throws RunProcessException if the process has failed or timed out.\n */"} {"signature":"inline fun runProcess ( executableAbsolutePath : String , vararg args : String , block : ExecuteRequest . ( ) -> Unit = { } )","body":"= HostExecutor ( ) . runProcess ( executableAbsolutePath , * args , block = block )","docstring":"/**\n * Run [executableAbsolutePath] on host using current process' working directory with [args] and capture the full output.\n *\n * A simplified version of [HostExecutor.execute].\n *\n * @param executableAbsolutePath Path to the executable\n * @param args Command line args\n * @param block optional block to additionally customize [ExecuteRequest]\n *\n * @throws RunProcessException if the process has failed or timed out.\n */"} {"signature":"internal fun resolveKdocFqName ( analysisSession : KtAnalysisSession , selectedFqName : FqName , fullFqName : FqName , contextElement : KtElement , ) : Collection < KtSymbol >","body":"{ with ( analysisSession ) { val fullSymbolsResolved = resolveKdocFqName ( fullFqName , contextElement ) if ( selectedFqName == fullFqName ) return fullSymbolsResolved . mapTo ( mutableSetOf ( ) ) { it . symbol } if ( fullSymbolsResolved . isEmpty ( ) ) { val parent = fullFqName . parent ( ) return resolveKdocFqName ( analysisSession , selectedFqName , parent , contextElement ) } val goBackSteps = fullFqName . pathSegments ( ) . size - selectedFqName . pathSegments ( ) . size check ( goBackSteps > ) { \"\" } return fullSymbolsResolved . mapNotNullTo ( mutableSetOf ( ) ) { findParentSymbol ( it , goBackSteps , selectedFqName ) } } }","docstring":"/**\n * Resolves the [selectedFqName] of KDoc\n *\n * To properly resolve qualifier parts in the middle,\n * we need to resolve the whole qualifier to understand which parts of the qualifier are package or class qualifiers.\n * And then we will be able to resolve the qualifier selected by the user to the proper class, package or callable.\n *\n * It's possible that the whole qualifier is invalid, in this case we still want to resolve our [selectedFqName].\n * To do this, we are trying to resolve the whole qualifier until we succeed.\n *\n * @param selectedFqName the selected fully qualified name of the KDoc\n * @param fullFqName the whole fully qualified name of the KDoc\n * @param contextElement the context element in which the KDoc is defined\n *\n * @return the collection of KtSymbol(s) resolved from the fully qualified name\n * based on the selected FqName and context element\n */"} {"signature":"private fun KtAnalysisSession . findParentSymbol ( resolveResult : ResolveResult , goBackSteps : Int , selectedFqName : FqName ) : KtSymbol ?","body":"{ return if ( resolveResult . receiverClassReference != null ) { findParentSymbol ( resolveResult . receiverClassReference , goBackSteps - , selectedFqName ) } else { findParentSymbol ( resolveResult . symbol , goBackSteps , selectedFqName ) } }","docstring":"/**\n * Finds the parent symbol of the given [ResolveResult] by traversing back up the symbol hierarchy a [goBackSteps] steps,\n * or until the containing class or object symbol is found.\n *\n * Knows about the [ResolveResult.receiverClassReference] field and uses it in case it's not empty.\n */"} {"signature":"private fun KtAnalysisSession . findParentSymbol ( symbol : KtSymbol , goBackSteps : Int , selectedFqName : FqName ) : KtSymbol ?","body":"{ if ( symbol !is KtDeclarationSymbol && symbol !is KtPackageSymbol ) return null if ( symbol is KtDeclarationSymbol ) { goToNthParent ( symbol , goBackSteps ) ? . let { return it } } return getPackageSymbolIfPackageExists ( selectedFqName ) }","docstring":"/**\n * Finds the parent symbol of the given KtSymbol by traversing back up the symbol hierarchy a certain number of steps,\n * or until the containing class or object symbol is found.\n *\n * @param symbol The KtSymbol whose parent symbol needs to be found.\n * @param goBackSteps The number of steps to go back up the symbol hierarchy.\n * @param selectedFqName The fully qualified name of the selected package.\n * @return The [goBackSteps]-th parent [KtSymbol]\n */"} {"signature":"private fun KtAnalysisSession . goToNthParent ( symbol : KtDeclarationSymbol , steps : Int ) : KtDeclarationSymbol ?","body":"{ var currentSymbol = symbol repeat ( steps ) { currentSymbol = currentSymbol . getContainingSymbol ( ) as? KtClassOrObjectSymbol ? : return null } return currentSymbol }","docstring":"/**\n * N.B. Works only for [KtClassOrObjectSymbol] parents chain.\n */"} {"signature":"private fun KtAnalysisSession . getSymbolsFromParentMemberScopes ( fqName : FqName , contextElement : KtElement ) : Collection < KtSymbol >","body":"{ val declaration = PsiTreeUtil . getContextOfType ( contextElement , KtDeclaration :: class . java , false ) ? : return emptyList ( ) for ( ktDeclaration in declaration . parentsOfType < KtDeclaration > ( withSelf = true ) ) { if ( fqName . pathSegments ( ) . size == ) { getSymbolsFromDeclaration ( fqName . shortName ( ) , ktDeclaration ) . ifNotEmpty { return this } } if ( ktDeclaration is KtClassOrObject ) { val symbol = ktDeclaration . getClassOrObjectSymbol ( ) ? : continue val scope = getCompositeCombinedMemberAndCompanionObjectScope ( symbol ) val symbolsFromScope = getSymbolsFromMemberScope ( fqName , scope ) if ( symbolsFromScope . isNotEmpty ( ) ) return symbolsFromScope } } return emptyList ( ) }","docstring":"/**\n * Returns the [KtSymbol]s called [fqName] found in the member scope and companion object's member scope of the [KtDeclaration]s that\n * contain the [contextElement].\n *\n * If [fqName] has two or more segments, e.g. `Foo.bar`, the member and companion object scope of the containing [KtDeclaration] will be\n * queried for a class `Foo` first, and then that class `Foo` will be queried for the member `bar` by short name.\n */"} {"signature":"private fun KtAnalysisSession . getTypeQualifiedExtensions ( fqName : FqName , contextElement : KtElement ) : Collection < ResolveResult >","body":"{ if ( fqName . isRoot ) return emptyList ( ) val extensionName = fqName . shortName ( ) val receiverTypeName = fqName . parent ( ) if ( receiverTypeName . isRoot ) return emptyList ( ) val possibleExtensions = getExtensionCallableSymbolsByShortName ( extensionName , contextElement ) if ( possibleExtensions . isEmpty ( ) ) return emptyList ( ) val possibleReceivers = getReceiverTypeCandidates ( receiverTypeName , contextElement ) return possibleReceivers . flatMap { receiverClassSymbol -> val receiverType = buildClassType ( receiverClassSymbol ) val applicableExtensions = possibleExtensions . filter { canBeReferencedAsExtensionOn ( it , receiverType ) } applicableExtensions . map { it . toResolveResult ( receiverClassReference = receiverClassSymbol ) } } }","docstring":"/**\n * Tries to resolve [fqName] into available extension callables (functions or properties)\n * prefixed with a suitable extension receiver type (like in `Foo.bar`, or `foo.Foo.bar`).\n *\n * Relies on the fact that in such references only the last qualifier refers to the\n * actual extension callable, and the part before that refers to the receiver type (either fully\n * or partially qualified).\n *\n * For example, `foo.Foo.bar` may only refer to the extension callable `bar` with\n * a `foo.Foo` receiver type, and this function will only look for such combinations.\n *\n * N.B. This function only searches for extension callables qualified by receiver types!\n * It does not try to resolve fully qualified or member functions, because they are dealt\n * with by the other parts of [KDocReferenceResolver].\n */"} {"signature":"private fun KtAnalysisSession . canBeReferencedAsExtensionOn ( symbol : KtCallableSymbol , actualReceiverType : KtType ) : Boolean","body":"{ val extensionReceiverType = symbol . receiverParameter ? . type ? : return false return isPossiblySuperTypeOf ( extensionReceiverType , actualReceiverType ) }","docstring":"/**\n * Returns true if we consider that [this] extension function prefixed with [actualReceiverType] in\n * a KDoc reference should be considered as legal and resolved, and false otherwise.\n *\n * This is **not** an actual type check, it is just an opinionated approximation.\n * The main guideline was K1 KDoc resolve.\n *\n * This check might change in the future, as Dokka team advances with KDoc rules.\n */"} {"signature":"private fun KtAnalysisSession . isPossiblySuperTypeOf ( type : KtType , actualReceiverType : KtType ) : Boolean","body":"{ if ( actualReceiverType is KtTypeParameterType ) return false if ( type is KtTypeParameterType ) { return type . symbol . upperBounds . all { isPossiblySuperTypeOf ( it , actualReceiverType ) } } val receiverExpanded = actualReceiverType . expandedClassSymbol val expectedExpanded = type . expandedClassSymbol if ( receiverExpanded != null && receiverExpanded == expectedExpanded ) { return true } return actualReceiverType . isSubTypeOf ( type ) }","docstring":"/**\n * Same constraints as in [canBeReferencedAsExtensionOn].\n *\n * For a similar function in the `intellij` repository, see `isPossiblySubTypeOf`.\n */"} {"signature":"public fun ColumnsResolver < * > . isSingleColumnWithGroup ( cols : List < ColumnWithPath < * > > ) : Boolean","body":"= isSingleColumn ( ) && cols . singleOrNull ( ) ? . isColumnGroup ( ) == true","docstring":"/**\n * Returns true if [this] is a [SingleColumn] and [cols] consists of a single column group.\n */"} {"signature":"fun main ( args : Array < String > )","body":"{ val templateGroups = sequenceOf < TemplateGroup > ( Elements , Filtering , Ordering , ArrayOps , Snapshots , Mapping , SetOps , Aggregates , Guards , Generators , StringJoinOps , SequenceOps , RangeOps , Numeric , ComparableOps ) val targetBaseDirs = mutableMapOf < KotlinTarget , File > ( ) when ( args . size ) { -> { val baseDir = File ( args . first ( ) ) targetBaseDirs [ KotlinTarget . Common ] = baseDir . resolveExistingDir ( \"\" ) targetBaseDirs [ KotlinTarget . JVM ] = baseDir . resolveExistingDir ( \"\" ) targetBaseDirs [ KotlinTarget . JS ] = baseDir . resolveExistingDir ( \"\" ) targetBaseDirs [ KotlinTarget . WASM ] = baseDir . resolveExistingDir ( \"\" ) targetBaseDirs [ KotlinTarget . Native ] = baseDir . resolveExistingDir ( \"\" ) } else -> { println ( \"\"\"\"\"\" ) exitProcess ( ) } } templateGroups . groupByFileAndWrite ( targetsToGenerate = targetBaseDirs . keys ) { ( target , source ) -> val targetDir = targetBaseDirs [ target ] ? : error ( \"\" ) val platformSuffix = when ( val platform = target . platform ) { Platform . Common -> \"\" Platform . Native -> if ( target . backend == Backend . Wasm ) \"\" else \"\" else -> platform . name . lowercase ( ) . capitalize ( ) } targetDir . resolve ( \"\" ) } }","docstring":"/**\n * Generates methods in the standard library which are mostly identical\n * but just using a different input kind.\n *\n * Kinda like mimicking source macros here, but this avoids the inefficiency of type conversions\n * at runtime.\n */"} {"signature":"fun vgg16noTopAdditionalTraining ( )","body":"{ val modelHub = TFModelHub ( cacheDirectory = File ( \"\" ) ) val modelType = TFModels . CVnoTop . VGG16 ( inputShape = intArrayOf ( IMAGE_SIZE , IMAGE_SIZE , ) ) val model = modelHub . loadModel ( modelType ) val layers = mutableListOf < Layer > ( ) layers . addAll ( model . layers ) layers . add ( Flatten ( name = \"\" , ) ) layers . add ( Dense ( name = \"\" , kernelInitializer = HeNormal ( ) , biasInitializer = HeNormal ( ) , outputSize = , activation = Activations . Relu , ) ) layers . add ( Dense ( name = \"\" , kernelInitializer = HeNormal ( ) , biasInitializer = HeNormal ( ) , outputSize = , activation = Activations . Linear ) ) val newModel = Sequential . of ( layers ) val dataset = OnFlyImageDataset . create ( File ( dogsCatsSmallDatasetPath ( ) ) , FromFolders ( mapping = mapOf ( \"\" to , \"\" to ) ) , modelType . createPreprocessing ( newModel ) ) . shuffle ( ) val ( train , test ) = dataset . split ( TRAIN_TEST_SPLIT_RATIO ) newModel . use { it . compile ( optimizer = Adam ( ) , loss = Losses . SOFT_MAX_CROSS_ENTROPY_WITH_LOGITS , metric = Metrics . ACCURACY ) val hdfFile = modelHub . loadWeights ( modelType ) it . loadWeightsForFrozenLayers ( hdfFile ) it . printSummary ( ) val accuracyBeforeTraining = it . evaluate ( dataset = test , batchSize = TEST_BATCH_SIZE ) . metrics [ Metrics . ACCURACY ] println ( \"\" ) it . fit ( dataset = train , batchSize = TRAINING_BATCH_SIZE , epochs = EPOCHS ) val accuracyAfterTraining = it . evaluate ( dataset = test , batchSize = TEST_BATCH_SIZE ) . metrics [ Metrics . ACCURACY ] println ( \"\" ) } }","docstring":"/**\n * This example demonstrates the transfer learning concept on VGG'16 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 * - All layers, are added to the new Neural Network, its weights are frozen.\n * - New Dense layers are added and initialized via defined initializers.\n * - Model is re-trained on [dogsCatsSmallDatasetPath] dataset.\n *\n * We use the preprocessing DSL to describe the dataset generation pipeline.\n * We demonstrate the workflow on the subset of Kaggle Cats vs Dogs binary classification dataset.\n *\n * @see \n * Very Deep Convolutional Networks for Large-Scale Image Recognition (ICLR 2015).\n * @see \n * Detailed description of VGG'16 model and an approach to build it in Keras.\n */"} {"signature":"fun main ( ) : Unit","body":"= vgg16noTopAdditionalTraining ( )","docstring":"/** */"} {"signature":"fun < R > withDummyApplication ( action : ( ) -> R ) : R","body":"{ val previousApplication = ApplicationManager . getApplication ( ) val disposable = Disposer . newDisposable ( \"\" ) try { MockApplication . setUp ( disposable ) return action ( ) } finally { Disposer . dispose ( disposable ) resetApplicationToNull ( previousApplication ) require ( ApplicationManager . getApplication ( ) === previousApplication ) { \"\" } } }","docstring":"/**\n * Executes [action] with a dummy application available via [ApplicationManager.getApplication]. This function should **only** be used if\n * an application is needed to avoid null pointer exceptions from [ApplicationManager.getApplication] when used in simple situations. Do not\n * use this function if you need a properly set up application and project.\n */"} {"signature":"fun RegisteredDirectives . ignoreExceptionIfIgnoreDirectivePresent ( ignoreDirective : Directive , action : ( ) -> Unit )","body":"{ var exception : Throwable ? = null try { action ( ) } catch ( e : Throwable ) { exception = e } if ( ignoreDirective in this ) { if ( exception != null ) return error ( \"\" ) } if ( exception != null ) { throw exception } }","docstring":"/**\n * [AfterAnalysisChecker][org.jetbrains.kotlin.test.model.AfterAnalysisChecker] should be the preferred option\n */"} {"signature":"fun < T , R > Collection < T > . singleOrZeroValue ( transformer : ( T ) -> R ? , ambiguityValueRenderer : ( R ) -> String , ) : R ?","body":"{ val newCollection = mapNotNull ( transformer ) return when ( newCollection . size ) { -> null -> newCollection . single ( ) else -> error ( buildString { appendLine ( \"\" ) newCollection . joinTo ( this , separator = \"\" , transform = ambiguityValueRenderer ) } ) } }","docstring":"/**\n * Transforms [this] collection with [transformer] and return single or null value. Throws [error] in the case of more than one element.\n */"} {"signature":"public fun KtType . mapTypeToJvmType ( mode : TypeMappingMode = TypeMappingMode . DEFAULT ) : Type","body":"= withValidityAssertion { analysisSession . jvmTypeMapper . mapTypeToJvmType ( this , mode ) }","docstring":"/**\n * Create ASM JVM type by corresponding KtType\n *\n * @see TypeMappingMode\n */"} {"signature":"fun T . write ( parcel : Parcel , flags : Int )","body":"fun T . write ( parcel : Parcel , flags : Int )","docstring":"/**\n * Writes the [T] instance state to the [parcel].\n */"} {"signature":"fun create ( parcel : Parcel ) : T","body":"fun create ( parcel : Parcel ) : T","docstring":"/**\n * Reads the [T] instance state from the [parcel], constructs the new [T] instance and returns it.\n */"} {"signature":"fun newArray ( size : Int ) : Array < T >","body":"{ throw NotImplementedError ( \"\" ) }","docstring":"/**\n * Returns a new [Array] with the given array [size].\n */"} {"signature":"@ ExperimentalBCVApi public fun KLibDumpFilters ( builderAction : KlibDumpFilters . Builder . ( ) -> Unit ) : KlibDumpFilters","body":"{ val builder = KlibDumpFilters . Builder ( ) builderAction ( builder ) return builder . build ( ) }","docstring":"/**\n * Builds a new [KlibDumpFilters] instance by invoking a [builderAction] on a temporary\n * [KlibDumpFilters.Builder] instance and then converting it into filters.\n *\n * Supplied [KlibDumpFilters.Builder] is valid only during the scope of [builderAction] execution.\n */"} {"signature":"fun unreachableBranch ( argument : Any ? ) : Nothing","body":"{ error ( \"\" ) }","docstring":"/**\n * Use this function to indicate that some when branch is semantically unreachable\n */"} {"signature":"fun < T , A : Appendable > Iterable < T > . joinToWithBuffer ( buffer : A , separator : CharSequence = \"\" , prefix : CharSequence = \"\" , postfix : CharSequence = \"\" , limit : Int = - , truncated : CharSequence = \"\" , appendElement : A . ( T ) -> Unit , ) : A","body":"{ buffer . append ( prefix ) var count = for ( element in this ) { if ( ++ count > ) buffer . append ( separator ) if ( limit < || count <= limit ) { buffer . appendElement ( element ) } else break } if ( limit in ..< count ) buffer . append ( truncated ) buffer . append ( postfix ) return buffer }","docstring":"/**\n * Calls [appendElement] on [buffer] for all the elements, also appending [separator] between them and using the given [prefix]\n * 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 */"} {"signature":"fun parse ( line : String ) : Boolean","body":"{ val rawDirective = parseDirective ( line ) ? : return false val parsedDirective = convertToRegisteredDirective ( rawDirective ) ? : return false addParsedDirective ( parsedDirective ) return true }","docstring":"/**\n * returns true means that line contain directive\n */"} {"signature":"@ kotlin . internal . InlineOnly public inline fun Reader . buffered ( bufferSize : Int = DEFAULT_BUFFER_SIZE ) : BufferedReader","body":"= if ( this is BufferedReader ) this else BufferedReader ( this , bufferSize )","docstring":"/** Returns a buffered reader wrapping this Reader, or this Reader itself if it is already buffered. */"} {"signature":"@ kotlin . internal . InlineOnly public inline fun Writer . buffered ( bufferSize : Int = DEFAULT_BUFFER_SIZE ) : BufferedWriter","body":"= if ( this is BufferedWriter ) this else BufferedWriter ( this , bufferSize )","docstring":"/** Returns a buffered writer wrapping this Writer, or this Writer itself if it is already buffered. */"} {"signature":"public fun Reader . forEachLine ( action : ( String ) -> Unit ) : Unit","body":"= useLines { it . forEach ( action ) }","docstring":"/**\n * Iterates through each line of this reader, calls [action] for each line read\n * and closes the [Reader] when it's completed.\n *\n * @param action function to process file lines.\n */"} {"signature":"public fun Reader . readLines ( ) : List < String >","body":"{ val result = arrayListOf < String > ( ) forEachLine { result . add ( it ) } return result }","docstring":"/**\n * Reads this reader content as a list of lines.\n *\n * Do not use this function for huge files.\n */"} {"signature":"public inline fun < T > Reader . useLines ( block : ( Sequence < String > ) -> T ) : T","body":"{ contract { callsInPlace ( block , InvocationKind . EXACTLY_ONCE ) } return buffered ( ) . use { block ( it . lineSequence ( ) ) } }","docstring":"/**\n * Calls the [block] callback giving it a sequence of all the lines in this file and closes the reader once\n * the processing is complete.\n * @return the value returned by [block].\n */"} {"signature":"@ kotlin . internal . InlineOnly public inline fun String . reader ( ) : StringReader","body":"= StringReader ( this )","docstring":"/** Creates a new reader for the string. */"} {"signature":"public fun BufferedReader . lineSequence ( ) : Sequence < String >","body":"= LinesSequence ( this ) . constrainOnce ( )","docstring":"/**\n * Returns a sequence of corresponding file lines.\n *\n * *Note*: the caller must close the underlying `BufferedReader`\n * when the iteration is finished, as the user may not complete the iteration loop (e.g. using a method like find() or any() on the iterator\n * may terminate the iteration early).\n *\n * We suggest you try the method [useLines] instead which closes the stream when the processing is complete.\n *\n * @return a sequence of corresponding file lines. The sequence returned can be iterated only once.\n */"} {"signature":"public fun Reader . readText ( ) : String","body":"{ val buffer = StringWriter ( ) copyTo ( buffer ) return buffer . toString ( ) }","docstring":"/**\n * Reads this reader completely as a String.\n *\n * *Note*: It is the caller's responsibility to close this reader.\n *\n * @return the string with corresponding file content.\n */"} {"signature":"public fun Reader . copyTo ( out : Writer , bufferSize : Int = DEFAULT_BUFFER_SIZE ) : Long","body":"{ var charsCopied : Long = val buffer = CharArray ( bufferSize ) var chars = read ( buffer ) while ( chars >= ) { out . write ( buffer , , chars ) charsCopied += chars chars = read ( buffer ) } return charsCopied }","docstring":"/**\n * Copies this reader to the given [out] writer, returning the number of characters copied.\n *\n * **Note** it is the caller's responsibility to close both of these resources.\n *\n * @param out writer to write to.\n * @param bufferSize size of character buffer to use in process.\n * @return number of characters copied.\n */"} {"signature":"@ kotlin . internal . InlineOnly public inline fun URL . readText ( charset : Charset = Charsets . UTF_8 ) : String","body":"= readBytes ( ) . toString ( charset )","docstring":"/**\n * Reads the entire content of this URL as a String using UTF-8 or the specified [charset].\n *\n * This method is not recommended on huge files.\n *\n * @param charset a character set to use.\n * @return a string with this URL entire content.\n */"} {"signature":"public fun URL . readBytes ( ) : ByteArray","body":"= openStream ( ) . use { it . readBytes ( ) }","docstring":"/**\n * Reads the entire content of the URL as byte array.\n *\n * This method is not recommended on huge files.\n *\n * @return a byte array with this URL entire content.\n */"} {"signature":"override fun resolveAllSupertypesForOuterClass ( outerClass : FirClass )","body":"{ if ( outerClass !in visitedElements ) { outerClass . asResolveTarget ( ) ? . let { resolveTarget -> resolveToSupertypePhase ( resolveTarget ) } LLFirSupertypeLazyResolver . checkIsResolved ( outerClass ) } }","docstring":"/**\n * We can do nothing here because at a call moment we've already resolved [outerClass]\n * because we resolve classes from top to down\n */"} {"signature":"private inline fun < T : FirClassLikeDeclaration , S > performResolve ( declaration : T , superTypeRefsForTransformation : ( ) -> S , resolver : ( S ) -> List < FirResolvedTypeRef > , crossinline superTypeUpdater : ( List < FirTypeRef > ) -> Unit , )","body":"{ if ( declaration . resolvePhase >= resolverPhase ) return declaration . lazyResolveToPhase ( resolverPhase . previous ) var superTypeRefs : S ? = null withReadLock ( declaration ) { superTypeRefs = superTypeRefsForTransformation ( ) } if ( superTypeRefs == null ) return @ Suppress ( \"\" ) val resolvedSuperTypeRefs = resolver ( superTypeRefs as S ) val status = supertypeComputationSession . getSupertypesComputationStatus ( declaration ) if ( status is SupertypeComputationStatus . Computed ) { supertypeComputationSession . withDeclarationSession ( declaration ) { for ( computedType in status . supertypeRefs ) { crawlSupertype ( computedType . type ) } } } val loopedSuperTypeRefs = supertypeComputationSession . findLoopFor ( declaration ) val resultedTypeRefs = loopedSuperTypeRefs ? : resolvedSuperTypeRefs performCustomResolveUnderLock ( declaration ) { superTypeUpdater ( resultedTypeRefs ) } }","docstring":"/**\n * [superTypeRefsForTransformation] will be executed under [declaration] lock\n */"} {"signature":"private fun crawlSupertype ( type : ConeKotlinType )","body":"{ for ( session in supertypeComputationSession . useSiteSessions . asReversed ( ) ) { type . toSymbol ( session ) ? . let ( :: crawlSupertype ) } if ( type is ConeClassLikeType ) { type . typeArguments . forEach { it . type ? . let { crawlSupertype ( it ) } } } }","docstring":"/**\n * We want to apply resolved supertypes to as many designations as possible.\n * So we crawl the resolved supertypes of visited designations to find more designations to collect.\n */"} {"signature":"fun findLoopFor ( declaration : FirClassLikeDeclaration ) : List < FirResolvedTypeRef > ?","body":"{ breakLoopFor ( declaration = declaration , session = declaration . llFirSession , visited = visited , looped = looped , pathSet = pathSet , path = path , ) require ( path . isEmpty ( ) ) { \"\" } require ( pathSet . isEmpty ( ) ) { \"\" } visited . clear ( ) looped . clear ( ) return updatedTypesForDeclarationsWithLoop [ declaration ] }","docstring":"/**\n * @param declaration declaration to be checked for loops\n * @return list of resolved super type refs if at least one of them is [FirErrorTypeRef] due to cycle hierarchy\n */"} {"signature":"override fun getResolvedSuperTypeRefsForOutOfSessionDeclaration ( classLikeDeclaration : FirClassLikeDeclaration ) : List < FirResolvedTypeRef > ?","body":"{ if ( classLikeDeclaration . resolvePhase < FirResolvePhase . SUPER_TYPES ) return emptyList ( ) return super . getResolvedSuperTypeRefsForOutOfSessionDeclaration ( classLikeDeclaration ) }","docstring":"/**\n * We shouldn't try to iterate over unresolved class. Otherwise, it can lead to [ConcurrentModificationException]\n */"} {"signature":"internal fun List < State > . wrap ( callInterceptor : CallInterceptor , irFunction : IrFunction , methodType : MethodType ? = null ) : List < Any ? >","body":"{ val name = irFunction . fqName if ( name == eqeqName && this . any { it is Common } ) { return mapIndexed { index , state -> if ( state !is Common ) return@mapIndexed state state . wrap ( callInterceptor , remainArraysAsIs = true , methodType ? . parameterType ( index ) ) } } return this . mapIndexed { index , state -> val unwrapArrays = ( name == \"\" && index != ) || name == \"\" || name == checkNotNullName state . wrap ( callInterceptor , unwrapArrays , methodType ? . parameterType ( index ) ) } }","docstring":"/**\n * Prepare state object to be passed in outer world\n */"} {"signature":"internal actual fun < T > createCache ( factory : ( KClass < * > ) -> KSerializer < T > ? ) : SerializerCache < T >","body":"{ return if ( useClassValue ) ClassValueCache ( factory ) else ConcurrentHashMapCache ( factory ) }","docstring":"/**\n * Creates a **strongly referenced** cache of values associated with [Class].\n * Serializers are computed using provided [factory] function.\n *\n * `null` values are not supported, though there aren't any technical limitations.\n */"} {"signature":"internal actual fun < T > createParametrizedCache ( factory : ( KClass < Any > , List < KType > ) -> KSerializer < T > ? ) : ParametrizedSerializerCache < T >","body":"{ return if ( useClassValue ) ClassValueParametrizedCache ( factory ) else ConcurrentHashMapParametrizedCache ( factory ) }","docstring":"/**\n * Creates a **strongly referenced** cache of values associated with [Class].\n * Serializers are computed using provided [factory] function.\n *\n * `null` values are not supported, though there aren't any technical limitations.\n */"} {"signature":"public inline fun LayerCollectorContext . tiles ( block : TilesContext . ( ) -> Unit )","body":"{ addLayer ( TilesContext ( this ) . apply ( block ) ) }","docstring":"/**\n * Adds a new `tiles` layer to the plot.\n *\n * The `tiles` layer is used for visualizing data in a grid format, useful for creating heatmaps or 2D binning plots.\n *\n * This function creates a context where you can set aesthetic mappings (`aes`) or aesthetic constants.\n * - Mappings are specified by calling methods that correspond to aesthetic names (`aes`).\n * - Constants are directly assigned using properties with the names corresponding to aesthetics.\n * For positional aesthetics, you can use the `.constant()` method.\n *\n * ## Tiles Aesthetics\n * * **`x`** - The X-coordinate for the bottom-left corner of the tile.\n * * **`y`** - The Y-coordinate for the bottom-left corner of the tile.\n * * **`fillColor`** - The fill color of the tile.\n * * **`alpha`** - The transparency of the tile.\n * * **`width`** - The width of the tile.\n * * **`height`** - The height of the tile.\n * * **`borderLine.color`** - The color of the borderLine.\n * * **`borderLine.width`** - The width of the borderLine.\n * * **`borderLine.type`** - The type of the borderLine (solid, dashed, etc.).\n *\n * ## Example Usage\n *\n * ```kotlin\n * val xCord by columnOf(1, 1, 2, 2, 3, 3)\n * val yCord by columnOf(1, 2, 1, 2, 1, 2)\n * val value by columnOf(5, 10, 15, 20, 25, 30)\n *\n * plot {\n * tiles {\n * // Positional mapping\n * x(xCord)\n * y(yCord)\n *\n * // Non-positional mapping\n * fillColor(value) {\n * scale = continuousColorGradient2(Color.WHITE, Color.BLUE, Color.RED, 0.5)\n * }\n *\n * // Non-positional settings\n * alpha = 0.8\n * borderLine {\n * color = Color.BLACK\n * width = 0.5\n * }\n *\n * width = 0.9\n * height = 0.9\n * }\n * }\n * ```\n */"} {"signature":"@ OptIn ( ExperimentalContracts :: class , KtAnalysisApiInternals :: class ) public inline fun KtAnalysisSession . buildSubstitutor ( build : KtSubstitutorBuilder . ( ) -> Unit ) : KtSubstitutor","body":"{ contract { callsInPlace ( build , InvocationKind . EXACTLY_ONCE ) } return analysisSession . substitutorFactory . buildSubstitutor ( KtSubstitutorBuilder ( token ) . apply ( build ) ) }","docstring":"/**\n * Creates new [KtSubstitutor] using substitutions specified inside [build] lambda\n */"} {"signature":"public fun substitution ( typeParameter : KtTypeParameterSymbol , type : KtType )","body":"{ assertIsValidAndAccessible ( ) _mapping [ typeParameter ] = type }","docstring":"/**\n * Adds a new [typeParameter] -> [type] substitution to the substitutor which is being built.\n * If there already was a substitution with a [typeParameter], replaces corresponding substitution with a new one.\n */"} {"signature":"public fun substitutions ( substitutions : Map < KtTypeParameterSymbol , KtType > )","body":"{ assertIsValidAndAccessible ( ) _mapping += substitutions }","docstring":"/**\n * Adds a new substitutions to the substitutor which is being built.\n * If there already was a substitution with a [KtTypeParameterSymbol] which is present in a [substitutions],\n * replaces corresponding substitution with a new one.\n */"} {"signature":"abstract fun fileCached ( file : KtFile , createValue : ( ) -> FirFile ) : FirFile","body":"abstract fun fileCached ( file : KtFile , createValue : ( ) -> FirFile ) : FirFile","docstring":"/**\n * @return [FirFile] by [file] if it was previously built or runs [createValue] otherwise\n * The [createValue] is run under the lock so [createValue] is executed at most once for each [KtFile]\n */"} {"signature":"fun < T : Number > reciprocal ( x : KtNDArray < T > ) : KtNDArray < T >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( x ) )","docstring":"/**\n * Return the reciprocal of the argument, element-wise.\n */"} {"signature":"fun < T : Number > positive ( x : KtNDArray < T > ) : KtNDArray < T >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( x ) )","docstring":"/**\n * Numerical positive, element-wise.\n */"} {"signature":"fun < T : Number > negative ( x : KtNDArray < T > ) : KtNDArray < T >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( x ) )","docstring":"/**\n * Numerical negative, element-wise.\n */"} {"signature":"fun < T : Number > power ( x1 : KtNDArray < T > , x2 : Byte ) : KtNDArray < T >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( x1 , x2 ) )","docstring":"/**\n * First array elements raised to powers from second array, element-wise.\n */"} {"signature":"fun < T : Number , E : Number > floatPower ( x1 : KtNDArray < T > , x2 : KtNDArray < E > ) : KtNDArray < Double >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( x1 , x2 ) )","docstring":"/**\n * First array elements raised to powers from second array, element-wise.\n */"} {"signature":"fun < T : Number , E : Number > fmod ( x1 : KtNDArray < T > , x2 : E ) : KtNDArray < T >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( x1 , x2 ) )","docstring":"/**\n * Return the element-wise remainder of division.\n */"} {"signature":"fun flush ( )","body":"fun flush ( )","docstring":"/** Writes any remaining in-memory changes to [storageFile]. */"} {"signature":"override fun close ( )","body":"override fun close ( )","docstring":"/** Writes any remaining in-memory changes to [storageFile] ([flush]) and closes this map. */"} {"signature":"fun append ( key : KEY , elements : Collection < E > )","body":"fun append ( key : KEY , elements : Collection < E > )","docstring":"/** Adds the given [elements] to the collection corresponding to the given [key]. */"} {"signature":"fun append ( key : KEY , element : E )","body":"{ append ( key , listOf ( element ) ) }","docstring":"/** Adds the given [element] to the collection corresponding to the given [key]. */"} {"signature":"public actual fun < T : Comparable < T > > MutableList < T > . sort ( ) : Unit","body":"{ if ( size > ) java . util . Collections . sort ( this ) }","docstring":"/**\n * Sorts elements in the list in-place 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 *\n * @sample samples.collections.Collections.Sorting.sortMutableList\n */"} {"signature":"public actual fun < T > MutableList < T > . sortWith ( comparator : Comparator < in T > ) : Unit","body":"{ if ( size > ) java . util . Collections . sort ( this , comparator ) }","docstring":"/**\n * Sorts elements in the list in-place according to the order specified with [comparator].\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.sortMutableListWith\n */"} {"signature":"@ kotlin . internal . InlineOnly @ SinceKotlin ( \"\" ) public actual inline fun < T > MutableList < T > . fill ( value : T )","body":"{ java . util . Collections . fill ( this , value ) }","docstring":"/**\n * Fills the list with the provided [value].\n *\n * Each element in the list gets replaced with the [value].\n */"} {"signature":"@ kotlin . internal . InlineOnly @ SinceKotlin ( \"\" ) public actual inline fun < T > MutableList < T > . shuffle ( )","body":"{ java . util . Collections . shuffle ( this ) }","docstring":"/**\n * Randomly shuffles elements in this mutable list.\n */"} {"signature":"@ kotlin . internal . InlineOnly @ SinceKotlin ( \"\" ) public inline fun < T > MutableList < T > . shuffle ( random : java . util . Random )","body":"{ java . util . Collections . shuffle ( this , random ) }","docstring":"/**\n * Randomly shuffles elements in this mutable list using the specified [random] instance as the source of randomness.\n */"} {"signature":"internal fun DateTimeFormatBuilder . WithDate . yearOfEra ( padding : Padding )","body":"{ @ Suppress ( \"\" ) when ( this ) { is AbstractWithDateBuilder -> addFormatStructureForDate ( BasicFormatStructure ( YearDirective ( padding , isYearOfEra = true ) ) ) } }","docstring":"/**\n * A special directive for year-of-era that behaves equivalently to [DateTimeFormatBuilder.WithDate.year].\n * This is the result of calling [byUnicodePattern] on a pattern that uses the ubiquitous \"y\" symbol.\n * We need a separate directive so that, when using [DateTimeFormat.formatAsKotlinBuilderDsl], we can print an\n * additional comment and explain that the behavior was not preserved exactly.\n */"} {"signature":"internal fun DateTimeFormatBuilder . WithDate . yearOfEraTwoDigits ( baseYear : Int )","body":"{ @ Suppress ( \"\" ) when ( this ) { is AbstractWithDateBuilder -> addFormatStructureForDate ( BasicFormatStructure ( ReducedYearDirective ( baseYear , isYearOfEra = true ) ) ) } }","docstring":"/**\n * A special directive for year-of-era that behaves equivalently to [DateTimeFormatBuilder.WithDate.year].\n * This is the result of calling [byUnicodePattern] on a pattern that uses the ubiquitous \"y\" symbol.\n * We need a separate directive so that, when using [DateTimeFormat.formatAsKotlinBuilderDsl], we can print an\n * additional comment and explain that the behavior was not preserved exactly.\n */"} {"signature":"internal fun < T > MutableList < T > . replaceAll ( transformation : ( T ) -> T )","body":"{ val it = listIterator ( ) while ( it . hasNext ( ) ) { val element = it . next ( ) it . set ( transformation ( element ) ) } }","docstring":"/**\n * Replaces each element in the list with a result of a transformation specified.\n */"} {"signature":"fun invalidateElement ( element : KtElement )","body":"{ val container = getContainerKtElement ( element ) structureElements . remove ( container ) }","docstring":"/**\n * Must be called only under write-lock.\n *\n * This method is responsible for \"invalidation\" of re-analyzable declarations.\n *\n * @see LLFirDeclarationModificationService\n * @see getNonLocalReanalyzableContainingDeclaration\n */"} {"signature":"fun getStructureElementFor ( element : KtElement ) : FileStructureElement","body":"{ val container = getContainerKtElement ( element ) return structureElements . getOrPut ( container ) { createStructureElement ( container ) } }","docstring":"/**\n * @return [FileStructureElement] for the closest non-local declaration which contains this [element].\n */"} {"signature":"private fun Project . registerVerifyModuleTask ( compileTask : KotlinCompile , sourceFile : File ) : TaskProvider < out KotlinJvmCompile >","body":"{ apply < KotlinApiPlugin > ( ) val verifyModuleTaskName = \"\" val kotlinApiPlugin = plugins . getPlugin ( KotlinApiPlugin :: class ) val verifyModuleTask = kotlinApiPlugin . registerKotlinJvmCompileTask ( verifyModuleTaskName , compileTask . compilerOptions . moduleName . get ( ) ) verifyModuleTask { group = VERIFICATION_GROUP description = \"\" libraries . from ( compileTask . libraries ) source ( compileTask . sources ) source ( compileTask . javaSources ) @ Suppress ( \"\" ) source ( compileTask . scriptSources ) source ( sourceFile ) destinationDirectory . set ( temporaryDir ) multiPlatformEnabled . set ( compileTask . multiPlatformEnabled ) compilerOptions { jvmTarget . set ( JvmTarget . JVM_9 ) languageVersion . set ( compileTask . compilerOptions . languageVersion ) freeCompilerArgs . addAll ( listOf ( \"\" , \"\" , \"\" ) ) optIn . addAll ( compileTask . kotlinOptions . options . optIn ) } inputs . files ( libraries . asFileTree . elements . map { libs -> libs . filter { it . asFile . exists ( ) } . map { zipTree ( it . asFile ) . filter { it . name == \"\" } } } ) . withPropertyName ( \"\" ) this as KotlinCompile val kotlinPluginVersion = KotlinToolingVersion ( kotlinApiPlugin . pluginVersion ) if ( kotlinPluginVersion <= KotlinToolingVersion ( \"\" ) ) { @ Suppress ( \"\" ) val ownModuleNameProp = ( this :: class . superclasses . first ( ) as KClass < AbstractKotlinCompile < * > > ) . declaredMemberProperties . find { it . name == \"\" } ? . get ( this ) as? Property < String > ownModuleNameProp ? . set ( compileTask . kotlinOptions . moduleName ) } val taskKotlinLanguageVersion = compilerOptions . languageVersion . orElse ( KotlinVersion . DEFAULT ) @ OptIn ( InternalKotlinGradlePluginApi :: class ) if ( taskKotlinLanguageVersion . get ( ) < KotlinVersion . KOTLIN_2_0 ) { @ Suppress ( \"\" ) commonSourceSet . from ( compileTask . commonSourceSet ) } else { multiplatformStructure . refinesEdges . set ( compileTask . multiplatformStructure . refinesEdges ) multiplatformStructure . fragments . set ( compileTask . multiplatformStructure . fragments ) } incremental = false } return verifyModuleTask }","docstring":"/**\n * Add a Kotlin compile task that compiles `module-info.java` source file and Kotlin sources together,\n * the Kotlin compiler will parse and check module dependencies,\n * but it currently won't compile to a module-info.class file.\n */"} {"signature":"protected abstract fun phaseSpecificCheckIsResolved ( target : FirElementWithResolveState )","body":"protected abstract fun phaseSpecificCheckIsResolved ( target : FirElementWithResolveState )","docstring":"/**\n * Check that phase-specific conditions are met\n * Will be performed to resolved declaration and its nested declarations\n * @see checkNestedDeclarationsAreResolved\n */"} {"signature":"fun < T : Number > signbit ( x : KtNDArray < T > ) : KtNDArray < Boolean >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( x ) )","docstring":"/**\n * Returns element-wise True where signbit is set (less than zero).\n */"} {"signature":"fun < T : Number , E : Number > copysign ( x1 : KtNDArray < T > , x2 : KtNDArray < E > ) : KtNDArray < Double >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( x1 , x2 ) , dtype = Double :: class )","docstring":"/**\n * Change the sign of x1 to that of x2, element-wise.\n */"} {"signature":"fun < T : Any > frexp ( x : KtNDArray < T > ) : Pair < KtNDArray < Double > , KtNDArray < Int > >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( x ) , kClass = Pair :: class ) as Pair < KtNDArray < Double > , KtNDArray < Int > >","docstring":"/**\n * Decompose the elements of x into mantissa and twos exponent.\n */"} {"signature":"fun < T : Number , E : Number > ldexp ( x1 : KtNDArray < T > , x2 : KtNDArray < E > ) : KtNDArray < Double >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( x1 , x2 ) , dtype = Double :: class )","docstring":"/**\n * Returns x1 * 2**x2, element-wise.\n */"} {"signature":"fun < T : Number , E : Number > nextafter ( x1 : KtNDArray < T > , x2 : KtNDArray < E > ) : KtNDArray < Double >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( x1 , x2 ) , dtype = Double :: class )","docstring":"/**\n * Return the next floating-point value after x1 towards x2, element-wise.\n */"} {"signature":"fun < T : Number > spacing ( x : KtNDArray < T > ) : KtNDArray < Double >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( x ) , dtype = Double :: class )","docstring":"/**\n * Return the distance between x and the nearest adjacent number.\n */"} {"signature":"fun getIrClass ( firClass : FirClass ) : IrClass","body":"{ getCachedIrClass ( firClass ) ? . let { return it } if ( firClass is FirAnonymousObject || firClass is FirRegularClass && firClass . visibility == Visibilities . Local ) { return createAndCacheLocalIrClassOnTheFly ( firClass ) } require ( firClass is FirRegularClass ) val symbol = createClassSymbol ( ) val classId = firClass . symbol . classId val parentId = classId . outerClassId val parentClass = parentId ? . let { session . symbolProvider . getClassLikeSymbolByClassId ( it ) } val irParent = declarationStorage . findIrParent ( classId . packageFqName , parentClass ? . toLookupTag ( ) , firClass . symbol , firClass . origin ) ! ! classCache [ firClass ] = symbol check ( irParent . isExternalParent ( ) ) { \"\" } val irClass = lazyDeclarationsGenerator . createIrLazyClass ( firClass , irParent , symbol ) irClass . prepareTypeParameters ( ) return irClass }","docstring":"/**\n * FIR2IR looks over all non-local source classes and creates IR for them using [createAndCacheIrClass]\n * This means that after this phase all classes are either created and bound to their symbols or external classes,\n * which are created and bound at the first access anyway\n *\n * So, unlike callable declarations, it's safe to expose an API, which returns not just IrClassSymbol, but IrClass itself\n *\n * But on the first FIR2IR stage this API should not be used\n */"} {"signature":"fun collectTailRecursionCalls ( irFunction : IrFunction , followFunctionReference : ( IrFunctionReference ) -> Boolean ) : TailCalls","body":"{ if ( ( irFunction as? IrSimpleFunction ) ? . isTailrec != true ) { return TailCalls ( emptySet ( ) , false ) } class VisitorState ( val isTailExpression : Boolean , val inOtherFunction : Boolean ) val isUnitReturn = irFunction . returnType . isUnit ( ) val result = mutableSetOf < IrCall > ( ) var someCallsAreInOtherFunctions = false val visitor = object : IrElementVisitor < Unit , VisitorState > { override fun visitElement ( element : IrElement , data : VisitorState ) { element . acceptChildren ( this , VisitorState ( isTailExpression = false , data . inOtherFunction ) ) } override fun visitFunction ( declaration : IrFunction , data : VisitorState ) { } override fun visitClass ( declaration : IrClass , data : VisitorState ) { } override fun visitTry ( aTry : IrTry , data : VisitorState ) { } override fun visitReturn ( expression : IrReturn , data : VisitorState ) { expression . value . accept ( this , VisitorState ( expression . returnTargetSymbol == irFunction . symbol , data . inOtherFunction ) ) } override fun visitExpressionBody ( body : IrExpressionBody , data : VisitorState ) = body . acceptChildren ( this , data ) override fun visitBlockBody ( body : IrBlockBody , data : VisitorState ) = visitStatementContainer ( body , data ) override fun visitContainerExpression ( expression : IrContainerExpression , data : VisitorState ) = visitStatementContainer ( expression , data ) private fun visitStatementContainer ( expression : IrStatementContainer , data : VisitorState ) { expression . statements . forEachIndexed { index , irStatement -> val isTailStatement = if ( index == expression . statements . lastIndex ) { data . isTailExpression } else { isUnitReturn && expression . statements [ index + ] . let { it is IrReturn && it . returnTargetSymbol == irFunction . symbol && it . value . isUnitRead ( ) } } irStatement . accept ( this , VisitorState ( isTailStatement , data . inOtherFunction ) ) } } private fun IrExpression . isUnitRead ( ) : Boolean = this is IrGetObjectValue && symbol . isClassWithFqName ( StandardNames . FqNames . unit ) override fun visitWhen ( expression : IrWhen , data : VisitorState ) { expression . branches . forEach { it . condition . accept ( this , VisitorState ( isTailExpression = false , data . inOtherFunction ) ) it . result . accept ( this , data ) } } override fun visitCall ( expression : IrCall , data : VisitorState ) { expression . acceptChildren ( this , VisitorState ( isTailExpression = false , data . inOtherFunction ) ) if ( ! data . isTailExpression || expression . symbol != irFunction . symbol ) { return } if ( irFunction . overriddenSymbols . isNotEmpty ( ) && expression . usesDefaultArguments ( ) ) { return } val hasSameDispatchReceiver = irFunction . dispatchReceiverParameter ? . type ? . classOrNull ? . owner ? . kind ? . isSingleton == true || expression . dispatchReceiver ? . let { it is IrGetValue && it . symbol . owner == irFunction . dispatchReceiverParameter } != false if ( ! hasSameDispatchReceiver ) { return } if ( data . inOtherFunction ) { someCallsAreInOtherFunctions = true } result . add ( expression ) } override fun visitFunctionReference ( expression : IrFunctionReference , data : VisitorState ) { expression . acceptChildren ( this , VisitorState ( isTailExpression = false , data . inOtherFunction ) ) if ( followFunctionReference ( expression ) ) { expression . symbol . owner . body ? . accept ( this , VisitorState ( isTailExpression = false , inOtherFunction = true ) ) } } } irFunction . body ? . accept ( visitor , VisitorState ( isTailExpression = true , inOtherFunction = false ) ) return TailCalls ( result , someCallsAreInOtherFunctions ) }","docstring":"/**\n * Collects calls to be treated as tail recursion.\n * The checks are partially based on the frontend implementation\n * in `ControlFlowInformationProvider.markAndCheckRecursiveTailCalls()`.\n *\n * This analysis is not very precise and can miss some calls.\n * It is also not guaranteed that each returned call is detected as tail recursion by the frontend.\n * However any returned call can be correctly optimized as tail recursion.\n */"} {"signature":"public fun addLayer ( context : LayerContextInterface )","body":"{ checkRequiredAes ( context . requiredAes , context , if ( layersInheritMappings ) { plotContext } else null ) layers . add ( context . toLayer ( layersInheritMappings ) ) }","docstring":"/**\n * Adds a new layer to the plot by converting the provided [LayerContextInterface] into a [Layer]\n * and appending it to the internal layers collection.\n *\n * @param context The [LayerContextInterface] that encapsulates the configurations,\n * aesthetic mappings, and other settings of the layer to be added.\n * The context provides all the necessary information to construct and visualize the layer within the plot.\n *\n * @throws IllegalArgumentException If the required aesthetics for the layer are not present.\n */"} {"signature":"public fun < DomainType > addNonPositionalSetting ( aes : Aes , value : DomainType ) : NonPositionalSetting < DomainType >","body":"{ return NonPositionalSetting ( aes , value ) . also { bindingCollector . settings [ aes ] = it } }","docstring":"/**\n * Adds a [non-positional setting][NonPositionalSetting] with the given aes and value.\n *\n * @param aes the aesthetic attribute (aes) to associate with the non-positional setting.\n * @param value the value of the setting.\n * @return the newly created [NonPositionalSetting] object with the provided aes and value.\n */"} {"signature":"public fun < DomainType > addPositionalSetting ( aes : Aes , value : DomainType ) : PositionalSetting < DomainType >","body":"{ return PositionalSetting ( aes , value ) . also { bindingCollector . settings [ aes ] = it } }","docstring":"/**\n * Adds a [positional setting][PositionalSetting] with the given aes and value.\n *\n * @param aes the aesthetic attribute (aes) to associate with the positional setting.\n * @param value the value of the setting.\n * @return the newly created [PositionalSetting] object with the provided aes and value.\n */"} {"signature":"public fun < DomainType > addPositionalMapping ( aes : Aes , values : List < DomainType > , name : String ? , parameters : PositionalMappingParameters < DomainType > ? ) : PositionalMapping < DomainType >","body":"{ val columnID = datasetHandler . addColumn ( values , name ? : aes . name ) return PositionalMapping ( aes , columnID , parameters ) . also { bindingCollector . mappings [ aes ] = it } }","docstring":"/**\n * Creates and adds a [positional mapping][PositionalMapping] for a given aesthetic attribute\n * ([aes]) and [values].\n *\n * @param aes the aesthetic attribute (aes) to be mapped.\n * @param values the list of values to be mapped.\n * @param name the name of the mapping (optional, defaults to the name of the aes).\n * @param parameters the positional mapping parameters (optional).\n * @return the created [positional mapping][PositionalMapping].\n */"} {"signature":"public fun < DomainType > addPositionalMapping ( aes : Aes , columnID : String , parameters : PositionalMappingParameters < DomainType > ? ) : PositionalMapping < DomainType >","body":"{ val newColumnID = datasetHandler . takeColumn ( columnID ) return PositionalMapping ( aes , newColumnID , parameters ) . also { bindingCollector . mappings [ aes ] = it } }","docstring":"/**\n * Creates and adds a [positional mapping][PositionalMapping] for a given aesthetic attribute\n * ([aes]), [columnID], and [parameters].\n *\n * @param aes the aesthetic attribute (aes) to be mapped.\n * @param columnID the column ID from dataset to be mapped.\n * @param parameters the positional mapping parameters (optional).\n * @return the created [positional mapping][PositionalMapping].\n */"} {"signature":"public fun < DomainType > addPositionalMapping ( aes : Aes , values : DataColumn < DomainType > , parameters : PositionalMappingParameters < DomainType > ? ) : PositionalMapping < DomainType >","body":"{ val columnID = datasetHandler . addColumn ( values ) return PositionalMapping ( aes , columnID , parameters ) . also { bindingCollector . mappings [ aes ] = it } }","docstring":"/**\n * Creates and adds a [positional mapping][PositionalMapping] for a given aesthetic attribute\n * ([aes]), [values], and [parameters].\n *\n * @param aes the aesthetic attribute (aes) to be mapped.\n * @param values the [DataColumn] of values to be mapped.\n * @param parameters the positional mapping parameters (optional).\n * @return the created [positional mapping][PositionalMapping].\n */"} {"signature":"public fun < DomainType , RangeType > addNonPositionalMapping ( aes : Aes , values : List < DomainType > , name : String ? , parameters : NonPositionalMappingParameters < DomainType , RangeType > ? ) : NonPositionalMapping < DomainType , RangeType >","body":"{ val columnID = datasetHandler . addColumn ( values , name ? : aes . name ) return NonPositionalMapping ( aes , columnID , parameters ) . also { bindingCollector . mappings [ aes ] = it } }","docstring":"/**\n * Creates and adds a [non-positional mapping][NonPositionalMapping] for a given aesthetic attribute\n * ([aes]) and [values].\n *\n * @param aes the aesthetic attribute (aes) to be mapped.\n * @param values the list of values to be mapped.\n * @param name the name of the mapping (optional, defaults to the name of the aes).\n * @param parameters the non-positional mapping parameters (optional).\n * @return the created [non-positional mapping][NonPositionalMapping].\n */"} {"signature":"public fun < DomainType , RangeType > addNonPositionalMapping ( aes : Aes , values : DataColumn < DomainType > , parameters : NonPositionalMappingParameters < DomainType , RangeType > ? ) : NonPositionalMapping < DomainType , RangeType >","body":"{ val columnID = datasetHandler . addColumn ( values ) return NonPositionalMapping ( aes , columnID , parameters ) . also { bindingCollector . mappings [ aes ] = it } }","docstring":"/**\n * Creates and adds a [non-positional mapping][NonPositionalMapping] for a given aesthetic attribute\n * ([aes]), [values], and [parameters].\n *\n * @param aes the aesthetic attribute (aes) to be mapped.\n * @param values the [DataColumn] of values to be mapped.\n * @param parameters the non-positional mapping parameters (optional).\n * @return the created [non-positional mapping][NonPositionalMapping].\n */"} {"signature":"public fun < DomainType , RangeType > addNonPositionalMapping ( aes : Aes , columnID : String , parameters : NonPositionalMappingParameters < DomainType , RangeType > ? ) : NonPositionalMapping < DomainType , RangeType >","body":"{ val newColumnID = datasetHandler . takeColumn ( columnID ) return NonPositionalMapping ( aes , newColumnID , parameters ) . also { bindingCollector . mappings [ aes ] = it } }","docstring":"/**\n * Creates and adds a [non-positional mapping][NonPositionalMapping] for a given aesthetic attribute\n * ([aes]), [columnID], and [parameters].\n *\n * @param aes the aesthetic attribute (aes) to be mapped.\n * @param columnID the column ID from dataset to be mapped.\n * @param parameters the non-positional mapping parameters (optional).\n * @return the created [non-positional mapping][NonPositionalMapping].\n */"} {"signature":"public fun < DomainType > addPositionalFreeScale ( aes : Aes , parameters : PositionalMappingParameters < DomainType > )","body":"{ bindingCollector . freeScales [ aes ] = PositionalFreeScale ( aes , parameters ) }","docstring":"/**\n * Adds a [non-positional mapping][NonPositionalMapping] for a given positional aesthetic attribute\n * ([aes]) and [parameters] to [binding collector][BindingCollector].\n *\n * @param aes the positional aesthetic attribute (aes) to be mapped.\n * @param parameters the positional mapping parameters (optional).\n */"} {"signature":"public fun toPlot ( ) : Plot","body":"public fun toPlot ( ) : Plot","docstring":"/**\n * Creates a [Plot] instance based on the current configurations and bindings\n * present within this context.\n *\n * @return A newly instantiated [Plot] configured by the current context.\n */"} {"signature":"public fun toLayer ( layersInheritMappings : Boolean ) : Layer","body":"public fun toLayer ( layersInheritMappings : Boolean ) : Layer","docstring":"/**\n * Produces a [Layer] instance based on the current configurations, bindings, and\n * properties found within this context.\n *\n * @param layersInheritMappings a flag determining whether the resulting layer should inherit mappings from a higher-level context.\n * @return a created [Layer] as configured by this context.\n */"} {"signature":"@ Test fun `test commonizeNativeDistributionTask applied jvm-ecosystem plugin` ( )","body":"{ val rootProject = ProjectBuilder . builder ( ) . build ( ) as ProjectInternal val subproject = ProjectBuilder . builder ( ) . withParent ( rootProject ) . build ( ) as ProjectInternal val jvmEcosystemPluginId = \"\" assertNull ( rootProject . plugins . findPlugin ( jvmEcosystemPluginId ) ) val kotlin = subproject . applyMultiplatformPlugin ( ) assertNull ( rootProject . plugins . findPlugin ( jvmEcosystemPluginId ) ) kotlin . linuxArm64 ( ) kotlin . linuxX64 ( ) rootProject . evaluate ( ) subproject . evaluate ( ) assertNotNull ( rootProject . plugins . findPlugin ( jvmEcosystemPluginId ) ) }","docstring":"/**\n * Check if jvm-ecosystem plugin is applied when commonizer task is applied to the root project.\n * Context: https://github.com/gradle/gradle/issues/20145\n * https://youtrack.jetbrains.com/issue/KT-51583\n */"} {"signature":"public fun < T > size ( 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 `size` 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 > size ( 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 `size` 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 size ( column : String , parameters : LetsPlotNonPositionalMappingParametersContinuous < Any ? , Double > . ( ) -> Unit = { } ) : NonPositionalMapping < Any ? , Double >","body":"{ return addNonPositionalMapping ( SIZE , column , LetsPlotNonPositionalMappingParametersContinuous < Any ? , Double > ( ) . apply ( parameters ) ) }","docstring":"/**\n * Maps the `size` 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 > size ( 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 `size` 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 > size ( 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 `size` 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":"fun noPodspec ( )","body":"{ needPodspec = false }","docstring":"/**\n * Setup plugin not to produce podspec file for cocoapods section\n */"} {"signature":"@ Deprecated ( \"\" , level = DeprecationLevel . ERROR ) fun useLibraries ( )","body":"{ project . kotlinToolingDiagnosticsCollector . report ( project , CocoapodsPluginDiagnostics . UseLibrariesUsed ( ) ) }","docstring":"/**\n * Setup plugin to generate synthetic xcodeproj compatible with static libraries\n */"} {"signature":"fun framework ( configure : Framework . ( ) -> Unit )","body":"{ forAllPodFrameworks ( configure ) }","docstring":"/**\n * Configure framework of the pod built from this project.\n */"} {"signature":"fun framework ( configure : Action < Framework > )","body":"{ forAllPodFrameworks ( configure ) }","docstring":"/**\n * Configure framework of the pod built from this project.\n */"} {"signature":"@ JvmOverloads fun pod ( name : String , version : String ? = null , path : File ? = null , moduleName : String = name . asModuleName ( ) , headers : String ? = null , linkOnly : Boolean = false , )","body":"{ require ( name . isNotEmpty ( ) ) { \"\" } addToPods ( project . objects . newInstance ( CocoapodsDependency :: class . java , name , moduleName ) . apply { this . headers = headers this . version = version source = path ? . let ( :: Path ) this . linkOnly = linkOnly } ) }","docstring":"/**\n * Add a CocoaPods dependency to the pod built from this project.\n *\n * @param linkOnly designates that the pod will be used only for dynamic framework linking and not for the cinterops. Code from it won't\n * be accessible for referencing from Kotlin but its native symbols will be visible while linking the framework.\n */"} {"signature":"fun pod ( name : String , configure : CocoapodsDependency . ( ) -> Unit )","body":"{ require ( name . isNotEmpty ( ) ) { \"\" } val dependency = project . objects . newInstance ( CocoapodsDependency :: class . java , name , name . asModuleName ( ) ) dependency . configure ( ) addToPods ( dependency ) }","docstring":"/**\n * Add a CocoaPods dependency to the pod built from this project.\n */"} {"signature":"fun pod ( name : String , configure : Action < CocoapodsDependency > )","body":"= pod ( name ) { configure . execute ( this ) }","docstring":"/**\n * Add a CocoaPods dependency to the pod built from this project.\n */"} {"signature":"fun specRepos ( configure : SpecRepos . ( ) -> Unit )","body":"= specRepos . configure ( )","docstring":"/**\n * Add spec repositories (note that spec repository is different from usual git repository).\n * Please refer to cocoapods documentation\n * for additional information.\n * Default sources (cdn.cocoapods.org) implicitly included.\n */"} {"signature":"fun specRepos ( configure : Action < SpecRepos > )","body":"= specRepos { configure . execute ( this ) }","docstring":"/**\n * Add spec repositories (note that spec repository is different from usual git repository).\n * Please refer to cocoapods documentation\n * for additional information.\n * Default sources (cdn.cocoapods.org) implicitly included.\n */"} {"signature":"fun useInteropBindingFrom ( podName : String )","body":"{ interopBindingDependencies . add ( podName ) }","docstring":"/**\n * Specify that the pod depends on another pod **podName** and a Kotlin-binding for **podName** should be used while building\n * a binding for the pod. This is necessary if you need to operate entities from **podName** and from the pod together, for\n * instance pass an object from **podName** to the pod in Kotlin.\n *\n * A pod with the exact name must be declared before calling this function.\n *\n * @see interopBindingDependencies\n */"} {"signature":"fun path ( podspecDirectory : String ) : PodLocation","body":"= Path ( File ( podspecDirectory ) )","docstring":"/**\n * Path to local pod\n */"} {"signature":"fun path ( podspecDirectory : File ) : PodLocation","body":"= Path ( podspecDirectory )","docstring":"/**\n * Path to local pod\n */"} {"signature":"@ JvmOverloads fun git ( url : String , configure : ( Git . ( ) -> Unit ) ? = null ) : PodLocation","body":"{ val git = Git ( URI ( url ) ) if ( configure != null ) { git . configure ( ) } return git }","docstring":"/**\n * Configure pod from git repository. The podspec file is expected to be in the repository root.\n */"} {"signature":"fun git ( url : String , configure : Action < Git > )","body":"= git ( url ) { configure . execute ( this ) }","docstring":"/**\n * Configure pod from git repository. The podspec file is expected to be in the repository root.\n */"} {"signature":"fun denseNet169Prediction ( )","body":"{ val modelHub = TFModelHub ( cacheDirectory = File ( \"\" ) ) val modelType = TFModels . CV . DenseNet169 ( ) val model = modelHub . loadModel ( modelType ) val imageNetClassLabels = modelHub . loadClassLabels ( ) model . use { it . compile ( optimizer = Adam ( ) , loss = Losses . MAE , metric = Metrics . ACCURACY ) it . logSummary ( ) val hdfFile = modelHub . loadWeights ( modelType ) val weightPaths = listOf ( LayerConvOrDensePaths ( \"\" , \"\" , \"\" ) , LayerBatchNormPaths ( \"\" , \"\" , \"\" , \"\" , \"\" ) ) it . loadWeightsByPaths ( hdfFile , weightPaths , missedWeights = MissedWeightsStrategy . LOAD_CUSTOM_PATH ) val fileDataLoader = modelType . createPreprocessing ( model ) . fileLoader ( ) for ( i in .. ) { val inputData = fileDataLoader . load ( getFileFromResource ( \"\" ) ) val res = it . predictLabel ( inputData ) println ( \"\" ) val top5 = it . predictTop5Labels ( inputData , imageNetClassLabels ) println ( top5 . toString ( ) ) } } }","docstring":"/**\n * This example demonstrates the inference concept on DenseNet169 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 DenseNet169 during training on ImageNet dataset) is applied to each image before prediction.\n *\n * NOTE: Input resolution is 224*224\n */"} {"signature":"fun main ( ) : Unit","body":"= denseNet169Prediction ( )","docstring":"/** */"} {"signature":"actual abstract override fun add ( element : E ) : Boolean","body":"actual abstract override fun add ( element : E ) : Boolean","docstring":"/**\n * Adds the specified element to the set.\n *\n * @return `true` if the element has been added, `false` if the element is already contained in the set.\n */"} {"signature":"override fun equals ( other : Any ? ) : Boolean","body":"{ if ( other === this ) return true if ( other !is Set < * > ) return false return AbstractSet . setEquals ( this , other ) }","docstring":"/**\n * Compares this set with another set instance with the unordered structural equality.\n *\n * @return `true`, if [other] instance is a [Set] of the same size, all elements of which are contained in this set.\n */"} {"signature":"override fun hashCode ( ) : Int","body":"= AbstractSet . unorderedHashCode ( this )","docstring":"/**\n * Returns the hash code value for this set.\n */"} {"signature":"fun denseNet201Prediction ( )","body":"{ val modelHub = TFModelHub ( cacheDirectory = File ( \"\" ) ) val modelType = TFModels . CV . DenseNet201 ( ) val model = modelHub . loadModel ( modelType ) val imageNetClassLabels = modelHub . loadClassLabels ( ) model . use { it . compile ( optimizer = Adam ( ) , loss = Losses . MAE , metric = Metrics . ACCURACY ) it . logSummary ( ) val hdfFile = modelHub . loadWeights ( modelType ) val weightPaths = listOf ( LayerConvOrDensePaths ( \"\" , \"\" , \"\" ) , LayerBatchNormPaths ( \"\" , \"\" , \"\" , \"\" , \"\" ) ) it . loadWeightsByPaths ( hdfFile , weightPaths , missedWeights = MissedWeightsStrategy . LOAD_CUSTOM_PATH ) val fileDataLoader = modelType . createPreprocessing ( it ) . fileLoader ( ) for ( i in .. ) { val inputData = fileDataLoader . load ( getFileFromResource ( \"\" ) ) val res = it . predictLabel ( inputData ) println ( \"\" ) val top5 = it . predictTop5Labels ( inputData , imageNetClassLabels ) println ( top5 . toString ( ) ) } } }","docstring":"/**\n * This example demonstrates the inference concept on DenseNet201 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 DenseNet201 during training on ImageNet dataset) is applied to each image before prediction.\n *\n * NOTE: Input resolution is 224*224\n */"} {"signature":"fun main ( ) : Unit","body":"= denseNet201Prediction ( )","docstring":"/** */"} {"signature":"private fun layerVariables ( ) : List < KVariable >","body":"= layers . variables ( )","docstring":"/**\n * Returns a list of layer variables in this model.\n */"} {"signature":"private fun frozenLayerVariables ( ) : List < KVariable >","body":"= layers . frozenVariables ( )","docstring":"/**\n * Returns a list of non-trainable, 'frozen' layer variables in this model.\n */"} {"signature":"protected abstract fun buildLayers ( training : Operand < Boolean > , numberOfLosses : Operand < Float > ) : Pair < Placeholder < Float > , Operand < Float > >","body":"protected abstract fun buildLayers ( training : Operand < Boolean > , numberOfLosses : Operand < Float > ) : Pair < Placeholder < Float > , Operand < Float > >","docstring":"/** Common method for building model static graph layer by layer via calling build() method on each layer in correct order. */"} {"signature":"public fun init ( )","body":"{ check ( isModelCompiled ) { \"\" } check ( ! isModelInitialized ) { \"\" } check ( ! isOptimizerVariableInitialized ) { \"\" } logger . debug { \"\" } layers . initializeVariables ( session ) isModelInitialized = true }","docstring":"/**\n * Initializes kGraph variables.\n *\n * NOTE: The model becomes initialized after this method call. The flag [isModelInitialized] is set to True.\n */"} {"signature":"public fun reset ( )","body":"{ check ( isModelCompiled ) { \"\" } logger . debug { \"\" } layers . initializeVariables ( session ) isModelInitialized = true isOptimizerVariableInitialized = false }","docstring":"/**\n * It ignores that model is initialized already and call initializers under the hood to re-initialize [kGraph] variables.\n *\n * NOTE: The model becomes initialized after this method call.\n * The flag [isModelInitialized] is set to True and the flag [isOptimizerVariableInitialized] is set to False.\n * As a result, when the method ```fit()``` will be called, optimizer variables are re-initialized.\n */"} {"signature":"private fun getLossAndMetricValues ( batch : DataBatch , isTraining : Boolean ) : Pair < Float , List < Float > >","body":"{ val yBatchShape = longArrayOf ( batch . size . toLong ( ) , numberOfClasses ) val inputs = mapOf ( xOp to batch . toXTensor ( ) , yTrueOp to Tensor . create ( yBatchShape , serializeLabelsToBuffer ( batch . y , numberOfClasses ) ) , numberOfLossesOp to Tensor . create ( TensorShape ( yBatchShape ) . numElements ( ) . toFloat ( ) ) , training to Tensor . create ( isTraining ) ) val outputs = listOf ( OutputKey . Name ( TRAINING_LOSS ) ) + metricOps . map ( OutputKey :: Operand ) val targetsList = if ( isTraining ) targets else emptyList ( ) return runModelInternal ( inputs , outputs , targetsList ) { tensors -> check ( tensors . size == metricOps . size + ) { \"\" } tensors . first ( ) . floatValue ( ) to tensors . drop ( ) . map { it . floatValue ( ) } } }","docstring":"/**\n * Returns the loss value and metric value on train batch.\n */"} {"signature":"public fun kGraph ( ) : KGraph","body":"{ return kGraph }","docstring":"/**\n * Returns KGraph.\n *\n * NOTE: Be careful, this is direct access to the model graph, not a copy.\n */"} {"signature":"protected fun saveVariables ( pathToModelDirectory : String , saveOptimizerState : Boolean )","body":"{ val variablesAndTensors = getVariablesAndTensors ( saveOptimizerState ) Files . createDirectories ( Paths . get ( pathToModelDirectory ) ) val file = File ( \"\" ) file . bufferedWriter ( ) . use { variableNamesFile -> for ( ( variable , tensorForCopying ) in variablesAndTensors ) { val variableName = variable . asOutput ( ) . op ( ) . name ( ) variableNamesFile . write ( variableName ) variableNamesFile . newLine ( ) val variableNameFile = File ( \"\" ) variableNameFile . bufferedWriter ( ) . use { file -> tensorForCopying . use { val reshaped = tensorForCopying . toFloatArray ( ) for ( i in .. reshaped . size - ) { file . write ( reshaped [ i ] . toString ( ) + \"\" ) } file . write ( reshaped [ reshaped . size - ] . toString ( ) ) file . flush ( ) } } variableNamesFile . flush ( ) } } }","docstring":"/** Saves variables and optimizer state if [saveOptimizerState] is enabled in txt format to the [pathToModelDirectory] directory.*/"} {"signature":"private fun getVariablesAndTensors ( saveOptimizerState : Boolean ) : List < Pair < Variable < Float > , Tensor < * > > >","body":"{ var variables = layerVariables ( ) . map { it . variable } if ( saveOptimizerState ) { variables = variables + kGraph . optimizerVariables ( ) } val modelWeightsExtractorRunner = session . runner ( ) variables . forEach ( modelWeightsExtractorRunner :: fetch ) return variables . zip ( modelWeightsExtractorRunner . run ( ) ) }","docstring":"/** Returns a list of variables paired with their data. */"} {"signature":"private fun isVariableRelatedToFrozenLayer ( variableName : String ) : Boolean","body":"{ return frozenLayerVariables ( ) . map { it . name } . any { variableName . contains ( it ) } }","docstring":"/** Check that the variable with the name [variableName] belongs to the frozen layer. */"} {"signature":"protected override fun loadVariables ( variableNames : Collection < String > , getData : ( String , Shape ) -> Any )","body":"{ val layerVariablesByName = layerVariables ( ) . associateBy { it . name } for ( variableName in variableNames ) { val variableOperation = kGraph . tfGraph . operation ( variableName ) check ( variableOperation != null ) { \"\" } val variableShape = variableOperation . output < Float > ( ) . shape ( ) val data = getData ( variableName , variableShape ) val variable = layerVariablesByName [ variableName ] if ( variable != null ) { fill ( variable , data ) } else { 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":"public infix fun getLayer ( layerName : String ) : Layer","body":"{ return layersByName [ layerName ] ? : error ( \"\" ) }","docstring":"/**\n * Return layer by [layerName].\n *\n * @param [layerName] Should be existing layer name. Throws an error otherwise.\n */"} {"signature":"public fun GraphTrainableModel . freeze ( )","body":"{ layers . forEach ( Layer :: freeze ) }","docstring":"/**\n * Freezes weights in all layers in this model, so they won't be changed during training.\n * @see [Layer.freeze]\n */"} {"signature":"public actual fun ComplexDouble ( re : Double , im : Double ) : ComplexDouble","body":"= JsComplexDouble ( re , im )","docstring":"/**\n * Creates a [ComplexDouble] with the given real and imaginary values in floating-point format.\n *\n * @param re the real value of the complex number in double format.\n * @param im the imaginary value of the complex number in double format.\n */"} {"signature":"public actual fun ComplexDouble ( re : Number , im : Number ) : ComplexDouble","body":"= ComplexDouble ( re . toDouble ( ) , im . toDouble ( ) )","docstring":"/**\n * Creates a [ComplexDouble] with the given real and imaginary values in number format.\n *\n * @param re the real value of the complex number in number format.\n * @param im the imaginary value of the complex number in number format.\n */"} {"signature":"@ Suppress ( \"\" ) fun tryEvaluateSpecialCall ( callSite : IrFunctionAccessExpression , resultSlot : LLVMValueRef ? ) : LLVMValueRef ?","body":"{ val function = callSite . symbol . owner if ( ! function . isTypedIntrinsic ) { return null } return when ( getIntrinsicType ( callSite ) ) { IntrinsicType . IMMUTABLE_BLOB -> { @ Suppress ( \"\" ) val arg = callSite . getValueArgument ( ) as IrConst < String > codegen . llvm . staticData . createImmutableBlob ( arg ) } IntrinsicType . OBJC_GET_SELECTOR -> { val selector = ( callSite . getValueArgument ( ) as IrConst < * > ) . value as String environment . functionGenerationContext . genObjCSelector ( selector ) } IntrinsicType . INIT_INSTANCE -> { val initializer = callSite . getValueArgument ( ) as IrConstructorCall val thiz = environment . evaluateExpression ( callSite . getValueArgument ( ) ! ! , null ) environment . evaluateCall ( initializer . symbol . owner , listOf ( thiz ) + environment . evaluateExplicitArgs ( initializer ) , environment . calculateLifetime ( initializer ) , ) codegen . theUnitInstanceRef . llvm } else -> null } }","docstring":"/**\n * Some intrinsics have to be processed before evaluation of their arguments.\n * So this method looks at [callSite] and if it is call to \"special\" intrinsic\n * processes it. Otherwise, it returns null.\n */"} {"signature":"internal suspend fun Project . isPluginApplied ( pluginId : String ) : Boolean","body":"{ val result = CompletableFuture < Boolean > ( ) pluginManager . withPlugin ( pluginId ) { check ( ! result . isCompleted ) { \"\" } result . complete ( true ) } launchInStage ( AfterEvaluateBuildscript ) { if ( ! result . isCompleted ) result . complete ( false ) } return result . await ( ) }","docstring":"/**\n * Returns true as soon as Gradle plugin with [pluginId] is applied.\n * Returns false if plugin wasn't applied during\n */"} {"signature":"fun JDialog . takeScreenshot ( ) : BufferedImage ?","body":"{ return rootPane . takeScreenshot ( ) }","docstring":"/**\n * Takes a screenshot of a [JDialog].\n */"} {"signature":"fun JFrame . takeScreenshot ( ) : BufferedImage ?","body":"{ return rootPane . takeScreenshot ( ) }","docstring":"/**\n * Takes a screenshot of a [JFrame].\n */"} {"signature":"fun JComponent . takeScreenshot ( ) : BufferedImage ?","body":"{ try { val config : GraphicsConfiguration ? = graphicsConfiguration val scaleFactor : Double = config ? . defaultTransform ? . scaleX ? : if ( ! isVisible || width == || height == ) return null val image = BufferedImage ( ( width * scaleFactor ) . toInt ( ) , ( height * scaleFactor ) . toInt ( ) , BufferedImage . TYPE_INT_ARGB ) with ( image . createGraphics ( ) ) { setRenderingHint ( RenderingHints . KEY_INTERPOLATION , RenderingHints . VALUE_INTERPOLATION_BILINEAR ) setRenderingHint ( RenderingHints . KEY_RENDERING , RenderingHints . VALUE_RENDER_QUALITY ) setRenderingHint ( RenderingHints . KEY_ANTIALIASING , RenderingHints . VALUE_ANTIALIAS_ON ) scale ( scaleFactor , scaleFactor ) paint ( this ) dispose ( ) } return image } catch ( ignore : Throwable ) { return null } }","docstring":"/**\n * Takes a screenshot of the Swing component. This is only possible if the\n * component has been given a size, see [JComponent.getSize]. Either manually\n * or through a [java.awt.LayoutManager].\n *\n * If the size of the component cannot be determined, `null` is returned.\n */"} {"signature":"public fun openSubscription ( ) : ReceiveChannel < E >","body":"public fun openSubscription ( ) : ReceiveChannel < E >","docstring":"/**\n * Subscribes to this [BroadcastChannel] and returns a channel to receive elements from it.\n * The resulting channel shall be [cancelled][ReceiveChannel.cancel] to unsubscribe from this\n * broadcast channel.\n */"} {"signature":"public fun cancel ( cause : CancellationException ? = null )","body":"public fun cancel ( cause : CancellationException ? = null )","docstring":"/**\n * Cancels reception of remaining elements from this channel with an optional cause.\n * This function closes the channel with\n * the specified cause (unless it was already closed), removes all buffered sent elements from it,\n * and [cancels][ReceiveChannel.cancel] all open subscriptions.\n * A cause can be used to specify an error message or to provide other details on\n * a cancellation reason for debugging purposes.\n */"} {"signature":"@ Deprecated ( level = DeprecationLevel . HIDDEN , message = \"\" ) public fun cancel ( cause : Throwable ? = null ) : Boolean","body":"@ Deprecated ( level = DeprecationLevel . HIDDEN , message = \"\" ) public fun cancel ( cause : Throwable ? = null ) : Boolean","docstring":"/**\n * @suppress This method has bad semantics when cause is not a [CancellationException]. Use [cancel].\n */"} {"signature":"@ ObsoleteCoroutinesApi @ Deprecated ( level = DeprecationLevel . WARNING , message = \"\" ) public fun < E > BroadcastChannel ( capacity : Int ) : BroadcastChannel < E >","body":"= when ( capacity ) { -> throw IllegalArgumentException ( \"\" ) UNLIMITED -> throw IllegalArgumentException ( \"\" ) CONFLATED -> ConflatedBroadcastChannel ( ) BUFFERED -> BroadcastChannelImpl ( CHANNEL_DEFAULT_CAPACITY ) else -> BroadcastChannelImpl ( capacity ) }","docstring":"/**\n * Creates a broadcast channel with the specified buffer capacity.\n *\n * The resulting channel type depends on the specified [capacity] parameter:\n *\n * - when `capacity` positive, but less than [UNLIMITED] -- creates `ArrayBroadcastChannel` with a buffer of given capacity.\n * **Note:** this channel looses all items that have been sent to it until the first subscriber appears;\n * - when `capacity` is [CONFLATED] -- creates [ConflatedBroadcastChannel] that conflates back-to-back sends;\n * - when `capacity` is [BUFFERED] -- creates `ArrayBroadcastChannel` with a default capacity.\n * - otherwise -- throws [IllegalArgumentException].\n *\n * **Note: This API is obsolete since 1.5.0 and deprecated for removal since 1.7.0**\n * It is replaced with [SharedFlow][kotlinx.coroutines.flow.SharedFlow] and [StateFlow][kotlinx.coroutines.flow.StateFlow].\n */"} {"signature":"override suspend fun send ( element : E )","body":"{ val subs = lock . withLock { if ( isClosedForSend ) throw sendException if ( capacity == CONFLATED ) lastConflatedElement = element subscribers } subs . forEach { val success = it . sendBroadcast ( element ) if ( ! success && isClosedForSend ) throw sendException } }","docstring":"/**\n * Sends the specified element to all subscribers.\n *\n * **!!! THIS IMPLEMENTATION IS NOT LINEARIZABLE !!!**\n *\n * As the operation should send the element to multiple\n * subscribers simultaneously, it is non-trivial to\n * implement it in an atomic way. Specifically, this\n * would require a special implementation that does\n * not transfer the element until all parties are able\n * to resume it (this `send(..)` can be cancelled\n * or the broadcast can become closed in the meantime).\n * As broadcasts are obsolete, we keep this implementation\n * as simple as possible, allowing non-linearizability\n * in corner cases.\n */"} {"signature":"fun main ( )","body":"{ val preprocessing = pipeline < BufferedImage > ( ) . convert { colorMode = ColorMode . BGR } . toFloatArray { } . rescale { scalingCoefficient = } val ( cifarImagesArchive , cifarLabelsArchive ) = cifar10Paths ( ) val y = extractCifar10LabelsAnsSort ( cifarLabelsArchive ) val dataset = OnHeapDataset . 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 * - [OnHeapDataset] dataset creation\n * - dataset splitting\n * - model compilation\n * - model training\n * - model export\n * - model evaluation\n */"} {"signature":"override fun lower ( irClass : IrClass )","body":"{ if ( ! context . config . languageVersionSettings . supportsFeature ( LanguageFeature . ExtendedMainConvention ) ) return if ( ! irClass . isFileClass ) return irClass . functions . find { it . isMainMethod ( ) } ? . let { mainMethod -> if ( mainMethod . isSuspend ) { irClass . generateMainMethod { newMain , args -> + irRunSuspend ( mainMethod , args , newMain ) } } return } irClass . functions . find { it . isParameterlessMainMethod ( ) } ? . let { parameterlessMainMethod -> irClass . generateMainMethod { newMain , _ -> if ( parameterlessMainMethod . isSuspend ) { + irRunSuspend ( parameterlessMainMethod , null , newMain ) } else { + irCall ( parameterlessMainMethod ) } } } }","docstring":"/**\n * This pass finds extended main methods and introduces a regular\n * `public static void main(String[] args)` entry point, as appropriate:\n * - invocation via [kotlin.coroutines.jvm.internal.runSuspend] suspend main methods.\n * - a simple delegating wrapper for parameterless main methods\n *\n * There are three cases that must be handled, in order of precedence:\n *\n * 1. `suspend fun main(args: Array) { .. }` for which we generate\n * ```\n * fun main(args: Array) {\n * runSuspend { main(args) }\n * }\n * ```\n *\n * 2. `suspend fun main() { .. }` for which we generate\n * ```\n * fun main(args: Array) {\n * runSuspend { main() }\n * }\n * ```\n *\n * 3. `fun main() { .. }` for which we generate\n * ```\n * fun main(args: Array) {\n * main()\n * }\n * ```\n */"} {"signature":"fun runTest ( @ TestDataFile testDataFilePath : String )","body":"{ val absoluteTestFile = getAbsoluteFile ( testDataFilePath ) val testCaseId = TestCaseId . TestDataFile ( absoluteTestFile ) try { runTestCase ( testCaseId ) } catch ( e : CompilationToolException ) { if ( testRunSettings . isIgnoredTarget ( absoluteTestFile ) ) println ( \"\" ) else fail { e . reason } } }","docstring":"/**\n * Run JUnit test.\n *\n * This function should be called from a method annotated with [org.junit.jupiter.api.Test].\n */"} {"signature":"internal fun runTestCase ( testCaseId : TestCaseId )","body":"{ val testRun = testRunProvider . getSingleTestRun ( testCaseId , testRunSettings ) performTestRun ( testRun ) }","docstring":"/**\n * Run JUnit test.\n *\n * This function should be called from a method annotated with [org.junit.jupiter.api.Test].\n */"} {"signature":"fun dynamicTest ( @ TestDataFile testDataFilePath : String ) : Collection < DynamicNode >","body":"{ val testCaseId = TestCaseId . TestDataFile ( getAbsoluteFile ( testDataFilePath ) ) return dynamicTestCase ( testCaseId ) }","docstring":"/**\n * Run JUnit dynamic test.\n *\n * This function should be called from a method annotated with [org.junit.jupiter.api.TestFactory].\n */"} {"signature":"internal fun dynamicTestCase ( testCaseId : TestCaseId ) : Collection < DynamicNode >","body":"{ val testRunNodes = testRunProvider . getTestRuns ( testCaseId , testRunSettings ) return buildJUnitDynamicNodes ( testRunNodes ) }","docstring":"/**\n * Run JUnit dynamic test.\n *\n * This function should be called from a method annotated with [org.junit.jupiter.api.TestFactory].\n */"} {"signature":"override fun toString ( ) : String","body":"{ return \"\" }","docstring":"/**\n * Returns the String representation of this KmVersionRequirement object, consisting of\n * [kind], [level], [version], [errorCode], and [message].\n */"} {"signature":"override fun toString ( ) : String","body":"= \"\"","docstring":"/**\n * Returns the String representation of this KmVersionRequirement object, consisting of\n * [kind], [level], [version], [errorCode], and [message].\n */"} {"signature":"@ SinceKotlin ( \"\" ) public expect fun Int . countOneBits ( ) : Int","body":"@ SinceKotlin ( \"\" ) public expect fun Int . countOneBits ( ) : Int","docstring":"/**\n * Counts the number of set bits in the binary representation of this [Int] number.\n */"} {"signature":"@ SinceKotlin ( \"\" ) public expect fun Int . countLeadingZeroBits ( ) : Int","body":"@ SinceKotlin ( \"\" ) public expect fun Int . countLeadingZeroBits ( ) : Int","docstring":"/**\n * Counts the number of consecutive most significant bits that are zero in the binary representation of this [Int] number.\n */"} {"signature":"@ SinceKotlin ( \"\" ) public expect fun Int . countTrailingZeroBits ( ) : Int","body":"@ SinceKotlin ( \"\" ) public expect fun Int . countTrailingZeroBits ( ) : Int","docstring":"/**\n * Counts the number of consecutive least significant bits that are zero in the binary representation of this [Int] number.\n */"} {"signature":"@ SinceKotlin ( \"\" ) public expect fun Int . takeHighestOneBit ( ) : Int","body":"@ SinceKotlin ( \"\" ) public expect fun Int . takeHighestOneBit ( ) : Int","docstring":"/**\n * Returns a number having a single bit set in the position of the most significant set bit of this [Int] number,\n * or zero, if this number is zero.\n */"} {"signature":"@ SinceKotlin ( \"\" ) public expect fun Int . takeLowestOneBit ( ) : Int","body":"@ SinceKotlin ( \"\" ) public expect fun Int . takeLowestOneBit ( ) : Int","docstring":"/**\n * Returns a number having a single bit set in the position of the least significant set bit of this [Int] number,\n * or zero, if this number is zero.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalStdlibApi :: class ) public expect fun Int . rotateLeft ( bitCount : Int ) : Int","body":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalStdlibApi :: class ) public expect fun Int . rotateLeft ( bitCount : Int ) : Int","docstring":"/**\n * Rotates the binary representation of this [Int] number left by the specified [bitCount] number of bits.\n * The most significant bits pushed out from the left side reenter the number as the least significant bits on the right side.\n *\n * Rotating the number left by a negative bit count is the same as rotating it right by the negated bit count:\n * `number.rotateLeft(-n) == number.rotateRight(n)`\n *\n * Rotating by a multiple of [Int.SIZE_BITS] (32) returns the same number, or more generally\n * `number.rotateLeft(n) == number.rotateLeft(n % 32)`\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalStdlibApi :: class ) public expect fun Int . rotateRight ( bitCount : Int ) : Int","body":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalStdlibApi :: class ) public expect fun Int . rotateRight ( bitCount : Int ) : Int","docstring":"/**\n * Rotates the binary representation of this [Int] number right by the specified [bitCount] number of bits.\n * The least significant bits pushed out from the right side reenter the number as the most significant bits on the left side.\n *\n * Rotating the number right by a negative bit count is the same as rotating it left by the negated bit count:\n * `number.rotateRight(-n) == number.rotateLeft(n)`\n *\n * Rotating by a multiple of [Int.SIZE_BITS] (32) returns the same number, or more generally\n * `number.rotateRight(n) == number.rotateRight(n % 32)`\n */"} {"signature":"@ SinceKotlin ( \"\" ) public expect fun Long . countOneBits ( ) : Int","body":"@ SinceKotlin ( \"\" ) public expect fun Long . countOneBits ( ) : Int","docstring":"/**\n * Counts the number of set bits in the binary representation of this [Long] number.\n */"} {"signature":"@ SinceKotlin ( \"\" ) public expect fun Long . countLeadingZeroBits ( ) : Int","body":"@ SinceKotlin ( \"\" ) public expect fun Long . countLeadingZeroBits ( ) : Int","docstring":"/**\n * Counts the number of consecutive most significant bits that are zero in the binary representation of this [Long] number.\n */"} {"signature":"@ SinceKotlin ( \"\" ) public expect fun Long . countTrailingZeroBits ( ) : Int","body":"@ SinceKotlin ( \"\" ) public expect fun Long . countTrailingZeroBits ( ) : Int","docstring":"/**\n * Counts the number of consecutive least significant bits that are zero in the binary representation of this [Long] number.\n */"} {"signature":"@ SinceKotlin ( \"\" ) public expect fun Long . takeHighestOneBit ( ) : Long","body":"@ SinceKotlin ( \"\" ) public expect fun Long . takeHighestOneBit ( ) : Long","docstring":"/**\n * Returns a number having a single bit set in the position of the most significant set bit of this [Long] number,\n * or zero, if this number is zero.\n */"} {"signature":"@ SinceKotlin ( \"\" ) public expect fun Long . takeLowestOneBit ( ) : Long","body":"@ SinceKotlin ( \"\" ) public expect fun Long . takeLowestOneBit ( ) : Long","docstring":"/**\n * Returns a number having a single bit set in the position of the least significant set bit of this [Long] number,\n * or zero, if this number is zero.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalStdlibApi :: class ) public expect fun Long . rotateLeft ( bitCount : Int ) : Long","body":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalStdlibApi :: class ) public expect fun Long . rotateLeft ( bitCount : Int ) : Long","docstring":"/**\n * Rotates the binary representation of this [Long] number left by the specified [bitCount] number of bits.\n * The most significant bits pushed out from the left side reenter the number as the least significant bits on the right side.\n *\n * Rotating the number left by a negative bit count is the same as rotating it right by the negated bit count:\n * `number.rotateLeft(-n) == number.rotateRight(n)`\n *\n * Rotating by a multiple of [Long.SIZE_BITS] (64) returns the same number, or more generally\n * `number.rotateLeft(n) == number.rotateLeft(n % 64)`\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalStdlibApi :: class ) public expect fun Long . rotateRight ( bitCount : Int ) : Long","body":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalStdlibApi :: class ) public expect fun Long . rotateRight ( bitCount : Int ) : Long","docstring":"/**\n * Rotates the binary representation of this [Long] number right by the specified [bitCount] number of bits.\n * The least significant bits pushed out from the right side reenter the number as the most significant bits on the left side.\n *\n * Rotating the number right by a negative bit count is the same as rotating it left by the negated bit count:\n * `number.rotateRight(-n) == number.rotateLeft(n)`\n *\n * Rotating by a multiple of [Long.SIZE_BITS] (64) returns the same number, or more generally\n * `number.rotateRight(n) == number.rotateRight(n % 64)`\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . internal . InlineOnly public inline fun Byte . countOneBits ( ) : Int","body":"= ( toInt ( ) and ) . countOneBits ( )","docstring":"/**\n * Counts the number of set bits in the binary representation of this [Byte] number.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . internal . InlineOnly public inline fun Byte . countLeadingZeroBits ( ) : Int","body":"= ( toInt ( ) and ) . countLeadingZeroBits ( ) - ( Int . SIZE_BITS - Byte . SIZE_BITS )","docstring":"/**\n * Counts the number of consecutive most significant bits that are zero in the binary representation of this [Byte] number.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . internal . InlineOnly public inline fun Byte . countTrailingZeroBits ( ) : Int","body":"= ( toInt ( ) or ) . countTrailingZeroBits ( )","docstring":"/**\n * Counts the number of consecutive least significant bits that are zero in the binary representation of this [Byte] number.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . internal . InlineOnly public inline fun Byte . takeHighestOneBit ( ) : Byte","body":"= ( toInt ( ) and ) . takeHighestOneBit ( ) . toByte ( )","docstring":"/**\n * Returns a number having a single bit set in the position of the most significant set bit of this [Byte] number,\n * or zero, if this number is zero.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . internal . InlineOnly public inline fun Byte . takeLowestOneBit ( ) : Byte","body":"= toInt ( ) . takeLowestOneBit ( ) . toByte ( )","docstring":"/**\n * Returns a number having a single bit set in the position of the least significant set bit of this [Byte] number,\n * or zero, if this number is zero.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalStdlibApi :: class ) public fun Byte . rotateLeft ( bitCount : Int ) : Byte","body":"= ( toInt ( ) . shl ( bitCount and ) or ( toInt ( ) and ) . ushr ( - ( bitCount and ) ) ) . toByte ( )","docstring":"/**\n * Rotates the binary representation of this [Byte] number left by the specified [bitCount] number of bits.\n * The most significant bits pushed out from the left side reenter the number as the least significant bits on the right side.\n *\n * Rotating the number left by a negative bit count is the same as rotating it right by the negated bit count:\n * `number.rotateLeft(-n) == number.rotateRight(n)`\n *\n * Rotating by a multiple of [Byte.SIZE_BITS] (8) returns the same number, or more generally\n * `number.rotateLeft(n) == number.rotateLeft(n % 8)`\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalStdlibApi :: class ) public fun Byte . rotateRight ( bitCount : Int ) : Byte","body":"= ( toInt ( ) . shl ( - ( bitCount and ) ) or ( toInt ( ) and ) . ushr ( bitCount and ) ) . toByte ( )","docstring":"/**\n * Rotates the binary representation of this [Byte] number right by the specified [bitCount] number of bits.\n * The least significant bits pushed out from the right side reenter the number as the most significant bits on the left side.\n *\n * Rotating the number right by a negative bit count is the same as rotating it left by the negated bit count:\n * `number.rotateRight(-n) == number.rotateLeft(n)`\n *\n * Rotating by a multiple of [Byte.SIZE_BITS] (8) returns the same number, or more generally\n * `number.rotateRight(n) == number.rotateRight(n % 8)`\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . internal . InlineOnly public inline fun Short . countOneBits ( ) : Int","body":"= ( toInt ( ) and ) . countOneBits ( )","docstring":"/**\n * Counts the number of set bits in the binary representation of this [Short] number.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . internal . InlineOnly public inline fun Short . countLeadingZeroBits ( ) : Int","body":"= ( toInt ( ) and ) . countLeadingZeroBits ( ) - ( Int . SIZE_BITS - Short . SIZE_BITS )","docstring":"/**\n * Counts the number of consecutive most significant bits that are zero in the binary representation of this [Short] number.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . internal . InlineOnly public inline fun Short . countTrailingZeroBits ( ) : Int","body":"= ( toInt ( ) or ) . countTrailingZeroBits ( )","docstring":"/**\n * Counts the number of consecutive least significant bits that are zero in the binary representation of this [Short] number.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . internal . InlineOnly public inline fun Short . takeHighestOneBit ( ) : Short","body":"= ( toInt ( ) and ) . takeHighestOneBit ( ) . toShort ( )","docstring":"/**\n * Returns a number having a single bit set in the position of the most significant set bit of this [Short] number,\n * or zero, if this number is zero.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . internal . InlineOnly public inline fun Short . takeLowestOneBit ( ) : Short","body":"= toInt ( ) . takeLowestOneBit ( ) . toShort ( )","docstring":"/**\n * Returns a number having a single bit set in the position of the least significant set bit of this [Short] number,\n * or zero, if this number is zero.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalStdlibApi :: class ) public fun Short . rotateLeft ( bitCount : Int ) : Short","body":"= ( toInt ( ) . shl ( bitCount and ) or ( toInt ( ) and ) . ushr ( - ( bitCount and ) ) ) . toShort ( )","docstring":"/**\n * Rotates the binary representation of this [Short] number left by the specified [bitCount] number of bits.\n * The most significant bits pushed out from the left side reenter the number as the least significant bits on the right side.\n *\n * Rotating the number left by a negative bit count is the same as rotating it right by the negated bit count:\n * `number.rotateLeft(-n) == number.rotateRight(n)`\n *\n * Rotating by a multiple of [Short.SIZE_BITS] (16) returns the same number, or more generally\n * `number.rotateLeft(n) == number.rotateLeft(n % 16)`\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalStdlibApi :: class ) public fun Short . rotateRight ( bitCount : Int ) : Short","body":"= ( toInt ( ) . shl ( - ( bitCount and ) ) or ( toInt ( ) and ) . ushr ( bitCount and ) ) . toShort ( )","docstring":"/**\n * Rotates the binary representation of this [Short] number right by the specified [bitCount] number of bits.\n * The least significant bits pushed out from the right side reenter the number as the most significant bits on the left side.\n *\n * Rotating the number right by a negative bit count is the same as rotating it left by the negated bit count:\n * `number.rotateRight(-n) == number.rotateLeft(n)`\n *\n * Rotating by a multiple of [Short.SIZE_BITS] (16) returns the same number, or more generally\n * `number.rotateRight(n) == number.rotateRight(n % 16)`\n */"} {"signature":"protected open fun shouldSkipTest ( filePath : String , configuration : TestConfiguration ) : Boolean","body":"= false","docstring":"/**\n * Consider [org.jetbrains.kotlin.test.model.AfterAnalysisChecker.suppressIfNeeded] firstly\n */"} {"signature":"protected fun assertLayerOutputIsCorrect ( layer : Layer , input : Array < * > , expectedOutput : Array < * > , runMode : RunMode = RunMode . EAGER , )","body":"{ val output = when ( runMode ) { RunMode . EAGER -> runLayerInEagerMode ( layer , input ) RunMode . GRAPH -> runLayerInGraphMode ( layer , input ) } output . use { val outputShape = output . shape ( ) val expectedShape = expectedOutput . shape . toLongArray ( ) assertArrayEquals ( expectedShape , outputShape ) val result = it . toFloatArray ( ) val expected = expectedOutput . flattenFloats ( ) assertArrayEquals ( expected , result ) } }","docstring":"/**\n * Checks the output of a layer given the input data is equal to the expected output.\n *\n * This takes care of building and running the layer instance ([layer]), in either of\n * Eager or Graph mode execution ([runMode]) to verify the output of layer for the given\n * input data ([input]), is equal to the expected output ([expectedOutput]).\n *\n * Note that this method could be used for a layer with any input/output dimensionality.\n */"} {"signature":"protected fun assertLayerComputedOutputShape ( layer : Layer , expectedOutputShape : LongArray )","body":"{ assertArrayEquals ( expectedOutputShape , layer . outputShape . dims ( ) , \"\" , ) }","docstring":"/**\n * Checks the computed output shape of layer is equal to the expected output shape.\n */"} {"signature":"public fun isApplicableForDefinedLanguage ( language : String ) : Boolean","body":"public fun isApplicableForDefinedLanguage ( language : String ) : Boolean","docstring":"/**\n * Whether this renderer supports rendering Markdown code blocks\n * for the given [language] explicitly specified in the fenced code block definition,\n */"} {"signature":"public fun isApplicableForUndefinedLanguage ( code : String ) : Boolean","body":"public fun isApplicableForUndefinedLanguage ( code : String ) : Boolean","docstring":"/**\n * Whether this renderer supports rendering Markdown code blocks\n * for the given [code] when language is not specified in fenced code blocks\n * or indented code blocks are used.\n */"} {"signature":"public fun FlowContent . buildCodeBlock ( language : String ? , code : String )","body":"public fun FlowContent . buildCodeBlock ( language : String ? , code : String )","docstring":"/**\n * Defines how to render [code] for specified [language] via HTML tags.\n *\n * The value of the [language] will be the same as in the input Markdown fenced code block definition.\n * In the following example [language] = `kotlin` and [code] = `val a`:\n * ~~~markdown\n * ```kotlin\n * val a\n * ```\n * ~~~\n * The value of the [language] will be `null` if language is not specified in the fenced code block definition\n * or indented code blocks are used.\n * In the following example [language] = `null` and [code] = `val a`:\n * ~~~markdown\n * ```\n * val a\n * ```\n * ~~~\n */"} {"signature":"@ kotlin . internal . InlineOnly public inline fun File . reader ( charset : Charset = Charsets . UTF_8 ) : InputStreamReader","body":"= inputStream ( ) . reader ( charset )","docstring":"/**\n * Returns a new [FileReader] for reading the content of this file.\n */"} {"signature":"@ kotlin . internal . InlineOnly public inline fun File . bufferedReader ( charset : Charset = Charsets . UTF_8 , bufferSize : Int = DEFAULT_BUFFER_SIZE ) : BufferedReader","body":"= reader ( charset ) . buffered ( bufferSize )","docstring":"/**\n * Returns a new [BufferedReader] for reading the content of this file.\n *\n * @param bufferSize necessary size of the buffer.\n */"} {"signature":"@ kotlin . internal . InlineOnly public inline fun File . writer ( charset : Charset = Charsets . UTF_8 ) : OutputStreamWriter","body":"= outputStream ( ) . writer ( charset )","docstring":"/**\n * Returns a new [FileWriter] for writing the content of this file.\n */"} {"signature":"@ kotlin . internal . InlineOnly public inline fun File . bufferedWriter ( charset : Charset = Charsets . UTF_8 , bufferSize : Int = DEFAULT_BUFFER_SIZE ) : BufferedWriter","body":"= writer ( charset ) . buffered ( bufferSize )","docstring":"/**\n * Returns a new [BufferedWriter] for writing the content of this file.\n *\n * @param bufferSize necessary size of the buffer.\n */"} {"signature":"@ kotlin . internal . InlineOnly public inline fun File . printWriter ( charset : Charset = Charsets . UTF_8 ) : PrintWriter","body":"= PrintWriter ( bufferedWriter ( charset ) )","docstring":"/**\n * Returns a new [PrintWriter] for writing the content of this file.\n */"} {"signature":"public fun File . readBytes ( ) : ByteArray","body":"= inputStream ( ) . use { input -> var offset = var remaining = this . length ( ) . also { length -> if ( length > Int . MAX_VALUE ) throw OutOfMemoryError ( \"\" ) } . toInt ( ) val result = ByteArray ( remaining ) while ( remaining > ) { val read = input . read ( result , offset , remaining ) if ( read < ) break remaining -= read offset += read } if ( remaining > ) return@use result . copyOf ( offset ) val extraByte = input . read ( ) if ( extraByte == - ) return@use result val extra = ExposingBufferByteArrayOutputStream ( DEFAULT_BUFFER_SIZE + ) extra . write ( extraByte ) input . copyTo ( extra ) val resultingSize = result . size + extra . size ( ) if ( resultingSize < ) throw OutOfMemoryError ( \"\" ) return@use extra . buffer . copyInto ( destination = result . copyOf ( resultingSize ) , destinationOffset = result . size , startIndex = , endIndex = extra . size ( ) ) }","docstring":"/**\n * Gets the entire content of this file as a byte array.\n *\n * This method is not recommended on huge files. It has an internal limitation of 2 GB byte array size.\n *\n * @return the entire content of this file as a byte array.\n */"} {"signature":"public fun File . writeBytes ( array : ByteArray ) : Unit","body":"= FileOutputStream ( this ) . use { it . write ( array ) }","docstring":"/**\n * Sets the content of this file as an [array] of bytes.\n * If this file already exists, it becomes overwritten.\n *\n * @param array byte array to write into this file.\n */"} {"signature":"public fun File . appendBytes ( array : ByteArray ) : Unit","body":"= FileOutputStream ( this , true ) . use { it . write ( array ) }","docstring":"/**\n * Appends an [array] of bytes to the content of this file.\n *\n * @param array byte array to append to this file.\n */"} {"signature":"public fun File . readText ( charset : Charset = Charsets . UTF_8 ) : String","body":"= reader ( charset ) . use { it . readText ( ) }","docstring":"/**\n * Gets the entire content of this file as a String using UTF-8 or specified [charset].\n *\n * This method is not recommended on huge files. It has an internal limitation of 2 GB file size.\n *\n * @param charset character set to use.\n * @return the entire content of this file as a String.\n */"} {"signature":"public fun File . writeText ( text : String , charset : Charset = Charsets . UTF_8 ) : Unit","body":"= FileOutputStream ( this ) . use { it . writeTextImpl ( text , charset ) }","docstring":"/**\n * Sets the content of this file as [text] encoded using UTF-8 or specified [charset].\n * If this file exists, it becomes overwritten.\n *\n * @param text text to write into file.\n * @param charset character set to use.\n */"} {"signature":"public fun File . appendText ( text : String , charset : Charset = Charsets . UTF_8 ) : Unit","body":"= FileOutputStream ( this , true ) . use { it . writeTextImpl ( text , charset ) }","docstring":"/**\n * Appends [text] to the content of this file using UTF-8 or the specified [charset].\n *\n * @param text text to append to file.\n * @param charset character set to use.\n */"} {"signature":"public fun File . forEachBlock ( action : ( buffer : ByteArray , bytesRead : Int ) -> Unit ) : Unit","body":"= forEachBlock ( DEFAULT_BLOCK_SIZE , action )","docstring":"/**\n * Reads file by byte blocks and calls [action] for each block read.\n * Block has default size which is implementation-dependent.\n * This functions passes the byte array and amount of bytes in the array to the [action] function.\n *\n * You can use this function for huge files.\n *\n * @param action function to process file blocks.\n */"} {"signature":"public fun File . forEachBlock ( blockSize : Int , action : ( buffer : ByteArray , bytesRead : Int ) -> Unit ) : Unit","body":"{ val arr = ByteArray ( blockSize . coerceAtLeast ( MINIMUM_BLOCK_SIZE ) ) inputStream ( ) . use { input -> do { val size = input . read ( arr ) if ( size <= ) { break } else { action ( arr , size ) } } while ( true ) } }","docstring":"/**\n * Reads file by byte blocks and calls [action] for each block read.\n * This functions passes the byte array and amount of bytes in the array to the [action] function.\n *\n * You can use this function for huge files.\n *\n * @param action function to process file blocks.\n * @param blockSize size of a block, replaced by 512 if it's less, 4096 by default.\n */"} {"signature":"public fun File . forEachLine ( charset : Charset = Charsets . UTF_8 , action : ( line : String ) -> Unit ) : Unit","body":"{ BufferedReader ( InputStreamReader ( FileInputStream ( this ) , charset ) ) . forEachLine ( action ) }","docstring":"/**\n * Reads this file line by line using the specified [charset] and calls [action] for each line.\n * Default charset is UTF-8.\n *\n * You may use this function on huge files.\n *\n * @param charset character set to use.\n * @param action function to process file lines.\n */"} {"signature":"@ kotlin . internal . InlineOnly public inline fun File . inputStream ( ) : FileInputStream","body":"{ return FileInputStream ( this ) }","docstring":"/**\n * Constructs a new FileInputStream of this file and returns it as a result.\n */"} {"signature":"@ kotlin . internal . InlineOnly public inline fun File . outputStream ( ) : FileOutputStream","body":"{ return FileOutputStream ( this ) }","docstring":"/**\n * Constructs a new FileOutputStream of this file and returns it as a result.\n */"} {"signature":"public fun File . readLines ( charset : Charset = Charsets . UTF_8 ) : List < String >","body":"{ val result = ArrayList < String > ( ) forEachLine ( charset ) { result . add ( it ) ; } return result }","docstring":"/**\n * Reads the file content as a list of lines.\n *\n * Do not use this function for huge files.\n *\n * @param charset character set to use. By default uses UTF-8 charset.\n * @return list of file lines.\n */"} {"signature":"public inline fun < T > File . useLines ( charset : Charset = Charsets . UTF_8 , block : ( Sequence < String > ) -> T ) : T","body":"{ contract { callsInPlace ( block , InvocationKind . EXACTLY_ONCE ) } return bufferedReader ( charset ) . use { block ( it . lineSequence ( ) ) } }","docstring":"/**\n * Calls the [block] callback giving it a sequence of all the lines in this file and closes the reader once\n * the processing is complete.\n\n * @param charset character set to use. By default uses UTF-8 charset.\n * @return the value returned by [block].\n */"} {"signature":"fun D . signatureString ( compatibleMode : Boolean ) : String","body":"fun D . signatureString ( compatibleMode : Boolean ) : String","docstring":"/**\n * Returns the mangled name for the declaration [D] to be used for computing that declaration's [IdSignature].\n *\n * Unlike the one computed by [mangleString], this mangled name does not include mangled names of the declaration's parents.\n *\n * For example, for `foo`'s getter in the following code:\n * ```kotlin\n * class Test {\n * val foo: Int\n * }\n * ```\n * the result of this function will be `\"(){}kotlin.Int\"` or `\"(){}\"` (depending on the target platform).\n *\n * **The result of this function affects klib ABI.**\n *\n * @param compatibleMode If `true`, the mangled names of property backing fields are just those fields' names.\n * Otherwise, mangles such fields exactly as their corresponding properties.\n */"} {"signature":"fun D . signatureMangle ( compatibleMode : Boolean ) : Long","body":"= signatureString ( compatibleMode ) . hashMangle","docstring":"/**\n * Computes the hash code of the string returned by [signatureString] using the CityHash64 algorithm.\n *\n * This hash code is to be used for building the declaration's [IdSignature].\n *\n * **The result of this function affects klib ABI.**\n *\n * @param compatibleMode If `true`, the mangled names of property backing fields are just those fields' names.\n * Otherwise, mangles such fields exactly as their corresponding properties.\n *\n * @see [IdSignature.CommonSignature.id]\n */"} {"signature":"fun IrDeclaration . mangleString ( compatibleMode : Boolean ) : String","body":"fun IrDeclaration . mangleString ( compatibleMode : Boolean ) : String","docstring":"/**\n * Returns the mangled name for the declaration, prefixed by mangled names of all its parents.\n *\n * For example, for `foo`'s getter in the following code:\n * ```kotlin\n * class Test {\n * val foo: Int\n * }\n * ```\n * the result of this function will be `\"Test#(){}kotlin.Int\"` or `\"Test#(){}\"`\n * (depending on the target platform).\n *\n * The result of this function is only used for assigning names to binary symbols of Kotlin functions in the final executable\n * produced by Kotlin/Native.\n * **It does not affect klib ABI.**\n *\n * @param compatibleMode If `true`, the mangled names of property backing fields are just those fields' names.\n * Otherwise, mangles such fields exactly as their corresponding properties.\n */"} {"signature":"abstract fun check ( typeRef : T , context : CheckerContext , reporter : DiagnosticReporter )","body":"abstract fun check ( typeRef : T , context : CheckerContext , reporter : DiagnosticReporter )","docstring":"/**\n * [FirTypeChecker] should only be used when the check can be performed independent of the context of the type refs. That is,\n * you should NOT be examining containing declarations, qualified accesses, etc. when writing a FirTypeChecker.\n *\n * If the check is dependent on context, or if it is specific to type refs in a certain kind of declaration or expression,\n * please write a [org.jetbrains.kotlin.fir.analysis.checkers.declaration.FirDeclarationChecker] or\n * [org.jetbrains.kotlin.fir.analysis.checkers.expression.FirExpressionChecker] instead.\n */"} {"signature":"public fun getAllAnchorModules ( ) : Collection < KtSourceModule >","body":"public fun getAllAnchorModules ( ) : Collection < KtSourceModule >","docstring":"/**\n * Returns all anchor modules configured in the project.\n */"} {"signature":"public fun createDispatcher ( allFactories : List < MainDispatcherFactory > ) : MainCoroutineDispatcher","body":"public fun createDispatcher ( allFactories : List < MainDispatcherFactory > ) : MainCoroutineDispatcher","docstring":"/**\n * Creates the main dispatcher. [allFactories] parameter contains all factories found by service loader.\n * This method is not guaranteed to be idempotent.\n *\n * It is required that this method fails with an exception instead of returning an instance that doesn't work\n * correctly as a [Delay].\n * The reason for this is that, on the JVM, [DefaultDelay] will use [Dispatchers.Main] for most delays by default\n * if this method returns an instance without throwing.\n */"} {"signature":"public fun hintOnError ( ) : String ?","body":"= null","docstring":"/**\n * Hint used along with error message when the factory failed to create a dispatcher.\n */"} {"signature":"fun computeSignature ( declaration : IrDeclaration ) : IdSignature ?","body":"fun computeSignature ( declaration : IrDeclaration ) : IdSignature ?","docstring":"/**\n * Computes a signature of [declaration].\n *\n * @param declaration The declaration to compute the signature for.\n * @return The signature of the [declaration], or `null` if the declaration cannot have a signature (for example,\n * because it is not exportable according to [org.jetbrains.kotlin.backend.common.serialization.mangle.KotlinExportChecker]).\n */"} {"signature":"fun < R > inFile ( file : IrFileSymbol ? , block : ( ) -> R ) : R","body":"fun < R > inFile ( file : IrFileSymbol ? , block : ( ) -> R ) : R","docstring":"/**\n * Informs the signature computer that all signature computations for top-level private declarations within [block] will use\n * the [file]'s signature (a signature for a top-level private declaration should always contain a signature of the file this\n * declaration is declared in).\n *\n * @param file A symbol of the file for declarations in which signatures will be computed in [block], or `null` if the declarations\n * won't have a file associated (like some compiler generated declarations).\n * @param block A block within which signatures computed for private declarations will include [file]'s signature.\n * @see [IdSignature.FileSignature]\n */"} {"signature":"internal inline fun Project . runProjectConfigurationHealthCheck ( check : Project . ( ) -> Unit )","body":"{ if ( failures . isNotEmpty ( ) ) { return } check ( ) }","docstring":"/**\n * Function used to wrap any checks/assertions done on the current project configuration / project model.\n *\n * Runs the given [check] only on projects that are considered \"healthy\".\n * A \"healthy\" project did evaluate correctly which means \"without exceptions/errors\".\n *\n * This function has to be used over \"just running the check\", because running project configuration checks\n * on projects that failed to configure will lead to false positive error reporting.\n * In most cases (when called in 'afterEvaluate') such false positive error message will even swallow the real root cause\n * of configuration failure.\n *\n * Note:\n * During Gradle/IDEA sync (import), Gradle will be set into `lenientMode` and will catch all exceptions\n * during evaluation of the build script. Those exceptions will be put into the [ClassPathModeExceptionCollector].\n * Any project that contains caught and collected exceptions in this 'collector' should be considered failed\n * and running project model checks is undesirable. In this mode, throwing exceptions in `afterEvaluate` will even fail the process\n * which would swallow the previously collected exceptions.\n *\n * Example:\n * We have a post-evaluation check that will report users an error if no Kotlin target\n * was registered.\n *\n * Consider the following build script:\n *\n * ```kotlin\n * plugins {\n * kotlin(\"multiplatform\")\n * }\n *\n * error(\"Something went wrong during the configuration phase\")\n *\n * kotlin {\n * jvm() // <- * Note: jvm target registered\n * js() // <- * Note: js target registered\n * }\n * ```\n *\n * In this example, the exception is thrown before the configuration of Kotlin targets.\n * During IDEA import, this exception will be caught and put into the [ClassPathModeExceptionCollector].\n * When running the assertion just plainly (*without this wrapper function*), the user\n * will not see the real cause of failure, but a rather bizarre:\n * \"Please initialize at least one Kotlin target\"\n * error message. Which is not helpful at all.\n *\n */"} {"signature":"internal inline fun Project . runProjectConfigurationHealthCheckWhenEvaluated ( crossinline check : Project . ( ) -> Unit )","body":"{ launchInStage ( KotlinPluginLifecycle . Stage . ReadyForExecution ) { runProjectConfigurationHealthCheck ( check ) } }","docstring":"/**\n * Convenience function for\n * ```kotlin\n * whenEvaluated {\n * runProjectConfigurationCheck(action)\n * }\n * ```\n * @see runProjectConfigurationHealthCheck\n */"} {"signature":"@ OptIn ( DelicateCoroutinesApi :: class , ExperimentalCoroutinesApi :: class ) public fun createDocumentationModels ( ) : List < DModule >","body":"= newSingleThreadContext ( \"\" ) . use { coroutineContext -> runBlocking ( coroutineContext ) { context . configuration . sourceSets . parallelMap { sourceSet -> translateSources ( sourceSet , context ) } . flatten ( ) . also { modules -> if ( modules . isEmpty ( ) ) exitGenerationGracefully ( \"\" ) } } }","docstring":"/**\n * Implementation note: it runs in a separated single thread due to existing support of coroutines (see #2936)\n */"} {"signature":"override fun chooseConstructor ( implClass : IrClass , expression : IrConstructorCall ) : IrConstructor","body":"{ val existingValueArguments = ( until expression . valueArgumentsCount ) . filter { expression . getValueArgument ( it ) != null } . map { expression . symbol . owner . valueParameters [ it ] . name } . toSet ( ) return implClass . constructors . singleOrNull { cons -> cons . valueParameters . map { it . name } . toSet ( ) == existingValueArguments } ? : implClass . addConstructor { startOffset = SYNTHETIC_OFFSET endOffset = SYNTHETIC_OFFSET visibility = DescriptorVisibilities . PUBLIC } . apply { expression . symbol . owner . valueParameters . filter { it . name in existingValueArguments } . forEach { parameter -> addValueParameter ( parameter . name . asString ( ) , parameter . type ) } createConstructorBody ( this , expression . symbol . owner ) } }","docstring":"/**\n * When annotation is defined in another module, default values can be not available\n * during incremental compilation.\n *\n * In that case we need to delegate evaluating defaults to original class constructor.\n * The simplest way to do that - generate a constructor for each set of arguments used for\n * instantiating annotations, hope there shouldn't be too many of them in each module.\n */"} {"signature":"@ ObsoleteCoroutinesApi @ Deprecated ( level = DeprecationLevel . WARNING , message = \"\" ) public fun < E > ReceiveChannel < E > . broadcast ( capacity : Int = , start : CoroutineStart = CoroutineStart . LAZY ) : BroadcastChannel < E >","body":"{ val scope = GlobalScope + Dispatchers . Unconfined + CoroutineExceptionHandler { _ , _ -> } val channel = this return scope . broadcast ( capacity = capacity , start = start , onCompletion = { cancelConsumed ( it ) } ) { for ( e in channel ) { send ( e ) } } }","docstring":"/**\n * Broadcasts all elements of the channel.\n * This function [consumes][ReceiveChannel.consume] all elements of the original [ReceiveChannel].\n *\n * The kind of the resulting channel depends on the specified [capacity] parameter:\n * when `capacity` is positive (1 by default), but less than [UNLIMITED] -- uses [BroadcastChannel] with a buffer of given capacity,\n * when `capacity` is [CONFLATED] -- uses [ConflatedBroadcastChannel] that conflates back-to-back sends;\n * Note that resulting channel behaves like [ConflatedBroadcastChannel] but is not an instance of [ConflatedBroadcastChannel].\n * otherwise -- throws [IllegalArgumentException].\n *\n * ### Cancelling broadcast\n *\n * **To stop broadcasting from the underlying channel call [cancel][BroadcastChannel.cancel] on the result.**\n *\n * Do not use [close][BroadcastChannel.close] on the resulting channel.\n * It causes eventual failure of the broadcast coroutine and cancellation of the underlying channel, too,\n * but it is not as prompt.\n *\n * ### Future replacement\n *\n * This function has an inappropriate result type of [BroadcastChannel] which provides\n * [send][BroadcastChannel.send] and [close][BroadcastChannel.close] operations that interfere with\n * the broadcasting coroutine in hard-to-specify ways.\n *\n * **Note: This API is obsolete since 1.5.0.** It is deprecated with warning in 1.7.0.\n * It is replaced with [Flow.shareIn][kotlinx.coroutines.flow.shareIn] operator.\n *\n * @param start coroutine start option. The default value is [CoroutineStart.LAZY].\n */"} {"signature":"@ ObsoleteCoroutinesApi @ Deprecated ( level = DeprecationLevel . WARNING , message = \"\" ) public fun < E > CoroutineScope . broadcast ( context : CoroutineContext = EmptyCoroutineContext , capacity : Int = , start : CoroutineStart = CoroutineStart . LAZY , onCompletion : CompletionHandler ? = null , @ BuilderInference block : suspend ProducerScope < E > . ( ) -> Unit ) : BroadcastChannel < E >","body":"{ val newContext = newCoroutineContext ( context ) val channel = BroadcastChannel < E > ( capacity ) val coroutine = if ( start . isLazy ) LazyBroadcastCoroutine ( newContext , channel , block ) else BroadcastCoroutine ( newContext , channel , active = true ) if ( onCompletion != null ) coroutine . invokeOnCompletion ( handler = onCompletion ) coroutine . start ( start , coroutine , block ) return coroutine }","docstring":"/**\n * Launches new coroutine to produce a stream of values by sending them to a broadcast channel\n * and returns a reference to the coroutine as a [BroadcastChannel]. The resulting\n * object can be used to [subscribe][BroadcastChannel.openSubscription] to elements produced by this coroutine.\n *\n * The scope of the coroutine contains [ProducerScope] interface, which implements\n * both [CoroutineScope] and [SendChannel], so that coroutine can invoke\n * [send][SendChannel.send] directly. The channel is [closed][SendChannel.close]\n * when the coroutine completes.\n *\n * Coroutine context is inherited from a [CoroutineScope], additional context elements can be specified with [context] argument.\n * If the context does not have any dispatcher nor any other [ContinuationInterceptor], then [Dispatchers.Default] is used.\n * The parent job is inherited from a [CoroutineScope] as well, but it can also be overridden\n * with corresponding [context] element.\n *\n * Uncaught exceptions in this coroutine close the channel with this exception as a cause and\n * the resulting channel becomes _failed_, so that any attempt to receive from such a channel throws exception.\n *\n * The kind of the resulting channel depends on the specified [capacity] parameter:\n * - when `capacity` is positive (1 by default), but less than [UNLIMITED] -- uses [BroadcastChannel] with a buffer of given capacity,\n * - when `capacity` is [CONFLATED] -- uses [ConflatedBroadcastChannel] that conflates back-to-back sends;\n * Note that resulting channel behaves like [ConflatedBroadcastChannel] but is not an instance of [ConflatedBroadcastChannel].\n * - otherwise -- throws [IllegalArgumentException].\n *\n * **Note:** By default, the coroutine does not start until the first subscriber appears via [BroadcastChannel.openSubscription]\n * as [start] parameter has a value of [CoroutineStart.LAZY] by default.\n * This ensures that the first subscriber does not miss any sent elements.\n * However, later subscribers may miss elements.\n *\n * See [newCoroutineContext] for a description of debugging facilities that are available for newly created coroutine.\n *\n * ### Cancelling broadcast\n *\n * **To stop broadcasting from the underlying channel call [cancel][BroadcastChannel.cancel] on the result.**\n *\n * Do not use [close][BroadcastChannel.close] on the resulting channel.\n * It causes failure of the `send` operation in broadcast coroutine and would not cancel it if the\n * coroutine is doing something else.\n *\n * ### Future replacement\n *\n * This API is obsolete since 1.5.0 and deprecated with warning since 1.7.0.\n * This function has an inappropriate result type of [BroadcastChannel] which provides\n * [send][BroadcastChannel.send] and [close][BroadcastChannel.close] operations that interfere with\n * the broadcasting coroutine in hard-to-specify ways.\n * It is replaced with [Flow.shareIn][kotlinx.coroutines.flow.shareIn] operator.\n *\n * @param context additional to [CoroutineScope.coroutineContext] context of the coroutine.\n * @param capacity capacity of the channel's buffer (1 by default).\n * @param start coroutine start option. The default value is [CoroutineStart.LAZY].\n * @param onCompletion optional completion handler for the producer coroutine (see [Job.invokeOnCompletion]).\n * @param block the coroutine code.\n */"} {"signature":"public fun appendBatch ( epochIndex : Int , batchIndex : Int , lossValue : Double , metricValues : List < Double > )","body":"{ val newEvent = BatchTrainingEvent ( epochIndex , batchIndex , lossValue , metricValues ) addNewBatchEvent ( newEvent , epochIndex , batchIndex ) }","docstring":"/**\n * Appends tracked data from one batch event.\n *\n * @param epochIndex Epoch index.\n * @param batchIndex Epoch index.\n * @param lossValue Value of loss function on training dataset.\n * @param metricValues Value of metric function on training dataset.\n */"} {"signature":"public fun appendBatch ( batchTrainingEvent : BatchTrainingEvent )","body":"{ addNewBatchEvent ( batchTrainingEvent , batchTrainingEvent . epochIndex , batchTrainingEvent . batchIndex ) }","docstring":"/**\n * Appends one [BatchTrainingEvent].\n */"} {"signature":"public fun appendEpoch ( epochIndex : Int , lossValue : Double , metricValues : List < Double > , valLossValue : Double ? , valMetricValues : List < Double > ? )","body":"{ val newEvent = EpochTrainingEvent ( epochIndex , lossValue , metricValues , valLossValue , valMetricValues ) addNewEpochEvent ( newEvent , epochIndex ) }","docstring":"/**\n * Appends tracked data from one epoch event.\n *\n * @param epochIndex Epoch index.\n * @param lossValue Value of loss function on training dataset.\n * @param metricValues Value of metric function on training dataset.\n * @param valLossValue Value of loss function on validation dataset. Could be null, if validation phase is missed.\n * @param valMetricValues Value of metric function on validation dataset. Could be null, if validation phase is missed.\n */"} {"signature":"public fun appendEpoch ( epochTrainingEvent : EpochTrainingEvent )","body":"{ addNewEpochEvent ( epochTrainingEvent , epochTrainingEvent . epochIndex ) }","docstring":"/**\n * Appends one [EpochTrainingEvent].\n */"} {"signature":"public fun lastBatchEvent ( ) : BatchTrainingEvent","body":"{ return historyByEpochAndBatch . lastEntry ( ) . value ! ! . lastEntry ( ) . value }","docstring":"/**\n * Returns last [BatchTrainingEvent]\n */"} {"signature":"public fun lastEpochEvent ( ) : EpochTrainingEvent","body":"{ return _historyByEpoch . lastEntry ( ) . value }","docstring":"/**\n * Returns last [EpochTrainingEvent].\n */"} {"signature":"public fun eventsByEpoch ( epochIndex : Int ) : TreeMap < Int , BatchTrainingEvent > ?","body":"{ return historyByEpochAndBatch [ epochIndex ] }","docstring":"/**\n * Returns all [BatchTrainingEvent] of the specific epoch.\n *\n * @param [epochIndex] Epoch index of the required epoch to return its batch events.\n * @return Indexed and sorted [TreeMap] of [BatchTrainingEvent].\n */"} {"signature":"internal fun torchStylePreprocessing ( channelsLastParameter : Boolean = true ) : Operation < FloatData , FloatData >","body":"{ return pipeline < FloatData > ( ) . rescale { scalingCoefficient = } . normalize { mean = floatArrayOf ( , , ) std = floatArrayOf ( , , ) channelsLast = channelsLastParameter } }","docstring":"/** Torch-style preprocessing. */"} {"signature":"internal fun caffeStylePreprocessing ( channelsLastParameter : Boolean = true ) : Operation < FloatData , FloatData >","body":"{ return pipeline < FloatData > ( ) . normalize { mean = floatArrayOf ( , , ) std = floatArrayOf ( , , ) channelsLast = channelsLastParameter } }","docstring":"/** Caffe-style preprocessing. */"} {"signature":"public fun < R > Iterable < * > . filterIsInstance ( klass : Class < R > ) : List < R >","body":"{ return filterIsInstanceTo ( ArrayList < R > ( ) , klass ) }","docstring":"/**\n * Returns a list containing all elements that are instances of specified class.\n * \n * @sample samples.collections.Collections.Filtering.filterIsInstanceJVM\n */"} {"signature":"public fun < C : MutableCollection < in R > , R > Iterable < * > . 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 * @sample samples.collections.Collections.Filtering.filterIsInstanceToJVM\n */"} {"signature":"public actual fun < T > MutableList < T > . reverse ( ) : Unit","body":"{ java . util . Collections . reverse ( this ) }","docstring":"/**\n * Reverses elements in the list in-place.\n */"} {"signature":"public fun < T : Comparable < T > > Iterable < 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 */"} {"signature":"public fun < T > Iterable < 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 */"} {"signature":"@ SinceKotlin ( \"\" ) @ OptIn ( kotlin . experimental . ExperimentalTypeInference :: class ) @ OverloadResolutionByLambdaReturnType @ kotlin . jvm . JvmName ( \"\" ) @ kotlin . internal . InlineOnly public inline fun < T > Iterable < 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 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 ) -> 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 collection.\n */"} {"signature":"internal fun PageContentBuilder . DocumentableContentBuilder . customTagSectionContent ( documentable : Documentable , sourceSets : Set < DokkaConfiguration . DokkaSourceSet > , customTagContentProviders : List < CustomTagContentProvider > , )","body":"{ val customTags = documentable . customTags if ( customTags . isEmpty ( ) ) return sourceSets . forEach { sourceSet -> customTags . forEach { ( _ , sourceSetTag ) -> sourceSetTag [ sourceSet ] ? . let { tag -> customTagContentProviders . filter { it . isApplicable ( tag ) } . forEach { provider -> group ( sourceSets = setOf ( sourceSet ) , styles = setOf ( ContentStyle . KDocTag ) ) { with ( provider ) { contentForDescription ( sourceSet , tag ) } } } } } } }","docstring":"/**\n * Custom tags are tags which are not part of the [KDoc specification](https://kotlinlang.org/docs/kotlin-doc.html). For instance, a user-defined tag\n * which is specific to the user's code base would be considered a custom tag.\n *\n * For details, see [CustomTagContentProvider]\n */"} {"signature":"internal fun PageContentBuilder . DocumentableContentBuilder . unnamedTagSectionContent ( documentable : Documentable , sourceSets : Set < DokkaConfiguration . DokkaSourceSet > , toHeaderString : TagWrapper . ( ) -> String , )","body":"{ val unnamedTags = documentable . groupedTags . filterNot { ( k , _ ) -> k . isSubclassOf ( NamedTagWrapper :: class ) || k in unnamedTagsExceptions } . values . flatten ( ) . groupBy { it . first } . mapValues { it . value . map { it . second } } . takeIf { it . isNotEmpty ( ) } ? : return sourceSets . forEach { sourceSet -> unnamedTags [ sourceSet ] ? . let { tags -> if ( tags . isNotEmpty ( ) ) { tags . groupBy { it :: class } . forEach { ( _ , sameCategoryTags ) -> group ( sourceSets = setOf ( sourceSet ) , styles = setOf ( ContentStyle . KDocTag ) ) { header ( level = KDOC_TAG_HEADER_LEVEL , text = sameCategoryTags . first ( ) . toHeaderString ( ) , styles = setOf ( ) ) sameCategoryTags . forEach { comment ( it . root , styles = setOf ( ) ) } } } } } } }","docstring":"/**\n * Tags in KDoc are used in form of \"@tag name value\".\n * This function handles tags that have only value parameter without name.\n * List of such tags: `@return`, `@author`, `@since`, `@receiver`\n */"} {"signature":"private fun Set < DokkaConfiguration . DokkaSourceSet > . getPossibleFallback ( sourceSet : DokkaConfiguration . DokkaSourceSet )","body":"= this . filter { it . sourceSetID in sourceSet . dependentSourceSets }","docstring":"/**\n * Used for multi-value tags (e.g. params) when values are missed on some platforms.\n * It this case description is inherited from parent platform.\n * E.g. if param hasn't description in JVM, the description is taken from common.\n */"} {"signature":"private fun Documentable . isDefinedInSharedSourceSetOnly ( inheritorsSourceSets : Set < DokkaConfiguration . DokkaSourceSet > )","body":"= sourceSets . size == && ( sourceSets . first ( ) . analysisPlatform == Platform . common || sourceSets . first ( ) . hasDependentSourceSet ( inheritorsSourceSets ) )","docstring":"/**\n * Detect that documentable is located only in the shared code without expect-actuals\n * Value of `analysisPlatform` will be [Platform.common] in cases if a source set shared between 2 different platforms.\n * But if it shared between 2 same platforms (e.g. jvm(\"awt\") and jvm(\"android\"))\n * then the source set will be still marked as jvm platform.\n *\n * So, we also try to check if any of inheritors source sets depends on current documentable source set.\n * that will mean that the source set is shared.\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 shift } } matchResult . setConsumed ( groupIndex , start ) return - }","docstring":"/**\n * Returns startIndex+shift, the next position to match\n */"} {"signature":"public fun resolveKdocFqName ( analysisSession : KtAnalysisSession , fqName : FqName , contextElement : KtElement ) : Collection < KtSymbol >","body":"public fun resolveKdocFqName ( analysisSession : KtAnalysisSession , fqName : FqName , contextElement : KtElement ) : Collection < KtSymbol >","docstring":"/**\n * This function must return additional symbols for [contextElement] in KDoc.\n */"} {"signature":"public fun resolveKdocFqName ( analysisSession : KtAnalysisSession , fqName : FqName , contextElement : KtElement ) : Collection < KtSymbol >","body":"= EP_NAME . extensions . flatMap { it . resolveKdocFqName ( analysisSession , fqName , contextElement ) }","docstring":"/**\n * This function must return additional symbols for [contextElement] in KDoc.\n */"} {"signature":"@ DelicateSymbolTableApi fun forEachDeclarationSymbol ( block : ( IrSymbol ) -> Unit )","body":"{ classSlice . forEachSymbol { block ( it ) } constructorSlice . forEachSymbol { block ( it ) } functionSlice . forEachSymbol { block ( it ) } propertySlice . forEachSymbol { block ( it ) } enumEntrySlice . forEachSymbol { block ( it ) } typeAliasSlice . forEachSymbol { block ( it ) } fieldSlice . 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":"public fun onModification ( module : KtModule )","body":"public fun onModification ( module : KtModule )","docstring":"/**\n * [onModification] is invoked in a write action before or after an out-of-block modification happens in [module]'s source code.\n *\n * See [KotlinModificationTrackerFactory.createProjectWideOutOfBlockModificationTracker] for an explanation of out-of-block\n * modifications.\n *\n * This event may be published for any and all source code changes, not just out-of-block modifications, to simplify the implementation\n * of modification detection.\n *\n * @see KotlinTopics\n */"} {"signature":"fun generateClass ( generator : ClassGenerator , declaration : IrClass ? ) : ClassGenerator","body":"fun generateClass ( generator : ClassGenerator , declaration : IrClass ? ) : ClassGenerator","docstring":"/**\n * Override this method to decorate the [generator] that is used in the compiler backend to generate IR to bytecode.\n * [Interface delegation](https://kotlinlang.org/docs/delegation.html) can be used to avoid implementing each member manually.\n *\n * @param generator the generator used to generate the original class\n * @param declaration the IR representation of the generated class, or `null` if this class has no IR representation\n * (for example, if it's an anonymous object copied during inlining bytecode)\n */"} {"signature":"fun foo ( )","body":"{ }","docstring":"/**\n * [A.BB.C]\n */"} {"signature":"public fun runTest ( context : CoroutineContext = EmptyCoroutineContext , timeout : Duration = DEFAULT_TIMEOUT . getOrThrow ( ) , testBody : suspend TestScope . ( ) -> Unit ) : TestResult","body":"{ check ( context [ RunningInRunTest ] == null ) { \"\" } return TestScope ( context + RunningInRunTest ) . runTest ( timeout , testBody ) }","docstring":"/**\n * Executes [testBody] as a test in a new coroutine, returning [TestResult].\n *\n * On JVM and Native, this function behaves similarly to `runBlocking`, with the difference that the code that it runs\n * will skip delays. This allows to use [delay] in tests without causing them to take more time than necessary.\n * On JS, this function creates a `Promise` that executes the test body with the delay-skipping behavior.\n *\n * ```\n * @Test\n * fun exampleTest() = runTest {\n * val deferred = async {\n * delay(1.seconds)\n * async {\n * delay(1.seconds)\n * }.await()\n * }\n *\n * deferred.await() // result available immediately\n * }\n * ```\n *\n * The platform difference entails that, in order to use this function correctly in common code, one must always\n * immediately return the produced [TestResult] from the test method, without doing anything else afterwards. See\n * [TestResult] for details on this.\n *\n * The test is run on a single thread, unless other [CoroutineDispatcher] are used for child coroutines.\n * Because of this, child coroutines are not executed in parallel to the test body.\n * In order for the spawned-off asynchronous code to actually be executed, one must either [yield] or suspend the\n * test body some other way, or use commands that control scheduling (see [TestCoroutineScheduler]).\n *\n * ```\n * @Test\n * fun exampleWaitingForAsyncTasks1() = runTest {\n * // 1\n * val job = launch {\n * // 3\n * }\n * // 2\n * job.join() // the main test coroutine suspends here, so the child is executed\n * // 4\n * }\n *\n * @Test\n * fun exampleWaitingForAsyncTasks2() = runTest {\n * // 1\n * launch {\n * // 3\n * }\n * // 2\n * testScheduler.advanceUntilIdle() // runs the tasks until their queue is empty\n * // 4\n * }\n * ```\n *\n * ### Task scheduling\n *\n * Delay skipping is achieved by using virtual time.\n * If [Dispatchers.Main] is set to a [TestDispatcher] via [Dispatchers.setMain] before the test,\n * then its [TestCoroutineScheduler] is used;\n * otherwise, a new one is automatically created (or taken from [context] in some way) and can be used to control\n * the virtual time, advancing it, running the tasks scheduled at a specific time etc.\n * The scheduler can be accessed via [TestScope.testScheduler].\n *\n * Delays in code that runs inside dispatchers that don't use a [TestCoroutineScheduler] don't get skipped:\n * ```\n * @Test\n * fun exampleTest() = runTest {\n * val elapsed = TimeSource.Monotonic.measureTime {\n * val deferred = async {\n * delay(1.seconds) // will be skipped\n * withContext(Dispatchers.Default) {\n * delay(5.seconds) // Dispatchers.Default doesn't know about TestCoroutineScheduler\n * }\n * }\n * deferred.await()\n * }\n * println(elapsed) // about five seconds\n * }\n * ```\n *\n * ### Failures\n *\n * #### Test body failures\n *\n * If the created coroutine completes with an exception, then this exception will be thrown at the end of the test.\n *\n * #### Timing out\n *\n * There's a built-in timeout of 60 seconds for the test body. If the test body doesn't complete within this time,\n * then the test fails with an [AssertionError]. The timeout can be changed for each test separately by setting the\n * [timeout] parameter.\n *\n * Additionally, setting the `kotlinx.coroutines.test.default_timeout` system property on the\n * JVM to any string that can be parsed using [Duration.parse] (like `1m`, `30s` or `1500ms`) will change the default\n * timeout to that value for all tests whose [timeout] is not set explicitly; setting it to anything else will throw an\n * exception every time [runTest] is invoked.\n *\n * On timeout, the test body is cancelled so that the test finishes. If the code inside the test body does not\n * respond to cancellation, the timeout will not be able to make the test execution stop.\n * In that case, the test will hang despite the attempt to terminate it.\n *\n * On the JVM, if `DebugProbes` from the `kotlinx-coroutines-debug` module are installed, the current dump of the\n * coroutines' stack is printed to the console on timeout before the test body is cancelled.\n *\n * #### Reported exceptions\n *\n * Unhandled exceptions will be thrown at the end of the test.\n * If uncaught exceptions happen after the test finishes, they are propagated in a platform-specific manner:\n * see [handleCoroutineException] for details.\n * If the test coroutine completes with an exception, the unhandled exceptions are suppressed by it.\n *\n * #### Uncompleted coroutines\n *\n * Otherwise, the test will hang until all the coroutines launched inside [testBody] complete.\n * This may be an issue when there are some coroutines that are not supposed to complete, like infinite loops that\n * perform some background work and are supposed to outlive the test.\n * In that case, [TestScope.backgroundScope] can be used to launch such coroutines.\n * They will be cancelled automatically when the test finishes.\n *\n * ### Configuration\n *\n * [context] can be used to affect the environment of the code under test. Beside just being passed to the coroutine\n * scope created for the test, [context] also can be used to change how the test is executed.\n * See the [TestScope] constructor function documentation for details.\n *\n * @throws IllegalArgumentException if the [context] is invalid. See the [TestScope] constructor docs for details.\n */"} {"signature":"@ Deprecated ( \"\" + \"\" , ReplaceWith ( \"\" , \"\" ) , DeprecationLevel . WARNING ) public fun runTest ( context : CoroutineContext = EmptyCoroutineContext , dispatchTimeoutMs : Long , testBody : suspend TestScope . ( ) -> Unit ) : TestResult","body":"{ if ( context [ RunningInRunTest ] != null ) throw IllegalStateException ( \"\" ) @ Suppress ( \"\" ) return TestScope ( context + RunningInRunTest ) . runTest ( dispatchTimeoutMs = dispatchTimeoutMs , testBody ) }","docstring":"/**\n * Executes [testBody] as a test in a new coroutine, returning [TestResult].\n *\n * On JVM and Native, this function behaves similarly to `runBlocking`, with the difference that the code that it runs\n * will skip delays. This allows to use [delay] in without causing the tests to take more time than necessary.\n * On JS, this function creates a `Promise` that executes the test body with the delay-skipping behavior.\n *\n * ```\n * @Test\n * fun exampleTest() = runTest {\n * val deferred = async {\n * delay(1.seconds)\n * async {\n * delay(1.seconds)\n * }.await()\n * }\n *\n * deferred.await() // result available immediately\n * }\n * ```\n *\n * The platform difference entails that, in order to use this function correctly in common code, one must always\n * immediately return the produced [TestResult] from the test method, without doing anything else afterwards. See\n * [TestResult] for details on this.\n *\n * The test is run in a single thread, unless other [CoroutineDispatcher] are used for child coroutines.\n * Because of this, child coroutines are not executed in parallel to the test body.\n * In order for the spawned-off asynchronous code to actually be executed, one must either [yield] or suspend the\n * test body some other way, or use commands that control scheduling (see [TestCoroutineScheduler]).\n *\n * ```\n * @Test\n * fun exampleWaitingForAsyncTasks1() = runTest {\n * // 1\n * val job = launch {\n * // 3\n * }\n * // 2\n * job.join() // the main test coroutine suspends here, so the child is executed\n * // 4\n * }\n *\n * @Test\n * fun exampleWaitingForAsyncTasks2() = runTest {\n * // 1\n * launch {\n * // 3\n * }\n * // 2\n * advanceUntilIdle() // runs the tasks until their queue is empty\n * // 4\n * }\n * ```\n *\n * ### Task scheduling\n *\n * Delay-skipping is achieved by using virtual time.\n * If [Dispatchers.Main] is set to a [TestDispatcher] via [Dispatchers.setMain] before the test,\n * then its [TestCoroutineScheduler] is used;\n * otherwise, a new one is automatically created (or taken from [context] in some way) and can be used to control\n * the virtual time, advancing it, running the tasks scheduled at a specific time etc.\n * Some convenience methods are available on [TestScope] to control the scheduler.\n *\n * Delays in code that runs inside dispatchers that don't use a [TestCoroutineScheduler] don't get skipped:\n * ```\n * @Test\n * fun exampleTest() = runTest {\n * val elapsed = TimeSource.Monotonic.measureTime {\n * val deferred = async {\n * delay(1.seconds) // will be skipped\n * withContext(Dispatchers.Default) {\n * delay(5.seconds) // Dispatchers.Default doesn't know about TestCoroutineScheduler\n * }\n * }\n * deferred.await()\n * }\n * println(elapsed) // about five seconds\n * }\n * ```\n *\n * ### Failures\n *\n * #### Test body failures\n *\n * If the created coroutine completes with an exception, then this exception will be thrown at the end of the test.\n *\n * #### Reported exceptions\n *\n * Unhandled exceptions will be thrown at the end of the test.\n * If the uncaught exceptions happen after the test finishes, the error is propagated in a platform-specific manner.\n * If the test coroutine completes with an exception, the unhandled exceptions are suppressed by it.\n *\n * #### Uncompleted coroutines\n *\n * This method requires that, after the test coroutine has completed, all the other coroutines launched inside\n * [testBody] also complete, or are cancelled.\n * Otherwise, the test will be failed (which, on JVM and Native, means that [runTest] itself will throw\n * [AssertionError], whereas on JS, the `Promise` will fail with it).\n *\n * In the general case, if there are active jobs, it's impossible to detect if they are going to complete eventually due\n * to the asynchronous nature of coroutines. In order to prevent tests hanging in this scenario, [runTest] will wait\n * for [dispatchTimeoutMs] from the moment when [TestCoroutineScheduler] becomes\n * idle before throwing [AssertionError]. If some dispatcher linked to [TestCoroutineScheduler] receives a\n * task during that time, the timer gets reset.\n *\n * ### Configuration\n *\n * [context] can be used to affect the environment of the code under test. Beside just being passed to the coroutine\n * scope created for the test, [context] also can be used to change how the test is executed.\n * See the [TestScope] constructor function documentation for details.\n *\n * @throws IllegalArgumentException if the [context] is invalid. See the [TestScope] constructor docs for details.\n */"} {"signature":"public fun TestScope . runTest ( timeout : Duration = DEFAULT_TIMEOUT . getOrThrow ( ) , testBody : suspend TestScope . ( ) -> Unit ) : TestResult","body":"= asSpecificImplementation ( ) . let { scope -> scope . enter ( ) createTestResult { scope . start ( CoroutineStart . UNDISPATCHED , scope ) { yield ( ) testBody ( ) } var timeoutError : Throwable ? = null var cancellationException : CancellationException ? = null val workRunner = launch ( CoroutineName ( \"\" ) ) { while ( true ) { val executedSomething = testScheduler . tryRunNextTaskUnless { ! isActive } if ( executedSomething ) { yield ( ) } else { testScheduler . receiveDispatchEvent ( ) } } } try { withTimeout ( timeout ) { coroutineContext . job . invokeOnCompletion ( onCancelling = true ) { exception -> if ( exception is TimeoutCancellationException ) { dumpCoroutines ( ) val activeChildren = scope . children . filter ( Job :: isActive ) . toList ( ) val completionCause = if ( scope . isCancelled ) scope . tryGetCompletionCause ( ) else null var message = \"\" if ( completionCause == null ) message += \"\" if ( activeChildren . isNotEmpty ( ) ) message += \"\" if ( completionCause != null && activeChildren . isEmpty ( ) ) { message += if ( scope . isCompleted ) \"\" else \"\" } timeoutError = UncompletedCoroutinesError ( message ) cancellationException = CancellationException ( \"\" ) ( scope as Job ) . cancel ( cancellationException ! ! ) } } scope . join ( ) workRunner . cancelAndJoin ( ) } } catch ( _ : TimeoutCancellationException ) { scope . join ( ) val completion = scope . getCompletionExceptionOrNull ( ) if ( completion != null && completion !== cancellationException ) { timeoutError ! ! . addSuppressed ( completion ) } workRunner . cancelAndJoin ( ) } finally { backgroundScope . cancel ( ) testScheduler . advanceUntilIdleOr { false } val uncaughtExceptions = scope . leave ( ) throwAll ( timeoutError ? : scope . getCompletionExceptionOrNull ( ) , uncaughtExceptions ) } } }","docstring":"/**\n * Performs [runTest] on an existing [TestScope]. See the documentation for [runTest] for details.\n */"} {"signature":"@ Deprecated ( \"\" + \"\" , ReplaceWith ( \"\" , \"\" ) , DeprecationLevel . WARNING ) public fun TestScope . runTest ( dispatchTimeoutMs : Long , testBody : suspend TestScope . ( ) -> Unit ) : TestResult","body":"= asSpecificImplementation ( ) . let { it . enter ( ) @ Suppress ( \"\" ) createTestResult { runTestCoroutineLegacy ( it , dispatchTimeoutMs . milliseconds , TestScopeImpl :: tryGetCompletionCause , testBody ) { backgroundScope . cancel ( ) testScheduler . advanceUntilIdleOr { false } it . legacyLeave ( ) } } }","docstring":"/**\n * Performs [runTest] on an existing [TestScope].\n *\n * In the general case, if there are active jobs, it's impossible to detect if they are going to complete eventually due\n * to the asynchronous nature of coroutines. In order to prevent tests hanging in this scenario, [runTest] will wait\n * for [dispatchTimeoutMs] from the moment when [TestCoroutineScheduler] becomes\n * idle before throwing [AssertionError]. If some dispatcher linked to [TestCoroutineScheduler] receives a\n * task during that time, the timer gets reset.\n */"} {"signature":"@ Suppress ( \"\" ) internal expect fun createTestResult ( testProcedure : suspend CoroutineScope . ( ) -> Unit ) : TestResult","body":"@ Suppress ( \"\" ) internal expect fun createTestResult ( testProcedure : suspend CoroutineScope . ( ) -> Unit ) : TestResult","docstring":"/**\n * Runs [testProcedure], creating a [TestResult].\n */"} {"signature":"@ Deprecated ( \"\" ) internal suspend fun < T : AbstractCoroutine < Unit > > CoroutineScope . runTestCoroutineLegacy ( coroutine : T , dispatchTimeout : Duration , tryGetCompletionCause : T . ( ) -> Throwable ? , testBody : suspend T . ( ) -> Unit , cleanup : ( ) -> List < Throwable > , )","body":"{ val scheduler = coroutine . coroutineContext [ TestCoroutineScheduler ] ! ! coroutine . start ( CoroutineStart . UNDISPATCHED , coroutine ) { testBody ( ) } var completed = false while ( ! completed ) { scheduler . advanceUntilIdle ( ) if ( coroutine . isCompleted ) { completed = true continue } val backgroundWorkRunner = launch ( CoroutineName ( \"\" ) ) { while ( true ) { val executedSomething = scheduler . tryRunNextTaskUnless { ! isActive } if ( executedSomething ) { yield ( ) } else { scheduler . receiveDispatchEvent ( ) } } } try { select < Unit > { coroutine . onJoin { completed = true } scheduler . onDispatchEventForeground { } onTimeout ( dispatchTimeout ) { throw handleTimeout ( coroutine , dispatchTimeout , tryGetCompletionCause , cleanup ) } } } finally { backgroundWorkRunner . cancelAndJoin ( ) } } coroutine . getCompletionExceptionOrNull ( ) ? . let { exception -> val exceptions = try { cleanup ( ) } catch ( e : UncompletedCoroutinesError ) { emptyList ( ) } throwAll ( exception , exceptions ) } throwAll ( null , cleanup ( ) ) }","docstring":"/**\n * Run the [body][testBody] of the [test coroutine][coroutine], waiting for asynchronous completions for at most\n * [dispatchTimeout] and performing the [cleanup] procedure at the end.\n *\n * [tryGetCompletionCause] is the [JobSupport.completionCause], which is passed explicitly because it is protected.\n *\n * The [cleanup] procedure may either throw [UncompletedCoroutinesError] to denote that child coroutines were leaked, or\n * return a list of uncaught exceptions that should be reported at the end of the test.\n */"} {"signature":"private inline fun < T : AbstractCoroutine < Unit > > handleTimeout ( coroutine : T , dispatchTimeout : Duration , tryGetCompletionCause : T . ( ) -> Throwable ? , cleanup : ( ) -> List < Throwable > , ) : AssertionError","body":"{ val uncaughtExceptions = try { cleanup ( ) } catch ( e : UncompletedCoroutinesError ) { emptyList ( ) } val activeChildren = coroutine . children . filter { it . isActive } . toList ( ) val completionCause = if ( coroutine . isCancelled ) coroutine . tryGetCompletionCause ( ) else null var message = \"\" if ( completionCause == null ) message += \"\" if ( activeChildren . isNotEmpty ( ) ) message += \"\" if ( completionCause != null && activeChildren . isEmpty ( ) ) { message += if ( coroutine . isCompleted ) \"\" else \"\" } val error = UncompletedCoroutinesError ( message ) completionCause ? . let { cause -> error . addSuppressed ( cause ) } uncaughtExceptions . forEach { error . addSuppressed ( it ) } return error }","docstring":"/**\n * Invoked on timeout in [runTest]. Just builds a nice [UncompletedCoroutinesError] and returns it.\n */"} {"signature":"@ Throws ( URISyntaxException :: class ) fun getFileFromResource ( fileName : String ) : File","body":"{ val classLoader : ClassLoader = object { } . javaClass . classLoader val resource : URL ? = classLoader . getResource ( fileName ) return if ( resource == null ) { throw IllegalArgumentException ( \"\" ) } else { File ( resource . toURI ( ) ) } }","docstring":"/** Converts resource string path to the file. */"} {"signature":"fun KtAnalysisSession . getAllAnnotationsFrom ( annotated : KtAnnotated ) : List < Annotations . Annotation >","body":"{ val directAnnotations = getDirectAnnotationsFrom ( annotated ) val backingFieldAnnotations = ( annotated as? KtPropertySymbol ) ? . backingFieldSymbol ? . let { getDirectAnnotationsFrom ( it ) } . orEmpty ( ) val fileLevelAnnotations = ( annotated as? KtSymbol ) ? . let { getFileLevelAnnotationsFrom ( it ) } . orEmpty ( ) return directAnnotations + backingFieldAnnotations + fileLevelAnnotations }","docstring":"/**\n * The examples of annotations from backing field are [JvmField], [JvmSynthetic].\n *\n * @return direct annotations, annotations from backing field and file-level annotations\n */"} {"signature":"internal fun KtAnnotated . getPresentableName ( ) : String ?","body":"= this . annotationsByClassId ( parameterNameAnnotation ) . firstOrNull ( ) ? . arguments ? . firstOrNull { it . name == Name . identifier ( \"\" ) } ? . expression ? . let { it as? KtConstantAnnotationValue } ? . let { it . constantValue . value . toString ( ) }","docstring":"/**\n * Functional types can have **generated** [ParameterName] annotation\n * @see ParameterName\n */"} {"signature":"fun property ( propertyName : String , project : Project ) : Provider < String >","body":"{ return propertiesManager . computeIfAbsent ( project ) { PropertiesManager ( project , parameters . localProperties . get ( ) ) } . property ( propertyName ) }","docstring":"/** Returns a [Provider] of the value of the property with the given [propertyName] in the given [project]. */"} {"signature":"fun get ( propertyName : String , project : Project ) : String ?","body":"{ return property ( propertyName , project ) . orNull }","docstring":"/** Returns the value of the property with the given [propertyName] in the given [project]. */"} {"signature":"fun additionalTrainingAndPartialFreezingAndPartialInitialization ( )","body":"{ val ( train , test ) = fashionMnist ( ) val jsonConfigFile = getJSONConfigFile ( ) val model = Sequential . loadModelConfiguration ( jsonConfigFile ) model . use { val layerList = it . layers . filterIsInstance < Conv2D > ( ) layerList . 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 , layerList ) 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 for a pre-filtered list of layers (Conv2D only), 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 initialized via defined initializers.\n * - No new layers are added.\n *\n * NOTE: Model and weights are resources in `examples` module.\n */"} {"signature":"fun main ( ) : Unit","body":"= additionalTrainingAndPartialFreezingAndPartialInitialization ( )","docstring":"/** */"} {"signature":"fun resnet50additionalTraining ( )","body":"{ val modelHub = TFModelHub ( cacheDirectory = File ( \"\" ) ) val modelType = TFModels . CV . ResNet50 ( ) val model = modelHub . loadModel ( modelType ) val hdfFile = modelHub . loadWeights ( modelType ) val layers = model . layers . toMutableList ( ) layers . forEach ( Layer :: freeze ) val lastLayer = layers . last ( ) for ( outboundLayer in lastLayer . inboundLayers ) outboundLayer . outboundLayers . remove ( lastLayer ) layers . removeLast ( ) val newDenseLayer = Dense ( name = \"\" , kernelInitializer = GlorotUniform ( ) , biasInitializer = GlorotUniform ( ) , outputSize = , activation = Activations . Relu ) newDenseLayer . inboundLayers . add ( layers . last ( ) ) layers . add ( newDenseLayer ) val newDenseLayer2 = Dense ( name = \"\" , kernelInitializer = GlorotUniform ( ) , biasInitializer = GlorotUniform ( ) , outputSize = NUM_CLASSES , activation = Activations . Linear ) newDenseLayer2 . inboundLayers . add ( layers . last ( ) ) layers . add ( newDenseLayer2 ) val model2 = Functional . of ( layers ) val dogsCatsImages = dogsCatsSmallDatasetPath ( ) val dataset = OnFlyImageDataset . create ( File ( dogsCatsImages ) , FromFolders ( mapping = mapOf ( \"\" to , \"\" to ) ) , modelType . createPreprocessing ( model2 ) ) . shuffle ( ) val ( train , test ) = dataset . split ( TRAIN_TEST_SPLIT_RATIO ) model2 . use { it . compile ( optimizer = Adam ( ) , loss = Losses . SOFT_MAX_CROSS_ENTROPY_WITH_LOGITS , metric = Metrics . ACCURACY ) it . loadWeightsForFrozenLayers ( hdfFile ) val accuracyBeforeTraining = it . evaluate ( dataset = test , batchSize = TEST_BATCH_SIZE ) . metrics [ Metrics . ACCURACY ] println ( \"\" ) it . fit ( dataset = train , batchSize = TRAINING_BATCH_SIZE , epochs = EPOCHS ) val accuracyAfterTraining = it . evaluate ( dataset = test , batchSize = TEST_BATCH_SIZE ) . metrics [ Metrics . ACCURACY ] println ( \"\" ) } }","docstring":"/**\n * This example demonstrates the transfer learning concept on ResNet'50 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 * - All layers, excluding the last [Dense], are added to the new Neural Network, its weights are frozen.\n * - New Dense layers are added and initialized via defined initializers.\n * - Model is re-trained on [dogsCatsSmallDatasetPath] dataset.\n *\n * We use the preprocessing DSL to describe the dataset generation pipeline.\n * We demonstrate the workflow on the subset of Kaggle Cats vs Dogs binary classification dataset.\n */"} {"signature":"fun main ( ) : Unit","body":"= resnet50additionalTraining ( )","docstring":"/** */"} {"signature":"fun Project . sourcesJarWithSourcesFromEmbedded ( vararg embeddedDepSourcesJarTasks : TaskProvider < out Jar > , body : Jar . ( ) -> Unit = { } , ) : TaskProvider < Jar >","body":"{ val sourcesJarTask = sourcesJar ( body ) sourcesJarTask . configure { val archiveOperations = serviceOf < ArchiveOperations > ( ) embeddedDepSourcesJarTasks . forEach { embeddedSourceJarTask -> dependsOn ( embeddedSourceJarTask ) from ( embeddedSourceJarTask . map { archiveOperations . zipTree ( it . archiveFile ) } ) } } return sourcesJarTask }","docstring":"/**\n * Also embeds into final '-sources.jar' file source files from embedded dependencies.\n */"} {"signature":"fun Project . javadocJarWithJavadocFromEmbedded ( vararg embeddedDepJavadocJarTasks : TaskProvider < out Jar > , body : Jar . ( ) -> Unit = { } , ) : TaskProvider < Jar >","body":"{ val javadocJarTask = javadocJar ( body ) javadocJarTask . configure { val archiveOperations = serviceOf < ArchiveOperations > ( ) embeddedDepJavadocJarTasks . forEach { embeddedJavadocJarTask -> dependsOn ( embeddedJavadocJarTask ) from ( embeddedJavadocJarTask . map { archiveOperations . zipTree ( it . archiveFile ) } ) } } return javadocJarTask }","docstring":"/**\n * Also embeds into final '-javadoc.jar' file javadoc files from embedded dependencies.\n */"} {"signature":"protected abstract fun mergeFunction ( input : List < Operand < Float > > , tf : Ops ) : Operand < Float >","body":"protected abstract fun mergeFunction ( input : List < Operand < Float > > , tf : Ops ) : Operand < Float >","docstring":"/** Should be overridden in all AbstractMerge descendants. */"} {"signature":"protected open fun checkInputShapes ( inputShapes : List < Shape > )","body":"{ require ( inputShapes . size > ) { \"\" } val firstInputShape = inputShapes . first ( ) . toTensorShape ( ) for ( ( index , inputShape ) in inputShapes . withIndex ( ) ) { val currentInputShape = inputShape . toTensorShape ( ) require ( firstInputShape == currentInputShape ) { \"\" } } }","docstring":"/** Checks shapes of input operands. */"} {"signature":"@ Throws ( IOException :: class ) public fun detectObjects ( imageFile : File , topK : Int = ) : List < DetectedObject >","body":"{ return detectObjects ( ImageConverter . toBufferedImage ( imageFile ) , topK ) }","docstring":"/**\n * Returns the top N detected object for the given image file sorted by the score.\n *\n * NOTE: this method includes the SSD-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":"@ Suppress ( \"\" ) public fun < C > ColumnSet < C > . nameContains ( text : CharSequence , ignoreCase : Boolean = false , ) : TransformableColumnSet < C >","body":"= colsInternal { it . name . contains ( text , ignoreCase ) } as TransformableColumnSet < C >","docstring":"/**\n * @include [NameContainsTextDocs]\n * @set [CommonNameContainsDocs.ExampleArg]\n *\n * `df.`[select][DataFrame.select]` { `[cols][ColumnsSelectionDsl.cols]` { .. }.`[nameContains][ColumnSet.nameContains]`(\"my\") }`\n *\n * `df.`[select][DataFrame.select]` { `[colsOf][SingleColumn.colsOf]`<`[Int][Int]`>().`[nameContains][ColumnSet.nameContains]`(\"my\", ignoreCase = true) }`\n */"} {"signature":"public fun ColumnsSelectionDsl < * > . nameContains ( text : CharSequence , ignoreCase : Boolean = false , ) : TransformableColumnSet < * >","body":"= asSingleColumn ( ) . colsNameContains ( text , ignoreCase )","docstring":"/**\n * @include [NameContainsTextDocs]\n * @set [CommonNameContainsDocs.ExampleArg]\n *\n * `df.`[select][DataFrame.select]` { `[nameContains][ColumnsSelectionDsl.colsNameContains]`(\"my\") }`\n */"} {"signature":"public fun SingleColumn < DataRow < * > > . colsNameContains ( text : CharSequence , ignoreCase : Boolean = false , ) : TransformableColumnSet < * >","body":"= this . ensureIsColumnGroup ( ) . colsInternal { it . name . contains ( text , ignoreCase ) }","docstring":"/**\n * @include [NameContainsTextDocs]\n * @set [CommonNameContainsDocs.ExampleArg]\n *\n * `df.`[select][DataFrame.select]` { someGroupCol.`[colsNameContains][SingleColumn.colsNameContains]`(\"my\") }`\n */"} {"signature":"public fun String . colsNameContains ( text : CharSequence , ignoreCase : Boolean = false , ) : TransformableColumnSet < * >","body":"= columnGroup ( this ) . colsNameContains ( text , ignoreCase )","docstring":"/**\n * @include [NameContainsTextDocs]\n * @set [CommonNameContainsDocs.ExampleArg]\n *\n * `df.`[select][DataFrame.select]` { \"someGroupCol\".`[colsNameContains][String.colsNameContains]`(\"my\") }`\n */"} {"signature":"public fun KProperty < * > . colsNameContains ( text : CharSequence , ignoreCase : Boolean = false , ) : TransformableColumnSet < * >","body":"= columnGroup ( this ) . colsNameContains ( text , ignoreCase )","docstring":"/**\n * @include [NameContainsTextDocs]\n * @set [CommonNameContainsDocs.ExampleArg]\n *\n * `df.`[select][DataFrame.select]` { DataSchemaType::someGroupCol.`[colsNameContains][KProperty.colsNameContains]`(\"my\") }`\n */"} {"signature":"public fun ColumnPath . colsNameContains ( text : CharSequence , ignoreCase : Boolean = false , ) : TransformableColumnSet < * >","body":"= columnGroup ( this ) . colsNameContains ( text , ignoreCase )","docstring":"/**\n * @include [NameContainsTextDocs]\n * @set [CommonNameContainsDocs.ExampleArg]\n *\n * `df.`[select][DataFrame.select]` { \"pathTo\"[\"someGroupCol\"].`[colsNameContains][ColumnPath.colsNameContains]`(\"my\") }`\n */"} {"signature":"@ Suppress ( \"\" ) public fun < C > ColumnSet < C > . nameContains ( regex : Regex ) : TransformableColumnSet < C >","body":"= colsInternal { it . name . contains ( regex ) } as TransformableColumnSet < C >","docstring":"/**\n * @include [NameContainsRegexDocs]\n * @set [CommonNameContainsDocs.ExampleArg]\n *\n * `df.`[select][DataFrame.select]` { `[cols][ColumnsSelectionDsl.cols]` { .. }.`[nameContains][ColumnSet.nameContains]`(`[Regex][Regex]`(\"order-[0-9]+\")) }`\n *\n * `df.`[select][DataFrame.select]` { `[colsOf][SingleColumn.colsOf]`<`[Int][Int]`>().`[nameContains][ColumnSet.nameContains]`(`[Regex][Regex]`(\"order-[0-9]+\")) }`\n */"} {"signature":"public fun ColumnsSelectionDsl < * > . nameContains ( regex : Regex ) : TransformableColumnSet < * >","body":"= asSingleColumn ( ) . colsNameContains ( regex )","docstring":"/**\n * @include [NameContainsRegexDocs]\n * @set [CommonNameContainsDocs.ExampleArg]\n *\n * `df.`[select][DataFrame.select]` { `[nameContains][ColumnsSelectionDsl.nameContains]`(`[Regex][Regex]`(\"order-[0-9]+\")) }`\n */"} {"signature":"public fun SingleColumn < DataRow < * > > . colsNameContains ( regex : Regex ) : TransformableColumnSet < * >","body":"= this . ensureIsColumnGroup ( ) . colsInternal { it . name . contains ( regex ) }","docstring":"/**\n * @include [NameContainsRegexDocs]\n * @set [CommonNameContainsDocs.ExampleArg]\n *\n * `df.`[select][DataFrame.select]` { someGroupCol.`[colsNameContains][SingleColumn.colsNameContains]`(`[Regex][Regex]`(\"order-[0-9]+\")) }`\n */"} {"signature":"public fun String . colsNameContains ( regex : Regex ) : TransformableColumnSet < * >","body":"= columnGroup ( this ) . colsNameContains ( regex )","docstring":"/**\n * @include [NameContainsRegexDocs]\n * @set [CommonNameContainsDocs.ExampleArg]\n *\n * `df.`[select][DataFrame.select]` { \"someGroupCol\".`[colsNameContains][String.colsNameContains]`(`[Regex][Regex]`(\"order-[0-9]+\")) }`\n */"} {"signature":"public fun KProperty < * > . colsNameContains ( regex : Regex ) : TransformableColumnSet < * >","body":"= columnGroup ( this ) . colsNameContains ( regex )","docstring":"/**\n * @include [NameContainsRegexDocs]\n * @set [CommonNameContainsDocs.ExampleArg]\n *\n * `df.`[select][DataFrame.select]` { DataSchemaType::someGroupCol.`[colsNameContains][KProperty.colsNameContains]`(`[Regex][Regex]`(\"order-[0-9]+\")) }`\n */"} {"signature":"public fun ColumnPath . colsNameContains ( regex : Regex ) : TransformableColumnSet < * >","body":"= columnGroup ( this ) . colsNameContains ( regex )","docstring":"/**\n * @include [NameContainsRegexDocs]\n * @set [CommonNameContainsDocs.ExampleArg]\n *\n * `df.`[select][DataFrame.select]` { \"pathTo\"[\"someGroupCol\"].`[colsNameContains][ColumnPath.colsNameContains]`(`[Regex][Regex]`(\"order-[0-9]+\")) }`\n */"} {"signature":"@ Suppress ( \"\" ) public fun < C > ColumnSet < C > . nameStartsWith ( prefix : CharSequence , ignoreCase : Boolean = false , ) : TransformableColumnSet < C >","body":"= colsInternal { it . name . startsWith ( prefix , ignoreCase ) } as TransformableColumnSet < C >","docstring":"/**\n * @include [CommonNameStartsWithDocs]\n * @set [CommonNameStartsEndsDocs.ExampleArg]\n *\n * `df.`[select][DataFrame.select]` { `[colsOf][SingleColumn.colsOf]`<`[Int][Int]`>().`[nameStartsWith][ColumnSet.nameStartsWith]`(\"order-\") }`\n */"} {"signature":"public fun ColumnsSelectionDsl < * > . nameStartsWith ( prefix : CharSequence , ignoreCase : Boolean = false , ) : TransformableColumnSet < * >","body":"= asSingleColumn ( ) . colsNameStartsWith ( prefix , ignoreCase )","docstring":"/**\n * @include [CommonNameStartsWithDocs]\n * @set [CommonNameStartsEndsDocs.ExampleArg]\n *\n * `df.`[select][DataFrame.select]` { `[nameStartsWith][ColumnsSelectionDsl.nameStartsWith]`(\"order-\") }`\n */"} {"signature":"public fun SingleColumn < DataRow < * > > . colsNameStartsWith ( prefix : CharSequence , ignoreCase : Boolean = false , ) : TransformableColumnSet < * >","body":"= this . ensureIsColumnGroup ( ) . colsInternal { it . name . startsWith ( prefix , ignoreCase ) }","docstring":"/**\n * @include [CommonNameStartsWithDocs]\n * @set [CommonNameStartsEndsDocs.ExampleArg]\n *\n * `df.`[select][DataFrame.select]` { someGroupCol.`[colsNameStartsWith][SingleColumn.colsNameStartsWith]`(\"order-\") }`\n */"} {"signature":"public fun String . colsNameStartsWith ( prefix : CharSequence , ignoreCase : Boolean = false , ) : TransformableColumnSet < * >","body":"= columnGroup ( this ) . colsNameStartsWith ( prefix , ignoreCase )","docstring":"/**\n * @include [CommonNameStartsWithDocs]\n * @set [CommonNameStartsEndsDocs.ExampleArg]\n *\n * `df.`[select][DataFrame.select]` { \"someGroupCol\".`[colsNameStartsWith][String.colsNameStartsWith]`(\"order-\") }`\n */"} {"signature":"public fun KProperty < * > . colsNameStartsWith ( prefix : CharSequence , ignoreCase : Boolean = false , ) : TransformableColumnSet < * >","body":"= columnGroup ( this ) . colsNameStartsWith ( prefix , ignoreCase )","docstring":"/**\n * @include [CommonNameStartsWithDocs]\n * @set [CommonNameStartsEndsDocs.ExampleArg]\n *\n * `df.`[select][DataFrame.select]` { DataSchemaType::someGroupCol.`[colsNameStartsWith][KProperty.colsNameStartsWith]`(\"order-\") }`\n */"} {"signature":"public fun ColumnPath . colsNameStartsWith ( prefix : CharSequence , ignoreCase : Boolean = false , ) : TransformableColumnSet < * >","body":"= columnGroup ( this ) . colsNameStartsWith ( prefix , ignoreCase )","docstring":"/**\n * @include [CommonNameStartsWithDocs]\n * @set [CommonNameStartsEndsDocs.ExampleArg]\n *\n * `df.`[select][DataFrame.select]` { \"pathTo\"[\"someGroupCol\"].`[colsNameStartsWith][ColumnPath.colsNameStartsWith]`(\"order-\") }`\n */"} {"signature":"@ Suppress ( \"\" ) public fun < C > ColumnSet < C > . nameEndsWith ( suffix : CharSequence , ignoreCase : Boolean = false , ) : TransformableColumnSet < C >","body":"= colsInternal { it . name . endsWith ( suffix , ignoreCase ) } as TransformableColumnSet < C >","docstring":"/**\n * @include [CommonNameEndsWithDocs]\n * @set [CommonNameStartsEndsDocs.ExampleArg]\n *\n * `df.`[select][DataFrame.select]` { `[colsOf][SingleColumn.colsOf]`<`[Int][Int]`>().`[nameEndsWith][ColumnSet.nameEndsWith]`(\"-order\") }`\n */"} {"signature":"public fun ColumnsSelectionDsl < * > . nameEndsWith ( suffix : CharSequence , ignoreCase : Boolean = false , ) : TransformableColumnSet < * >","body":"= asSingleColumn ( ) . colsNameEndsWith ( suffix , ignoreCase )","docstring":"/**\n * @include [CommonNameEndsWithDocs]\n * @set [CommonNameStartsEndsDocs.ExampleArg]\n *\n * `df.`[select][DataFrame.select]` { `[nameEndsWith][ColumnsSelectionDsl.nameEndsWith]`(\"-order\") }`\n */"} {"signature":"public fun SingleColumn < DataRow < * > > . colsNameEndsWith ( suffix : CharSequence , ignoreCase : Boolean = false , ) : TransformableColumnSet < * >","body":"= this . ensureIsColumnGroup ( ) . colsInternal { it . name . endsWith ( suffix , ignoreCase ) }","docstring":"/**\n * @include [CommonNameEndsWithDocs]\n * @set [CommonNameStartsEndsDocs.ExampleArg]\n *\n * `df.`[select][DataFrame.select]` { someGroupCol.`[colsNameEndsWith][SingleColumn.colsNameEndsWith]`(\"-order\") }`\n */"} {"signature":"public fun String . colsNameEndsWith ( suffix : CharSequence , ignoreCase : Boolean = false , ) : TransformableColumnSet < * >","body":"= columnGroup ( this ) . colsNameEndsWith ( suffix , ignoreCase )","docstring":"/**\n * @include [CommonNameEndsWithDocs]\n * @set [CommonNameStartsEndsDocs.ExampleArg]\n *\n * `df.`[select][DataFrame.select]` { \"someGroupCol\".`[colsNameEndsWith][String.colsNameEndsWith]`(\"-order\") }`\n */"} {"signature":"public fun KProperty < * > . colsNameEndsWith ( suffix : CharSequence , ignoreCase : Boolean = false , ) : TransformableColumnSet < * >","body":"= columnGroup ( this ) . colsNameEndsWith ( suffix , ignoreCase )","docstring":"/**\n * @include [CommonNameEndsWithDocs]\n * @set [CommonNameStartsEndsDocs.ExampleArg]\n *\n * `df.`[select][DataFrame.select]` { DataSchemaType::someGroupCol.`[colsNameEndsWith][KProperty.colsNameEndsWith]`(\"-order\") }`\n */"} {"signature":"public fun ColumnPath . colsNameEndsWith ( suffix : CharSequence , ignoreCase : Boolean = false , ) : TransformableColumnSet < * >","body":"= columnGroup ( this ) . colsNameEndsWith ( suffix , ignoreCase )","docstring":"/**\n * @include [CommonNameEndsWithDocs]\n * @set [CommonNameStartsEndsDocs.ExampleArg]\n *\n * `df.`[select][DataFrame.select]` { \"pathTo\"[\"someGroupCol\"].`[colsNameEndsWith][ColumnPath.colsNameEndsWith]`(\"-order\") }`\n */"} {"signature":"fun validateArguments ( errors : ArgumentParseErrors ? ) : String ?","body":"{ if ( errors == null ) return null if ( errors . argumentWithoutValue != null ) { return \"\" } errors . booleanArgumentWithValue ? . let { arg -> return \"\" } if ( errors . unknownArgs . isNotEmpty ( ) ) { return \"\" } return null }","docstring":"/**\n * @return error message if arguments are parsed incorrectly, null otherwise\n */"} {"signature":"fun StubType . map ( shouldExpandTypeAliases : Boolean = true ) : KmType","body":"= when ( this ) { is AbbreviatedType -> { val typeAliasClassifier = KmClassifier . TypeAlias ( abbreviatedClassifier . fqNameSerialized ) val typeArguments = typeArguments . map { it . map ( shouldExpandTypeAliases ) } val abbreviatedType = KmType ( ) . also { km -> km . modifiersFrom ( this ) km . classifier = typeAliasClassifier km . arguments += typeArguments } if ( shouldExpandTypeAliases ) { KmType ( ) . also { km -> km . isNullable = this . isEffectivelyNullable ( ) km . abbreviatedType = abbreviatedType val kmUnderlyingType = underlyingType . map ( true ) km . arguments += kmUnderlyingType . arguments km . classifier = kmUnderlyingType . classifier } } else { abbreviatedType } } is ClassifierStubType -> KmType ( ) . also { km -> km . modifiersFrom ( this ) typeArguments . mapTo ( km . arguments ) { it . map ( shouldExpandTypeAliases ) } km . classifier = KmClassifier . Class ( classifier . fqNameSerialized ) } is FunctionalType -> KmType ( ) . also { km -> km . modifiersFrom ( this ) typeArguments . mapTo ( km . arguments ) { it . map ( shouldExpandTypeAliases ) } km . classifier = KmClassifier . Class ( classifier . fqNameSerialized ) } is TypeParameterType -> KmType ( ) . also { km -> km . modifiersFrom ( this ) km . classifier = KmClassifier . TypeParameter ( id ) } }","docstring":"/**\n * @param shouldExpandTypeAliases describes how should we write type aliases.\n * If [shouldExpandTypeAliases] is true then type alias-based types are written as\n * ```\n * Type {\n * abbreviatedType = AbbreviatedType.abbreviatedClassifier\n * classifier = AbbreviatedType.underlyingType\n * arguments = AbbreviatedType.underlyingType.typeArguments\n * }\n * ```\n * So we basically replacing type alias with underlying class.\n * Otherwise:\n * ```\n * Type {\n * classifier = AbbreviatedType.abbreviatedClassifier\n * }\n * ```\n * As of 25 Nov 2019, the latter form is used only for KmTypeAlias.underlyingType.\n */"} {"signature":"private fun String ? . toTeamCityFormat ( ) : String","body":"= this ? . let { it . replace ( \"\" , \"\" ) . replace ( \"\" , \"\" ) . replace ( \"\" , \"\" ) . replace ( \"\" , \"\" ) . replace ( \"\" , \"\" ) . replace ( \"\" , \"\" ) } ? : \"\"","docstring":"/**\n * Teamcity require escaping some symbols in pipe manner.\n * https://github.com/GitTools/GitVersion/issues/94\n */"} {"signature":"fun IrType . eraseTypeParameters ( ) : IrType","body":"= when ( this ) { is IrSimpleType -> when ( val owner = classifier . owner ) { is IrScript -> { assert ( arguments . isEmpty ( ) ) { \"\" + owner . render ( ) } IrSimpleTypeImpl ( classifier , nullability , emptyList ( ) , annotations ) } is IrClass -> IrSimpleTypeImpl ( classifier , nullability , arguments . map { it . eraseTypeParameters ( ) } , annotations ) is IrTypeParameter -> owner . erasedType ( isNullable ( ) ) else -> error ( \"\" ) } is IrErrorType -> this else -> error ( \"\" ) }","docstring":"/**\n * Perform as much type erasure as is significant for JVM signature generation.\n * Class types are kept as is, while type parameters are replaced with their\n * erased upper bounds, keeping the nullability information.\n *\n * For example, a type parameter `T?` where `T : Any`, `T : Comparable` is\n * erased to `Any?`.\n *\n * Type arguments to the erased upper bound are replaced by `*`, since\n * recursive erasure could loop. For example, a type parameter\n * `T : Comparable` is replaced by `Comparable<*>`.\n */"} {"signature":"fun IrType . defaultValue ( startOffset : Int , endOffset : Int , context : JvmBackendContext ) : IrExpression","body":"{ val classifier = this . classifierOrNull if ( classifier is IrTypeParameterSymbol ) { return classifier . owner . representativeUpperBound . defaultValue ( startOffset , endOffset , context ) } if ( this !is IrSimpleType || this . isMarkedNullable ( ) || classOrNull ? . owner ? . isSingleFieldValueClass != true ) return IrConstImpl . defaultValueForType ( startOffset , endOffset , this ) val underlyingType = unboxInlineClass ( ) val defaultValueForUnderlyingType = IrConstImpl . defaultValueForType ( startOffset , endOffset , underlyingType ) return IrCallImpl . fromSymbolOwner ( startOffset , endOffset , this , context . ir . symbols . unsafeCoerceIntrinsic ) . also { it . putTypeArgument ( , underlyingType ) it . putTypeArgument ( , this ) it . putValueArgument ( , defaultValueForUnderlyingType ) } }","docstring":"/**\n * Get the default null/0 value for the type.\n *\n * This handles unboxing of non-nullable inline class types to their underlying types and produces\n * a null/0 default value for the resulting type. When such unboxing takes place it ensures that\n * the value is not reboxed and reunboxed by the codegen by using the unsafeCoerceIntrinsic.\n */"} {"signature":"@ SinceKotlin ( \"\" ) fun KClassifier . createType ( arguments : List < KTypeProjection > = emptyList ( ) , nullable : Boolean = false , annotations : List < Annotation > = emptyList ( ) ) : KType","body":"{ val descriptor = ( this as? KClassifierImpl ) ? . descriptor ? : throw KotlinReflectionInternalError ( \"\" ) val typeConstructor = descriptor . typeConstructor val parameters = typeConstructor . parameters if ( parameters . size != arguments . size ) { throw IllegalArgumentException ( \"\" ) } val typeAttributes = if ( annotations . isEmpty ( ) ) TypeAttributes . Empty else TypeAttributes . Empty return KTypeImpl ( createKotlinType ( typeAttributes , typeConstructor , arguments , nullable ) ) }","docstring":"/**\n * Creates a [KType] instance with the given classifier, type arguments, nullability and annotations.\n * If the number of passed type arguments is not equal to the total number of type parameters of a classifier,\n * an exception is thrown. If any of the arguments does not satisfy the bounds of the corresponding type parameter,\n * an exception is thrown.\n *\n * For classifiers representing type parameters, the type argument list must always be empty.\n * For classes, the type argument list should contain arguments for the type parameters of the class. If the class is `inner`,\n * the list should follow with arguments for the type parameters of its outer class, and so forth until a class is\n * not `inner`, or is declared on the top level.\n */"} {"signature":"fun plugin ( instance : DokkaPlugin )","body":"fun plugin ( instance : DokkaPlugin )","docstring":"/**\n * Add a plugin instance to a project\n */"} {"signature":"fun verify ( )","body":"fun verify ( )","docstring":"/**\n * Verifies that this project is valid from the user's and Dokka's perspectives.\n * Exists to save time with debugging difficult to catch mistakes, such as copy-pasted\n * test data that is not applicable to this project.\n *\n * Must throw an exception if there's misconfiguration, incorrect / corrupted test data\n * or API misuse.\n *\n * Verification is performed before running Dokka on this project.\n */"} {"signature":"fun getConfiguration ( ) : TestDokkaConfiguration","body":"fun getConfiguration ( ) : TestDokkaConfiguration","docstring":"/**\n * Returns the configuration of this project, which will then be mapped to [DokkaConfiguration].\n *\n * This is typically constructed using [BaseTestDokkaConfigurationBuilder].\n */"} {"signature":"fun getPluginList ( ) : List < DokkaPlugin >","body":"fun getPluginList ( ) : List < DokkaPlugin >","docstring":"/**\n * Returns the list of plugins, which will then be directly passed to [DokkaContext].\n *\n * Unlike [DokkaConfiguration.pluginsClasspath], it does not require a JAR file with a configuration of [java.util.ServiceLoader]\n */"} {"signature":"fun getTestData ( ) : TestData","body":"fun getTestData ( ) : TestData","docstring":"/**\n * Returns this project's test data - a collection of source code files, markdown files\n * and whatever else that can be usually found in a user-defined project.\n */"} {"signature":"fun TestProject . parse ( logger : DokkaLogger = defaultAnalysisLogger ) : DModule","body":"= TestProjectAnalyzer . parse ( this , logger )","docstring":"/**\n * Runs Dokka on the given [TestProject] and returns the generated documentable model.\n *\n * Can be used to verify the resulting documentable model, to check that\n * everything was parsed and converted correctly.\n *\n * Usage example:\n * ```kotlin\n * val testProject = kotlinJvmTestProject {\n * ...\n * }\n *\n * val module: DModule = testProject.parse()\n * ```\n *\n * @param logger logger to be used for running Dokka and tests. Custom loggers like [CollectingDokkaConsoleLogger]\n * can be useful in verifying the behavior.\n */"} {"signature":"fun TestProject . useServices ( logger : DokkaLogger = defaultAnalysisLogger , block : TestAnalysisServices . ( context : TestAnalysisContext ) -> Unit )","body":"{ withTempDirectory { tempDirectory -> val ( services , context ) = TestProjectAnalyzer . analyze ( this , tempDirectory , logger ) services . block ( context ) } }","docstring":"/**\n * Runs Dokka on the given [TestProject] and provides not only the resulting documentable model,\n * but analysis context and configuration as well, which gives you the ability to call public\n * analysis services.\n *\n * Usage example:\n *\n * ```kotlin\n * val testProject = kotlinJvmTestProject {\n * ...\n * }\n *\n * testProject.useServices { context ->\n * val pckg: DPackage = context.module.packages.single()\n *\n * // use `moduleAndPackageDocumentationReader` service to get documentation of a package\n * val allPackageDocs: SourceSetDependent = moduleAndPackageDocumentationReader.read(pckg)\n * }\n * ```\n *\n * @param logger logger to be used for running Dokka and tests. Custom loggers like [CollectingDokkaConsoleLogger]\n * can be useful in verifying the behavior.\n */"} {"signature":"@ Suppress ( \"\" ) public fun Format ( block : DateTimeFormatBuilder . WithDateTimeComponents . ( ) -> Unit ) : DateTimeFormat < DateTimeComponents >","body":"{ val builder = DateTimeComponentsFormat . Builder ( AppendableFormatStructure ( ) ) block ( builder ) return DateTimeComponentsFormat ( builder . build ( ) ) }","docstring":"/**\n * Creates a [DateTimeFormat] for [DateTimeComponents] values using [DateTimeFormatBuilder.WithDateTimeComponents].\n *\n * There is a collection of predefined formats in [DateTimeComponents.Formats].\n *\n * @throws IllegalArgumentException if parsing using this format is ambiguous.\n */"} {"signature":"public fun setTime ( localTime : LocalTime )","body":"{ contents . time . populateFrom ( localTime ) }","docstring":"/**\n * Writes the contents of the specified [localTime] to this [DateTimeComponents].\n * The [localTime] is written to the [hour], [hourOfAmPm], [amPm], [minute], [second] and [nanosecond] fields.\n *\n * If any of the fields are already set, they will be overwritten.\n */"} {"signature":"public fun setDate ( localDate : LocalDate )","body":"{ contents . date . populateFrom ( localDate ) }","docstring":"/**\n * Writes the contents of the specified [localDate] to this [DateTimeComponents].\n * The [localDate] is written to the [year], [monthNumber], [dayOfMonth], and [dayOfWeek] fields.\n *\n * If any of the fields are already set, they will be overwritten.\n */"} {"signature":"public fun setDateTime ( localDateTime : LocalDateTime )","body":"{ contents . date . populateFrom ( localDateTime . date ) contents . time . populateFrom ( localDateTime . time ) }","docstring":"/**\n * Writes the contents of the specified [localDateTime] to this [DateTimeComponents].\n * The [localDateTime] is written to the\n * [year], [monthNumber], [dayOfMonth], [dayOfWeek],\n * [hour], [hourOfAmPm], [amPm], [minute], [second] and [nanosecond] fields.\n *\n * If any of the fields are already set, they will be overwritten.\n */"} {"signature":"public fun setOffset ( utcOffset : UtcOffset )","body":"{ contents . offset . populateFrom ( utcOffset ) }","docstring":"/**\n * Writes the contents of the specified [utcOffset] to this [DateTimeComponents].\n * The [utcOffset] is written to the [offsetHours], [offsetMinutesOfHour], [offsetSecondsOfMinute], and\n * [offsetIsNegative] fields.\n *\n * If any of the fields are already set, they will be overwritten.\n */"} {"signature":"public fun setDateTimeOffset ( instant : Instant , utcOffset : UtcOffset )","body":"{ val smallerInstant = Instant . fromEpochSeconds ( instant . epochSeconds % SECONDS_PER_10000_YEARS , instant . nanosecondsOfSecond ) setDateTime ( smallerInstant . toLocalDateTime ( utcOffset ) ) setOffset ( utcOffset ) year = year ! ! + ( ( instant . epochSeconds / SECONDS_PER_10000_YEARS ) * ) . toInt ( ) }","docstring":"/**\n * Writes the contents of the specified [instant] to this [DateTimeComponents].\n *\n * This method is almost always equivalent to the following code:\n * ```\n * setDateTime(instant.toLocalDateTime(offset))\n * setOffset(utcOffset)\n * ```\n * However, this also works for instants that are too large to be represented as a [LocalDateTime].\n *\n * If any of the fields are already set, they will be overwritten.\n */"} {"signature":"public fun setDateTimeOffset ( localDateTime : LocalDateTime , utcOffset : UtcOffset )","body":"{ setDateTime ( localDateTime ) setOffset ( utcOffset ) }","docstring":"/**\n * Writes the contents of the specified [localDateTime] and [utcOffset] to this [DateTimeComponents].\n *\n * A shortcut for calling [setDateTime] and [setOffset] separately.\n *\n * If [localDateTime] is obtained from an [Instant] using [LocalDateTime.toInstant], it is recommended to use\n * [setDateTimeOffset] that accepts an [Instant] directly.\n */"} {"signature":"public fun toUtcOffset ( ) : UtcOffset","body":"= contents . offset . toUtcOffset ( )","docstring":"/**\n * Builds a [UtcOffset] from the fields in this [DateTimeComponents].\n *\n * This method uses the following fields:\n * * [offsetIsNegative] (default value is `false`)\n * * [offsetHours] (default value is 0)\n * * [offsetMinutesOfHour] (default value is 0)\n * * [offsetSecondsOfMinute] (default value is 0)\n *\n * @throws IllegalArgumentException if any of the fields has an out-of-range value.\n */"} {"signature":"public fun toLocalDate ( ) : LocalDate","body":"= contents . date . toLocalDate ( )","docstring":"/**\n * Builds a [LocalDate] from the fields in this [DateTimeComponents].\n *\n * This method uses the following fields:\n * * [year]\n * * [monthNumber]\n * * [dayOfMonth]\n *\n * Also, [dayOfWeek] is checked for consistency with the other fields.\n *\n * @throws IllegalArgumentException if any of the fields is missing or invalid.\n */"} {"signature":"public fun toLocalTime ( ) : LocalTime","body":"= contents . time . toLocalTime ( )","docstring":"/**\n * Builds a [LocalTime] from the fields in this [DateTimeComponents].\n *\n * This method uses the following fields:\n * * [hour], [hourOfAmPm], and [amPm]\n * * [minute]\n * * [second] (default value is 0)\n * * [nanosecond] (default value is 0)\n *\n * @throws IllegalArgumentException if hours or minutes are not present, if any of the fields are invalid, or\n * [hourOfAmPm] and [amPm] are inconsistent with [hour].\n */"} {"signature":"public fun toLocalDateTime ( ) : LocalDateTime","body":"= toLocalDate ( ) . atTime ( toLocalTime ( ) )","docstring":"/**\n * Builds a [LocalDateTime] from the fields in this [DateTimeComponents].\n *\n * This method uses the following fields:\n * * [year]\n * * [monthNumber]\n * * [dayOfMonth]\n * * [hour], [hourOfAmPm], and [amPm]\n * * [minute]\n * * [second] (default value is 0)\n * * [nanosecond] (default value is 0)\n *\n * Also, [dayOfWeek] is checked for consistency with the other fields.\n *\n * @throws IllegalArgumentException if any of the required fields are not present,\n * any of the fields are invalid, or there's inconsistency.\n *\n * @see toLocalDate\n * @see toLocalTime\n */"} {"signature":"public fun toInstantUsingOffset ( ) : Instant","body":"{ val offset = toUtcOffset ( ) val time = toLocalTime ( ) val truncatedDate = contents . date . copy ( ) truncatedDate . year = requireParsedField ( truncatedDate . year , \"\" ) % val totalSeconds = try { val secDelta = safeMultiply ( ( year ! ! / ) . toLong ( ) , SECONDS_PER_10000_YEARS ) val epochDays = truncatedDate . toLocalDate ( ) . toEpochDays ( ) . toLong ( ) safeAdd ( secDelta , epochDays * SECONDS_PER_DAY + time . toSecondOfDay ( ) - offset . totalSeconds ) } catch ( e : ArithmeticException ) { throw DateTimeFormatException ( \"\" , e ) } if ( totalSeconds < Instant . MIN . epochSeconds || totalSeconds > Instant . MAX . epochSeconds ) throw DateTimeFormatException ( \"\" ) return Instant . fromEpochSeconds ( totalSeconds , nanosecond ? : ) }","docstring":"/**\n * Builds an [Instant] from the fields in this [DateTimeComponents].\n *\n * Uses the fields required for [toLocalDateTime] and [toUtcOffset].\n *\n * Almost always equivalent to `toLocalDateTime().toInstant(toUtcOffset())`, but also accounts for cases when\n * the year is outside the range representable by [LocalDate] but not outside the range representable by [Instant].\n *\n * @throws IllegalArgumentException if any of the required fields are not present, out-of-range, or inconsistent\n * with one another.\n */"} {"signature":"public fun DateTimeFormat < DateTimeComponents > . format ( block : DateTimeComponents . ( ) -> Unit ) : String","body":"= format ( DateTimeComponents ( ) . apply { block ( ) } )","docstring":"/**\n * Uses this format to format an unstructured [DateTimeComponents].\n *\n * [block] is called on an initially-empty [DateTimeComponents] before formatting.\n *\n * Example:\n * ```\n * // Mon, 16 Mar 2020 23:59:59 +0300\n * DateTimeComponents.Formats.RFC_1123.format {\n * setDateTime(LocalDateTime(2020, 3, 16, 23, 59, 59, 999_999_999))\n * setOffset(UtcOffset(hours = 3))\n * }\n * ```\n *\n * @throws IllegalStateException if some values needed for the format are not present or can not be formatted:\n * for example, trying to format [DateTimeFormatBuilder.WithDate.monthName] using a [DateTimeComponents.monthNumber]\n * value of 20.\n */"} {"signature":"public fun DateTimeComponents . Companion . parse ( input : CharSequence , format : DateTimeFormat < DateTimeComponents > ) : DateTimeComponents","body":"= format . parse ( input )","docstring":"/**\n * Parses a [DateTimeComponents] from [input] using the given format.\n * Equivalent to calling [DateTimeFormat.parse] on [format] with [input].\n *\n * [DateTimeComponents] does not perform any validation, so even invalid values may be parsed successfully if the string pattern\n * matches.\n *\n * @throws IllegalArgumentException if the text does not match the format.\n */"} {"signature":"public fun vgg19 ( imageSize : Long = , numberOfClasses : Int = , numberOfInputChannels : Long = , lastLayerActivation : Activations = Activations . Linear ) : Sequential","body":"{ return Sequential . of ( Input ( imageSize , imageSize , numberOfInputChannels ) , Conv2D ( filters = , kernelSize = intArrayOf ( , ) , strides = intArrayOf ( , , , ) , dilations = intArrayOf ( , , , ) , activation = Activations . Relu , kernelInitializer = GlorotUniform ( ) , biasInitializer = Zeros ( ) , padding = ConvPadding . SAME , name = \"\" ) , Conv2D ( filters = , kernelSize = intArrayOf ( , ) , strides = intArrayOf ( , , , ) , dilations = intArrayOf ( , , , ) , activation = Activations . Relu , kernelInitializer = GlorotUniform ( ) , biasInitializer = Zeros ( ) , padding = ConvPadding . SAME , name = \"\" ) , MaxPool2D ( poolSize = intArrayOf ( , , , ) , strides = intArrayOf ( , , , ) , padding = ConvPadding . VALID , name = \"\" ) , Conv2D ( filters = , kernelSize = intArrayOf ( , ) , strides = intArrayOf ( , , , ) , dilations = intArrayOf ( , , , ) , activation = Activations . Relu , kernelInitializer = GlorotUniform ( ) , biasInitializer = Zeros ( ) , padding = ConvPadding . SAME , name = \"\" ) , Conv2D ( filters = , kernelSize = intArrayOf ( , ) , strides = intArrayOf ( , , , ) , dilations = intArrayOf ( , , , ) , activation = Activations . Relu , kernelInitializer = GlorotUniform ( ) , biasInitializer = Zeros ( ) , padding = ConvPadding . SAME , name = \"\" ) , MaxPool2D ( poolSize = intArrayOf ( , , , ) , strides = intArrayOf ( , , , ) , padding = ConvPadding . VALID , name = \"\" ) , Conv2D ( filters = , kernelSize = intArrayOf ( , ) , strides = intArrayOf ( , , , ) , dilations = intArrayOf ( , , , ) , activation = Activations . Relu , kernelInitializer = GlorotUniform ( ) , biasInitializer = Zeros ( ) , padding = ConvPadding . SAME , name = \"\" ) , Conv2D ( filters = , kernelSize = intArrayOf ( , ) , strides = intArrayOf ( , , , ) , dilations = intArrayOf ( , , , ) , activation = Activations . Relu , kernelInitializer = GlorotUniform ( ) , biasInitializer = Zeros ( ) , padding = ConvPadding . SAME , name = \"\" ) , Conv2D ( filters = , kernelSize = intArrayOf ( , ) , strides = intArrayOf ( , , , ) , dilations = intArrayOf ( , , , ) , activation = Activations . Relu , kernelInitializer = GlorotUniform ( ) , biasInitializer = Zeros ( ) , padding = ConvPadding . SAME , name = \"\" ) , Conv2D ( filters = , kernelSize = intArrayOf ( , ) , strides = intArrayOf ( , , , ) , dilations = intArrayOf ( , , , ) , activation = Activations . Relu , kernelInitializer = GlorotUniform ( ) , biasInitializer = Zeros ( ) , padding = ConvPadding . SAME , name = \"\" ) , MaxPool2D ( poolSize = intArrayOf ( , , , ) , strides = intArrayOf ( , , , ) , padding = ConvPadding . VALID , name = \"\" ) , Conv2D ( filters = , kernelSize = intArrayOf ( , ) , strides = intArrayOf ( , , , ) , dilations = intArrayOf ( , , , ) , activation = Activations . Relu , kernelInitializer = GlorotUniform ( ) , biasInitializer = Zeros ( ) , padding = ConvPadding . SAME , name = \"\" ) , Conv2D ( filters = , kernelSize = intArrayOf ( , ) , strides = intArrayOf ( , , , ) , dilations = intArrayOf ( , , , ) , activation = Activations . Relu , kernelInitializer = GlorotUniform ( ) , biasInitializer = Zeros ( ) , padding = ConvPadding . SAME , name = \"\" ) , Conv2D ( filters = , kernelSize = intArrayOf ( , ) , strides = intArrayOf ( , , , ) , dilations = intArrayOf ( , , , ) , activation = Activations . Relu , kernelInitializer = GlorotUniform ( ) , biasInitializer = Zeros ( ) , padding = ConvPadding . SAME , name = \"\" ) , Conv2D ( filters = , kernelSize = intArrayOf ( , ) , strides = intArrayOf ( , , , ) , dilations = intArrayOf ( , , , ) , activation = Activations . Relu , kernelInitializer = GlorotUniform ( ) , biasInitializer = Zeros ( ) , padding = ConvPadding . SAME , name = \"\" ) , MaxPool2D ( poolSize = intArrayOf ( , , , ) , strides = intArrayOf ( , , , ) , padding = ConvPadding . VALID , name = \"\" ) , Conv2D ( filters = , kernelSize = intArrayOf ( , ) , strides = intArrayOf ( , , , ) , dilations = intArrayOf ( , , , ) , activation = Activations . Relu , kernelInitializer = GlorotUniform ( ) , biasInitializer = Zeros ( ) , padding = ConvPadding . SAME , name = \"\" ) , Conv2D ( filters = , kernelSize = intArrayOf ( , ) , strides = intArrayOf ( , , , ) , dilations = intArrayOf ( , , , ) , activation = Activations . Relu , kernelInitializer = GlorotUniform ( ) , biasInitializer = Zeros ( ) , padding = ConvPadding . SAME , name = \"\" ) , Conv2D ( filters = , kernelSize = intArrayOf ( , ) , strides = intArrayOf ( , , , ) , dilations = intArrayOf ( , , , ) , activation = Activations . Relu , kernelInitializer = GlorotUniform ( ) , biasInitializer = Zeros ( ) , padding = ConvPadding . SAME , name = \"\" ) , Conv2D ( filters = , kernelSize = intArrayOf ( , ) , strides = intArrayOf ( , , , ) , dilations = intArrayOf ( , , , ) , activation = Activations . Relu , kernelInitializer = GlorotUniform ( ) , biasInitializer = Zeros ( ) , padding = ConvPadding . SAME , name = \"\" ) , MaxPool2D ( poolSize = intArrayOf ( , , , ) , strides = intArrayOf ( , , , ) , padding = ConvPadding . VALID , name = \"\" ) , Flatten ( ) , Dense ( outputSize = , activation = Activations . Relu , kernelInitializer = GlorotUniform ( ) , biasInitializer = Zeros ( ) , name = \"\" ) , Dense ( outputSize = , activation = Activations . Relu , kernelInitializer = GlorotUniform ( ) , biasInitializer = Zeros ( ) , name = \"\" ) , Dense ( outputSize = numberOfClasses , activation = lastLayerActivation , kernelInitializer = GlorotUniform ( ) , biasInitializer = Zeros ( ) , name = \"\" ) ) }","docstring":"/**\n * Instantiates the VGG19 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 * Very Deep Convolutional Networks for Large-Scale Image Recognition (ICLR 2015).\n * @see \n * Detailed description of VGG'19 model and an approach to build it in Keras.\n */"} {"signature":"fun eval ( code : Code , compilingOptions : JupyterCompilingOptions = JupyterCompilingOptions . DEFAULT , evaluatorWorkflowListener : EvaluatorWorkflowListener ? = null , ) : InternalEvalResult","body":"fun eval ( code : Code , compilingOptions : JupyterCompilingOptions = JupyterCompilingOptions . DEFAULT , evaluatorWorkflowListener : EvaluatorWorkflowListener ? = null , ) : InternalEvalResult","docstring":"/**\n * Executes code snippet\n * @throws IllegalStateException if this method was invoked recursively\n */"} {"signature":"fun popAddedCompiledScripts ( ) : SerializedCompiledScriptsData","body":"= SerializedCompiledScriptsData . EMPTY","docstring":"/**\n * Pop a serialized form of recently added compiled scripts\n *\n * This operation is stateful: second call of this method in a row always\n * returns empty data or null\n */"} {"signature":"suspend fun complete ( snippet : SourceCode , cursor : SourceCode . Position , configuration : ScriptCompilationConfiguration ) : ResultWithDiagnostics < ReplCompletionResult >","body":"suspend fun complete ( snippet : SourceCode , cursor : SourceCode . Position , configuration : ScriptCompilationConfiguration ) : ResultWithDiagnostics < ReplCompletionResult >","docstring":"/**\n * Returns the list of possible reference variants in [cursor] position.\n * Generally doesn't change the internal state of implementing object.\n * @param snippet Completion context\n * @param cursor Cursor position in which completion variants should be calculated\n * @param configuration Compilation configuration which is used. Script should be analyzed, but code generation is not performed\n * @return List of reference variants\n */"} {"signature":"suspend fun analyze ( snippet : SourceCode , cursor : SourceCode . Position , configuration : ScriptCompilationConfiguration ) : ResultWithDiagnostics < ReplAnalyzerResult >","body":"suspend fun analyze ( snippet : SourceCode , cursor : SourceCode . Position , configuration : ScriptCompilationConfiguration ) : ResultWithDiagnostics < ReplAnalyzerResult >","docstring":"/**\n * Reports compilation errors and warnings in the given [snippet]\n * @param snippet Code to analyze\n * @param cursor Current cursor position. May be used by implementation for suppressing errors and warnings near it.\n * @param configuration Compilation configuration which is used. Script should be analyzed, but code generation is not performed\n * @return List of diagnostic messages\n */"} {"signature":"public fun ClassName . toJvmInternalName ( ) : String","body":"= if ( this . isLocalClassName ( ) ) substring ( ) else replace ( '' , '' )","docstring":"/**\n * Converts [this] to a JVM internal name of the class, where package names are separated by '/', and class names are separated by '$',\n * for example: `\"org/foo/bar/Baz.Nested\"` -> `\"org/foo/bar/Baz$Nested\"`\n */"} {"signature":"public fun Metadata ( kind : Int ? = null , metadataVersion : IntArray ? = null , data1 : Array < String > ? = null , data2 : Array < String > ? = null , extraString : String ? = null , packageName : String ? = null , extraInt : Int ? = null ) : Metadata","body":"= Metadata ( kind ? : , metadataVersion ? : intArrayOf ( ) , intArrayOf ( , , ) , data1 ? : emptyArray ( ) , data2 ? : emptyArray ( ) , extraString ? : \"\" , packageName ? : \"\" , extraInt ? : )","docstring":"/**\n * Helper function to instantiate [Metadata].\n * Contrary to a direct constructor call, this one accepts nullable parameters to substitute nulls with default values.\n * Also, this one does not accept [Metadata.bytecodeVersion] as it is deprecated.\n */"} {"signature":"public fun AnyFrame . arrowWriter ( ) : ArrowWriter","body":"= this . arrowWriter ( this . columns ( ) . toArrowSchema ( ) )","docstring":"/**\n * Create [ArrowWriter] for [this] DataFrame with target schema matching actual data\n */"} {"signature":"public fun AnyFrame . arrowWriter ( targetSchema : Schema , mode : ArrowWriter . Mode = ArrowWriter . Mode . STRICT , mismatchSubscriber : ( ConvertingMismatch ) -> Unit = ignoreMismatchMessage , ) : ArrowWriter","body":"= ArrowWriter . create ( this , targetSchema , mode , mismatchSubscriber )","docstring":"/**\n * Create [ArrowWriter] for [this] DataFrame with explicit [targetSchema].\n * If DataFrame does not match with [targetSchema], behaviour is specified by [mode], mismatches would be sent to [mismatchSubscriber]\n */"} {"signature":"public fun AnyFrame . writeArrowIPC ( channel : WritableByteChannel )","body":"{ this . arrowWriter ( ) . use { writer -> writer . writeArrowIPC ( channel ) } }","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 AnyFrame . writeArrowIPC ( stream : OutputStream )","body":"{ this . arrowWriter ( ) . use { writer -> writer . writeArrowIPC ( 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 AnyFrame . writeArrowIPC ( file : File , append : Boolean = true )","body":"{ this . arrowWriter ( ) . use { writer -> writer . writeArrowIPC ( 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 AnyFrame . saveArrowIPCToByteArray ( ) : ByteArray","body":"{ return this . arrowWriter ( ) . use { writer -> writer . saveArrowIPCToByteArray ( ) } }","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 AnyFrame . writeArrowFeather ( channel : WritableByteChannel )","body":"{ this . arrowWriter ( ) . use { writer -> writer . writeArrowFeather ( channel ) } }","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 AnyFrame . writeArrowFeather ( stream : OutputStream )","body":"{ this . arrowWriter ( ) . use { writer -> writer . writeArrowFeather ( 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 AnyFrame . writeArrowFeather ( file : File )","body":"{ this . arrowWriter ( ) . use { writer -> writer . writeArrowFeather ( 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 AnyFrame . saveArrowFeatherToByteArray ( ) : ByteArray","body":"{ return this . arrowWriter ( ) . use { writer -> writer . saveArrowFeatherToByteArray ( ) } }","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":"protected fun doTestByKtFile ( ktFile : KtFile , testServices : TestServices )","body":"{ fun TextRange . asLineColumnRange ( ) : String { return getLineAndColumnRangeInPsiFile ( ktFile , this ) . toString ( ) } analyseForTest ( ktFile ) { val diagnosticsInFile = ktFile . collectDiagnosticsForFile ( KtDiagnosticCheckerFilter . EXTENDED_AND_COMMON_CHECKERS ) . map { it . getKey ( ) } . sorted ( ) val diagnosticsFromElements = buildList { ktFile . accept ( object : KtTreeVisitorVoid ( ) { override fun visitKtElement ( element : KtElement ) { for ( diagnostic in element . getDiagnostics ( KtDiagnosticCheckerFilter . EXTENDED_AND_COMMON_CHECKERS ) ) { add ( element to diagnostic . getKey ( ) ) } super . visitKtElement ( element ) } } ) } . sortedBy { ( _ , diagnostic ) -> diagnostic } val actual = buildString { fun DiagnosticKey . print ( indent : Int ) { val indentString = \"\" . repeat ( indent ) append ( indentString + factoryName ) appendLine ( \"\" ) appendLine ( \"\" ) } appendLine ( \"\" ) for ( ( element , diagnostic ) in diagnosticsFromElements ) { appendLine ( \"\" ) diagnostic . print ( ) } } testServices . assertions . assertEqualsToTestDataFileSibling ( actual ) assertEquals ( diagnosticsInFile , diagnosticsFromElements . map { ( _ , v ) -> v } , \"\" ) } }","docstring":"/**\n * [ktFile] may be a fake file for dangling module tests.\n */"} {"signature":"protected fun compileLibrary ( libraryName : String , destination : File = File ( tmpdir , \"\" ) , additionalOptions : List < String > = emptyList ( ) , compileJava : ( sourceDir : File , javaFiles : List < File > , outputDir : File ) -> Boolean = { _ , javaFiles , outputDir -> KotlinTestUtils . compileJavaFiles ( javaFiles , listOf ( \"\" , outputDir . path ) ) } , checkKotlinOutput : ( String ) -> Unit = { actual -> assertEquals ( normalizeOutput ( \"\" to ExitCode . OK ) , actual ) } , manifest : Manifest ? = null , extraClassPath : List < File > = emptyList ( ) ) : File","body":"{ val sourceDir = File ( testDataDirectory , libraryName ) val javaFiles = FileUtil . findFilesByMask ( JAVA_FILES , sourceDir ) val kotlinFiles = FileUtil . findFilesByMask ( KOTLIN_FILES , sourceDir ) assert ( javaFiles . isNotEmpty ( ) || kotlinFiles . isNotEmpty ( ) ) { \"\" } val isJar = destination . name . endsWith ( \"\" ) val outputDir = if ( isJar ) File ( tmpdir , \"\" ) else destination if ( kotlinFiles . isNotEmpty ( ) ) { val output = compileKotlin ( libraryName , outputDir , extraClassPath , K2JVMCompiler ( ) , additionalOptions , expectedFileName = null ) checkKotlinOutput ( normalizeOutput ( output ) ) } if ( javaFiles . isNotEmpty ( ) ) { outputDir . mkdirs ( ) if ( ! compileJava ( sourceDir , javaFiles , outputDir ) ) { throw JavaCompilationError ( ) } } if ( isJar ) { destination . delete ( ) val stream = if ( manifest != null ) JarOutputStream ( destination . outputStream ( ) , manifest ) else JarOutputStream ( destination . outputStream ( ) ) stream . use { jar -> ZipUtil . addDirToZipRecursively ( jar , destination , outputDir , \"\" , null , null ) } } else assertNull ( \"\" , manifest ) return destination }","docstring":"/**\n * Compiles all sources (.java and .kt) under the directory named [libraryName] to [destination].\n * [destination] should be either a path to the directory under [tmpdir], or a path to the resulting .jar file (also under [tmpdir]).\n * Kotlin sources are compiled first, and there should be no errors or warnings. Java sources are compiled next.\n *\n * @return [destination]\n */"} {"signature":"protected fun compileJsLibrary ( libraryName : String , additionalOptions : List < String > = emptyList ( ) , checkKotlinOutput : ( String ) -> Unit = { actual -> assertEquals ( normalizeOutput ( \"\" to ExitCode . OK ) , actual ) } ) : File","body":"{ val destination = File ( tmpdir , libraryName ) val output = compileKotlin ( libraryName , destination , compiler = K2JSCompiler ( ) , additionalOptions = additionalOptions , expectedFileName = null ) checkKotlinOutput ( normalizeOutput ( output ) ) return destination }","docstring":"/**\n * Compiles all .kt sources under the directory named [libraryName] to a file named \"[libraryName].js\" in [tmpdir]\n *\n * @return the path to the corresponding .meta.js file, i.e. \"[libraryName].meta.js\"\n */"} {"signature":"protected fun compileCommonLibrary ( libraryName : String , additionalOptions : List < String > = emptyList ( ) , checkKotlinOutput : ( String ) -> Unit = { actual -> assertEquals ( normalizeOutput ( \"\" to ExitCode . OK ) , actual ) } ) : File","body":"{ val destination = File ( tmpdir , libraryName ) val output = compileKotlin ( libraryName , destination , compiler = K2MetadataCompiler ( ) , additionalOptions = additionalOptions , expectedFileName = null ) checkKotlinOutput ( normalizeOutput ( output ) ) return destination }","docstring":"/**\n * Compiles all .kt sources under the directory named [libraryName] to a directory named \"[libraryName]\" in [tmpdir]\n *\n * @return the path to the corresponding directory\n */"} {"signature":"fun extract ( archive : File , targetDirectory : File , archiveType : ArchiveType )","body":"fun extract ( archive : File , targetDirectory : File , archiveType : ArchiveType )","docstring":"/**\n * Extracts the contents of the specified archive file to the target directory.\n *\n * @param archive The archive file to extract.\n * @param targetDirectory The directory where the contents of the archive will be extracted to.\n * @param archiveType The type of the archive file.\n */"} {"signature":"fun createDiagnosticReporter ( pluginId : String ) : IrMessageLogger","body":"fun createDiagnosticReporter ( pluginId : String ) : IrMessageLogger","docstring":"/**\n * Returns a logger instance to post diagnostic messages from plugin\n *\n * @param pluginId the unique plugin ID to make it easy to distinguish in log\n * @return the logger associated with specified ID\n */"} {"signature":"public fun rxCompletable ( context : CoroutineContext = EmptyCoroutineContext , block : suspend CoroutineScope . ( ) -> Unit ) : Completable","body":"{ require ( context [ Job ] === null ) { \"\" + \"\" } return rxCompletableInternal ( GlobalScope , context , block ) }","docstring":"/**\n * Creates cold [Completable] that runs a given [block] in a coroutine and emits its result.\n * Every time the returned completable is subscribed, it starts a new coroutine.\n * Unsubscribing cancels running coroutine.\n * Coroutine context can be specified with [context] argument.\n * If the context does not have any dispatcher nor any other [ContinuationInterceptor], then [Dispatchers.Default] is used.\n * Method throws [IllegalArgumentException] if provided [context] contains a [Job] instance.\n */"} {"signature":"@ Deprecated ( message = \"\" , level = DeprecationLevel . HIDDEN , replaceWith = ReplaceWith ( \"\" ) ) public fun CoroutineScope . rxCompletable ( context : CoroutineContext = EmptyCoroutineContext , block : suspend CoroutineScope . ( ) -> Unit ) : Completable","body":"= rxCompletableInternal ( this , context , block )","docstring":"/**\n * @suppress\n */"} {"signature":"override fun add ( compilationResultCategory : Int , value : Serializable )","body":"{ when ( compilationResultCategory ) { CompilationResultCategory . IC_COMPILE_ITERATION . code -> kotlinLogger . debug ( value as? CompileIterationResult , rootProjectDir ) else -> kotlinLogger . debug ( \"\" ) } }","docstring":"/**\n * Possible combinations:\n * 1. [CompilationResultCategory.IC_COMPILE_ITERATION.code] -> a [CompileIterationResult] instance\n * 2. [CompilationResultCategory.BUILD_REPORT_LINES.code] -> a [List] of [String]\n * 3. [CompilationResultCategory.VERBOSE_BUILD_REPORT_LINES.code] -> a [List] of [String]\n * 4. [CompilationResultCategory.BUILD_METRICS.code] -> a [BuildMetrics] instance\n **/"} {"signature":"internal fun plus ( value : Int , unit : DateTimeUnit . DateBased ) : ZonedDateTime","body":"= dateTime . plus ( value , unit ) . resolve ( )","docstring":"/**\n * @throws IllegalArgumentException if the result exceeds the boundaries\n * @throws ArithmeticException if arithmetic overflow occurs\n */"} {"signature":"internal fun ZonedDateTime . until ( other : ZonedDateTime , unit : DateTimeUnit ) : Long","body":"= when ( unit ) { is DateTimeUnit . DateBased -> dateTime . until ( other . dateTime , unit ) . toLong ( ) is DateTimeUnit . TimeBased -> { val offsetDiff = offset . totalSeconds - other . offset . totalSeconds val otherLdtAdjusted = try { other . dateTime . plusSeconds ( offsetDiff ) } catch ( e : IllegalArgumentException ) { throw DateTimeArithmeticException ( \"\" ) } dateTime . until ( otherLdtAdjusted , unit ) } }","docstring":"/**\n * @throws ArithmeticException on arithmetic overflow\n * @throws DateTimeArithmeticException if setting [other] to the offset of [this] leads to exceeding boundaries of\n * [LocalDateTime].\n */"} {"signature":"override fun createCandidate ( towerCandidate : CandidateWithBoundDispatchReceiver , explicitReceiverKind : ExplicitReceiverKind , extensionReceiverCandidates : List < ReceiverValueWithSmartCastInfo > ) : CallableReferenceResolutionCandidate","body":"= error ( \"\" )","docstring":"/**\n * The function is called only inside [NoExplicitReceiverScopeTowerProcessor] with [TowerData.BothTowerLevelAndContextReceiversGroup].\n * This case involves only [SimpleCandidateFactory].\n */"} {"signature":"@ FlowPreview public fun < T > Flow < T > . debounce ( timeoutMillis : Long ) : Flow < T >","body":"{ require ( timeoutMillis >= ) { \"\" } if ( timeoutMillis == ) return this return debounceInternal { timeoutMillis } }","docstring":"/**\n * Returns a flow that mirrors the original flow, but filters out values\n * that are followed by the newer values within the given [timeout][timeoutMillis].\n * The latest value is always emitted.\n *\n * Example:\n *\n * ```kotlin\n * flow {\n * emit(1)\n * delay(90)\n * emit(2)\n * delay(90)\n * emit(3)\n * delay(1010)\n * emit(4)\n * delay(1010)\n * emit(5)\n * }.debounce(1000)\n * ```\n * \n *\n * produces the following emissions\n *\n * ```text\n * 3, 4, 5\n * ```\n * \n *\n * Note that the resulting flow does not emit anything as long as the original flow emits\n * items faster than every [timeoutMillis] milliseconds.\n */"} {"signature":"@ FlowPreview @ OverloadResolutionByLambdaReturnType public fun < T > Flow < T > . debounce ( timeoutMillis : ( T ) -> Long ) : Flow < T >","body":"= debounceInternal ( timeoutMillis )","docstring":"/**\n * Returns a flow that mirrors the original flow, but filters out values\n * that are followed by the newer values within the given [timeout][timeoutMillis].\n * The latest value is always emitted.\n *\n * A variation of [debounce] that allows specifying the timeout value dynamically.\n *\n * Example:\n *\n * ```kotlin\n * flow {\n * emit(1)\n * delay(90)\n * emit(2)\n * delay(90)\n * emit(3)\n * delay(1010)\n * emit(4)\n * delay(1010)\n * emit(5)\n * }.debounce {\n * if (it == 1) {\n * 0L\n * } else {\n * 1000L\n * }\n * }\n * ```\n * \n *\n * produces the following emissions\n *\n * ```text\n * 1, 3, 4, 5\n * ```\n * \n *\n * Note that the resulting flow does not emit anything as long as the original flow emits\n * items faster than every [timeoutMillis] milliseconds.\n *\n * @param timeoutMillis [T] is the emitted value and the return value is timeout in milliseconds.\n */"} {"signature":"@ FlowPreview public fun < T > Flow < T > . debounce ( timeout : Duration ) : Flow < T >","body":"= debounce ( timeout . toDelayMillis ( ) )","docstring":"/**\n * Returns a flow that mirrors the original flow, but filters out values\n * that are followed by the newer values within the given [timeout].\n * The latest value is always emitted.\n *\n * Example:\n *\n * ```kotlin\n * flow {\n * emit(1)\n * delay(90.milliseconds)\n * emit(2)\n * delay(90.milliseconds)\n * emit(3)\n * delay(1010.milliseconds)\n * emit(4)\n * delay(1010.milliseconds)\n * emit(5)\n * }.debounce(1000.milliseconds)\n * ```\n * \n *\n * produces the following emissions\n *\n * ```text\n * 3, 4, 5\n * ```\n * \n *\n * Note that the resulting flow does not emit anything as long as the original flow emits\n * items faster than every [timeout] milliseconds.\n */"} {"signature":"@ FlowPreview @ JvmName ( \"\" ) @ OverloadResolutionByLambdaReturnType public fun < T > Flow < T > . debounce ( timeout : ( T ) -> Duration ) : Flow < T >","body":"= debounceInternal { emittedItem -> timeout ( emittedItem ) . toDelayMillis ( ) }","docstring":"/**\n * Returns a flow that mirrors the original flow, but filters out values\n * that are followed by the newer values within the given [timeout].\n * The latest value is always emitted.\n *\n * A variation of [debounce] that allows specifying the timeout value dynamically.\n *\n * Example:\n *\n * ```kotlin\n * flow {\n * emit(1)\n * delay(90.milliseconds)\n * emit(2)\n * delay(90.milliseconds)\n * emit(3)\n * delay(1010.milliseconds)\n * emit(4)\n * delay(1010.milliseconds)\n * emit(5)\n * }.debounce {\n * if (it == 1) {\n * 0.milliseconds\n * } else {\n * 1000.milliseconds\n * }\n * }\n * ```\n * \n *\n * produces the following emissions\n *\n * ```text\n * 1, 3, 4, 5\n * ```\n * \n *\n * Note that the resulting flow does not emit anything as long as the original flow emits\n * items faster than every [timeout] unit.\n *\n * @param timeout [T] is the emitted value and the return value is timeout in [Duration].\n */"} {"signature":"@ FlowPreview public fun < T > Flow < T > . sample ( periodMillis : Long ) : Flow < T >","body":"{ require ( periodMillis > ) { \"\" } return scopedFlow { downstream -> val values = produce ( capacity = Channel . CONFLATED ) { collect { value -> send ( value ? : NULL ) } } var lastValue : Any ? = null val ticker = fixedPeriodTicker ( periodMillis ) while ( lastValue !== DONE ) { select < Unit > { values . onReceiveCatching { result -> result . onSuccess { lastValue = it } . onFailure { it ? . let { throw it } ticker . cancel ( ChildCancelledException ( ) ) lastValue = DONE } } ticker . onReceive { val value = lastValue ? : return@onReceive lastValue = null downstream . emit ( NULL . unbox ( value ) ) } } } } }","docstring":"/**\n * Returns a flow that emits only the latest value emitted by the original flow during the given sampling [period][periodMillis].\n *\n * Example:\n *\n * ```kotlin\n * flow {\n * repeat(10) {\n * emit(it)\n * delay(110)\n * }\n * }.sample(200)\n * ```\n * \n *\n * produces the following emissions\n *\n * ```text\n * 1, 3, 5, 7, 9\n * ```\n * \n *\n * Note that the latest element is not emitted if it does not fit into the sampling window.\n */"} {"signature":"@ FlowPreview public fun < T > Flow < T > . sample ( period : Duration ) : Flow < T >","body":"= sample ( period . toDelayMillis ( ) )","docstring":"/**\n * Returns a flow that emits only the latest value emitted by the original flow during the given sampling [period].\n *\n * Example:\n *\n * ```kotlin\n * flow {\n * repeat(10) {\n * emit(it)\n * delay(110.milliseconds)\n * }\n * }.sample(200.milliseconds)\n * ```\n * \n *\n * produces the following emissions\n *\n * ```text\n * 1, 3, 5, 7, 9\n * ```\n * \n *\n * Note that the latest element is not emitted if it does not fit into the sampling window.\n */"} {"signature":"@ FlowPreview public fun < T > Flow < T > . timeout ( timeout : Duration ) : Flow < T >","body":"= timeoutInternal ( timeout )","docstring":"/**\n * Returns a flow that will emit a [TimeoutCancellationException] if the upstream doesn't emit an item within the given time.\n *\n * Example:\n *\n * ```kotlin\n * flow {\n * emit(1)\n * delay(100)\n * emit(2)\n * delay(100)\n * emit(3)\n * delay(1000)\n * emit(4)\n * }.timeout(100.milliseconds).catch { exception ->\n * if (exception is TimeoutCancellationException) {\n * // Catch the TimeoutCancellationException emitted above.\n * // Emit desired item on timeout.\n * emit(-1)\n * } else {\n * // Throw other exceptions.\n * throw exception\n * }\n * }.onEach {\n * delay(300) // This will not cause a timeout\n * }\n * ```\n * \n *\n * produces the following emissions\n *\n * ```text\n * 1, 2, 3, -1\n * ```\n * \n *\n * Note that delaying on the downstream doesn't trigger the timeout.\n *\n * @param timeout Timeout duration. If non-positive, the flow is timed out immediately\n */"} {"signature":"internal fun < T > sortArrayWith ( array : Array < out T > , fromIndex : Int , toIndex : Int , comparator : Comparator < T > )","body":"{ if ( fromIndex < toIndex - ) { @ Suppress ( \"\" ) mergeSort ( array as Array < T > , fromIndex , toIndex - , comparator ) } }","docstring":"/**\n * Sorts the subarray specified by [fromIndex] (inclusive) and [toIndex] (exclusive) parameters\n * using the merge sort algorithm with the given [comparator].\n */"} {"signature":"internal fun < T : Comparable < T > > sortArray ( array : Array < out T > , fromIndex : Int , toIndex : Int )","body":"{ if ( fromIndex < toIndex - ) { @ Suppress ( \"\" ) mergeSort ( array as Array < T > , fromIndex , toIndex - ) } }","docstring":"/**\n * Sorts a subarray of [Comparable] elements specified by [fromIndex] (inclusive) and\n * [toIndex] (exclusive) parameters using the merge sort algorithm.\n */"} {"signature":"internal fun sortArray ( array : ByteArray , fromIndex : Int , toIndex : Int )","body":"= quickSort ( array , fromIndex , toIndex - )","docstring":"/**\n * Sorts the given array using qsort algorithm.\n */"} {"signature":"internal fun systemProp ( propertyName : String , defaultValue : Boolean ) : Boolean","body":"= systemProp ( propertyName ) ? . toBoolean ( ) ? : defaultValue","docstring":"/**\n * Gets the system property indicated by the specified [property name][propertyName],\n * or returns [defaultValue] if there is no property with that key.\n *\n * **Note: this function should be used in JVM tests only, other platforms use the default value.**\n */"} {"signature":"internal fun systemProp ( propertyName : String , defaultValue : Int , minValue : Int = , maxValue : Int = Int . MAX_VALUE ) : Int","body":"= systemProp ( propertyName , defaultValue . toLong ( ) , minValue . toLong ( ) , maxValue . toLong ( ) ) . toInt ( )","docstring":"/**\n * Gets the system property indicated by the specified [property name][propertyName],\n * or returns [defaultValue] if there is no property with that key. It also checks that the result\n * is between [minValue] and [maxValue] (inclusively), throws [IllegalStateException] if it is not.\n *\n * **Note: this function should be used in JVM tests only, other platforms use the default value.**\n */"} {"signature":"internal fun systemProp ( propertyName : String , defaultValue : Long , minValue : Long = , maxValue : Long = Long . MAX_VALUE ) : Long","body":"{ val value = systemProp ( propertyName ) ? : return defaultValue val parsed = value . toLongOrNull ( ) ? : error ( \"\" ) if ( parsed !in minValue .. maxValue ) { error ( \"\" ) } return parsed }","docstring":"/**\n * Gets the system property indicated by the specified [property name][propertyName],\n * or returns [defaultValue] if there is no property with that key. It also checks that the result\n * is between [minValue] and [maxValue] (inclusively), throws [IllegalStateException] if it is not.\n *\n * **Note: this function should be used in JVM tests only, other platforms use the default value.**\n */"} {"signature":"internal fun systemProp ( propertyName : String , defaultValue : String ) : String","body":"= systemProp ( propertyName ) ? : defaultValue","docstring":"/**\n * Gets the system property indicated by the specified [property name][propertyName],\n * or returns [defaultValue] if there is no property with that key.\n *\n * **Note: this function should be used in JVM tests only, other platforms use the default value.**\n */"} {"signature":"internal expect fun systemProp ( propertyName : String ) : String ?","body":"internal expect fun systemProp ( propertyName : String ) : String ?","docstring":"/**\n * Gets the system property indicated by the specified [property name][propertyName],\n * or returns `null` if there is no property with that key.\n *\n * **Note: this function should be used in JVM tests only, other platforms use the default value.**\n */"} {"signature":"protected fun assertContainsFilePaths ( outputFiles : List < File > , expectedFilePaths : List < Regex > )","body":"{ expectedFilePaths . forEach { pathRegex -> assertNotNull ( outputFiles . any { it . absolutePath . contains ( pathRegex ) } , \"\" ) } }","docstring":"/**\n * Check that [outputFiles] contain specific file paths provided in [expectedFilePaths].\n * Can be used for checking whether expected folders/pages have been created.\n */"} {"signature":"fun gradleKtsProjectTest ( testProjectName : String , baseDir : Path = GradleProjectTest . funcTestTempDir , build : GradleProjectTest . ( ) -> Unit , ) : GradleProjectTest","body":"{ return GradleProjectTest ( baseDir = baseDir , testProjectName = testProjectName ) . apply { settingsGradleKts = \"\"\"\"\"\" . trimMargin ( ) gradleProperties = \"\"\"\"\"\" . trimMargin ( ) build ( ) } }","docstring":"/**\n * Builder for testing a Gradle project that uses Kotlin script DSL and creates default\n * `settings.gradle.kts` and `gradle.properties` files.\n *\n * @param[testProjectName] the path of the project directory, relative to [baseDir\n */"} {"signature":"fun gradleGroovyProjectTest ( testProjectName : String , baseDir : Path = GradleProjectTest . funcTestTempDir , build : GradleProjectTest . ( ) -> Unit , ) : GradleProjectTest","body":"{ return GradleProjectTest ( baseDir = baseDir , testProjectName = testProjectName ) . apply { settingsGradle = \"\"\"\"\"\" . trimMargin ( ) gradleProperties = \"\"\"\"\"\" . trimMargin ( ) build ( ) } }","docstring":"/**\n * Builder for testing a Gradle project that uses Groovy script and creates default,\n * `settings.gradle`, and `gradle.properties` files.\n *\n * @param[testProjectName] the name of the test, which should be distinct across the project\n */"} {"signature":"fun main ( )","body":"{ gradle ( ) ksp ( ) }","docstring":"/**\n * In this file we'll demonstrate how to use OpenApi schemas\n * to generate DataSchemas and how to use them.\n */"} {"signature":"private fun gradle ( )","body":"{ val apis = ApiGuruOpenApiGradle . APIs . readJson ( \"\" ) apis . print ( columnTypes = true , title = true , borders = true ) apis . filter { value . versions . value . any { ( it . updated ? : it . added ) . year >= } } val metrics = ApiGuruOpenApiGradle . Metrics . readJson ( \"\" ) metrics . print ( columnTypes = true , title = true , borders = true ) }","docstring":"/**\n * Gradle example of reading JSON files with OpenApi schemas.\n * Ctrl+Click on [GradleAPIs] or [GradleMetrics] to see the generated code.\n *\n * (We use import aliases to avoid clashes with the KSP example)\n */"} {"signature":"private fun ksp ( )","body":"{ val apis = ApiGuruOpenApiKsp . APIs . readJson ( \"\" ) apis . print ( columnTypes = true , title = true , borders = true ) val metrics = ApiGuruOpenApiKsp . Metrics . readJson ( \"\" ) metrics . print ( columnTypes = true , title = true , borders = true ) }","docstring":"/**\n * KSP example of reading JSON files with OpenApi schemas.\n * Ctrl+Click on [APIs] or [Metrics] to see the generated code.\n */"} {"signature":"@ Test fun readLargeNioBufferOnlyReadsOneSegment ( )","body":"{ val expected : String = if ( factory . isOneByteAtATime ) \"\" else \"\" . repeat ( SEGMENT_SIZE ) sink . writeString ( \"\" . repeat ( SEGMENT_SIZE * ) ) sink . emit ( ) val nioByteBuffer : ByteBuffer = ByteBuffer . allocate ( SEGMENT_SIZE * ) val byteCount : Int = source . readAtMostTo ( nioByteBuffer ) assertEquals ( expected . length , byteCount ) assertEquals ( expected . length , nioByteBuffer . position ( ) ) assertEquals ( nioByteBuffer . capacity ( ) , nioByteBuffer . limit ( ) ) ( nioByteBuffer as Buffer ) . flip ( ) val data = ByteArray ( expected . length ) nioByteBuffer . get ( data ) assertEquals ( expected , String ( data ) ) }","docstring":"/** Note that this test crashes the VM on Android. */"} {"signature":"override fun compareTo ( other : JvmMetadataVersion ) : Int","body":"{ val majors = major . compareTo ( other . major ) if ( majors != ) return majors val minors = minor . compareTo ( other . minor ) return if ( minors != ) minors else patch . compareTo ( other . patch ) }","docstring":"/**\n * Compares this JvmMetadataVersion object with another JvmMetadataVersion object.\n *\n * Comparison is based on integer values of version parts with [major] being most significant one, then [minor], and finally [patch].\n *\n * @return a negative integer, zero, or a positive integer if this JvmMetadataVersion object is less than, equal to, or greater than [other].\n */"} {"signature":"override fun toString ( ) : String","body":"= \"\"","docstring":"/**\n * Returns a string representation of the version number.\n * The string representation is in the format \"major.minor.patch\".\n */"} {"signature":"override fun hashCode ( ) : Int","body":"{ var result = major result = * result + minor result = * result + patch return result }","docstring":"/**\n * Calculates the hash code value for the object based on major, minor, and patch components.\n */"} {"signature":"override fun equals ( other : Any ? ) : Boolean","body":"{ if ( this === other ) return true if ( javaClass != other ? . javaClass ) return false other as JvmMetadataVersion if ( major != other . major ) return false if ( minor != other . minor ) return false if ( patch != other . patch ) return false return true }","docstring":"/**\n * Checks if this JvmMetadataVersion object is equal to [other] JvmMetadataVersion object.\n *\n * Instances of JvmMetadataVersion are equal if they have the same major, minor, and patch components.\n */"} {"signature":"fun annotationProcessor ( fqName : String )","body":"fun annotationProcessor ( fqName : String )","docstring":"/**\n * Adds annotation processor with the specified [fqName] to the list of processors to run.\n */"} {"signature":"fun annotationProcessors ( vararg fqName : String )","body":"fun annotationProcessors ( vararg fqName : String )","docstring":"/**\n * Adds annotation processors with the specified [fqName] to the list of processors to run.\n */"} {"signature":"fun arguments ( action : KaptArguments . ( ) -> Unit )","body":"fun arguments ( action : KaptArguments . ( ) -> Unit )","docstring":"/**\n * Configure [KaptArguments] used for annotation processing.\n */"} {"signature":"fun arguments ( action : Action < KaptArguments > )","body":"{ arguments { action . execute ( this ) } }","docstring":"/**\n * Configures the [KaptArguments] used for annotation processing.\n */"} {"signature":"fun javacOptions ( action : KaptJavacOption . ( ) -> Unit )","body":"fun javacOptions ( action : KaptJavacOption . ( ) -> Unit )","docstring":"/**\n * Configures the [KaptJavacOption] used for annotation processing.\n */"} {"signature":"fun javacOptions ( action : Action < KaptJavacOption > )","body":"{ javacOptions { action . execute ( this ) } }","docstring":"/**\n * Configures the [KaptJavacOption] used for annotation processing.\n */"} {"signature":"fun getJavacOptions ( ) : Map < String , String >","body":"fun getJavacOptions ( ) : Map < String , String >","docstring":"/**\n * Gets all the javac options used to run kapt annotation processing.\n */"} {"signature":"fun arg ( name : Any , vararg values : Any )","body":"fun arg ( name : Any , vararg values : Any )","docstring":"/**\n * Adds argument with the specified name and values.\n *\n * Expected [name] and [values] type is [String].\n */"} {"signature":"fun option ( name : Any , value : Any )","body":"fun option ( name : Any , value : Any )","docstring":"/**\n * Adds an option with name and value.\n *\n * Expected [name] and [value] type is [String].\n */"} {"signature":"fun option ( name : Any )","body":"fun option ( name : Any )","docstring":"/**\n * Adds an option with name only.\n *\n * Expected [name] type is [String].\n */"} {"signature":"@ JvmOverloads public fun < T : Any > Flow < T > . asFlux ( context : CoroutineContext = EmptyCoroutineContext ) : Flux < T >","body":"= FlowAsFlux ( this , Dispatchers . Unconfined + context )","docstring":"/**\n * Converts the given flow to a cold flux.\n * The original flow is cancelled when the flux subscriber is disposed.\n *\n * This function is integrated with [ReactorContext], see its documentation for additional details.\n *\n * An optional [context] can be specified to control the execution context of calls to [Subscriber] methods.\n * You can set a [CoroutineDispatcher] to confine them to a specific thread and/or various [ThreadContextElement] 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 GraphTrainableModel . saveModelConfiguration ( jsonConfigFile : File , isKerasFullyCompatible : Boolean = false )","body":"{ val kerasModel = serializeModel ( isKerasFullyCompatible ) val jsonString2 = Klaxon ( ) . converter ( PaddingConverter ( ) ) . toJsonString ( kerasModel ) jsonConfigFile . writeText ( jsonString2 , Charsets . UTF_8 ) }","docstring":"/**\n * Saves model description as json configuration file fully compatible with the Keras TensorFlow framework.\n *\n * @param jsonConfigFile File to write model configuration.\n * @param isKerasFullyCompatible If true, it generates fully Keras-compatible configuration.\n */"} {"signature":"private fun createKerasGlobalAvgPool2DLayer ( layer : GlobalAvgPool2D ) : KerasLayer","body":"{ val configX = LayerConfig ( dtype = DATATYPE_FLOAT32 , name = layer . name , trainable = layer . isTrainable ) return KerasLayer ( class_name = LAYER_GLOBAL_AVG_POOL_2D , config = configX ) }","docstring":"/**\n * The layer creator functions for Keras should be put below.\n */"} {"signature":"@ kotlin . internal . IntrinsicConstEvaluation public fun String . trimMargin ( marginPrefix : String = \"\" ) : String","body":"= replaceIndentByMargin ( \"\" , marginPrefix )","docstring":"/**\n * Trims leading whitespace characters followed by [marginPrefix] from every line of a source string and removes\n * the first and the last lines if they are blank (notice difference blank vs empty).\n *\n * Doesn't affect a line if it doesn't contain [marginPrefix] except the first and the last blank lines.\n *\n * Doesn't preserve the original line endings.\n *\n * @param marginPrefix non-blank string, which is used as a margin delimiter. Default is `|` (pipe character).\n *\n * @sample samples.text.Strings.trimMargin\n * @see trimIndent\n * @see kotlin.text.isWhitespace\n */"} {"signature":"public fun String . replaceIndentByMargin ( newIndent : String = \"\" , marginPrefix : String = \"\" ) : String","body":"{ require ( marginPrefix . isNotBlank ( ) ) { \"\" } val lines = lines ( ) return lines . reindent ( length + newIndent . length * lines . size , getIndentFunction ( newIndent ) , { line -> val firstNonWhitespaceIndex = line . indexOfFirst { ! it . isWhitespace ( ) } when { firstNonWhitespaceIndex == - -> null line . startsWith ( marginPrefix , firstNonWhitespaceIndex ) -> line . substring ( firstNonWhitespaceIndex + marginPrefix . length ) else -> null } } ) }","docstring":"/**\n * Detects indent by [marginPrefix] as it does [trimMargin] and replace it with [newIndent].\n *\n * @param marginPrefix non-blank string, which is used as a margin delimiter. Default is `|` (pipe character).\n */"} {"signature":"@ kotlin . internal . IntrinsicConstEvaluation public fun String . trimIndent ( ) : String","body":"= replaceIndent ( \"\" )","docstring":"/**\n * Detects a common minimal indent of all the input lines, removes it from every line and also removes the first and the last\n * lines if they are blank (notice difference blank vs empty).\n *\n * Note that blank lines do not affect the detected indent level.\n *\n * In case if there are non-blank lines with no leading whitespace characters (no indent at all) then the\n * common indent is 0, and therefore this function doesn't change the indentation.\n *\n * Doesn't preserve the original line endings.\n *\n * @sample samples.text.Strings.trimIndent\n * @see trimMargin\n * @see kotlin.text.isBlank\n */"} {"signature":"public fun String . replaceIndent ( newIndent : String = \"\" ) : String","body":"{ val lines = lines ( ) val minCommonIndent = lines . filter ( String :: isNotBlank ) . map ( String :: indentWidth ) . minOrNull ( ) ? : return lines . reindent ( length + newIndent . length * lines . size , getIndentFunction ( newIndent ) , { line -> line . drop ( minCommonIndent ) } ) }","docstring":"/**\n * Detects a common minimal indent like it does [trimIndent] and replaces it with the specified [newIndent].\n */"} {"signature":"public fun String . prependIndent ( indent : String = \"\" ) : String","body":"= lineSequence ( ) . map { when { it . isBlank ( ) -> { when { it . length < indent . length -> indent else -> it } } else -> indent + it } } . joinToString ( \"\" )","docstring":"/**\n * Prepends [indent] to every line of the original string.\n *\n * Doesn't preserve the original line endings.\n */"} {"signature":"private fun assertMapping ( aes : Aes , columnID : String , parameters : MappingParameters , result : Mapping )","body":"{ assertEquals ( aes , result . aes ) assertEquals ( columnID , result . columnID ) assertEquals ( parameters , result . parameters ) assertEquals ( bindingContext . bindingCollector . mappings [ aes ] , result ) }","docstring":"/**\n * Assertion method to compare the given mapping parameters to the expected result.\n *\n * @param aes The AES name to compare with the mapping result.\n * @param columnID The column ID to compare with the mapping result.\n * @param parameters The mapping parameters to compare with the mapping result.\n * @param result The actual mapping result.\n */"} {"signature":"abstract fun computeReturnType ( declaration : FirCallableDeclaration ) : FirTypeRef ?","body":"abstract fun computeReturnType ( declaration : FirCallableDeclaration ) : FirTypeRef ?","docstring":"/**\n * Returns the [FirTypeRef] for [FirCallableDeclaration.returnTypeRef] of the [declaration].\n *\n * Depending on the implementation, this call might invoke a deferred computation of the return type\n * (see [FirDeclarationAttributes.deferredCallableCopyReturnType]).\n *\n * A return value of `null` signifies that the calculation has failed or that no deferred computation was stored\n * and the return type could not be resolved ordinarily.\n */"} {"signature":"abstract fun computeReturnType ( calc : CallableCopyTypeCalculator ) : ConeKotlinType ?","body":"abstract fun computeReturnType ( calc : CallableCopyTypeCalculator ) : ConeKotlinType ?","docstring":"/**\n * Performs a deferred computation some declaration's return type.\n *\n * [calc] must be used for the return type calculation of overridden members which might recursively trigger the computation of\n * deferred return types.\n */"} {"signature":"fun test1 ( )","body":"{ }","docstring":"/**\n * block comment\n */"} {"signature":"fun getLightClassMethod ( parameter : KtParameter ) : PsiMethod ?","body":"{ return getPsiMethodWrapper ( parameter ) }","docstring":"/**\n * Returns the light method generated from the parameter of an annotation class.\n */"} {"signature":"public fun addBinaryRoot ( root : Path )","body":"{ binaryRoots . add ( root ) }","docstring":"/**\n * Adds a [root] to the current library.\n *\n * The [root] can be:\n * * A .jar file for JVM libraries or common metadata KLibs\n * * A directory with a set of .classfiles for JVM Libraries\n * * A Kotlin/Native, Kotlin/Common, Kotlin/JS KLib.\n * In this case, all KLib dependencies should be provided together with the KLib itself.\n */"} {"signature":"public fun addBinaryRoots ( roots : Collection < Path > )","body":"{ binaryRoots . addAll ( roots ) }","docstring":"/**\n * Adds a collection of [roots] to the current library.\n *\n * See [addBinaryRoot] for details\n *\n * @see addBinaryRoot for details\n */"} {"signature":"fun x ( )","body":"{ }","docstring":"/**\n * [kotlin.LazyThreadSafetyMode.PUBLICATION]\n */"} {"signature":"@ Test fun testChildDispatch ( )","body":"= runBlocking { repeat ( N_REPEATS ) { val result = withTimeout ( ) { val job = launch ( Dispatchers . Default ) { } job . join ( ) \"\" } assertEquals ( \"\" , result ) } }","docstring":"/**\n * This stress-test makes sure that dispatching resumption from within withTimeout\n * works appropriately (without additional dispatch) despite the presence of\n * children coroutine in a different dispatcher.\n */"} {"signature":"fun sourceLink ( action : Action < in DokkaSourceLinkSpec > )","body":"{ sourceLinks . add ( objects . newInstance ( DokkaSourceLinkSpec :: class ) . also { action . execute ( it ) } ) }","docstring":"/**\n * Configure and add a new source link to [sourceLinks].\n *\n * @see DokkaSourceLinkSpec\n */"} {"signature":"fun perPackageOption ( action : Action < in DokkaPackageOptionsSpec > )","body":"{ perPackageOptions . add ( objects . newInstance ( DokkaPackageOptionsSpec :: class ) . also { action . execute ( it ) } ) }","docstring":"/**\n * Action for configuring package options, appending to [perPackageOptions].\n *\n * @see DokkaPackageOptionsSpec\n */"} {"signature":"fun usage ( )","body":"{ }","docstring":"/**\n * [Foo.ext]\n * [Foo.ext]\n *\n * [Foo]\n */"} {"signature":"private fun findDisplayOffset ( expression : IrExpression , sourceRangeInfo : SourceRangeInfo , source : String , ) : Int","body":"{ return when ( expression ) { is IrMemberAccessExpression < * > -> memberAccessOffset ( expression , sourceRangeInfo , source ) is IrTypeOperatorCall -> typeOperatorOffset ( expression , sourceRangeInfo , source ) else -> } }","docstring":"/**\n * Responsible for determining the diagram display offset of the expression\n * beginning from the startOffset of the expression.\n *\n * Equality:\n * ```\n * number == 42\n * | <- startOffset\n * | <- display offset: 7\n * ```\n *\n * Arithmetic:\n * ```\n * i + 2\n * | <- startOffset\n * | <- display offset: 2\n * ```\n *\n * Infix:\n * ```\n * 1 shl 2\n * | <- startOffset\n * | <- display offset: 2\n * ```\n *\n * Standard:\n * ```\n * 1.shl(2)\n * | <- startOffset\n * | <- display offset: 0\n * ```\n */"} {"signature":"private fun binaryOperatorOffset ( lhs : IrExpression , wholeOperatorSourceRangeInfo : SourceRangeInfo , wholeOperatorSource : String ) : Int","body":"{ val offset = lhs . endOffset - wholeOperatorSourceRangeInfo . startOffset if ( offset < || offset >= wholeOperatorSource . length ) return KotlinLexer ( ) . run { start ( wholeOperatorSource , offset , wholeOperatorSource . length ) while ( tokenType != null && tokenType != KtTokens . EOF && ( tokenType == KtTokens . DOT || tokenType !in KtTokens . OPERATIONS ) ) { advance ( ) } if ( tokenStart >= wholeOperatorSource . length ) return return tokenStart } }","docstring":"/**\n * The offset of the infix operator/function token itself.\n *\n * @param lhs The left-hand side expression of the operator.\n * @param wholeOperatorSourceRangeInfo The source range of the whole operator expression.\n * @param wholeOperatorSource The source text of the whole operator expression.\n */"} {"signature":"private fun IrMemberAccessExpression < * > . binaryOperatorLhs ( ) : IrExpression ?","body":"= when ( origin ) { IrStatementOrigin . EXCLEQ -> { ( dispatchReceiver as? IrCall ) ? . simpleBinaryOperatorLhs ( ) } IrStatementOrigin . EXCLEQEQ -> { ( dispatchReceiver as? IrCall ) ? . simpleBinaryOperatorLhs ( ) } IrStatementOrigin . IN -> { getValueArgument ( ) } IrStatementOrigin . NOT_IN -> { ( dispatchReceiver as? IrCall ) ? . getValueArgument ( ) } else -> simpleBinaryOperatorLhs ( ) }","docstring":"/**\n * The left-hand side expression of an infix operator/function that takes into account special cases like `in`, `!in` and `!=` operators\n * that have a more complex structure than just a single call with two arguments.\n */"} {"signature":"private fun IrMemberAccessExpression < * > . simpleBinaryOperatorLhs ( ) : IrExpression ?","body":"{ val singleReceiver = ( dispatchReceiver != null ) xor ( extensionReceiver != null ) return if ( singleReceiver && valueArgumentsCount == ) { null } else { dispatchReceiver ? : extensionReceiver ? : getValueArgument ( ) . takeIf { ( symbol . owner as? IrSimpleFunction ) ? . origin == IrBuiltIns . BUILTIN_OPERATOR } } }","docstring":"/**\n * The left-hand side expression of an infix operator/function.\n * For single-value operators returns `null`, for all other infix operators/functions, returns the receiver or the first value argument.\n */"} {"signature":"private fun testFileNameFromMappedLocation ( originalFilePath : String , originalFileLineNumber : Int ) : String ?","body":"{ val originalFile = File ( originalFilePath ) return testServices . moduleStructure . modules . asSequence ( ) . flatMap { module -> module . files . asSequence ( ) . filter { ! it . isAdditional } } . findLast { it . originalFile . absolutePath == originalFile . absolutePath && it . startLineNumberInOriginalFile <= originalFileLineNumber } ? . name }","docstring":"/**\n * An original test file may represent multiple source files (by using the `// FILE: myFile.kt` comments).\n * Sourcemaps contain paths to original test files. However, in test expectations we write names as in the `// FILE:` comments.\n * This function maps a location in the original test file to the name specified in a `// FILE:` comment.\n */"} {"signature":"fun < T > run ( body : suspend Context . ( ) -> T )","body":"= inspector . run { debugger . enable ( ) debugger . setSkipAllPauses ( false ) runtime . runIfWaitingForDebugger ( ) with ( Context ( this ) ) { waitForPauseEvent { it . reason == Debugger . PauseReason . BREAK_ON_START } withTimeout ( ) { body ( ) } } }","docstring":"/**\n * By the time [body] is called, the execution is paused, no code is executed yet.\n */"} {"signature":"internal inline fun < T > retry ( times : Int , action : ( Int ) -> T , predicate : ( Int , Throwable ) -> Boolean ) : T","body":"{ if ( times < ) throw IllegalArgumentException ( \"\" ) for ( i in .. times ) { try { return action ( i ) } catch ( e : Throwable ) { if ( i == times || ! predicate ( i , e ) ) throw e } } throw IllegalStateException ( \"\" ) }","docstring":"/**\n * Retries [action] the specified number of [times]. If [action] throws an exception, calls [predicate] to determine if\n * another run should be attempted. If [predicate] returns `false`, rethrows the exception.\n *\n * If after the last attempt results in an exception, rethrows that exception without calling [predicate].\n */"} {"signature":"override fun get ( indices : Iterable < Int > ) : ColumnGroup < T >","body":"override fun get ( indices : Iterable < Int > ) : ColumnGroup < T >","docstring":"/**\n * Gets the rows at given indices.\n *\n * NOTE: This doesn't work in the [ColumnsSelectionDsl], use [ColumnsSelectionDsl.cols] to select columns by index.\n */"} {"signature":"override fun get ( firstIndex : Int , vararg otherIndices : Int ) : ColumnGroup < T >","body":"override fun get ( firstIndex : Int , vararg otherIndices : Int ) : ColumnGroup < T >","docstring":"/**\n * Gets the rows at given indices.\n *\n * NOTE: This doesn't work in the [ColumnsSelectionDsl], use [ColumnsSelectionDsl.cols] to select columns by index.\n */"} {"signature":"override fun get ( range : IntRange ) : ColumnGroup < T >","body":"override fun get ( range : IntRange ) : ColumnGroup < T >","docstring":"/**\n * Gets the rows at given range of indices.\n *\n * NOTE: This doesn't work in the [ColumnsSelectionDsl], use [ColumnsSelectionDsl.cols] to select columns by range.\n */"} {"signature":"private fun KtTypeReference . getFirBySymbols ( ) : FirElement ?","body":"{ val parent = parent return when { parent is KtParameter && parent . ownerFunction != null && parent . typeReference === this -> parent . resolveToFirSymbolOfTypeSafe < FirValueParameterSymbol > ( firResolveSession , FirResolvePhase . TYPES ) ? . fir ? . returnTypeRef parent is KtCallableDeclaration && ( parent is KtNamedFunction || parent is KtProperty ) && ( parent . receiverTypeReference === this || parent . typeReference === this ) -> { val firCallable = parent . resolveToFirSymbolOfTypeSafe < FirCallableSymbol < * > > ( firResolveSession , FirResolvePhase . TYPES ) ? . fir if ( parent . receiverTypeReference === this ) { firCallable ? . receiverParameter ? . typeRef } else firCallable ? . returnTypeRef } parent is KtConstructorCalleeExpression && parent . parent is KtAnnotationEntry -> { fun getFirDeclaration ( annotationEntry : KtAnnotationEntry , ktTypeReference : KtTypeReference ) : FirMemberDeclaration ? { if ( annotationEntry . typeReference !== ktTypeReference ) return null val declaration = annotationEntry . parent ? . parent as? KtNamedDeclaration ? : return null return when { declaration is KtClassOrObject -> declaration . resolveToFirSymbolOfTypeSafe < FirClassLikeSymbol < * > > ( firResolveSession , FirResolvePhase . TYPES ) ? . fir declaration is KtParameter && declaration . ownerFunction != null -> declaration . resolveToFirSymbolOfTypeSafe < FirValueParameterSymbol > ( firResolveSession , FirResolvePhase . TYPES ) ? . fir declaration is KtCallableDeclaration && ( declaration is KtNamedFunction || declaration is KtProperty ) -> { declaration . resolveToFirSymbolOfTypeSafe < FirCallableSymbol < * > > ( firResolveSession , FirResolvePhase . TYPES ) ? . fir } else -> return null } } fun FirMemberDeclaration . findAnnotationTypeRef ( annotationEntry : KtAnnotationEntry ) = annotations . find { it . psi === annotationEntry } ? . annotationTypeRef val annotationEntry = parent . parent as KtAnnotationEntry val firDeclaration = getFirDeclaration ( annotationEntry , this ) if ( firDeclaration != null ) { firDeclaration . findAnnotationTypeRef ( annotationEntry ) ? : ( firDeclaration as? FirProperty ) ? . run { backingField ? . findAnnotationTypeRef ( annotationEntry ) ? : getter ? . findAnnotationTypeRef ( annotationEntry ) ? : setter ? . findAnnotationTypeRef ( annotationEntry ) } } else null } else -> null } }","docstring":"/**\n * Try to get fir element for type reference through symbols.\n * When the type is declared in compiled code this is faster than building FIR from decompiled text.\n */"} {"signature":"fun lenet5 ( ) : Sequential","body":"= Sequential . of ( Input ( IMAGE_SIZE , IMAGE_SIZE , NUM_CHANNELS , name = \"\" ) , Conv2D ( filters = , kernelSize = intArrayOf ( , ) , strides = intArrayOf ( , , , ) , activation = Activations . Relu , kernelInitializer = kernelInitializer , biasInitializer = biasInitializer , padding = ConvPadding . SAME , name = \"\" ) , MaxPool2D ( poolSize = intArrayOf ( , , , ) , strides = intArrayOf ( , , , ) , name = \"\" ) , Conv2D ( filters = , kernelSize = intArrayOf ( , ) , strides = intArrayOf ( , , , ) , activation = Activations . Relu , 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 * Returns classic LeNet-5 model with minor improvements (Sigmoid activation -> ReLU activation, AvgPool layer -> MaxPool layer).\n */"} {"signature":"@ JvmName ( \"\" ) internal fun Project . isAllowCommonizer ( ) : Boolean","body":"{ assert ( state . executed ) { \"\" } multiplatformExtensionOrNull ? : return false return multiplatformExtension . targets . any { it . platformType == KotlinPlatformType . native } && isKotlinGranularMetadataEnabled }","docstring":"/**\n * Function signature needs to be kept stable since this is used during import\n * in IDEs (KotlinCommonizerModelBuilder) < 222\n *\n * IDEs >= will use the [ideaImportDependsOn] infrastructure\n */"} {"signature":"override fun toString ( ) : String","body":"= \"\"","docstring":"/**\n * Returns a string representation of the object.\n */"} {"signature":"@ InlineOnly public inline fun < T : Closeable ? , R > T . use ( block : ( T ) -> R ) : R","body":"{ contract { callsInPlace ( block , InvocationKind . EXACTLY_ONCE ) } var exception : Throwable ? = null try { return block ( this ) } catch ( e : Throwable ) { exception = e throw e } finally { when { apiVersionIsAtLeast ( , , ) -> this . closeFinally ( exception ) this == null -> { } exception == null -> close ( ) else -> try { close ( ) } catch ( closeException : Throwable ) { } } } }","docstring":"/**\n * Executes the given [block] function on this resource and then closes it down correctly whether an exception\n * is thrown or not.\n *\n * @param block a function to process this [Closeable] resource.\n * @return the result of [block] function invoked on this resource.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ PublishedApi internal fun Closeable ? . closeFinally ( cause : Throwable ? ) : Unit","body":"= when { this == null -> { } cause == null -> close ( ) else -> try { close ( ) } catch ( closeException : Throwable ) { cause . addSuppressed ( closeException ) } }","docstring":"/**\n * Closes this [Closeable], suppressing possible exception or error thrown by [Closeable.close] function when\n * it's being closed due to some other [cause] exception occurred.\n *\n * The suppressed exception is added to the list of suppressed exceptions of [cause] exception, when it's supported.\n */"} {"signature":"fun dependencies ( project : Project ) : Iterable < Any >","body":"fun dependencies ( project : Project ) : Iterable < Any >","docstring":"/**\n * return anything accepted to be passed to [org.gradle.api.Task.dependsOn]\n *\n * #### Example: Resolver relying on a single task to be executed:\n * ```kotlin\n * object MyResolver : IdeDependencyResolver, WithBuildDependencies {\n * fun resolve(sourceSet: KotlinSourceSet) = // ...\n * fun dependencies(project: Project) = listOf(project.tasks.named(\"myTask\"))\n * }\n * ```\n */"} {"signature":"@ ExternalKotlinTargetApi fun IdeDependencyResolver ( resolvers : Iterable < IdeDependencyResolver ? > , ) : IdeDependencyResolver","body":"{ val resolversList = resolvers . filterNotNull ( ) if ( resolversList . isEmpty ( ) ) return IdeDependencyResolver . empty return IdeCompositeDependencyResolver ( resolversList ) }","docstring":"/**\n * Creates a composite [IdeDependencyResolver] from the specified [resolvers]\n * Resolvers that are `null` will be ignored.\n * The composite will preserve the order and invoke the [resolvers] in the same order as specified.\n * The resulting set of dependencies will be the superset of all results of individual resolvers.\n */"} {"signature":"@ ExternalKotlinTargetApi fun IdeDependencyResolver ( vararg resolvers : IdeDependencyResolver ? , ) : IdeDependencyResolver","body":"= IdeDependencyResolver ( resolvers . toList ( ) )","docstring":"/**\n * Creates a composite [IdeDependencyResolver] from the specified [resolvers]\n * Resolvers that are `null` will be ignored.\n * The composite will preserve the order and invoke the [resolvers] in the same order as specified.\n * The resulting set of dependencies will be the superset of all results of individual resolvers.\n */"} {"signature":"@ OptIn ( ExperimentalContracts :: class ) public suspend inline fun < R > selectUnbiased ( crossinline builder : SelectBuilder < R > . ( ) -> Unit ) : R","body":"{ contract { callsInPlace ( builder , InvocationKind . EXACTLY_ONCE ) } return UnbiasedSelectImplementation < R > ( coroutineContext ) . run { builder ( this ) doSelect ( ) } }","docstring":"/**\n * Waits for the result of multiple suspending functions simultaneously like [select], but in an _unbiased_\n * way when multiple clauses are selectable at the same time.\n *\n * This unbiased implementation of `select` expression randomly shuffles the clauses before checking\n * if they are selectable, thus ensuring that there is no statistical bias to the selection of the first\n * clauses.\n *\n * See [select] function description for all the other details.\n */"} {"signature":"fun < T : Number , E : Number > convolve ( a : KtNDArray < T > , v : KtNDArray < E > , mode : String = \"\" ) : KtNDArray < E >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( a , v , mode ) )","docstring":"/**\n * Returns the discrete, linear convolution of two one-dimensional sequences.\n */"} {"signature":"fun < T : Number > clip ( a : KtNDArray < T > , aMin : T ? , aMax : T ? ) : KtNDArray < T >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( a , aMin ? : None . none , aMax ? : None . none ) )","docstring":"/**\n * Clip (limit) the values in an array.\n */"} {"signature":"fun < T : Number > sqrt ( x : KtNDArray < T > ) : KtNDArray < Double >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( x ) , dtype = Double :: class )","docstring":"/**\n * Return the non-negative square-root of an array, element-wise.\n */"} {"signature":"fun < T : Number > cbrt ( x : KtNDArray < T > ) : KtNDArray < Double >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( x ) , dtype = Double :: class )","docstring":"/**\n * Return the cube-root of an array, element-wise.\n */"} {"signature":"fun < T : Number > square ( x : KtNDArray < T > ) : KtNDArray < T >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( x ) )","docstring":"/**\n * Return the element-wise square of the input.\n */"} {"signature":"fun < T : Number > absolute ( x : KtNDArray < T > ) : KtNDArray < T >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( x ) )","docstring":"/**\n * Calculate the absolute value element-wise.\n */"} {"signature":"fun < T : Number > fabs ( x : KtNDArray < T > ) : KtNDArray < Double >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( x ) , dtype = Double :: class )","docstring":"/**\n * Compute the absolute values element-wise.\n */"} {"signature":"fun < T : Number > sign ( x : KtNDArray < T > ) : KtNDArray < T >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( x ) )","docstring":"/**\n * Returns an element-wise indication of the sign of a number.\n */"} {"signature":"fun < T : Number , E : Number > heaviside ( x1 : KtNDArray < T > , x2 : KtNDArray < E > ) : KtNDArray < Double >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( x1 , x2 ) , dtype = Double :: class )","docstring":"/**\n * Compute the Heaviside step function.\n */"} {"signature":"fun < T : Number > maximum ( x1 : KtNDArray < T > , x2 : KtNDArray < T > ) : KtNDArray < T >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( x1 , x2 ) )","docstring":"/**\n * Element-wise maximum of array elements.\n */"} {"signature":"fun < T : Number > minimum ( x1 : KtNDArray < T > , x2 : KtNDArray < T > ) : KtNDArray < T >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( x1 , x2 ) )","docstring":"/**\n * Element-wise minimum of array elements.\n */"} {"signature":"fun < T : Number , E : Number > fmax ( x1 : KtNDArray < T > , x2 : KtNDArray < E > ) : KtNDArray < Double >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( x1 , x2 ) , dtype = Double :: class )","docstring":"/**\n * Element-wise maximum of array elements.\n */"} {"signature":"fun < T : Number , E : Number > fmin ( x1 : KtNDArray < T > , x2 : KtNDArray < E > ) : KtNDArray < Double >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( x1 , x2 ) , dtype = Double :: class )","docstring":"/**\n * Element-wise minimum of array elements.\n */"} {"signature":"fun < T : Number > nanToNum ( x : KtNDArray < T > , nan : Double = , posinf : Double ? = null , neginf : Double ? = null ) : KtNDArray < T >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( x , nan , posinf ? : None . none , neginf ? : None . none ) )","docstring":"/**\n * Replace NaN with zero and infinity with large finite numbers (default behaviour).\n */"} {"signature":"fun < T : Number , E : Number , R : Number > interp ( x : KtNDArray < T > , xp : KtNDArray < E > , fp : KtNDArray < R > , left : Double ? = null , right : Double ? = null , period : Double ? = null ) : KtNDArray < Double >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( x , xp , fp , left ? : None . none , right ? : None . none , period ? : None . none ) )","docstring":"/**\n * One-dimensional linear interpolation.\n */"} {"signature":"fun stripMetadata ( logger : Logger , classNamePattern : String , inFile : File , outFile : File , preserveFileTimestamps : Boolean = true )","body":"{ val classRegex = classNamePattern . toRegex ( ) assert ( inFile . exists ( ) ) { \"\" } fun transform ( entryName : String , bytes : ByteArray ) : ByteArray { if ( ! entryName . endsWith ( \"\" ) ) return bytes if ( ! classRegex . matches ( entryName . removeSuffix ( \"\" ) ) ) return bytes var changed = false val classWriter = ClassWriter ( ) val classVisitor = object : ClassVisitor ( Opcodes . API_VERSION , classWriter ) { override fun visitAnnotation ( desc : String , visible : Boolean ) : AnnotationVisitor ? { if ( Type . getType ( desc ) . internalName == \"\" ) { changed = true return null } return super . visitAnnotation ( desc , visible ) } } ClassReader ( bytes ) . accept ( classVisitor , ) if ( ! changed ) return bytes return classWriter . toByteArray ( ) } ZipOutputStream ( BufferedOutputStream ( FileOutputStream ( outFile ) ) ) . use { outJar -> JarFile ( inFile ) . use { inJar -> for ( entry in inJar . entries ( ) ) { val inBytes = inJar . getInputStream ( entry ) . readBytes ( ) val outBytes = transform ( entry . name , inBytes ) if ( inBytes . size < outBytes . size ) { error ( \"\" ) } val newEntry = ZipEntry ( entry . name ) if ( ! preserveFileTimestamps ) { newEntry . time = CONSTANT_TIME_FOR_ZIP_ENTRIES } outJar . putNextEntry ( newEntry ) outJar . write ( outBytes ) outJar . closeEntry ( ) } } } logger . info ( \"\" ) logger . info ( \"\" ) logger . info ( \"\" ) logger . info ( \"\" ) logger . info ( \"\" ) }","docstring":"/**\n * Removes @kotlin.Metadata annotations from compiled Kotlin classes\n */"} {"signature":"@ Suppress ( \"\" ) fun embedKernel ( cfgFile : File , resolutionInfoProvider : ResolutionInfoProvider ? , scriptReceivers : List < Any > ? = null , )","body":"{ val cp = System . getProperty ( \"\" ) . split ( File . pathSeparator ) . toTypedArray ( ) . map { File ( it ) } val kernelConfig = KernelArgs ( cfgFile , cp , null , null , null , null ) . getConfig ( ) val replConfig = ReplConfig . create ( { httpUtil , _ -> resolutionInfoProvider ? : EmptyResolutionInfoProvider ( httpUtil . libraryInfoCache ) } , homeDir = null , embedded = true , ) val replSettings = DefaultReplSettings ( kernelConfig , replConfig , DefaultKernelLoggerFactory , scriptReceivers = scriptReceivers . orEmpty ( ) , ) kernelServer ( replSettings ) }","docstring":"/**\n * This function is to be run in projects which use kernel as a library,\n * so we don't have a big need in covering it with tests\n *\n * The expected use case for this function is embedded into a Java application that doesn't necessarily support extensions written in Kotlin\n * The signature of this function should thus be simple, and e.g. allow resolutionInfoProvider to be null instead of having to pass EmptyResolutionInfoProvider\n * because EmptyResolutionInfoProvider is a Kotlin singleton object, and it takes a while to understand how to use it from Java code.\n */"} {"signature":"public final override fun < T > encodeToString ( serializer : SerializationStrategy < T > , value : T ) : String","body":"{ val result = JsonToStringWriter ( ) try { encodeByWriter ( this @ Json , result , serializer , value ) return result . toString ( ) } finally { result . release ( ) } }","docstring":"/**\n * Serializes the [value] into an equivalent JSON using the given [serializer].\n *\n * @throws [SerializationException] if the given value cannot be serialized to JSON.\n */"} {"signature":"public inline fun < reified T > decodeFromString ( @ FormatLanguage ( \"\" , \"\" , \"\" ) string : String ) : T","body":"= decodeFromString ( serializersModule . serializer ( ) , string )","docstring":"/**\n * Decodes and deserializes the given JSON [string] to the value of type [T] using deserializer\n * retrieved from the reified type parameter.\n *\n * @throws SerializationException in case of any decoding-specific error\n * @throws IllegalArgumentException if the decoded input is not a valid instance of [T]\n */"} {"signature":"public final override fun < T > decodeFromString ( deserializer : DeserializationStrategy < T > , @ FormatLanguage ( \"\" , \"\" , \"\" ) string : String ) : T","body":"{ val lexer = StringJsonLexer ( string ) val input = StreamingJsonDecoder ( this , WriteMode . OBJ , lexer , deserializer . descriptor , null ) val result = input . decodeSerializableValue ( deserializer ) lexer . expectEof ( ) return result }","docstring":"/**\n * Deserializes the given JSON [string] into a value of type [T] using the given [deserializer].\n *\n * @throws [SerializationException] if the given JSON string is not a valid JSON input for the type [T]\n * @throws [IllegalArgumentException] if the decoded input cannot be represented as a valid instance of type [T]\n */"} {"signature":"public fun < T > encodeToJsonElement ( serializer : SerializationStrategy < T > , value : T ) : JsonElement","body":"{ return writeJson ( this @ Json , value , serializer ) }","docstring":"/**\n * Serializes the given [value] into an equivalent [JsonElement] using the given [serializer]\n *\n * @throws [SerializationException] if the given value cannot be serialized to JSON\n */"} {"signature":"public fun < T > decodeFromJsonElement ( deserializer : DeserializationStrategy < T > , element : JsonElement ) : T","body":"{ return readJson ( this @ Json , element , deserializer ) }","docstring":"/**\n * Deserializes the given [element] into a value of type [T] using the given [deserializer].\n *\n * @throws [SerializationException] if the given JSON element is not a valid JSON input for the type [T]\n * @throws [IllegalArgumentException] if the decoded input cannot be represented as a valid instance of type [T]\n */"} {"signature":"public fun parseToJsonElement ( @ FormatLanguage ( \"\" , \"\" , \"\" ) string : String ) : JsonElement","body":"{ return decodeFromString ( JsonElementSerializer , string ) }","docstring":"/**\n * Deserializes the given JSON [string] into a corresponding [JsonElement] representation.\n *\n * @throws [SerializationException] if the given string is not a valid JSON\n */"} {"signature":"public fun Json ( from : Json = Json . Default , builderAction : JsonBuilder . ( ) -> Unit ) : Json","body":"{ val builder = JsonBuilder ( from ) builder . builderAction ( ) val conf = builder . build ( ) return JsonImpl ( conf , builder . serializersModule ) }","docstring":"/**\n * Creates an instance of [Json] configured from the optionally given [Json instance][from] and adjusted with [builderAction].\n */"} {"signature":"public inline fun < reified T > Json . encodeToJsonElement ( value : T ) : JsonElement","body":"{ return encodeToJsonElement ( serializersModule . serializer ( ) , value ) }","docstring":"/**\n * Serializes the given [value] into an equivalent [JsonElement] using a serializer retrieved\n * from reified type parameter.\n *\n * @throws [SerializationException] if the given value cannot be serialized to JSON.\n */"} {"signature":"public inline fun < reified T > Json . decodeFromJsonElement ( json : JsonElement ) : T","body":"= decodeFromJsonElement ( serializersModule . serializer ( ) , json )","docstring":"/**\n * Deserializes the given [json] element into a value of type [T] using a deserializer retrieved\n * from reified type parameter.\n *\n * @throws [SerializationException] if the given JSON element is not a valid JSON input for the type [T]\n * @throws [IllegalArgumentException] if the decoded input cannot be represented as a valid instance of type [T]\n */"} {"signature":"public fun < T > compareValuesBy ( a : T , b : T , vararg selectors : ( T ) -> Comparable < * > ? ) : Int","body":"{ require ( selectors . size > ) return compareValuesByImpl ( a , b , selectors ) }","docstring":"/**\n * Compares two values using the specified functions [selectors] to calculate the result of the comparison.\n * The functions are called sequentially, receive the given values [a] and [b] and return [Comparable]\n * objects. As soon as the [Comparable] instances returned by a function for [a] and [b] values do not\n * compare as equal, the result of that comparison is returned.\n *\n * @sample samples.comparisons.Comparisons.compareValuesByWithSelectors\n */"} {"signature":"@ kotlin . internal . InlineOnly public inline fun < T > compareValuesBy ( a : T , b : T , selector : ( T ) -> Comparable < * > ? ) : Int","body":"{ return compareValues ( selector ( a ) , selector ( b ) ) }","docstring":"/**\n * Compares two values using the specified [selector] function to calculate the result of the comparison.\n * The function is applied to the given values [a] and [b] and return [Comparable] objects.\n * The result of comparison of these [Comparable] instances is returned.\n *\n * @sample samples.comparisons.Comparisons.compareValuesByWithSingleSelector\n */"} {"signature":"@ kotlin . internal . InlineOnly public inline fun < T , K > compareValuesBy ( a : T , b : T , comparator : Comparator < in K > , selector : ( T ) -> K ) : Int","body":"{ return comparator . compare ( selector ( a ) , selector ( b ) ) }","docstring":"/**\n * Compares two values using the specified [selector] function to calculate the result of the comparison.\n * The function is applied to the given values [a] and [b] and return objects of type K which are then being\n * compared with the given [comparator].\n *\n * @sample samples.comparisons.Comparisons.compareValuesByWithComparator\n */"} {"signature":"public fun < T : Comparable < * > > compareValues ( a : T ? , b : T ? ) : Int","body":"{ if ( a === b ) return if ( a == null ) return - if ( b == null ) return @ Suppress ( \"\" ) return ( a as Comparable < Any > ) . compareTo ( b ) }","docstring":"/**\n * Compares two nullable [Comparable] values. Null is considered less than any value.\n *\n * @sample samples.comparisons.Comparisons.compareValues\n */"} {"signature":"public fun < T > compareBy ( vararg selectors : ( T ) -> Comparable < * > ? ) : Comparator < T >","body":"{ require ( selectors . size > ) return Comparator { a , b -> compareValuesByImpl ( a , b , selectors ) } }","docstring":"/**\n * Creates a comparator using the sequence of functions to calculate a result of comparison.\n * The functions are called sequentially, receive the given values `a` and `b` and return [Comparable]\n * objects. As soon as the [Comparable] instances returned by a function for `a` and `b` values do not\n * compare as equal, the result of that comparison is returned from the [Comparator].\n *\n * @sample samples.comparisons.Comparisons.compareByWithSelectors\n */"} {"signature":"@ kotlin . internal . InlineOnly public inline fun < T > compareBy ( crossinline selector : ( T ) -> Comparable < * > ? ) : Comparator < T >","body":"= Comparator { a , b -> compareValuesBy ( a , b , selector ) }","docstring":"/**\n * Creates a comparator using the function to transform value to a [Comparable] instance for comparison.\n *\n * @sample samples.comparisons.Comparisons.compareByWithSingleSelector\n */"} {"signature":"@ kotlin . internal . InlineOnly public inline fun < T , K > compareBy ( comparator : Comparator < in K > , crossinline selector : ( T ) -> K ) : Comparator < T >","body":"= Comparator { a , b -> compareValuesBy ( a , b , comparator , selector ) }","docstring":"/**\n * Creates a comparator using the [selector] function to transform values being compared and then applying\n * the specified [comparator] to compare transformed values.\n *\n * @sample samples.comparisons.Comparisons.compareByWithComparator\n */"} {"signature":"@ kotlin . internal . InlineOnly public inline fun < T > compareByDescending ( crossinline selector : ( T ) -> Comparable < * > ? ) : Comparator < T >","body":"= Comparator { a , b -> compareValuesBy ( b , a , selector ) }","docstring":"/**\n * Creates a descending comparator using the function to transform value to a [Comparable] instance for comparison.\n *\n * @sample samples.comparisons.Comparisons.compareByDescendingWithSingleSelector\n */"} {"signature":"@ kotlin . internal . InlineOnly public inline fun < T , K > compareByDescending ( comparator : Comparator < in K > , crossinline selector : ( T ) -> K ) : Comparator < T >","body":"= Comparator { a , b -> compareValuesBy ( b , a , comparator , selector ) }","docstring":"/**\n * Creates a descending comparator using the [selector] function to transform values being compared and then applying\n * the specified [comparator] to compare transformed values.\n *\n * Note that an order of [comparator] is reversed by this wrapper.\n *\n * @sample samples.comparisons.Comparisons.compareByDescendingWithComparator\n */"} {"signature":"@ kotlin . internal . InlineOnly public inline fun < T > Comparator < T > . thenBy ( crossinline selector : ( T ) -> Comparable < * > ? ) : Comparator < T >","body":"= Comparator { a , b -> val previousCompare = this@thenBy . compare ( a , b ) if ( previousCompare != ) previousCompare else compareValuesBy ( a , b , selector ) }","docstring":"/**\n * Creates a comparator comparing values after the primary comparator defined them equal. It uses\n * the function to transform value to a [Comparable] instance for comparison.\n *\n * @sample samples.comparisons.Comparisons.thenBy\n */"} {"signature":"@ kotlin . internal . InlineOnly public inline fun < T , K > Comparator < T > . thenBy ( comparator : Comparator < in K > , crossinline selector : ( T ) -> K ) : Comparator < T >","body":"= Comparator { a , b -> val previousCompare = this@thenBy . compare ( a , b ) if ( previousCompare != ) previousCompare else compareValuesBy ( a , b , comparator , selector ) }","docstring":"/**\n * Creates a comparator comparing values after the primary comparator defined them equal. It uses\n * the [selector] function to transform values and then compares them with the given [comparator].\n *\n * @sample samples.comparisons.Comparisons.thenByWithComparator\n */"} {"signature":"@ kotlin . internal . InlineOnly public inline fun < T > Comparator < T > . thenByDescending ( crossinline selector : ( T ) -> Comparable < * > ? ) : Comparator < T >","body":"= Comparator { a , b -> val previousCompare = this@thenByDescending . compare ( a , b ) if ( previousCompare != ) previousCompare else compareValuesBy ( b , a , selector ) }","docstring":"/**\n * Creates a descending comparator using the primary comparator and\n * the function to transform value to a [Comparable] instance for comparison.\n *\n * @sample samples.comparisons.Comparisons.thenByDescending\n */"} {"signature":"@ kotlin . internal . InlineOnly public inline fun < T , K > Comparator < T > . thenByDescending ( comparator : Comparator < in K > , crossinline selector : ( T ) -> K ) : Comparator < T >","body":"= Comparator { a , b -> val previousCompare = this@thenByDescending . compare ( a , b ) if ( previousCompare != ) previousCompare else compareValuesBy ( b , a , comparator , selector ) }","docstring":"/**\n * Creates a descending comparator comparing values after the primary comparator defined them equal. It uses\n * the [selector] function to transform values and then compares them with the given [comparator].\n *\n * @sample samples.comparisons.Comparisons.thenByDescendingWithComparator\n */"} {"signature":"@ kotlin . internal . InlineOnly public inline fun < T > Comparator < T > . thenComparator ( crossinline comparison : ( a : T , b : T ) -> Int ) : Comparator < T >","body":"= Comparator { a , b -> val previousCompare = this@thenComparator . compare ( a , b ) if ( previousCompare != ) previousCompare else comparison ( a , b ) }","docstring":"/**\n * Creates a comparator using the primary comparator and function to calculate a result of comparison.\n *\n * @sample samples.comparisons.Comparisons.thenComparator\n */"} {"signature":"public infix fun < T > Comparator < T > . then ( comparator : Comparator < in T > ) : Comparator < T >","body":"= Comparator { a , b -> val previousCompare = this@then . compare ( a , b ) if ( previousCompare != ) previousCompare else comparator . compare ( a , b ) }","docstring":"/**\n * Combines this comparator and the given [comparator] such that the latter is applied only\n * when the former considered values equal.\n *\n * @sample samples.comparisons.Comparisons.then\n */"} {"signature":"public infix fun < T > Comparator < T > . thenDescending ( comparator : Comparator < in T > ) : Comparator < T >","body":"= Comparator < T > { a , b -> val previousCompare = this@thenDescending . compare ( a , b ) if ( previousCompare != ) previousCompare else comparator . compare ( b , a ) }","docstring":"/**\n * Combines this comparator and the given [comparator] such that the latter is applied only\n * when the former considered values equal.\n *\n * @sample samples.comparisons.Comparisons.thenDescending\n */"} {"signature":"public fun < T : Any > nullsFirst ( comparator : Comparator < in T > ) : Comparator < T ? >","body":"= Comparator { a , b -> when { a === b -> a == null -> - b == null -> else -> comparator . compare ( a , b ) } }","docstring":"/**\n * Extends the given [comparator] of non-nullable values to a comparator of nullable values\n * considering `null` value less than any other value.\n * Non-null values are compared with the provided [comparator].\n *\n * @sample samples.comparisons.Comparisons.nullsFirstLastWithComparator\n */"} {"signature":"@ kotlin . internal . InlineOnly public inline fun < T : Comparable < T > > nullsFirst ( ) : Comparator < T ? >","body":"= nullsFirst ( naturalOrder ( ) )","docstring":"/**\n * Provides a comparator of nullable [Comparable] values\n * considering `null` value less than any other value.\n * Non-null values are compared according to their [natural order][naturalOrder].\n *\n * @sample samples.comparisons.Comparisons.nullsFirstLastComparator\n */"} {"signature":"public fun < T : Any > nullsLast ( comparator : Comparator < in T > ) : Comparator < T ? >","body":"= Comparator { a , b -> when { a === b -> a == null -> b == null -> - else -> comparator . compare ( a , b ) } }","docstring":"/**\n * Extends the given [comparator] of non-nullable values to a comparator of nullable values\n * considering `null` value greater than any other value.\n * Non-null values are compared with the provided [comparator].\n *\n * @sample samples.comparisons.Comparisons.nullsFirstLastWithComparator\n */"} {"signature":"@ kotlin . internal . InlineOnly public inline fun < T : Comparable < T > > nullsLast ( ) : Comparator < T ? >","body":"= nullsLast ( naturalOrder ( ) )","docstring":"/**\n * Provides a comparator of nullable [Comparable] values\n * considering `null` value greater than any other value.\n * Non-null values are compared according to their [natural order][naturalOrder].\n *\n * @sample samples.comparisons.Comparisons.nullsFirstLastComparator\n */"} {"signature":"public fun < T : Comparable < T > > naturalOrder ( ) : Comparator < T >","body":"= @ Suppress ( \"\" ) ( NaturalOrderComparator as Comparator < T > )","docstring":"/**\n * Returns a comparator that compares [Comparable] objects in natural order.\n *\n * The natural order of a `Comparable` type here means the order established by its `compareTo` function.\n *\n * @sample samples.comparisons.Comparisons.naturalOrderComparator\n */"} {"signature":"public fun < T : Comparable < T > > reverseOrder ( ) : Comparator < T >","body":"= @ Suppress ( \"\" ) ( ReverseOrderComparator as Comparator < T > )","docstring":"/**\n * Returns a comparator that compares [Comparable] objects in reversed natural order.\n *\n * The natural order of a `Comparable` type here means the order established by its `compareTo` function.\n *\n * @sample samples.comparisons.Comparisons.nullsFirstLastWithComparator\n */"} {"signature":"@ Suppress ( \"\" ) public fun < T > Comparator < T > . reversed ( ) : Comparator < T >","body":"= when ( this ) { is ReversedComparator -> this . comparator NaturalOrderComparator -> @ Suppress ( \"\" ) ( ReverseOrderComparator as Comparator < T > ) ReverseOrderComparator -> @ Suppress ( \"\" ) ( NaturalOrderComparator as Comparator < T > ) else -> ReversedComparator ( this ) }","docstring":"/**\n * Returns a comparator that imposes the reverse ordering of this comparator.\n *\n * @sample samples.comparisons.Comparisons.reversed\n */"} {"signature":"@ GradleTest fun `test - sample0 - buildId buildPath buildName` ( gradleVersion : GradleVersion )","body":"{ val producer = project ( \"\" , gradleVersion ) project ( \"\" , gradleVersion ) { settingsGradleKts . toFile ( ) . replaceText ( \"\" , producer . projectPath . toUri ( ) . path ) resolveIdeDependencies ( \"\" ) { dependencies -> val dependency = dependencies [ \"\" ] . getOrFail ( regularSourceDependency ( \"\" ) ) assertIs < IdeaKotlinSourceDependency > ( dependency ) val projectCoordinates = dependency . coordinates . project @ Suppress ( \"\" ) assertEquals ( \"\" , projectCoordinates . buildId ) assertEquals ( \"\" , projectCoordinates . buildName ) assertEquals ( \"\" , projectCoordinates . buildPath ) assertEquals ( \"\" , projectCoordinates . projectPath ) assertEquals ( \"\" , projectCoordinates . projectName ) } } }","docstring":"/**\n * Test that verifies that after moving to 'buildPath' and 'buildName' in project coordinates (1.9.20),\n * the shape of the resolved coordinate are the same across different versions of Gradle.\n */"} {"signature":"internal fun getDType ( ) : Class < Float >","body":"{ return Float :: class . javaObjectType }","docstring":"/** Returns DType. In existing solution it works with Float only. */"} {"signature":"@ Throws ( IOException :: class ) public fun detectObjects ( imageFile : File , topK : Int = ) : List < DetectedObject >","body":"{ return detectObjects ( ImageConverter . toBufferedImage ( imageFile ) , topK ) }","docstring":"/**\n * Returns the top N detected object for the given image file sorted by the score.\n *\n * NOTE: this method includes the SSD-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":"public fun reshape ( vararg dims : Long )","body":"{ inputShape = longArrayOf ( * dims ) }","docstring":"/**\n * Setter for input shape of the internal model. Images are going to be resized to this shape.\n *\n * @param dims The input shape.\n */"} {"signature":"public fun apply ( fanIn : Int , fanOut : Int , tf : Ops , input : Operand < Float > , name : String ) : InitializerOperation","body":"{ val initialize = initialize ( fanIn , fanOut , tf , shapeOperand ( tf , input . asOutput ( ) . shape ( ) ) , defaultInitializerOpName ( name ) ) return InitializerOperation ( tf . withName ( defaultAssignOpName ( name ) ) . assign ( input , initialize ) , initialize ) }","docstring":"/**\n * Adds an `Assign` Op to the graph to initialize\n * a tensorflow variable as specified by the initializer.\n *\n * @param [fanIn] The maximum number of inputs that an initializer can accept.\n * @param [fanOut] The maximum number of inputs that the output of an initializer can feed to other steps.\n * @param [tf] Tensorflow Ops Accessor\n * @param [input] Variable to initialize\n * @return initializer operation.\n * @see InitializerOperation\n */"} {"signature":"public abstract fun initialize ( fanIn : Int , fanOut : Int , tf : Ops , shape : Operand < Int > , name : String ) : Operand < Float >","body":"public abstract fun initialize ( fanIn : Int , fanOut : Int , tf : Ops , shape : Operand < Int > , name : String ) : Operand < Float >","docstring":"/**\n * Returns a Tensor object initialized as specified by the initializer.\n *\n * @param [fanIn] The maximum number of inputs that an initializer can accept.\n * @param [fanOut] The maximum number of inputs that the output of an initializer can feed to other steps.\n * @param [tf] Tensorflow Ops Accessor.\n * @param [shape] Shape of the tensor.\n * @param [name] Initializer name.\n */"} {"signature":"fun makeFlattenedGetterExpressions ( scope : IrBlockBuilder , currentClass : IrClass , registerPossibleExtraBoxCreation : ( ) -> Unit ) : List < IrExpression >","body":"fun makeFlattenedGetterExpressions ( scope : IrBlockBuilder , currentClass : IrClass , registerPossibleExtraBoxCreation : ( ) -> Unit ) : List < IrExpression >","docstring":"/**\n * Make expressions corresponding to the flattened representation of the [MfvcNodeInstance].\n */"} {"signature":"fun makeGetterExpression ( scope : IrBuilderWithScope , currentClass : IrClass , registerPossibleExtraBoxCreation : ( ) -> Unit ) : IrExpression","body":"fun makeGetterExpression ( scope : IrBuilderWithScope , currentClass : IrClass , registerPossibleExtraBoxCreation : ( ) -> Unit ) : IrExpression","docstring":"/**\n * Make expression that corresponds to read access of the instance\n */"} {"signature":"operator fun get ( name : Name ) : MfvcNodeInstance ?","body":"operator fun get ( name : Name ) : MfvcNodeInstance ?","docstring":"/**\n * Get child [MfvcNodeInstance] by [name]\n */"} {"signature":"fun makeSetterStatements ( scope : IrBuilderWithScope , values : List < IrExpression > ) : List < IrStatement >","body":"fun makeSetterStatements ( scope : IrBuilderWithScope , values : List < IrExpression > ) : List < IrStatement >","docstring":"/**\n * Make setter statements corresponding assignments to the [values] of the given flattened representation.\n */"} {"signature":"fun MfvcNodeInstance . addSetterStatements ( scope : IrBlockBuilder , values : List < IrExpression > )","body":"= with ( scope ) { for ( statement in makeSetterStatements ( this , values ) ) { + statement } }","docstring":"/**\n * Make and add setter statements corresponding assignments to the [values] of the given flattened representation.\n */"} {"signature":"fun MfvcNodeInstance . makeSetterExpressions ( scope : IrBuilderWithScope , values : List < IrExpression > ) : IrExpression","body":"= scope . irBlock { addSetterStatements ( this , values ) }","docstring":"/**\n * Make a block of setter statements corresponding assignments to the [values] of the given flattened representation.\n */"} {"signature":"fun IrBuilderWithScope . savableStandaloneVariable ( type : IrType , name : String ? = null , isVar : Boolean , origin : IrDeclarationOrigin , isTemporary : Boolean = origin == IrDeclarationOrigin . IR_TEMPORARY_VARIABLE || origin == JvmLoweredDeclarationOrigin . TEMPORARY_MULTI_FIELD_VALUE_CLASS_VARIABLE || origin == JvmLoweredDeclarationOrigin . TEMPORARY_MULTI_FIELD_VALUE_CLASS_PARAMETER , saveVariable : ( IrVariable ) -> Unit , ) : IrVariable","body":"{ val variable = if ( isTemporary || name == null ) scope . createTemporaryVariableDeclaration ( type , name , isVar , startOffset = startOffset , endOffset = endOffset , origin = origin , ) else IrVariableImpl ( startOffset = startOffset , endOffset = endOffset , origin = origin , symbol = IrVariableSymbolImpl ( ) , name = Name . identifier ( name ) , type = type , isVar = isVar , isConst = false , isLateinit = false ) . apply { parent = this@savableStandaloneVariable . scope . getLocalDeclarationParent ( ) } saveVariable ( variable ) return variable }","docstring":"/**\n * Creates a variable and doesn't add it to a container. It saves the variable with given saveVariable.\n *\n * It may be used when the variable will be used outside the current container so the declaration is added later when all usages are known.\n */"} {"signature":"fun < T : IrElement > IrStatementsBuilder < T > . savableStandaloneVariableWithSetter ( expression : IrExpression , name : String ? = null , isMutable : Boolean = false , origin : IrDeclarationOrigin , isTemporary : Boolean = origin == IrDeclarationOrigin . IR_TEMPORARY_VARIABLE , saveVariable : ( IrVariable ) -> Unit , )","body":"= savableStandaloneVariable ( expression . type , name , isMutable , origin , isTemporary , saveVariable ) . also { + irSet ( it , expression ) }","docstring":"/**\n * Creates a variable and doesn't add it to a container. It saves the variable with given saveVariable. It adds irSet-based initialization.\n *\n * It may be used when the variable will be used outside the current container so the declaration is added later when all usages are known.\n */"} {"signature":"internal fun getSourceFilePaths ( compilerConfig : CompilerConfiguration , includeDirectoryRoot : Boolean = false , ) : Set < Path >","body":"{ return buildSet { compilerConfig . javaSourceRoots . forEach { srcRoot -> val path = Paths . get ( srcRoot ) if ( Files . isDirectory ( path ) ) { addAll ( collectSourceFilePaths ( path ) ) if ( includeDirectoryRoot ) { add ( path ) } } else { add ( path ) } } } }","docstring":"/**\n * Collect source file path as [String] from the given source roots in [compilerConfig].\n *\n * Such source roots are either [KotlinSourceRoot] or [JavaSourceRoot], and thus\n * this util collects all `.kt` and `.java` files under source roots.\n */"} {"signature":"internal fun collectSourceFilePaths ( root : Path ) : List < Path >","body":"{ val result = mutableListOf < Path > ( ) Files . walkFileTree ( root , object : SimpleFileVisitor < Path > ( ) { override fun preVisitDirectory ( dir : Path , attrs : BasicFileAttributes ) : FileVisitResult { return if ( Files . isReadable ( dir ) ) FileVisitResult . CONTINUE else FileVisitResult . SKIP_SUBTREE } override fun visitFile ( file : Path , attrs : BasicFileAttributes ) : FileVisitResult { if ( ! Files . isRegularFile ( file ) || ! Files . isReadable ( file ) ) return FileVisitResult . CONTINUE if ( file . hasSuitableExtensionToAnalyse ( ) ) { result . add ( file ) } return FileVisitResult . CONTINUE } override fun visitFileFailed ( file : Path , exc : IOException ? ) : FileVisitResult { return FileVisitResult . CONTINUE } } ) return result }","docstring":"/**\n * Collect source file path from the given [root]\n *\n * E.g., for `project/app/src` as a [root], this will walk the file tree and\n * collect all `.kt`, `.kts`, and `.java` files under that folder.\n *\n * Note that this util gracefully skips [IOException] during file tree traversal.\n */"} {"signature":"public expect fun todo ( block : ( ) -> Unit )","body":"public expect fun todo ( block : ( ) -> Unit )","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":"@ PublishedApi internal expect fun < T : Throwable > checkResultIsFailure ( exceptionClass : KClass < T > , message : String ? , blockResult : Result < Unit > ) : T","body":"@ PublishedApi internal expect fun < T : Throwable > checkResultIsFailure ( exceptionClass : KClass < T > , message : String ? , blockResult : Result < Unit > ) : T","docstring":"/** Asserts that a [blockResult] is a failure with the specific exception type being thrown. */"} {"signature":"private fun createDependencyCollector ( ) : AnnotationProcessorDependencyCollector","body":"{ val type = if ( kind == DeclaredProcType . DYNAMIC ) { val fromOptions = supportedOptions . singleOrNull { it . startsWith ( \"\" ) } if ( fromOptions == null ) { RuntimeProcType . NON_INCREMENTAL } else { val declaredType = fromOptions . drop ( \"\" . length ) . uppercase ( ) if ( ALLOWED_RUNTIME_TYPES . contains ( declaredType ) ) { enumValueOf ( declaredType ) } else { RuntimeProcType . NON_INCREMENTAL } } } else { kind . toRuntimeType ( ) } return AnnotationProcessorDependencyCollector ( type ) { s -> logger . warn ( \"\" ) } }","docstring":"/** This has to invoked only once the processors has been initialized, because this accesses Processor.getSupportedOptions(). */"} {"signature":"fun getGeneratedToSources ( ) : Map < File , String ? >","body":"= dependencyCollector . value . getGeneratedToSources ( )","docstring":"/** Mapping from generated file to type that were used as originating elements. For aggregating APs types will be [null]. */"} {"signature":"fun getAggregatedTypes ( )","body":"= dependencyCollector . value . getAggregatedTypes ( )","docstring":"/** All top-level types that were processed by aggregating APs. */"} {"signature":"fun getGeneratedClassFilesToTypes ( ) : Map < File , String >","body":"= dependencyCollector . value . getGeneratedClassFilesToTypes ( )","docstring":"/** Mapping from generated class file to type defined in that file. */"} {"signature":"internal fun getGeneratedToSources ( ) : Map < File , String ? >","body":"= if ( isFullRebuild ) emptyMap ( ) else generatedToSource","docstring":"/** Mapping from generated files to top level class names that cause that file generation. */"} {"signature":"@ OptIn ( DfaInternals :: class ) fun isAccessToUnstableLocalVariable ( fir : FirElement , targetType : ConeKotlinType ? , session : FirSession ) : Boolean","body":"{ if ( assignedLocalVariablesByDeclaration == null ) return false val realFir = fir . unwrapElement ( ) as? FirQualifiedAccessExpression ? : return false val property = realFir . calleeReference . toResolvedPropertySymbol ( ) ? . fir ? : return false return ! isStableType ( scopes . top ( ) . second [ property ] , targetType , session ) || postponedLambdas . all ( ) . any { lambdas -> lambdas . any { ( lambda , dataFlowOnly ) -> dataFlowOnly && property in lambda . assignedInside } } }","docstring":"/** Checks whether the given access is an unstable access to a local variable at this moment. */"} {"signature":"abstract fun check ( context : CheckerContext , rawReport : ( Boolean , String ) -> Unit )","body":"abstract fun check ( context : CheckerContext , rawReport : ( Boolean , String ) -> Unit )","docstring":"/**\n * This API allows us to check language version settings independently of particular code pieces.\n *\n * [rawReport] allows to report a diagnostic directly to a message collector.\n * This function accepts isError: Boolean and message: String as parameters.\n */"} {"signature":"fun clear ( )","body":"{ synchronized ( this ) { keys . forEach { remove ( it ) } } }","docstring":"/** Removes all entries. */"} {"signature":"fun deleteStorageFiles ( )","body":"{ synchronized ( this ) { check ( IOUtil . deleteAllFilesStartingWith ( storageFile ) ) { \"\" } } }","docstring":"/**\n * Deletes [storageFile] or a group of files associated with [storageFile] (e.g., an implementation of [PersistentStorage] may use a\n * [com.intellij.util.io.PersistentHashMap], which creates files such as \"storageFile.tab\", \"storageFile.tab.len\", etc.).\n *\n * Make sure the storage has been closed first before calling this method.\n */"} {"signature":"fun ssd ( )","body":"{ val modelHub = ONNXModelHub ( cacheDirectory = File ( \"\" ) ) val modelType = ONNXModels . ObjectDetection . SSD val model = modelHub . loadModel ( modelType ) model . printSummary ( ) model . use { println ( it ) val preprocessing = pipeline < BufferedImage > ( ) . resize { outputHeight = outputWidth = } . convert { colorMode = ColorMode . BGR } . toFloatArray { } . call ( modelType . preprocessor ) . fileLoader ( ) for ( i in .. ) { val inputData = preprocessing . load ( getFileFromResource ( \"\" ) ) val start = System . currentTimeMillis ( ) val yhat = it . predict ( inputData ) { output -> output . getFloatArray ( ) } val end = System . currentTimeMillis ( ) println ( \"\" ) println ( yhat . contentToString ( ) ) } } }","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":"= ssd ( )","docstring":"/** */"} {"signature":"fun < T > runSafe ( action : ( ) -> T ) : T ?","body":"fun < T > runSafe ( action : ( ) -> T ) : T ?","docstring":"/**\n * This method shall be used for any [action] used to build arguments, that could potentially throw an exception\n * (like resolving dependencies). There are some scenarios (like IDE import), where we want to be lenient\n * and provide arguments on a 'best effort bases'.\n */"} {"signature":"fun main ( )","body":"{ val image = ImageConverter . toBufferedImage ( getFileFromResource ( \"\" ) ) val modelHub = ONNXModelHub ( cacheDirectory = File ( \"\" ) ) val detectionModel = ONNXModels . FaceDetection . UltraFace320 . pretrainedModel ( modelHub ) detectionModel . printSummary ( ) val faces = detectionModel . use { it . detectFaces ( image ) } val alignmentModel = ONNXModels . FaceAlignment . Fan2d106 . pretrainedModel ( modelHub ) alignmentModel . printSummary ( ) val facesToLandmarks = alignmentModel . use { faces . associateWith { face -> alignmentModel . predictOnCrop ( image , face ) } } val resize = pipeline < BufferedImage > ( ) . resize { outputWidth = WIDTH outputHeight = WIDTH * image . height / image . width } showFrame ( \"\" + ( if ( facesToLandmarks . size == ) \"\" else \"\" ) , createDetectedLandmarksPanel ( resize . apply ( image ) , facesToLandmarks . values . flatten ( ) ) ) }","docstring":"/**\n * This example demonstrates how to combine Fan2d106 face alignment model and UltraFace320 face detection model to\n * find face landmarks on the image. The face alignment model works well only when the face has a certain size and location,\n * so for other cases it is necessary to find the face location first with a face detection model\n * and only then apply face alignment model to detect landmarks on the face crop.\n */"} {"signature":"@ Suppress ( \"\" ) private fun IrExpression . uncheckedCast ( type : IrType ) : IrExpression","body":"{ return this }","docstring":"/**\n * Casts this expression to `type` without changing its representation in generated code.\n */"} {"signature":"fun mapJavaToKotlin ( fqName : FqName ) : ClassId ?","body":"{ return javaToKotlin [ fqName . toUnsafe ( ) ] }","docstring":"/**\n * E.g.\n * - java.lang.String -> kotlin.String\n * - java.lang.Integer -> kotlin.Int\n * - kotlin.jvm.internal.IntCompanionObject -> kotlin.Int.Companion\n * - java.util.List -> kotlin.List\n * - java.util.Map.Entry -> kotlin.Map.Entry\n * - java.lang.Void -> null\n * - kotlin.jvm.functions.Function3 -> kotlin.Function3\n * - kotlin.jvm.functions.FunctionN -> null // Without a type annotation like @Arity(n), it's impossible to find out arity\n */"} {"signature":"fun mapKotlinToJava ( kotlinFqName : FqNameUnsafe ) : ClassId ?","body":"= when { isKotlinFunctionWithBigArity ( kotlinFqName , NUMBERED_FUNCTION_PREFIX ) -> FUNCTION_N_CLASS_ID isKotlinFunctionWithBigArity ( kotlinFqName , NUMBERED_SUSPEND_FUNCTION_PREFIX ) -> FUNCTION_N_CLASS_ID isKotlinFunctionWithBigArity ( kotlinFqName , NUMBERED_K_FUNCTION_PREFIX ) -> K_FUNCTION_CLASS_ID isKotlinFunctionWithBigArity ( kotlinFqName , NUMBERED_K_SUSPEND_FUNCTION_PREFIX ) -> K_FUNCTION_CLASS_ID else -> kotlinToJava [ kotlinFqName ] }","docstring":"/**\n * E.g.\n * - kotlin.Throwable -> java.lang.Throwable\n * - kotlin.Int -> java.lang.Integer\n * - kotlin.Int.Companion -> kotlin.jvm.internal.IntCompanionObject\n * - kotlin.Nothing -> java.lang.Void\n * - kotlin.IntArray -> null\n * - kotlin.Function3 -> kotlin.jvm.functions.Function3\n * - kotlin.coroutines.SuspendFunction3 -> kotlin.jvm.functions.Function4\n * - kotlin.Function42 -> kotlin.jvm.functions.FunctionN\n * - kotlin.coroutines.SuspendFunction42 -> kotlin.jvm.functions.FunctionN\n * - kotlin.reflect.KFunction3 -> kotlin.reflect.KFunction\n * - kotlin.reflect.KSuspendFunction3 -> kotlin.reflect.KFunction\n * - kotlin.reflect.KFunction42 -> kotlin.reflect.KFunction\n * - kotlin.reflect.KSuspendFunction42 -> kotlin.reflect.KFunction\n */"} {"signature":"internal fun Char . getCategoryValue ( ) : Int","body":"{ val ch = this . code val index = binarySearchRange ( rangeStart , ch ) val start = rangeStart [ index ] val code = rangeCategory [ index ] val value = categoryValueFrom ( code , ch - start ) return if ( value == ) CharCategory . UNASSIGNED . value else value }","docstring":"/**\n * Returns the Unicode general category of this character as an Int.\n */"} {"signature":"fun containsKlibDirectory ( path : String ) : Boolean","body":"{ val pathToTheManifestFile = ensureValidZipDirectoryPath ( path ) + \"\" return zip . getEntry ( pathToTheManifestFile ) != null }","docstring":"/**\n * Check if the underlying [zip] file contains klib at [path].\n * Note: This check also works for zip files that did not include any klibs.\n * This will return true, if any other zip-entry is placed inside this directory [path]\n */"} {"signature":"fun hasBackingField ( property : FirProperty , session : FirSession ) : Boolean","body":"fun hasBackingField ( property : FirProperty , session : FirSession ) : Boolean","docstring":"/**\n * Platform-dependent logic to determine whether a backing field is required for [property].\n * Should be called instead of [FirProperty.hasBackingField] to decide whether to create a backing field.\n * The implementation should return `true` in case a platform-dependent condition for backing field existence is met,\n * otherwise it should return the result of [Fir2IrExtensions.Default.hasBackingField].\n */"} {"signature":"fun isTrueStatic ( declaration : FirCallableDeclaration , session : FirSession ) : Boolean","body":"fun isTrueStatic ( declaration : FirCallableDeclaration , session : FirSession ) : Boolean","docstring":"/**\n * Whether this declaration is forcibly made static in the sense that it has no dispatch receiver.\n *\n * For example, on JVM this corresponds to the [JvmStatic] annotation.\n */"} {"signature":"fun usage ( )","body":"{ }","docstring":"/**\n * [Any.anyExt]\n * [Base.anyExt]\n * [Child.anyExt]\n *\n * [Any.baseExt]\n * [Base.baseExt]\n * [Child.baseExt]\n *\n * [Any.childExt]\n * [Base.childExt]\n * [Child.childExt]\n */"} {"signature":"fun markExportedDeclarations ( context : WasmBackendContext , irFile : IrFile , exportedFqNames : Set < FqName > )","body":"{ val exportConstructor = when ( context . isWasmJsTarget ) { true -> context . wasmSymbols . jsRelatedSymbols . jsExportConstructor else -> context . wasmSymbols . wasmExportConstructor } for ( declaration in irFile . declarations ) { if ( declaration is IrFunction && declaration . fqNameWhenAvailable in exportedFqNames ) { val builder = context . createIrBuilder ( irFile . symbol ) declaration . annotations += builder . irCallConstructor ( exportConstructor , typeArguments = emptyList ( ) ) } } }","docstring":"/**\n * Mark declarations from [exportedFqNames] with @JsExport annotation\n */"} {"signature":"fun < T : Number > sinh ( x : KtNDArray < T > ) : KtNDArray < Double >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( x ) , dtype = Double :: class )","docstring":"/**\n * Hyperbolic sine, element-wise.\n */"} {"signature":"fun < T : Number > cosh ( x : KtNDArray < T > ) : KtNDArray < Double >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( x ) , dtype = Double :: class )","docstring":"/**\n * Hyperbolic cosine, element-wise.\n */"} {"signature":"fun < T : Number > tanh ( x : KtNDArray < T > ) : KtNDArray < Double >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( x ) , dtype = Double :: class )","docstring":"/**\n * Compute hyperbolic tangent element-wise.\n */"} {"signature":"fun < T : Number > arcsinh ( x : KtNDArray < T > ) : KtNDArray < Double >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( x ) , dtype = Double :: class )","docstring":"/**\n * Inverse hyperbolic sine element-wise.\n */"} {"signature":"fun < T : Number > arccosh ( x : KtNDArray < T > ) : KtNDArray < Double >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( x ) , dtype = Double :: class )","docstring":"/**\n * Inverse hyperbolic cosine, element-wise.\n */"} {"signature":"fun < T : Number > arctanh ( x : KtNDArray < T > ) : KtNDArray < Double >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( x ) , dtype = Double :: class )","docstring":"/**\n * Inverse hyperbolic tangent element-wise.\n */"} {"signature":"@ Test fun `schema extracted via readFromDB method is resolved` ( )","body":"{ val result = KspCompilationTestRunner . compile ( TestCompilationParameters ( sources = listOf ( SourceFile . kotlin ( \"\" , \"\"\"\"\"\" . trimIndent ( ) ) ) ) ) result . successfulCompilation shouldBe true }","docstring":"/**\n * Test code is copied from h2Test `read from table` test.\n */"} {"signature":"fun getBuiltinsModule ( platform : TargetPlatform ) : KtBuiltinsModule","body":"= builtinsModules . getOrPut ( platform ) { KtBuiltinsModule ( platform , platform . getAnalyzerServices ( ) , project ) }","docstring":"/**\n * Returns the [platform]'s [KtBuiltinsModule]. [getBuiltinsModule] should be used instead of [getBuiltinsSession] when a\n * [KtBuiltinsModule] is needed as a dependency for other [KtModule]s. This is because during project structure creation, we have to\n * avoid the creation of the builtins *session*, as not all services might have been registered at that point.\n */"} {"signature":"@ HtmlTagMarker inline fun UL . li ( classes : String ? = null , crossinline block : LI . ( ) -> Unit = { } ) : Unit","body":"= LI ( attributesMapOf ( \"\" , classes ) , consumer ) . visit ( block )","docstring":"/**\n * List item\n */"} {"signature":"fun doesJavaOverrideHaveIncompatibleValueParameterKinds ( superDescriptor : CallableDescriptor , subDescriptor : CallableDescriptor ) : Boolean","body":"{ if ( subDescriptor !is JavaMethodDescriptor || superDescriptor !is FunctionDescriptor ) return false assert ( subDescriptor . valueParameters . size == superDescriptor . valueParameters . size ) { \"\" } for ( ( subParameter , superParameter ) in subDescriptor . original . valueParameters . zip ( superDescriptor . original . valueParameters ) ) { val isSubPrimitive = mapValueParameterType ( subDescriptor , subParameter ) is JvmType . Primitive val isSuperPrimitive = mapValueParameterType ( superDescriptor , superParameter ) is JvmType . Primitive if ( isSubPrimitive != isSuperPrimitive ) { return true } } return false }","docstring":"/**\n * Checks if any pair of corresponding value parameters has different type kinds, e.g. one is primitive and another is not\n *\n * As it comes from it's name it only checks overrides in Java classes\n */"} {"signature":"fun main ( )","body":"{ val ( train , test ) = mnist ( ) val sampleIndex = val x = test . getX ( sampleIndex ) val y = test . getY ( sampleIndex ) . toInt ( ) lenet5 ( ) . use { it . compile ( optimizer = Adam ( ) , loss = Losses . SOFT_MAX_CROSS_ENTROPY_WITH_LOGITS , metric = Metrics . ACCURACY ) it . logSummary ( ) it . fit ( dataset = train , validationRate = , epochs = EPOCHS , trainBatchSize = TRAINING_BATCH_SIZE , validationBatchSize = TEST_BATCH_SIZE ) val numbersPlots = List ( ) { imageIndex -> flattenImagePlot ( imageIndex , test , it :: predictLabel ) } columnPlot ( numbersPlots , , ) . show ( ) val accuracy = it . evaluate ( dataset = test , batchSize = TEST_BATCH_SIZE ) . metrics [ Metrics . ACCURACY ] println ( \"\" ) val fstConv2D = it . layers [ ] as Conv2D val sndConv2D = it . layers [ ] as Conv2D filtersPlot ( fstConv2D , columns = ) . show ( ) filtersPlot ( sndConv2D , columns = ) . show ( ) drawFilters ( fstConv2D . weights . values . toTypedArray ( ) [ ] , colorCoefficient = ) drawFilters ( sndConv2D . weights . values . toTypedArray ( ) [ ] , colorCoefficient = ) val layersActivations = modelActivationOnLayersPlot ( it , x ) val ( prediction , activations ) = it . predictAndGetActivations ( x ) println ( \"\" ) println ( \"\" ) layersActivations [ ] . show ( ) layersActivations [ ] . show ( ) drawActivations ( activations ) } }","docstring":"/**\n * This examples demonstrates model activations and Conv2D filters visualisation.\n *\n * Model is trained on Mnist dataset.\n */"} {"signature":"internal fun Char . isLetterImpl ( ) : Boolean","body":"{ return getLetterType ( ) != }","docstring":"/**\n * Returns `true` if this character is a letter.\n */"} {"signature":"internal fun Char . isLowerCaseImpl ( ) : Boolean","body":"{ return getLetterType ( ) == || code . isOtherLowercase ( ) }","docstring":"/**\n * Returns `true` if this character is a lower case letter, or it has contributory property `Other_Lowercase`.\n */"} {"signature":"internal fun Char . isUpperCaseImpl ( ) : Boolean","body":"{ return getLetterType ( ) == || code . isOtherUppercase ( ) }","docstring":"/**\n * Returns `true` if this character is an upper case letter, or it has contributory property `Other_Uppercase`.\n */"} {"signature":"private fun Char . getLetterType ( ) : Int","body":"{ val ch = this . code val index = binarySearchRange ( rangeStart , ch ) val rangeStart = rangeStart [ index ] val rangeEnd = rangeStart + rangeLength [ index ] - val code = rangeCategory [ index ] if ( ch > rangeEnd ) { return } val lastTwoBits = code and if ( lastTwoBits == ) { var shift = var threshold = rangeStart for ( i in .. ) { threshold += ( code shr shift ) and if ( threshold > ch ) { return } shift += threshold += ( code shr shift ) and if ( threshold > ch ) { return } shift += } return } if ( code <= ) { return lastTwoBits } val distance = ( ch - rangeStart ) val shift = if ( code <= ) distance % else distance return ( code shr ( * shift ) ) and }","docstring":"/**\n * Returns\n * - `1` if the character is a lower case letter,\n * - `2` if the character is an upper case letter,\n * - `3` if the character is a letter but not a lower or upper case letter,\n * - `0` otherwise.\n */"} {"signature":"public fun StandaloneAnalysisAPISession . getAllLibraryModules ( ) : Sequence < KtLibraryModule >","body":"{ val projectStructureProvider = project . getService ( ProjectStructureProvider :: class . java ) ? : error ( \"\" ) if ( projectStructureProvider !is KtStaticProjectStructureProvider ) { error ( \"\" ) } return projectStructureProvider . allKtModules . withClosureSequence < KtModule > { module -> module . allDirectDependencies ( ) . asIterable ( ) } . filterIsInstance < KtLibraryModule > ( ) }","docstring":"/**\n * Returns all registered [KtLibraryModule] in this [StandaloneAnalysisAPISession].\n * Note: If a library module is not added as a dependency of another module, make sure to add the module directly as in:\n * ```kotlin\n * buildKtModuleProvider {\n * addModule( // <- !! addModule !!\n * buildKtLibraryModule {\n * addBinaryRoot(myKlibRootPath)\n * libraryName = myLibraryName\n * // ...\n * }\n * )\n * }\n * ```\n */"} {"signature":"@ InternalCoroutinesApi public fun processNextEventInCurrentThread ( ) : Long","body":"= ThreadLocalEventLoop . currentOrNull ( ) ? . processNextEvent ( ) ? : Long . MAX_VALUE","docstring":"/**\n * Processes next event in the current thread's event loop.\n *\n * The result of this function is to be interpreted like this:\n * - `<= 0` -- there are potentially more events for immediate processing;\n * - `> 0` -- a number of nanoseconds to wait for the next scheduled event;\n * - [Long.MAX_VALUE] -- no more events or no thread-local event loop.\n *\n * Sample usage of this function:\n *\n * ```\n * while (waitingCondition) {\n * val time = processNextEventInCurrentThread()\n * LockSupport.parkNanos(time)\n * }\n * ```\n *\n * @suppress **This an internal API and should not be used from general code.**\n */"} {"signature":"@ InternalCoroutinesApi @ DelicateCoroutinesApi @ PublishedApi internal fun runSingleTaskFromCurrentSystemDispatcher ( ) : Long","body":"{ val thread = Thread . currentThread ( ) if ( thread !is CoroutineScheduler . Worker ) throw IllegalStateException ( \"\" ) return thread . runSingleTask ( ) }","docstring":"/**\n * Retrieves and executes a single task from the current system dispatcher ([Dispatchers.Default] or [Dispatchers.IO]).\n * Returns `0` if any task was executed, `>= 0` for number of nanoseconds to wait until invoking this method again\n * (implying that there will be a task to steal in N nanoseconds), `-1` if there is no tasks in the corresponding dispatcher at all.\n *\n * ### Invariants\n *\n * - When invoked from [Dispatchers.Default] **thread** (even if the actual context is different dispatcher,\n * [CoroutineDispatcher.limitedParallelism] or any in-place wrapper), it runs an arbitrary task that ended\n * up being scheduled to [Dispatchers.Default] or its counterpart. Tasks scheduled to [Dispatchers.IO]\n * **are not** executed[1].\n * - When invoked from [Dispatchers.IO] thread, the same rules apply, but for blocking tasks only.\n *\n * [1] -- this is purely technical limitation: the scheduler does not have \"notify me when CPU token is available\" API,\n * and we cannot leave this method without leaving thread in its original state.\n *\n * ### Rationale\n *\n * This is an internal API that is intended to replace IDEA's core FJP decomposition.\n * The following API is provided by IDEA core:\n * ```\n * runDecomposedTaskAndJoinIt { // <- non-suspending call\n * // spawn as many tasks as needed\n * // these tasks can also invoke 'runDecomposedTaskAndJoinIt'\n * }\n * ```\n * The key observation here is that 'runDecomposedTaskAndJoinIt' can be invoked from `Dispatchers.Default` itself,\n * thus blocking at least one thread. To avoid deadlocks and starvation during large hierarchical decompositions,\n * 'runDecomposedTaskAndJoinIt' should not just block but also **help** execute the task or other tasks\n * until an arbitrary condition is satisfied.\n *\n * See #3439 for additional details.\n *\n * ### Limitations and caveats\n *\n * - Executes tasks in-place, thus potentially leaking irrelevant thread-locals from the current thread\n * - Is not 100% effective, because the caller should somehow \"wait\" (or do other work) for [Long] returned nanoseconds\n * even when work arrives immediately after returning from this method.\n * - When there is no more work, it's up to the caller to decide what to do. It's important to remember that\n * work to current dispatcher may arrive **later** from external sources [1]\n *\n * [1] -- this is also a technicality that can be solved in kotlinx.coroutines itself, but unfortunately requires\n * a tremendous effort.\n *\n * @throws IllegalStateException if the current thread is not system dispatcher thread\n */"} {"signature":"@ InternalCoroutinesApi @ DelicateCoroutinesApi @ PublishedApi internal fun Thread . isIoDispatcherThread ( ) : Boolean","body":"{ if ( this !is CoroutineScheduler . Worker ) return false return isIo ( ) }","docstring":"/**\n * Checks whether the given thread belongs to Dispatchers.IO.\n * Note that feature \"is part of the Dispatchers.IO\" is *dynamic*, meaning that the thread\n * may change this status when switching between tasks.\n *\n * This function is inteded to be used on the result of `Thread.currentThread()` for diagnostic\n * purposes, and is declared as an extension only to avoid top-level scope pollution.\n */"} {"signature":"override fun hashCode ( ) : Int","body":"= classIdIfNonLocal ? . hashCode ( ) ? : symbolHashCode ( )","docstring":"/**\n * All kinds of non-local named class or object symbols must have the same kind of hash code. The class ID is the best option, as the\n * same class/object may be represented by multiple different symbols.\n */"} {"signature":"abstract fun computePackageNamesWithTopLevelClassifiers ( ) : Set < String > ?","body":"abstract fun computePackageNamesWithTopLevelClassifiers ( ) : Set < String > ?","docstring":"/**\n * This function is only called if [hasSpecificClassifierPackageNamesComputation] is `true`. Otherwise, the classifier package set will\n * be taken from the cached general package names to avoid building duplicate sets.\n */"} {"signature":"abstract fun computePackageNamesWithTopLevelCallables ( ) : Set < String > ?","body":"abstract fun computePackageNamesWithTopLevelCallables ( ) : Set < String > ?","docstring":"/**\n * This function is only called if [hasSpecificCallablePackageNamesComputation] is `true`. Otherwise, the callable package set will be\n * taken from the cached general package names to avoid building duplicate sets.\n */"} {"signature":"fun buildFakeOverridesForClass ( clazz : IrClass , oldSignatures : Boolean )","body":"{ strategy . inFile ( clazz . fileOrNull ) { val ( staticMembers , instanceMembers ) = clazz . declarations . filterIsInstance < IrOverridableMember > ( ) . partition { it . isStaticMember } buildFakeOverridesForClassImpl ( clazz , instanceMembers , oldSignatures , clazz . superTypes , isStaticMembers = false ) val superClass = clazz . superTypes . filter { it . classOrFail . owner . isClass } buildFakeOverridesForClassImpl ( clazz , staticMembers , oldSignatures , superClass , isStaticMembers = true ) } }","docstring":"/**\n * This function builds all fake overrides for [clazz] and computes overridden symbols for all its members.\n */"} {"signature":"fun buildFakeOverridesForClassUsingOverriddenSymbols ( clazz : IrClass , implementedMembers : List < IrOverridableMember > = emptyList ( ) , compatibilityMode : Boolean , ignoredParentSymbols : List < IrSymbol > = emptyList ( ) ) : List < IrOverridableMember >","body":"{ val overriddenMembers = ( clazz . declarations . filterIsInstance < IrOverridableMember > ( ) + implementedMembers ) . flatMap { member -> member . overriddenSymbols . map { it . owner } } . toSet ( ) val unoverriddenSuperMembers = clazz . superTypes . flatMap { superType -> val superClass = superType . getClass ( ) ? : error ( \"\" ) superClass . declarations . filterIsInstanceAnd < IrOverridableMember > { it !in overriddenMembers && it . symbol !in ignoredParentSymbols && ! it . isStaticMember } . mapNotNull { overriddenMember -> val fakeOverride = strategy . fakeOverrideMember ( superType , overriddenMember , clazz ) ? : return@mapNotNull null FakeOverride ( fakeOverride , overriddenMember ) } } val unoverriddenSuperMembersGroupedByName = unoverriddenSuperMembers . groupBy { it . override . name } val fakeOverrides = mutableListOf < IrOverridableMember > ( ) for ( group in unoverriddenSuperMembersGroupedByName . values ) { createAndBindFakeOverrides ( clazz , group , fakeOverrides , compatibilityMode ) } return fakeOverrides }","docstring":"/**\n * This function builds all missing fake overrides, assuming that already existing members have correct overriden symbols.\n *\n * In particular, if a member of super class can be overridden, but none of the members have it in their overriddenSymbols,\n * fake override would be created.\n */"} {"signature":"private fun filterOutCustomizedFakeOverrides ( overridableMembers : Collection < FakeOverride > ) : Collection < FakeOverride >","body":"{ if ( overridableMembers . size < ) return overridableMembers val ( trueFakeOverrides , customizedFakeOverrides ) = overridableMembers . partition { it . override . origin == IrDeclarationOrigin . FAKE_OVERRIDE } return trueFakeOverrides . ifEmpty { customizedFakeOverrides } }","docstring":"/**\n * If there is a mix of [IrOverridableMember]s with origin=[IrDeclarationOrigin.FAKE_OVERRIDE]s (true \"fake overrides\")\n * and [IrOverridableMember]s that were customized with the help of [IrUnimplementedOverridesStrategy] (customized \"fake overrides\"),\n * then leave only true ones. Rationale: They should point to non-abstract callable members in one of super classes, so\n * effectively they are implemented in the current class.\n */"} {"signature":"private fun String . renumberObjects ( ) : String","body":"{ val ids = HashMap < String , String > ( ) fun newId ( objectId : String ) : String { return ids . getOrPut ( objectId , { \"\" + ids . size } ) } val m = Pattern . compile ( \"\" ) . matcher ( this ) val sb = StringBuffer ( ) while ( m . find ( ) ) { m . appendReplacement ( sb , newId ( m . group ( ) ) ) } m . appendTail ( sb ) return sb . toString ( ) }","docstring":"/**\n * Replaces ids in the given string so that they increase\n * Example:\n * input = \"A@21 B@6\"\n * output = \"A@0 B@1\"\n */"} {"signature":"@ Test fun transferToReadsOneSegmentAtATime ( )","body":"{ val write1 = Buffer ( ) . also { it . writeString ( \"\" . repeat ( Segment . SIZE ) ) } val write2 = Buffer ( ) . also { it . writeString ( \"\" . repeat ( Segment . SIZE ) ) } val write3 = Buffer ( ) . also { it . writeString ( \"\" . repeat ( Segment . SIZE ) ) } val source = Buffer ( ) source . writeString ( \"\" ) val mockSink = MockSink ( ) val bufferedSource = ( source as RawSource ) . buffered ( ) assertEquals ( Segment . SIZE . toLong ( ) * , bufferedSource . transferTo ( mockSink ) ) mockSink . assertLog ( \"\" , \"\" , \"\" ) }","docstring":"/**\n * We don't want transferTo to buffer an unbounded amount of data. Instead it\n * should buffer a segment, write it, and repeat.\n */"} {"signature":"private fun forceResolveTypeContents ( type : KotlinType )","body":"{ type . annotations if ( type . isFlexible ( ) ) { forceResolveTypeContents ( type . asFlexibleType ( ) . lowerBound ) forceResolveTypeContents ( type . asFlexibleType ( ) . upperBound ) } else { type . constructor for ( projection in type . arguments ) { if ( ! projection . isStarProjection ) { forceResolveTypeContents ( projection . type ) } } } }","docstring":"/**\n * This function is light version of ForceResolveUtil.forceResolveAllContents\n * We can't use ForceResolveUtil.forceResolveAllContents here because it runs ForceResolveUtil.forceResolveAllContents(getConstructor()),\n * which is unsafe for some cyclic cases. For Example:\n * class A: List {\n * class B\n * }\n * Here when we resolve class B, we should resolve supertype for A and we shouldn't start resolve for class B,\n * otherwise it would be a cycle.\n * Now there is no cycle here because member scope for A is very clever and can get lazy descriptor for class B without resolving it.\n *\n * todo: find another way after release\n */"} {"signature":"private fun canBeUsedAsBareType ( descriptor : TypeAliasDescriptor ) : Boolean","body":"{ val expandedType = descriptor . expandedType if ( expandedType . isError ) return false val classDescriptor = descriptor . classDescriptor ? : return false if ( ! isPossibleToSpecifyTypeArgumentsFor ( classDescriptor ) ) return false val usedTypeParameters = linkedSetOf < TypeParameterDescriptor > ( ) for ( argument in expandedType . arguments ) { if ( argument . isStarProjection ) continue if ( argument . projectionKind != INVARIANT ) return false val argumentTypeDescriptor = argument . type . constructor . declarationDescriptor as? TypeParameterDescriptor ? : return false if ( argumentTypeDescriptor . containingDeclaration != descriptor ) return false if ( usedTypeParameters . contains ( argumentTypeDescriptor ) ) return false usedTypeParameters . add ( argumentTypeDescriptor ) } return true }","docstring":"/**\n * Type alias can be used as bare type (after is/as, e.g., 'x is List')\n * iff all type arguments of the corresponding expanded type are either star projections\n * or type parameters of the given type alias in invariant projection,\n * and each of the type parameters is mentioned no more than once.\n *\n * E.g.:\n * ```\n * typealias HashMap = java.util.HashMap // can be used as bare type\n * typealias MyList = List // can be used as bare type\n * typealias StarMap = Map // can be used as bare type\n * typealias MyMap = Map // CAN NOT be used as bare type: type parameter 'T' is used twice\n * typealias StringMap = Map // CAN NOT be used as bare type: type argument 'String' is not a type parameter\n * ```\n */"} {"signature":"private fun collectArgumentsForClassifierTypeConstructor ( c : TypeResolutionContext , classifierDescriptor : ClassifierDescriptorWithTypeParameters , qualifierParts : List < QualifiedExpressionResolver . ExpressionQualifierPart > ) : Pair < List < KtTypeProjection > , List < TypeProjection > ? > ?","body":"{ val classifierDescriptorChain = classifierDescriptor . classifierDescriptorsFromInnerToOuter ( ) val reversedQualifierParts = qualifierParts . asReversed ( ) var wasStatic = false val result = SmartList < KtTypeProjection > ( ) val classifierChainLastIndex = min ( classifierDescriptorChain . size , reversedQualifierParts . size ) - for ( index in .. classifierChainLastIndex ) { val qualifierPart = reversedQualifierParts [ index ] val currentArguments = qualifierPart . typeArguments ? . arguments . orEmpty ( ) val declaredTypeParameters = classifierDescriptorChain [ index ] . declaredTypeParameters val currentParameters = if ( wasStatic ) emptyList ( ) else declaredTypeParameters if ( wasStatic && currentArguments . isNotEmpty ( ) && declaredTypeParameters . isNotEmpty ( ) ) { c . trace . report ( TYPE_ARGUMENTS_FOR_OUTER_CLASS_WHEN_NESTED_REFERENCED . on ( qualifierPart . typeArguments ! ! ) ) return null } if ( currentArguments . size != currentParameters . size ) { c . trace . report ( WRONG_NUMBER_OF_TYPE_ARGUMENTS . on ( qualifierPart . typeArguments ? : qualifierPart . expression , currentParameters . size , classifierDescriptorChain [ index ] ) ) return null } result . addAll ( currentArguments ) wasStatic = wasStatic || ! classifierDescriptorChain [ index ] . isInner } val nonClassQualifierParts = reversedQualifierParts . subList ( min ( classifierChainLastIndex + , reversedQualifierParts . size ) , reversedQualifierParts . size ) for ( ( _ , _ , typeArguments ) in nonClassQualifierParts ) { if ( typeArguments != null ) { c . trace . report ( TYPE_ARGUMENTS_NOT_ALLOWED . on ( typeArguments , \"\" ) ) return null } } val parameters = classifierDescriptor . typeConstructor . parameters if ( result . size < parameters . size ) { val nextParameterOwner = parameters [ result . size ] . original . containingDeclaration as? ClassDescriptor ? : return Pair ( result , null ) val restArguments = c . scope . findImplicitOuterClassArguments ( nextParameterOwner ) val restParameters = parameters . subList ( result . size , parameters . size ) val typeArgumentsCanBeSpecifiedCount = classifierDescriptor . classifierDescriptorsFromInnerToOuter ( ) . sumOf { it . declaredTypeParameters . size } if ( restArguments == null && typeArgumentsCanBeSpecifiedCount > result . size ) { c . trace . report ( OUTER_CLASS_ARGUMENTS_REQUIRED . on ( qualifierParts . first ( ) . expression , nextParameterOwner ) ) return null } else if ( restArguments == null ) { assert ( typeArgumentsCanBeSpecifiedCount == result . size ) { \"\" + \"\" } return Pair ( result , null ) } else { assert ( restParameters . size == restArguments . size ) { \"\" + \"\" } return Pair ( result , restArguments ) } } return Pair ( result , null ) }","docstring":"/**\n * @return yet unresolved KtTypeProjection arguments and already resolved ones relevant to an outer class\n * @return null if error was reported\n *\n * If second component is null then rest of the arguments should be appended using default types of relevant parameters\n */"} {"signature":"private fun appendDefaultArgumentsForLocalClassifier ( fromIndex : Int , constructorParameters : List < TypeParameterDescriptor > )","body":"= constructorParameters . subList ( fromIndex , constructorParameters . size ) . map { TypeProjectionImpl ( it . original . defaultType ) }","docstring":"/**\n * For cases like:\n * fun foo() {\n * class Local\n * val x: Local <-- resolve this type\n * }\n *\n * type constructor for `Local` captures type parameter E from containing outer function\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":"@ Test fun `test - simple class` ( )","body":"{ val module = createModuleDescriptor ( \"\" ) val foo = module . findClassAcrossModuleDependencies ( ClassId . fromString ( \"\" ) ) ! ! assertNull ( createObjCExportMapper ( ) . getCustomTypeMapper ( foo ) ) }","docstring":"/**\n * No 'type mapper' expected for a simple Kotlin class like 'Foo'.\n * Only well known standard types (List, ...) will get mapped to their corresponding\n * ObjC counterpart (NSArray, ...)\n */"} {"signature":"@ Test fun `test - List of int` ( )","body":"{ val module = createModuleDescriptor ( \"\" ) val objcExportMapper = createObjCExportMapper ( ) val objcExportNamer = createObjCExportNamer ( mapper = objcExportMapper ) val objcExportTranslator = ObjCExportTranslatorImpl ( generator = ObjCExportHeaderGeneratorImpl ( moduleDescriptors = listOf ( module ) , mapper = objcExportMapper , namer = objcExportNamer , problemCollector = ObjCExportProblemCollector . SILENT , objcGenerics = true , shouldExportKDoc = false , additionalImports = emptyList ( ) ) , mapper = objcExportMapper , namer = objcExportNamer , problemCollector = ObjCExportProblemCollector . SILENT , objcGenerics = true ) val listClassDescriptor = module . findClassAcrossModuleDependencies ( ClassId . fromString ( \"\" ) ) ! ! val intClassDescriptor = module . findClassAcrossModuleDependencies ( ClassId . fromString ( \"\" ) ) ! ! val listOfIntType = KotlinTypeFactory . simpleNotNullType ( TypeAttributes . Empty , listClassDescriptor , listOf ( TypeProjectionImpl ( KotlinTypeFactory . simpleNotNullType ( TypeAttributes . Empty , intClassDescriptor , emptyList ( ) ) ) ) ) val typeMapper = assertNotNull ( objcExportMapper . getCustomTypeMapper ( listClassDescriptor ) ) assertEquals ( ClassId . fromString ( \"\" ) , typeMapper . mappedClassId ) val listOfIntMapped = typeMapper . mapType ( listOfIntType , objcExportTranslator , objCExportScope = ObjCRootExportScope ) assertEquals ( ObjCClassType ( \"\" , typeArguments = listOf ( ObjCClassType ( \"\" ) ) ) , listOfIntMapped ) assertEquals ( \"\" , listOfIntMapped . toString ( ) ) }","docstring":"/**\n * Will test ObjC type mapping from List to NSArray *\n */"} {"signature":"@ ExperimentalStdlibApi public fun ByteString . toHexString ( format : HexFormat = HexFormat . Default ) : String","body":"{ return getBackingArrayReference ( ) . toHexString ( , getBackingArrayReference ( ) . size , format ) }","docstring":"/**\n * Formats bytes in this byte string using the specified [format].\n *\n * Note that only [HexFormat.upperCase] and [HexFormat.BytesHexFormat] affect formatting.\n *\n * @param format the [HexFormat] to use for formatting, [HexFormat.Default] by default.\n *\n * @throws IllegalArgumentException if the result length is more than [String] maximum capacity.\n */"} {"signature":"@ ExperimentalStdlibApi public fun ByteString . toHexString ( startIndex : Int = , endIndex : Int = size , format : HexFormat = HexFormat . Default ) : String","body":"{ return getBackingArrayReference ( ) . toHexString ( startIndex , endIndex , format ) }","docstring":"/**\n * Formats bytes in this byte string using the specified [HexFormat].\n *\n * Note that only [HexFormat.upperCase] and [HexFormat.BytesHexFormat] affect formatting.\n *\n * @param startIndex the beginning (inclusive) of the subrange to format, 0 by default.\n * @param endIndex the end (exclusive) of the subrange to format, size of this byte string by default.\n * @param format the [HexFormat] to use for formatting, [HexFormat.Default] by default.\n *\n * @throws IndexOutOfBoundsException when [startIndex] or [endIndex] is out of range of this byte string indices.\n * @throws IllegalArgumentException when `startIndex > endIndex`.\n * @throws IllegalArgumentException if the result length is more than [String] maximum capacity.\n */"} {"signature":"@ ExperimentalStdlibApi public fun String . hexToByteString ( format : HexFormat = HexFormat . Default ) : ByteString","body":"{ return ByteString . wrap ( hexToByteArray ( format ) ) }","docstring":"/**\n * Parses bytes from this string using the specified [HexFormat].\n *\n * Note that only [HexFormat.BytesHexFormat] affects parsing,\n * and parsing is performed in case-insensitive manner.\n * Also, any of the char sequences CRLF, LF and CR is considered a valid line separator.\n *\n * @param format the [HexFormat] to use for parsing, [HexFormat.Default] by default.\n *\n * @throws IllegalArgumentException if this string does not comply with the specified [format].\n */"} {"signature":"@ SinceKotlin ( \"\" ) inline fun < reified T : Annotation > KAnnotatedElement . findAnnotation ( ) : T ?","body":"= @ Suppress ( \"\" ) annotations . firstOrNull { it is T } as T ?","docstring":"/**\n * Returns an annotation of the given type on this element.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ Suppress ( \"\" , \"\" ) @ WasExperimental ( ExperimentalStdlibApi :: class ) inline fun < reified T : Annotation > KAnnotatedElement . hasAnnotation ( ) : Boolean","body":"= findAnnotation < T > ( ) != null","docstring":"/**\n * Returns true if this element is annotated with an annotation of type [T].\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ Suppress ( \"\" , \"\" ) @ WasExperimental ( ExperimentalStdlibApi :: class ) inline fun < reified T : Annotation > KAnnotatedElement . findAnnotations ( ) : List < T >","body":"= findAnnotations ( T :: class )","docstring":"/**\n * Returns all annotations of the given type on this element, including individually applied annotations\n * as well as repeated annotations.\n *\n * In case the annotation is repeated, instances are extracted from the container annotation class similarly to how it happens\n * in Java reflection ([java.lang.reflect.AnnotatedElement.getAnnotationsByType]). This is supported both for Kotlin-repeatable\n * ([kotlin.annotation.Repeatable]) and Java-repeatable ([java.lang.annotation.Repeatable]) annotation classes.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ Suppress ( \"\" , \"\" ) @ WasExperimental ( ExperimentalStdlibApi :: class ) fun < T : Annotation > KAnnotatedElement . findAnnotations ( klass : KClass < T > ) : List < T >","body":"{ val filtered = annotations . filterIsInstance ( klass . java ) if ( filtered . isNotEmpty ( ) ) return filtered val containerClass = Java8RepeatableContainerLoader . loadRepeatableContainer ( klass . java ) if ( containerClass != null ) { val container = annotations . firstOrNull { it . annotationClass . java == containerClass } if ( container != null ) { val valueMethod = container :: class . java . getMethod ( \"\" ) @ Suppress ( \"\" ) return ( valueMethod ( container ) as Array < T > ) . asList ( ) } } return emptyList ( ) }","docstring":"/**\n * Returns all annotations of the given type on this element, including individually applied annotations\n * as well as repeated annotations.\n *\n * In case the annotation is repeated, instances are extracted from the container annotation class similarly to how it happens\n * in Java reflection ([java.lang.reflect.AnnotatedElement.getAnnotationsByType]). This is supported both for Kotlin-repeatable\n * ([kotlin.annotation.Repeatable]) and Java-repeatable ([java.lang.annotation.Repeatable]) annotation classes.\n */"} {"signature":"private fun specialDoubleToULong ( v : Double ) : ULong","body":"{ require ( v >= . pow ( ) ) require ( v < . pow ( ) ) val bits = v . toBits ( ) . toULong ( ) return ( shl ) + ( ( bits and ( shl ) - ) shl ) }","docstring":"/** Creates an ULong value directly from mantissa bits of Double that is in range [2^63, 2^64). */"} {"signature":"public fun loadModel ( modelType : OnnxModelType < * > , vararg executionProviders : ExecutionProvider = arrayOf ( ExecutionProvider . CPU ( ) ) ) : OnnxInferenceModel","body":"{ val modelResourceId = context . resources . getIdentifier ( modelType . modelRelativePath , \"\" , context . packageName ) val inferenceModel = OnnxInferenceModel { context . resources . openRawResource ( modelResourceId ) . use { it . readBytes ( ) } } inferenceModel . initializeWith ( * executionProviders ) return inferenceModel }","docstring":"/**\n * Loads ONNX model from android resources.\n * By default, the model is initialized with [ExecutionProvider.CPU] execution provider.\n *\n * @param [modelType] model type from [ONNXModels]\n * @param [executionProviders] execution providers for model initialization.\n */"} {"signature":"@ Suppress ( \"\" ) override fun < T : InferenceModel < * > , U > loadModel ( modelType : ModelType < T , U > , loadingMode : LoadingMode , ) : T","body":"{ return loadModel ( modelType as OnnxModelType < * > ) as T }","docstring":"/**\n * It's equivalent to [loadModel] with [ExecutionProvider.CPU] execution provider.\n *\n * @param [modelType] model type from [ONNXModels]\n * @param [loadingMode] it's ignored\n */"} {"signature":"internal suspend fun Project . findCInteropCommonizerGroup ( dependent : CInteropCommonizerDependent ) : CInteropCommonizerGroup ?","body":"{ val suitableGroups = kotlinCInteropGroups . await ( ) . filter { group -> group . interops . containsAll ( dependent . interops ) && group . targets . contains ( dependent . target ) } assert ( suitableGroups . size <= ) { \"\" } return suitableGroups . firstOrNull ( ) }","docstring":"/**\n * Utility function that allows to find the corresponding [CInteropCommonizerGroup] for a given [CInteropCommonizerDependent]\n */"} {"signature":"fun usage ( )","body":"{ }","docstring":"/**\n * [one]\n *\n * [one.two]\n * [one.two]\n *\n * [one.two.three]\n * [one.two.three]\n * [one.two.three]\n *\n * [one.two.three.Four.Five]\n * [one.two.three.Four.Five]\n * [one.two.three.Four.Five]\n */"} {"signature":"public fun ObjectDetectionModelBase < Bitmap > . detectObjects ( imageProxy : ImageProxy , topK : Int = ) : List < DetectedObject >","body":"= when ( this ) { is CameraXCompatibleModel -> { doWithRotation ( imageProxy . imageInfo . rotationDegrees ) { detectObjects ( imageProxy . toBitmap ( ) , topK ) } } else -> detectObjects ( imageProxy . toBitmap ( applyRotation = true ) , topK ) }","docstring":"/**\n * Returns the detected object for the given image sorted by the score.\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] The number of the detected objects with the highest score to be returned.\n * @return List of [DetectedObject] sorted by score.\n */"} {"signature":"private fun IrConstructor . countContextTypeParameters ( ) : Int","body":"{ fun countImpl ( container : IrDeclarationParent ) : Int { return when ( container ) { is IrClass -> container . typeParameters . size + container . run { if ( isInner ) countImpl ( container . parent ) else } is IrFunction -> container . typeParameters . size + countImpl ( container . parent ) is IrProperty -> ( container . run { getter ? : setter } ? . typeParameters ? . size ? : ) + countImpl ( container . parent ) is IrDeclaration -> countImpl ( container . parent ) else -> } } return countImpl ( parent ) }","docstring":"/**\n inner class IN {\n private fun foo() {\n class CC(t: T, tt: TT, ttt: IT)\n }\n }\n */"} {"signature":"fun applyProperty ( receiver : StackValue , resolvedCall : ResolvedCall < * > , c : Context ) : StackValue ?","body":"= null","docstring":"/**\n * Used for generating custom byte code for the property value obtain. This function has lazy semantics.\n * Returns new stack value.\n */"} {"signature":"fun applyFunction ( receiver : StackValue , resolvedCall : ResolvedCall < * > , c : Context ) : StackValue ?","body":"= null","docstring":"/**\n * Used for generating custom byte code for the function call. This function has lazy semantics.\n * Returns new stack value.\n */"} {"signature":"inline fun < reified T > List < T > . toDS ( ) : Dataset < T >","body":"= toDS ( spark )","docstring":"/** Utility method to create dataset from list. */"} {"signature":"inline fun < reified T > List < T > . toDF ( vararg colNames : String ) : Dataset < Row >","body":"= toDF ( spark , * colNames )","docstring":"/** Utility method to create dataframe from list. */"} {"signature":"inline fun < reified T > Array < T > . toDS ( ) : Dataset < T >","body":"= toDS ( spark )","docstring":"/** Utility method to create dataset from [Array]. */"} {"signature":"inline fun < reified T > Array < T > . toDF ( vararg colNames : String ) : Dataset < Row >","body":"= toDF ( spark , * colNames )","docstring":"/** Utility method to create dataframe from [Array]. */"} {"signature":"inline fun < reified T > dsOf ( vararg arg : T ) : Dataset < T >","body":"= spark . dsOf ( * arg )","docstring":"/** Utility method to create dataset from vararg arguments. */"} {"signature":"inline fun < reified T > emptyDataset ( ) : Dataset < T >","body":"= spark . emptyDataset ( encoder < T > ( ) )","docstring":"/** Creates new empty dataset of type [T]. */"} {"signature":"inline fun < reified T > dfOf ( vararg arg : T ) : Dataset < Row >","body":"= spark . dfOf ( * arg )","docstring":"/** Utility method to create dataframe from *array or vararg arguments */"} {"signature":"inline fun < reified T > dfOf ( colNames : Array < String > , vararg arg : T ) : Dataset < Row >","body":"= spark . dfOf ( colNames , * arg )","docstring":"/**Utility method to create dataframe from *array or vararg arguments with given column names */"} {"signature":"inline fun < reified T > RDD < T > . toDS ( ) : Dataset < T >","body":"= toDS ( spark )","docstring":"/** Utility method to create dataset from Scala [RDD]. */"} {"signature":"inline fun < reified T > JavaRDDLike < T , * > . toDS ( ) : Dataset < T >","body":"= toDS ( spark )","docstring":"/** Utility method to create dataset from [JavaRDDLike]. */"} {"signature":"inline fun < reified T > RDD < T > . toDF ( vararg colNames : String ) : Dataset < Row >","body":"= toDF ( spark , * colNames )","docstring":"/**\n * Utility method to create Dataset (Dataframe) from RDD.\n * NOTE: [T] must be [Serializable].\n */"} {"signature":"inline fun < reified T > JavaRDDLike < T , * > . toDF ( vararg colNames : String ) : Dataset < Row >","body":"= toDF ( spark , * colNames )","docstring":"/**\n * Utility method to create Dataset (Dataframe) from JavaRDD.\n * NOTE: [T] must be [Serializable].\n */"} {"signature":"fun < T > List < T > . toRDD ( numSlices : Int = sc . defaultParallelism ( ) ) : JavaRDD < T >","body":"= sc . toRDD ( this , numSlices )","docstring":"/**\n * Utility method to create an RDD from a list.\n * NOTE: [T] must be [Serializable].\n */"} {"signature":"fun < T > rddOf ( vararg elements : T , numSlices : Int = sc . defaultParallelism ( ) ) : JavaRDD < T >","body":"= sc . toRDD ( elements . toList ( ) , numSlices )","docstring":"/**\n * Utility method to create an RDD from a list.\n * NOTE: [T] must be [Serializable].\n */"} {"signature":"fun setRunAfterStart ( block : KSparkStreamingSession . ( ) -> Unit )","body":"{ runAfterStart = block }","docstring":"/** [block] will be run after the streaming session has started from a new context (so not when loading from a checkpoint)\n * and before it's terminated. */"} {"signature":"fun getSpark ( sc : SparkConf ) : SparkSession","body":"= SparkSession . builder ( ) . config ( sc ) . getOrCreate ( )","docstring":"/** Creates new spark session from given [sc]. */"} {"signature":"fun getSpark ( rddForConf : JavaRDDLike < * , * > ) : SparkSession","body":"= getSpark ( rddForConf . context ( ) . conf )","docstring":"/** Creates new spark session from context of given JavaRDD, [rddForConf]. */"} {"signature":"fun getSpark ( sscForConf : JavaStreamingContext ) : SparkSession","body":"= getSpark ( sscForConf . sparkContext ( ) . conf )","docstring":"/** Creates new spark session from context of given JavaStreamingContext, [sscForConf] */"} {"signature":"fun < T > withSpark ( sc : SparkConf , func : KSparkSession . ( ) -> T ) : T","body":"= KSparkSession ( getSpark ( sc ) ) . func ( )","docstring":"/**\n * Helper function to enter Spark scope from [sc] like\n * ```kotlin\n * withSpark(sc) { // this: KSparkSession\n *\n * }\n * ```\n */"} {"signature":"fun < T > withSpark ( rddForConf : JavaRDDLike < * , * > , func : KSparkSession . ( ) -> T ) : T","body":"= KSparkSession ( getSpark ( rddForConf ) ) . func ( )","docstring":"/**\n * Helper function to enter Spark scope from a provided like\n * when using the `foreachRDD` function.\n * ```kotlin\n * withSpark(rdd) { // this: KSparkSession\n *\n * }\n * ```\n */"} {"signature":"fun < T > withSpark ( sscForConf : JavaStreamingContext , func : KSparkSession . ( ) -> T ) : T","body":"= KSparkSession ( getSpark ( sscForConf ) ) . func ( )","docstring":"/**\n * Helper function to enter Spark scope from [sscForConf] like\n * ```kotlin\n * withSpark(ssc) { // this: KSparkSession\n *\n * }\n * ```\n */"} {"signature":"fun SparkContext . setLogLevel ( level : SparkLogLevel ) : Unit","body":"= setLogLevel ( level . name )","docstring":"/**\n * Control our logLevel. This overrides any user-defined log settings.\n * @param level The desired log level as [SparkLogLevel].\n */"} {"signature":"@ JvmOverloads inline fun withSpark ( props : Map < String , Any > = emptyMap ( ) , master : String = SparkConf ( ) . get ( \"\" , \"\" ) , appName : String = \"\" , logLevel : SparkLogLevel = ERROR , func : KSparkSession . ( ) -> Unit , )","body":"{ val builder = SparkSession . builder ( ) . master ( master ) . appName ( appName ) . apply { props . forEach { when ( val value = it . value ) { is String -> config ( it . key , value ) is Boolean -> config ( it . key , value ) is Long -> config ( it . key , value ) is Double -> config ( it . key , value ) else -> throw IllegalArgumentException ( \"\" ) } } } withSpark ( builder , logLevel , func ) }","docstring":"/**\n * Wrapper for spark creation which allows setting different spark params.\n *\n * @param props spark options, value types are runtime-checked for type-correctness\n * @param master Sets the Spark master URL to connect to, such as \"local\" to run locally, \"local[4]\" to\n * run locally with 4 cores, or \"spark://master:7077\" to run on a Spark standalone cluster. By default, it\n * tries to get the system value \"spark.master\", otherwise it uses \"local[*]\"\n * @param appName Sets a name for the application, which will be shown in the Spark web UI.\n * If no application name is set, a randomly generated name will be used.\n * @param logLevel Control our logLevel. This overrides any user-defined log settings.\n * @param func function which will be executed in context of [KSparkSession] (it means that `this` inside block will point to [KSparkSession])\n */"} {"signature":"@ JvmOverloads inline fun withSpark ( builder : Builder , logLevel : SparkLogLevel = ERROR , func : KSparkSession . ( ) -> Unit )","body":"{ builder . getOrCreate ( ) . apply { KSparkSession ( this ) . apply { sparkContext . setLogLevel ( logLevel ) func ( ) spark . stop ( ) } } }","docstring":"/**\n * Wrapper for spark creation which allows setting different spark params.\n *\n * @param builder A [SparkSession.Builder] object, configured how you want.\n * @param logLevel Control our logLevel. This overrides any user-defined log settings.\n * @param func function which will be executed in context of [KSparkSession] (it means that `this` inside block will point to [KSparkSession])\n */"} {"signature":"@ JvmOverloads inline fun withSpark ( sparkConf : SparkConf , logLevel : SparkLogLevel = ERROR , func : KSparkSession . ( ) -> Unit )","body":"{ withSpark ( builder = SparkSession . builder ( ) . config ( sparkConf ) , logLevel = logLevel , func = func , ) }","docstring":"/**\n * Wrapper for spark creation which copies params from [sparkConf].\n *\n * @param sparkConf Sets a list of config options based on this.\n * @param logLevel Control our logLevel. This overrides any user-defined log settings.\n * @param func function which will be executed in context of [KSparkSession] (it means that `this` inside block will point to [KSparkSession])\n */"} {"signature":"@ JvmOverloads fun withSparkStreaming ( batchDuration : Duration = Durations . seconds ( ) , checkpointPath : String ? = null , hadoopConf : Configuration = SparkHadoopUtil . get ( ) . conf ( ) , createOnError : Boolean = false , props : Map < String , Any > = emptyMap ( ) , master : String = SparkConf ( ) . get ( \"\" , \"\" ) , appName : String = \"\" , timeout : Long = - , startStreamingContext : Boolean = true , func : KSparkStreamingSession . ( ) -> Unit , )","body":"{ var kSparkStreamingSession : KSparkStreamingSession ? = null val creatingFunc = { val sc = SparkConf ( ) . setAppName ( appName ) . setMaster ( master ) . setAll ( props . map { ( key , value ) -> key X value . toString ( ) } . asScalaIterable ( ) ) val ssc = JavaStreamingContext ( sc , batchDuration ) ssc . checkpoint ( checkpointPath ) kSparkStreamingSession = KSparkStreamingSession ( ssc ) func ( kSparkStreamingSession ! ! ) ssc } val ssc = when { checkpointPath != null -> JavaStreamingContext . getOrCreate ( checkpointPath , creatingFunc , hadoopConf , createOnError ) else -> creatingFunc ( ) } if ( startStreamingContext ) { ssc . start ( ) kSparkStreamingSession ? . invokeRunAfterStart ( ) } ssc . awaitTerminationOrTimeout ( timeout ) ssc . stop ( ) }","docstring":"/**\n * Wrapper for spark streaming creation. `spark: SparkSession` and `ssc: JavaStreamingContext` are provided, started,\n * awaited, and stopped automatically.\n * The use of a checkpoint directory is optional.\n * If checkpoint data exists in the provided `checkpointPath`, then StreamingContext will be\n * recreated from the checkpoint data. If the data does not exist, then the provided factory\n * will be used to create a JavaStreamingContext.\n *\n * @param batchDuration The time interval at which streaming data will be divided into batches. Defaults to 1\n * second.\n * @param checkpointPath If checkpoint data exists in the provided `checkpointPath`, then StreamingContext will be\n * recreated from the checkpoint data. If the data does not exist (or `null` is provided),\n * then the streaming context will be built using the other provided parameters.\n * @param hadoopConf Only used if [checkpointPath] is given. Hadoop configuration if necessary for reading from\n * any HDFS compatible file system.\n * @param createOnError Only used if [checkpointPath] is given. Whether to create a new JavaStreamingContext if\n * there is an error in reading checkpoint data.\n * @param props Spark options, value types are runtime-checked for type-correctness.\n * @param master Sets the Spark master URL to connect to, such as \"local\" to run locally, \"local[4]\" to\n * run locally with 4 cores, or \"spark://master:7077\" to run on a Spark standalone cluster.\n * By default, it tries to get the system value \"spark.master\", otherwise it uses \"local[*]\".\n * @param appName Sets a name for the application, which will be shown in the Spark web UI.\n * If no application name is set, a randomly generated name will be used.\n * @param timeout The time in milliseconds to wait for the stream to terminate without input. -1 by default,\n * this means no timeout.\n * @param startStreamingContext Defaults to `true`. If set to `false`, then the streaming context will not be started.\n * @param func Function which will be executed in context of [KSparkStreamingSession] (it means that\n * `this` inside block will point to [KSparkStreamingSession])\n */"} {"signature":"inline fun < reified T > SparkSession . broadcast ( value : T ) : Broadcast < T >","body":"= try { sparkContext . broadcast ( value , encoder < T > ( ) . clsTag ( ) ) } catch ( e : ClassNotFoundException ) { JavaSparkContext ( sparkContext ) . broadcast ( value ) }","docstring":"/**\n * Broadcast a read-only variable to the cluster, returning a\n * [org.apache.spark.broadcast.Broadcast] object for reading it in distributed functions.\n * The variable will be sent to each cluster only once.\n *\n * @param value value to broadcast to the Spark nodes\n * @return `Broadcast` object, a read-only variable cached on each machine\n */"} {"signature":"@ Deprecated ( \"\" , ReplaceWith ( \"\" ) , DeprecationLevel . WARNING ) inline fun < reified T > SparkContext . broadcast ( value : T ) : Broadcast < T >","body":"= try { broadcast ( value , encoder < T > ( ) . clsTag ( ) ) } catch ( e : ClassNotFoundException ) { JavaSparkContext ( this ) . broadcast ( value ) }","docstring":"/**\n * Broadcast a read-only variable to the cluster, returning a\n * [org.apache.spark.broadcast.Broadcast] object for reading it in distributed functions.\n * The variable will be sent to each cluster only once.\n *\n * @param value value to broadcast to the Spark nodes\n * @return `Broadcast` object, a read-only variable cached on each machine\n * @see broadcast\n */"} {"signature":"operator fun < T > Product1 < T > . component1 ( ) : T","body":"= this . _1 ( )","docstring":"/**\n *\n * This file provides the operator functions to destructuring for Scala classes implementing ProductX, like Tuples.\n *\n * This means you can type `val (a, b, c, d) = yourTuple` to unpack its values,\n * similar to how [Pair], [Triple] and other data classes work in Kotlin.\n *\n */"} {"signature":"@ PublishedApi internal inline fun < R > processAllDirectives ( ignoreDirectives : List < ValueDirective < TargetBackend > > , processDirective : ( ValueDirective < TargetBackend > , SuppressionResult ) -> R , ) : R ?","body":"{ val modules = testServices . moduleStructure . modules for ( ignoreDirective in ignoreDirectives ) { val suppressionResult = modules . map { failuresInModuleAreIgnored ( it , ignoreDirective ) } . firstOrNull { it . testMuted } ? : continue return processDirective ( ignoreDirective , suppressionResult ) } return null }","docstring":"/**\n * Finds the first directive from [ignoreDirectives] that mutes this test on the current backend, and\n * runs [processDirective] for that directive.\n *\n * Returns whatever [processDirective] returns, or `null` if this test will not be muted.\n */"} {"signature":"@ PublishedApi internal fun processMutedTest ( failed : Boolean , directive : ValueDirective < TargetBackend > , suppressionResult : SuppressionResult , ) : AssertionError ?","body":"{ if ( failed ) return null val firstModule = testServices . moduleStructure . modules . first ( ) val targetBackend = testServices . defaultsProvider . defaultTargetBackend ? : firstModule . targetBackend val message = buildString { append ( \"\" ) targetBackend ? . name ? . let { append ( it ) append ( \"\" ) } append ( directive . name ) append ( \"\" ) append ( firstModule . frontendKind ) assert ( suppressionResult . testMuted ) suppressionResult . matchedBackend ? . let { append ( \"\" ) append ( it ) } } return AssertionError ( message ) }","docstring":"/**\n * Returns `null` if [failed] is `true`, otherwise returns an [AssertionError] with a message reminding to remove [directive]\n * from the test to unmute it.\n */"} {"signature":"inline fun < reified ExpectedError : Throwable > checkMuted ( ignoreDirectives : List < ValueDirective < TargetBackend > > , block : ( ) -> Unit , )","body":"{ val expectedError : ExpectedError ? = try { block ( ) null } catch ( e : Throwable ) { e as? ExpectedError ? : throw e } processAllDirectives < Unit > ( ignoreDirectives ) { ignoreDirective , suppressionResult -> processMutedTest ( failed = expectedError != null , ignoreDirective , suppressionResult ) ? . let { throw it } return } expectedError ? . let { throw it } }","docstring":"/**\n * Runs [block]. If this test has been muted by one of [ignoreDirectives] **and** [block] returns without throwing an exception,\n * throws an [AssertionError] reminding you to unmute the test.\n *\n * If this test has been muted by one of [ignoreDirectives] **and** [block] throws an exception of type [ExpectedError],\n * catches that exception and returns normally.\n *\n * If [block] throws an exception of some other type, rethrows it.\n *\n * If this test hasn't been muted **and** [block] throws any exception, rethrows that exception as well.\n */"} {"signature":"private fun ContentPage . findConstructorsWithBriefs ( ) : List < ContentNode >","body":"{ val constructorsTable = this . content . dfs { it is ContentTable && it . dci . kind == ContentKind . Constructors } as ContentTable val constructorsWithBriefs = constructorsTable . dfs { it is ContentGroup && it . dci . kind == ContentKind . SourceSetDependentHint } ? . children assertNotNull ( constructorsWithBriefs , \"\" ) return constructorsWithBriefs }","docstring":"/**\n * All constructors are merged in one block (like overloaded functions).\n * That leads to the structure where content block (`constructorsWithBriefs`) consist of plain list\n * of constructors and briefs. In that list constructor is above, brief is below.\n */"} {"signature":"fun isSubtypeOfClass ( state : TypeCheckerState , typeConstructor : TypeConstructorMarker , superConstructor : TypeConstructorMarker ) : Boolean","body":"{ if ( typeConstructor == superConstructor ) return true with ( state . typeSystemContext ) { for ( superType in typeConstructor . supertypes ( ) ) { if ( isSubtypeOfClass ( state , superType . typeConstructor ( ) , superConstructor ) ) { return true } } } return false }","docstring":"/**\n * It matches class types but ignores their type parameters\n *\n * Consider the following example:\n *\n * ```\n * abstract class Foo\n * class FooBar : Foo()\n * ```\n *\n * In this case `isSubtypeOfClass` returns `true` for `FooBar` and `Foo` input arguments\n * But `isSubtypeOf` returns `false` for the same input arguments\n */"} {"signature":"private fun selectOnlyPureKotlinSupertypes ( state : TypeCheckerState , supertypes : List < SimpleTypeMarker > ) : List < SimpleTypeMarker >","body":"= with ( state . typeSystemContext ) { if ( supertypes . size < ) return supertypes val allPureSupertypes = supertypes . filter { it . asArgumentList ( ) . all ( this ) { it . getType ( ) . asFlexibleType ( ) == null } } return if ( allPureSupertypes . isNotEmpty ( ) ) allPureSupertypes else supertypes }","docstring":"/**\n * If we have several paths to some interface, we should prefer pure kotlin path.\n * Example:\n *\n * class MyList : AbstractList(), MutableList\n *\n * We should see `String` in `get` function and others, also MyList is not subtype of MutableList\n *\n * More tests: javaAndKotlinSuperType & purelyImplementedCollection folder\n */"} {"signature":"fun usage ( )","body":"{ }","docstring":"/**\n * [I.length] is unresolved\n * [String.length] is resolved\n */"} {"signature":"private fun makeMutable ( buffer : Array < Any ? > ? ) : Array < Any ? >","body":"{ if ( buffer == null ) { return mutableBuffer ( ) } if ( isMutable ( buffer ) ) { return buffer } return buffer . copyInto ( mutableBuffer ( ) , endIndex = buffer . size . coerceAtMost ( MAX_BUFFER_SIZE ) ) }","docstring":"/**\n * Checks if [buffer] is mutable and returns it or its mutable copy.\n */"} {"signature":"private fun pushFilledTail ( root : Array < Any ? > ? , filledTail : Array < Any ? > , newTail : Array < Any ? > )","body":"= when { size shr LOG_MAX_BUFFER_SIZE > shl rootShift -> { this . root = pushTail ( mutableBufferWith ( root ) , filledTail , rootShift + LOG_MAX_BUFFER_SIZE ) this . tail = newTail this . rootShift += LOG_MAX_BUFFER_SIZE this . size += } root == null -> { this . root = filledTail this . tail = newTail this . size += } else -> { this . root = pushTail ( root , filledTail , rootShift ) this . tail = newTail this . size += } }","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 ? > ? , tail : Array < Any ? > , shift : Int ) : Array < Any ? >","body":"{ val index = indexSegment ( size - , shift ) val mutableRoot = makeMutable ( root ) if ( shift == LOG_MAX_BUFFER_SIZE ) { mutableRoot [ index ] = tail } else { @ Suppress ( \"\" ) mutableRoot [ index ] = pushTail ( mutableRoot [ index ] as Array < Any ? > ? , tail , shift - LOG_MAX_BUFFER_SIZE ) } return mutableRoot }","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 pushBuffersIncreasingHeightIfNeeded ( root : Array < Any ? > ? , rootSize : Int , buffers : Array < Array < Any ? > > ) : Array < Any ? >","body":"{ val buffersIterator = buffers . iterator ( ) var mutableRoot = when { rootSize shr LOG_MAX_BUFFER_SIZE < shl rootShift -> pushBuffers ( root , rootSize , rootShift , buffersIterator ) else -> makeMutable ( root ) } while ( buffersIterator . hasNext ( ) ) { rootShift += LOG_MAX_BUFFER_SIZE mutableRoot = mutableBufferWith ( mutableRoot ) pushBuffers ( mutableRoot , shl rootShift , rootShift , buffersIterator ) } return mutableRoot }","docstring":"/**\n * Adds all buffers from [buffers] as leaf nodes to the [root].\n * If the [root] has less available leaves for the buffers, height of the trie is increased.\n *\n * Returns root of the resulting trie.\n */"} {"signature":"private fun pushBuffers ( root : Array < Any ? > ? , rootSize : Int , shift : Int , buffersIterator : Iterator < Array < Any ? > > ) : Array < Any ? >","body":"{ check ( buffersIterator . hasNext ( ) ) check ( shift >= ) if ( shift == ) { return buffersIterator . next ( ) } val mutableRoot = makeMutable ( root ) var index = indexSegment ( rootSize , shift ) @ Suppress ( \"\" ) mutableRoot [ index ] = pushBuffers ( mutableRoot [ index ] as Array < Any ? > ? , rootSize , shift - LOG_MAX_BUFFER_SIZE , buffersIterator ) while ( ++ index < MAX_BUFFER_SIZE && buffersIterator . hasNext ( ) ) { @ Suppress ( \"\" ) mutableRoot [ index ] = pushBuffers ( mutableRoot [ index ] as Array < Any ? > ? , , shift - LOG_MAX_BUFFER_SIZE , buffersIterator ) } return mutableRoot }","docstring":"/**\n * Adds buffers from the [buffersIterator] as leaf nodes.\n * As the result [root] is entirely filled, or all buffers are added.\n *\n * Returns the resulting root.\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 == ) { elementCarry . value = root [ MAX_BUFFER_SIZE_MINUS_ONE ] val mutableRoot = root . copyInto ( makeMutable ( root ) , bufferIndex + , bufferIndex , MAX_BUFFER_SIZE_MINUS_ONE ) mutableRoot [ bufferIndex ] = element return mutableRoot } val mutableRoot = makeMutable ( root ) val lowerLevelShift = shift - LOG_MAX_BUFFER_SIZE @ Suppress ( \"\" ) mutableRoot [ bufferIndex ] = insertIntoRoot ( mutableRoot [ bufferIndex ] as Array < Any ? > , lowerLevelShift , index , element , elementCarry ) for ( i in bufferIndex + until MAX_BUFFER_SIZE ) { if ( mutableRoot [ i ] == null ) break @ Suppress ( \"\" ) mutableRoot [ i ] = insertIntoRoot ( mutableRoot [ i ] as Array < Any ? > , lowerLevelShift , , elementCarry . value , elementCarry ) } return mutableRoot }","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 or this modified trie, if it's already mutable\n */"} {"signature":"private fun insertIntoRoot ( elements : Collection < E > , index : Int , rightShift : Int , buffers : Array < Array < Any ? > ? > , nullBuffers : Int , nextBuffer : Array < Any ? > )","body":"{ checkNotNull ( root ) val startLeafIndex = index shr LOG_MAX_BUFFER_SIZE val startLeaf = shiftLeafBuffers ( startLeafIndex , rightShift , buffers , nullBuffers , nextBuffer ) val lastLeafIndex = ( rootSize ( ) shr LOG_MAX_BUFFER_SIZE ) - val newNullBuffers = nullBuffers - ( lastLeafIndex - startLeafIndex ) val newNextBuffer = if ( newNullBuffers < nullBuffers ) buffers [ newNullBuffers ] ! ! else nextBuffer splitToBuffers ( elements , index , startLeaf , MAX_BUFFER_SIZE , buffers , newNullBuffers , newNextBuffer ) }","docstring":"/**\n * Inserts the [elements] into the [root] at the given [index].\n *\n * Affected elements are copied to the [buffers] split into [nullBuffers] buffers.\n * Elements that do not fit [nullBuffers] buffers are copied to the [nextBuffer].\n */"} {"signature":"private fun shiftLeafBuffers ( startLeafIndex : Int , rightShift : Int , buffers : Array < Array < Any ? > ? > , nullBuffers : Int , nextBuffer : Array < Any ? > ) : Array < Any ? >","body":"{ checkNotNull ( root ) val leafCount = rootSize ( ) shr LOG_MAX_BUFFER_SIZE val leafBufferIterator = leafBufferIterator ( leafCount ) var bufferIndex = nullBuffers var buffer = nextBuffer while ( leafBufferIterator . previousIndex ( ) != startLeafIndex ) { val currentBuffer = leafBufferIterator . previous ( ) currentBuffer . copyInto ( buffer , , MAX_BUFFER_SIZE - rightShift , MAX_BUFFER_SIZE ) buffer = makeMutableShiftingRight ( currentBuffer , rightShift ) buffers [ -- bufferIndex ] = buffer } return leafBufferIterator . previous ( ) }","docstring":"/**\n * Shifts elements in the [root] to the right by the given [rightShift] position starting from the end.\n *\n * Shifting stops when elements of the leaf at [startLeafIndex] are reached.\n * Last elements whose indexes become bigger than [rootSize] are copied to the [nextBuffer].\n * Shifted leaves are stored in the [buffers] starting from the given [nullBuffers] index.\n *\n * Returns leaf at the [startLeafIndex].\n */"} {"signature":"private fun splitToBuffers ( elements : Collection < E > , index : Int , startBuffer : Array < Any ? > , startBufferSize : Int , buffers : Array < Array < Any ? > ? > , nullBuffers : Int , nextBuffer : Array < Any ? > )","body":"{ check ( nullBuffers >= ) val firstBuffer = makeMutable ( startBuffer ) buffers [ ] = firstBuffer var newNextBuffer = nextBuffer var newNullBuffers = nullBuffers val startBufferStartIndex = index and MAX_BUFFER_SIZE_MINUS_ONE val endBufferEndIndex = ( index + elements . size - ) and MAX_BUFFER_SIZE_MINUS_ONE val elementsToShift = startBufferSize - startBufferStartIndex if ( endBufferEndIndex + elementsToShift < MAX_BUFFER_SIZE ) { firstBuffer . copyInto ( newNextBuffer , endBufferEndIndex + , startBufferStartIndex , startBufferSize ) } else { val toCopyToLast = endBufferEndIndex + elementsToShift - MAX_BUFFER_SIZE + if ( nullBuffers == ) { newNextBuffer = firstBuffer } else { newNextBuffer = mutableBuffer ( ) buffers [ -- newNullBuffers ] = newNextBuffer } firstBuffer . copyInto ( nextBuffer , , startBufferSize - toCopyToLast , startBufferSize ) firstBuffer . copyInto ( newNextBuffer , endBufferEndIndex + , startBufferStartIndex , startBufferSize - toCopyToLast ) } val elementsIterator = elements . iterator ( ) copyToBuffer ( firstBuffer , startBufferStartIndex , elementsIterator ) for ( i in until newNullBuffers ) { buffers [ i ] = copyToBuffer ( mutableBuffer ( ) , , elementsIterator ) } copyToBuffer ( newNextBuffer , , elementsIterator ) }","docstring":"/**\n * Inserts [elements] into [startBuffer] of size [startBufferSize] and splits the result into [nullBuffers] buffers.\n *\n * Elements that do not fit [nullBuffers] buffers are copied to the [nextBuffer].\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 removedElement = root [ bufferIndex ] val mutableRoot = root . copyInto ( makeMutable ( root ) , bufferIndex , bufferIndex + , MAX_BUFFER_SIZE ) mutableRoot [ MAX_BUFFER_SIZE - ] = tailCarry . value tailCarry . value = removedElement return mutableRoot } var bufferLastIndex = MAX_BUFFER_SIZE_MINUS_ONE if ( root [ bufferLastIndex ] == null ) { bufferLastIndex = indexSegment ( rootSize ( ) - , shift ) } val mutableRoot = makeMutable ( root ) val lowerLevelShift = shift - LOG_MAX_BUFFER_SIZE for ( i in bufferLastIndex downTo bufferIndex + ) { @ Suppress ( \"\" ) mutableRoot [ i ] = removeFromRootAt ( mutableRoot [ i ] as Array < Any ? > , lowerLevelShift , , tailCarry ) } @ Suppress ( \"\" ) mutableRoot [ bufferIndex ] = removeFromRootAt ( mutableRoot [ bufferIndex ] as Array < Any ? > , lowerLevelShift , index , tailCarry ) return mutableRoot }","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 pullLastBufferFromRoot ( root : Array < Any ? > ? , rootSize : Int , shift : Int )","body":"{ if ( shift == ) { this . root = null this . tail = root ? : emptyArray ( ) this . size = rootSize this . rootShift = shift return } val tailCarry = ObjectRef ( null ) val newRoot = pullLastBuffer ( root ! ! , shift , rootSize , tailCarry ) ! ! @ Suppress ( \"\" ) this . tail = tailCarry . value as Array < Any ? > this . size = rootSize if ( newRoot [ ] == null ) { @ Suppress ( \"\" ) this . root = newRoot [ ] as Array < Any ? > ? this . rootShift = shift - LOG_MAX_BUFFER_SIZE } else { this . root = newRoot this . rootShift = shift } }","docstring":"/**\n * Extracts the last entirely filled leaf buffer from the trie of this vector and makes it a tail in this\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 */"} {"signature":"private fun pullLastBuffer ( root : Array < Any ? > , shift : Int , rootSize : Int , tailCarry : ObjectRef ) : Array < Any ? > ?","body":"{ val bufferIndex = indexSegment ( rootSize - , 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 , rootSize , tailCarry ) } if ( newBufferAtIndex == null && bufferIndex == ) { return null } val mutableRoot = makeMutable ( root ) mutableRoot [ bufferIndex ] = newBufferAtIndex return mutableRoot }","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 retainFirst ( root : Array < Any ? > , size : Int ) : Array < Any ? > ?","body":"{ check ( size and MAX_BUFFER_SIZE_MINUS_ONE == ) if ( size == ) { rootShift = return null } val lastIndex = size - var newRoot = root while ( lastIndex shr rootShift == ) { rootShift -= LOG_MAX_BUFFER_SIZE @ Suppress ( \"\" ) newRoot = newRoot [ ] as Array < Any ? > } return nullifyAfter ( newRoot , lastIndex , rootShift ) }","docstring":"/**\n * Retains first [size] elements of the [root].\n *\n * If the height of the root is bigger than needed to store [size] elements, it's decreased.\n */"} {"signature":"private fun nullifyAfter ( root : Array < Any ? > , index : Int , shift : Int ) : Array < Any ? >","body":"{ check ( shift >= ) if ( shift == ) { return root } val lastIndex = indexSegment ( index , shift ) @ Suppress ( \"\" ) val newChild = nullifyAfter ( root [ lastIndex ] as Array < Any ? > , index , shift - LOG_MAX_BUFFER_SIZE ) var newRoot = root if ( lastIndex < MAX_BUFFER_SIZE_MINUS_ONE && newRoot [ lastIndex + ] != null ) { if ( isMutable ( newRoot ) ) { newRoot . fill ( null , lastIndex + , MAX_BUFFER_SIZE ) } newRoot = newRoot . copyInto ( mutableBuffer ( ) , , , lastIndex + ) } if ( newChild !== newRoot [ lastIndex ] ) { newRoot = makeMutable ( newRoot ) newRoot [ lastIndex ] = newChild } return newRoot }","docstring":"/**\n * Nullifies nodes cells after the specified [index].\n *\n * Used to prevent memory leaks after reusing nodes.\n */"} {"signature":"private fun removeAllFromTail ( predicate : ( E ) -> Boolean , tailSize : Int , bufferRef : ObjectRef ) : Int","body":"{ val newTailSize = removeAll ( predicate , tail , tailSize , bufferRef ) if ( newTailSize == tailSize ) { assert ( bufferRef . value === tail ) return tailSize } @ Suppress ( \"\" ) val newTail = bufferRef . value as Array < Any ? > newTail . fill ( null , newTailSize , tailSize ) tail = newTail size -= tailSize - newTailSize return newTailSize }","docstring":"/**\n * Copies elements of the [tail] buffer of size [tailSize] that do not match the given [predicate] to a new buffer.\n *\n * If the [tail] is mutable, it is reused to store non-matching elements.\n * If non of the elements match the [predicate], no buffers are created and elements are not copied.\n * [bufferRef] stores the newly created buffer, or the [tail] if a new buffer was not created.\n *\n * Returns the filled size of the buffer stored in the [bufferRef].\n */"} {"signature":"private fun removeAll ( predicate : ( E ) -> Boolean , buffer : Array < Any ? > , bufferSize : Int , bufferRef : ObjectRef ) : Int","body":"{ var newBuffer = buffer var newBufferSize = bufferSize var anyRemoved = false for ( index in until bufferSize ) { @ Suppress ( \"\" ) val element = buffer [ index ] as E if ( predicate ( element ) ) { if ( ! anyRemoved ) { newBuffer = makeMutable ( buffer ) newBufferSize = index anyRemoved = true } } else if ( anyRemoved ) { newBuffer [ newBufferSize ++ ] = element } } bufferRef . value = newBuffer return newBufferSize }","docstring":"/**\n * Copies elements of the given [buffer] of size [bufferSize] that do not match the given [predicate] to a new buffer.\n *\n * If the [buffer] is mutable, it is reused to store non-matching elements.\n * If non of the elements match the [predicate], no buffers are created and elements are not copied.\n * [bufferRef] stores the newly created buffer, or the [buffer] if a new buffer was not created.\n *\n * Returns the filled size of the buffer stored in the [bufferRef].\n */"} {"signature":"private fun recyclableRemoveAll ( predicate : ( E ) -> Boolean , buffer : Array < Any ? > , bufferSize : Int , toBufferSize : Int , bufferRef : ObjectRef , recyclableBuffers : MutableList < Array < Any ? > > , buffers : MutableList < Array < Any ? > > ) : Int","body":"{ if ( isMutable ( buffer ) ) { recyclableBuffers . add ( buffer ) } @ Suppress ( \"\" ) val toBuffer = bufferRef . value as Array < Any ? > var newToBuffer = toBuffer var newToBufferSize = toBufferSize for ( index in until bufferSize ) { @ Suppress ( \"\" ) val element = buffer [ index ] as E if ( ! predicate ( element ) ) { if ( newToBufferSize == MAX_BUFFER_SIZE ) { newToBuffer = if ( recyclableBuffers . isNotEmpty ( ) ) { recyclableBuffers . removeAt ( recyclableBuffers . size - ) } else { mutableBuffer ( ) } newToBufferSize = } newToBuffer [ newToBufferSize ++ ] = element } } bufferRef . value = newToBuffer if ( toBuffer !== bufferRef . value ) { buffers . add ( toBuffer ) } return newToBufferSize }","docstring":"/**\n * Copied elements of the given [buffer] of size [bufferSize] that do not match the given [predicate]\n * to the buffer stored in the given [bufferRef] starting at [toBufferSize].\n *\n * If the buffer gets filled entirely, it is added to [buffers] and a new buffer is created or\n * reused from the [recyclableBuffers] to hold the rest of the non-matching elements.\n * [bufferRef] stores the newly created buffer if a new buffer was created.\n *\n * Returns the filled size of the buffer stored in the [bufferRef].\n */"} {"signature":"@ PublishedApi internal fun getProgressionLastElement ( start : Int , end : Int , step : Int ) : Int","body":"= when { step > -> if ( start >= end ) end else end - differenceModulo ( end , start , step ) step < -> if ( start <= end ) end else end + differenceModulo ( start , end , - step ) else -> throw kotlin . IllegalArgumentException ( \"\" ) }","docstring":"/**\n * Calculates the final element of a bounded arithmetic progression, i.e. the last element of the progression which is in the range\n * from [start] to [end] in case of a positive [step], or from [end] to [start] in case of a negative\n * [step].\n *\n * No validation on passed parameters is performed. The given parameters should satisfy the condition:\n *\n * - either `step > 0` and `start <= end`,\n * - or `step < 0` and `start >= end`.\n *\n * @param start first element of the progression\n * @param end ending bound for the progression\n * @param step increment, or difference of successive elements in the progression\n * @return the final element of the progression\n * @suppress\n */"} {"signature":"@ PublishedApi internal fun getProgressionLastElement ( start : Long , end : Long , step : Long ) : Long","body":"= when { step > -> if ( start >= end ) end else end - differenceModulo ( end , start , step ) step < -> if ( start <= end ) end else end + differenceModulo ( start , end , - step ) else -> throw kotlin . IllegalArgumentException ( \"\" ) }","docstring":"/**\n * Calculates the final element of a bounded arithmetic progression, i.e. the last element of the progression which is in the range\n * from [start] to [end] in case of a positive [step], or from [end] to [start] in case of a negative\n * [step].\n *\n * No validation on passed parameters is performed. The given parameters should satisfy the condition:\n *\n * - either `step > 0` and `start <= end`,\n * - or `step < 0` and `start >= end`.\n *\n * @param start first element of the progression\n * @param end ending bound for the progression\n * @param step increment, or difference of successive elements in the progression\n * @return the final element of the progression\n * @suppress\n */"} {"signature":"private fun mergeStdlibParts ( outputFile : File , wrapperFile : File , baseDir : File , inputPaths : List < File > )","body":"{ val program = JsProgram ( ) fun File . makeRelativeIfNecessary ( ) : String = canonicalFile . toRelativeString ( baseDir ) val wrapper = parse ( wrapperFile . readText ( ) , ThrowExceptionOnErrorReporter , program . scope , wrapperFile . makeRelativeIfNecessary ( ) ) ? : error ( \"\" ) val insertionPlace = wrapper . createInsertionPlace ( ) val allFiles = mutableListOf < File > ( ) inputPaths . forEach { collectFiles ( it , allFiles ) } for ( file in allFiles ) { val statements = parse ( file . readText ( ) , ThrowExceptionOnErrorReporter , program . scope , file . makeRelativeIfNecessary ( ) ) ? : error ( \"\" ) val block = JsBlock ( statements ) block . fixForwardNameReferences ( ) val sourceMapFile = File ( file . parent , file . name + \"\" ) if ( sourceMapFile . exists ( ) ) { when ( val sourceMapParse = SourceMapParser . parse ( sourceMapFile ) ) { is SourceMapError -> { System . err . println ( \"\" ) exitProcess ( ) } is SourceMapSuccess -> { val sourceMap = sourceMapParse . value val remapper = SourceMapLocationRemapper ( sourceMap ) remapper . remap ( block ) } } } insertionPlace . statements += statements } program . globalBlock . statements += wrapper val sourceMapFile = File ( outputFile . parentFile , outputFile . name + \"\" ) val textOutput = TextOutputImpl ( ) val sourceMapBuilder = SourceMap3Builder ( outputFile , textOutput :: getColumn , \"\" ) val consumer = SourceMapBuilderConsumer ( File ( \"\" ) , sourceMapBuilder , SourceFilePathResolver ( mutableListOf ( ) ) , provideCurrentModuleContent = true , provideExternalModuleContent = true ) program . globalBlock . accept ( JsToStringGenerationVisitor ( textOutput , consumer ) ) val sourceMapContent = sourceMapBuilder . build ( ) val programText = textOutput . toString ( ) outputFile . writeText ( programText + \"\" ) val sourceMapJson = parseJson ( sourceMapContent ) val sources = ( sourceMapJson as JsonObject ) . properties [ \"\" ] as JsonArray sourceMapJson . properties [ \"\" ] = JsonArray ( * sources . elements . map { sourcePath -> val sourceFile = File ( ( sourcePath as JsonString ) . value ) if ( sourceFile . exists ( ) ) { JsonString ( sourceFile . readText ( ) ) } else { JsonNull } } . toTypedArray ( ) ) sourceMapFile . writeText ( sourceMapJson . toString ( ) ) }","docstring":"/**\n * Combines several JS input files, that comprise Kotlin JS Standard Library,\n * into a single JS module.\n * The source maps of these files are combined into a single source map.\n */"} {"signature":"public abstract fun build ( tf : Ops , input : Operand < Float > , isTraining : Operand < Boolean > , numberOfLosses : Operand < Float > ? ) : Operand < Float >","body":"public abstract fun build ( tf : Ops , input : Operand < Float > , isTraining : Operand < Boolean > , numberOfLosses : Operand < Float > ? ) : Operand < Float >","docstring":"/**\n * Extend this function to define variables in the layer and compute layer output.\n *\n * @param [tf] TensorFlow graph API for building operations.\n * @param [input] Layer input.\n * @param [isTraining] TensorFlow operand for switching between training and inference modes.\n * @param [numberOfLosses] TensorFlow operand for batch size data.\n */"} {"signature":"public open fun build ( tf : Ops , input : List < Operand < Float > > , isTraining : Operand < Boolean > , numberOfLosses : Operand < Float > ? ) : Operand < Float >","body":"{ return build ( tf , input . first ( ) , isTraining , numberOfLosses ) }","docstring":"/**\n * Extend this function to define variables in the layer and compute layer output.\n *\n * NOTE: This function should be overridden for layers with multiple inputs.\n * NOTE: Used in Functional API\n *\n * @param [input] Layer input list.\n * @param [isTraining] TensorFlow operand for switching between training and inference modes.\n * @param [numberOfLosses] TensorFlow operand for batch size data.\n */"} {"signature":"public operator fun invoke ( vararg layers : Layer ) : Layer","body":"{ inboundLayers = layers . toMutableList ( ) return this }","docstring":"/** Important part of functional API. It takes [layers] as input and saves them to the [inboundLayers] of the given layer. */"} {"signature":"internal suspend fun KotlinSourceSetTree . Companion . orNull ( compilation : KotlinCompilation < * > )","body":"= compilation . sourceSetTreeClassifier . classify ( compilation )","docstring":"/**\n * Returns the [KotlinSourceSetTree] of a given [KotlinCompilation]:\n * Uses the [sourceSetTreeClassifier] under the hood.\n * See [KotlinSourceSetTreeClassifier]\n */"} {"signature":"fun handleElementRename ( ktReference : KtReference , newElementName : String ) : PsiElement ?","body":"fun handleElementRename ( ktReference : KtReference , newElementName : String ) : PsiElement ?","docstring":"/**\n * See [com.intellij.psi.PsiReference.handleElementRename].\n */"} {"signature":"fun bindToElement ( ktReference : KtReference , element : PsiElement ) : PsiElement","body":"fun bindToElement ( ktReference : KtReference , element : PsiElement ) : PsiElement","docstring":"/**\n * See [com.intellij.psi.PsiReference.bindToElement].\n */"} {"signature":"public fun < T > yMin ( column : ColumnReference < T > ) : PositionalMapping < T >","body":"{ return addPositionalMapping < T > ( Y_MIN , column . name ( ) , null ) }","docstring":"/**\n * Maps the `yMin` aesthetic to a data column specified by a [ColumnReference].\n *\n * @param column the data column to be mapped.\n * @return a [PositionalMapping] object representing the mapping.\n */"} {"signature":"public fun < T > yMin ( column : KProperty < T > ) : PositionalMapping < T >","body":"{ return addPositionalMapping < T > ( Y_MIN , column . name , null ) }","docstring":"/**\n * Maps the `yMin` aesthetic to a data column specified by a [KProperty].\n *\n * @param column the data column to be mapped.\n * @return a [PositionalMapping] object representing the mapping.\n */"} {"signature":"public fun yMin ( column : String ) : PositionalMapping < Any ? >","body":"{ return addPositionalMapping ( Y_MIN , column , null ) }","docstring":"/**\n * Maps the `yMin` aesthetic to a data column specified by a [String].\n *\n * @param column the data column to be mapped.\n * @return a [PositionalMapping] object representing the mapping.\n */"} {"signature":"public fun < T > yMin ( values : Iterable < T > ) : PositionalMapping < T >","body":"{ return addPositionalMapping < T > ( Y_MIN , values . toList ( ) , null , null ) }","docstring":"/**\n * Maps the `yMin` 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 > yMin ( values : DataColumn < T > ) : PositionalMapping < T >","body":"{ return addPositionalMapping < T > ( Y_MIN , values , null ) }","docstring":"/**\n * Maps the `yMin` 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 operator fun get ( index : Int ) : UInt","body":"= storage [ index ] . toUInt ( )","docstring":"/**\n * Returns the array element at the given [index]. This method can be called using the index operator.\n *\n * If the [index] is out of bounds of this array, throws an [IndexOutOfBoundsException] except in Kotlin/JS\n * where the behavior is unspecified.\n */"} {"signature":"public operator fun set ( index : Int , value : UInt )","body":"{ storage [ index ] = value . toInt ( ) }","docstring":"/**\n * Sets the element at the given [index] to the given [value]. This method can be called using the index operator.\n *\n * If the [index] is out of bounds of this array, throws an [IndexOutOfBoundsException] except in Kotlin/JS\n * where the behavior is unspecified.\n */"} {"signature":"public override operator fun iterator ( ) : kotlin . collections . Iterator < UInt >","body":"= Iterator ( storage )","docstring":"/** Creates an iterator over the elements of the array. */"} {"signature":"@ SinceKotlin ( \"\" ) @ ExperimentalUnsignedTypes @ kotlin . internal . InlineOnly public inline fun UIntArray ( size : Int , init : ( Int ) -> UInt ) : UIntArray","body":"{ return UIntArray ( IntArray ( size ) { index -> init ( index ) . toInt ( ) } ) }","docstring":"/**\n * Creates a new array of the specified [size], where each element is calculated by calling the specified\n * [init] function.\n *\n * The function [init] is called for each array element sequentially starting from the first one.\n * It should return the value for an array element given its index.\n */"} {"signature":"public fun close ( ) : Unit","body":"public fun close ( ) : Unit","docstring":"/**\n * Closes this resource.\n *\n * This function may throw, thus it is strongly recommended to use the [use] function instead,\n * which closes this resource correctly whether an exception is thrown or not.\n *\n * Implementers of this interface should pay increased attention to cases where the close operation may fail.\n * It is recommended that all underlying resources are closed and the resource internally is marked as closed\n * before throwing an exception. Such a strategy ensures that the resources are released in a timely manner,\n * and avoids many problems that could come up when the resource wraps, or is wrapped, by another resource.\n *\n * Note that calling this function more than once may have some visible side effect.\n * However, implementers of this interface are strongly recommended to make this function idempotent.\n */"} {"signature":"@ Suppress ( \"\" ) @ SinceKotlin ( \"\" ) @ kotlin . internal . InlineOnly public expect inline fun AutoCloseable ( crossinline closeAction : ( ) -> Unit ) : AutoCloseable","body":"@ Suppress ( \"\" ) @ SinceKotlin ( \"\" ) @ kotlin . internal . InlineOnly public expect inline fun AutoCloseable ( crossinline closeAction : ( ) -> Unit ) : AutoCloseable","docstring":"/**\n * Returns an [AutoCloseable] instance that executes the specified [closeAction]\n * upon invocation of its [`close()`][AutoCloseable.close] function.\n *\n * This function allows specifying custom cleanup actions for resources.\n *\n * Note that each invocation of the `close()` function on the returned `AutoCloseable` instance executes the [closeAction].\n * Therefore, implementers are strongly recommended to make the [closeAction] idempotent, or to prevent multiple invocations.\n *\n * Example:\n *\n * ```kotlin\n * val autoCloseable = AutoCloseable {\n * // Cleanup action, e.g., closing a file or releasing a network connection\n * Logger.log(\"Releasing the network connection.\")\n * networkConnection.release()\n * }\n *\n * // Now you can pass the autoCloseable to a function or use it directly.\n * autoCloseable.use {\n * // Use the connection, which will be automatically released when this scope finishes.\n * val content = networkConnection.readContent()\n * Logger.log(\"Network connection content: $content\")\n * }\n * ```\n *\n * @See AutoCloseable.use\n */"} {"signature":"@ Suppress ( \"\" , \"\" ) @ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalStdlibApi :: class ) @ kotlin . internal . InlineOnly public expect inline fun < T : AutoCloseable ? , R > T . use ( block : ( T ) -> R ) : R","body":"{ contract { callsInPlace ( block , InvocationKind . EXACTLY_ONCE ) } error ( \"\" ) }","docstring":"/**\n * Executes the given [block] function on this resource and then closes it down correctly whether an exception\n * is thrown or not.\n *\n * In case if the resource is being closed due to an exception occurred in [block], and the closing also fails with an exception,\n * the latter is added to the [suppressed][Throwable.addSuppressed] exceptions of the former.\n *\n * @param block a function to process this [AutoCloseable] resource.\n * @return the result of [block] function invoked on this resource.\n */"} {"signature":"public fun complete ( value : T ) : Boolean","body":"public fun complete ( value : T ) : Boolean","docstring":"/**\n * Completes this deferred value with a given [value]. The result is `true` if this deferred was\n * completed as a result of this invocation and `false` otherwise (if it was already completed).\n *\n * Subsequent invocations of this function have no effect and always produce `false`.\n *\n * This function transitions this deferred into _completed_ state if it was not completed or cancelled yet.\n * However, if this deferred has children, then it transitions into _completing_ state and becomes _complete_\n * once all its children are [complete][isCompleted]. See [Job] for details.\n */"} {"signature":"public fun completeExceptionally ( exception : Throwable ) : Boolean","body":"public fun completeExceptionally ( exception : Throwable ) : Boolean","docstring":"/**\n * Completes this deferred value exceptionally with a given [exception]. The result is `true` if this deferred was\n * completed as a result of this invocation and `false` otherwise (if it was already completed).\n *\n * Subsequent invocations of this function have no effect and always produce `false`.\n *\n * This function transitions this deferred into _cancelled_ state if it was not completed or cancelled yet.\n * However, that if this deferred has children, then it transitions into _cancelling_ state and becomes _cancelled_\n * once all its children are [complete][isCompleted]. See [Job] for details.\n */"} {"signature":"public fun < T > CompletableDeferred < T > . completeWith ( result : Result < T > ) : Boolean","body":"= result . fold ( { complete ( it ) } , { completeExceptionally ( it ) } )","docstring":"/**\n * Completes this deferred value with the value or exception in the given [result]. Returns `true` if this deferred\n * was completed as a result of this invocation and `false` otherwise (if it was already completed).\n *\n * Subsequent invocations of this function have no effect and always produce `false`.\n *\n * This function transitions this deferred in the same ways described by [CompletableDeferred.complete] and\n * [CompletableDeferred.completeExceptionally].\n */"} {"signature":"@ Suppress ( \"\" ) public fun < T > CompletableDeferred ( parent : Job ? = null ) : CompletableDeferred < T >","body":"= CompletableDeferredImpl ( parent )","docstring":"/**\n * Creates a [CompletableDeferred] in an _active_ state.\n * It is optionally a child of a [parent] job.\n */"} {"signature":"@ Suppress ( \"\" ) public fun < T > CompletableDeferred ( value : T ) : CompletableDeferred < T >","body":"= CompletableDeferredImpl < T > ( null ) . apply { complete ( value ) }","docstring":"/**\n * Creates an already _completed_ [CompletableDeferred] with a given [value].\n */"} {"signature":"public fun koverXmlReportName ( variant : String ) : String","body":"{ return xmlReportTaskName ( variant ) }","docstring":"/**\n * Name of the XML report generation task for [variant] Kover report variant.\n */"} {"signature":"public fun koverHtmlReportName ( variant : String ) : String","body":"{ return htmlReportTaskName ( variant ) }","docstring":"/**\n * Name of the HTML report generation task for [variant] Kover report variant.\n */"} {"signature":"public fun koverBinaryReportName ( variant : String ) : String","body":"{ return binaryReportTaskName ( variant ) }","docstring":"/**\n * Name of the binary report generation task for [variant] Kover report variant.\n */"} {"signature":"public fun koverVerifyName ( variant : String ) : String","body":"{ return verifyTaskName ( variant ) }","docstring":"/**\n * Name of the verification task for [variant] Kover report variant.\n */"} {"signature":"public fun koverLogName ( variant : String ) : String","body":"{ return logTaskName ( variant ) }","docstring":"/**\n * Name of the coverage logging task for [variant] Kover report variant.\n */"} {"signature":"@ ObsoleteDescriptorBasedAPI override fun referenceClass ( declaration : ClassDescriptor ) : IrClassSymbol","body":"{ val irBuiltIns = this@SymbolTableWithBuiltInsDeduplication . irBuiltIns ? : return super . referenceClass ( declaration ) val builtInDescriptor = irBuiltIns . findBuiltInClassDescriptor ( declaration ) if ( builtInDescriptor != null ) { return super . referenceClass ( builtInDescriptor ) } return super . referenceClass ( declaration ) }","docstring":"/**\n * Gets or creates the [IrClassSymbol] for [declaration], or for the built-in descriptor with the same name if [declaration] is a\n * duplicate built-in.\n *\n * Note that not all built-in symbols may have been bound or created by the time [irBuiltIns] has been bound. However, [referenceClass]\n * will create a symbol in such a case (via `super.referenceClass`) and [org.jetbrains.kotlin.ir.util.DeclarationStubGenerator] will\n * create a stub for the symbol if [referenceClass] was invoked from the stub generator.\n */"} {"signature":"fun < T : Any > sort ( a : KtNDArray < T > , axis : Int = - , kind : KindSort ? = null ) : KtNDArray < T >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( a , axis , kind ? . str ? : None . none ) )","docstring":"/**\n * Return a sorted copy of an array.\n *\n * @param a array to be sorted.\n * @param axis along which to sort.\n * @param kind sorting algorithm. see [KindSort].\n * @return [KtNDArray] of the same type and shape as [a].\n * @see argSort\n * @see lexSort\n * @see searchSorted\n * @see partition\n */"} {"signature":"fun < T : Any > lexSort ( keys : Array < KtNDArray < T > > , axis : Int = - ) : KtNDArray < Long >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( keys , axis ) )","docstring":"/**\n * Perform an indirect stable sort using a sequence of keys.\n *\n * @param keys the k different 'columns' to be sorted.\n * @param axis axis to be indirectly sorted.\n * @return [KtNDArray] of indeces that sort the keys along the specified axis.\n * @see argSort\n * @see sort\n */"} {"signature":"fun < T : Any > argSort ( a : KtNDArray < T > , axis : Int = - , kind : KindSort ? = null ) : KtNDArray < Long >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( a , axis , kind ? . str ? : None . none ) )","docstring":"/**\n * Returns the indices that would sort an array.\n *\n * @param a array to sort\n * @param axis along which to sort. The default is the last index (-1).\n * @param kind sorting algorithm. The default is `quicksort`.\n * @return [KtNDArray] of indices that sort [a] along the specified [axis].\n * @see sort\n * @see lexSort\n * @see argPartition\n */"} {"signature":"fun < T : Any > msort ( a : KtNDArray < T > ) : KtNDArray < T >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( a ) )","docstring":"/**\n * Return of an array sorted along the first axis.\n *\n * @param a array to be sorted.\n * @return [KtNDArray] of the same type and shape as [a].\n * @see sort\n */"} {"signature":"fun < T : Any > argPartition ( a : KtNDArray < T > , kth : Int , axis : Int = - , kind : String = \"\" ) : KtNDArray < Long >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( a , kth , axis , kind ) )","docstring":"/**\n * Perform an indirect partition along the given axis using the algorithm specified by the kind keyword.\n *\n * @param a array to sort.\n * @param kth element index to partition by.\n * @param axis along which to sort. Th default is the last axis (-1).\n * @param kind selection algorithm. Default is `introselect`.\n * @return [KtNDArray] of indices that partition [a] along the specified axis.\n * @see partition\n * @see argSort\n */"} {"signature":"fun < T : Number > argMax ( a : KtNDArray < T > ) : Long","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( a ) , kClass = Long :: class )","docstring":"/**\n * Returns the index of the maximum value along the flattened array.\n *\n * @param a input array.\n * @return index of type [Long].\n * @see argMin\n */"} {"signature":"fun < T : Number > argMax ( a : KtNDArray < T > , axis : Int ) : KtNDArray < Long >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( a , axis ) )","docstring":"/**\n * Returns the indices of the maximum values along an axis.\n *\n * @param a input array.\n * @param axis indices along the specified axis.\n * @return [KtNDArray] of indices into the array. It has the same shape as [a] with the dimension along axis removed.\n * @see argMin\n */"} {"signature":"fun < T : Number > nanArgMax ( a : KtNDArray < T > ) : Long","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( a ) , kClass = Long :: class )","docstring":"/**\n * Return the indices of the maximum values in the specified axis ignoring [Double.NaN].\n *\n * @param a input data.\n * @return index value.\n * @see argMax\n * @see nanArgMin\n */"} {"signature":"fun < T : Number > nanArgMax ( a : KtNDArray < T > , axis : Int ) : KtNDArray < Long >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( a , axis ) )","docstring":"/**\n * @param axis along which to operate.\n * @return An [KtNDArray] of indices.\n */"} {"signature":"fun < T : Number > argMin ( a : KtNDArray < T > ) : Long","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( a ) , kClass = Long :: class )","docstring":"/**\n * Returns the index of the maximum value along the flattened array.\n *\n * @param a input array.\n * @return index of type [Long].\n * @see argMax\n */"} {"signature":"fun < T : Number > argMin ( a : KtNDArray < T > , axis : Int ) : KtNDArray < Long >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( a , axis ) )","docstring":"/**\n * Returns the indices of the minimum values along an axis.\n *\n * @param a input array.\n * @param axis indices along the specified axis.\n * @return [KtNDArray] of indices into the array. It has the same shape as [a] with the dimension along axis removed.\n * @see argMax\n */"} {"signature":"fun < T : Number > nanArgMin ( a : KtNDArray < T > ) : Long","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( a ) , kClass = Long :: class )","docstring":"/**\n * Return the indices of the minimum values in the specified axis ignoring [Double.NaN].\n *\n * @param a input data.\n * @return Index value.\n * @see nanArgMax\n * @see argMin\n */"} {"signature":"fun < T : Number > nanArgMin ( a : KtNDArray < T > , axis : Int ) : KtNDArray < Long >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( a , axis ) )","docstring":"/**\n * @param axis along which to operate.\n * @return An [KtNDArray] of indices.\n */"} {"signature":"fun < T : Any > nonZero ( a : KtNDArray < T > ) : Array < Any >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( a ) , kClass = Array < Any > :: class )","docstring":"/**\n * Return the indices of the elements that are non-zero.\n *\n * @param a input array.\n * @return [Array] of indices of elements that are non-zero.\n * @see flatNoneZero\n * @see countNonZero\n */"} {"signature":"fun < T : Number > flatNoneZero ( a : KtNDArray < T > ) : KtNDArray < Long >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( a ) )","docstring":"/**\n * Return indices that are non-zero in the flattened version of [a].\n *\n * @param a input data.\n * @return [KtNDArray]\n * @see nonZero\n * @see ravel\n */"} {"signature":"fun < T : Number > searchSorted ( a : KtNDArray < T > , v : T , side : Side = Side . LEFT ) : Long","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( a , v , side . str ) , kClass = Long :: class )","docstring":"/**\n * Find indices where elements should be inserted to maintain order.\n *\n * @param a input 1-D [KtNDArray].\n * @param v value to insert into [a].\n * @param side If *left*, the index of the first suitable location found is given.\n * If *right*, return the last such index.\n * If there is no suitable index, return either 0 or N (where N is the length of [a]).\n * @return index\n * @see sort\n */"} {"signature":"fun < T : Number > searchSorted ( a : KtNDArray < T > , v : KtNDArray < T > , side : Side = Side . LEFT ) : KtNDArray < Long >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( a , v , side . str ) )","docstring":"/**\n * @param v [KtNDArray] of values to insert into [a].\n * @return [KtNDArray] of insertion points with the same shape as v.\n */"} {"signature":"fun < T : Any > countNonZero ( a : KtNDArray < T > ) : Long","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( a ) , kClass = Long :: class )","docstring":"/**\n * Counts the number of non-zero values in the array [a].\n * @param a inpud array.\n * @return Number of [Long] of non-zero values in the array.\n * @see nonZero\n */"} {"signature":"fun < T : Any > countNonZero ( a : KtNDArray < T > , axis : Int ) : KtNDArray < Long >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( a , axis ) )","docstring":"/**\n * Counts the number of non-zero values in the array [a] along a given axis.\n * @param a inpud array.\n * @param axis along which to count non-zeros.\n * @return Number of [KtNDArray] of non-zeros values in the array along a given axis.\n * @see nonZero\n */"} {"signature":"override fun isSynthetic ( documentable : Documentable , sourceSet : DokkaConfiguration . DokkaSourceSet ) : Boolean","body":"{ @ Suppress ( \"\" ) val extra = ( documentable as? WithExtraProperties < Documentable > ) ? . extra val isInherited = extra ? . get ( InheritedMember ) ? . inheritedFrom ? . get ( sourceSet ) != null val isSynthesized = documentable . getPsi ( sourceSet ) == null return isInherited || isSynthesized }","docstring":"/**\n * Currently, it's used only for [org.jetbrains.dokka.base.transformers.documentables.ReportUndocumentedTransformer]\n *\n * For so-called fake-ovveride declarations - we have [InheritedMember] extra.\n * For synthesized declaration - we do not have PSI source.\n *\n * @see org.jetbrains.kotlin.analysis.api.symbols.KtSymbolOrigin.SOURCE_MEMBER_GENERATED\n */"} {"signature":"fun acceptsField ( result : FieldValue ) : Boolean","body":"fun acceptsField ( result : FieldValue ) : Boolean","docstring":"/**\n * Returns true if this renderer accepts [result], false otherwise\n */"} {"signature":"fun accepts ( value : Any ? ) : Boolean","body":"fun accepts ( value : Any ? ) : Boolean","docstring":"/**\n * Returns true if this renderer accepts [value], false otherwise\n */"} {"signature":"fun precompile ( methodName : String , paramName : String , ) : Code ?","body":"fun precompile ( methodName : String , paramName : String , ) : Code ?","docstring":"/**\n * Returns method code for rendering\n *\n * @param methodName Precompiled method name\n * @param paramName Name for result value parameter\n * @return Method code if renderer may be precompiled, null otherwise\n */"} {"signature":"private fun sparkExample ( ) : Unit","body":"= withSpark { val random = udf ( nondeterministic = true ) { -> Math . random ( ) } udf . register ( \"\" , random ) spark . sql ( \"\" ) . show ( ) val plusOne = udf { x : Int -> x + } udf . register ( \"\" , plusOne ) spark . sql ( \"\" ) . show ( ) udf . register ( \"\" ) { str : String , int : Int -> str . length + int } spark . sql ( \"\" ) . show ( ) udf . register ( \"\" ) { n : Long -> n > } spark . range ( , ) . createOrReplaceTempView ( \"\" ) spark . sql ( \"\" ) . show ( ) }","docstring":"/**\n * https://spark.apache.org/docs/latest/sql-ref-functions-udf-scalar.html\n * adapted directly for Kotlin:\n * */"} {"signature":"private fun smartNames ( ) : Unit","body":"= withSpark { val plusOne = udf { x : Int -> x + } udf . register ( \"\" , plusOne ) spark . sql ( \"\" ) . show ( ) val plusOneNamed = udf ( \"\" ) { x : Int -> x + } udf . register ( plusOneNamed ) spark . sql ( \"\" ) . show ( ) udf . register ( \"\" , plusOneNamed ) udf . register ( plusOneNamed . withName ( \"\" ) ) val plusOneFinal by udf { x : Int -> x + } plusOneFinal . register ( ) spark . sql ( \"\" ) . show ( ) }","docstring":"/**\n * Shows how Kotlin's UDF wrappers can carry a name which saves you time and errors.\n */"} {"signature":"private fun functionToUDF ( ) : Unit","body":"= withSpark { fun plusOne ( x : Int ) = x + val plusOneUDF : NamedUserDefinedFunction1 < Int , Int > = udf ( :: plusOne ) udf . register ( :: plusOne ) spark . sql ( \"\" ) . show ( ) val minusOneUDF : NamedUserDefinedFunction1 < Int , Int > = udf ( :: minusOne ) udf ( \"\" , :: minusOne ) }","docstring":"/**\n * Shows how UDFs can be created from normal functions as well.\n */"} {"signature":"private fun strongTypingInDatasets ( )","body":"= withSpark { data class User ( val name : String , val age : Int ? ) val ds : Dataset < User > = dsOf ( User ( \"\" , null ) , User ( \"\" , ) , User ( \"\" , ) , User ( \"\" , ) , ) . showDS ( ) val replaceMissingAge = udf { age : Int ? , value : Int -> age ? : value } val result1 : Dataset < Tuple2 < String , Int > > = ds . select ( col ( User :: name ) , replaceMissingAge ( col ( User :: age ) , typedLit ( - ) ) ) . showDS ( ) val toJson by udf { age : Int , name : String , pets : Seq < String > -> \"\"\"\"\"\" } val df : Dataset < Row > = dfOf ( colNames = arrayOf ( \"\" , \"\" , \"\" ) , t ( \"\" , , emptyList ( ) ) , t ( \"\" , , listOf ( \"\" , \"\" ) ) , t ( \"\" , , listOf ( \"\" ) ) , ) . showDS ( ) val result2 = df . select ( toJson ( col < _ , Int > ( \"\" ) , col < _ , String > ( \"\" ) , col < Row , List < String > > ( \"\" ) . asSeq ( ) , ) ) . showDS ( truncate = false ) }","docstring":"/**\n * Shows how UDFs in Kotlin carry typing information, which allows you to do\n * typesafe column operations with them.\n */"} {"signature":"private fun UDAF ( )","body":"= withSpark { val ds : Dataset < Employee > = dsOf ( Employee ( \"\" , ) , Employee ( \"\" , ) , Employee ( \"\" , ) , Employee ( \"\" , ) , ) . showDS ( ) val averageSalary : TypedColumn < Employee , Double > = MyAverage . toColumn ( ) . name ( \"\" ) val result1 : Dataset < Double > = ds . select ( averageSalary ) . showDS ( ) val myAverage = aggregatorOf < Long , Average , Double > ( zero = { Average ( , ) } , reduce = { buffer , it -> buffer . sum += it buffer . count += buffer } , merge = { buffer , it -> buffer . sum += it . sum buffer . count += it . count buffer } , finish = { it . sum . toDouble ( ) / it . count } , ) val myAverageUdf = udaf ( \"\" , myAverage ) . register ( ) ds . createOrReplaceTempView ( \"\" ) spark . sql ( \"\"\"\"\"\" ) . showDS ( ) val result2 : Dataset < Double > = ds . select ( myAverageUdf ( col ( Employee :: salary ) ) . name ( \"\" ) ) . showDS ( ) val udaf : UserDefinedFunction1 < Long , Double > = udaf ( zero = { Average ( , ) } , reduce = { buffer , it -> buffer . sum += it buffer . count += buffer } , merge = { buffer , it -> buffer . sum += it . sum buffer . count += it . count buffer } , finish = { it . sum . toDouble ( ) / it . count } , ) val registeredUdaf : NamedUserDefinedFunction1 < Long , Double > = udf . register ( name = \"\" , zero = { Average ( , ) } , reduce = { buffer , it -> buffer . sum += it buffer . count += buffer } , merge = { buffer , it -> buffer . sum += it . sum buffer . count += it . count buffer } , finish = { it . sum . toDouble ( ) / it . count } , ) }","docstring":"/**\n * Shows how UDAFs can be used from Kotlin.\n */"} {"signature":"private fun varargUDFs ( )","body":"= withSpark { fun sumOf ( vararg double : Double ) : Double = double . sum ( ) val sumUDF = udf . register ( :: sumOf ) data class Values ( val v1 : Double , val v2 : Double , val v3 : Double , val v4 : Double ) val ds = dsOf ( Values ( , , , ) , Values ( , , , ) , Values ( , , , ) , ) . showDS ( ) ds . createOrReplaceTempView ( \"\" ) spark . sql ( \"\"\"\"\"\" ) . showDS ( ) val result = ds . select ( sumUDF ( col ( Values :: v1 ) , col ( Values :: v4 ) ) , sumUDF ( ) , sumUDF ( col ( Values :: v1 ) , col ( Values :: v2 ) , col ( Values :: v3 ) , col ( Values :: v4 ) ) , ) . showDS ( ) udf . register ( \"\" ) { strings : Array < String > -> strings . joinToString ( separator = \"\" ) } spark . sql ( \"\"\"\"\"\" ) . showDS ( ) }","docstring":"/**\n * Shows the new and unique vararg UDFs the Kotlin Spark API has to offer and how to use them.\n */"} {"signature":"fun analyzeSpecialSerializers ( session : FirSession , annotations : List < FirAnnotation > ) : FirClassSymbol < * > ?","body":"= when { annotations . hasAnnotation ( SerializationAnnotations . contextualClassId , session ) || annotations . hasAnnotation ( SerializationAnnotations . contextualOnPropertyClassId , session ) -> { session . dependencySerializationInfoProvider . getClassFromSerializationPackage ( SpecialBuiltins . Names . contextSerializer ) } annotations . hasAnnotation ( SerializationAnnotations . polymorphicClassId , session ) -> { session . dependencySerializationInfoProvider . getClassFromSerializationPackage ( SpecialBuiltins . Names . polymorphicSerializer ) } else -> null }","docstring":"/**\n * Returns class descriptor for ContextSerializer or PolymorphicSerializer\n * if [annotations] contains @Contextual or @Polymorphic annotation\n */"} {"signature":"abstract fun irGet ( startOffset : Int , endOffset : Int , valueDeclaration : IrValueDeclaration ) : IrExpression ?","body":"abstract fun irGet ( startOffset : Int , endOffset : Int , valueDeclaration : IrValueDeclaration ) : IrExpression ?","docstring":"/**\n * @return the expression to get the value for given declaration, or `null` if [IrGetValue] should be used.\n */"} {"signature":"public fun KtDeclaration . getOriginalDeclaration ( ) : KtDeclaration ?","body":"= withValidityAssertion { analysisSession . originalPsiProvider . getOriginalDeclaration ( this ) }","docstring":"/**\n * If [KtDeclaration] is a non-local declaration in a fake file analyzed in dependent session, returns the original declaration\n * for [this]. Otherwise, returns `null`.\n */"} {"signature":"public fun KtFile . getOriginalKtFile ( ) : KtFile ?","body":"= withValidityAssertion { analysisSession . originalPsiProvider . getOriginalKtFile ( this ) }","docstring":"/**\n * If [this] is a fake file analyzed in dependent session, returns the original file for [this]. Otherwise, returns `null`.\n */"} {"signature":"public fun KtDeclaration . recordOriginalDeclaration ( declaration : KtDeclaration )","body":"{ withValidityAssertion { analysisSession . originalPsiProvider . recordOriginalDeclaration ( this , declaration ) } }","docstring":"/**\n * Records [declaration] as an original declaration for [this].\n */"} {"signature":"public fun KtFile . recordOriginalKtFile ( file : KtFile )","body":"{ withValidityAssertion { analysisSession . originalPsiProvider . recordOriginalKtFile ( this , file ) } }","docstring":"/**\n * Records [file] as an original file for [this].\n */"} {"signature":"private fun processValue ( value : Any ? , fieldType : JavaType ) : Any ?","body":"{ if ( fieldType !is JavaPrimitiveType || fieldType . type == null || value !is Int ) return value return when ( fieldType . type ) { PrimitiveType . BOOLEAN -> { when ( value ) { -> false -> true else -> value } } PrimitiveType . CHAR -> value . toChar ( ) else -> value } }","docstring":"/**\n * All the int-like values (including Char/Boolean) come in visitor as Integer instances\n */"} {"signature":"fun getForSplitPaths ( bottom : List < File > , top : List < File > ) : ClassLoader","body":"{ return if ( bottom . isEmpty ( ) || top . isEmpty ( ) ) { getForClassPath ( bottom + top ) } else { val key = makeKey ( bottom + top ) cache . getOrPut ( key ) { val parent = getForClassPath ( top ) makeClassLoader ( makeKey ( bottom ) , parent ) } } }","docstring":"/**\n * Gets or creates [ClassLoader] from [bottom] + [top] files.\n * When creating new [ClassLoader] it tries to get [top] from cache first and then create new ClassLoader from [bottom] files,\n * providing [top] [ClassLoader] as parent.\n * Useful when you have internal and external artifacts and internal ones can be references from other internal artefacts only.\n * So you can safely cache [ClassLoader] from external artifacts and use it for internal ones.\n */"} {"signature":"public suspend fun < T > withTimeout ( timeMillis : Long , block : suspend CoroutineScope . ( ) -> T ) : T","body":"{ contract { callsInPlace ( block , InvocationKind . EXACTLY_ONCE ) } if ( timeMillis <= ) throw TimeoutCancellationException ( \"\" ) return suspendCoroutineUninterceptedOrReturn { uCont -> setupTimeout ( TimeoutCoroutine ( timeMillis , uCont ) , block ) } }","docstring":"/**\n * Runs a given suspending [block] of code inside a coroutine with a specified [timeout][timeMillis] and throws\n * a [TimeoutCancellationException] if the timeout was exceeded.\n * If the given [timeMillis] is non-positive, [TimeoutCancellationException] is thrown immediately.\n *\n * The code that is executing inside the [block] is cancelled on timeout and the active or next invocation of\n * the cancellable suspending function inside the block throws a [TimeoutCancellationException].\n *\n * The sibling function that does not throw an exception on timeout is [withTimeoutOrNull].\n * Note that the timeout action can be specified for a [select] invocation with [onTimeout][SelectBuilder.onTimeout] clause.\n *\n * **The timeout event is asynchronous with respect to the code running in the block** and may happen at any time,\n * even right before the return from inside the timeout [block]. Keep this in mind if you open or acquire some\n * resource inside the [block] that needs closing or release outside the block.\n * See the\n * [Asynchronous timeout and resources][https://kotlinlang.org/docs/reference/coroutines/cancellation-and-timeouts.html#asynchronous-timeout-and-resources]\n * section of the coroutines guide for details.\n *\n * > Implementation note: how the time is tracked exactly is an implementation detail of the context's [CoroutineDispatcher].\n *\n * @param timeMillis timeout time in milliseconds.\n */"} {"signature":"public suspend fun < T > withTimeout ( timeout : Duration , block : suspend CoroutineScope . ( ) -> T ) : T","body":"{ contract { callsInPlace ( block , InvocationKind . EXACTLY_ONCE ) } return withTimeout ( timeout . toDelayMillis ( ) , block ) }","docstring":"/**\n * Runs a given suspending [block] of code inside a coroutine with the specified [timeout] and throws\n * a [TimeoutCancellationException] if the timeout was exceeded.\n * If the given [timeout] is non-positive, [TimeoutCancellationException] is thrown immediately.\n *\n * The code that is executing inside the [block] is cancelled on timeout and the active or next invocation of\n * the cancellable suspending function inside the block throws a [TimeoutCancellationException].\n *\n * The sibling function that does not throw an exception on timeout is [withTimeoutOrNull].\n * Note that the timeout action can be specified for a [select] invocation with [onTimeout][SelectBuilder.onTimeout] clause.\n *\n * **The timeout event is asynchronous with respect to the code running in the block** and may happen at any time,\n * even right before the return from inside the timeout [block]. Keep this in mind if you open or acquire some\n * resource inside the [block] that needs closing or release outside the block.\n * See the\n * [Asynchronous timeout and resources][https://kotlinlang.org/docs/reference/coroutines/cancellation-and-timeouts.html#asynchronous-timeout-and-resources]\n * section of the coroutines guide for details.\n *\n * > Implementation note: how the time is tracked exactly is an implementation detail of the context's [CoroutineDispatcher].\n */"} {"signature":"public suspend fun < T > withTimeoutOrNull ( timeMillis : Long , block : suspend CoroutineScope . ( ) -> T ) : T ?","body":"{ if ( timeMillis <= ) return null var coroutine : TimeoutCoroutine < T ? , T ? > ? = null try { return suspendCoroutineUninterceptedOrReturn { uCont -> val timeoutCoroutine = TimeoutCoroutine ( timeMillis , uCont ) coroutine = timeoutCoroutine setupTimeout < T ? , T ? > ( timeoutCoroutine , block ) } } catch ( e : TimeoutCancellationException ) { if ( e . coroutine === coroutine ) { return null } throw e } }","docstring":"/**\n * Runs a given suspending block of code inside a coroutine with a specified [timeout][timeMillis] and returns\n * `null` if this timeout was exceeded.\n * If the given [timeMillis] is non-positive, `null` is returned immediately.\n *\n * The code that is executing inside the [block] is cancelled on timeout and the active or next invocation of\n * cancellable suspending function inside the block throws a [TimeoutCancellationException].\n *\n * The sibling function that throws an exception on timeout is [withTimeout].\n * Note that the timeout action can be specified for a [select] invocation with [onTimeout][SelectBuilder.onTimeout] clause.\n *\n * **The timeout event is asynchronous with respect to the code running in the block** and may happen at any time,\n * even right before the return from inside the timeout [block]. Keep this in mind if you open or acquire some\n * resource inside the [block] that needs closing or release outside the block.\n * See the\n * [Asynchronous timeout and resources][https://kotlinlang.org/docs/reference/coroutines/cancellation-and-timeouts.html#asynchronous-timeout-and-resources]\n * section of the coroutines guide for details.\n *\n * > Implementation note: how the time is tracked exactly is an implementation detail of the context's [CoroutineDispatcher].\n *\n * @param timeMillis timeout time in milliseconds.\n */"} {"signature":"public suspend fun < T > withTimeoutOrNull ( timeout : Duration , block : suspend CoroutineScope . ( ) -> T ) : T ?","body":"= withTimeoutOrNull ( timeout . toDelayMillis ( ) , block )","docstring":"/**\n * Runs a given suspending block of code inside a coroutine with the specified [timeout] and returns\n * `null` if this timeout was exceeded.\n * If the given [timeout] is non-positive, `null` is returned immediately.\n *\n * The code that is executing inside the [block] is cancelled on timeout and the active or next invocation of\n * cancellable suspending function inside the block throws a [TimeoutCancellationException].\n *\n * The sibling function that throws an exception on timeout is [withTimeout].\n * Note that the timeout action can be specified for a [select] invocation with [onTimeout][SelectBuilder.onTimeout] clause.\n *\n * **The timeout event is asynchronous with respect to the code running in the block** and may happen at any time,\n * even right before the return from inside the timeout [block]. Keep this in mind if you open or acquire some\n * resource inside the [block] that needs closing or release outside the block.\n * See the\n * [Asynchronous timeout and resources][https://kotlinlang.org/docs/reference/coroutines/cancellation-and-timeouts.html#asynchronous-timeout-and-resources]\n * section of the coroutines guide for details.\n *\n * > Implementation note: how the time is tracked exactly is an implementation detail of the context's [CoroutineDispatcher].\n */"} {"signature":"inline fun IrGeneratorWithScope . irBlock ( expression : IrExpression , origin : IrStatementOrigin ? = null , resultType : IrType ? = expression . type , body : IrBlockBuilder . ( ) -> Unit )","body":"= this . irBlock ( expression . startOffset , expression . endOffset , origin , resultType , body )","docstring":"/**\n * Builds [IrBlock] to be used instead of given expression.\n */"} {"signature":"fun visit ( visitor : LLFirResolveTargetVisitor )","body":"{ if ( target is FirFile ) { visitor . performAction ( target ) } goToTarget ( visitor ) }","docstring":"/**\n * Visit [path], [target] and optionally its subgraph.\n * Each nested declaration will be wrapped with corresponding [LLFirResolveTargetVisitor.withFile],\n * [LLFirResolveTargetVisitor.withRegularClass] and [LLFirResolveTargetVisitor.withScript] recursively.\n */"} {"signature":"protected abstract fun visitTargetElement ( element : FirElementWithResolveState , visitor : LLFirResolveTargetVisitor , )","body":"protected abstract fun visitTargetElement ( element : FirElementWithResolveState , visitor : LLFirResolveTargetVisitor , )","docstring":"/**\n * [element] with [FirFile] will be processed before.\n */"} {"signature":"fun forEachTarget ( action : ( FirElementWithResolveState ) -> Unit )","body":"{ visit ( object : LLFirResolveTargetVisitor { override fun performAction ( element : FirElementWithResolveState ) { action ( element ) } } ) }","docstring":"/**\n * Executions the [action] for each target that this [LLFirResolveTarget] represents.\n */"} {"signature":"override fun atomicMove ( source : Path , destination : Path )","body":"{ val sourcePreOpen = PreOpens . findPreopen ( source ) val destPreOpen = PreOpens . findPreopen ( destination ) withScopedMemoryAllocator { allocator -> val ( sourceBuffer , sourceBufferLength ) = allocator . storeString ( source . path ) val ( destBuffer , destBufferLength ) = allocator . storeString ( destination . path ) val res = Errno ( path_rename ( oldFd = sourcePreOpen . fd , oldPathPtr = sourceBuffer . address . toInt ( ) , oldPathLen = sourceBufferLength , newFd = destPreOpen . fd , newPathPtr = destBuffer . address . toInt ( ) , newPathLen = destBufferLength ) ) when ( res ) { Errno . success -> return Errno . noent -> throw FileNotFoundException ( \"\" + \"\" ) else -> throw IOException ( \"\" ) } } }","docstring":"/**\n * The move is not atomic (well, we don't know what kind of move it is), but there are no\n * alternatives.\n */"} {"signature":"override fun resolve ( path : Path ) : Path","body":"{ val absolutePath = if ( path . isAbsolute ) { path } else { Path ( PreOpens . roots . first ( ) , path . path ) } val resolvedPath = resolvePathImpl ( absolutePath , ) ? : throw FileNotFoundException ( \"\" ) check ( resolvedPath . isAbsolute ) { \"\" } val normalizedPath = resolvedPath . normalized ( ) if ( ! exists ( normalizedPath ) ) throw FileNotFoundException ( \"\" ) return normalizedPath }","docstring":"/**\n * Returns an absolute path to the same file or directory the [path] is pointing to.\n * All symbolic links are solved, extra path separators and references to current (`.`) or\n * parent (`..`) directories are removed.\n * If the [path] is a relative path then it'll be resolved against current working directory.\n * If there is no file or directory to which the [path] is pointing to then [FileNotFoundException] will be thrown.\n *\n * The behavior of this method differs from other platforms as the resolution\n * may not fail if there is no filesystem-node (file, directory, symlink, etc.) corresponding\n * to some interior path. This allows successfully resolving paths like `/a/b/c/../../d/e` when\n * pre-opened directories are `/a/b/c` and `/a/d/e`.\n *\n * @param path the path to resolve.\n * @return a resolved path.\n * @throws FileNotFoundException if there is no file or directory corresponding to the specified path.\n */"} {"signature":"fun translate ( ) : JsCatch ?","body":"{ if ( catches . isEmpty ( ) ) return null val firstCatch = catches . first ( ) val catchParameter = firstCatch . catchParameter val parameterDescriptor = BindingUtils . getDescriptorForElement ( bindingContext ( ) , catchParameter ! ! ) val parameterName = context ( ) . getNameForDescriptor ( parameterDescriptor ) . ident val jsCatch = JsCatch ( context ( ) . scope ( ) , parameterName ) val parameterRef = jsCatch . parameter . name . makeRef ( ) val catchContext = context ( ) . innerContextWithAliased ( parameterDescriptor , parameterRef ) jsCatch . body = JsBlock ( translateCatches ( catchContext , parameterRef , catches . iterator ( ) ) ) return jsCatch }","docstring":"/**\n * In JavaScript there is no multiple catches, so we translate\n * multiple catch to single catch with instanceof checks for\n * every catch clause.\n *\n * For example this code:\n * try {\n * ...\n * } catch(e: NullPointerException) {\n * ...\n * } catch(e: RuntimeException) {\n * ...\n * }\n *\n * is translated to the following JsCode\n *\n * try {\n * ...\n * } catch(e) {\n * if (e instanceof NullPointerException) {\n * ...\n * } else {\n * if (e instanceof RuntimeException) {\n * ...\n * } else throw e;\n * }\n * }\n */"} {"signature":"public fun < K , V > mapOfNotNull ( vararg mapping : Pair < K ? , V ? > ) : Map < K , V >","body":"{ return buildMap { mapping . forEach { ( k , v ) -> if ( k != null && v != null ) { put ( k , v ) } } } }","docstring":"/**\n * Create a new read-only map from a list of pairs, if both values in the pair are not null.\n *\n * @param [mapping] pairs of keys and values to put into the map\n * @return map with the provided keys and values, excluding nulls\n * @see kotlin.collections.mapOf(Pair[])\n */"} {"signature":"inline fun < T > withExceptionPrettifier ( disabled : Boolean = false , action : ( ) -> T ) : T","body":"{ if ( disabled ) { return action ( ) } return try { action ( ) } catch ( throwable : Throwable ) { val prettifiers = listOf ( ClangModulesDisabledPrettifier , ) throw prettifiers . firstOrNull { it . matches ( throwable ) } ? . prettify ( throwable ) ? : throwable } }","docstring":"/**\n * Wraps invocation of [action] into exception handler and makes messages of supported exceptions more user-friendly.\n * Can be optionally [disabled] which is useful when one want to find the root cause of the prettified exception.\n */"} {"signature":"public fun write ( source : Buffer , byteCount : Long )","body":"public fun write ( source : Buffer , byteCount : Long )","docstring":"/**\n * Removes [byteCount] bytes from [source] and appends them to this sink.\n *\n * @param source the source to read data from.\n * @param byteCount the number of bytes to write.\n *\n * @throws IllegalArgumentException when the [source]'s size is below [byteCount] or [byteCount] is negative.\n * @throws IllegalStateException when the sink is closed.\n */"} {"signature":"public fun flush ( )","body":"public fun flush ( )","docstring":"/**\n * Pushes all buffered bytes to their final destination.\n *\n * @throws IllegalStateException when the sink is closed.\n */"} {"signature":"override fun close ( )","body":"override fun close ( )","docstring":"/**\n * Pushes all buffered bytes to their final destination and releases the resources held by this\n * sink. It is an error to write a closed sink. It is safe to close a sink more than once.\n */"} {"signature":"fun main ( )","body":"= withSpark { val groupIndices = getAllPossibleGroups ( listSize = , groupSize = ) . sort ( \"\" ) groupIndices . showDS ( numRows = groupIndices . count ( ) . toInt ( ) ) }","docstring":"/**\n * Gets all the possible, unique, non repeating groups of indices for a list.\n *\n * Example by Jolanrensen.\n */"} {"signature":"fun KSparkSession . getAllPossibleGroups ( listSize : Int , groupSize : Int , ) : Dataset < IntArray >","body":"{ val indices = ( until listSize ) . toList ( ) . toRDD ( ) if ( groupSize == ) { return indices . mapPartitions { it . map { intArrayOf ( it ) } } . toDS ( ) } val keys = indices . mapPartitions { it . transformAsSequence { flatMap { listIndex -> ( until groupSize ) . asSequence ( ) . flatMap { dimension -> addTuples ( groupSize = groupSize , value = listIndex , listSize = listSize , skipDimension = dimension , ) } } } } val allPossibleGroups = keys . aggregateByKey ( zeroValue = IntArray ( groupSize ) { - } , seqFunc = { base : IntArray , listIndex : Int -> base [ base . indexOfFirst { it < } ] = listIndex base } , combFunc = { a : IntArray , b : IntArray -> var j = for ( i in a . indices ) { if ( a [ i ] < ) { while ( b [ j ] < ) { j ++ if ( j == b . size ) return@aggregateByKey a } a [ i ] = b [ j ] j ++ } } a } , ) . values ( ) return allPossibleGroups . toDS ( ) }","docstring":"/**\n * Get all the possible, unique, non repeating groups (of size [groupSize]) of indices for a list of\n * size [listSize].\n *\n *\n * The workload is evenly distributed by [listSize] and [groupSize]\n *\n * @param listSize the size of the list for which to calculate the indices\n * @param groupSize the size of a group of indices\n * @return all the possible, unique non repeating groups of indices\n */"} {"signature":"private fun getTupleValue ( indexTuple : List < Int > , listSize : Int ) : Int","body":"= indexTuple . indices . sumOf { indexTuple [ it ] * listSize . toDouble ( ) . pow ( it ) . toInt ( ) }","docstring":"/**\n * Simple method to give each index of x dimensions a unique number.\n *\n * @param indexTuple IntArray (can be seen as Tuple) of size x with all values < listSize. The index for which to return the number\n * @param listSize The size of the list, aka the max width, height etc. of the table\n * @return the unique number for this [indexTuple]\n */"} {"signature":"private fun addTuples ( groupSize : Int , value : Int , listSize : Int , skipDimension : Int , ) : List < Tuple2 < Int , Int > >","body":"{ fun recursiveCall ( currentDimension : Int = , indexTuple : List < Int > = emptyList ( ) , ) : List < Tuple2 < Int , Int > > = when { currentDimension >= groupSize -> if ( isValidIndexTuple ( indexTuple ) ) listOf ( getTupleValue ( indexTuple , listSize ) X value ) else emptyList ( ) currentDimension == skipDimension -> recursiveCall ( currentDimension = currentDimension + , indexTuple = indexTuple + value , ) else -> ( until listSize ) . flatMap { i -> recursiveCall ( currentDimension = currentDimension + , indexTuple = indexTuple + i , ) } } return recursiveCall ( ) }","docstring":"/**\n * Recursive method that for [skipDimension] loops over all the other dimensions and returns all results from\n * [getTupleValue] as key and [value] as value.\n * In the end, the return value will have, for each key in the table below, a value for the key's column, row etc.\n *\n *\n * This is an example for 2D. The letters will be int indices as well (a = 0, b = 1, ..., [listSize]), but help for clarification.\n * The numbers we don't want are filtered out using [isValidIndexTuple].\n * The actual value of the number in the table comes from [getTupleValue].\n *\n *\n *\n *\n * - a b c d e f g h i j\n * --------------------------------\n * a| - 1 2 3 4 5 6 7 8 9\n * b| - - 12 13 14 15 16 17 18 19\n * c| - - - 23 24 25 26 27 28 29\n * d| - - - - 34 35 36 37 38 39\n * e| - - - - - 45 46 47 48 49\n * f| - - - - - - 56 57 58 59\n * g| - - - - - - - 67 68 69\n * h| - - - - - - - - 78 79\n * i| - - - - - - - - - 89\n * j| - - - - - - - - - -\n *\n *\n * @param groupSize the size of index tuples to form\n * @param value the current index to work from (can be seen as a letter in the table above)\n * @param listSize the size of the list to make\n * @param skipDimension the current dimension that will have a set value [value] while looping over the other dimensions\n */"} {"signature":"fun clearSourceDependency ( )","body":"{ _builder . clearSourceDependency ( ) }","docstring":"/**\n * .org.jetbrains.kotlin.gradle.idea.proto.generated.tcs.IdeaKotlinSourceDependencyProto source_dependency = 1;\n */"} {"signature":"fun hasSourceDependency ( ) : kotlin . Boolean","body":"{ return _builder . hasSourceDependency ( ) }","docstring":"/**\n * .org.jetbrains.kotlin.gradle.idea.proto.generated.tcs.IdeaKotlinSourceDependencyProto source_dependency = 1;\n * @return Whether the sourceDependency field is set.\n */"} {"signature":"fun clearResolvedBinaryDependency ( )","body":"{ _builder . clearResolvedBinaryDependency ( ) }","docstring":"/**\n * .org.jetbrains.kotlin.gradle.idea.proto.generated.tcs.IdeaKotlinResolvedBinaryDependencyProto resolved_binary_dependency = 2;\n */"} {"signature":"fun hasResolvedBinaryDependency ( ) : kotlin . Boolean","body":"{ return _builder . hasResolvedBinaryDependency ( ) }","docstring":"/**\n * .org.jetbrains.kotlin.gradle.idea.proto.generated.tcs.IdeaKotlinResolvedBinaryDependencyProto resolved_binary_dependency = 2;\n * @return Whether the resolvedBinaryDependency field is set.\n */"} {"signature":"fun clearUnresolvedBinaryDependency ( )","body":"{ _builder . clearUnresolvedBinaryDependency ( ) }","docstring":"/**\n * .org.jetbrains.kotlin.gradle.idea.proto.generated.tcs.IdeaKotlinUnresolvedBinaryDependencyProto unresolved_binary_dependency = 3;\n */"} {"signature":"fun hasUnresolvedBinaryDependency ( ) : kotlin . Boolean","body":"{ return _builder . hasUnresolvedBinaryDependency ( ) }","docstring":"/**\n * .org.jetbrains.kotlin.gradle.idea.proto.generated.tcs.IdeaKotlinUnresolvedBinaryDependencyProto unresolved_binary_dependency = 3;\n * @return Whether the unresolvedBinaryDependency field is set.\n */"} {"signature":"fun clearProjectArtifactDependency ( )","body":"{ _builder . clearProjectArtifactDependency ( ) }","docstring":"/**\n * .org.jetbrains.kotlin.gradle.idea.proto.generated.tcs.IdeaKotlinProjectArtifactDependencyProto project_artifact_dependency = 4;\n */"} {"signature":"fun hasProjectArtifactDependency ( ) : kotlin . Boolean","body":"{ return _builder . hasProjectArtifactDependency ( ) }","docstring":"/**\n * .org.jetbrains.kotlin.gradle.idea.proto.generated.tcs.IdeaKotlinProjectArtifactDependencyProto project_artifact_dependency = 4;\n * @return Whether the projectArtifactDependency field is set.\n */"} {"signature":"public actual fun String ? . toBoolean ( ) : Boolean","body":"= this != null && this . lowercase ( ) == \"\"","docstring":"/**\n * Returns `true` if the contents of this string 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 actual fun String . toByte ( ) : Byte","body":"= toByteOrNull ( ) ? : numberFormatError ( this )","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 actual fun String . toByte ( radix : Int ) : Byte","body":"= toByteOrNull ( radix ) ? : numberFormatError ( this )","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 actual fun String . toShort ( ) : Short","body":"= toShortOrNull ( ) ? : numberFormatError ( this )","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 actual fun String . toShort ( radix : Int ) : Short","body":"= toShortOrNull ( radix ) ? : numberFormatError ( this )","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 actual fun String . toInt ( ) : Int","body":"= toIntOrNull ( ) ? : numberFormatError ( this )","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 actual fun String . toInt ( radix : Int ) : Int","body":"= toIntOrNull ( radix ) ? : numberFormatError ( this )","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 actual fun String . toLong ( ) : Long","body":"= toLongOrNull ( ) ? : numberFormatError ( this )","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 actual fun String . toLong ( radix : Int ) : Long","body":"= toLongOrNull ( radix ) ? : numberFormatError ( this )","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 actual fun String . toDouble ( ) : Double","body":"= kotlin . text . parseDouble ( this )","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 actual fun String . toFloat ( ) : Float","body":"= wasm_f32_demote_f64 ( toDouble ( ) )","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 actual fun String . toFloatOrNull ( ) : Float ?","body":"= toDoubleOrNull ( ) ? . let { wasm_f32_demote_f64 ( it ) }","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":"public actual fun String . toDoubleOrNull ( ) : Double ?","body":"{ try { return toDouble ( ) } catch ( e : NumberFormatException ) { return null } }","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":"@ SinceKotlin ( \"\" ) public actual fun Byte . toString ( radix : Int ) : String","body":"= this . toInt ( ) . toString ( radix )","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 actual fun Short . toString ( radix : Int ) : String","body":"= this . toInt ( ) . toString ( radix )","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 actual fun Int . toString ( radix : Int ) : String","body":"{ val isNegative = this < val absValue = if ( isNegative ) - this else this val absValueString = uintToString ( absValue , checkRadix ( radix ) ) return if ( isNegative ) \"\" else absValueString }","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 actual fun Long . toString ( radix : Int ) : String","body":"{ val isNegative = this < val absValue = if ( isNegative ) - this else this val absValueString = ulongToString ( absValue , checkRadix ( radix ) ) return if ( isNegative ) \"\" else absValueString }","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":"protected fun addToClassStorage ( classProtoData : ClassProtoData , srcFile : File ? )","body":"{ val ( proto , nameResolver ) = classProtoData val supertypes = proto . supertypes ( TypeTable ( proto . typeTable ) ) val parents = supertypes . map { nameResolver . getClassId ( it . className ) . asSingleFqName ( ) } . filter { it . asString ( ) != \"\" } . toSet ( ) val child = nameResolver . getClassId ( proto . fqName ) . asSingleFqName ( ) parents . forEach { subtypesMap . append ( it , child ) } val removedSupertypes = supertypesMap [ child ] . orEmpty ( ) . filter { it !in parents } removedSupertypes . forEach { subtypesMap . removeValues ( it , setOf ( child ) ) } supertypesMap [ child ] = parents srcFile ? . let { classFqNameToSourceMap [ child ] = it } classAttributesMap [ child ] = ICClassesAttributes ( ProtoBuf . Modality . SEALED == Flags . MODALITY . get ( proto . flags ) ) }","docstring":"/**\n * Updates class storage based on the given class proto.\n *\n * The `srcFile` argument may be `null` (e.g., if we are processing .class files in jars where source files are not available).\n */"} {"signature":"fun clearGroup ( )","body":"{ _builder . clearGroup ( ) }","docstring":"/**\n * optional string group = 1;\n */"} {"signature":"fun hasGroup ( ) : kotlin . Boolean","body":"{ return _builder . hasGroup ( ) }","docstring":"/**\n * optional string group = 1;\n * @return Whether the group field is set.\n */"} {"signature":"fun clearName ( )","body":"{ _builder . clearName ( ) }","docstring":"/**\n * optional string name = 2;\n */"} {"signature":"fun hasName ( ) : kotlin . Boolean","body":"{ return _builder . hasName ( ) }","docstring":"/**\n * optional string name = 2;\n * @return Whether the name field is set.\n */"} {"signature":"fun clearVersion ( )","body":"{ _builder . clearVersion ( ) }","docstring":"/**\n * optional string version = 3;\n */"} {"signature":"fun hasVersion ( ) : kotlin . Boolean","body":"{ return _builder . hasVersion ( ) }","docstring":"/**\n * optional string version = 3;\n * @return Whether the version field is set.\n */"} {"signature":"@ OptIn ( DelicateCoroutinesApi :: class , ExperimentalCoroutinesApi :: class ) override fun translateClassDescriptor ( descriptor : ClassDescriptor , sourceSet : DokkaSourceSet ) : DClasslike","body":"{ val driInfo = DRI . from ( descriptor . parents . first ( ) ) . withEmptyInfo ( ) val javadocParser = if ( sourceSet . analysisPlatform == Platform . jvm ) JavadocParser ( docCommentParsers = context . plugin < JavaAnalysisPlugin > ( ) . query { docCommentParsers } , docCommentFinder = context . plugin < JavaAnalysisPlugin > ( ) . docCommentFinder ) else null return newSingleThreadContext ( \"\" ) . use { coroutineContext -> runBlocking ( coroutineContext ) { DokkaDescriptorVisitor ( sourceSet , kdocFinder , kotlinAnalysis [ sourceSet ] , context . logger , javadocParser ) . visitClassDescriptor ( descriptor , driInfo ) } } }","docstring":"/**\n * Implementation note: it runs in a separated single thread due to existing support of coroutines (see #2936)\n */"} {"signature":"private suspend fun visitPropertyDescriptor ( originalDescriptor : PropertyDescriptor , implicitAccessors : DescriptorAccessorHolder ? , parent : DRIWithPlatformInfo ) : DProperty","body":"{ val ( dri , _ ) = originalDescriptor . createDRI ( ) val inheritedFrom = dri . getInheritedFromDRI ( parent ) val descriptor = originalDescriptor . getConcreteDescriptor ( ) val isExpect = descriptor . isExpect val isActual = descriptor . isActual val actual = originalDescriptor . createSources ( ) suspend fun getDescriptorGetter ( ) = descriptor . accessors . firstIsInstanceOrNull < PropertyGetterDescriptor > ( ) ? . let { visitPropertyAccessorDescriptor ( it , descriptor , dri , inheritedFrom ) } suspend fun getImplicitAccessorGetter ( ) = implicitAccessors ? . getter ? . let { visitFunctionDescriptor ( it , parent ) } suspend fun getDescriptorSetter ( ) = descriptor . accessors . firstIsInstanceOrNull < PropertySetterDescriptor > ( ) ? . let { visitPropertyAccessorDescriptor ( it , descriptor , dri , inheritedFrom ) } suspend fun getImplicitAccessorSetter ( ) = implicitAccessors ? . setter ? . let { visitFunctionDescriptor ( it , parent ) } return coroutineScope { val generics = async { descriptor . typeParameters . parallelMap { it . toVariantTypeParameter ( ) } } val getter = getDescriptorGetter ( ) ? : getImplicitAccessorGetter ( ) val setter = getDescriptorSetter ( ) ? : getImplicitAccessorSetter ( ) DProperty ( dri = dri , name = descriptor . name . asString ( ) , receiver = descriptor . extensionReceiverParameter ? . let { visitReceiverParameterDescriptor ( it , DRIWithPlatformInfo ( dri , actual ) ) } , sources = actual , getter = getter , setter = setter , visibility = descriptor . getVisibility ( implicitAccessors ) . toSourceSetDependent ( ) , documentation = descriptor . getDocumentation ( ) , modifier = descriptor . modifier ( ) . toSourceSetDependent ( ) , type = descriptor . returnType ! ! . toBound ( ) , expectPresentInSet = sourceSet . takeIf { isExpect } , sourceSets = setOf ( sourceSet ) , generics = generics . await ( ) , isExpectActual = ( isExpect || isActual ) , extra = PropertyContainer . withAll ( listOfNotNull ( ( descriptor . additionalExtras ( ) + descriptor . getAnnotationsWithBackingField ( ) . toAdditionalExtras ( ) ) . toSet ( ) . toSourceSetDependent ( ) . toAdditionalModifiers ( ) , ( descriptor . getAnnotationsWithBackingField ( ) + descriptor . fileLevelAnnotations ( ) ) . toSourceSetDependent ( ) . toAnnotations ( ) , descriptor . getDefaultValue ( ) ? . let { DefaultValue ( it . toSourceSetDependent ( ) ) } , inheritedFrom ? . let { InheritedMember ( it . toSourceSetDependent ( ) ) } , takeIf { descriptor . isVar ( getter , setter ) } ? . let { IsVar } , takeIf { descriptor . findPsi ( ) is KtParameter } ? . let { IsAlsoParameter ( listOf ( sourceSet ) ) } ) ) ) } }","docstring":"/**\n * @param implicitAccessors getters/setters that are not part of the property descriptor, for instance\n * average methods inherited from java sources that access the property\n */"} {"signature":"private fun DRI . getInheritedFromDRI ( parent : DRIWithPlatformInfo ) : DRI ?","body":"{ return this . copy ( callable = null ) . takeIf { parent . dri . classNames != this . classNames || parent . dri . packageName != this . packageName } }","docstring":"/**\n * `createDRI` returns the DRI of the exact element and potential DRI of an element that is overriding it\n * (It can be also FAKE_OVERRIDE which is in fact just inheritance of the symbol)\n *\n * Looking at what PSIs do, they give the DRI of the element within the classnames where it is actually\n * declared and inheritedFrom as the same DRI but truncated callable part.\n * Therefore, we set callable to null and take the DRI only if it is indeed coming from different class.\n */"} {"signature":"private fun SourceSetDependent < DocumentationNode > . mapInheritedTagWrappers ( ) : SourceSetDependent < DocumentationNode >","body":"{ return this . mapValues { ( _ , value ) -> val mappedChildren = value . children . map { when ( it ) { is Property -> Description ( it . root ) else -> it } } value . copy ( children = mappedChildren ) } }","docstring":"/**\n * Workaround for a problem with inheriting parent TagWrappers of the wrong type.\n *\n * For instance, if you annotate a class with `@property`, kotlin compiler will propagate\n * this tag to the property and its getters and setters. In case of getters and setters,\n * it's more correct to display propagated docs as description instead of property\n */"} {"signature":"fun < T > run ( block : suspend NodeJsInspectorClientContext . ( ) -> T ) : T","body":"= runBlocking { val context = NodeJsInspectorClientContextImpl ( this @ NodeJsInspectorClient ) try { runWithContext ( context , block ) } catch ( e : Throwable ) { val nodeExitCode = try { context . nodeProcess . exitValue ( ) } catch ( _ : IllegalThreadStateException ) { throw e } throw NodeExitedException ( nodeExitCode , e ) } finally { context . release ( ) } }","docstring":"/**\n * Creates a Node process and provides a context for communicating with it.\n * After [block] returns, the Node process is destroyed.\n */"} {"signature":"fun onEvent ( receiveEvent : ( CDPEvent ) -> Unit )","body":"{ onDebuggerEventCallback = receiveEvent }","docstring":"/**\n * Installs a listener for Chrome DevTools Protocol events.\n */"} {"signature":"suspend fun listenForMessages ( receiveMessage : ( String ) -> Boolean )","body":"{ val session = webSocketSession ? : error ( \"\" ) do { val message = when ( val frame = session . incoming . receive ( ) ) { is Frame . Text -> frame . readText ( ) else -> error ( \"\" ) } logger . finer { \"\" } } while ( ! receiveMessage ( message ) ) }","docstring":"/**\n * Starts a loop that waits for incoming Chrome DevTools Protocol messages and invokes [receiveMessage] when one is received.\n * The loop stops as soon as at least one message is received *and* [receiveMessage] returns `true`.\n */"} {"signature":"suspend fun release ( )","body":"{ logger . fine { \"\" } webSocketSession ? . close ( ) webSocketSession = null webSocketClient . close ( ) nodeProcess . destroy ( ) }","docstring":"/**\n * Releases all the resources and destroys the Node.js process.\n */"} {"signature":"public actual fun < T > MutableList < T > . reverse ( ) : Unit","body":"{ val midPoint = ( size / ) - if ( midPoint < ) return var reverseIndex = lastIndex for ( index in .. midPoint ) { val tmp = this [ index ] this [ index ] = this [ reverseIndex ] this [ reverseIndex ] = tmp reverseIndex -- } }","docstring":"/**\n * Reverses elements in the list in-place.\n */"} {"signature":"@ ExperimentalPathApi @ SinceKotlin ( \"\" ) public fun Path . copyToRecursively ( target : Path , onError : ( source : Path , target : Path , exception : Exception ) -> OnErrorResult = { _ , _ , exception -> throw exception } , followLinks : Boolean , overwrite : Boolean ) : Path","body":"{ return if ( overwrite ) { copyToRecursively ( target , onError , followLinks ) { src , dst -> val options = LinkFollowing . toLinkOptions ( followLinks ) val dstIsDirectory = dst . isDirectory ( LinkOption . NOFOLLOW_LINKS ) val srcIsDirectory = src . isDirectory ( * options ) if ( ( srcIsDirectory && dstIsDirectory ) . not ( ) ) { if ( dstIsDirectory ) dst . deleteRecursively ( ) src . copyTo ( dst , * options , StandardCopyOption . REPLACE_EXISTING ) } CopyActionResult . CONTINUE } } else { copyToRecursively ( target , onError , followLinks ) } }","docstring":"/**\n * Recursively copies this directory and its content to the specified destination [target] path.\n * Note that if this function throws, partial copying may have taken place.\n *\n * Unlike `File.copyRecursively`, if some directories on the way to the [target] are missing, then they won't be created automatically.\n * You can use the [createParentDirectories] function to ensure that required intermediate directories are created:\n * ```\n * sourcePath.copyToRecursively(\n * destinationPath.createParentDirectories(),\n * followLinks = false\n * )\n * ```\n *\n * If the entry located by this path is a directory, this function recursively copies the directory itself and its content.\n * Otherwise, this function copies only the entry.\n *\n * If an exception occurs attempting to read, open or copy any entry under the source subtree,\n * further actions will depend on the result of the [onError] invoked with\n * the source and destination paths, that caused the error, and the exception itself as arguments.\n * If [onError] throws, this function ends immediately with the exception.\n * By default [onError] rethrows the exception. See [OnErrorResult] for available options.\n *\n * This function performs \"directory merge\" operation. If an entry in the source subtree is a directory\n * and the corresponding entry in the target subtree already exists and is also a directory, it does nothing.\n * Otherwise, [overwrite] determines whether to overwrite existing destination entries.\n * Attributes of a source entry, such as creation/modification date, are not copied.\n *\n * [followLinks] impacts only symbolic links in the source subtree and\n * determines whether to copy a symbolic link itself or the entry it points to.\n * Symbolic links in the target subtree are not followed, i.e.,\n * no entry is copied to the location a symbolic link points to.\n * If a copy destination is a symbolic link, it is overwritten or an exception is thrown depending on [overwrite].\n * Note that symbolic links on the way to the roots of the source and target subtrees are always followed.\n *\n * To provide a custom logic for copying use the overload that takes a `copyAction` lambda.\n *\n * @param target the destination path to copy recursively this entry to.\n * @param onError the function that determines further actions if an error occurs. By default, rethrows the exception.\n * @param followLinks `false` to copy a symbolic link itself, not its target.\n * `true` to recursively copy the target of a symbolic link.\n * @param overwrite `false` to throw if a destination entry already exists.\n * `true` to overwrite existing destination entries.\n * @throws NoSuchFileException if the entry located by this path does not exist.\n * @throws FileSystemException if [target] is an entry inside the source subtree.\n * @throws FileAlreadyExistsException if a destination entry already exists and [overwrite] is `false`.\n * This exception is passed to [onError] for handling.\n * @throws IOException if any errors occur while copying.\n * This exception is passed to [onError] for handling.\n * @throws FileSystemException if the source subtree contains an entry with an illegal name such as \".\" or \"..\".\n * This exception is passed to [onError] for handling.\n * @throws FileSystemLoopException if the recursive copy reaches a cycle.\n * This exception is passed to [onError] for handling.\n * @throws SecurityException if a security manager is installed and access is not permitted to an entry in the source or target subtree.\n * This exception is passed to [onError] for handling.\n */"} {"signature":"@ ExperimentalPathApi @ SinceKotlin ( \"\" ) public fun Path . copyToRecursively ( target : Path , onError : ( source : Path , target : Path , exception : Exception ) -> OnErrorResult = { _ , _ , exception -> throw exception } , followLinks : Boolean , copyAction : CopyActionContext . ( source : Path , target : Path ) -> CopyActionResult = { src , dst -> src . copyToIgnoringExistingDirectory ( dst , followLinks ) } ) : Path","body":"{ if ( ! this . exists ( * LinkFollowing . toLinkOptions ( followLinks ) ) ) throw NoSuchFileException ( this . toString ( ) , target . toString ( ) , \"\" ) if ( this . exists ( ) && ( followLinks || ! this . isSymbolicLink ( ) ) ) { val targetExistsAndNotSymlink = target . exists ( ) && ! target . isSymbolicLink ( ) if ( targetExistsAndNotSymlink && this . isSameFileAs ( target ) ) { } else { val isSubdirectory = when { this . fileSystem != target . fileSystem -> false targetExistsAndNotSymlink -> target . toRealPath ( ) . startsWith ( this . toRealPath ( ) ) else -> target . parent ? . let { it . exists ( ) && it . toRealPath ( ) . startsWith ( this . toRealPath ( ) ) } ? : false } if ( isSubdirectory ) throw FileSystemException ( this . toString ( ) , target . toString ( ) , \"\" ) } } val normalizedTarget = target . normalize ( ) fun destination ( source : Path ) : Path { val relativePath = source . relativeTo ( this @ copyToRecursively ) val destination = target . resolve ( relativePath . pathString ) if ( ! destination . normalize ( ) . startsWith ( normalizedTarget ) ) { throw IllegalFileNameException ( source , destination , \"\" ) } return destination } fun error ( source : Path , exception : Exception ) : FileVisitResult { return onError ( source , destination ( source ) , exception ) . toFileVisitResult ( ) } val stack = arrayListOf < Path > ( ) @ Suppress ( \"\" ) fun copy ( source : Path , attributes : BasicFileAttributes ) : FileVisitResult { return try { if ( stack . isNotEmpty ( ) ) { source . checkFileName ( ) source . checkNotSameAs ( stack . last ( ) ) } DefaultCopyActionContext . copyAction ( source , destination ( source ) ) . toFileVisitResult ( ) } catch ( exception : Exception ) { error ( source , exception ) } } visitFileTree ( followLinks = followLinks ) { onPreVisitDirectory { directory , attributes -> copy ( directory , attributes ) . also { if ( it == FileVisitResult . CONTINUE ) stack . add ( directory ) } } onVisitFile ( :: copy ) onVisitFileFailed ( :: error ) onPostVisitDirectory { directory , exception -> stack . removeLast ( ) if ( exception == null ) { FileVisitResult . CONTINUE } else { error ( directory , exception ) } } } return target }","docstring":"/**\n * Recursively copies this directory and its content to the specified destination [target] path.\n * Note that if this function throws, partial copying may have taken place.\n *\n * Unlike `File.copyRecursively`, if some directories on the way to the [target] are missing, then they won't be created automatically.\n * You can use the [createParentDirectories] function to ensure that required intermediate directories are created:\n * ```\n * sourcePath.copyToRecursively(\n * destinationPath.createParentDirectories(),\n * followLinks = false\n * )\n * ```\n *\n * If the entry located by this path is a directory, this function recursively copies the directory itself and its content.\n * Otherwise, this function copies only the entry.\n *\n * If an exception occurs attempting to read, open or copy any entry under the source subtree,\n * further actions will depend on the result of the [onError] invoked with\n * the source and destination paths, that caused the error, and the exception itself as arguments.\n * If [onError] throws, this function ends immediately with the exception.\n * By default [onError] rethrows the exception. See [OnErrorResult] for available options.\n *\n * Copy operation is performed using [copyAction].\n * By default [copyAction] performs \"directory merge\" operation. If an entry in the source subtree is a directory\n * and the corresponding entry in the target subtree already exists and is also a directory, it does nothing.\n * Otherwise, the entry is copied using `sourcePath.copyTo(destinationPath, *followLinksOption)`,\n * which doesn't copy attributes of the source entry and throws if the destination entry already exists.\n *\n * [followLinks] impacts only symbolic links in the source subtree and\n * determines whether to copy a symbolic link itself or the entry it points to.\n * Symbolic links in the target subtree are not followed, i.e.,\n * no entry is copied to the location a symbolic link points to.\n * If a copy destination is a symbolic link, an exception is thrown.\n * Note that symbolic links on the way to the roots of the source and target subtrees are always followed.\n *\n * If a custom implementation of [copyAction] is provided, consider making it consistent with [followLinks] value.\n * See [CopyActionResult] for available options.\n *\n * If [copyAction] throws an exception, it is passed to [onError] for handling.\n *\n * @param target the destination path to copy recursively this entry to.\n * @param onError the function that determines further actions if an error occurs. By default, rethrows the exception.\n * @param followLinks `false` to copy a symbolic link itself, not its target.\n * `true` to recursively copy the target of a symbolic link.\n * @param copyAction the function to call for copying source entries to their destination path rooted in [target].\n * By default, performs \"directory merge\" operation.\n * @throws NoSuchFileException if the entry located by this path does not exist.\n * @throws FileSystemException if [target] is an entry inside the source subtree.\n * @throws IOException if any errors occur while copying.\n * This exception is passed to [onError] for handling.\n * @throws FileSystemException if the source subtree contains an entry with an illegal name such as \".\" or \"..\".\n * This exception is passed to [onError] for handling.\n * @throws FileSystemLoopException if the recursive copy reaches a cycle.\n * This exception is passed to [onError] for handling.\n * @throws SecurityException if a security manager is installed and access is not permitted to an entry in the source or target subtree.\n * This exception is passed to [onError] for handling.\n */"} {"signature":"@ ExperimentalPathApi @ SinceKotlin ( \"\" ) public fun Path . deleteRecursively ( ) : Unit","body":"{ val suppressedExceptions = this . deleteRecursivelyImpl ( ) if ( suppressedExceptions . isNotEmpty ( ) ) { throw FileSystemException ( \"\" ) . apply { suppressedExceptions . forEach { addSuppressed ( it ) } } } }","docstring":"/**\n * Recursively deletes this directory and its content.\n * Note that if this function throws, partial deletion may have taken place.\n *\n * If the entry located by this path is a directory, this function recursively deletes its content and the directory itself.\n * Otherwise, this function deletes only the entry.\n * Symbolic links are not followed to their targets.\n * This function does nothing if the entry located by this path does not exist.\n *\n * If the underlying platform supports [SecureDirectoryStream],\n * traversal of the file tree and removal of entries are performed using it.\n * Otherwise, directories in the file tree are opened with the less secure [Files.newDirectoryStream].\n * Note that on a platform that supports symbolic links and does not support [SecureDirectoryStream],\n * it is possible for a recursive delete to delete files and directories that are outside the directory being deleted.\n * This can happen if, after checking that an entry is a directory (and not a symbolic link), that directory is replaced\n * by a symbolic link to an outside directory before the call that opens the directory to read its entries.\n *\n * If an exception occurs attempting to read, open or delete any entry under the given file tree,\n * this method skips that entry and continues. Such exceptions are collected and, after attempting to delete all entries,\n * an [IOException] is thrown containing those exceptions as suppressed exceptions.\n * Maximum of `64` exceptions are collected. After reaching that amount, thrown exceptions are ignored and not collected.\n *\n * @throws IOException if any entry in the file tree can't be deleted for any reason.\n */"} {"signature":"internal fun Path . checkFileName ( )","body":"{ val fileName = this . name if ( fileName == \"\" || fileName == \"\" || fileName == \"\" || fileName == \"\" || fileName == \"\" || fileName == \"\" ) throw IllegalFileNameException ( this ) }","docstring":"/**\n * Checks whether the name of this file is legal for traversal to prevent cycles.\n *\n * Some names are considered illegal as they may cause traversal cycles.\n * This function is intended for use with entries whose parent directories have already been traversed.\n * The file being checked is not the starting point of traversal.\n *\n * For instance, \"/a/b/..\" is a valid starting path for traversal. However, if traversal begins from \"/a\"\n * and reaches \"a/b/..\", it will result in a cycle.\n *\n * @throws IllegalFileNameException if the file name is \"..\", \"../\", , \"..\\\", \".\", \"./\", or \".\\\" since these may lead to traversal cycles.\n *\n * See KT-63103 for more details on the issue.\n */"} {"signature":"private fun Path . checkNotSameAs ( parent : Path )","body":"{ if ( ! isSymbolicLink ( ) && isSameFileAs ( parent ) ) throw FileSystemLoopException ( this . toString ( ) ) }","docstring":"/**\n * Checks that this entry is not the same as the specified [parent] path to prevent traversal cycles.\n *\n * When reading entries of a directory, there are cases where the directory itself is returned,\n * such as when a zip entry name is '/'. Including the directory itself in the list of its entries can lead to traversal cycles.\n *\n * Unfortunately, [Files.walkFileTree], utilized in [copyToRecursively], may not detect such cycles when links are not followed.\n * Similarly, [deleteRecursively] lacks cycle detection capabilities as it never follows links.\n *\n * This function is intended for use with entries whose parent directories have already been traversed.\n * The file being checked is not the starting point of traversal.\n *\n * For instance, \"/a/b/..\" is a valid starting path for traversal. However, if traversal begins from \"/a\"\n * and reaches \"a/b/..\", it will result in a cycle.\n *\n * @throws FileSystemLoopException if this entry is the same as the [parent] path, indicating a potential traversal cycle.\n *\n * See KT-63103 for more details on the issue.\n */"} {"signature":"private fun IrBlockBuilder . createSimpleBucketSelectors ( stringConstantToMatchedCase : Map < String ? , MatchedCase > , buckets : Map < Int , List < String ? > > , transformedWhen : IrWhen , ) : List < BucketSelector >","body":"= buckets . entries . map { bucket -> val selector = if ( bucket . value . size == ) { val bucketCase = bucket . value [ ] val matchedCase = stringConstantToMatchedCase . getValue ( bucketCase ) irIfThen ( type = transformedWhen . type , condition = matchedCase . condition , thenPart = transformedWhen . branches [ matchedCase . branchIndex ] . result , ) } else { val bucketBranches = mutableListOf < IrBranch > ( ) bucket . value . mapTo ( bucketBranches ) { bucketCase -> val matchedCase = stringConstantToMatchedCase . getValue ( bucketCase ) irBranch ( matchedCase . condition , transformedWhen . branches [ matchedCase . branchIndex ] . result ) } irWhen ( transformedWhen . type , bucketBranches ) } BucketSelector ( bucket . key , selector ) }","docstring":"/**\n * Create simple 1-element buckets (for when without else block and commas)\n * when(a) {\n * \"123\" -> 123\n * \"456\" -> 456\n * \"789\" -> 789\n * }\n * into the integer when's collections of\n * 48690 -> if(a == \"123\") -> 123\n * 51669 -> if(a == \"456\") -> 456\n * 54648 -> if(a == \"789\") -> 789\n */"} {"signature":"private fun IrBlockBuilder . createBucketSelectors ( stringConstantToMatchedCase : Map < String ? , MatchedCase > , buckets : Map < Int , List < String ? > > , elseBranchIndex : Int , ) : List < BucketSelector >","body":"= buckets . entries . map { bucket -> val selector = if ( bucket . value . size == ) { val bucketCase = bucket . value [ ] val matchedCase = stringConstantToMatchedCase . getValue ( bucketCase ) irIfThenElse ( type = intType , condition = matchedCase . condition , thenPart = matchedCase . branchIndex . toIrConst ( intType ) , elsePart = elseBranchIndex . toIrConst ( intType ) ) } else { val bucketBranches = mutableListOf < IrBranch > ( ) bucket . value . mapTo ( bucketBranches ) { bucketCase -> val matchedCase = stringConstantToMatchedCase . getValue ( bucketCase ) irBranch ( matchedCase . condition , matchedCase . branchIndex . toIrConst ( intType ) ) } bucketBranches . add ( irElseBranch ( elseBranchIndex . toIrConst ( intType ) ) ) irWhen ( intType , bucketBranches ) } BucketSelector ( bucket . key , selector ) }","docstring":"/**\n * Create multi-element buckets for every hashCode\n * 48690 -> when(a) {\n * \"123\" -> 0\n * \"ARcZguv123\" -> 1\n * else -> 3\n * }\n * 51669 -> when(a) {\n * \"456\" -> 0\n * else -> 3\n * }\n * 54648 -> when(a) {\n * \"789\" -> 1\n * else -> 3\n * }\n * else -> 3\n */"} {"signature":"fun valueDescription ( value : TResult ? )","body":"= value ? . let { if ( it is List < * > && it . isNotEmpty ( ) ) \"\" else if ( it !is List < * > ) \"\" else null }","docstring":"/**\n * Provide text description of value.\n *\n * @param value value got getting text description for.\n */"} {"signature":"public fun CV < * > . createPreprocessing ( model : InferenceModel < * > ) : Operation < BufferedImage , FloatData >","body":"{ return createPreprocessing ( model , channelsFirst , inputColorMode , preprocessor ) }","docstring":"/**\n * Creates a preprocessing [Operation] which converts given [BufferedImage] to [FloatData] suitable for this [model].\n */"} {"signature":"public fun CVnoTop < * > . createPreprocessing ( model : InferenceModel < * > ) : Operation < BufferedImage , FloatData >","body":"{ return createPreprocessing ( model , baseModelType . channelsFirst , baseModelType . inputColorMode , preprocessor ) }","docstring":"/**\n * Creates a preprocessing [Operation] which converts given [BufferedImage] to [FloatData] suitable for this [model].\n */"} {"signature":"private fun TaskProvider < CheckKotlinGradlePluginConfigurationErrors > . addDependsOnFromTasksThatShouldFailWhenErrorsReported ( tasks : TaskContainer )","body":"{ tasks . withType < KotlinCompileTool > ( ) . configureEach { it . dependsOn ( this ) } }","docstring":"/**\n * Adds dependsOn from some selection of the [tasks] to the [this]-task, effectively causing them to fail\n * if the ERROR-diagnostics were reported.\n *\n * Currently, we're doing it conservatively and instrumenting only [KotlinCompileTool]-tasks.\n * The intuition here is that if the build manages to do something useful for a user without compiling any .kt-sources,\n * then it's OK for KGP to let that build pass even if it reported ERROR-diagnostics.\n */"} {"signature":"fun fromString ( tripleString : String ) : TargetTriple","body":"{ val components = tripleString . split ( '' ) require ( components . size == || components . size == ) { \"\" } return TargetTriple ( architecture = components [ ] , vendor = components [ ] , os = components [ ] , environment = components . getOrNull ( ) ) }","docstring":"/**\n * Parse --- [tripleString].\n *\n * TODO: Support normalization like LLVM's Triple::normalize.\n */"} {"signature":"fun TargetTriple . withOSVersion ( osVersion : String ) : TargetTriple","body":"= copy ( os = \"\" )","docstring":"/**\n * Appends version to OS part of triple.\n *\n * Useful for precise target specification in Clang and Swift.\n */"} {"signature":"fun TargetTriple . withoutVendor ( ) : String","body":"{ val envSuffix = environment ? . let { \"\" } ? : \"\" return \"\" }","docstring":"/**\n * Triple without vendor (second) component.\n *\n * TODO: Actually, this method should return [TargetTriple],\n * but this class is not that flexible yet.\n */"} {"signature":"fun vgg19prediction ( )","body":"{ val modelHub = TFModelHub ( cacheDirectory = File ( \"\" ) ) val modelType = TFModels . CV . VGG19 ( ) val model = modelHub . loadModel ( modelType ) val imageNetClassLabels = modelHub . loadClassLabels ( ) model . use { it . compile ( optimizer = Adam ( ) , loss = Losses . MAE , metric = Metrics . ACCURACY ) it . logSummary ( ) val hdfFile = modelHub . loadWeights ( modelType ) it . loadWeights ( hdfFile ) val fileDataLoader = modelType . createPreprocessing ( it ) . fileLoader ( ) for ( i in .. ) { val inputData = fileDataLoader . load ( getFileFromResource ( \"\" ) ) val res = it . predictLabel ( inputData ) println ( \"\" ) val top5 = it . predictTop5Labels ( inputData , imageNetClassLabels ) println ( top5 . toString ( ) ) } } }","docstring":"/**\n * This example demonstrates the inference concept on VGG'19 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 VGG'19 during training on ImageNet dataset) is applied to each image before prediction.\n * - No additional training.\n * - No new layers are added.\n *\n * @see \n * Very Deep Convolutional Networks for Large-Scale Image Recognition (ICLR 2015).\n * @see \n * Detailed description of VGG'19 model and an approach to build it in Keras.\n */"} {"signature":"fun main ( ) : Unit","body":"= vgg19prediction ( )","docstring":"/** */"} {"signature":"@ Test fun test3360 ( )","body":"{ val str = \"\" val regex = Regex ( \"\" ) assertFalse ( regex . containsMatchIn ( str ) ) }","docstring":"/**\n * Inspired by HARMONY-3360\n */"} {"signature":"@ Test fun testGeneralPunctuationCategory ( )","body":"{ val s = arrayOf ( \"\" , \"\" , \"\" , \"\" , \"\" , \"\" , \"\" , \"\" , \"\" , \"\" , \"\" , \"\" ) val regexp = \"\" for ( i in s . indices ) { val regex = Regex ( regexp ) assertTrue ( regex . containsMatchIn ( s [ i ] ) ) } }","docstring":"/**\n * Regression test for HARMONY-3360\n */"} {"signature":"@ Test fun test2297 ( )","body":"{ fun testMatches ( pattern : String , input : String ) { assertTrue ( Regex ( pattern ) . matches ( input ) , \"\" ) } testMatches ( \"\" , input = \"\" ) testMatches ( \"\" , input = \"\" ) testMatches ( \"\" , input = \"\" ) testMatches ( \"\" , input = \"\" ) testMatches ( \"\" , input = \"\" ) testMatches ( \"\" , input = \"\" ) testMatches ( \"\" , input = \"\" ) testMatches ( \"\" , input = \"\" ) testMatches ( \"\" , input = \"\" ) testMatches ( \"\" , input = \"\" ) testMatches ( \"\" , input = \"\" ) testMatches ( \"\" , input = \"\" ) testMatches ( \"\" , input = \"\" ) testMatches ( \"\" , input = \"\" ) }","docstring":"/**\n * Regression test for https://github.com/JetBrains/kotlin-native/issues/2297\n */"} {"signature":"public fun < T > Flow < T > . shareIn ( scope : CoroutineScope , started : SharingStarted , replay : Int = ) : SharedFlow < T >","body":"{ val config = configureSharing ( replay ) val shared = MutableSharedFlow < T > ( replay = replay , extraBufferCapacity = config . extraBufferCapacity , onBufferOverflow = config . onBufferOverflow ) @ Suppress ( \"\" ) val job = scope . launchSharing ( config . context , config . upstream , shared , started , NO_VALUE as T ) return ReadonlySharedFlow ( shared , job ) }","docstring":"/**\n * Converts a _cold_ [Flow] into a _hot_ [SharedFlow] that is started in the given coroutine [scope],\n * sharing emissions from a single running instance of the upstream flow with multiple downstream subscribers,\n * and replaying a specified number of [replay] values to new subscribers. See the [SharedFlow] documentation\n * for the general concepts of shared flows.\n *\n * The starting of the sharing coroutine is controlled by the [started] parameter. The following options\n * are supported.\n *\n * - [Eagerly][SharingStarted.Eagerly] — the upstream flow is started even before the first subscriber appears. Note\n * that in this case all values emitted by the upstream beyond the most recent values as specified by\n * [replay] parameter **will be immediately discarded**.\n * - [Lazily][SharingStarted.Lazily] — starts the upstream flow after the first subscriber appears, which guarantees\n * that this first subscriber gets all the emitted values, while subsequent subscribers are only guaranteed to\n * get the most recent [replay] values. The upstream flow continues to be active even when all subscribers\n * disappear, but only the most recent [replay] values are cached without subscribers.\n * - [WhileSubscribed()][SharingStarted.WhileSubscribed] — starts the upstream flow when the first subscriber\n * appears, immediately stops when the last subscriber disappears, keeping the replay cache forever.\n * It has additional optional configuration parameters as explained in its documentation.\n * - A custom strategy can be supplied by implementing the [SharingStarted] interface.\n *\n * The `shareIn` operator is useful in situations when there is a _cold_ flow that is expensive to create and/or\n * to maintain, but there are multiple subscribers that need to collect its values. For example, consider a\n * flow of messages coming from a backend over the expensive network connection, taking a lot of\n * time to establish. Conceptually, it might be implemented like this:\n *\n * ```\n * val backendMessages: Flow = flow {\n * connectToBackend() // takes a lot of time\n * try {\n * while (true) {\n * emit(receiveMessageFromBackend())\n * }\n * } finally {\n * disconnectFromBackend()\n * }\n * }\n * ```\n *\n * If this flow is directly used in the application, then every time it is collected a fresh connection is\n * established, and it will take a while before messages start flowing. However, we can share a single connection\n * and establish it eagerly like this:\n *\n * ```\n * val messages: SharedFlow = backendMessages.shareIn(scope, SharingStarted.Eagerly)\n * ```\n *\n * Now a single connection is shared between all collectors from `messages`, and there is a chance that the connection\n * is already established by the time it is needed.\n *\n * ### Upstream completion and error handling\n *\n * **Normal completion of the upstream flow has no effect on subscribers**, and the sharing coroutine continues to run. If a\n * strategy like [SharingStarted.WhileSubscribed] is used, then the upstream can get restarted again. If a special\n * action on upstream completion is needed, then an [onCompletion] operator can be used before the\n * `shareIn` operator to emit a special value in this case, like this:\n *\n * ```\n * backendMessages\n * .onCompletion { cause -> if (cause == null) emit(UpstreamHasCompletedMessage) }\n * .shareIn(scope, SharingStarted.Eagerly)\n * ```\n *\n * Any exception in the upstream flow terminates the sharing coroutine without affecting any of the subscribers,\n * and will be handled by the [scope] in which the sharing coroutine is launched. Custom exception handling\n * can be configured by using the [catch] or [retry] operators before the `shareIn` operator.\n * For example, to retry connection on any `IOException` with 1 second delay between attempts, use:\n *\n * ```\n * val messages = backendMessages\n * .retry { e ->\n * val shallRetry = e is IOException // other exception are bugs - handle them\n * if (shallRetry) delay(1000)\n * shallRetry\n * }\n * .shareIn(scope, SharingStarted.Eagerly)\n * ```\n *\n * ### Initial value\n *\n * When a special initial value is needed to signal to subscribers that the upstream is still loading the data,\n * use the [onStart] operator on the upstream flow. For example:\n *\n * ```\n * backendMessages\n * .onStart { emit(UpstreamIsStartingMessage) }\n * .shareIn(scope, SharingStarted.Eagerly, 1) // replay one most recent message\n * ```\n *\n * ### Buffering and conflation\n *\n * The `shareIn` operator runs the upstream flow in a separate coroutine, and buffers emissions from upstream as explained\n * in the [buffer] operator's description, using a buffer of [replay] size or the default (whichever is larger).\n * This default buffering can be overridden with an explicit buffer configuration by preceding the `shareIn` call\n * with [buffer] or [conflate], for example:\n *\n * - `buffer(0).shareIn(scope, started, 0)` — overrides the default buffer size and creates a [SharedFlow] without a buffer.\n * Effectively, it configures sequential processing between the upstream emitter and subscribers,\n * as the emitter is suspended until all subscribers process the value. Note, that the value is still immediately\n * discarded when there are no subscribers.\n * - `buffer(b).shareIn(scope, started, r)` — creates a [SharedFlow] with `replay = r` and `extraBufferCapacity = b`.\n * - `conflate().shareIn(scope, started, r)` — creates a [SharedFlow] with `replay = r`, `onBufferOverflow = DROP_OLDEST`,\n * and `extraBufferCapacity = 1` when `replay == 0` to support this strategy.\n *\n * ### Operator fusion\n *\n * Application of [flowOn][Flow.flowOn], [buffer] with [RENDEZVOUS][Channel.RENDEZVOUS] capacity,\n * or [cancellable] operators to the resulting shared flow has no effect.\n *\n * ### Exceptions\n *\n * This function throws [IllegalArgumentException] on unsupported values of parameters or combinations thereof.\n *\n * @param scope the coroutine scope in which sharing is started.\n * @param started the strategy that controls when sharing is started and stopped.\n * @param replay the number of values replayed to new subscribers (cannot be negative, defaults to zero).\n */"} {"signature":"public fun < T > Flow < T > . stateIn ( scope : CoroutineScope , started : SharingStarted , initialValue : T ) : StateFlow < T >","body":"{ val config = configureSharing ( ) val state = MutableStateFlow ( initialValue ) val job = scope . launchSharing ( config . context , config . upstream , state , started , initialValue ) return ReadonlyStateFlow ( state , job ) }","docstring":"/**\n * Converts a _cold_ [Flow] into a _hot_ [StateFlow] that is started in the given coroutine [scope],\n * sharing the most recently emitted value from a single running instance of the upstream flow with multiple\n * downstream subscribers. See the [StateFlow] documentation for the general concepts of state flows.\n *\n * The starting of the sharing coroutine is controlled by the [started] parameter, as explained in the\n * documentation for [shareIn] operator.\n *\n * The `stateIn` operator is useful in situations when there is a _cold_ flow that provides updates to the\n * value of some state and is expensive to create and/or to maintain, but there are multiple subscribers\n * that need to collect the most recent state value. For example, consider a\n * flow of state updates coming from a backend over the expensive network connection, taking a lot of\n * time to establish. Conceptually it might be implemented like this:\n *\n * ```\n * val backendState: Flow = flow {\n * connectToBackend() // takes a lot of time\n * try {\n * while (true) {\n * emit(receiveStateUpdateFromBackend())\n * }\n * } finally {\n * disconnectFromBackend()\n * }\n * }\n * ```\n *\n * If this flow is directly used in the application, then every time it is collected a fresh connection is\n * established, and it will take a while before state updates start flowing. However, we can share a single connection\n * and establish it eagerly like this:\n *\n * ```\n * val state: StateFlow = backendMessages.stateIn(scope, SharingStarted.Eagerly, State.LOADING)\n * ```\n *\n * Now, a single connection is shared between all collectors from `state`, and there is a chance that the connection\n * is already established by the time it is needed.\n *\n * ### Upstream completion and error handling\n *\n * **Normal completion of the upstream flow has no effect on subscribers**, and the sharing coroutine continues to run. If a\n * a strategy like [SharingStarted.WhileSubscribed] is used, then the upstream can get restarted again. If a special\n * action on upstream completion is needed, then an [onCompletion] operator can be used before\n * the `stateIn` operator to emit a special value in this case. See the [shareIn] operator's documentation for an example.\n *\n * Any exception in the upstream flow terminates the sharing coroutine without affecting any of the subscribers,\n * and will be handled by the [scope] in which the sharing coroutine is launched. Custom exception handling\n * can be configured by using the [catch] or [retry] operators before the `stateIn` operator, similarly to\n * the [shareIn] operator.\n *\n * ### Operator fusion\n *\n * Application of [flowOn][Flow.flowOn], [conflate][Flow.conflate],\n * [buffer] with [CONFLATED][Channel.CONFLATED] or [RENDEZVOUS][Channel.RENDEZVOUS] capacity,\n * [distinctUntilChanged][Flow.distinctUntilChanged], or [cancellable] operators to a state flow has no effect.\n *\n * @param scope the coroutine scope in which sharing is started.\n * @param started the strategy that controls when sharing is started and stopped.\n * @param initialValue the initial value of the state flow.\n * This value is also used when the state flow is reset using the [SharingStarted.WhileSubscribed] strategy\n * with the `replayExpirationMillis` parameter.\n */"} {"signature":"public suspend fun < T > Flow < T > . stateIn ( scope : CoroutineScope ) : StateFlow < T >","body":"{ val config = configureSharing ( ) val result = CompletableDeferred < StateFlow < T > > ( ) scope . launchSharingDeferred ( config . context , config . upstream , result ) return result . await ( ) }","docstring":"/**\n * Starts the upstream flow in a given [scope], suspends until the first value is emitted, and returns a _hot_\n * [StateFlow] of future emissions, sharing the most recently emitted value from this running instance of the upstream flow\n * with multiple downstream subscribers. See the [StateFlow] documentation for the general concepts of state flows.\n *\n * @param scope the coroutine scope in which sharing is started.\n */"} {"signature":"public fun < T > MutableSharedFlow < T > . asSharedFlow ( ) : SharedFlow < T >","body":"= ReadonlySharedFlow ( this , null )","docstring":"/**\n * Represents this mutable shared flow as a read-only shared flow.\n */"} {"signature":"public fun < T > MutableStateFlow < T > . asStateFlow ( ) : StateFlow < T >","body":"= ReadonlyStateFlow ( this , null )","docstring":"/**\n * Represents this mutable state flow as a read-only state flow.\n */"} {"signature":"public fun < T > SharedFlow < T > . onSubscription ( action : suspend FlowCollector < T > . ( ) -> Unit ) : SharedFlow < T >","body":"= SubscribedSharedFlow ( this , action )","docstring":"/**\n * Returns a flow that invokes the given [action] **after** this shared flow starts to be collected\n * (after the subscription is registered).\n *\n * The [action] is called before any value is emitted from the upstream\n * flow to this subscription but after the subscription is established. It is guaranteed that all emissions to\n * the upstream flow that happen inside or immediately after this `onSubscription` action will be\n * collected by this subscription.\n *\n * The receiver of the [action] is [FlowCollector], so `onSubscription` can emit additional elements.\n */"} {"signature":"internal fun Map < SourceFile , MutableList < CallableMemberDescriptor > > . makeFilesOrderStable ( )","body":"= this . entries . sortedBy { it . key . name }","docstring":"/**\n * Sort order of files. Order of declarations will be stabilized in the corresponding functions later.\n */"} {"signature":"internal fun Map < ClassDescriptor , MutableList < CallableMemberDescriptor > > . makeCategoriesOrderStable ( )","body":"= this . entries . sortedBy { it . key . classId . toString ( ) }","docstring":"/**\n * Sort order of categories. Order of extensions will be stabilized in the corresponding functions later.\n */"} {"signature":"internal fun IdeJvmAndAndroidPlatformBinaryDependencyResolver ( project : Project ) : IdeDependencyResolver","body":"= IdeBinaryDependencyResolver ( binaryType = IdeaKotlinBinaryDependency . KOTLIN_COMPILE_BINARY_TYPE , artifactResolutionStrategy = IdeBinaryDependencyResolver . ArtifactResolutionStrategy . PlatformLikeSourceSet ( setupPlatformResolutionAttributes = { attributes . setAttribute ( Usage . USAGE_ATTRIBUTE , project . usageByName ( Usage . JAVA_API ) ) attributes . setAttribute ( Category . CATEGORY_ATTRIBUTE , project . objects . named ( Category . LIBRARY ) ) attributes . setAttribute ( KotlinPlatformType . attribute , KotlinPlatformType . jvm ) attributes . setAttribute ( TargetJvmEnvironment . TARGET_JVM_ENVIRONMENT_ATTRIBUTE , project . objects . named ( TargetJvmEnvironment . STANDARD_JVM ) ) } , componentFilter = { identifier -> identifier !is ProjectComponentIdentifier } , dependencySubstitution = :: substituteStdlibCommonWithAndroidJvm , ) )","docstring":"/**\n * Resolves dependencies of jvm and Android source sets from the perspective jvm\n */"} {"signature":"internal fun substituteStdlibCommonWithAndroidJvm ( dependencySubstitutions : DependencySubstitutions )","body":"{ dependencySubstitutions . all { dependency -> val requested = dependency . requested if ( requested is ModuleComponentSelector && requested . group == KOTLIN_MODULE_GROUP && requested . module == KOTLIN_STDLIB_COMMON_MODULE_NAME ) dependency . useTarget ( \"\" ) } }","docstring":"/**\n * This is a replacement for propagation of stdlib-jvm in non-KGP-based IDE import for JVM+Android source sets.\n * It's possible to resolve regular dependencies of the source set with platform attributes to get the correct JVM variants.\n * But stdlib is a special case, kotlin-stdlib-common is not a common variant for the JVM stdlib w.r.t. publication.\n * Substituting kotlin-stdlib-common with the Android-JVM stdlib in requests workarounds the issue.\n */"} {"signature":"private fun AbstractKotlinCompile < * > . createAndroidSourceSet ( androidTarget : KotlinAndroidTarget ) : SourceSet","body":"{ val variantName = sourceSetName . get ( ) val compilation = androidTarget . compilations . getByName ( variantName ) val sources = compilation . allKotlinSourceSets . flatMap { it . kotlin . srcDirs } . distinctBy { it . absolutePath } val resources = compilation . allKotlinSourceSets . flatMap { it . resources . srcDirs } . distinctBy { it . absolutePath } return SourceSetImpl ( sourceSetName . get ( ) , if ( sourceSetName . get ( ) . contains ( \"\" , true ) ) SourceSet . SourceSetType . TEST else SourceSet . SourceSetType . PRODUCTION , friendSourceSets . get ( ) , sources , resources , destinationDirectory . get ( ) . asFile , compilation . output . resourcesDir , buildCompilerArguments ( ) ) }","docstring":"/**\n * Constructs the Android [SourceSet] that should be returned to the IDE for each compile task/variant.\n */"} {"signature":"private fun tryDownload ( url : URL , tmpFile : File )","body":"{ val connection = url . openConnection ( ) ( connection as? HttpURLConnection ) ? . checkHTTPResponse ( HttpURLConnection . HTTP_OK , url ) if ( connection is HttpURLConnection && tmpFile . exists ( ) ) { resumeDownload ( url , connection , tmpFile ) } else { connection . connect ( ) val totalBytes = connection . contentLengthLong doDownload ( url , connection , tmpFile , , totalBytes , false ) } }","docstring":"/** Performs an attempt to download a specified file into the specified location */"} {"signature":"fun download ( source : URL , destination : File , replace : ReplacingMode = ReplacingMode . RETURN_EXISTING ) : File","body":"{ if ( destination . exists ( ) ) { when ( replace ) { ReplacingMode . RETURN_EXISTING -> return destination ReplacingMode . THROW -> throw FileAlreadyExistsException ( destination ) ReplacingMode . REPLACE -> Unit } } val tmpFile = File ( \"\" ) check ( ! tmpFile . isDirectory ) { \"\" } check ( ! destination . isDirectory ) { \"\" } var attempt = var waitTime = val handleException = { e : Exception -> if ( attempt >= maxAttempts ) { throw e } attempt ++ waitTime += attemptIntervalMs println ( \"\" + \"\" ) Thread . sleep ( waitTime ) } while ( true ) { try { tryDownload ( source , tmpFile ) break } catch ( e : HTTPResponseException ) { if ( e . responseCode >= ) { handleException ( e ) } else { throw e } } catch ( e : IOException ) { handleException ( e ) } } Files . move ( tmpFile . toPath ( ) , destination . toPath ( ) , StandardCopyOption . REPLACE_EXISTING ) println ( \"\" ) return destination }","docstring":"/** Downloads a file from [source] url to [destination]. Returns [destination]. */"} {"signature":"public fun < S : KtCallableSymbol > S . substitute ( substitutor : KtSubstitutor ) : KtCallableSignature < S >","body":"= withValidityAssertion { analysisSession . signatureSubstitutor . substitute ( this , substitutor ) }","docstring":"/**\n * Applies a [substitutor] to the given symbol and return a signature with substituted types.\n *\n * @see KtSubstitutor.substitute\n */"} {"signature":"public fun < S : KtFunctionLikeSymbol > S . substitute ( substitutor : KtSubstitutor ) : KtFunctionLikeSignature < S >","body":"= withValidityAssertion { analysisSession . signatureSubstitutor . substitute ( this , substitutor ) }","docstring":"/**\n * Applies a [substitutor] to the given symbol and return a signature with substituted types.\n *\n * @see KtSubstitutor.substitute\n */"} {"signature":"public fun < S : KtVariableLikeSymbol > S . substitute ( substitutor : KtSubstitutor ) : KtVariableLikeSignature < S >","body":"= withValidityAssertion { analysisSession . signatureSubstitutor . substitute ( this , substitutor ) }","docstring":"/**\n * Applies a [substitutor] to the given symbols and return a signature with substituted types.\n *\n * @see KtSubstitutor.substitute\n */"} {"signature":"public fun < S : KtCallableSymbol > S . asSignature ( ) : KtCallableSignature < S >","body":"= withValidityAssertion { analysisSession . signatureSubstitutor . asSignature ( this ) }","docstring":"/**\n * Creates a new [KtCallableSignature] by given symbol and leave all types intact\n */"} {"signature":"public fun < S : KtFunctionLikeSymbol > S . asSignature ( ) : KtFunctionLikeSignature < S >","body":"= withValidityAssertion { analysisSession . signatureSubstitutor . asSignature ( this ) }","docstring":"/**\n * Creates a new [KtCallableSignature] by given symbol and leave all types intact\n */"} {"signature":"public fun < S : KtVariableLikeSymbol > S . asSignature ( ) : KtVariableLikeSignature < S >","body":"= withValidityAssertion { analysisSession . signatureSubstitutor . asSignature ( this ) }","docstring":"/**\n * Creates a new [KtCallableSignature] by given symbol and leave all types intact\n */"} {"signature":"override fun visitElement ( element : FirElement , data : T )","body":"{ if ( element is FirElementWithResolveState ) return element . acceptChildren ( this , data ) }","docstring":"/**\n * Skip all [FirElementWithResolveState] without explicit override\n */"} {"signature":"override fun visitArgumentList ( argumentList : FirArgumentList , data : T )","body":"{ }","docstring":"/**\n * Skip argument list as the compiler do not support annotations inside annotation arguments\n */"} {"signature":"@ kotlin . internal . InlineOnly public inline fun require ( value : Boolean ) : Unit","body":"{ contract { returns ( ) implies value } require ( value ) { \"\" } }","docstring":"/**\n * Throws an [IllegalArgumentException] if the [value] is false.\n *\n * @sample samples.misc.Preconditions.failRequireWithLazyMessage\n */"} {"signature":"@ kotlin . internal . InlineOnly public inline fun require ( value : Boolean , lazyMessage : ( ) -> Any ) : Unit","body":"{ contract { returns ( ) implies value } if ( ! value ) { val message = lazyMessage ( ) throw IllegalArgumentException ( message . toString ( ) ) } }","docstring":"/**\n * Throws an [IllegalArgumentException] with the result of calling [lazyMessage] if the [value] is false.\n *\n * @sample samples.misc.Preconditions.failRequireWithLazyMessage\n */"} {"signature":"@ kotlin . internal . InlineOnly public inline fun < T : Any > requireNotNull ( value : T ? ) : T","body":"{ contract { returns ( ) implies ( value != null ) } return requireNotNull ( value ) { \"\" } }","docstring":"/**\n * Throws an [IllegalArgumentException] if the [value] is null. Otherwise returns the not null value.\n */"} {"signature":"@ kotlin . internal . InlineOnly public inline fun < T : Any > requireNotNull ( value : T ? , lazyMessage : ( ) -> Any ) : T","body":"{ contract { returns ( ) implies ( value != null ) } if ( value == null ) { val message = lazyMessage ( ) throw IllegalArgumentException ( message . toString ( ) ) } else { return value } }","docstring":"/**\n * Throws an [IllegalArgumentException] with the result of calling [lazyMessage] if the [value] is null. Otherwise\n * returns the not null value.\n *\n * @sample samples.misc.Preconditions.failRequireNotNullWithLazyMessage\n */"} {"signature":"@ kotlin . internal . InlineOnly public inline fun check ( value : Boolean ) : Unit","body":"{ contract { returns ( ) implies value } check ( value ) { \"\" } }","docstring":"/**\n * Throws an [IllegalStateException] if the [value] is false.\n *\n * @sample samples.misc.Preconditions.failCheckWithLazyMessage\n */"} {"signature":"@ kotlin . internal . InlineOnly public inline fun check ( value : Boolean , lazyMessage : ( ) -> Any ) : Unit","body":"{ contract { returns ( ) implies value } if ( ! value ) { val message = lazyMessage ( ) throw IllegalStateException ( message . toString ( ) ) } }","docstring":"/**\n * Throws an [IllegalStateException] with the result of calling [lazyMessage] if the [value] is false.\n *\n * @sample samples.misc.Preconditions.failCheckWithLazyMessage\n */"} {"signature":"@ kotlin . internal . InlineOnly public inline fun < T : Any > checkNotNull ( value : T ? ) : T","body":"{ contract { returns ( ) implies ( value != null ) } return checkNotNull ( value ) { \"\" } }","docstring":"/**\n * Throws an [IllegalStateException] if the [value] is null. Otherwise\n * returns the not null value.\n *\n * @sample samples.misc.Preconditions.failCheckWithLazyMessage\n */"} {"signature":"@ kotlin . internal . InlineOnly public inline fun < T : Any > checkNotNull ( value : T ? , lazyMessage : ( ) -> Any ) : T","body":"{ contract { returns ( ) implies ( value != null ) } if ( value == null ) { val message = lazyMessage ( ) throw IllegalStateException ( message . toString ( ) ) } else { return value } }","docstring":"/**\n * Throws an [IllegalStateException] with the result of calling [lazyMessage] if the [value] is null. Otherwise\n * returns the not null value.\n *\n * @sample samples.misc.Preconditions.failCheckWithLazyMessage\n */"} {"signature":"@ kotlin . internal . InlineOnly public inline fun error ( message : Any ) : Nothing","body":"= throw IllegalStateException ( message . toString ( ) )","docstring":"/**\n * Throws an [IllegalStateException] with the given [message].\n *\n * @sample samples.misc.Preconditions.failWithError\n */"} {"signature":"override fun hasViolatedUpperBound ( )","body":"= ! isSuccessful ( ) && filterConstraintsOut ( TYPE_BOUND_POSITION ) . status . isSuccessful ( )","docstring":"/**\n * All hacks were removed. This comment is left for information.\n *\n * Hacks above are needed for the following example:\n *\n * @kotlin.jvm.JvmName(\"containsAny\")\n * @kotlin.internal.LowPriorityInOverloadResolution\n * public operator fun Iterable.contains(element: T): Boolean\n *\n * public operator fun <@kotlin.internal.OnlyInputTypes T> Iterable.contains(element: T): Boolean\n *\n * fun test() = listOf(1).contains(\"\")\n *\n * When we resolve call `contains`, we should choose candidate before we complete inference.\n * Because of this we can't check OnlyInputTypes when we trying choose candidate.\n * Now we do this check in this moment, but it is incorrect and we should remove it later.\n *\n * Call !satisfyInitialConstraints() in hasTypeInferenceIncorporationError() is needed for this example:\n * @kotlin.jvm.JvmName(\"containsAny\")\n * @kotlin.internal.LowPriorityInOverloadResolution\n * public operator fun Iterable.contains(element: T): Boolean\n *\n * public operator fun Iterable.contains(element: @kotlin.internal.NoInfer T)\n *\n * fun test() = listOf(1).contains(\"\")\n *\n * It is also incorrect, because we can get additional constraints on T after we resolve call `contains`.\n */"} {"signature":"public actual fun todo ( block : ( ) -> Unit )","body":"{ println ( \"\" + block ) }","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 ( \"\" ) internal actual inline fun AssertionErrorWithCause ( message : String ? , cause : Throwable ? ) : AssertionError","body":"= AssertionError ( message , cause )","docstring":"/** Platform-specific construction of AssertionError with cause */"} {"signature":"internal actual fun lookupAsserter ( ) : Asserter","body":"= DefaultWasmAsserter","docstring":"/**\n * Provides the JS implementation of asserter\n */"} {"signature":"public inline fun LayerCollectorContext . bars ( block : BarsContext . ( ) -> Unit )","body":"{ addLayer ( BarsContext ( this ) . apply { position = Position . dodge ( ) } . apply ( block ) ) }","docstring":"/**\n * Adds a new `bars` layer to the plot.\n *\n * The `bars` layer is used to create bar charts, which are useful for comparing quantities among discrete categories.\n *\n * This function creates a context where you can set aesthetic mappings (`aes`) or aesthetic constants.\n * - Mappings are specified by calling methods that correspond to aesthetic names (`aes`).\n * - Constants are directly assigned using properties with the names corresponding to aesthetics.\n * For positional aesthetics, you can use the `.constant()` method.\n *\n * ## Bars Aesthetics\n * * **`x`** - The X-coordinate specifying the categories.\n * * **`y`** - The Y-coordinate specifying the height of the bars.\n * * **`fillColor`** - The fill color of the bars.\n * * **`alpha`** - The transparency of the bars.\n * * **`width`** - The width of the bars.\n * * **`borderLine.color`** - Color of the bars' borderline.\n * * **`borderLine.width`** - Width of the bars' borderline.\n * * **`borderLine.type`** - Type of the bars' borderline, such as dashed or dotted.\n *\n * ## Example Usage\n *\n * ```kotlin\n * plot {\n * bars {\n * // Positional mapping\n * x(listOf(\"Apple\", \"Banana\", \"Cherry\", \"Orange\", \"Strawberry\"))\n * y(listOf(5.0, 7.5, 3.0, 4.5, 6.0)) {\n * axis.breaks((0..16).map { it / 2.0 })\n * }\n *\n * // Non-positional settings\n * alpha = 0.7\n * width = 0.4\n *\n * // BorderLine settings\n * borderLine {\n * color = Color.BLACK\n * width = 2.5\n * type = LineType.DASHED\n * }\n *\n * // Non-positional mapping\n * fillColor(listOf(\"a\", \"b\", \"b\", \"c\", \"a\"))\n * }\n * }\n * ```\n */"} {"signature":"public inline fun LayerCollectorContext . barsH ( block : BarsContext . ( ) -> Unit )","body":"{ addLayer ( BarsContext ( this ) . apply { position = Position . dodge ( ) reversed = true } . apply ( block ) ) }","docstring":"/**\n * Adds a new `barsH` layer to the plot.\n *\n * The `barsH` layer is designed to visualize data using horizontal bars.\n * It serves a similar purpose as `bars`, but the orientation of the bars is horizontal rather than vertical.\n *\n * This function creates a context where you can set aesthetic mappings (`aes`) or aesthetic constants.\n * - Mappings are specified by calling methods that correspond to aesthetic names (`aes`).\n * - Constants are directly assigned using properties with the names corresponding to aesthetics.\n * For positional aesthetics, you can use the `.constant()` method.\n *\n * ## BarsH Aesthetics\n * * **`x`** - The X-coordinate specifying the length of the bars.\n * * **`y`** - The Y-coordinate specifying the categories.\n * * **`fillColor`** - The fill color of the bars.\n * * **`alpha`** - The transparency of the bars.\n * * **`width`** - The width of the bars.\n * * **`borderLine.color`** - Color of the bars' borderline.\n * * **`borderLine.width`** - Width of the bars' borderline.\n * * **`borderLine.type`** - Type of the bars' borderline, such as dashed or dotted.\n *\n * ## Example\n *\n * ```kotlin\n * plot {\n * barsH {\n * // Positional mapping\n * y(listOf(\"Apple\", \"Banana\", \"Cherry\", \"Orange\", \"Strawberry\"))\n * x(listOf(5.0, 7.5, 3.0, 4.5, 6.0)) {\n * axis.breaks((0..16).map { it / 2.0 })\n * }\n *\n * // Non-positional settings\n * alpha = 0.7\n * width = 0.4\n *\n * // BorderLine settings\n * borderLine {\n * color = Color.BLACK\n * width = 2.5\n * type = LineType.DASHED\n * }\n *\n * // Non-positional mapping\n * fillColor(listOf(\"a\", \"b\", \"b\", \"c\", \"a\"))\n * }\n * }\n * ```\n */"} {"signature":"@ HtmlTagMarker public inline fun FlowOrPhrasingContent . strike ( classes : String ? = null , crossinline block : STRIKE . ( ) -> Unit = { } ) : Unit","body":"= STRIKE ( attributesMapOf ( \"\" , classes ) , consumer ) . visit ( block )","docstring":"/**\n * Work-around until next version of kotlinx.html doesn't come out\n */"} {"signature":"internal fun Collection < LookupSymbol > . toProgramSymbolSet ( allClasses : Iterable < AccessibleClassSnapshot > ) : ProgramSymbolSet","body":"{ val lookupSymbols = LookupSymbolSet ( this ) val collector = ProgramSymbolSet . Collector ( ) allClasses . forEach { clazz -> when ( clazz ) { is RegularKotlinClassSnapshot , is JavaClassSnapshot -> { if ( ClassSymbol ( clazz . classId ) . toLookupSymbol ( ) in lookupSymbols ) { collector . addClass ( clazz . classId ) } val lookupNamesInScope = lookupSymbols . getLookupNamesInScope ( clazz . classId . asSingleFqName ( ) ) collector . addClassMembers ( clazz . classId , lookupNamesInScope ) } is PackageFacadeKotlinClassSnapshot , is MultifileClassKotlinClassSnapshot -> { val lookupNamesInScope = lookupSymbols . getLookupNamesInScope ( clazz . classId . packageFqName ) if ( lookupNamesInScope . isEmpty ( ) ) return@forEach val packageMemberNames = when ( clazz ) { is PackageFacadeKotlinClassSnapshot -> clazz . packageMemberNames else -> ( clazz as MultifileClassKotlinClassSnapshot ) . constantNames } collector . addPackageMembers ( clazz . classId . packageFqName , packageMemberNames . intersect ( lookupNamesInScope ) ) } } } return collector . getResult ( ) }","docstring":"/**\n * Converts [LookupSymbol]s to [ProgramSymbol]s.\n *\n * Since [LookupSymbol]s are ambiguous, we need to use the given classes to disambiguate them.\n *\n * A [LookupSymbol] may be converted to more than one [ProgramSymbol]. For example, given this class:\n * class Foo {\n * class Bar\n * fun Bar(x: Int) {}\n * }\n * LookupSymbol(scope = \"Foo\", name = \"Bar\") will be converted to both ClassSymbol(\"Foo.Bar\") and ClassMember(\"Foo\", \"Bar\").\n *\n * If a [LookupSymbol] does not refer to any symbols in the given classes, it will be ignored.\n *\n * Note: It's okay to over-approximate the result.\n */"} {"signature":"@ Suppress ( \"\" ) public fun PreMergeDocumentableTransformer . sourceSet ( documentable : Documentable ) : DokkaSourceSet","body":"{ return documentable . sourceSets . single ( ) }","docstring":"/**\n * It is fair to assume that a given [Documentable] is not merged when seen by the [PreMergeDocumentableTransformer].\n * Therefore, it can also be assumed, that there is just a single source set connected to the given [documentable]\n * @return the single source set associated with this [documentable].\n */"} {"signature":"public fun PreMergeDocumentableTransformer . perPackageOptions ( documentable : Documentable ) : PackageOptions ?","body":"{ val packageName = documentable . dri . packageName ? : return null return sourceSet ( documentable ) . perPackageOptions . sortedByDescending { packageOptions -> packageOptions . matchingRegex . length } . firstOrNull { packageOptions -> Regex ( packageOptions . matchingRegex ) . matches ( packageName ) } }","docstring":"/**\n * @return The [PackageOptions] associated with this documentable, or null\n */"} {"signature":"public fun < T > strongCachedValue ( vararg dependencies : ModificationTracker , compute : ( ) -> T , ) : StrongRefModificationTrackerBasedCache < T >","body":"= StrongRefModificationTrackerBasedCache ( dependencies . toList ( ) , compute )","docstring":"/**\n * Create modification tracker which will be invalidated when dependencies change.\n * The cached value is hold on the strong reference.\n * So, the value will not be garbage collected until modification tracker changes.\n */"} {"signature":"protected abstract fun paddingArrayToTfFormat ( inputShape : Shape ) : Array < IntArray >","body":"protected abstract fun paddingArrayToTfFormat ( inputShape : Shape ) : Array < IntArray >","docstring":"/**\n * This function helps in computing the padding operand i.e. normalizing the padding array\n * into a tensorflow format. This method will then be called in [build] method that will be\n * further passed to tf.pad().\n */"} {"signature":"fun cartesianProductOf ( first : Iterable < Any ? > , second : Iterable < Any ? > , vararg rest : Iterable < Any ? > , ) : Sequence < List < Any ? > >","body":"{ var result : Sequence < Pair < Any ? , Any ? > > = first x second for ( restItem in rest ) { result = result x restItem } return result . flattenPairs }","docstring":"/**\n * Cartesian product of two and more collections.\n * Returns a sequence of all possible combinations between given elements.\n * Combination is represented as a list with indexes matching order of inputs\n * i.e.\n * ```\n * cartesianProductOf(listOf(\"a\", \"b\"), listOf(1, 2), listOf(4.3, 6.3)).map { list ->\n * list[0] // will contain elements of the first argument e.g. \"a\"\n * list[1] // will contain elements of the second argument e.g. 2\n * list[2] // will contain elements of the second argument e.g. 4.3\n * // and so on\n * }\n * ```\n */"} {"signature":"infix fun < A , B > Iterable < A > . x ( that : Iterable < B > ) : Sequence < Pair < A , B > >","body":"= sequence { for ( a in this @ x ) { for ( b in that ) { yield ( a to b ) } } }","docstring":"/**\n * Cartesian product of two collections.\n * Returns a sequence of all possible pairs between elements from [this] and [that]\n */"} {"signature":"infix fun < A , B > Sequence < A > . x ( that : Iterable < B > ) : Sequence < Pair < A , B > >","body":"= sequence { for ( a in this @ x ) { for ( b in that ) { yield ( a to b ) } } }","docstring":"/**\n * Cartesian product of a sequence and a collection.\n * Returns a sequence of all possible pairs between elements from [this] and [that]\n */"} {"signature":"@ Composable fun mirroringIcon ( ltrIcon : ImageVector , rtlIcon : ImageVector ) : ImageVector","body":"= if ( LocalLayoutDirection . current == LayoutDirection . Ltr ) ltrIcon else rtlIcon","docstring":"/**\n * Returns the correct icon based on the current layout direction.\n */"} {"signature":"@ Composable fun mirroringBackIcon ( )","body":"= mirroringIcon ( ltrIcon = Icons . Outlined . ArrowBack , rtlIcon = Icons . Outlined . ArrowForward )","docstring":"/**\n * Returns the correct back navigation icon based on the current layout direction.\n */"} {"signature":"private fun dumpDokkaConfigurationJson ( dokkaConfiguration : DokkaConfiguration , )","body":"{ val destFile = dokkaConfigurationJsonFile . asFile . orNull ? : return destFile . parentFile . mkdirs ( ) destFile . createNewFile ( ) val compactJson = dokkaConfiguration . toPrettyJsonString ( ) val json = jsonMapper . decodeFromString ( JsonElement . serializer ( ) , compactJson ) val prettyJson = jsonMapper . encodeToString ( JsonElement . serializer ( ) , json ) destFile . writeText ( prettyJson ) logger . info ( \"\" ) }","docstring":"/**\n * Dump the [DokkaConfiguration] JSON to a file ([dokkaConfigurationJsonFile]) for debugging\n * purposes.\n */"} {"signature":"fun GradleDokkaSourceSetBuilder . dependsOn ( sourceSet : KotlinSourceSet )","body":"{ dependsOn ( DokkaSourceSetID ( sourceSet . name ) ) }","docstring":"/**\n * Convenient override to **append** source sets to [GradleDokkaSourceSetBuilder.dependentSourceSets]\n */"} {"signature":"fun GradleDokkaSourceSetBuilder . dependsOn ( @ Suppress ( \"\" ) sourceSet : com . android . build . gradle . api . AndroidSourceSet )","body":"{ dependsOn ( DokkaSourceSetID ( sourceSet . name ) ) }","docstring":"/**\n * Convenient override to **append** source sets to [GradleDokkaSourceSetBuilder.dependentSourceSets]\n */"} {"signature":"fun GradleDokkaSourceSetBuilder . dependsOn ( @ Suppress ( \"\" ) sourceSet : com . android . build . api . dsl . AndroidSourceSet )","body":"{ dependsOn ( DokkaSourceSetID ( sourceSet . name ) ) }","docstring":"/**\n * Convenient override to **append** source sets to [GradleDokkaSourceSetBuilder.dependentSourceSets]\n */"} {"signature":"fun GradleDokkaSourceSetBuilder . kotlinSourceSet ( kotlinSourceSet : KotlinSourceSet )","body":"{ configureWithKotlinSourceSet ( kotlinSourceSet ) }","docstring":"/**\n * Extension allowing configuration of Dokka source sets via Kotlin Gradle plugin source sets.\n */"} {"signature":"private fun runInIdeSyncMode ( block : ( ) -> Unit )","body":"= synchronized ( System . getProperties ( ) ) { val isIdeaSyncActiveKey = \"\" val previousValue = System . getProperty ( isIdeaSyncActiveKey ) try { System . setProperty ( isIdeaSyncActiveKey , \"\" ) block ( ) } finally { if ( previousValue != null ) { System . setProperty ( isIdeaSyncActiveKey , previousValue ) } else { System . clearProperty ( isIdeaSyncActiveKey ) } } }","docstring":"/**\n * Will swap out the System property 'idea.sync.active' to emulate IDE sync.\n * This method will enter the 'System properties monitor' to block any other thread from reading\n * System properties while this [block] is executing\n */"} {"signature":"public fun KtCallableSymbol . isVisibleInClass ( classSymbol : KtClassOrObjectSymbol ) : Boolean","body":"= withValidityAssertion { analysisSession . overrideInfoProvider . isVisible ( this , classSymbol ) }","docstring":"/** Checks if the given symbol (possibly a symbol inherited from a super class) is visible in the given class. */"} {"signature":"public fun KtCallableSymbol . getImplementationStatus ( parentClassSymbol : KtClassOrObjectSymbol ) : ImplementationStatus ?","body":"= withValidityAssertion { analysisSession . overrideInfoProvider . getImplementationStatus ( this , parentClassSymbol ) }","docstring":"/**\n * Gets the [ImplementationStatus] of the [this] member symbol in the given [parentClassSymbol]. Or null if this symbol is not a\n * member.\n */"} {"signature":"operator fun < T , T1 : T > Product1 < T1 > . iterator ( ) : Iterator < T >","body":"= JavaConverters . asJavaIterator < T > ( productIterator ( ) . map < T > { it as T } )","docstring":"/** Allows this product to be iterated over. Returns an iterator of type [T]. */"} {"signature":"operator fun < T , T1 : T , T2 : T > Product2 < T1 , T2 > . iterator ( ) : Iterator < T >","body":"= JavaConverters . asJavaIterator < T > ( productIterator ( ) . map < T > { it as T } )","docstring":"/** Allows this product to be iterated over. Returns an iterator of type [T]. */"} {"signature":"operator fun < T , T1 : T , T2 : T , T3 : T > Product3 < T1 , T2 , T3 > . iterator ( ) : Iterator < T >","body":"= JavaConverters . asJavaIterator < T > ( productIterator ( ) . map < T > { it as T } )","docstring":"/** Allows this product to be iterated over. Returns an iterator of type [T]. */"} {"signature":"operator fun < T , T1 : T , T2 : T , T3 : T , T4 : T > Product4 < T1 , T2 , T3 , T4 > . iterator ( ) : Iterator < T >","body":"= JavaConverters . asJavaIterator < T > ( productIterator ( ) . map < T > { it as T } )","docstring":"/** Allows this product to be iterated over. Returns an iterator of type [T]. */"} {"signature":"operator fun < T , T1 : T , T2 : T , T3 : T , T4 : T , T5 : T > Product5 < T1 , T2 , T3 , T4 , T5 > . iterator ( ) : Iterator < T >","body":"= JavaConverters . asJavaIterator < T > ( productIterator ( ) . map < T > { it as T } )","docstring":"/** Allows this product to be iterated over. Returns an iterator of type [T]. */"} {"signature":"operator fun < T , T1 : T , T2 : T , T3 : T , T4 : T , T5 : T , T6 : T > Product6 < T1 , T2 , T3 , T4 , T5 , T6 > . iterator ( ) : Iterator < T >","body":"= JavaConverters . asJavaIterator < T > ( productIterator ( ) . map < T > { it as T } )","docstring":"/** Allows this product to be iterated over. Returns an iterator of type [T]. */"} {"signature":"operator fun < T , T1 : T , T2 : T , T3 : T , T4 : T , T5 : T , T6 : T , T7 : T > Product7 < T1 , T2 , T3 , T4 , T5 , T6 , T7 > . iterator ( ) : Iterator < T >","body":"= JavaConverters . asJavaIterator < T > ( productIterator ( ) . map < T > { it as T } )","docstring":"/** Allows this product to be iterated over. Returns an iterator of type [T]. */"} {"signature":"operator fun < T , T1 : T , T2 : T , T3 : T , T4 : T , T5 : T , T6 : T , T7 : T , T8 : T > Product8 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 > . iterator ( ) : Iterator < T >","body":"= JavaConverters . asJavaIterator < T > ( productIterator ( ) . map < T > { it as T } )","docstring":"/** Allows this product to be iterated over. Returns an iterator of type [T]. */"} {"signature":"operator fun < T , T1 : T , T2 : T , T3 : T , T4 : T , T5 : T , T6 : T , T7 : T , T8 : T , T9 : T > Product9 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 > . iterator ( ) : Iterator < T >","body":"= JavaConverters . asJavaIterator < T > ( productIterator ( ) . map < T > { it as T } )","docstring":"/** Allows this product to be iterated over. Returns an iterator of type [T]. */"} {"signature":"operator fun < T , T1 : T , T2 : T , T3 : T , T4 : T , T5 : T , T6 : T , T7 : T , T8 : T , T9 : T , T10 : T > Product10 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 > . iterator ( ) : Iterator < T >","body":"= JavaConverters . asJavaIterator < T > ( productIterator ( ) . map < T > { it as T } )","docstring":"/** Allows this product to be iterated over. Returns an iterator of type [T]. */"} {"signature":"operator fun < T , T1 : T , T2 : T , T3 : T , T4 : T , T5 : T , T6 : T , T7 : T , T8 : T , T9 : T , T10 : T , T11 : T > Product11 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 > . iterator ( ) : Iterator < T >","body":"= JavaConverters . asJavaIterator < T > ( productIterator ( ) . map < T > { it as T } )","docstring":"/** Allows this product to be iterated over. Returns an iterator of type [T]. */"} {"signature":"operator fun < T , T1 : T , T2 : T , T3 : T , T4 : T , T5 : T , T6 : T , T7 : T , T8 : T , T9 : T , T10 : T , T11 : T , T12 : T > Product12 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 , T12 > . iterator ( ) : Iterator < T >","body":"= JavaConverters . asJavaIterator < T > ( productIterator ( ) . map < T > { it as T } )","docstring":"/** Allows this product to be iterated over. Returns an iterator of type [T]. */"} {"signature":"operator fun < T , T1 : T , T2 : T , T3 : T , T4 : T , T5 : T , T6 : T , T7 : T , T8 : T , T9 : T , T10 : T , T11 : T , T12 : T , T13 : T > Product13 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 , T12 , T13 > . iterator ( ) : Iterator < T >","body":"= JavaConverters . asJavaIterator < T > ( productIterator ( ) . map < T > { it as T } )","docstring":"/** Allows this product to be iterated over. Returns an iterator of type [T]. */"} {"signature":"operator fun < T , T1 : T , T2 : T , T3 : T , T4 : T , T5 : T , T6 : T , T7 : T , T8 : T , T9 : T , T10 : T , T11 : T , T12 : T , T13 : T , T14 : T > Product14 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 , T12 , T13 , T14 > . iterator ( ) : Iterator < T >","body":"= JavaConverters . asJavaIterator < T > ( productIterator ( ) . map < T > { it as T } )","docstring":"/** Allows this product to be iterated over. Returns an iterator of type [T]. */"} {"signature":"operator fun < T , T1 : T , T2 : T , T3 : T , T4 : T , T5 : T , T6 : T , T7 : T , T8 : T , T9 : T , T10 : T , T11 : T , T12 : T , T13 : T , T14 : T , T15 : T > Product15 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 , T12 , T13 , T14 , T15 > . iterator ( ) : Iterator < T >","body":"= JavaConverters . asJavaIterator < T > ( productIterator ( ) . map < T > { it as T } )","docstring":"/** Allows this product to be iterated over. Returns an iterator of type [T]. */"} {"signature":"operator fun < T , T1 : T , T2 : T , T3 : T , T4 : T , T5 : T , T6 : T , T7 : T , T8 : T , T9 : T , T10 : T , T11 : T , T12 : T , T13 : T , T14 : T , T15 : T , T16 : T > Product16 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 , T12 , T13 , T14 , T15 , T16 > . iterator ( ) : Iterator < T >","body":"= JavaConverters . asJavaIterator < T > ( productIterator ( ) . map < T > { it as T } )","docstring":"/** Allows this product to be iterated over. Returns an iterator of type [T]. */"} {"signature":"operator fun < T , T1 : T , T2 : T , T3 : T , T4 : T , T5 : T , T6 : T , T7 : T , T8 : T , T9 : T , T10 : T , T11 : T , T12 : T , T13 : T , T14 : T , T15 : T , T16 : T , T17 : T > Product17 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 , T12 , T13 , T14 , T15 , T16 , T17 > . iterator ( ) : Iterator < T >","body":"= JavaConverters . asJavaIterator < T > ( productIterator ( ) . map < T > { it as T } )","docstring":"/** Allows this product to be iterated over. Returns an iterator of type [T]. */"} {"signature":"operator fun < T , T1 : T , T2 : T , T3 : T , T4 : T , T5 : T , T6 : T , T7 : T , T8 : T , T9 : T , T10 : T , T11 : T , T12 : T , T13 : T , T14 : T , T15 : T , T16 : T , T17 : T , T18 : T > Product18 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 , T12 , T13 , T14 , T15 , T16 , T17 , T18 > . iterator ( ) : Iterator < T >","body":"= JavaConverters . asJavaIterator < T > ( productIterator ( ) . map < T > { it as T } )","docstring":"/** Allows this product to be iterated over. Returns an iterator of type [T]. */"} {"signature":"operator fun < T , T1 : T , T2 : T , T3 : T , T4 : T , T5 : T , T6 : T , T7 : T , T8 : T , T9 : T , T10 : T , T11 : T , T12 : T , T13 : T , T14 : T , T15 : T , T16 : T , T17 : T , T18 : T , T19 : T > Product19 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 , T12 , T13 , T14 , T15 , T16 , T17 , T18 , T19 > . iterator ( ) : Iterator < T >","body":"= JavaConverters . asJavaIterator < T > ( productIterator ( ) . map < T > { it as T } )","docstring":"/** Allows this product to be iterated over. Returns an iterator of type [T]. */"} {"signature":"operator fun < T , T1 : T , T2 : T , T3 : T , T4 : T , T5 : T , T6 : T , T7 : T , T8 : T , T9 : T , T10 : T , T11 : T , T12 : T , T13 : T , T14 : T , T15 : T , T16 : T , T17 : T , T18 : T , T19 : T , T20 : T > Product20 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 , T12 , T13 , T14 , T15 , T16 , T17 , T18 , T19 , T20 > . iterator ( ) : Iterator < T >","body":"= JavaConverters . asJavaIterator < T > ( productIterator ( ) . map < T > { it as T } )","docstring":"/** Allows this product to be iterated over. Returns an iterator of type [T]. */"} {"signature":"operator fun < T , T1 : T , T2 : T , T3 : T , T4 : T , T5 : T , T6 : T , T7 : T , T8 : T , T9 : T , T10 : T , T11 : T , T12 : T , T13 : T , T14 : T , T15 : T , T16 : T , T17 : T , T18 : T , T19 : T , T20 : T , T21 : T > Product21 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 , T12 , T13 , T14 , T15 , T16 , T17 , T18 , T19 , T20 , T21 > . iterator ( ) : Iterator < T >","body":"= JavaConverters . asJavaIterator < T > ( productIterator ( ) . map < T > { it as T } )","docstring":"/** Allows this product to be iterated over. Returns an iterator of type [T]. */"} {"signature":"operator fun < T , T1 : T , T2 : T , T3 : T , T4 : T , T5 : T , T6 : T , T7 : T , T8 : T , T9 : T , T10 : T , T11 : T , T12 : T , T13 : T , T14 : T , T15 : T , T16 : T , T17 : T , T18 : T , T19 : T , T20 : T , T21 : T , T22 : T > Product22 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 , T12 , T13 , T14 , T15 , T16 , T17 , T18 , T19 , T20 , T21 , T22 > . iterator ( ) : Iterator < T >","body":"= JavaConverters . asJavaIterator < T > ( productIterator ( ) . map < T > { it as T } )","docstring":"/** Allows this product to be iterated over. Returns an iterator of type [T]. */"} {"signature":"fun < T , T1 : T > Product1 < T1 > . asIterable ( ) : Iterable < T >","body":"= object : Iterable < T > { override fun iterator ( ) : Iterator < T > = JavaConverters . asJavaIterator < T > ( productIterator ( ) . map < T > { it as T } ) }","docstring":"/** Returns this product as an iterable of type [T]. */"} {"signature":"fun < T , T1 : T , T2 : T > Product2 < T1 , T2 > . asIterable ( ) : Iterable < T >","body":"= object : Iterable < T > { override fun iterator ( ) : Iterator < T > = JavaConverters . asJavaIterator < T > ( productIterator ( ) . map < T > { it as T } ) }","docstring":"/** Returns this product as an iterable of type [T]. */"} {"signature":"fun < T , T1 : T , T2 : T , T3 : T > Product3 < T1 , T2 , T3 > . asIterable ( ) : Iterable < T >","body":"= object : Iterable < T > { override fun iterator ( ) : Iterator < T > = JavaConverters . asJavaIterator < T > ( productIterator ( ) . map < T > { it as T } ) }","docstring":"/** Returns this product as an iterable of type [T]. */"} {"signature":"fun < T , T1 : T , T2 : T , T3 : T , T4 : T > Product4 < T1 , T2 , T3 , T4 > . asIterable ( ) : Iterable < T >","body":"= object : Iterable < T > { override fun iterator ( ) : Iterator < T > = JavaConverters . asJavaIterator < T > ( productIterator ( ) . map < T > { it as T } ) }","docstring":"/** Returns this product as an iterable of type [T]. */"} {"signature":"fun < T , T1 : T , T2 : T , T3 : T , T4 : T , T5 : T > Product5 < T1 , T2 , T3 , T4 , T5 > . asIterable ( ) : Iterable < T >","body":"= object : Iterable < T > { override fun iterator ( ) : Iterator < T > = JavaConverters . asJavaIterator < T > ( productIterator ( ) . map < T > { it as T } ) }","docstring":"/** Returns this product as an iterable of type [T]. */"} {"signature":"fun < T , T1 : T , T2 : T , T3 : T , T4 : T , T5 : T , T6 : T > Product6 < T1 , T2 , T3 , T4 , T5 , T6 > . asIterable ( ) : Iterable < T >","body":"= object : Iterable < T > { override fun iterator ( ) : Iterator < T > = JavaConverters . asJavaIterator < T > ( productIterator ( ) . map < T > { it as T } ) }","docstring":"/** Returns this product as an iterable of type [T]. */"} {"signature":"fun < T , T1 : T , T2 : T , T3 : T , T4 : T , T5 : T , T6 : T , T7 : T > Product7 < T1 , T2 , T3 , T4 , T5 , T6 , T7 > . asIterable ( ) : Iterable < T >","body":"= object : Iterable < T > { override fun iterator ( ) : Iterator < T > = JavaConverters . asJavaIterator < T > ( productIterator ( ) . map < T > { it as T } ) }","docstring":"/** Returns this product as an iterable of type [T]. */"} {"signature":"fun < T , T1 : T , T2 : T , T3 : T , T4 : T , T5 : T , T6 : T , T7 : T , T8 : T > Product8 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 > . asIterable ( ) : Iterable < T >","body":"= object : Iterable < T > { override fun iterator ( ) : Iterator < T > = JavaConverters . asJavaIterator < T > ( productIterator ( ) . map < T > { it as T } ) }","docstring":"/** Returns this product as an iterable of type [T]. */"} {"signature":"fun < T , T1 : T , T2 : T , T3 : T , T4 : T , T5 : T , T6 : T , T7 : T , T8 : T , T9 : T > Product9 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 > . asIterable ( ) : Iterable < T >","body":"= object : Iterable < T > { override fun iterator ( ) : Iterator < T > = JavaConverters . asJavaIterator < T > ( productIterator ( ) . map < T > { it as T } ) }","docstring":"/** Returns this product as an iterable of type [T]. */"} {"signature":"fun < T , T1 : T , T2 : T , T3 : T , T4 : T , T5 : T , T6 : T , T7 : T , T8 : T , T9 : T , T10 : T > Product10 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 > . asIterable ( ) : Iterable < T >","body":"= object : Iterable < T > { override fun iterator ( ) : Iterator < T > = JavaConverters . asJavaIterator < T > ( productIterator ( ) . map < T > { it as T } ) }","docstring":"/** Returns this product as an iterable of type [T]. */"} {"signature":"fun < T , T1 : T , T2 : T , T3 : T , T4 : T , T5 : T , T6 : T , T7 : T , T8 : T , T9 : T , T10 : T , T11 : T > Product11 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 > . asIterable ( ) : Iterable < T >","body":"= object : Iterable < T > { override fun iterator ( ) : Iterator < T > = JavaConverters . asJavaIterator < T > ( productIterator ( ) . map < T > { it as T } ) }","docstring":"/** Returns this product as an iterable of type [T]. */"} {"signature":"fun < T , T1 : T , T2 : T , T3 : T , T4 : T , T5 : T , T6 : T , T7 : T , T8 : T , T9 : T , T10 : T , T11 : T , T12 : T > Product12 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 , T12 > . asIterable ( ) : Iterable < T >","body":"= object : Iterable < T > { override fun iterator ( ) : Iterator < T > = JavaConverters . asJavaIterator < T > ( productIterator ( ) . map < T > { it as T } ) }","docstring":"/** Returns this product as an iterable of type [T]. */"} {"signature":"fun < T , T1 : T , T2 : T , T3 : T , T4 : T , T5 : T , T6 : T , T7 : T , T8 : T , T9 : T , T10 : T , T11 : T , T12 : T , T13 : T > Product13 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 , T12 , T13 > . asIterable ( ) : Iterable < T >","body":"= object : Iterable < T > { override fun iterator ( ) : Iterator < T > = JavaConverters . asJavaIterator < T > ( productIterator ( ) . map < T > { it as T } ) }","docstring":"/** Returns this product as an iterable of type [T]. */"} {"signature":"fun < T , T1 : T , T2 : T , T3 : T , T4 : T , T5 : T , T6 : T , T7 : T , T8 : T , T9 : T , T10 : T , T11 : T , T12 : T , T13 : T , T14 : T > Product14 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 , T12 , T13 , T14 > . asIterable ( ) : Iterable < T >","body":"= object : Iterable < T > { override fun iterator ( ) : Iterator < T > = JavaConverters . asJavaIterator < T > ( productIterator ( ) . map < T > { it as T } ) }","docstring":"/** Returns this product as an iterable of type [T]. */"} {"signature":"fun < T , T1 : T , T2 : T , T3 : T , T4 : T , T5 : T , T6 : T , T7 : T , T8 : T , T9 : T , T10 : T , T11 : T , T12 : T , T13 : T , T14 : T , T15 : T > Product15 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 , T12 , T13 , T14 , T15 > . asIterable ( ) : Iterable < T >","body":"= object : Iterable < T > { override fun iterator ( ) : Iterator < T > = JavaConverters . asJavaIterator < T > ( productIterator ( ) . map < T > { it as T } ) }","docstring":"/** Returns this product as an iterable of type [T]. */"} {"signature":"fun < T , T1 : T , T2 : T , T3 : T , T4 : T , T5 : T , T6 : T , T7 : T , T8 : T , T9 : T , T10 : T , T11 : T , T12 : T , T13 : T , T14 : T , T15 : T , T16 : T > Product16 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 , T12 , T13 , T14 , T15 , T16 > . asIterable ( ) : Iterable < T >","body":"= object : Iterable < T > { override fun iterator ( ) : Iterator < T > = JavaConverters . asJavaIterator < T > ( productIterator ( ) . map < T > { it as T } ) }","docstring":"/** Returns this product as an iterable of type [T]. */"} {"signature":"fun < T , T1 : T , T2 : T , T3 : T , T4 : T , T5 : T , T6 : T , T7 : T , T8 : T , T9 : T , T10 : T , T11 : T , T12 : T , T13 : T , T14 : T , T15 : T , T16 : T , T17 : T > Product17 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 , T12 , T13 , T14 , T15 , T16 , T17 > . asIterable ( ) : Iterable < T >","body":"= object : Iterable < T > { override fun iterator ( ) : Iterator < T > = JavaConverters . asJavaIterator < T > ( productIterator ( ) . map < T > { it as T } ) }","docstring":"/** Returns this product as an iterable of type [T]. */"} {"signature":"fun < T , T1 : T , T2 : T , T3 : T , T4 : T , T5 : T , T6 : T , T7 : T , T8 : T , T9 : T , T10 : T , T11 : T , T12 : T , T13 : T , T14 : T , T15 : T , T16 : T , T17 : T , T18 : T > Product18 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 , T12 , T13 , T14 , T15 , T16 , T17 , T18 > . asIterable ( ) : Iterable < T >","body":"= object : Iterable < T > { override fun iterator ( ) : Iterator < T > = JavaConverters . asJavaIterator < T > ( productIterator ( ) . map < T > { it as T } ) }","docstring":"/** Returns this product as an iterable of type [T]. */"} {"signature":"fun < T , T1 : T , T2 : T , T3 : T , T4 : T , T5 : T , T6 : T , T7 : T , T8 : T , T9 : T , T10 : T , T11 : T , T12 : T , T13 : T , T14 : T , T15 : T , T16 : T , T17 : T , T18 : T , T19 : T > Product19 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 , T12 , T13 , T14 , T15 , T16 , T17 , T18 , T19 > . asIterable ( ) : Iterable < T >","body":"= object : Iterable < T > { override fun iterator ( ) : Iterator < T > = JavaConverters . asJavaIterator < T > ( productIterator ( ) . map < T > { it as T } ) }","docstring":"/** Returns this product as an iterable of type [T]. */"} {"signature":"fun < T , T1 : T , T2 : T , T3 : T , T4 : T , T5 : T , T6 : T , T7 : T , T8 : T , T9 : T , T10 : T , T11 : T , T12 : T , T13 : T , T14 : T , T15 : T , T16 : T , T17 : T , T18 : T , T19 : T , T20 : T > Product20 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 , T12 , T13 , T14 , T15 , T16 , T17 , T18 , T19 , T20 > . asIterable ( ) : Iterable < T >","body":"= object : Iterable < T > { override fun iterator ( ) : Iterator < T > = JavaConverters . asJavaIterator < T > ( productIterator ( ) . map < T > { it as T } ) }","docstring":"/** Returns this product as an iterable of type [T]. */"} {"signature":"fun < T , T1 : T , T2 : T , T3 : T , T4 : T , T5 : T , T6 : T , T7 : T , T8 : T , T9 : T , T10 : T , T11 : T , T12 : T , T13 : T , T14 : T , T15 : T , T16 : T , T17 : T , T18 : T , T19 : T , T20 : T , T21 : T > Product21 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 , T12 , T13 , T14 , T15 , T16 , T17 , T18 , T19 , T20 , T21 > . asIterable ( ) : Iterable < T >","body":"= object : Iterable < T > { override fun iterator ( ) : Iterator < T > = JavaConverters . asJavaIterator < T > ( productIterator ( ) . map < T > { it as T } ) }","docstring":"/** Returns this product as an iterable of type [T]. */"} {"signature":"fun < T , T1 : T , T2 : T , T3 : T , T4 : T , T5 : T , T6 : T , T7 : T , T8 : T , T9 : T , T10 : T , T11 : T , T12 : T , T13 : T , T14 : T , T15 : T , T16 : T , T17 : T , T18 : T , T19 : T , T20 : T , T21 : T , T22 : T > Product22 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 , T12 , T13 , T14 , T15 , T16 , T17 , T18 , T19 , T20 , T21 , T22 > . asIterable ( ) : Iterable < T >","body":"= object : Iterable < T > { override fun iterator ( ) : Iterator < T > = JavaConverters . asJavaIterator < T > ( productIterator ( ) . map < T > { it as T } ) }","docstring":"/** Returns this product as an iterable of type [T]. */"} {"signature":"fun < T , T1 : T > Product1 < T1 > . toList ( ) : List < T >","body":"= listOf ( this . _1 ( ) )","docstring":"/** Returns list of type [T] for this product. */"} {"signature":"fun < T , T1 : T , T2 : T > Product2 < T1 , T2 > . toList ( ) : List < T >","body":"= listOf ( this . _1 ( ) , this . _2 ( ) )","docstring":"/** Returns list of type [T] for this product. */"} {"signature":"fun < T , T1 : T , T2 : T , T3 : T > Product3 < T1 , T2 , T3 > . toList ( ) : List < T >","body":"= listOf ( this . _1 ( ) , this . _2 ( ) , this . _3 ( ) )","docstring":"/** Returns list of type [T] for this product. */"} {"signature":"fun < T , T1 : T , T2 : T , T3 : T , T4 : T > Product4 < T1 , T2 , T3 , T4 > . toList ( ) : List < T >","body":"= listOf ( this . _1 ( ) , this . _2 ( ) , this . _3 ( ) , this . _4 ( ) )","docstring":"/** Returns list of type [T] for this product. */"} {"signature":"fun < T , T1 : T , T2 : T , T3 : T , T4 : T , T5 : T > Product5 < T1 , T2 , T3 , T4 , T5 > . toList ( ) : List < T >","body":"= listOf ( this . _1 ( ) , this . _2 ( ) , this . _3 ( ) , this . _4 ( ) , this . _5 ( ) )","docstring":"/** Returns list of type [T] for this product. */"} {"signature":"fun < T , T1 : T , T2 : T , T3 : T , T4 : T , T5 : T , T6 : T > Product6 < T1 , T2 , T3 , T4 , T5 , T6 > . toList ( ) : List < T >","body":"= listOf ( this . _1 ( ) , this . _2 ( ) , this . _3 ( ) , this . _4 ( ) , this . _5 ( ) , this . _6 ( ) )","docstring":"/** Returns list of type [T] for this product. */"} {"signature":"fun < T , T1 : T , T2 : T , T3 : T , T4 : T , T5 : T , T6 : T , T7 : T > Product7 < T1 , T2 , T3 , T4 , T5 , T6 , T7 > . toList ( ) : List < T >","body":"= listOf ( this . _1 ( ) , this . _2 ( ) , this . _3 ( ) , this . _4 ( ) , this . _5 ( ) , this . _6 ( ) , this . _7 ( ) )","docstring":"/** Returns list of type [T] for this product. */"} {"signature":"fun < T , T1 : T , T2 : T , T3 : T , T4 : T , T5 : T , T6 : T , T7 : T , T8 : T > Product8 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 > . toList ( ) : List < T >","body":"= listOf ( this . _1 ( ) , this . _2 ( ) , this . _3 ( ) , this . _4 ( ) , this . _5 ( ) , this . _6 ( ) , this . _7 ( ) , this . _8 ( ) )","docstring":"/** Returns list of type [T] for this product. */"} {"signature":"fun < T , T1 : T , T2 : T , T3 : T , T4 : T , T5 : T , T6 : T , T7 : T , T8 : T , T9 : T > Product9 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 > . toList ( ) : List < T >","body":"= listOf ( this . _1 ( ) , this . _2 ( ) , this . _3 ( ) , this . _4 ( ) , this . _5 ( ) , this . _6 ( ) , this . _7 ( ) , this . _8 ( ) , this . _9 ( ) )","docstring":"/** Returns list of type [T] for this product. */"} {"signature":"fun < T , T1 : T , T2 : T , T3 : T , T4 : T , T5 : T , T6 : T , T7 : T , T8 : T , T9 : T , T10 : T > Product10 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 > . toList ( ) : List < T >","body":"= listOf ( this . _1 ( ) , this . _2 ( ) , this . _3 ( ) , this . _4 ( ) , this . _5 ( ) , this . _6 ( ) , this . _7 ( ) , this . _8 ( ) , this . _9 ( ) , this . _10 ( ) )","docstring":"/** Returns list of type [T] for this product. */"} {"signature":"fun < T , T1 : T , T2 : T , T3 : T , T4 : T , T5 : T , T6 : T , T7 : T , T8 : T , T9 : T , T10 : T , T11 : T > Product11 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 > . toList ( ) : List < T >","body":"= listOf ( this . _1 ( ) , this . _2 ( ) , this . _3 ( ) , this . _4 ( ) , this . _5 ( ) , this . _6 ( ) , this . _7 ( ) , this . _8 ( ) , this . _9 ( ) , this . _10 ( ) , this . _11 ( ) )","docstring":"/** Returns list of type [T] for this product. */"} {"signature":"fun < T , T1 : T , T2 : T , T3 : T , T4 : T , T5 : T , T6 : T , T7 : T , T8 : T , T9 : T , T10 : T , T11 : T , T12 : T > Product12 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 , T12 > . toList ( ) : List < T >","body":"= listOf ( this . _1 ( ) , this . _2 ( ) , this . _3 ( ) , this . _4 ( ) , this . _5 ( ) , this . _6 ( ) , this . _7 ( ) , this . _8 ( ) , this . _9 ( ) , this . _10 ( ) , this . _11 ( ) , this . _12 ( ) )","docstring":"/** Returns list of type [T] for this product. */"} {"signature":"fun < T , T1 : T , T2 : T , T3 : T , T4 : T , T5 : T , T6 : T , T7 : T , T8 : T , T9 : T , T10 : T , T11 : T , T12 : T , T13 : T > Product13 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 , T12 , T13 > . toList ( ) : List < T >","body":"= listOf ( this . _1 ( ) , this . _2 ( ) , this . _3 ( ) , this . _4 ( ) , this . _5 ( ) , this . _6 ( ) , this . _7 ( ) , this . _8 ( ) , this . _9 ( ) , this . _10 ( ) , this . _11 ( ) , this . _12 ( ) , this . _13 ( ) )","docstring":"/** Returns list of type [T] for this product. */"} {"signature":"fun < T , T1 : T , T2 : T , T3 : T , T4 : T , T5 : T , T6 : T , T7 : T , T8 : T , T9 : T , T10 : T , T11 : T , T12 : T , T13 : T , T14 : T > Product14 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 , T12 , T13 , T14 > . toList ( ) : List < T >","body":"= listOf ( this . _1 ( ) , this . _2 ( ) , this . _3 ( ) , this . _4 ( ) , this . _5 ( ) , this . _6 ( ) , this . _7 ( ) , this . _8 ( ) , this . _9 ( ) , this . _10 ( ) , this . _11 ( ) , this . _12 ( ) , this . _13 ( ) , this . _14 ( ) )","docstring":"/** Returns list of type [T] for this product. */"} {"signature":"fun < T , T1 : T , T2 : T , T3 : T , T4 : T , T5 : T , T6 : T , T7 : T , T8 : T , T9 : T , T10 : T , T11 : T , T12 : T , T13 : T , T14 : T , T15 : T > Product15 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 , T12 , T13 , T14 , T15 > . toList ( ) : List < T >","body":"= listOf ( this . _1 ( ) , this . _2 ( ) , this . _3 ( ) , this . _4 ( ) , this . _5 ( ) , this . _6 ( ) , this . _7 ( ) , this . _8 ( ) , this . _9 ( ) , this . _10 ( ) , this . _11 ( ) , this . _12 ( ) , this . _13 ( ) , this . _14 ( ) , this . _15 ( ) )","docstring":"/** Returns list of type [T] for this product. */"} {"signature":"fun < T , T1 : T , T2 : T , T3 : T , T4 : T , T5 : T , T6 : T , T7 : T , T8 : T , T9 : T , T10 : T , T11 : T , T12 : T , T13 : T , T14 : T , T15 : T , T16 : T > Product16 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 , T12 , T13 , T14 , T15 , T16 > . toList ( ) : List < T >","body":"= listOf ( this . _1 ( ) , this . _2 ( ) , this . _3 ( ) , this . _4 ( ) , this . _5 ( ) , this . _6 ( ) , this . _7 ( ) , this . _8 ( ) , this . _9 ( ) , this . _10 ( ) , this . _11 ( ) , this . _12 ( ) , this . _13 ( ) , this . _14 ( ) , this . _15 ( ) , this . _16 ( ) )","docstring":"/** Returns list of type [T] for this product. */"} {"signature":"fun < T , T1 : T , T2 : T , T3 : T , T4 : T , T5 : T , T6 : T , T7 : T , T8 : T , T9 : T , T10 : T , T11 : T , T12 : T , T13 : T , T14 : T , T15 : T , T16 : T , T17 : T > Product17 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 , T12 , T13 , T14 , T15 , T16 , T17 > . toList ( ) : List < T >","body":"= listOf ( this . _1 ( ) , this . _2 ( ) , this . _3 ( ) , this . _4 ( ) , this . _5 ( ) , this . _6 ( ) , this . _7 ( ) , this . _8 ( ) , this . _9 ( ) , this . _10 ( ) , this . _11 ( ) , this . _12 ( ) , this . _13 ( ) , this . _14 ( ) , this . _15 ( ) , this . _16 ( ) , this . _17 ( ) )","docstring":"/** Returns list of type [T] for this product. */"} {"signature":"fun < T , T1 : T , T2 : T , T3 : T , T4 : T , T5 : T , T6 : T , T7 : T , T8 : T , T9 : T , T10 : T , T11 : T , T12 : T , T13 : T , T14 : T , T15 : T , T16 : T , T17 : T , T18 : T > Product18 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 , T12 , T13 , T14 , T15 , T16 , T17 , T18 > . toList ( ) : List < T >","body":"= listOf ( this . _1 ( ) , this . _2 ( ) , this . _3 ( ) , this . _4 ( ) , this . _5 ( ) , this . _6 ( ) , this . _7 ( ) , this . _8 ( ) , this . _9 ( ) , this . _10 ( ) , this . _11 ( ) , this . _12 ( ) , this . _13 ( ) , this . _14 ( ) , this . _15 ( ) , this . _16 ( ) , this . _17 ( ) , this . _18 ( ) )","docstring":"/** Returns list of type [T] for this product. */"} {"signature":"fun < T , T1 : T , T2 : T , T3 : T , T4 : T , T5 : T , T6 : T , T7 : T , T8 : T , T9 : T , T10 : T , T11 : T , T12 : T , T13 : T , T14 : T , T15 : T , T16 : T , T17 : T , T18 : T , T19 : T > Product19 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 , T12 , T13 , T14 , T15 , T16 , T17 , T18 , T19 > . toList ( ) : List < T >","body":"= listOf ( this . _1 ( ) , this . _2 ( ) , this . _3 ( ) , this . _4 ( ) , this . _5 ( ) , this . _6 ( ) , this . _7 ( ) , this . _8 ( ) , this . _9 ( ) , this . _10 ( ) , this . _11 ( ) , this . _12 ( ) , this . _13 ( ) , this . _14 ( ) , this . _15 ( ) , this . _16 ( ) , this . _17 ( ) , this . _18 ( ) , this . _19 ( ) )","docstring":"/** Returns list of type [T] for this product. */"} {"signature":"fun < T , T1 : T , T2 : T , T3 : T , T4 : T , T5 : T , T6 : T , T7 : T , T8 : T , T9 : T , T10 : T , T11 : T , T12 : T , T13 : T , T14 : T , T15 : T , T16 : T , T17 : T , T18 : T , T19 : T , T20 : T > Product20 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 , T12 , T13 , T14 , T15 , T16 , T17 , T18 , T19 , T20 > . toList ( ) : List < T >","body":"= listOf ( this . _1 ( ) , this . _2 ( ) , this . _3 ( ) , this . _4 ( ) , this . _5 ( ) , this . _6 ( ) , this . _7 ( ) , this . _8 ( ) , this . _9 ( ) , this . _10 ( ) , this . _11 ( ) , this . _12 ( ) , this . _13 ( ) , this . _14 ( ) , this . _15 ( ) , this . _16 ( ) , this . _17 ( ) , this . _18 ( ) , this . _19 ( ) , this . _20 ( ) )","docstring":"/** Returns list of type [T] for this product. */"} {"signature":"fun < T , T1 : T , T2 : T , T3 : T , T4 : T , T5 : T , T6 : T , T7 : T , T8 : T , T9 : T , T10 : T , T11 : T , T12 : T , T13 : T , T14 : T , T15 : T , T16 : T , T17 : T , T18 : T , T19 : T , T20 : T , T21 : T > Product21 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 , T12 , T13 , T14 , T15 , T16 , T17 , T18 , T19 , T20 , T21 > . toList ( ) : List < T >","body":"= listOf ( this . _1 ( ) , this . _2 ( ) , this . _3 ( ) , this . _4 ( ) , this . _5 ( ) , this . _6 ( ) , this . _7 ( ) , this . _8 ( ) , this . _9 ( ) , this . _10 ( ) , this . _11 ( ) , this . _12 ( ) , this . _13 ( ) , this . _14 ( ) , this . _15 ( ) , this . _16 ( ) , this . _17 ( ) , this . _18 ( ) , this . _19 ( ) , this . _20 ( ) , this . _21 ( ) )","docstring":"/** Returns list of type [T] for this product. */"} {"signature":"fun < T , T1 : T , T2 : T , T3 : T , T4 : T , T5 : T , T6 : T , T7 : T , T8 : T , T9 : T , T10 : T , T11 : T , T12 : T , T13 : T , T14 : T , T15 : T , T16 : T , T17 : T , T18 : T , T19 : T , T20 : T , T21 : T , T22 : T > Product22 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 , T12 , T13 , T14 , T15 , T16 , T17 , T18 , T19 , T20 , T21 , T22 > . toList ( ) : List < T >","body":"= listOf ( this . _1 ( ) , this . _2 ( ) , this . _3 ( ) , this . _4 ( ) , this . _5 ( ) , this . _6 ( ) , this . _7 ( ) , this . _8 ( ) , this . _9 ( ) , this . _10 ( ) , this . _11 ( ) , this . _12 ( ) , this . _13 ( ) , this . _14 ( ) , this . _15 ( ) , this . _16 ( ) , this . _17 ( ) , this . _18 ( ) , this . _19 ( ) , this . _20 ( ) , this . _21 ( ) , this . _22 ( ) )","docstring":"/** Returns list of type [T] for this product. */"} {"signature":"@ Throws ( IndexOutOfBoundsException :: class ) operator fun < T , T1 : T > Product1 < T1 > . get ( n : Int ) : T","body":"= productElement ( n ) as T","docstring":"/** The n'th element of this product, 0-based. In other words, for a\n * product `A(x,,1,,, ..., x,,k,,)`, returns `x,,(n+1),,` where `0 <= n < k`.\n *\n * @param n the index of the element to return\n * @throws IndexOutOfBoundsException\n * @return the element `n` elements after the first element\n */"} {"signature":"@ Throws ( IndexOutOfBoundsException :: class ) operator fun < T , T1 : T , T2 : T > Product2 < T1 , T2 > . get ( n : Int ) : T","body":"= productElement ( n ) as T","docstring":"/** The n'th element of this product, 0-based. In other words, for a\n * product `A(x,,1,,, ..., x,,k,,)`, returns `x,,(n+1),,` where `0 <= n < k`.\n *\n * @param n the index of the element to return\n * @throws IndexOutOfBoundsException\n * @return the element `n` elements after the first element\n */"} {"signature":"@ Throws ( IndexOutOfBoundsException :: class ) operator fun < T , T1 : T , T2 : T , T3 : T > Product3 < T1 , T2 , T3 > . get ( n : Int ) : T","body":"= productElement ( n ) as T","docstring":"/** The n'th element of this product, 0-based. In other words, for a\n * product `A(x,,1,,, ..., x,,k,,)`, returns `x,,(n+1),,` where `0 <= n < k`.\n *\n * @param n the index of the element to return\n * @throws IndexOutOfBoundsException\n * @return the element `n` elements after the first element\n */"} {"signature":"@ Throws ( IndexOutOfBoundsException :: class ) operator fun < T , T1 : T , T2 : T , T3 : T , T4 : T > Product4 < T1 , T2 , T3 , T4 > . get ( n : Int ) : T","body":"= productElement ( n ) as T","docstring":"/** The n'th element of this product, 0-based. In other words, for a\n * product `A(x,,1,,, ..., x,,k,,)`, returns `x,,(n+1),,` where `0 <= n < k`.\n *\n * @param n the index of the element to return\n * @throws IndexOutOfBoundsException\n * @return the element `n` elements after the first element\n */"} {"signature":"@ Throws ( IndexOutOfBoundsException :: class ) operator fun < T , T1 : T , T2 : T , T3 : T , T4 : T , T5 : T > Product5 < T1 , T2 , T3 , T4 , T5 > . get ( n : Int ) : T","body":"= productElement ( n ) as T","docstring":"/** The n'th element of this product, 0-based. In other words, for a\n * product `A(x,,1,,, ..., x,,k,,)`, returns `x,,(n+1),,` where `0 <= n < k`.\n *\n * @param n the index of the element to return\n * @throws IndexOutOfBoundsException\n * @return the element `n` elements after the first element\n */"} {"signature":"@ Throws ( IndexOutOfBoundsException :: class ) operator fun < T , T1 : T , T2 : T , T3 : T , T4 : T , T5 : T , T6 : T > Product6 < T1 , T2 , T3 , T4 , T5 , T6 > . get ( n : Int ) : T","body":"= productElement ( n ) as T","docstring":"/** The n'th element of this product, 0-based. In other words, for a\n * product `A(x,,1,,, ..., x,,k,,)`, returns `x,,(n+1),,` where `0 <= n < k`.\n *\n * @param n the index of the element to return\n * @throws IndexOutOfBoundsException\n * @return the element `n` elements after the first element\n */"} {"signature":"@ Throws ( IndexOutOfBoundsException :: class ) operator fun < T , T1 : T , T2 : T , T3 : T , T4 : T , T5 : T , T6 : T , T7 : T > Product7 < T1 , T2 , T3 , T4 , T5 , T6 , T7 > . get ( n : Int ) : T","body":"= productElement ( n ) as T","docstring":"/** The n'th element of this product, 0-based. In other words, for a\n * product `A(x,,1,,, ..., x,,k,,)`, returns `x,,(n+1),,` where `0 <= n < k`.\n *\n * @param n the index of the element to return\n * @throws IndexOutOfBoundsException\n * @return the element `n` elements after the first element\n */"} {"signature":"@ Throws ( IndexOutOfBoundsException :: class ) operator fun < T , T1 : T , T2 : T , T3 : T , T4 : T , T5 : T , T6 : T , T7 : T , T8 : T > Product8 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 > . get ( n : Int ) : T","body":"= productElement ( n ) as T","docstring":"/** The n'th element of this product, 0-based. In other words, for a\n * product `A(x,,1,,, ..., x,,k,,)`, returns `x,,(n+1),,` where `0 <= n < k`.\n *\n * @param n the index of the element to return\n * @throws IndexOutOfBoundsException\n * @return the element `n` elements after the first element\n */"} {"signature":"@ Throws ( IndexOutOfBoundsException :: class ) operator fun < T , T1 : T , T2 : T , T3 : T , T4 : T , T5 : T , T6 : T , T7 : T , T8 : T , T9 : T > Product9 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 > . get ( n : Int ) : T","body":"= productElement ( n ) as T","docstring":"/** The n'th element of this product, 0-based. In other words, for a\n * product `A(x,,1,,, ..., x,,k,,)`, returns `x,,(n+1),,` where `0 <= n < k`.\n *\n * @param n the index of the element to return\n * @throws IndexOutOfBoundsException\n * @return the element `n` elements after the first element\n */"} {"signature":"@ Throws ( IndexOutOfBoundsException :: class ) operator fun < T , T1 : T , T2 : T , T3 : T , T4 : T , T5 : T , T6 : T , T7 : T , T8 : T , T9 : T , T10 : T > Product10 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 > . get ( n : Int ) : T","body":"= productElement ( n ) as T","docstring":"/** The n'th element of this product, 0-based. In other words, for a\n * product `A(x,,1,,, ..., x,,k,,)`, returns `x,,(n+1),,` where `0 <= n < k`.\n *\n * @param n the index of the element to return\n * @throws IndexOutOfBoundsException\n * @return the element `n` elements after the first element\n */"} {"signature":"@ Throws ( IndexOutOfBoundsException :: class ) operator fun < T , T1 : T , T2 : T , T3 : T , T4 : T , T5 : T , T6 : T , T7 : T , T8 : T , T9 : T , T10 : T , T11 : T > Product11 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 > . get ( n : Int ) : T","body":"= productElement ( n ) as T","docstring":"/** The n'th element of this product, 0-based. In other words, for a\n * product `A(x,,1,,, ..., x,,k,,)`, returns `x,,(n+1),,` where `0 <= n < k`.\n *\n * @param n the index of the element to return\n * @throws IndexOutOfBoundsException\n * @return the element `n` elements after the first element\n */"} {"signature":"@ Throws ( IndexOutOfBoundsException :: class ) operator fun < T , T1 : T , T2 : T , T3 : T , T4 : T , T5 : T , T6 : T , T7 : T , T8 : T , T9 : T , T10 : T , T11 : T , T12 : T > Product12 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 , T12 > . get ( n : Int ) : T","body":"= productElement ( n ) as T","docstring":"/** The n'th element of this product, 0-based. In other words, for a\n * product `A(x,,1,,, ..., x,,k,,)`, returns `x,,(n+1),,` where `0 <= n < k`.\n *\n * @param n the index of the element to return\n * @throws IndexOutOfBoundsException\n * @return the element `n` elements after the first element\n */"} {"signature":"@ Throws ( IndexOutOfBoundsException :: class ) operator fun < T , T1 : T , T2 : T , T3 : T , T4 : T , T5 : T , T6 : T , T7 : T , T8 : T , T9 : T , T10 : T , T11 : T , T12 : T , T13 : T > Product13 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 , T12 , T13 > . get ( n : Int ) : T","body":"= productElement ( n ) as T","docstring":"/** The n'th element of this product, 0-based. In other words, for a\n * product `A(x,,1,,, ..., x,,k,,)`, returns `x,,(n+1),,` where `0 <= n < k`.\n *\n * @param n the index of the element to return\n * @throws IndexOutOfBoundsException\n * @return the element `n` elements after the first element\n */"} {"signature":"@ Throws ( IndexOutOfBoundsException :: class ) operator fun < T , T1 : T , T2 : T , T3 : T , T4 : T , T5 : T , T6 : T , T7 : T , T8 : T , T9 : T , T10 : T , T11 : T , T12 : T , T13 : T , T14 : T > Product14 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 , T12 , T13 , T14 > . get ( n : Int ) : T","body":"= productElement ( n ) as T","docstring":"/** The n'th element of this product, 0-based. In other words, for a\n * product `A(x,,1,,, ..., x,,k,,)`, returns `x,,(n+1),,` where `0 <= n < k`.\n *\n * @param n the index of the element to return\n * @throws IndexOutOfBoundsException\n * @return the element `n` elements after the first element\n */"} {"signature":"@ Throws ( IndexOutOfBoundsException :: class ) operator fun < T , T1 : T , T2 : T , T3 : T , T4 : T , T5 : T , T6 : T , T7 : T , T8 : T , T9 : T , T10 : T , T11 : T , T12 : T , T13 : T , T14 : T , T15 : T > Product15 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 , T12 , T13 , T14 , T15 > . get ( n : Int ) : T","body":"= productElement ( n ) as T","docstring":"/** The n'th element of this product, 0-based. In other words, for a\n * product `A(x,,1,,, ..., x,,k,,)`, returns `x,,(n+1),,` where `0 <= n < k`.\n *\n * @param n the index of the element to return\n * @throws IndexOutOfBoundsException\n * @return the element `n` elements after the first element\n */"} {"signature":"@ Throws ( IndexOutOfBoundsException :: class ) operator fun < T , T1 : T , T2 : T , T3 : T , T4 : T , T5 : T , T6 : T , T7 : T , T8 : T , T9 : T , T10 : T , T11 : T , T12 : T , T13 : T , T14 : T , T15 : T , T16 : T > Product16 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 , T12 , T13 , T14 , T15 , T16 > . get ( n : Int ) : T","body":"= productElement ( n ) as T","docstring":"/** The n'th element of this product, 0-based. In other words, for a\n * product `A(x,,1,,, ..., x,,k,,)`, returns `x,,(n+1),,` where `0 <= n < k`.\n *\n * @param n the index of the element to return\n * @throws IndexOutOfBoundsException\n * @return the element `n` elements after the first element\n */"} {"signature":"@ Throws ( IndexOutOfBoundsException :: class ) operator fun < T , T1 : T , T2 : T , T3 : T , T4 : T , T5 : T , T6 : T , T7 : T , T8 : T , T9 : T , T10 : T , T11 : T , T12 : T , T13 : T , T14 : T , T15 : T , T16 : T , T17 : T > Product17 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 , T12 , T13 , T14 , T15 , T16 , T17 > . get ( n : Int ) : T","body":"= productElement ( n ) as T","docstring":"/** The n'th element of this product, 0-based. In other words, for a\n * product `A(x,,1,,, ..., x,,k,,)`, returns `x,,(n+1),,` where `0 <= n < k`.\n *\n * @param n the index of the element to return\n * @throws IndexOutOfBoundsException\n * @return the element `n` elements after the first element\n */"} {"signature":"@ Throws ( IndexOutOfBoundsException :: class ) operator fun < T , T1 : T , T2 : T , T3 : T , T4 : T , T5 : T , T6 : T , T7 : T , T8 : T , T9 : T , T10 : T , T11 : T , T12 : T , T13 : T , T14 : T , T15 : T , T16 : T , T17 : T , T18 : T > Product18 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 , T12 , T13 , T14 , T15 , T16 , T17 , T18 > . get ( n : Int ) : T","body":"= productElement ( n ) as T","docstring":"/** The n'th element of this product, 0-based. In other words, for a\n * product `A(x,,1,,, ..., x,,k,,)`, returns `x,,(n+1),,` where `0 <= n < k`.\n *\n * @param n the index of the element to return\n * @throws IndexOutOfBoundsException\n * @return the element `n` elements after the first element\n */"} {"signature":"@ Throws ( IndexOutOfBoundsException :: class ) operator fun < T , T1 : T , T2 : T , T3 : T , T4 : T , T5 : T , T6 : T , T7 : T , T8 : T , T9 : T , T10 : T , T11 : T , T12 : T , T13 : T , T14 : T , T15 : T , T16 : T , T17 : T , T18 : T , T19 : T > Product19 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 , T12 , T13 , T14 , T15 , T16 , T17 , T18 , T19 > . get ( n : Int ) : T","body":"= productElement ( n ) as T","docstring":"/** The n'th element of this product, 0-based. In other words, for a\n * product `A(x,,1,,, ..., x,,k,,)`, returns `x,,(n+1),,` where `0 <= n < k`.\n *\n * @param n the index of the element to return\n * @throws IndexOutOfBoundsException\n * @return the element `n` elements after the first element\n */"} {"signature":"@ Throws ( IndexOutOfBoundsException :: class ) operator fun < T , T1 : T , T2 : T , T3 : T , T4 : T , T5 : T , T6 : T , T7 : T , T8 : T , T9 : T , T10 : T , T11 : T , T12 : T , T13 : T , T14 : T , T15 : T , T16 : T , T17 : T , T18 : T , T19 : T , T20 : T > Product20 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 , T12 , T13 , T14 , T15 , T16 , T17 , T18 , T19 , T20 > . get ( n : Int ) : T","body":"= productElement ( n ) as T","docstring":"/** The n'th element of this product, 0-based. In other words, for a\n * product `A(x,,1,,, ..., x,,k,,)`, returns `x,,(n+1),,` where `0 <= n < k`.\n *\n * @param n the index of the element to return\n * @throws IndexOutOfBoundsException\n * @return the element `n` elements after the first element\n */"} {"signature":"@ Throws ( IndexOutOfBoundsException :: class ) operator fun < T , T1 : T , T2 : T , T3 : T , T4 : T , T5 : T , T6 : T , T7 : T , T8 : T , T9 : T , T10 : T , T11 : T , T12 : T , T13 : T , T14 : T , T15 : T , T16 : T , T17 : T , T18 : T , T19 : T , T20 : T , T21 : T > Product21 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 , T12 , T13 , T14 , T15 , T16 , T17 , T18 , T19 , T20 , T21 > . get ( n : Int ) : T","body":"= productElement ( n ) as T","docstring":"/** The n'th element of this product, 0-based. In other words, for a\n * product `A(x,,1,,, ..., x,,k,,)`, returns `x,,(n+1),,` where `0 <= n < k`.\n *\n * @param n the index of the element to return\n * @throws IndexOutOfBoundsException\n * @return the element `n` elements after the first element\n */"} {"signature":"@ Throws ( IndexOutOfBoundsException :: class ) operator fun < T , T1 : T , T2 : T , T3 : T , T4 : T , T5 : T , T6 : T , T7 : T , T8 : T , T9 : T , T10 : T , T11 : T , T12 : T , T13 : T , T14 : T , T15 : T , T16 : T , T17 : T , T18 : T , T19 : T , T20 : T , T21 : T , T22 : T > Product22 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 , T12 , T13 , T14 , T15 , T16 , T17 , T18 , T19 , T20 , T21 , T22 > . get ( n : Int ) : T","body":"= productElement ( n ) as T","docstring":"/** The n'th element of this product, 0-based. In other words, for a\n * product `A(x,,1,,, ..., x,,k,,)`, returns `x,,(n+1),,` where `0 <= n < k`.\n *\n * @param n the index of the element to return\n * @throws IndexOutOfBoundsException\n * @return the element `n` elements after the first element\n */"} {"signature":"fun < T , T1 : T > Product1 < T1 > . getOrNull ( n : Int ) : T ?","body":"= ( if ( n in until size ) productElement ( n ) as T else null )","docstring":"/** The n'th element of this product, 0-based. In other words, for a\n * product `A(x,,1,,, ..., x,,k,,)`, returns `x,,(n+1),,` where `0 <= n < k`.\n *\n * @param n the index of the element to return\n * @return the element `n` elements after the first element, `null` if out of bounds\n */"} {"signature":"fun < T , T1 : T , T2 : T > Product2 < T1 , T2 > . getOrNull ( n : Int ) : T ?","body":"= ( if ( n in until size ) productElement ( n ) as T else null )","docstring":"/** The n'th element of this product, 0-based. In other words, for a\n * product `A(x,,1,,, ..., x,,k,,)`, returns `x,,(n+1),,` where `0 <= n < k`.\n *\n * @param n the index of the element to return\n * @return the element `n` elements after the first element, `null` if out of bounds\n */"} {"signature":"fun < T , T1 : T , T2 : T , T3 : T > Product3 < T1 , T2 , T3 > . getOrNull ( n : Int ) : T ?","body":"= ( if ( n in until size ) productElement ( n ) as T else null )","docstring":"/** The n'th element of this product, 0-based. In other words, for a\n * product `A(x,,1,,, ..., x,,k,,)`, returns `x,,(n+1),,` where `0 <= n < k`.\n *\n * @param n the index of the element to return\n * @return the element `n` elements after the first element, `null` if out of bounds\n */"} {"signature":"fun < T , T1 : T , T2 : T , T3 : T , T4 : T > Product4 < T1 , T2 , T3 , T4 > . getOrNull ( n : Int ) : T ?","body":"= ( if ( n in until size ) productElement ( n ) as T else null )","docstring":"/** The n'th element of this product, 0-based. In other words, for a\n * product `A(x,,1,,, ..., x,,k,,)`, returns `x,,(n+1),,` where `0 <= n < k`.\n *\n * @param n the index of the element to return\n * @return the element `n` elements after the first element, `null` if out of bounds\n */"} {"signature":"fun < T , T1 : T , T2 : T , T3 : T , T4 : T , T5 : T > Product5 < T1 , T2 , T3 , T4 , T5 > . getOrNull ( n : Int ) : T ?","body":"= ( if ( n in until size ) productElement ( n ) as T else null )","docstring":"/** The n'th element of this product, 0-based. In other words, for a\n * product `A(x,,1,,, ..., x,,k,,)`, returns `x,,(n+1),,` where `0 <= n < k`.\n *\n * @param n the index of the element to return\n * @return the element `n` elements after the first element, `null` if out of bounds\n */"} {"signature":"fun < T , T1 : T , T2 : T , T3 : T , T4 : T , T5 : T , T6 : T > Product6 < T1 , T2 , T3 , T4 , T5 , T6 > . getOrNull ( n : Int ) : T ?","body":"= ( if ( n in until size ) productElement ( n ) as T else null )","docstring":"/** The n'th element of this product, 0-based. In other words, for a\n * product `A(x,,1,,, ..., x,,k,,)`, returns `x,,(n+1),,` where `0 <= n < k`.\n *\n * @param n the index of the element to return\n * @return the element `n` elements after the first element, `null` if out of bounds\n */"} {"signature":"fun < T , T1 : T , T2 : T , T3 : T , T4 : T , T5 : T , T6 : T , T7 : T > Product7 < T1 , T2 , T3 , T4 , T5 , T6 , T7 > . getOrNull ( n : Int ) : T ?","body":"= ( if ( n in until size ) productElement ( n ) as T else null )","docstring":"/** The n'th element of this product, 0-based. In other words, for a\n * product `A(x,,1,,, ..., x,,k,,)`, returns `x,,(n+1),,` where `0 <= n < k`.\n *\n * @param n the index of the element to return\n * @return the element `n` elements after the first element, `null` if out of bounds\n */"} {"signature":"fun < T , T1 : T , T2 : T , T3 : T , T4 : T , T5 : T , T6 : T , T7 : T , T8 : T > Product8 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 > . getOrNull ( n : Int ) : T ?","body":"= ( if ( n in until size ) productElement ( n ) as T else null )","docstring":"/** The n'th element of this product, 0-based. In other words, for a\n * product `A(x,,1,,, ..., x,,k,,)`, returns `x,,(n+1),,` where `0 <= n < k`.\n *\n * @param n the index of the element to return\n * @return the element `n` elements after the first element, `null` if out of bounds\n */"} {"signature":"fun < T , T1 : T , T2 : T , T3 : T , T4 : T , T5 : T , T6 : T , T7 : T , T8 : T , T9 : T > Product9 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 > . getOrNull ( n : Int ) : T ?","body":"= ( if ( n in until size ) productElement ( n ) as T else null )","docstring":"/** The n'th element of this product, 0-based. In other words, for a\n * product `A(x,,1,,, ..., x,,k,,)`, returns `x,,(n+1),,` where `0 <= n < k`.\n *\n * @param n the index of the element to return\n * @return the element `n` elements after the first element, `null` if out of bounds\n */"} {"signature":"fun < T , T1 : T , T2 : T , T3 : T , T4 : T , T5 : T , T6 : T , T7 : T , T8 : T , T9 : T , T10 : T > Product10 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 > . getOrNull ( n : Int ) : T ?","body":"= ( if ( n in until size ) productElement ( n ) as T else null )","docstring":"/** The n'th element of this product, 0-based. In other words, for a\n * product `A(x,,1,,, ..., x,,k,,)`, returns `x,,(n+1),,` where `0 <= n < k`.\n *\n * @param n the index of the element to return\n * @return the element `n` elements after the first element, `null` if out of bounds\n */"} {"signature":"fun < T , T1 : T , T2 : T , T3 : T , T4 : T , T5 : T , T6 : T , T7 : T , T8 : T , T9 : T , T10 : T , T11 : T > Product11 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 > . getOrNull ( n : Int ) : T ?","body":"= ( if ( n in until size ) productElement ( n ) as T else null )","docstring":"/** The n'th element of this product, 0-based. In other words, for a\n * product `A(x,,1,,, ..., x,,k,,)`, returns `x,,(n+1),,` where `0 <= n < k`.\n *\n * @param n the index of the element to return\n * @return the element `n` elements after the first element, `null` if out of bounds\n */"} {"signature":"fun < T , T1 : T , T2 : T , T3 : T , T4 : T , T5 : T , T6 : T , T7 : T , T8 : T , T9 : T , T10 : T , T11 : T , T12 : T > Product12 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 , T12 > . getOrNull ( n : Int ) : T ?","body":"= ( if ( n in until size ) productElement ( n ) as T else null )","docstring":"/** The n'th element of this product, 0-based. In other words, for a\n * product `A(x,,1,,, ..., x,,k,,)`, returns `x,,(n+1),,` where `0 <= n < k`.\n *\n * @param n the index of the element to return\n * @return the element `n` elements after the first element, `null` if out of bounds\n */"} {"signature":"fun < T , T1 : T , T2 : T , T3 : T , T4 : T , T5 : T , T6 : T , T7 : T , T8 : T , T9 : T , T10 : T , T11 : T , T12 : T , T13 : T > Product13 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 , T12 , T13 > . getOrNull ( n : Int ) : T ?","body":"= ( if ( n in until size ) productElement ( n ) as T else null )","docstring":"/** The n'th element of this product, 0-based. In other words, for a\n * product `A(x,,1,,, ..., x,,k,,)`, returns `x,,(n+1),,` where `0 <= n < k`.\n *\n * @param n the index of the element to return\n * @return the element `n` elements after the first element, `null` if out of bounds\n */"} {"signature":"fun < T , T1 : T , T2 : T , T3 : T , T4 : T , T5 : T , T6 : T , T7 : T , T8 : T , T9 : T , T10 : T , T11 : T , T12 : T , T13 : T , T14 : T > Product14 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 , T12 , T13 , T14 > . getOrNull ( n : Int ) : T ?","body":"= ( if ( n in until size ) productElement ( n ) as T else null )","docstring":"/** The n'th element of this product, 0-based. In other words, for a\n * product `A(x,,1,,, ..., x,,k,,)`, returns `x,,(n+1),,` where `0 <= n < k`.\n *\n * @param n the index of the element to return\n * @return the element `n` elements after the first element, `null` if out of bounds\n */"} {"signature":"fun < T , T1 : T , T2 : T , T3 : T , T4 : T , T5 : T , T6 : T , T7 : T , T8 : T , T9 : T , T10 : T , T11 : T , T12 : T , T13 : T , T14 : T , T15 : T > Product15 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 , T12 , T13 , T14 , T15 > . getOrNull ( n : Int ) : T ?","body":"= ( if ( n in until size ) productElement ( n ) as T else null )","docstring":"/** The n'th element of this product, 0-based. In other words, for a\n * product `A(x,,1,,, ..., x,,k,,)`, returns `x,,(n+1),,` where `0 <= n < k`.\n *\n * @param n the index of the element to return\n * @return the element `n` elements after the first element, `null` if out of bounds\n */"} {"signature":"fun < T , T1 : T , T2 : T , T3 : T , T4 : T , T5 : T , T6 : T , T7 : T , T8 : T , T9 : T , T10 : T , T11 : T , T12 : T , T13 : T , T14 : T , T15 : T , T16 : T > Product16 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 , T12 , T13 , T14 , T15 , T16 > . getOrNull ( n : Int ) : T ?","body":"= ( if ( n in until size ) productElement ( n ) as T else null )","docstring":"/** The n'th element of this product, 0-based. In other words, for a\n * product `A(x,,1,,, ..., x,,k,,)`, returns `x,,(n+1),,` where `0 <= n < k`.\n *\n * @param n the index of the element to return\n * @return the element `n` elements after the first element, `null` if out of bounds\n */"} {"signature":"fun < T , T1 : T , T2 : T , T3 : T , T4 : T , T5 : T , T6 : T , T7 : T , T8 : T , T9 : T , T10 : T , T11 : T , T12 : T , T13 : T , T14 : T , T15 : T , T16 : T , T17 : T > Product17 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 , T12 , T13 , T14 , T15 , T16 , T17 > . getOrNull ( n : Int ) : T ?","body":"= ( if ( n in until size ) productElement ( n ) as T else null )","docstring":"/** The n'th element of this product, 0-based. In other words, for a\n * product `A(x,,1,,, ..., x,,k,,)`, returns `x,,(n+1),,` where `0 <= n < k`.\n *\n * @param n the index of the element to return\n * @return the element `n` elements after the first element, `null` if out of bounds\n */"} {"signature":"fun < T , T1 : T , T2 : T , T3 : T , T4 : T , T5 : T , T6 : T , T7 : T , T8 : T , T9 : T , T10 : T , T11 : T , T12 : T , T13 : T , T14 : T , T15 : T , T16 : T , T17 : T , T18 : T > Product18 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 , T12 , T13 , T14 , T15 , T16 , T17 , T18 > . getOrNull ( n : Int ) : T ?","body":"= ( if ( n in until size ) productElement ( n ) as T else null )","docstring":"/** The n'th element of this product, 0-based. In other words, for a\n * product `A(x,,1,,, ..., x,,k,,)`, returns `x,,(n+1),,` where `0 <= n < k`.\n *\n * @param n the index of the element to return\n * @return the element `n` elements after the first element, `null` if out of bounds\n */"} {"signature":"fun < T , T1 : T , T2 : T , T3 : T , T4 : T , T5 : T , T6 : T , T7 : T , T8 : T , T9 : T , T10 : T , T11 : T , T12 : T , T13 : T , T14 : T , T15 : T , T16 : T , T17 : T , T18 : T , T19 : T > Product19 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 , T12 , T13 , T14 , T15 , T16 , T17 , T18 , T19 > . getOrNull ( n : Int ) : T ?","body":"= ( if ( n in until size ) productElement ( n ) as T else null )","docstring":"/** The n'th element of this product, 0-based. In other words, for a\n * product `A(x,,1,,, ..., x,,k,,)`, returns `x,,(n+1),,` where `0 <= n < k`.\n *\n * @param n the index of the element to return\n * @return the element `n` elements after the first element, `null` if out of bounds\n */"} {"signature":"fun < T , T1 : T , T2 : T , T3 : T , T4 : T , T5 : T , T6 : T , T7 : T , T8 : T , T9 : T , T10 : T , T11 : T , T12 : T , T13 : T , T14 : T , T15 : T , T16 : T , T17 : T , T18 : T , T19 : T , T20 : T > Product20 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 , T12 , T13 , T14 , T15 , T16 , T17 , T18 , T19 , T20 > . getOrNull ( n : Int ) : T ?","body":"= ( if ( n in until size ) productElement ( n ) as T else null )","docstring":"/** The n'th element of this product, 0-based. In other words, for a\n * product `A(x,,1,,, ..., x,,k,,)`, returns `x,,(n+1),,` where `0 <= n < k`.\n *\n * @param n the index of the element to return\n * @return the element `n` elements after the first element, `null` if out of bounds\n */"} {"signature":"fun < T , T1 : T , T2 : T , T3 : T , T4 : T , T5 : T , T6 : T , T7 : T , T8 : T , T9 : T , T10 : T , T11 : T , T12 : T , T13 : T , T14 : T , T15 : T , T16 : T , T17 : T , T18 : T , T19 : T , T20 : T , T21 : T > Product21 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 , T12 , T13 , T14 , T15 , T16 , T17 , T18 , T19 , T20 , T21 > . getOrNull ( n : Int ) : T ?","body":"= ( if ( n in until size ) productElement ( n ) as T else null )","docstring":"/** The n'th element of this product, 0-based. In other words, for a\n * product `A(x,,1,,, ..., x,,k,,)`, returns `x,,(n+1),,` where `0 <= n < k`.\n *\n * @param n the index of the element to return\n * @return the element `n` elements after the first element, `null` if out of bounds\n */"} {"signature":"fun < T , T1 : T , T2 : T , T3 : T , T4 : T , T5 : T , T6 : T , T7 : T , T8 : T , T9 : T , T10 : T , T11 : T , T12 : T , T13 : T , T14 : T , T15 : T , T16 : T , T17 : T , T18 : T , T19 : T , T20 : T , T21 : T , T22 : T > Product22 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 , T12 , T13 , T14 , T15 , T16 , T17 , T18 , T19 , T20 , T21 , T22 > . getOrNull ( n : Int ) : T ?","body":"= ( if ( n in until size ) productElement ( n ) as T else null )","docstring":"/** The n'th element of this product, 0-based. In other words, for a\n * product `A(x,,1,,, ..., x,,k,,)`, returns `x,,(n+1),,` where `0 <= n < k`.\n *\n * @param n the index of the element to return\n * @return the element `n` elements after the first element, `null` if out of bounds\n */"} {"signature":"@ Throws ( IndexOutOfBoundsException :: class ) operator fun < T , T1 : T > Product1 < T1 > . get ( indexRange : IntRange ) : List < T >","body":"= indexRange . map ( :: get )","docstring":"/** The range of n'th elements of this product, 0-based. In other words, for a\n * product `A(x,,1,,, ..., x,,k,,)`, returns `x,,(n+1),,` where `0 <= n < k`.\n *\n * @param indexRange the indices of the elements to return\n * @throws IndexOutOfBoundsException\n * @return the elements in [indexRange]\n */"} {"signature":"@ Throws ( IndexOutOfBoundsException :: class ) operator fun < T , T1 : T , T2 : T > Product2 < T1 , T2 > . get ( indexRange : IntRange ) : List < T >","body":"= indexRange . map ( :: get )","docstring":"/** The range of n'th elements of this product, 0-based. In other words, for a\n * product `A(x,,1,,, ..., x,,k,,)`, returns `x,,(n+1),,` where `0 <= n < k`.\n *\n * @param indexRange the indices of the elements to return\n * @throws IndexOutOfBoundsException\n * @return the elements in [indexRange]\n */"} {"signature":"@ Throws ( IndexOutOfBoundsException :: class ) operator fun < T , T1 : T , T2 : T , T3 : T > Product3 < T1 , T2 , T3 > . get ( indexRange : IntRange ) : List < T >","body":"= indexRange . map ( :: get )","docstring":"/** The range of n'th elements of this product, 0-based. In other words, for a\n * product `A(x,,1,,, ..., x,,k,,)`, returns `x,,(n+1),,` where `0 <= n < k`.\n *\n * @param indexRange the indices of the elements to return\n * @throws IndexOutOfBoundsException\n * @return the elements in [indexRange]\n */"} {"signature":"@ Throws ( IndexOutOfBoundsException :: class ) operator fun < T , T1 : T , T2 : T , T3 : T , T4 : T > Product4 < T1 , T2 , T3 , T4 > . get ( indexRange : IntRange ) : List < T >","body":"= indexRange . map ( :: get )","docstring":"/** The range of n'th elements of this product, 0-based. In other words, for a\n * product `A(x,,1,,, ..., x,,k,,)`, returns `x,,(n+1),,` where `0 <= n < k`.\n *\n * @param indexRange the indices of the elements to return\n * @throws IndexOutOfBoundsException\n * @return the elements in [indexRange]\n */"} {"signature":"@ Throws ( IndexOutOfBoundsException :: class ) operator fun < T , T1 : T , T2 : T , T3 : T , T4 : T , T5 : T > Product5 < T1 , T2 , T3 , T4 , T5 > . get ( indexRange : IntRange ) : List < T >","body":"= indexRange . map ( :: get )","docstring":"/** The range of n'th elements of this product, 0-based. In other words, for a\n * product `A(x,,1,,, ..., x,,k,,)`, returns `x,,(n+1),,` where `0 <= n < k`.\n *\n * @param indexRange the indices of the elements to return\n * @throws IndexOutOfBoundsException\n * @return the elements in [indexRange]\n */"} {"signature":"@ Throws ( IndexOutOfBoundsException :: class ) operator fun < T , T1 : T , T2 : T , T3 : T , T4 : T , T5 : T , T6 : T > Product6 < T1 , T2 , T3 , T4 , T5 , T6 > . get ( indexRange : IntRange ) : List < T >","body":"= indexRange . map ( :: get )","docstring":"/** The range of n'th elements of this product, 0-based. In other words, for a\n * product `A(x,,1,,, ..., x,,k,,)`, returns `x,,(n+1),,` where `0 <= n < k`.\n *\n * @param indexRange the indices of the elements to return\n * @throws IndexOutOfBoundsException\n * @return the elements in [indexRange]\n */"} {"signature":"@ Throws ( IndexOutOfBoundsException :: class ) operator fun < T , T1 : T , T2 : T , T3 : T , T4 : T , T5 : T , T6 : T , T7 : T > Product7 < T1 , T2 , T3 , T4 , T5 , T6 , T7 > . get ( indexRange : IntRange ) : List < T >","body":"= indexRange . map ( :: get )","docstring":"/** The range of n'th elements of this product, 0-based. In other words, for a\n * product `A(x,,1,,, ..., x,,k,,)`, returns `x,,(n+1),,` where `0 <= n < k`.\n *\n * @param indexRange the indices of the elements to return\n * @throws IndexOutOfBoundsException\n * @return the elements in [indexRange]\n */"} {"signature":"@ Throws ( IndexOutOfBoundsException :: class ) operator fun < T , T1 : T , T2 : T , T3 : T , T4 : T , T5 : T , T6 : T , T7 : T , T8 : T > Product8 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 > . get ( indexRange : IntRange ) : List < T >","body":"= indexRange . map ( :: get )","docstring":"/** The range of n'th elements of this product, 0-based. In other words, for a\n * product `A(x,,1,,, ..., x,,k,,)`, returns `x,,(n+1),,` where `0 <= n < k`.\n *\n * @param indexRange the indices of the elements to return\n * @throws IndexOutOfBoundsException\n * @return the elements in [indexRange]\n */"} {"signature":"@ Throws ( IndexOutOfBoundsException :: class ) operator fun < T , T1 : T , T2 : T , T3 : T , T4 : T , T5 : T , T6 : T , T7 : T , T8 : T , T9 : T > Product9 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 > . get ( indexRange : IntRange ) : List < T >","body":"= indexRange . map ( :: get )","docstring":"/** The range of n'th elements of this product, 0-based. In other words, for a\n * product `A(x,,1,,, ..., x,,k,,)`, returns `x,,(n+1),,` where `0 <= n < k`.\n *\n * @param indexRange the indices of the elements to return\n * @throws IndexOutOfBoundsException\n * @return the elements in [indexRange]\n */"} {"signature":"@ Throws ( IndexOutOfBoundsException :: class ) operator fun < T , T1 : T , T2 : T , T3 : T , T4 : T , T5 : T , T6 : T , T7 : T , T8 : T , T9 : T , T10 : T > Product10 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 > . get ( indexRange : IntRange ) : List < T >","body":"= indexRange . map ( :: get )","docstring":"/** The range of n'th elements of this product, 0-based. In other words, for a\n * product `A(x,,1,,, ..., x,,k,,)`, returns `x,,(n+1),,` where `0 <= n < k`.\n *\n * @param indexRange the indices of the elements to return\n * @throws IndexOutOfBoundsException\n * @return the elements in [indexRange]\n */"} {"signature":"@ Throws ( IndexOutOfBoundsException :: class ) operator fun < T , T1 : T , T2 : T , T3 : T , T4 : T , T5 : T , T6 : T , T7 : T , T8 : T , T9 : T , T10 : T , T11 : T > Product11 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 > . get ( indexRange : IntRange ) : List < T >","body":"= indexRange . map ( :: get )","docstring":"/** The range of n'th elements of this product, 0-based. In other words, for a\n * product `A(x,,1,,, ..., x,,k,,)`, returns `x,,(n+1),,` where `0 <= n < k`.\n *\n * @param indexRange the indices of the elements to return\n * @throws IndexOutOfBoundsException\n * @return the elements in [indexRange]\n */"} {"signature":"@ Throws ( IndexOutOfBoundsException :: class ) operator fun < T , T1 : T , T2 : T , T3 : T , T4 : T , T5 : T , T6 : T , T7 : T , T8 : T , T9 : T , T10 : T , T11 : T , T12 : T > Product12 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 , T12 > . get ( indexRange : IntRange ) : List < T >","body":"= indexRange . map ( :: get )","docstring":"/** The range of n'th elements of this product, 0-based. In other words, for a\n * product `A(x,,1,,, ..., x,,k,,)`, returns `x,,(n+1),,` where `0 <= n < k`.\n *\n * @param indexRange the indices of the elements to return\n * @throws IndexOutOfBoundsException\n * @return the elements in [indexRange]\n */"} {"signature":"@ Throws ( IndexOutOfBoundsException :: class ) operator fun < T , T1 : T , T2 : T , T3 : T , T4 : T , T5 : T , T6 : T , T7 : T , T8 : T , T9 : T , T10 : T , T11 : T , T12 : T , T13 : T > Product13 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 , T12 , T13 > . get ( indexRange : IntRange ) : List < T >","body":"= indexRange . map ( :: get )","docstring":"/** The range of n'th elements of this product, 0-based. In other words, for a\n * product `A(x,,1,,, ..., x,,k,,)`, returns `x,,(n+1),,` where `0 <= n < k`.\n *\n * @param indexRange the indices of the elements to return\n * @throws IndexOutOfBoundsException\n * @return the elements in [indexRange]\n */"} {"signature":"@ Throws ( IndexOutOfBoundsException :: class ) operator fun < T , T1 : T , T2 : T , T3 : T , T4 : T , T5 : T , T6 : T , T7 : T , T8 : T , T9 : T , T10 : T , T11 : T , T12 : T , T13 : T , T14 : T > Product14 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 , T12 , T13 , T14 > . get ( indexRange : IntRange ) : List < T >","body":"= indexRange . map ( :: get )","docstring":"/** The range of n'th elements of this product, 0-based. In other words, for a\n * product `A(x,,1,,, ..., x,,k,,)`, returns `x,,(n+1),,` where `0 <= n < k`.\n *\n * @param indexRange the indices of the elements to return\n * @throws IndexOutOfBoundsException\n * @return the elements in [indexRange]\n */"} {"signature":"@ Throws ( IndexOutOfBoundsException :: class ) operator fun < T , T1 : T , T2 : T , T3 : T , T4 : T , T5 : T , T6 : T , T7 : T , T8 : T , T9 : T , T10 : T , T11 : T , T12 : T , T13 : T , T14 : T , T15 : T > Product15 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 , T12 , T13 , T14 , T15 > . get ( indexRange : IntRange ) : List < T >","body":"= indexRange . map ( :: get )","docstring":"/** The range of n'th elements of this product, 0-based. In other words, for a\n * product `A(x,,1,,, ..., x,,k,,)`, returns `x,,(n+1),,` where `0 <= n < k`.\n *\n * @param indexRange the indices of the elements to return\n * @throws IndexOutOfBoundsException\n * @return the elements in [indexRange]\n */"} {"signature":"@ Throws ( IndexOutOfBoundsException :: class ) operator fun < T , T1 : T , T2 : T , T3 : T , T4 : T , T5 : T , T6 : T , T7 : T , T8 : T , T9 : T , T10 : T , T11 : T , T12 : T , T13 : T , T14 : T , T15 : T , T16 : T > Product16 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 , T12 , T13 , T14 , T15 , T16 > . get ( indexRange : IntRange ) : List < T >","body":"= indexRange . map ( :: get )","docstring":"/** The range of n'th elements of this product, 0-based. In other words, for a\n * product `A(x,,1,,, ..., x,,k,,)`, returns `x,,(n+1),,` where `0 <= n < k`.\n *\n * @param indexRange the indices of the elements to return\n * @throws IndexOutOfBoundsException\n * @return the elements in [indexRange]\n */"} {"signature":"@ Throws ( IndexOutOfBoundsException :: class ) operator fun < T , T1 : T , T2 : T , T3 : T , T4 : T , T5 : T , T6 : T , T7 : T , T8 : T , T9 : T , T10 : T , T11 : T , T12 : T , T13 : T , T14 : T , T15 : T , T16 : T , T17 : T > Product17 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 , T12 , T13 , T14 , T15 , T16 , T17 > . get ( indexRange : IntRange ) : List < T >","body":"= indexRange . map ( :: get )","docstring":"/** The range of n'th elements of this product, 0-based. In other words, for a\n * product `A(x,,1,,, ..., x,,k,,)`, returns `x,,(n+1),,` where `0 <= n < k`.\n *\n * @param indexRange the indices of the elements to return\n * @throws IndexOutOfBoundsException\n * @return the elements in [indexRange]\n */"} {"signature":"@ Throws ( IndexOutOfBoundsException :: class ) operator fun < T , T1 : T , T2 : T , T3 : T , T4 : T , T5 : T , T6 : T , T7 : T , T8 : T , T9 : T , T10 : T , T11 : T , T12 : T , T13 : T , T14 : T , T15 : T , T16 : T , T17 : T , T18 : T > Product18 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 , T12 , T13 , T14 , T15 , T16 , T17 , T18 > . get ( indexRange : IntRange ) : List < T >","body":"= indexRange . map ( :: get )","docstring":"/** The range of n'th elements of this product, 0-based. In other words, for a\n * product `A(x,,1,,, ..., x,,k,,)`, returns `x,,(n+1),,` where `0 <= n < k`.\n *\n * @param indexRange the indices of the elements to return\n * @throws IndexOutOfBoundsException\n * @return the elements in [indexRange]\n */"} {"signature":"@ Throws ( IndexOutOfBoundsException :: class ) operator fun < T , T1 : T , T2 : T , T3 : T , T4 : T , T5 : T , T6 : T , T7 : T , T8 : T , T9 : T , T10 : T , T11 : T , T12 : T , T13 : T , T14 : T , T15 : T , T16 : T , T17 : T , T18 : T , T19 : T > Product19 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 , T12 , T13 , T14 , T15 , T16 , T17 , T18 , T19 > . get ( indexRange : IntRange ) : List < T >","body":"= indexRange . map ( :: get )","docstring":"/** The range of n'th elements of this product, 0-based. In other words, for a\n * product `A(x,,1,,, ..., x,,k,,)`, returns `x,,(n+1),,` where `0 <= n < k`.\n *\n * @param indexRange the indices of the elements to return\n * @throws IndexOutOfBoundsException\n * @return the elements in [indexRange]\n */"} {"signature":"@ Throws ( IndexOutOfBoundsException :: class ) operator fun < T , T1 : T , T2 : T , T3 : T , T4 : T , T5 : T , T6 : T , T7 : T , T8 : T , T9 : T , T10 : T , T11 : T , T12 : T , T13 : T , T14 : T , T15 : T , T16 : T , T17 : T , T18 : T , T19 : T , T20 : T > Product20 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 , T12 , T13 , T14 , T15 , T16 , T17 , T18 , T19 , T20 > . get ( indexRange : IntRange ) : List < T >","body":"= indexRange . map ( :: get )","docstring":"/** The range of n'th elements of this product, 0-based. In other words, for a\n * product `A(x,,1,,, ..., x,,k,,)`, returns `x,,(n+1),,` where `0 <= n < k`.\n *\n * @param indexRange the indices of the elements to return\n * @throws IndexOutOfBoundsException\n * @return the elements in [indexRange]\n */"} {"signature":"@ Throws ( IndexOutOfBoundsException :: class ) operator fun < T , T1 : T , T2 : T , T3 : T , T4 : T , T5 : T , T6 : T , T7 : T , T8 : T , T9 : T , T10 : T , T11 : T , T12 : T , T13 : T , T14 : T , T15 : T , T16 : T , T17 : T , T18 : T , T19 : T , T20 : T , T21 : T > Product21 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 , T12 , T13 , T14 , T15 , T16 , T17 , T18 , T19 , T20 , T21 > . get ( indexRange : IntRange ) : List < T >","body":"= indexRange . map ( :: get )","docstring":"/** The range of n'th elements of this product, 0-based. In other words, for a\n * product `A(x,,1,,, ..., x,,k,,)`, returns `x,,(n+1),,` where `0 <= n < k`.\n *\n * @param indexRange the indices of the elements to return\n * @throws IndexOutOfBoundsException\n * @return the elements in [indexRange]\n */"} {"signature":"@ Throws ( IndexOutOfBoundsException :: class ) operator fun < T , T1 : T , T2 : T , T3 : T , T4 : T , T5 : T , T6 : T , T7 : T , T8 : T , T9 : T , T10 : T , T11 : T , T12 : T , T13 : T , T14 : T , T15 : T , T16 : T , T17 : T , T18 : T , T19 : T , T20 : T , T21 : T , T22 : T > Product22 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 , T12 , T13 , T14 , T15 , T16 , T17 , T18 , T19 , T20 , T21 , T22 > . get ( indexRange : IntRange ) : List < T >","body":"= indexRange . map ( :: get )","docstring":"/** The range of n'th elements of this product, 0-based. In other words, for a\n * product `A(x,,1,,, ..., x,,k,,)`, returns `x,,(n+1),,` where `0 <= n < k`.\n *\n * @param indexRange the indices of the elements to return\n * @throws IndexOutOfBoundsException\n * @return the elements in [indexRange]\n */"} {"signature":"fun < T , T1 : T > Product1 < T1 > . getOrNull ( indexRange : IntRange ) : List < T ? >","body":"= indexRange . map ( :: getOrNull )","docstring":"/** The range of n'th elements of this product, 0-based. In other words, for a\n * product `A(x,,1,,, ..., x,,k,,)`, returns `x,,(n+1),,` where `0 <= n < k`.\n *\n * @param indexRange the indices of the elements to return\n * @return the elements in [indexRange], `null` if out of bounds\n */"} {"signature":"fun < T , T1 : T , T2 : T > Product2 < T1 , T2 > . getOrNull ( indexRange : IntRange ) : List < T ? >","body":"= indexRange . map ( :: getOrNull )","docstring":"/** The range of n'th elements of this product, 0-based. In other words, for a\n * product `A(x,,1,,, ..., x,,k,,)`, returns `x,,(n+1),,` where `0 <= n < k`.\n *\n * @param indexRange the indices of the elements to return\n * @return the elements in [indexRange], `null` if out of bounds\n */"} {"signature":"fun < T , T1 : T , T2 : T , T3 : T > Product3 < T1 , T2 , T3 > . getOrNull ( indexRange : IntRange ) : List < T ? >","body":"= indexRange . map ( :: getOrNull )","docstring":"/** The range of n'th elements of this product, 0-based. In other words, for a\n * product `A(x,,1,,, ..., x,,k,,)`, returns `x,,(n+1),,` where `0 <= n < k`.\n *\n * @param indexRange the indices of the elements to return\n * @return the elements in [indexRange], `null` if out of bounds\n */"} {"signature":"fun < T , T1 : T , T2 : T , T3 : T , T4 : T > Product4 < T1 , T2 , T3 , T4 > . getOrNull ( indexRange : IntRange ) : List < T ? >","body":"= indexRange . map ( :: getOrNull )","docstring":"/** The range of n'th elements of this product, 0-based. In other words, for a\n * product `A(x,,1,,, ..., x,,k,,)`, returns `x,,(n+1),,` where `0 <= n < k`.\n *\n * @param indexRange the indices of the elements to return\n * @return the elements in [indexRange], `null` if out of bounds\n */"} {"signature":"fun < T , T1 : T , T2 : T , T3 : T , T4 : T , T5 : T > Product5 < T1 , T2 , T3 , T4 , T5 > . getOrNull ( indexRange : IntRange ) : List < T ? >","body":"= indexRange . map ( :: getOrNull )","docstring":"/** The range of n'th elements of this product, 0-based. In other words, for a\n * product `A(x,,1,,, ..., x,,k,,)`, returns `x,,(n+1),,` where `0 <= n < k`.\n *\n * @param indexRange the indices of the elements to return\n * @return the elements in [indexRange], `null` if out of bounds\n */"} {"signature":"fun < T , T1 : T , T2 : T , T3 : T , T4 : T , T5 : T , T6 : T > Product6 < T1 , T2 , T3 , T4 , T5 , T6 > . getOrNull ( indexRange : IntRange ) : List < T ? >","body":"= indexRange . map ( :: getOrNull )","docstring":"/** The range of n'th elements of this product, 0-based. In other words, for a\n * product `A(x,,1,,, ..., x,,k,,)`, returns `x,,(n+1),,` where `0 <= n < k`.\n *\n * @param indexRange the indices of the elements to return\n * @return the elements in [indexRange], `null` if out of bounds\n */"} {"signature":"fun < T , T1 : T , T2 : T , T3 : T , T4 : T , T5 : T , T6 : T , T7 : T > Product7 < T1 , T2 , T3 , T4 , T5 , T6 , T7 > . getOrNull ( indexRange : IntRange ) : List < T ? >","body":"= indexRange . map ( :: getOrNull )","docstring":"/** The range of n'th elements of this product, 0-based. In other words, for a\n * product `A(x,,1,,, ..., x,,k,,)`, returns `x,,(n+1),,` where `0 <= n < k`.\n *\n * @param indexRange the indices of the elements to return\n * @return the elements in [indexRange], `null` if out of bounds\n */"} {"signature":"fun < T , T1 : T , T2 : T , T3 : T , T4 : T , T5 : T , T6 : T , T7 : T , T8 : T > Product8 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 > . getOrNull ( indexRange : IntRange ) : List < T ? >","body":"= indexRange . map ( :: getOrNull )","docstring":"/** The range of n'th elements of this product, 0-based. In other words, for a\n * product `A(x,,1,,, ..., x,,k,,)`, returns `x,,(n+1),,` where `0 <= n < k`.\n *\n * @param indexRange the indices of the elements to return\n * @return the elements in [indexRange], `null` if out of bounds\n */"} {"signature":"fun < T , T1 : T , T2 : T , T3 : T , T4 : T , T5 : T , T6 : T , T7 : T , T8 : T , T9 : T > Product9 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 > . getOrNull ( indexRange : IntRange ) : List < T ? >","body":"= indexRange . map ( :: getOrNull )","docstring":"/** The range of n'th elements of this product, 0-based. In other words, for a\n * product `A(x,,1,,, ..., x,,k,,)`, returns `x,,(n+1),,` where `0 <= n < k`.\n *\n * @param indexRange the indices of the elements to return\n * @return the elements in [indexRange], `null` if out of bounds\n */"} {"signature":"fun < T , T1 : T , T2 : T , T3 : T , T4 : T , T5 : T , T6 : T , T7 : T , T8 : T , T9 : T , T10 : T > Product10 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 > . getOrNull ( indexRange : IntRange ) : List < T ? >","body":"= indexRange . map ( :: getOrNull )","docstring":"/** The range of n'th elements of this product, 0-based. In other words, for a\n * product `A(x,,1,,, ..., x,,k,,)`, returns `x,,(n+1),,` where `0 <= n < k`.\n *\n * @param indexRange the indices of the elements to return\n * @return the elements in [indexRange], `null` if out of bounds\n */"} {"signature":"fun < T , T1 : T , T2 : T , T3 : T , T4 : T , T5 : T , T6 : T , T7 : T , T8 : T , T9 : T , T10 : T , T11 : T > Product11 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 > . getOrNull ( indexRange : IntRange ) : List < T ? >","body":"= indexRange . map ( :: getOrNull )","docstring":"/** The range of n'th elements of this product, 0-based. In other words, for a\n * product `A(x,,1,,, ..., x,,k,,)`, returns `x,,(n+1),,` where `0 <= n < k`.\n *\n * @param indexRange the indices of the elements to return\n * @return the elements in [indexRange], `null` if out of bounds\n */"} {"signature":"fun < T , T1 : T , T2 : T , T3 : T , T4 : T , T5 : T , T6 : T , T7 : T , T8 : T , T9 : T , T10 : T , T11 : T , T12 : T > Product12 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 , T12 > . getOrNull ( indexRange : IntRange ) : List < T ? >","body":"= indexRange . map ( :: getOrNull )","docstring":"/** The range of n'th elements of this product, 0-based. In other words, for a\n * product `A(x,,1,,, ..., x,,k,,)`, returns `x,,(n+1),,` where `0 <= n < k`.\n *\n * @param indexRange the indices of the elements to return\n * @return the elements in [indexRange], `null` if out of bounds\n */"} {"signature":"fun < T , T1 : T , T2 : T , T3 : T , T4 : T , T5 : T , T6 : T , T7 : T , T8 : T , T9 : T , T10 : T , T11 : T , T12 : T , T13 : T > Product13 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 , T12 , T13 > . getOrNull ( indexRange : IntRange ) : List < T ? >","body":"= indexRange . map ( :: getOrNull )","docstring":"/** The range of n'th elements of this product, 0-based. In other words, for a\n * product `A(x,,1,,, ..., x,,k,,)`, returns `x,,(n+1),,` where `0 <= n < k`.\n *\n * @param indexRange the indices of the elements to return\n * @return the elements in [indexRange], `null` if out of bounds\n */"} {"signature":"fun < T , T1 : T , T2 : T , T3 : T , T4 : T , T5 : T , T6 : T , T7 : T , T8 : T , T9 : T , T10 : T , T11 : T , T12 : T , T13 : T , T14 : T > Product14 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 , T12 , T13 , T14 > . getOrNull ( indexRange : IntRange ) : List < T ? >","body":"= indexRange . map ( :: getOrNull )","docstring":"/** The range of n'th elements of this product, 0-based. In other words, for a\n * product `A(x,,1,,, ..., x,,k,,)`, returns `x,,(n+1),,` where `0 <= n < k`.\n *\n * @param indexRange the indices of the elements to return\n * @return the elements in [indexRange], `null` if out of bounds\n */"} {"signature":"fun < T , T1 : T , T2 : T , T3 : T , T4 : T , T5 : T , T6 : T , T7 : T , T8 : T , T9 : T , T10 : T , T11 : T , T12 : T , T13 : T , T14 : T , T15 : T > Product15 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 , T12 , T13 , T14 , T15 > . getOrNull ( indexRange : IntRange ) : List < T ? >","body":"= indexRange . map ( :: getOrNull )","docstring":"/** The range of n'th elements of this product, 0-based. In other words, for a\n * product `A(x,,1,,, ..., x,,k,,)`, returns `x,,(n+1),,` where `0 <= n < k`.\n *\n * @param indexRange the indices of the elements to return\n * @return the elements in [indexRange], `null` if out of bounds\n */"} {"signature":"fun < T , T1 : T , T2 : T , T3 : T , T4 : T , T5 : T , T6 : T , T7 : T , T8 : T , T9 : T , T10 : T , T11 : T , T12 : T , T13 : T , T14 : T , T15 : T , T16 : T > Product16 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 , T12 , T13 , T14 , T15 , T16 > . getOrNull ( indexRange : IntRange ) : List < T ? >","body":"= indexRange . map ( :: getOrNull )","docstring":"/** The range of n'th elements of this product, 0-based. In other words, for a\n * product `A(x,,1,,, ..., x,,k,,)`, returns `x,,(n+1),,` where `0 <= n < k`.\n *\n * @param indexRange the indices of the elements to return\n * @return the elements in [indexRange], `null` if out of bounds\n */"} {"signature":"fun < T , T1 : T , T2 : T , T3 : T , T4 : T , T5 : T , T6 : T , T7 : T , T8 : T , T9 : T , T10 : T , T11 : T , T12 : T , T13 : T , T14 : T , T15 : T , T16 : T , T17 : T > Product17 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 , T12 , T13 , T14 , T15 , T16 , T17 > . getOrNull ( indexRange : IntRange ) : List < T ? >","body":"= indexRange . map ( :: getOrNull )","docstring":"/** The range of n'th elements of this product, 0-based. In other words, for a\n * product `A(x,,1,,, ..., x,,k,,)`, returns `x,,(n+1),,` where `0 <= n < k`.\n *\n * @param indexRange the indices of the elements to return\n * @return the elements in [indexRange], `null` if out of bounds\n */"} {"signature":"fun < T , T1 : T , T2 : T , T3 : T , T4 : T , T5 : T , T6 : T , T7 : T , T8 : T , T9 : T , T10 : T , T11 : T , T12 : T , T13 : T , T14 : T , T15 : T , T16 : T , T17 : T , T18 : T > Product18 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 , T12 , T13 , T14 , T15 , T16 , T17 , T18 > . getOrNull ( indexRange : IntRange ) : List < T ? >","body":"= indexRange . map ( :: getOrNull )","docstring":"/** The range of n'th elements of this product, 0-based. In other words, for a\n * product `A(x,,1,,, ..., x,,k,,)`, returns `x,,(n+1),,` where `0 <= n < k`.\n *\n * @param indexRange the indices of the elements to return\n * @return the elements in [indexRange], `null` if out of bounds\n */"} {"signature":"fun < T , T1 : T , T2 : T , T3 : T , T4 : T , T5 : T , T6 : T , T7 : T , T8 : T , T9 : T , T10 : T , T11 : T , T12 : T , T13 : T , T14 : T , T15 : T , T16 : T , T17 : T , T18 : T , T19 : T > Product19 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 , T12 , T13 , T14 , T15 , T16 , T17 , T18 , T19 > . getOrNull ( indexRange : IntRange ) : List < T ? >","body":"= indexRange . map ( :: getOrNull )","docstring":"/** The range of n'th elements of this product, 0-based. In other words, for a\n * product `A(x,,1,,, ..., x,,k,,)`, returns `x,,(n+1),,` where `0 <= n < k`.\n *\n * @param indexRange the indices of the elements to return\n * @return the elements in [indexRange], `null` if out of bounds\n */"} {"signature":"fun < T , T1 : T , T2 : T , T3 : T , T4 : T , T5 : T , T6 : T , T7 : T , T8 : T , T9 : T , T10 : T , T11 : T , T12 : T , T13 : T , T14 : T , T15 : T , T16 : T , T17 : T , T18 : T , T19 : T , T20 : T > Product20 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 , T12 , T13 , T14 , T15 , T16 , T17 , T18 , T19 , T20 > . getOrNull ( indexRange : IntRange ) : List < T ? >","body":"= indexRange . map ( :: getOrNull )","docstring":"/** The range of n'th elements of this product, 0-based. In other words, for a\n * product `A(x,,1,,, ..., x,,k,,)`, returns `x,,(n+1),,` where `0 <= n < k`.\n *\n * @param indexRange the indices of the elements to return\n * @return the elements in [indexRange], `null` if out of bounds\n */"} {"signature":"fun < T , T1 : T , T2 : T , T3 : T , T4 : T , T5 : T , T6 : T , T7 : T , T8 : T , T9 : T , T10 : T , T11 : T , T12 : T , T13 : T , T14 : T , T15 : T , T16 : T , T17 : T , T18 : T , T19 : T , T20 : T , T21 : T > Product21 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 , T12 , T13 , T14 , T15 , T16 , T17 , T18 , T19 , T20 , T21 > . getOrNull ( indexRange : IntRange ) : List < T ? >","body":"= indexRange . map ( :: getOrNull )","docstring":"/** The range of n'th elements of this product, 0-based. In other words, for a\n * product `A(x,,1,,, ..., x,,k,,)`, returns `x,,(n+1),,` where `0 <= n < k`.\n *\n * @param indexRange the indices of the elements to return\n * @return the elements in [indexRange], `null` if out of bounds\n */"} {"signature":"fun < T , T1 : T , T2 : T , T3 : T , T4 : T , T5 : T , T6 : T , T7 : T , T8 : T , T9 : T , T10 : T , T11 : T , T12 : T , T13 : T , T14 : T , T15 : T , T16 : T , T17 : T , T18 : T , T19 : T , T20 : T , T21 : T , T22 : T > Product22 < T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 , T12 , T13 , T14 , T15 , T16 , T17 , T18 , T19 , T20 , T21 , T22 > . getOrNull ( indexRange : IntRange ) : List < T ? >","body":"= indexRange . map ( :: getOrNull )","docstring":"/** The range of n'th elements of this product, 0-based. In other words, for a\n * product `A(x,,1,,, ..., x,,k,,)`, returns `x,,(n+1),,` where `0 <= n < k`.\n *\n * @param indexRange the indices of the elements to return\n * @return the elements in [indexRange], `null` if out of bounds\n */"} {"signature":"@ GradleTest fun `test - shared native klib - does not contain 'depends=' manifest property` ( gradleVersion : GradleVersion )","body":"{ project ( \"\" , gradleVersion ) { build ( \"\" ) { val nativeMainKlib = projectPath . resolve ( \"\" ) assertDirectoryExists ( nativeMainKlib ) val libraryFile = org . jetbrains . kotlin . library . resolveSingleFileKlib ( org . jetbrains . kotlin . konan . file . File ( nativeMainKlib ) , strategy = ToolingSingleFileKlibResolveStrategy ) if ( libraryFile . unresolvedDependencies . isNotEmpty ( ) ) { fail ( \"\" ) } if ( libraryFile . manifestProperties . hasProperty ( KLIB_PROPERTY_DEPENDS ) ) { fail ( \"\" + \"\" ) } } } }","docstring":"/**\n * https://youtrack.jetbrains.com/issue/KT-56205/Shared-Native-Compilation-False-positive-w-Could-not-find-warnings-on-metadata-klibs\n * metadata klib should not contain any dependsOn= in their klib manifest.\n */"} {"signature":"@ GradleTest @ Disabled ( \"\" ) fun `test - K2 - shared native compilation - assemble` ( gradleVersion : GradleVersion )","body":"{ project ( \"\" , gradleVersion , buildOptions = defaultBuildOptions . copy ( languageVersion = \"\" ) ) { build ( \"\" ) { assertTasksExecuted ( \"\" ) assertTasksExecuted ( \"\" ) assertTasksExecuted ( \"\" ) } } }","docstring":"/**\n *\n */"} {"signature":"fun < T1 > Tuple1 < T1 > . drop0 ( ) : Tuple1 < T1 >","body":"= Tuple1 < T1 > ( this . _1 ( ) )","docstring":"/**\n * This file contains all functions to drop N items from the beginning or end of a Tuple.\n * If all items are dropped, the result will be [EmptyTuple].\n *\n * For example:\n * ```kotlin\n * tupleOf(1, 2, 3, 4).drop2() == tupleOf(3, 4)\n * tupleOf(1, 2, 3, 4).dropLast2() == tupleOf(1, 2)\n * ```\n */"} {"signature":"fun foo ( )","body":"{ }","docstring":"/** some */"} {"signature":"fun create ( project : Project ) : ExecutorService","body":"{ val testTarget = project . testTarget val configurables = project . testTargetConfigurables val executor = when { project . compileOnlyTests -> NoOpExecutor ( explanation = \"\" ) testTarget == HostManager . host -> HostExecutor ( ) configurables is ConfigurablesWithEmulator && testTarget != HostManager . host -> EmulatorExecutor ( configurables ) configurables is AppleConfigurables && configurables . targetTriple . isSimulator -> XcodeSimulatorExecutor ( configurables ) . apply { project . findProperty ( \"\" ) ? . toString ( ) ? . let { deviceId = it } } configurables is AppleConfigurables && RosettaExecutor . availableFor ( configurables ) -> RosettaExecutor ( configurables ) else -> error ( \"\" ) } return executor . service ( project ) }","docstring":"/**\n * Creates an ExecutorService depending on a test target -Ptest_target\n */"} {"signature":"fun runProcess ( executor : ( Action < in ExecSpec > ) -> ExecResult ? , executable : String , args : List < String > , env : Map < String , String > = emptyMap ( ) ) : ProcessOutput","body":"{ val outStream = ByteArrayOutputStream ( ) val errStream = ByteArrayOutputStream ( ) val execResult = executor ( Action { this . executable = executable this . args = args . toList ( ) this . standardOutput = outStream this . errorOutput = errStream this . isIgnoreExitValue = true this . environment ( env ) } ) checkNotNull ( execResult ) val stdOut = outStream . toString ( \"\" ) val stdErr = errStream . toString ( \"\" ) return ProcessOutput ( stdOut , stdErr , execResult . exitValue ) }","docstring":"/**\n * Runs process using a given executor.\n *\n * @param executor a method that is able to run a given executable, e.g. ExecutorService::execute\n * @param executable a process executable to be run\n * @param args arguments for a process\n */"} {"signature":"fun runProcessWithInput ( executor : ( Action < in ExecSpec > ) -> ExecResult ? , executable : String , args : List < String > , input : String ) : ProcessOutput","body":"{ val outStream = ByteArrayOutputStream ( ) val errStream = ByteArrayOutputStream ( ) val inStream = ByteArrayInputStream ( input . toByteArray ( ) ) val execResult = executor ( Action { this . executable = executable this . args = args . toList ( ) this . standardOutput = outStream this . errorOutput = errStream this . isIgnoreExitValue = true this . standardInput = inStream } ) checkNotNull ( execResult ) val stdOut = outStream . toString ( \"\" ) val stdErr = errStream . toString ( \"\" ) return ProcessOutput ( stdOut , stdErr , execResult . exitValue ) }","docstring":"/**\n * Runs process using a given executor.\n *\n * @param executor a method that is able to run a given executable, e.g. ExecutorService::execute\n * @param executable a process executable to be run\n * @param args arguments for a process\n * @param input an input string to be passed through the standard input stream\n */"} {"signature":"fun Project . executeAndCheck ( executable : Path , arguments : List < String > = emptyList ( ) )","body":"{ val ( stdOut , stdErr , exitCode ) = runProcess ( executor = executor :: execute , executable = executable . toString ( ) , args = arguments ) println ( \"\"\"\"\"\" . trimMargin ( ) ) check ( exitCode == ) { \"\" } }","docstring":"/**\n * Executes the [executable] with the given [arguments]\n * and checks that the program finished with zero exit code.\n */"} {"signature":"fun localExecutor ( project : Project )","body":"= { a : Action < in ExecSpec > -> project . exec ( a ) }","docstring":"/**\n * Returns [project]'s process executor.\n * @see Project.exec\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalUnsignedTypes :: class ) public fun UByte . toString ( radix : Int ) : String","body":"= this . toInt ( ) . toString ( radix )","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 ( \"\" ) @ WasExperimental ( ExperimentalUnsignedTypes :: class ) public fun UShort . toString ( radix : Int ) : String","body":"= this . toInt ( ) . toString ( radix )","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 ( \"\" ) @ WasExperimental ( ExperimentalUnsignedTypes :: class ) public fun UInt . toString ( radix : Int ) : String","body":"= uintToString ( this . toInt ( ) , checkRadix ( radix ) )","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 ( \"\" ) @ WasExperimental ( ExperimentalUnsignedTypes :: class ) public fun ULong . toString ( radix : Int ) : String","body":"= ulongToString ( this . toLong ( ) , checkRadix ( radix ) )","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":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalUnsignedTypes :: class ) public fun String . toUByte ( ) : UByte","body":"= toUByteOrNull ( ) ? : numberFormatError ( this )","docstring":"/**\n * Parses the string as a signed [UByte] number and returns the result.\n * @throws NumberFormatException if the string is not a valid representation of a number.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalUnsignedTypes :: class ) public fun String . toUByte ( radix : Int ) : UByte","body":"= toUByteOrNull ( radix ) ? : numberFormatError ( this )","docstring":"/**\n * Parses the string as a signed [UByte] 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":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalUnsignedTypes :: class ) public fun String . toUShort ( ) : UShort","body":"= toUShortOrNull ( ) ? : numberFormatError ( this )","docstring":"/**\n * Parses the string as a [UShort] number and returns the result.\n * @throws NumberFormatException if the string is not a valid representation of a number.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalUnsignedTypes :: class ) public fun String . toUShort ( radix : Int ) : UShort","body":"= toUShortOrNull ( radix ) ? : numberFormatError ( this )","docstring":"/**\n * Parses the string as a [UShort] 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":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalUnsignedTypes :: class ) public fun String . toUInt ( ) : UInt","body":"= toUIntOrNull ( ) ? : numberFormatError ( this )","docstring":"/**\n * Parses the string as an [UInt] number and returns the result.\n * @throws NumberFormatException if the string is not a valid representation of a number.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalUnsignedTypes :: class ) public fun String . toUInt ( radix : Int ) : UInt","body":"= toUIntOrNull ( radix ) ? : numberFormatError ( this )","docstring":"/**\n * Parses the string as an [UInt] 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":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalUnsignedTypes :: class ) public fun String . toULong ( ) : ULong","body":"= toULongOrNull ( ) ? : numberFormatError ( this )","docstring":"/**\n * Parses the string as a [ULong] number and returns the result.\n * @throws NumberFormatException if the string is not a valid representation of a number.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalUnsignedTypes :: class ) public fun String . toULong ( radix : Int ) : ULong","body":"= toULongOrNull ( radix ) ? : numberFormatError ( this )","docstring":"/**\n * Parses the string as a [ULong] 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":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalUnsignedTypes :: class ) public fun String . toUByteOrNull ( ) : UByte ?","body":"= toUByteOrNull ( radix = )","docstring":"/**\n * Parses the string as an [UByte] number and returns the result\n * or `null` if the string is not a valid representation of a number.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalUnsignedTypes :: class ) public fun String . toUByteOrNull ( radix : Int ) : UByte ?","body":"{ val int = this . toUIntOrNull ( radix ) ? : return null if ( int > UByte . MAX_VALUE ) return null return int . toUByte ( ) }","docstring":"/**\n * Parses the string as an [UByte] number and returns the result\n * or `null` if the string is not a valid representation of a number.\n *\n * @throws IllegalArgumentException when [radix] is not a valid radix for string to number conversion.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalUnsignedTypes :: class ) public fun String . toUShortOrNull ( ) : UShort ?","body":"= toUShortOrNull ( radix = )","docstring":"/**\n * Parses the string as an [UShort] number and returns the result\n * or `null` if the string is not a valid representation of a number.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalUnsignedTypes :: class ) public fun String . toUShortOrNull ( radix : Int ) : UShort ?","body":"{ val int = this . toUIntOrNull ( radix ) ? : return null if ( int > UShort . MAX_VALUE ) return null return int . toUShort ( ) }","docstring":"/**\n * Parses the string as an [UShort] number and returns the result\n * or `null` if the string is not a valid representation of a number.\n *\n * @throws IllegalArgumentException when [radix] is not a valid radix for string to number conversion.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalUnsignedTypes :: class ) public fun String . toUIntOrNull ( ) : UInt ?","body":"= toUIntOrNull ( radix = )","docstring":"/**\n * Parses the string as an [UInt] number and returns the result\n * or `null` if the string is not a valid representation of a number.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalUnsignedTypes :: class ) public fun String . toUIntOrNull ( radix : Int ) : UInt ?","body":"{ checkRadix ( radix ) val length = this . length if ( length == ) return null val limit : UInt = UInt . MAX_VALUE val start : Int val firstChar = this [ ] if ( firstChar < '' ) { if ( length == || firstChar != '' ) return null start = } else { start = } val limitForMaxRadix = var limitBeforeMul = limitForMaxRadix val uradix = radix . toUInt ( ) var result = for ( i in start until length ) { val digit = digitOf ( this [ i ] , radix ) if ( digit < ) return null if ( result > limitBeforeMul ) { if ( limitBeforeMul == limitForMaxRadix ) { limitBeforeMul = limit / uradix if ( result > limitBeforeMul ) { return null } } else { return null } } result *= uradix val beforeAdding = result result += digit . toUInt ( ) if ( result < beforeAdding ) return null } return result }","docstring":"/**\n * Parses the string as an [UInt] number and returns the result\n * or `null` if the string is not a valid representation of a number.\n *\n * @throws IllegalArgumentException when [radix] is not a valid radix for string to number conversion.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalUnsignedTypes :: class ) public fun String . toULongOrNull ( ) : ULong ?","body":"= toULongOrNull ( radix = )","docstring":"/**\n * Parses the string as an [ULong] number and returns the result\n * or `null` if the string is not a valid representation of a number.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalUnsignedTypes :: class ) public fun String . toULongOrNull ( radix : Int ) : ULong ?","body":"{ checkRadix ( radix ) val length = this . length if ( length == ) return null val limit : ULong = ULong . MAX_VALUE val start : Int val firstChar = this [ ] if ( firstChar < '' ) { if ( length == || firstChar != '' ) return null start = } else { start = } val limitForMaxRadix = var limitBeforeMul = limitForMaxRadix val uradix = radix . toULong ( ) var result = for ( i in start until length ) { val digit = digitOf ( this [ i ] , radix ) if ( digit < ) return null if ( result > limitBeforeMul ) { if ( limitBeforeMul == limitForMaxRadix ) { limitBeforeMul = limit / uradix if ( result > limitBeforeMul ) { return null } } else { return null } } result *= uradix val beforeAdding = result result += digit . toUInt ( ) if ( result < beforeAdding ) return null } return result }","docstring":"/**\n * Parses the string as an [ULong] number and returns the result\n * or `null` if the string is not a valid representation of a number.\n *\n * @throws IllegalArgumentException when [radix] is not a valid radix for string to number conversion.\n */"} {"signature":"abstract fun IrClass . addTransformedInClassAtomic ( atomicProperty : IrProperty , index : Int ) : IrProperty","body":"abstract fun IrClass . addTransformedInClassAtomic ( atomicProperty : IrProperty , index : Int ) : IrProperty","docstring":"/**\n * Builds a volatile property that can be atomically updated instead of the given atomicfu property,\n * and replaces the original declaration in the parent class.\n * Returns the new volatile property.\n */"} {"signature":"abstract fun IrDeclarationContainer . addTransformedStaticAtomic ( atomicProperty : IrProperty , index : Int ) : IrProperty","body":"abstract fun IrDeclarationContainer . addTransformedStaticAtomic ( atomicProperty : IrProperty , index : Int ) : IrProperty","docstring":"/**\n * Builds a volatile property that can be atomically updated instead of the given static atomicfu property\n * and replaces the original declaration in the parent container.\n * Returns the new volatile property.\n */"} {"signature":"private fun IrDeclarationContainer . addTransformedAtomicArray ( atomicProperty : IrProperty , index : Int ) : IrProperty","body":"{ val parentContainer = this with ( atomicSymbols . createBuilder ( atomicProperty . symbol ) ) { val javaAtomicArrayField = buildAtomicArrayField ( atomicProperty , parentContainer ) return parentContainer . replacePropertyAtIndex ( javaAtomicArrayField , atomicProperty . visibility , isVar = false , isStatic = parentContainer is IrFile , index ) . also { atomicfuPropertyToAtomicHandler [ atomicProperty ] = it } } }","docstring":"/**\n * Builds an array that can be atomically updated instead of the given atomicfu atomic array\n * and replaces the original declaration in the parent class.\n * Returns the generated array.\n * For JVM: atomic arrays are replaced with the corresponding java.util.concurrent.Atomic*Array\n * For Native: atomic arrays are replaced with the corresponding kotlin.concurrent.Atomic*Array\n * (In the future atomic arrays will be commonized in Kotlin stdlib)\n *\n * val intArr = kotlinx.atomicfu.AtomicIntArray(45) --> val intArr = java.util.concurrent.AtomicIntegerArray(45) // JVM\n * val intArr = kotlinx.atomicfu.AtomicIntArray(45) --> val intArr = kotlin.concurrent.AtomicIntArray(45) // Native\n */"} {"signature":"private fun IrDeclarationContainer . transformDelegatedAtomic ( atomicProperty : IrProperty )","body":"{ val getDelegate = atomicProperty . backingField ? . initializer ? . expression require ( getDelegate is IrCall ) { \"\" + \"\" + CONSTRAINTS_MESSAGE } val delegateVolatileField = when { getDelegate . isAtomicFactoryCall ( ) -> { with ( atomicSymbols . createBuilder ( atomicProperty . symbol ) ) { buildVolatileBackingField ( atomicProperty , this @ transformDelegatedAtomic , false ) . also { declarations . add ( it ) } } } getDelegate . symbol . owner . isGetter -> { val delegate = getDelegate . getCorrespondingProperty ( ) check ( delegate . parent == atomicProperty . parent ) { \"\" + \"\" + CONSTRAINTS_MESSAGE } val volatileProperty = atomicfuPropertyToVolatile [ delegate ] ? : error ( \"\" ) volatileProperty . backingField ? : error ( \"\" ) } else -> error ( \"\" + CONSTRAINTS_MESSAGE ) } atomicProperty . getter ? . transformAccessor ( delegateVolatileField ) atomicProperty . setter ? . transformAccessor ( delegateVolatileField ) atomicProperty . backingField = null }","docstring":"/**\n * Transforms the given property that was delegated to the atomic property:\n * delegates accessors to the volatile property that was generated instead of the atomic property.\n */"} {"signature":"protected fun AbstractAtomicfuIrBuilder . buildVolatileBackingField ( atomicProperty : IrProperty , parentContainer : IrDeclarationContainer , tweakBooleanToInt : Boolean ) : IrField","body":"{ val atomicField = requireNotNull ( atomicProperty . backingField ) { \"\" + CONSTRAINTS_MESSAGE } val fieldType = ( atomicField . type as IrSimpleType ) . atomicToPrimitiveType ( ) val initializer = atomicField . initializer ? . expression if ( initializer == null ) { val initBlock = atomicField . getInitBlockForField ( parentContainer ) val initExprWithIndex = initBlock . getInitExprWithIndexFromInitBlock ( atomicField . symbol ) ? : error ( \"\" + CONSTRAINTS_MESSAGE ) val atomicFactoryCall = initExprWithIndex . value . value val initExprIndex = initExprWithIndex . index val initValue = atomicFactoryCall . getAtomicFactoryValueArgument ( ) return irVolatileField ( atomicProperty . name . asString ( ) + VOLATILE , if ( tweakBooleanToInt && fieldType . isBoolean ( ) ) irBuiltIns . intType else fieldType , null , atomicField . annotations , parentContainer ) . also { initBlock . updateFieldInitialization ( atomicField . symbol , it . symbol , initValue , initExprIndex ) } } else { val initValue = initializer . getAtomicFactoryValueArgument ( ) return irVolatileField ( atomicProperty . name . asString ( ) + VOLATILE , if ( tweakBooleanToInt && fieldType . isBoolean ( ) ) irBuiltIns . intType else fieldType , initValue , atomicField . annotations , parentContainer ) } }","docstring":"/**\n * Builds a private volatile field initialized with the initial value of the given atomic property:\n * private val a = atomic(0) --> private @Volatile a: Int = 0\n */"} {"signature":"private fun AbstractAtomicfuIrBuilder . buildAtomicArrayField ( atomicProperty : IrProperty , parentContainer : IrDeclarationContainer ) : IrField","body":"{ val atomicArrayField = requireNotNull ( atomicProperty . backingField ) { \"\" + CONSTRAINTS_MESSAGE } val initializer = atomicArrayField . initializer ? . expression if ( initializer == null ) { val initBlock = atomicArrayField . getInitBlockForField ( parentContainer ) val initExprWithIndex = initBlock . getInitExprWithIndexFromInitBlock ( atomicArrayField . symbol ) ? : error ( \"\" + CONSTRAINTS_MESSAGE ) val atomicFactoryCall = initExprWithIndex . value . value val initExprIndex = initExprWithIndex . index val arraySize = atomicFactoryCall . getArraySizeArgument ( ) return irAtomicArrayField ( atomicArrayField . name , atomicSymbols . getAtomicArrayClassByAtomicfuArrayType ( atomicArrayField . type ) , atomicArrayField . isStatic , atomicArrayField . annotations , arraySize , ( atomicFactoryCall as IrFunctionAccessExpression ) . dispatchReceiver , parentContainer ) . also { val initExpr = it . initializer ? . expression ? : error ( \"\" + CONSTRAINTS_MESSAGE ) it . initializer = null initBlock . updateFieldInitialization ( atomicArrayField . symbol , it . symbol , initExpr , initExprIndex ) } } else { val arraySize = initializer . getArraySizeArgument ( ) return irAtomicArrayField ( atomicArrayField . name , atomicSymbols . getAtomicArrayClassByAtomicfuArrayType ( atomicArrayField . type ) , atomicArrayField . isStatic , atomicArrayField . annotations , arraySize , ( initializer as IrFunctionAccessExpression ) . dispatchReceiver , parentContainer ) } }","docstring":"/**\n * Builds an atomic array field initialized with the initial size of the given atomic array,\n * the generated field has the same visibility as the original atomic array:\n * internal val intArr = kotlinx.atomicfu.AtomicIntArray --> internal val intArr = j.u.c.a.AtomicIntegerArray // JVM\n * internal val intArr = kotlin.concurrent.AtomicIntArray // Native\n */"} {"signature":"private fun IrAnonymousInitializer . getInitExprWithIndexFromInitBlock ( oldFieldSymbol : IrFieldSymbol ) : IndexedValue < IrSetField > ?","body":"= body . statements . withIndex ( ) . singleOrNull { it . value is IrSetField && ( it . value as IrSetField ) . symbol == oldFieldSymbol } ? . let { @ Suppress ( \"\" ) it as IndexedValue < IrSetField > }","docstring":"/**\n * In case if atomic property is initialized in init block it's declaration is replaced with the volatile property\n * and initialization of the backing field is also performed in the init block:\n *\n * private val _a: AtomicInt --> @Volatile var _a: Int\n *\n * init { init {\n * _a = atomic(0) _a = 0\n * } }\n */"} {"signature":"public fun < T > lineType ( 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 `lineType` aesthetic to a data column by [ColumnReference].\n *\n * @param column the data column to map to the color.\n * @param parameters optional lambda to configure additional scale parameters.\n * @return a [NonPositionalMapping] object representing the mapping.\n */"} {"signature":"public fun < T > lineType ( 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 `lineType` aesthetic to a data column by [KProperty].\n *\n * @param column the data column to map to the color.\n * @param parameters optional lambda to configure additional scale parameters.\n * @return a [NonPositionalMapping] object representing the mapping.\n */"} {"signature":"public fun lineType ( 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 `lineType` aesthetic to a data column by [String].\n *\n * @param column the data column to map to the color.\n * @param parameters optional lambda to configure additional scale parameters.\n * @return a [NonPositionalMapping] object representing the mapping.\n */"} {"signature":"public fun < T > lineType ( 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 `lineType` aesthetic to iterable of values.\n *\n * @param values the iterable containing the 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 > lineType ( 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 `lineType` aesthetic to a data column.\n *\n * @param values the data column to map to the color.\n * @param parameters optional lambda to configure additional scale parameters.\n * @return a [NonPositionalMapping] object representing the mapping.\n */"} {"signature":"fun containingClass ( context : FirElement ) : FirRegularClass","body":"{ val containingDeclaration = containingDeclarations . lastOrNull ( ) ? : errorWithAttachment ( \"\" ) { withFirEntry ( \"\" , context ) withFirDesignationEntry ( \"\" , resolveTarget . designation ) } requireWithAttachment ( containingDeclaration is FirRegularClass , { \"\" } , ) { withFirEntry ( \"\" , context ) withFirDesignationEntry ( \"\" , resolveTarget . designation ) } return containingDeclaration }","docstring":"/**\n * @param context used as a context in the case of exception\n * @return the last class from [containingDeclarations]\n */"} {"signature":"private fun resolveDependencies ( target : FirElementWithResolveState )","body":"{ if ( skipDependencyTargetResolutionStep ) return val originalDeclaration = ( target as? FirCallableDeclaration ) ? . originalIfFakeOverrideOrDelegated ( ) when { originalDeclaration != null -> originalDeclaration . lazyResolveToPhase ( resolverPhase ) target is FirProperty -> { target . correspondingValueParameterFromPrimaryConstructor ? . lazyResolveToPhase ( resolverPhase ) target . destructuringDeclarationContainerVariable ? . lazyResolveToPhase ( resolverPhase ) } target is FirSimpleFunction && target . origin == FirDeclarationOrigin . Synthetic . DataClassMember -> { resolveDataClassMemberDependencies ( target ) } target is FirField && target . origin == FirDeclarationOrigin . Synthetic . DelegateField || target is FirConstructor -> { containingClass ( target ) . lazyResolveToPhase ( resolverPhase ) } target is FirScript -> target . parameters . forEach { it . lazyResolveToPhase ( resolverPhase ) } } }","docstring":"/**\n * Requests the resolution for dependencies to avoid race in the case of FIR instance sharing.\n * Will be executed before resolution without a lock.\n *\n * @see resolveDataClassMemberDependencies\n * @see skipDependencyTargetResolutionStep\n */"} {"signature":"protected open fun doResolveWithoutLock ( target : FirElementWithResolveState ) : Boolean","body":"= false","docstring":"/**\n * This method executes **not under the lock** of [target].\n * Any unsafe reads from [target] declaration have to be done under [withReadLock].\n * [performCustomResolveUnderLock] have to be used for modifications.\n *\n * This method can be useful to resolve some dependencies (like [resolveDependencies] in general),\n * but with some phase-specific rules.\n *\n * For instance, to pre-resolve [FirRegularClass] members before the class itself as it is required\n * to build the [CFG][org.jetbrains.kotlin.fir.resolve.dfa.cfg.ControlFlowGraph].\n *\n * @return **true** if [performCustomResolveUnderLock] has been called\n *\n * @see withReadLock\n * @see performCustomResolveUnderLock\n */"} {"signature":"protected abstract fun doLazyResolveUnderLock ( target : FirElementWithResolveState )","body":"protected abstract fun doLazyResolveUnderLock ( target : FirElementWithResolveState )","docstring":"/**\n * This method executes **under the lock** of [target].\n */"} {"signature":"fun resolveDesignation ( )","body":"{ checkResolveConsistency ( ) resolveTarget . visit ( this ) }","docstring":"/**\n * Executes the resolution.\n */"} {"signature":"protected fun performResolve ( target : FirElementWithResolveState )","body":"{ resolveDependencies ( target ) if ( doResolveWithoutLock ( target ) ) return if ( requiresJumpingLock ) { checkThatResolvedAtLeastToPreviousPhase ( target ) lockProvider . withJumpingLock ( target , resolverPhase , actionUnderLock = { doLazyResolveUnderLock ( target ) updatePhaseForDeclarationInternals ( target ) } , actionOnCycle = { handleCycleInResolution ( target ) } ) } else { performCustomResolveUnderLock ( target ) { doLazyResolveUnderLock ( target ) } } }","docstring":"/**\n * Performs the resolution of [target].\n * The [target] element have to be at least in [resolverPhase].[previous][FirResolvePhase.previous] phase.\n *\n * @see resolveDependencies\n * @see doResolveWithoutLock\n * @see doLazyResolveUnderLock\n */"} {"signature":"protected open fun handleCycleInResolution ( target : FirElementWithResolveState )","body":"{ errorWithFirSpecificEntries ( \"\" , fir = target ) }","docstring":"/**\n * Will be executed in the case of detected cycle between elements during jumping resolve.\n *\n * **There is no guaranties that [target] is guarded by the lock of the current thread**\n *\n * @param target an element with detected cycle\n *\n * @see LLFirLockProvider.withJumpingLock\n */"} {"signature":"protected inline fun performCustomResolveUnderLock ( target : FirElementWithResolveState , crossinline action : ( ) -> Unit )","body":"{ checkThatResolvedAtLeastToPreviousPhase ( target ) requireWithAttachment ( ! requiresJumpingLock , { \"\" } ) { withFirEntry ( \"\" , target ) } lockProvider . withWriteLock ( target , resolverPhase ) { action ( ) updatePhaseForDeclarationInternals ( target ) } }","docstring":"/**\n * Execute [action] under the write lock in the context of [target].\n *\n * Allowed only for non-jumping phases.\n *\n * @see requiresJumpingLock\n */"} {"signature":"protected inline fun withReadLock ( target : FirElementWithResolveState , action : ( ) -> Unit )","body":"{ checkThatResolvedAtLeastToPreviousPhase ( target ) lockProvider . withReadLock ( target , resolverPhase , action ) }","docstring":"/**\n * Execute action under a declaration lock.\n * [action] will be executed only once in case of successful lock.\n * If some another thread is already resolved [target] declaration to [resolverPhase] then [action] won't be executed.\n */"} {"signature":"protected open fun IrExpression . prepareToBeUsedIn ( function : IrFunction ) : IrExpression","body":"{ return patchDeclarationParents ( function ) }","docstring":"/**\n * Prepares the default value to be used inside the `function` body by patching the parents.\n * In K/JS it also copies the expression in order to avoid duplicate declarations after this lowering.\n *\n * In K/JVM copying doesn't preserve metadata, so the following case won't work:\n *\n * ```\n * import kotlin.reflect.jvm.reflect\n *\n * fun foo(x: Function<*> = {}) {\n * // Will print \"null\" if lambda is copied\n * println(x.reflect())\n * }\n * ```\n *\n * Thus the duplicate declarations during the lowering pipeline is considered to be a lesser evil.\n */"} {"signature":"public fun < I > Operation < I , Bitmap > . toFloatArray ( block : ConvertToFloatArray . ( ) -> Unit ) : Operation < I , FloatData >","body":"{ return PreprocessingPipeline ( this , ConvertToFloatArray ( ) . apply ( block ) ) }","docstring":"/** Applies [ConvertToFloatArray] operation to convert the [Bitmap] to a float array. */"} {"signature":"public fun < I > Operation < I , Bitmap > . resize ( block : Resize . ( ) -> Unit ) : Operation < I , Bitmap >","body":"{ return PreprocessingPipeline ( this , Resize ( ) . apply ( block ) ) }","docstring":"/** Applies [Resize] operation to resize the [Bitmap] to a specific size. */"} {"signature":"public fun < I > Operation < I , Bitmap > . rotate ( block : Rotate . ( ) -> Unit ) : Operation < I , Bitmap >","body":"{ return PreprocessingPipeline ( this , Rotate ( ) . apply ( block ) ) }","docstring":"/** Applies [Rotate] operation to rotate the [Bitmap] by an arbitrary angle (specified in degrees). */"} {"signature":"@ RequiresApi ( Build . VERSION_CODES . O ) public fun < I > Operation < I , Bitmap > . crop ( block : Crop . ( ) -> Unit ) : Operation < I , Bitmap >","body":"{ return PreprocessingPipeline ( this , Crop ( ) . apply ( block ) ) }","docstring":"/** Applies [Crop] operation to crop the [Bitmap] at a specified region. */"} {"signature":"fun < A > topologicalSort ( nodes : Iterable < A > , reportCycle : ( A ) -> Nothing = { throw IllegalStateException ( \"\" ) } , dependencies : A . ( ) -> Iterable < A > , ) : List < A >","body":"{ val visiting = mutableSetOf < A > ( ) val visited = mutableSetOf < A > ( ) fun visit ( node : A ) { if ( node in visited ) return if ( node in visiting ) reportCycle ( node ) visiting . add ( node ) node . dependencies ( ) . forEach ( :: visit ) visiting . remove ( node ) visited . add ( node ) } nodes . forEach ( :: visit ) return visited . toMutableList ( ) . apply { reverse ( ) } }","docstring":"/**\n * Sorts [nodes] topologically collecting direct edges via [dependencies]. [nodes] and [dependencies] must form a directed, acyclic graph.\n * [topologicalSort] will throw an [IllegalStateException] if it encounters a cycle.\n *\n * The algorithm is based on depth-first search, starting in order from each node in [nodes]. Kahn's algorithm is harder to apply to the\n * ad-hoc dependency structure because it's not easily apparent whether a node has no other incoming edges.\n *\n * For example, consider the following structure: `C -> A, C -> B, B -> A`. The resulting order should be `[C, B, A]`. However, `A` is\n * first in the list of dependencies of `C`. Without a way to find the incoming edge from `B` to `A` while processing `C -> A`, a naive\n * implementation of Kahn's algorithm might order `A` before `B`.\n */"} {"signature":"inline fun withWriteLock ( target : FirElementWithResolveState , phase : FirResolvePhase , action : ( ) -> Unit , )","body":"{ checker . lazyResolveToPhaseInside ( phase ) { target . withLock ( toPhase = phase , updatePhase = true , action = action ) } }","docstring":"/**\n * Locks an a [FirElementWithResolveState] to resolve from `phase - 1` to [phase] and\n * then updates the [FirElementWithResolveState.resolveState] to a [phase].\n * Does nothing if [target] already has at least [phase] phase.\n *\n * [action] will be executed once if [target] is not yet resolved to [phase] phase.\n *\n * @see withReadLock\n * @see withJumpingLock\n */"} {"signature":"inline fun withReadLock ( target : FirElementWithResolveState , phase : FirResolvePhase , action : ( ) -> Unit , )","body":"{ checker . lazyResolveToPhaseInside ( phase ) { target . withLock ( toPhase = phase , updatePhase = false , action = action ) } }","docstring":"/**\n * Locks an a [FirElementWithResolveState] to read something required for [phase].\n * Does nothing if [target] already has at least [phase] phase.\n *\n * [action] will be executed once if [target] is not yet resolved to [phase] phase.\n *\n * @see withWriteLock\n */"} {"signature":"private inline fun FirElementWithResolveState . withLock ( toPhase : FirResolvePhase , updatePhase : Boolean , action : ( ) -> Unit , )","body":"{ while ( true ) { checkCanceled ( ) @ OptIn ( ResolveStateAccess :: class ) val stateSnapshot = resolveState if ( stateSnapshot . resolvePhase >= toPhase ) { return } when ( stateSnapshot ) { is FirInProcessOfResolvingToPhaseStateWithoutBarrier -> { trySettingBarrier ( toPhase , stateSnapshot ) continue } is FirInProcessOfResolvingToPhaseStateWithBarrier -> { waitOnBarrier ( stateSnapshot ) continue } is FirResolvedToPhaseState -> { if ( ! tryLock ( toPhase , stateSnapshot ) ) continue var exceptionOccurred = false try { action ( ) } catch ( e : Throwable ) { exceptionOccurred = true throw e } finally { val newPhase = if ( updatePhase && ! exceptionOccurred ) toPhase else stateSnapshot . resolvePhase unlock ( toPhase = newPhase ) } return } is FirInProcessOfResolvingToJumpingPhaseState -> { errorWithFirSpecificEntries ( \"\" , fir = this ) } } } }","docstring":"/**\n * Locks an a [FirElementWithResolveState] to resolve from `toPhase - 1` to [toPhase] and\n * then updates the [FirElementWithResolveState.resolveState] to a [toPhase] if [updatePhase] is **true**.\n *\n * [updatePhase] == false means that we want to read some data under a lock.\n *\n * If [FirElementWithResolveState] is already at least at [toPhase], does nothing.\n *\n * Otherwise:\n * - Marks [FirElementWithResolveState] as in a process of resovle\n * - performs the resolve by calling [action]\n * - updates the resolve phase to [toPhase] if [updatePhase] is **true**.\n * - notifies other threads waiting on the same lock that the declaration is already resolved by this thread, so other threads can continue its execution.\n *\n *\n * Contention handling:\n * - on lock acquisition, no real lock or barrier is created. Instead, the [FirElementWithResolveState.resolveState] is updated to indicate that the declaration is being resolved now.\n * - If some other thread tries to resolve current [FirElementWithResolveState], it changes `resolveState` and puts the barrier there. Then it awaits on it until the initial thread which hold the lock finishes its job.\n * - This way, no barrier is used in a case when no contention arise.\n */"} {"signature":"fun withJumpingLock ( target : FirElementWithResolveState , phase : FirResolvePhase , actionUnderLock : ( ) -> Unit , actionOnCycle : ( ) -> Unit , )","body":"{ checker . lazyResolveToPhaseInside ( phase ) { target . withJumpingLockImpl ( phase , actionUnderLock , actionOnCycle ) } }","docstring":"/**\n * Locks on an a [FirElementWithResolveState] to resolve from `phase - 1` to [phase] and\n * then updates the [resolve state][FirElementWithResolveState.resolveState] to a [phase].\n * Does nothing if [target] already has at least [phase] phase.\n *\n * @param actionUnderLock will be executed once under the lock if [target] is not yet resolved to [phase] phase and there are no cycles\n * @param actionOnCycle will be executed once without the lock if [target] is not yet resolved to [phase] phase and a resolution cycle is found\n *\n * @see withWriteLock\n * @see withJumpingLockImpl\n */"} {"signature":"private fun FirElementWithResolveState . withJumpingLockImpl ( toPhase : FirResolvePhase , actionUnderLock : ( ) -> Unit , actionOnCycle : ( ) -> Unit , )","body":"{ while ( true ) { checkCanceled ( ) @ OptIn ( ResolveStateAccess :: class ) val currentState = resolveState if ( currentState . resolvePhase >= toPhase ) { return } when ( currentState ) { is FirResolvedToPhaseState -> { if ( ! tryJumpingLock ( toPhase , currentState ) ) continue var exceptionOccurred = false try { actionUnderLock ( ) } catch ( e : Throwable ) { exceptionOccurred = true throw e } finally { val newPhase = if ( ! exceptionOccurred ) toPhase else currentState . resolvePhase jumpingUnlock ( toPhase = newPhase ) } return } is FirInProcessOfResolvingToJumpingPhaseState -> { val previousState = jumpingResolutionStatesStack . peek ( ) if ( previousState != null ) { previousState . waitingFor = currentState var nextState : FirInProcessOfResolvingToJumpingPhaseState ? = currentState while ( nextState != null ) { if ( nextState === previousState ) { previousState . waitingFor = null return actionOnCycle ( ) } nextState = nextState . waitingFor } } try { currentState . latch . await ( DEFAULT_LOCKING_INTERVAL , TimeUnit . MILLISECONDS ) } finally { previousState ? . waitingFor = null } } is FirInProcessOfResolvingToPhaseStateWithoutBarrier , is FirInProcessOfResolvingToPhaseStateWithBarrier -> { errorWithFirSpecificEntries ( \"\" , fir = this ) } } } }","docstring":"/**\n * Locks an a [FirElementWithResolveState] to resolve from `toPhase - 1` to [toPhase] and\n * then updates the [FirElementWithResolveState.resolveState] to a\n * [toPhase] if no exceptions were found during [actionUnderLock].\n *\n * If [FirElementWithResolveState] is already at least at [toPhase], does nothing.\n *\n * ### Happy path:\n * 1. Marks [FirElementWithResolveState] as in a process of resolve\n * 2. Performs the resolve by calling [actionUnderLock]\n * 3. Updates the resolve phase to [toPhase] if there is no exceptions\n * 4. Notifies other threads waiting on the same lock that this thread already resolved the declaration,\n * so other threads can continue its execution\n *\n * ### Cycle handling\n * During step 1 we can realize someone already set [FirInProcessOfResolvingToJumpingPhaseState]\n * for the current [FirElementWithResolveState], so there is a room for a possible deadlock.\n *\n * The requirement for the deadlock is not empty [jumpingResolutionStatesStack] as we should already hold another lock.\n * Otherwise, we can just wait on the [latch][FirInProcessOfResolvingToJumpingPhaseState.latch].\n *\n * In the case of not empty [jumpingResolutionStatesStack], we have the following algorithm:\n * 1. Set [waitingFor][FirInProcessOfResolvingToJumpingPhaseState.waitingFor] for the previous state\n * as we have an intention to take the next lock\n * 2. Iterate over all [waitingFor][FirInProcessOfResolvingToJumpingPhaseState.waitingFor] recursively\n * to detect the possible cycle\n * 3. Execute [actionOnCycle] without the lock in the case of cycle or waining on\n * the [latch][FirInProcessOfResolvingToJumpingPhaseState.latch] to try to take the lock again later\n *\n * @param actionUnderLock will be executed once under the lock if [this] is not yet resolved to [toPhase] phase and there are no cycles\n * @param actionOnCycle will be executed once without the lock if [this] is not yet resolved to [toPhase] phase and a resolution cycle is found\n *\n * @see withJumpingLock\n */"} {"signature":"private fun FirElementWithResolveState . tryJumpingLock ( toPhase : FirResolvePhase , stateSnapshot : FirResolveState , ) : Boolean","body":"{ val newState = FirInProcessOfResolvingToJumpingPhaseState ( toPhase ) val isSucceed = resolveStateFieldUpdater . compareAndSet ( this , stateSnapshot , newState ) if ( ! isSucceed ) return false jumpingResolutionStatesStack . push ( newState ) return true }","docstring":"/**\n * Trying to set [FirInProcessOfResolvingToJumpingPhaseState] to [this].\n *\n * @return **true** if the state is published successfully\n *\n * @see withJumpingLockImpl\n * @see FirInProcessOfResolvingToJumpingPhaseState\n */"} {"signature":"private fun FirElementWithResolveState . jumpingUnlock ( toPhase : FirResolvePhase )","body":"{ val currentState = jumpingResolutionStatesStack . pop ( ) resolveStateFieldUpdater . set ( this , FirResolvedToPhaseState ( toPhase ) ) currentState . latch . countDown ( ) }","docstring":"/**\n * Publish [FirResolvedToPhaseState] with [toPhase] phase and unlocks current [FirInProcessOfResolvingToJumpingPhaseState].\n *\n * @see withJumpingLockImpl\n * @see FirInProcessOfResolvingToJumpingPhaseState\n * @see FirResolvedToPhaseState\n */"} {"signature":"fun push ( newState : FirInProcessOfResolvingToJumpingPhaseState )","body":"{ val states = stateStackHolder . get ( ) val currentState = states . lastOrNull ( ) currentState ? . waitingFor = newState states += newState }","docstring":"/**\n * Adds [newState] to the stack and set [waitingFor][FirInProcessOfResolvingToJumpingPhaseState.waitingFor]\n * for the previous state if needed\n */"} {"signature":"fun pop ( ) : FirInProcessOfResolvingToJumpingPhaseState","body":"{ val states = stateStackHolder . get ( ) val currentState = states . removeLast ( ) val prevState = states . lastOrNull ( ) requireWithAttachment ( condition = prevState == null || prevState . waitingFor === currentState , message = { \"\" } , ) prevState ? . waitingFor = null if ( states . isEmpty ( ) ) { stateStackHolder . remove ( ) } return currentState }","docstring":"/**\n * Pops from the top of the stack the last state and return it.\n * Updates [waitingFor][FirInProcessOfResolvingToJumpingPhaseState.waitingFor] for\n * the previous state if needed\n *\n * Note: it doesn't release the [lock][FirInProcessOfResolvingToJumpingPhaseState.latch]\n */"} {"signature":"fun peek ( ) : FirInProcessOfResolvingToJumpingPhaseState ?","body":"= stateStackHolder . get ( ) . lastOrNull ( )","docstring":"/**\n * Current state on the top if exists\n */"} {"signature":"@ kotlin . internal . InlineOnly public actual inline fun < T > Array < out T > ? . orEmpty ( ) : Array < out T >","body":"= this ? : emptyArray < T > ( )","docstring":"/**\n * Returns the array if it's not `null`, or an empty array otherwise.\n * @sample samples.collections.Arrays.Usage.arrayOrEmpty\n */"} {"signature":"@ kotlin . internal . InlineOnly public actual inline fun < T > Collection < T > . toTypedArray ( ) : Array < T >","body":"= copyToArray ( this )","docstring":"/**\n * Returns a *typed* array containing all the elements of this collection.\n *\n * Allocates an array of runtime type `T` having its size equal to the size of this collection\n * and populates the array with the elements of this collection.\n * @sample samples.collections.Collections.Collections.collectionToTypedArray\n */"} {"signature":"public actual fun < T > listOf ( element : T ) : List < T >","body":"= arrayListOf ( element )","docstring":"/**\n * Returns a new read-only list containing only the specified object [element].\n *\n * @sample samples.collections.Collections.Lists.singletonReadOnlyList\n */"} {"signature":"public actual fun < T > setOf ( element : T ) : Set < T >","body":"= hashSetOf ( element )","docstring":"/**\n * Returns a new read-only set containing only the specified object [element].\n *\n * @sample samples.collections.Collections.Sets.singletonReadOnlySet\n */"} {"signature":"@ SinceKotlin ( \"\" ) public actual fun < T > MutableList < T > . fill ( value : T ) : Unit","body":"{ for ( index in .. lastIndex ) { this [ index ] = value } }","docstring":"/**\n * Fills the list with the provided [value].\n *\n * Each element in the list gets replaced with the [value].\n */"} {"signature":"@ SinceKotlin ( \"\" ) public actual fun < T > MutableList < T > . shuffle ( ) : Unit","body":"= shuffle ( Random )","docstring":"/**\n * Randomly shuffles elements in this list.\n *\n * See: https://en.wikipedia.org/wiki/Fisher%E2%80%93Yates_shuffle#The_modern_algorithm\n */"} {"signature":"@ SinceKotlin ( \"\" ) public actual fun < T > Iterable < T > . shuffled ( ) : List < T >","body":"= toMutableList ( ) . apply { shuffle ( ) }","docstring":"/**\n * Returns a new list with the elements of this collection randomly shuffled.\n */"} {"signature":"public actual fun < T : Comparable < T > > MutableList < T > . sort ( ) : Unit","body":"{ collectionsSort ( this , naturalOrder ( ) ) }","docstring":"/**\n * Sorts elements in the list in-place 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 *\n * @sample samples.collections.Collections.Sorting.sortMutableList\n */"} {"signature":"public actual fun < T > MutableList < T > . sortWith ( comparator : Comparator < in T > ) : Unit","body":"{ collectionsSort ( this , comparator ) }","docstring":"/**\n * Sorts elements in the list in-place according to the order specified with [comparator].\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.sortMutableListWith\n */"} {"signature":"@ PublishedApi internal actual fun mapCapacity ( expectedSize : Int ) : Int","body":"= expectedSize","docstring":"/**\n * JS map and set implementations do not make use of capacities or load factors.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ PublishedApi internal fun checkBuilderCapacity ( capacity : Int )","body":"{ require ( capacity >= ) { \"\" } }","docstring":"/**\n * Checks a collection builder function capacity argument.\n * In JS no validation is made in Map/Set constructor yet.\n */"} {"signature":"public actual fun < K , V > mapOf ( pair : Pair < K , V > ) : Map < K , V >","body":"= hashMapOf ( pair )","docstring":"/**\n * Returns a new read-only map, mapping only the specified key to the\n * specified value.\n *\n * @sample samples.collections.Maps.Instantiation.mapFromPairs\n */"} {"signature":"protected abstract fun selectKey ( project : Project ) : Project","body":"protected abstract fun selectKey ( project : Project ) : Project","docstring":"/**\n * Calculates a part of a key that is used to determine whether an action from [run] was already executed\n */"} {"signature":"fun run ( project : Project , actionId : String , action : ( ) -> Unit )","body":"{ val performedActions = performedActions . computeIfAbsent ( selectKey ( project ) ) { mutableSetOf ( ) } if ( performedActions . add ( actionId ) ) { action ( ) } }","docstring":"/**\n * Runs an [action] once per key value which is being calculated as a combination of a [selectKey] value and an [actionId]\n *\n * Warning: if KGP is loaded multiple times by different classloaders, actions with the same [actionId] may be executed more than once\n */"} {"signature":"fun registeredHandlers ( ) : List < FieldHandlerWithPriority >","body":"fun registeredHandlers ( ) : List < FieldHandlerWithPriority >","docstring":"/**\n * List all registered handlers with their priorities\n */"} {"signature":"public actual fun Double . isNaN ( ) : Boolean","body":"= this != this","docstring":"/**\n * Returns `true` if the specified number is a\n * Not-a-Number (NaN) value, `false` otherwise.\n */"} {"signature":"public actual fun Float . isNaN ( ) : Boolean","body":"= this != this","docstring":"/**\n * Returns `true` if the specified number is a\n * Not-a-Number (NaN) value, `false` otherwise.\n */"} {"signature":"public actual fun Double . isInfinite ( ) : Boolean","body":"= this == Double . POSITIVE_INFINITY || this == Double . NEGATIVE_INFINITY","docstring":"/**\n * Returns `true` if this value is infinitely large in magnitude.\n */"} {"signature":"public actual fun Float . isInfinite ( ) : Boolean","body":"= this == Float . POSITIVE_INFINITY || this == Float . NEGATIVE_INFINITY","docstring":"/**\n * Returns `true` if this value is infinitely large in magnitude.\n */"} {"signature":"public actual fun Double . isFinite ( ) : Boolean","body":"= ! isInfinite ( ) && ! isNaN ( )","docstring":"/**\n * Returns `true` if the argument is a finite floating-point value; returns `false` otherwise (for `NaN` and infinity arguments).\n */"} {"signature":"public actual fun Float . isFinite ( ) : Boolean","body":"= ! isInfinite ( ) && ! isNaN ( )","docstring":"/**\n * Returns `true` if the argument is a finite floating-point value; returns `false` otherwise (for `NaN` and infinity arguments).\n */"} {"signature":"@ SinceKotlin ( \"\" ) public actual fun Double . toBits ( ) : Long","body":"= doubleToRawBits ( if ( this . isNaN ( ) ) Double . NaN else this )","docstring":"/**\n * Returns a bit representation of the specified floating-point value as [Long]\n * according to the IEEE 754 floating-point \"double format\" bit layout.\n */"} {"signature":"@ SinceKotlin ( \"\" ) public actual fun Double . toRawBits ( ) : Long","body":"= doubleToRawBits ( this )","docstring":"/**\n * Returns a bit representation of the specified floating-point value as [Long]\n * according to the IEEE 754 floating-point \"double format\" bit layout,\n * preserving `NaN` values exact layout.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . internal . InlineOnly public actual inline fun Double . Companion . fromBits ( bits : Long ) : Double","body":"= doubleFromBits ( bits )","docstring":"/**\n * Returns the [Double] value corresponding to a given bit representation.\n */"} {"signature":"@ SinceKotlin ( \"\" ) public actual fun Float . toBits ( ) : Int","body":"= floatToRawBits ( if ( this . isNaN ( ) ) Float . NaN else this )","docstring":"/**\n * Returns a bit representation of the specified floating-point value as [Int]\n * according to the IEEE 754 floating-point \"single format\" bit layout.\n *\n * Note that in Kotlin/JS [Float] range is wider than \"single format\" bit layout can represent,\n * so some [Float] values may overflow, underflow or loose their accuracy after conversion to bits and back.\n */"} {"signature":"@ SinceKotlin ( \"\" ) public actual fun Float . toRawBits ( ) : Int","body":"= floatToRawBits ( this )","docstring":"/**\n * Returns a bit representation of the specified floating-point value as [Int]\n * according to the IEEE 754 floating-point \"single format\" bit layout,\n * preserving `NaN` values exact layout.\n *\n * Note that in Kotlin/JS [Float] range is wider than \"single format\" bit layout can represent,\n * so some [Float] values may overflow, underflow or loose their accuracy after conversion to bits and back.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . internal . InlineOnly public actual inline fun Float . Companion . fromBits ( bits : Int ) : Float","body":"= floatFromBits ( bits )","docstring":"/**\n * Returns the [Float] value corresponding to a given bit representation.\n */"} {"signature":"@ SinceKotlin ( \"\" ) public actual fun Int . countOneBits ( ) : Int","body":"{ var v = this v = ( v and ) + ( v . ushr ( ) and ) v = ( v and ) + ( v . ushr ( ) and ) v = ( v and ) + ( v . ushr ( ) and ) v = ( v and ) + ( v . ushr ( ) and ) v = ( v and ) + ( v . ushr ( ) ) return v }","docstring":"/**\n * Counts the number of set bits in the binary representation of this [Int] number.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . internal . InlineOnly public actual inline fun Int . countLeadingZeroBits ( ) : Int","body":"= nativeClz32 ( this )","docstring":"/**\n * Counts the number of consecutive most significant bits that are zero in the binary representation of this [Int] number.\n */"} {"signature":"@ SinceKotlin ( \"\" ) public actual fun Int . countTrailingZeroBits ( ) : Int","body":"= Int . SIZE_BITS - ( this or - this ) . inv ( ) . countLeadingZeroBits ( )","docstring":"/**\n * Counts the number of consecutive least significant bits that are zero in the binary representation of this [Int] number.\n */"} {"signature":"@ SinceKotlin ( \"\" ) public actual fun Int . takeHighestOneBit ( ) : Int","body":"= if ( this == ) else . shl ( Int . SIZE_BITS - - countLeadingZeroBits ( ) )","docstring":"/**\n * Returns a number having a single bit set in the position of the most significant set bit of this [Int] number,\n * or zero, if this number is zero.\n */"} {"signature":"@ SinceKotlin ( \"\" ) public actual fun Int . takeLowestOneBit ( ) : Int","body":"= this and - this","docstring":"/**\n * Returns a number having a single bit set in the position of the least significant set bit of this [Int] number,\n * or zero, if this number is zero.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalStdlibApi :: class ) public actual fun Int . rotateLeft ( bitCount : Int ) : Int","body":"= shl ( bitCount ) or ushr ( Int . SIZE_BITS - bitCount )","docstring":"/**\n * Rotates the binary representation of this [Int] number left by the specified [bitCount] number of bits.\n * The most significant bits pushed out from the left side reenter the number as the least significant bits on the right side.\n *\n * Rotating the number left by a negative bit count is the same as rotating it right by the negated bit count:\n * `number.rotateLeft(-n) == number.rotateRight(n)`\n *\n * Rotating by a multiple of [Int.SIZE_BITS] (32) returns the same number, or more generally\n * `number.rotateLeft(n) == number.rotateLeft(n % 32)`\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalStdlibApi :: class ) public actual fun Int . rotateRight ( bitCount : Int ) : Int","body":"= shl ( Int . SIZE_BITS - bitCount ) or ushr ( bitCount )","docstring":"/**\n * Rotates the binary representation of this [Int] number right by the specified [bitCount] number of bits.\n * The least significant bits pushed out from the right side reenter the number as the most significant bits on the left side.\n *\n * Rotating the number right by a negative bit count is the same as rotating it left by the negated bit count:\n * `number.rotateRight(-n) == number.rotateLeft(n)`\n *\n * Rotating by a multiple of [Int.SIZE_BITS] (32) returns the same number, or more generally\n * `number.rotateRight(n) == number.rotateRight(n % 32)`\n */"} {"signature":"@ SinceKotlin ( \"\" ) public actual fun Long . countOneBits ( ) : Int","body":"= high . countOneBits ( ) + low . countOneBits ( )","docstring":"/**\n * Counts the number of set bits in the binary representation of this [Long] number.\n */"} {"signature":"@ SinceKotlin ( \"\" ) public actual fun Long . countLeadingZeroBits ( ) : Int","body":"= when ( val high = this . high ) { -> Int . SIZE_BITS + low . countLeadingZeroBits ( ) else -> high . countLeadingZeroBits ( ) }","docstring":"/**\n * Counts the number of consecutive most significant bits that are zero in the binary representation of this [Long] number.\n */"} {"signature":"@ SinceKotlin ( \"\" ) public actual fun Long . countTrailingZeroBits ( ) : Int","body":"= when ( val low = this . low ) { -> Int . SIZE_BITS + high . countTrailingZeroBits ( ) else -> low . countTrailingZeroBits ( ) }","docstring":"/**\n * Counts the number of consecutive least significant bits that are zero in the binary representation of this [Long] number.\n */"} {"signature":"@ SinceKotlin ( \"\" ) public actual fun Long . takeHighestOneBit ( ) : Long","body":"= when ( val high = this . high ) { -> Long ( low . takeHighestOneBit ( ) , ) else -> Long ( , high . takeHighestOneBit ( ) ) }","docstring":"/**\n * Returns a number having a single bit set in the position of the most significant set bit of this [Long] number,\n * or zero, if this number is zero.\n */"} {"signature":"@ SinceKotlin ( \"\" ) public actual fun Long . takeLowestOneBit ( ) : Long","body":"= when ( val low = this . low ) { -> Long ( , high . takeLowestOneBit ( ) ) else -> Long ( low . takeLowestOneBit ( ) , ) }","docstring":"/**\n * Returns a number having a single bit set in the position of the least significant set bit of this [Long] number,\n * or zero, if this number is zero.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalStdlibApi :: class ) public actual fun Long . rotateLeft ( bitCount : Int ) : Long","body":"{ if ( ( bitCount and ) != ) { val low = this . low val high = this . high val newLow = low . shl ( bitCount ) or high . ushr ( - bitCount ) val newHigh = high . shl ( bitCount ) or low . ushr ( - bitCount ) return if ( ( bitCount and ) == ) Long ( newLow , newHigh ) else Long ( newHigh , newLow ) } else { return if ( ( bitCount and ) == ) this else Long ( high , low ) } }","docstring":"/**\n * Rotates the binary representation of this [Long] number left by the specified [bitCount] number of bits.\n * The most significant bits pushed out from the left side reenter the number as the least significant bits on the right side.\n *\n * Rotating the number left by a negative bit count is the same as rotating it right by the negated bit count:\n * `number.rotateLeft(-n) == number.rotateRight(n)`\n *\n * Rotating by a multiple of [Long.SIZE_BITS] (64) returns the same number, or more generally\n * `number.rotateLeft(n) == number.rotateLeft(n % 64)`\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalStdlibApi :: class ) @ kotlin . internal . InlineOnly public actual inline fun Long . rotateRight ( bitCount : Int ) : Long","body":"= rotateLeft ( - bitCount )","docstring":"/**\n * Rotates the binary representation of this [Long] number right by the specified [bitCount] number of bits.\n * The least significant bits pushed out from the right side reenter the number as the most significant bits on the left side.\n *\n * Rotating the number right by a negative bit count is the same as rotating it left by the negated bit count:\n * `number.rotateRight(-n) == number.rotateLeft(n)`\n *\n * Rotating by a multiple of [Long.SIZE_BITS] (64) returns the same number, or more generally\n * `number.rotateRight(n) == number.rotateRight(n % 64)`\n */"} {"signature":"fun Project . externalDocumentationLink ( url : String , packageList : File = projectDir . resolve ( \"\" ) )","body":"{ tasks . withType < AbstractDokkaLeafTask > ( ) . configureEach { dokkaSourceSets . configureEach { externalDocumentationLink { this . url = URL ( url ) packageListUrl = packageList . toPath ( ) . toUri ( ) . toURL ( ) } } } }","docstring":"/**\n * Package-list by external URL for documentation generation.\n */"} {"signature":"override fun SimpleTypeMarker . isSingleClassifierType ( ) : Boolean","body":"{ require ( this is SimpleType , this :: errorMessage ) return ! isError && constructor . declarationDescriptor !is TypeAliasDescriptor && ( constructor . declarationDescriptor != null || this is CapturedType || this is NewCapturedType || this is DefinitelyNotNullType || constructor is IntegerLiteralTypeConstructor || isSingleClassifierTypeWithEnhancement ( ) ) }","docstring":"/**\n *\n * SingleClassifierType is one of the following types:\n * - classType\n * - type for type parameter\n * - captured type\n *\n * Such types can contain error types in our arguments, but type constructor isn't errorTypeConstructor\n */"} {"signature":"private suspend fun testSendAfterClose ( kind : TestChannelKind )","body":"{ assertFailsWith < ClosedSendChannelException > { coroutineScope { val channel = kind . create < Int > ( ) channel . close ( ) launch { channel . send ( ) } } } }","docstring":"/**\n * [ClosedSendChannelException] should not be eaten.\n * See [https://github.com/Kotlin/kotlinx.coroutines/issues/957]\n */"} {"signature":"override fun buildTransformedAtomicExtensionSignature ( atomicExtension : IrFunction , isArrayReceiver : Boolean ) : IrSimpleFunction","body":"{ val mangledName = mangleAtomicExtensionName ( atomicExtension . name . asString ( ) , isArrayReceiver ) val valueType = ( atomicExtension . extensionReceiverParameter ! ! . type as IrSimpleType ) . atomicToPrimitiveType ( ) return pluginContext . irFactory . buildFun { name = Name . identifier ( mangledName ) isInline = true visibility = atomicExtension . visibility origin = AbstractAtomicSymbols . ATOMICFU_GENERATED_FUNCTION } . apply { extensionReceiverParameter = null dispatchReceiverParameter = atomicExtension . dispatchReceiverParameter ? . deepCopyWithSymbols ( this ) atomicExtension . typeParameters . forEach { addTypeParameter ( it . name . asString ( ) , it . representativeUpperBound ) } addSyntheticValueParametersToTransformedAtomicExtension ( isArrayReceiver , valueType ) atomicExtension . valueParameters . forEach { addValueParameter ( it . name , it . type ) } returnType = atomicExtension . returnType this . parent = atomicExtension . parent } }","docstring":"/**\n * Builds the signature of the transformed atomic extension:\n *\n * inline fun AtomicInt.foo(arg: Int) --> inline fun foo$atomicfu(dispatchReceiver: Any?, atomicHandler: AtomicIntegerFieldUpdater, arg': Int)\n * inline fun foo$atomicfu$array(atomicArray: AtomicIntegerArray, index: Int, arg': Int)\n */"} {"signature":"override fun IrFunction . addSyntheticValueParametersToTransformedAtomicExtension ( isArrayReceiver : Boolean , valueType : IrType )","body":"{ if ( isArrayReceiver ) { addValueParameter ( ATOMIC_HANDLER , atomicSymbols . getAtomicArrayClassByValueType ( valueType ) . defaultType ) addValueParameter ( INDEX , irBuiltIns . intType ) } else { addValueParameter ( DISPATCH_RECEIVER , irBuiltIns . anyNType ) addValueParameter ( ATOMIC_HANDLER , atomicSymbols . getFieldUpdaterType ( valueType ) ) } }","docstring":"/**\n * Adds synthetic value parameters to the transformed atomic extension (custom atomic extension or atomicfu inline update functions).\n */"} {"signature":"@ Test fun writeSplitSourceBufferLeft ( )","body":"{ val writeSize = Segment . SIZE / + val sink = Buffer ( ) sink . writeString ( '' . repeat ( Segment . SIZE - ) ) val source = Buffer ( ) source . writeString ( '' . repeat ( Segment . SIZE * ) ) sink . write ( source , writeSize . toLong ( ) ) assertEquals ( listOf ( Segment . SIZE - , writeSize ) , segmentSizes ( sink ) ) assertEquals ( listOf ( Segment . SIZE - writeSize , Segment . SIZE ) , segmentSizes ( source ) ) }","docstring":"/** The big part of source's first segment is being moved. */"} {"signature":"@ Test fun writeSplitSourceBufferRight ( )","body":"{ val writeSize = Segment . SIZE / - val sink = Buffer ( ) sink . writeString ( '' . repeat ( Segment . SIZE - ) ) val source = Buffer ( ) source . writeString ( '' . repeat ( Segment . SIZE * ) ) sink . write ( source , writeSize . toLong ( ) ) assertEquals ( listOf ( Segment . SIZE - , writeSize ) , segmentSizes ( sink ) ) assertEquals ( listOf ( Segment . SIZE - writeSize , Segment . SIZE ) , segmentSizes ( source ) ) }","docstring":"/** The big part of source's first segment is staying put. */"} {"signature":"@ Test fun readAllWritesAllSegmentsAtOnce ( )","body":"{ val write1 = Buffer ( ) write1 . writeString ( '' . repeat ( Segment . SIZE ) + '' . repeat ( Segment . SIZE ) + '' . repeat ( Segment . SIZE ) ) val source = Buffer ( ) source . writeString ( '' . repeat ( Segment . SIZE ) + '' . repeat ( Segment . SIZE ) + '' . repeat ( Segment . SIZE ) ) val mockSink = MockSink ( ) assertEquals ( ( Segment . SIZE * ) . toLong ( ) , source . transferTo ( mockSink ) ) assertEquals ( , source . size ) mockSink . assertLog ( \"\" ) }","docstring":"/**\n * When writing data that's already buffered, there's no reason to page the\n * data by segment.\n */"} {"signature":"fun checkPsiOrLightTree ( element : D , source : KtSourceElement , context : CheckerContext , reporter : DiagnosticReporter )","body":"{ }","docstring":"/**\n * By default psi tree should be equivalent to light tree and can be processed the same way.\n */"} {"signature":"private fun < E : Throwable > E . causeAndStacktrace ( ) : Pair < E , Array < StackTraceElement > >","body":"{ val cause = cause return if ( cause != null && cause . javaClass == javaClass ) { val currentTrace = stackTrace if ( currentTrace . any { it . isArtificial ( ) } ) cause as E to currentTrace else this to emptyArray ( ) } else { this to emptyArray ( ) } }","docstring":"/**\n * Find initial cause of the exception without restored stacktrace.\n * Returns intermediate stacktrace as well in order to avoid excess cloning of array as an optimization.\n */"} {"signature":"private fun resolverForModuleDescriptorImpl ( descriptor : ModuleDescriptor ) : ResolverForModule ?","body":"{ return projectContext . storageManager . compute { checkValid ( ) descriptor . assertValid ( ) val module = moduleInfoByDescriptor [ descriptor ] if ( module == null ) { if ( delegateResolver is EmptyResolverForProject < * > ) { return@compute null } return@compute ( delegateResolver as AbstractResolverForProject < M > ) . resolverForModuleDescriptorImpl ( descriptor ) } resolverByModuleDescriptor . getOrPut ( descriptor ) { checkModuleIsCorrect ( module ) ResolverForModuleComputationTracker . getInstance ( projectContext . project ) ? . onResolverComputed ( module ) createResolverForModule ( descriptor , module ) } } }","docstring":"/**\n * We have a problem investigating EA-214260 (KT-40301), that is why we separated searching the\n * [ResolverForModule] and reporting the problem in [resolverForModuleDescriptor] (so we can tweak the reported information more\n * accurately).\n *\n * We use the fact that [ResolverForProject] have only two inheritors: [EmptyResolverForProject] and [AbstractResolverForProject].\n * So if the [delegateResolver] is not an [EmptyResolverForProject], it has to be [AbstractResolverForProject].\n *\n * Knowing that, we can safely use [resolverForModuleDescriptorImpl] recursively, and get the same result\n * as with [resolverForModuleDescriptor].\n */"} {"signature":"public actual fun ComplexDouble ( re : Double , im : Double ) : ComplexDouble","body":"= WasmComplexDouble ( re , im )","docstring":"/**\n * Creates a [ComplexDouble] with the given real and imaginary values in floating-point format.\n *\n * @param re the real value of the complex number in double format.\n * @param im the imaginary value of the complex number in double format.\n */"} {"signature":"public actual fun ComplexDouble ( re : Number , im : Number ) : ComplexDouble","body":"= ComplexDouble ( re . toDouble ( ) , im . toDouble ( ) )","docstring":"/**\n * Creates a [ComplexDouble] with the given real and imaginary values in number format.\n *\n * @param re the real value of the complex number in number format.\n * @param im the imaginary value of the complex number in number format.\n */"} {"signature":"@ ExperimentalSerializationApi public fun < T > Json . decodeFromDynamic ( deserializer : DeserializationStrategy < T > , dynamic : dynamic ) : T","body":"= decodeDynamic ( deserializer , dynamic )","docstring":"/**\n * Converts native JavaScript objects into Kotlin ones, verifying their types.\n *\n * A result of `decodeFromDynamic(nativeObj)` should be the same as\n * `kotlinx.serialization.json.Json.decodeFromString(kotlin.js.JSON.stringify(nativeObj))`.\n * This class also supports array-based polymorphism if the corresponding flag in [Json.configuration] is set to `true`.\n * Does not support any other [Map] keys than [String].\n * Has limitation on [Long] type: any JS number that is greater than\n * [`abs(2^53-1)`](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Number/MAX_SAFE_INTEGER)\n * is considered to be imprecise and therefore can't be deserialized to [Long]. Either use [Double] type\n * for such values or pass them as strings using [LongAsStringSerializer] afterwards.\n *\n * Usage example:\n *\n * ```\n * @Serializable\n * data class Data(val a: Int)\n *\n * @Serializable\n * data class DataWrapper(val s: String, val d: Data?)\n *\n * val dyn: dynamic = js(\"\"\"{s:\"foo\", d:{a:42}}\"\"\")\n * val parsed = Json.decodeFromDynamic(DataWrapper.serializer(), dyn)\n * parsed == DataWrapper(\"foo\", Data(42)) // true\n * ```\n */"} {"signature":"@ ExperimentalSerializationApi public inline fun < reified T > Json . decodeFromDynamic ( dynamic : dynamic ) : T","body":"= decodeFromDynamic ( serializersModule . serializer ( ) , dynamic )","docstring":"/**\n * A reified version of [decodeFromDynamic].\n */"} {"signature":"@ ExperimentalSerializationApi public fun < T > Json . encodeToDynamic ( serializer : SerializationStrategy < T > , value : T ) : dynamic","body":"= encodeDynamic ( serializer , value )","docstring":"/**\n * Converts Kotlin data structures to plain Javascript objects\n *\n * Limitations:\n * * Map keys must be of primitive or enum type\n * * All [Long] values must be less than [`abs(2^53-1)`](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Number/MAX_SAFE_INTEGER).\n * Otherwise, they're encoded as doubles with precision loss and require `isLenient` flag of [Json.configuration] set to true.\n *\n * Example of usage:\n * ```\n * @Serializable\n * open class DataWrapper(open val s: String, val d: String?)\n *\n * val wrapper = DataWrapper(\"foo\", \"bar\")\n * val plainJS: dynamic = Json.encodeToDynamic(DataWrapper.serializer(), wrapper)\n * ```\n */"} {"signature":"@ ExperimentalSerializationApi public inline fun < reified T > Json . encodeToDynamic ( value : T ) : dynamic","body":"= encodeToDynamic ( serializersModule . serializer ( ) , value )","docstring":"/**\n * A reified version of [encodeToDynamic].\n */"} {"signature":"@ Test @ Suppress ( \"\" ) fun testChild ( )","body":"= runTest { val barrier = CyclicBarrier ( ) repeat ( N_ITERATIONS ) { var wasLaunched = false var unhandledException : Throwable ? = null val handler = CoroutineExceptionHandler { _ , ex -> unhandledException = ex } val scope = CoroutineScope ( pool + handler ) val parent = CompletableDeferred < Unit > ( ) val launcher = scope . launch { barrier . await ( ) launch ( parent ) { wasLaunched = true throw TestException ( ) } } val canceller = scope . launch { barrier . await ( ) parent . cancel ( ) } barrier . await ( ) joinAll ( launcher , canceller , parent ) assertNull ( unhandledException ) if ( wasLaunched ) { val exception = parent . getCompletionExceptionOrNull ( ) assertIs < TestException > ( exception , \"\" ) } } }","docstring":"/**\n * Perform concurrent launch of a child job & cancellation of the explicit parent job\n */"} {"signature":"public abstract fun write ( ) : Metadata","body":"public abstract fun write ( ) : Metadata","docstring":"/**\n * Encodes and writes this metadata to the new instance of [Metadata].\n *\n * This method encodes all available data, including [version] and [flags].\n * Due to technical limitations, it is not possible to write the metadata when the specified version is less than 1.4.\n * It is also not possible to write metadata with the version higher that [JvmMetadataVersion.LATEST_STABLE_SUPPORTED] + 1, as\n * we do not know if a metadata format is the same for yet unreleased Kotlin compilers.\n *\n * @throws IllegalArgumentException if metadata is malformed, or metadata was read in lenient mode and cannot be written back,\n * or [version] of this instance is less than 1.4, or [version] of this instance is too high.\n */"} {"signature":"public fun transform ( metadata : Metadata , transformer : ( KotlinClassMetadata ) -> Unit ) : Metadata","body":"{ return readStrict ( metadata ) . apply ( transformer ) . write ( ) }","docstring":"/**\n * Utility method to combine reading and writing of metadata:\n * First, [metadata] is parsed with [readStrict]; then, [transformer] is called on a read instance.\n * [transformer] may mutate passed instance of [KotlinClassMetadata] to achieve a desired result.\n * After transformation, [KotlinClassMetadata.write] method is called and its result becomes return value of this method.\n *\n * @throws IllegalArgumentException if metadata cannot be read or written\n *\n * @see readStrict\n * @see write\n */"} {"signature":"@ JvmStatic public fun readStrict ( annotationData : Metadata ) : KotlinClassMetadata","body":"= readMetadataImpl ( annotationData , lenient = false )","docstring":"/**\n * Reads and parses the given annotation data of a Kotlin JVM class file and returns the correct type of [KotlinClassMetadata] encoded by\n * this annotation, if the metadata version is supported.\n *\n * [annotationData] may be obtained reflectively, constructed manually or with helper [kotlin.metadata.jvm.Metadata] function,\n * or equivalent [KotlinClassHeader] can be used.\n *\n * This method can read only supported metadata versions (see [JvmMetadataVersion.LATEST_STABLE_SUPPORTED] for definition).\n * It will throw an exception if the metadata version is greater than what kotlinx-metadata-jvm understands.\n * It is suitable when your tooling cannot tolerate reading potentially incomplete or incorrect information due to version differences.\n * It is also the only method that allows metadata transformation and `KotlinClassMetadata.write` subsequent calls.\n *\n * @throws IllegalArgumentException if the metadata version is unsupported or if metadata is corrupted\n *\n * @see JvmMetadataVersion.LATEST_STABLE_SUPPORTED\n */"} {"signature":"@ JvmStatic public fun readLenient ( annotationData : Metadata ) : KotlinClassMetadata","body":"= readMetadataImpl ( annotationData , lenient = true )","docstring":"/**\n * Reads and parses the given annotation data of a Kotlin JVM class file and returns the correct type of [KotlinClassMetadata] encoded by\n * this annotation. [KotlinClassMetadata] instances obtained from this method cannot be written.\n *\n * [annotationData] may be obtained reflectively, constructed manually or with helper [kotlin.metadata.jvm.Metadata] function,\n * or equivalent [KotlinClassHeader] can be used.\n *\n * This method makes best effort to read unsupported metadata versions.\n * If [annotationData] version is greater than [JvmMetadataVersion.LATEST_STABLE_SUPPORTED] + 1, this method still attempts to read it and may ignore parts of the metadata it does not understand.\n * Keep in mind that this method will still throw an exception if metadata is changed in an unpredictable way.\n * Because obtained metadata can be incomplete, its [KotlinClassMetadata.write] method will throw an exception.\n * This method still cannot read metadata produced by pre-1.0 compilers.\n *\n * @throws IllegalArgumentException if the metadata version is that of Kotlin 1.0, or the metadata format has been changed in an unpredictable way and reading of incompatible metadata is not possible\n *\n * @see JvmMetadataVersion.LATEST_STABLE_SUPPORTED\n */"} {"signature":"fun main ( )","body":"{ val preprocessing = pipeline < BufferedImage > ( ) . crop { left = right = top = bottom = } . rotate { degrees = } . resize { outputWidth = outputHeight = interpolation = InterpolationType . NEAREST } . onResult { ImageIO . write ( it , \"\" , File ( \"\" ) ) } . pad { top = bottom = left = right = mode = PaddingMode . Fill ( Color . WHITE ) } . convert { colorMode = ColorMode . BGR } . toFloatArray { } . rescale { scalingCoefficient = } val imageResource = Operation :: class . java . getResource ( \"\" ) val image = File ( imageResource ! ! . toURI ( ) ) val ( rawImage , shape ) = preprocessing . fileLoader ( ) . load ( image ) val bufferedImage = ImageConverter . floatArrayToBufferedImage ( rawImage , shape , ColorMode . BGR , isNormalized = true ) showFrame ( \"\" , ImagePanel ( bufferedImage ) ) }","docstring":"/**\n * This example shows how to do image preprocessing using preprocessing DSL for only one image.\n *\n * It includes:\n * - image preprocessing;\n * - image visualisation with the [ImagePanel].\n */"} {"signature":"@ Suppress ( \"\" ) fun compile ( ) : List < ClassFile >","body":"= sourceFile . compile ( tmpDir )","docstring":"/** Compiles this source file and returns all generated .class files. */"} {"signature":"fun compileAll ( srcDir : File , tmpDir : TemporaryFolder , classpath : List < File > = emptyList ( ) ) : List < ClassFile >","body":"{ val classesDir = srcDir . path . let { File ( it . substringBeforeLast ( \"\" ) + \"\" + it . substringAfterLast ( \"\" ) ) } val kotlinClasses = compileKotlin ( srcDir , classesDir , classpath ) val javaClasspath = classpath + listOfNotNull ( kotlinClasses . firstOrNull ( ) ? . classRoot ) val javaClasses = compileJava ( srcDir , classesDir = tmpDir . newFolder ( ) , javaClasspath ) return kotlinClasses + javaClasses }","docstring":"/** Compiles the source files in the given directory and returns all generated .class files. */"} {"signature":"@ HtmlTagMarker inline fun PICTURE . source ( classes : String ? = null , crossinline block : SOURCE . ( ) -> Unit = { } ) : Unit","body":"= SOURCE ( attributesMapOf ( \"\" , classes ) , consumer ) . visit ( block )","docstring":"/**\n * Media source for \n */"} {"signature":"@ HtmlTagMarker inline fun PICTURE . img ( alt : String ? = null , src : String ? = null , loading : ImgLoading ? = null , classes : String ? = null , crossinline block : IMG . ( ) -> Unit = { } ) : Unit","body":"= IMG ( attributesMapOf ( \"\" , alt , \"\" , src , \"\" , loading ? . enumEncode ( ) , \"\" , classes ) , consumer ) . visit ( block )","docstring":"/**\n * Embedded image\n */"} {"signature":"private fun BlockHound . Builder . allowBlockingCallsInPrimitiveImplementations ( )","body":"{ allowBlockingCallsInJobSupport ( ) allowBlockingCallsInThreadSafeHeap ( ) allowBlockingCallsInFlow ( ) allowBlockingCallsInChannels ( ) }","docstring":"/**\n * Allows blocking calls in various coroutine structures, such as flows and channels.\n *\n * They use locks in implementations, though only for protecting short pieces of fast and well-understood code, so\n * locking in such places doesn't affect the program liveness.\n */"} {"signature":"private fun BlockHound . Builder . allowBlockingCallsInJobSupport ( )","body":"{ for ( method in listOf ( \"\" , \"\" , \"\" , \"\" ) ) { allowBlockingCallsInside ( \"\" , method ) } }","docstring":"/**\n * Allows blocking inside [kotlinx.coroutines.JobSupport].\n */"} {"signature":"private fun BlockHound . Builder . allowBlockingCallsInDebugProbes ( )","body":"{ for ( method in listOf ( \"\" , \"\" , \"\" , \"\" , \"\" , \"\" , \"\" , \"\" ) ) { allowBlockingCallsInside ( \"\" , method ) } }","docstring":"/**\n * Allow blocking calls inside [kotlinx.coroutines.debug.internal.DebugProbesImpl].\n */"} {"signature":"private fun BlockHound . Builder . allowBlockingCallsInWorkQueue ( )","body":"{ allowBlockingCallsInside ( \"\" , \"\" ) }","docstring":"/**\n * Allow blocking calls inside [kotlinx.coroutines.scheduling.WorkQueue]\n */"} {"signature":"private fun BlockHound . Builder . allowBlockingCallsInThreadSafeHeap ( )","body":"{ for ( method in listOf ( \"\" , \"\" , \"\" , \"\" ) ) { allowBlockingCallsInside ( \"\" , method ) } }","docstring":"/**\n * Allows blocking inside [kotlinx.coroutines.internal.ThreadSafeHeap].\n */"} {"signature":"private fun BlockHound . Builder . allowBlockingCallsInsideStateFlow ( )","body":"{ allowBlockingCallsInside ( \"\" , \"\" ) }","docstring":"/**\n * Allows blocking inside the implementation of [kotlinx.coroutines.flow.StateFlow].\n */"} {"signature":"private fun BlockHound . Builder . allowBlockingCallsInsideSharedFlow ( )","body":"{ for ( method in listOf ( \"\" , \"\" , \"\" , \"\" , \"\" , \"\" , \"\" ) ) { allowBlockingCallsInside ( \"\" , method ) } for ( method in listOf ( \"\" , \"\" , \"\" ) ) { allowBlockingCallsInside ( \"\" , method ) } }","docstring":"/**\n * Allows blocking inside the implementation of [kotlinx.coroutines.flow.SharedFlow].\n */"} {"signature":"private fun BlockHound . Builder . allowBlockingCallsInBroadcastChannels ( )","body":"{ for ( method in listOf ( \"\" , \"\" , \"\" , \"\" , \"\" , \"\" , \"\" , \"\" , \"\" , \"\" ) ) { allowBlockingCallsInside ( \"\" , method ) } for ( method in listOf ( \"\" ) ) { allowBlockingCallsInside ( \"\" , method ) } for ( method in listOf ( \"\" ) ) { allowBlockingCallsInside ( \"\" , method ) } }","docstring":"/**\n * Allows blocking inside [kotlinx.coroutines.channels.BroadcastChannel].\n */"} {"signature":"private fun BlockHound . Builder . allowBlockingCallsInConflatedChannels ( )","body":"{ for ( method in listOf ( \"\" , \"\" , \"\" , \"\" , \"\" , \"\" , \"\" , \"\" , \"\" , \"\" , \"\" , \"\" , \"\" ) ) { allowBlockingCallsInside ( \"\" , method ) } for ( method in listOf ( \"\" ) ) { allowBlockingCallsInside ( \"\" , method ) } }","docstring":"/**\n * Allows blocking inside [kotlinx.coroutines.channels.ConflatedBufferedChannel].\n */"} {"signature":"private fun BlockHound . Builder . allowBlockingWhenEnqueuingTasks ( )","body":"{ allowBlockingCallsInside ( \"\" , \"\" ) }","docstring":"/**\n * Allows blocking when enqueuing tasks into a thread pool.\n *\n * Without this, the following code breaks:\n * ```\n * withContext(Dispatchers.Default) {\n * withContext(newSingleThreadContext(\"singleThreadedContext\")) {\n * }\n * }\n * ```\n */"} {"signature":"private fun BlockHound . Builder . allowServiceLoaderInvocationsOnInit ( )","body":"{ allowBlockingCallsInside ( \"\" , \"\" ) allowBlockingCallsInside ( \"\" , \"\" ) allowBlockingCallsInside ( \"\" , \"\" ) }","docstring":"/**\n * Allows instances of [java.util.ServiceLoader] being called.\n *\n * Each instance is listed separately; another approach could be to generally allow the operations performed by\n * service loaders, as they can generally be considered safe. This was not done here because ServiceLoader has a\n * large API surface, with some methods being hidden as implementation details (in particular, the implementation of\n * its iterator is completely opaque). Relying on particular names being used in ServiceLoader's implementation\n * would be brittle, so here we only provide clearance rules for some specific instances.\n */"} {"signature":"private fun BlockHound . Builder . allowBlockingCallsInReflectionImpl ( )","body":"{ allowBlockingCallsInside ( \"\" , \"\" ) }","docstring":"/**\n * Allows some blocking calls from the reflection API.\n *\n * The API is big, so surely some other blocking calls will show up, but with these rules in place, at least some\n * simple examples work without problems.\n */"} {"signature":"fun remoteUrl ( @ Language ( \"\" ) value : String ) : Unit","body":"= remoteUrl . set ( URI ( value ) )","docstring":"/**\n * Set the value of [remoteUrl].\n *\n * @param[value] will be converted to a [URI]\n */"} {"signature":"fun remoteUrl ( value : Provider < String > ) : Unit","body":"= remoteUrl . set ( value . map ( :: URI ) )","docstring":"/**\n * Set the value of [remoteUrl].\n *\n * @param[value] will be converted to a [URI]\n */"} {"signature":"inline fun < reified T > SparkSession . toDS ( list : List < T > ) : Dataset < T >","body":"= createDataset ( list , encoder < T > ( ) )","docstring":"/**\n * Utility method to create dataset from list\n */"} {"signature":"inline fun < reified T > SparkSession . toDF ( list : List < T > , vararg colNames : String ) : Dataset < Row >","body":"= toDS ( list ) . run { if ( colNames . isEmpty ( ) ) toDF ( ) else toDF ( * colNames ) }","docstring":"/**\n * Utility method to create dataframe from list\n */"} {"signature":"inline fun < reified T > SparkSession . dsOf ( vararg t : T ) : Dataset < T >","body":"= createDataset ( t . toList ( ) , encoder < T > ( ) )","docstring":"/**\n * Utility method to create dataset from *array or vararg arguments\n */"} {"signature":"inline fun < reified T > SparkSession . dfOf ( vararg t : T ) : Dataset < Row >","body":"= createDataset ( t . toList ( ) , encoder < T > ( ) ) . toDF ( )","docstring":"/**\n * Utility method to create dataframe from *array or vararg arguments\n */"} {"signature":"inline fun < reified T > SparkSession . dfOf ( colNames : Array < String > , vararg t : T ) : Dataset < Row >","body":"= createDataset ( t . toList ( ) , encoder < T > ( ) ) . run { if ( colNames . isEmpty ( ) ) toDF ( ) else toDF ( * colNames ) }","docstring":"/**\n * Utility method to create dataframe from *array or vararg arguments with given column names\n */"} {"signature":"inline fun < reified T > List < T > . toDS ( spark : SparkSession ) : Dataset < T >","body":"= spark . createDataset ( this , encoder < T > ( ) )","docstring":"/**\n * Utility method to create dataset from list\n */"} {"signature":"inline fun < reified T > List < T > . toDF ( spark : SparkSession , vararg colNames : String ) : Dataset < Row >","body":"= toDS ( spark ) . run { if ( colNames . isEmpty ( ) ) toDF ( ) else toDF ( * colNames ) }","docstring":"/**\n * Utility method to create dataframe from list\n */"} {"signature":"inline fun < reified T > Array < T > . toDS ( spark : SparkSession ) : Dataset < T >","body":"= toList ( ) . toDS ( spark )","docstring":"/**\n * Utility method to create dataset from list\n */"} {"signature":"inline fun < reified T > Array < T > . toDF ( spark : SparkSession , vararg colNames : String ) : Dataset < Row >","body":"= toDS ( spark ) . run { if ( colNames . isEmpty ( ) ) toDF ( ) else toDF ( * colNames ) }","docstring":"/**\n * Utility method to create dataframe from list\n */"} {"signature":"inline fun < reified T > RDD < T > . toDS ( spark : SparkSession ) : Dataset < T >","body":"= spark . createDataset ( this , encoder < T > ( ) )","docstring":"/**\n * Utility method to create dataset from RDD\n */"} {"signature":"inline fun < reified T > JavaRDDLike < T , * > . toDS ( spark : SparkSession ) : Dataset < T >","body":"= spark . createDataset ( this . rdd ( ) , encoder < T > ( ) )","docstring":"/**\n * Utility method to create dataset from JavaRDD\n */"} {"signature":"inline fun < reified T > JavaRDDLike < T , * > . toDF ( spark : SparkSession , vararg colNames : String ) : Dataset < Row >","body":"= toDS ( spark ) . run { if ( colNames . isEmpty ( ) ) toDF ( ) else toDF ( * colNames ) }","docstring":"/**\n * Utility method to create Dataset (Dataframe) from JavaRDD.\n * NOTE: [T] must be [Serializable].\n */"} {"signature":"inline fun < reified T > RDD < T > . toDF ( spark : SparkSession , vararg colNames : String ) : Dataset < Row >","body":"= toDS ( spark ) . run { if ( colNames . isEmpty ( ) ) toDF ( ) else toDF ( * colNames ) }","docstring":"/**\n * Utility method to create Dataset (Dataframe) from RDD.\n * NOTE: [T] must be [Serializable].\n */"} {"signature":"inline fun < reified T , reified R > Dataset < T > . map ( noinline func : ( T ) -> R ) : Dataset < R >","body":"= map ( MapFunction ( func ) , encoder < R > ( ) )","docstring":"/**\n * (Kotlin-specific)\n * Returns a new Dataset that contains the result of applying [func] to each element.\n */"} {"signature":"inline fun < T , reified R > Dataset < T > . flatMap ( noinline func : ( T ) -> Iterator < R > ) : Dataset < R >","body":"= flatMap ( func , encoder < R > ( ) )","docstring":"/**\n * (Kotlin-specific)\n * Returns a new Dataset by first applying a function to all elements of this Dataset,\n * and then flattening the results.\n */"} {"signature":"inline fun < reified T , I : Iterable < T > > Dataset < I > . flatten ( ) : Dataset < T >","body":"= flatMap ( FlatMapFunction { it . iterator ( ) } , encoder < T > ( ) )","docstring":"/**\n * (Kotlin-specific)\n * Returns a new Dataset by flattening. This means that a Dataset of an iterable such as\n * `listOf(listOf(1, 2, 3), listOf(4, 5, 6))` will be flattened to a Dataset of `listOf(1, 2, 3, 4, 5, 6)`.\n */"} {"signature":"inline fun < T , reified R > Dataset < T > . groupByKey ( noinline func : ( T ) -> R ) : KeyValueGroupedDataset < R , T >","body":"= groupByKey ( MapFunction ( func ) , encoder < R > ( ) )","docstring":"/**\n * (Kotlin-specific)\n * Returns a [KeyValueGroupedDataset] where the data is grouped by the given key [func].\n */"} {"signature":"inline fun < T , reified R > Dataset < T > . mapPartitions ( noinline func : ( Iterator < T > ) -> Iterator < R > ) : Dataset < R >","body":"= mapPartitions ( func , encoder < R > ( ) )","docstring":"/**\n * (Kotlin-specific)\n * Returns a new Dataset that contains the result of applying [func] to each partition.\n */"} {"signature":"@ Suppress ( \"\" ) fun < T : Any > Dataset < T ? > . filterNotNull ( ) : Dataset < T >","body":"= filter { it != null } as Dataset < T >","docstring":"/**\n * (Kotlin-specific)\n * Filters rows to eliminate [null] values.\n */"} {"signature":"inline fun < reified T > Dataset < T > . reduceK ( noinline func : ( T , T ) -> T ) : T","body":"= reduce ( ReduceFunction ( func ) )","docstring":"/**\n * (Kotlin-specific)\n * Reduces the elements of this Dataset using the specified binary function. The given `func`\n * must be commutative and associative or the result may be non-deterministic.\n */"} {"signature":"@ JvmName ( \"\" ) inline fun < reified T1 , T2 > Dataset < Tuple2 < T1 , T2 > > . takeKeys ( ) : Dataset < T1 >","body":"= map { it . _1 ( ) }","docstring":"/**\n * (Kotlin-specific)\n * Maps the Dataset to only retain the \"keys\" or [Tuple2._1] values.\n */"} {"signature":"inline fun < reified T1 , T2 > Dataset < Pair < T1 , T2 > > . takeKeys ( ) : Dataset < T1 >","body":"= map { it . first }","docstring":"/**\n * (Kotlin-specific)\n * Maps the Dataset to only retain the \"keys\" or [Pair.first] values.\n */"} {"signature":"@ Suppress ( \"\" ) @ JvmName ( \"\" ) @ Deprecated ( \"\" , ReplaceWith ( \"\" ) ) inline fun < reified T1 , T2 > Dataset < Arity2 < T1 , T2 > > . takeKeys ( ) : Dataset < T1 >","body":"= map { it . _1 }","docstring":"/**\n * (Kotlin-specific)\n * Maps the Dataset to only retain the \"keys\" or [Arity2._1] values.\n */"} {"signature":"@ JvmName ( \"\" ) inline fun < T1 , reified T2 > Dataset < Tuple2 < T1 , T2 > > . takeValues ( ) : Dataset < T2 >","body":"= map { it . _2 ( ) }","docstring":"/**\n * (Kotlin-specific)\n * Maps the Dataset to only retain the \"values\" or [Tuple2._2] values.\n */"} {"signature":"inline fun < T1 , reified T2 > Dataset < Pair < T1 , T2 > > . takeValues ( ) : Dataset < T2 >","body":"= map { it . second }","docstring":"/**\n * (Kotlin-specific)\n * Maps the Dataset to only retain the \"values\" or [Pair.second] values.\n */"} {"signature":"@ Suppress ( \"\" ) @ JvmName ( \"\" ) @ Deprecated ( \"\" , ReplaceWith ( \"\" ) ) inline fun < T1 , reified T2 > Dataset < Arity2 < T1 , T2 > > . takeValues ( ) : Dataset < T2 >","body":"= map { it . _2 }","docstring":"/**\n * (Kotlin-specific)\n * Maps the Dataset to only retain the \"values\" or [Arity2._2] values.\n */"} {"signature":"@ Deprecated ( message = \"\" , replaceWith = ReplaceWith ( \"\" ) , level = DeprecationLevel . ERROR , ) inline fun < T , reified R > Dataset < T > . downcast ( ) : Dataset < R >","body":"= `as` ( encoder < R > ( ) )","docstring":"/** DEPRECATED: Use [as] or [to] for this. */"} {"signature":"inline fun < reified R > Dataset < * > . `as` ( ) : Dataset < R >","body":"= `as` ( encoder < R > ( ) )","docstring":"/**\n * (Kotlin-specific)\n * Returns a new Dataset where each record has been mapped on to the specified type. The\n * method used to map columns depend on the type of [R]:\n * - When [R] is a class, fields for the class will be mapped to columns of the same name\n * (case sensitivity is determined by [spark.sql.caseSensitive]).\n * - When [R] is a tuple, the columns will be mapped by ordinal (i.e. the first column will\n * be assigned to `_1`).\n * - When [R] is a primitive type (i.e. [String], [Int], etc.), then the first column of the\n * `DataFrame` will be used.\n *\n * If the schema of the Dataset does not match the desired [R] type, you can use [Dataset.select]/[selectTyped]\n * along with [Dataset.alias] or [as]/[to] to rearrange or rename as required.\n *\n * Note that [as]/[to] only changes the view of the data that is passed into typed operations,\n * such as [map], and does not eagerly project away any columns that are not present in\n * the specified class.\n *\n * @see to as alias for [as]\n */"} {"signature":"inline fun < reified R > Dataset < * > . to ( ) : Dataset < R >","body":"= `as` ( encoder < R > ( ) )","docstring":"/**\n * (Kotlin-specific)\n * Returns a new Dataset where each record has been mapped on to the specified type. The\n * method used to map columns depend on the type of [R]:\n * - When [R] is a class, fields for the class will be mapped to columns of the same name\n * (case sensitivity is determined by [spark.sql.caseSensitive]).\n * - When [R] is a tuple, the columns will be mapped by ordinal (i.e. the first column will\n * be assigned to `_1`).\n * - When [R] is a primitive type (i.e. [String], [Int], etc.), then the first column of the\n * `DataFrame` will be used.\n *\n * If the schema of the Dataset does not match the desired [R] type, you can use [Dataset.select]/[selectTyped]\n * along with [Dataset.alias] or [as]/[to] to rearrange or rename as required.\n *\n * Note that [as]/[to] only changes the view of the data that is passed into typed operations,\n * such as [map], and does not eagerly project away any columns that are not present in\n * the specified class.\n *\n * @see as as alias for [to]\n */"} {"signature":"inline fun < reified T > Dataset < T > . forEach ( noinline func : ( T ) -> Unit ) : Unit","body":"= foreach ( ForeachFunction ( func ) )","docstring":"/**\n * (Kotlin-specific)\n * Applies a function [func] to all rows.\n */"} {"signature":"inline fun < reified T > Dataset < T > . forEachPartition ( noinline func : ( Iterator < T > ) -> Unit ) : Unit","body":"= foreachPartition ( ForeachPartitionFunction ( func ) )","docstring":"/**\n * (Kotlin-specific)\n * Runs [func] on each partition of this Dataset.\n */"} {"signature":"fun < T > Dataset < T > . debugCodegen ( ) : Dataset < T >","body":"= also { KSparkExtensions . debugCodegen ( it ) }","docstring":"/**\n * It's hard to call `Dataset.debugCodegen` from kotlin, so here is utility for that\n */"} {"signature":"fun < T > Dataset < T > . debug ( ) : Dataset < T >","body":"= also { KSparkExtensions . debug ( it ) }","docstring":"/**\n * It's hard to call `Dataset.debug` from kotlin, so here is utility for that\n */"} {"signature":"inline fun < reified L , reified R : Any ? > Dataset < L > . leftJoin ( right : Dataset < R > , col : Column ) : Dataset < Tuple2 < L , R ? > >","body":"= joinWith ( right , col , \"\" )","docstring":"/**\n * Alias for [Dataset.joinWith] which passes \"left\" argument\n * and respects the fact that in result of left join right relation is nullable\n *\n * @receiver left dataset\n * @param right right dataset\n * @param col join condition\n *\n * @return dataset of [Tuple2] where right element is forced nullable\n */"} {"signature":"inline fun < reified L : Any ? , reified R > Dataset < L > . rightJoin ( right : Dataset < R > , col : Column ) : Dataset < Tuple2 < L ? , R > >","body":"= joinWith ( right , col , \"\" )","docstring":"/**\n * Alias for [Dataset.joinWith] which passes \"right\" argument\n * and respects the fact that in result of right join left relation is nullable\n *\n * @receiver left dataset\n * @param right right dataset\n * @param col join condition\n *\n * @return dataset of [Tuple2] where left element is forced nullable\n */"} {"signature":"inline fun < reified L , reified R > Dataset < L > . innerJoin ( right : Dataset < R > , col : Column ) : Dataset < Tuple2 < L , R > >","body":"= joinWith ( right , col , \"\" )","docstring":"/**\n * Alias for [Dataset.joinWith] which passes \"inner\" argument\n *\n * @receiver left dataset\n * @param right right dataset\n * @param col join condition\n *\n * @return resulting dataset of [Tuple2]\n */"} {"signature":"inline fun < reified L : Any ? , reified R : Any ? > Dataset < L > . fullJoin ( right : Dataset < R > , col : Column , ) : Dataset < Tuple2 < L ? , R ? > >","body":"= joinWith ( right , col , \"\" )","docstring":"/**\n * Alias for [Dataset.joinWith] which passes \"full\" argument\n * and respects the fact that in result of join any element of resulting tuple is nullable\n *\n * @receiver left dataset\n * @param right right dataset\n * @param col join condition\n *\n * @return dataset of [Tuple2] where both elements are forced nullable\n */"} {"signature":"inline fun < reified T > Dataset < T > . sort ( columns : ( Dataset < T > ) -> Array < Column > ) : Dataset < T >","body":"= sort ( * columns ( this ) )","docstring":"/**\n * Alias for [Dataset.sort] which forces user to provide sorted columns from the source dataset\n *\n * @receiver source [Dataset]\n * @param columns producer of sort columns\n * @return sorted [Dataset]\n */"} {"signature":"@ JvmName ( \"\" ) fun < T1 , T2 > Dataset < Tuple2 < T1 , T2 > > . sortByKey ( ) : Dataset < Tuple2 < T1 , T2 > >","body":"= sort ( \"\" )","docstring":"/** Returns a dataset sorted by the first (`_1`) value of each [Tuple2] inside. */"} {"signature":"@ JvmName ( \"\" ) fun < T1 , T2 > Dataset < Tuple2 < T1 , T2 > > . sortByValue ( ) : Dataset < Tuple2 < T1 , T2 > >","body":"= sort ( \"\" )","docstring":"/** Returns a dataset sorted by the second (`_2`) value of each [Tuple2] inside. */"} {"signature":"@ Suppress ( \"\" ) @ Deprecated ( \"\" , ReplaceWith ( \"\" ) ) @ JvmName ( \"\" ) fun < T1 , T2 > Dataset < Arity2 < T1 , T2 > > . sortByKey ( ) : Dataset < Arity2 < T1 , T2 > >","body":"= sort ( \"\" )","docstring":"/** Returns a dataset sorted by the first (`_1`) value of each [Arity2] inside. */"} {"signature":"@ Suppress ( \"\" ) @ Deprecated ( \"\" , ReplaceWith ( \"\" ) ) @ JvmName ( \"\" ) fun < T1 , T2 > Dataset < Arity2 < T1 , T2 > > . sortByValue ( ) : Dataset < Arity2 < T1 , T2 > >","body":"= sort ( \"\" )","docstring":"/** Returns a dataset sorted by the second (`_2`) value of each [Arity2] inside. */"} {"signature":"@ JvmName ( \"\" ) fun < T1 , T2 > Dataset < Pair < T1 , T2 > > . sortByKey ( ) : Dataset < Pair < T1 , T2 > >","body":"= sort ( \"\" )","docstring":"/** Returns a dataset sorted by the first (`first`) value of each [Pair] inside. */"} {"signature":"@ JvmName ( \"\" ) fun < T1 , T2 > Dataset < Pair < T1 , T2 > > . sortByValue ( ) : Dataset < Pair < T1 , T2 > >","body":"= sort ( \"\" )","docstring":"/** Returns a dataset sorted by the second (`second`) value of each [Pair] inside. */"} {"signature":"inline fun < reified T , R > Dataset < T > . withCached ( blockingUnpersist : Boolean = false , executeOnCached : Dataset < T > . ( ) -> R , ) : R","body":"{ val cached = this . cache ( ) return cached . executeOnCached ( ) . also { cached . unpersist ( blockingUnpersist ) } }","docstring":"/**\n * This function creates block, where one can call any further computations on already cached dataset\n * Data will be unpersisted automatically at the end of computation\n *\n * it may be useful in many situations, for example, when one needs to write data to several targets\n * ```kotlin\n * ds.withCached {\n * write()\n * .also { it.orc(\"First destination\") }\n * .also { it.avro(\"Second destination\") }\n * }\n * ```\n *\n * @param blockingUnpersist if execution should be blocked until everything persisted will be deleted\n * @param executeOnCached Block which should be executed on cached dataset.\n * @return result of block execution for further usage. It may be anything including source or new dataset\n */"} {"signature":"inline fun < reified T > Dataset < * > . toList ( ) : List < T >","body":"= to < T > ( ) . collectAsList ( ) as List < T >","docstring":"/**\n * Collects the dataset as list where each item has been mapped to type [T].\n */"} {"signature":"inline fun < reified T > Dataset < * > . toArray ( ) : Array < T >","body":"= to < T > ( ) . collect ( ) as Array < T >","docstring":"/**\n * Collects the dataset as Array where each item has been mapped to type [T].\n */"} {"signature":"fun < T > Dataset < T > . sort ( col : KProperty1 < T , * > , vararg cols : KProperty1 < T , * > ) : Dataset < T >","body":"= sort ( col . name , * cols . map { it . name } . toTypedArray ( ) )","docstring":"/**\n * Allows to sort data class dataset on one or more of the properties of the data class.\n * ```kotlin\n * val sorted: Dataset = unsorted.sort(YourClass::a)\n * val sorted2: Dataset = unsorted.sort(YourClass::a, YourClass::b)\n * ```\n */"} {"signature":"fun < T > Dataset < T > . showDS ( numRows : Int = , truncate : Boolean = true ) : Dataset < T >","body":"= apply { show ( numRows , truncate ) }","docstring":"/**\n * Alternative to [Dataset.show] which returns source dataset.\n * Useful for debug purposes when you need to view content of a dataset as an intermediate operation\n */"} {"signature":"@ Suppress ( \"\" ) inline fun < reified T , reified U1 > Dataset < T > . selectTyped ( c1 : TypedColumn < out Any , U1 > , ) : Dataset < U1 >","body":"= select ( c1 as TypedColumn < T , U1 > )","docstring":"/**\n * Returns a new Dataset by computing the given [Column] expressions for each element.\n */"} {"signature":"@ Suppress ( \"\" ) inline fun < reified T , reified U1 , reified U2 > Dataset < T > . selectTyped ( c1 : TypedColumn < out Any , U1 > , c2 : TypedColumn < out Any , U2 > , ) : Dataset < Tuple2 < U1 , U2 > >","body":"= select ( c1 as TypedColumn < T , U1 > , c2 as TypedColumn < T , U2 > , )","docstring":"/**\n * Returns a new Dataset by computing the given [Column] expressions for each element.\n */"} {"signature":"@ Suppress ( \"\" ) inline fun < reified T , reified U1 , reified U2 , reified U3 > Dataset < T > . selectTyped ( c1 : TypedColumn < out Any , U1 > , c2 : TypedColumn < out Any , U2 > , c3 : TypedColumn < out Any , U3 > , ) : Dataset < Tuple3 < U1 , U2 , U3 > >","body":"= select ( c1 as TypedColumn < T , U1 > , c2 as TypedColumn < T , U2 > , c3 as TypedColumn < T , U3 > , )","docstring":"/**\n * Returns a new Dataset by computing the given [Column] expressions for each element.\n */"} {"signature":"@ Suppress ( \"\" ) inline fun < reified T , reified U1 , reified U2 , reified U3 , reified U4 > Dataset < T > . selectTyped ( c1 : TypedColumn < out Any , U1 > , c2 : TypedColumn < out Any , U2 > , c3 : TypedColumn < out Any , U3 > , c4 : TypedColumn < out Any , U4 > , ) : Dataset < Tuple4 < U1 , U2 , U3 , U4 > >","body":"= select ( c1 as TypedColumn < T , U1 > , c2 as TypedColumn < T , U2 > , c3 as TypedColumn < T , U3 > , c4 as TypedColumn < T , U4 > , )","docstring":"/**\n * Returns a new Dataset by computing the given [Column] expressions for each element.\n */"} {"signature":"@ Suppress ( \"\" ) inline fun < reified T , reified U1 , reified U2 , reified U3 , reified U4 , reified U5 > Dataset < T > . selectTyped ( c1 : TypedColumn < out Any , U1 > , c2 : TypedColumn < out Any , U2 > , c3 : TypedColumn < out Any , U3 > , c4 : TypedColumn < out Any , U4 > , c5 : TypedColumn < out Any , U5 > , ) : Dataset < Tuple5 < U1 , U2 , U3 , U4 , U5 > >","body":"= select ( c1 as TypedColumn < T , U1 > , c2 as TypedColumn < T , U2 > , c3 as TypedColumn < T , U3 > , c4 as TypedColumn < T , U4 > , c5 as TypedColumn < T , U5 > , )","docstring":"/**\n * Returns a new Dataset by computing the given [Column] expressions for each element.\n */"} {"signature":"override fun inferBinaryName ( location : JavaFileManager . Location ? , file : JavaFileObject ) : String ?","body":"= super . inferBinaryName ( location , unwrapObject ( file ) as JavaFileObject )","docstring":"/** javac does not play nice with wrapped file objects in this method; so we unwrap */"} {"signature":"override fun isSameFile ( a : FileObject , b : FileObject ) : Boolean","body":"{ return super . isSameFile ( unwrapObject ( a ) , unwrapObject ( b ) ) }","docstring":"/** javac does not play nice with wrapped file objects in this method; so we unwrap */"} {"signature":"fun renderRowTypeName ( markerName : String ) : String","body":"fun renderRowTypeName ( markerName : String ) : String","docstring":"/**\n * How to render a row type. Used as receiver type for column accessors for DSLs.\n * E.g.: `DataRow`\n */"} {"signature":"fun renderColumnsContainerTypeName ( markerName : String ) : String","body":"fun renderColumnsContainerTypeName ( markerName : String ) : String","docstring":"/**\n * How to render a columns-container (base type for [DataFrame] and [ColumnSelectionDsl]).\n * Used as receiver type for column accessors.\n * E.g.: `ColumnsContainer`\n */"} {"signature":"fun BaseField . renderColumnType ( ) : Code","body":"fun BaseField . renderColumnType ( ) : Code","docstring":"/**\n * How to render a column type from a [BaseField]. Used as return type for column accessors.\n * Result will be a [DataColumn] (or [ColumnGroup], which can be seen as a [DataColumn]).\n * E.g.: `DataColumn>`\n */"} {"signature":"fun BaseField . renderAccessorFieldType ( ) : Code","body":"fun BaseField . renderAccessorFieldType ( ) : Code","docstring":"/**\n * How to render the field type of [BaseField]. Used as return type for column accessors for DSLs.\n * Result will be either the value type name, a [DataRow] or [DataFrame].\n */"} {"signature":"fun BaseField . renderFieldType ( ) : Code","body":"fun BaseField . renderFieldType ( ) : Code","docstring":"/**\n * How to render the field type of [BaseField]. Used as property type in generated interfaces.\n * Result will be either the value type name, the group field type name or [DataFrame].\n */"} {"signature":"protected fun generateExtensionProperties ( marker : IsolatedMarker , withNullable : Boolean = true ) : Code","body":"{ val markerName = marker . name val markerType = \"\" val visibility = renderTopLevelDeclarationVisibility ( marker ) val shortMarkerName = markerName . substring ( markerName . lastIndexOf ( '' ) + ) . removeQuotes ( ) val nullableShortMarkerName = \"\" fun String . toNullable ( ) = if ( this . last ( ) == '' || this == \"\" ) this else \"\" val declarations = mutableListOf < String > ( ) val dfTypename = renderColumnsContainerTypeName ( markerType ) val nullableDfTypename = renderColumnsContainerTypeName ( markerType . toNullable ( ) ) val rowTypename = renderRowTypeName ( markerType ) val nullableRowTypename = renderRowTypeName ( markerType . toNullable ( ) ) val nullableFields = marker . fields . map { it . toNullable ( ) } . associateBy { it . columnName } marker . fields . sortedBy { it . fieldName . quotedIfNeeded } . forEach { val getter = \"\" val name = it . fieldName val fieldType = it . renderAccessorFieldType ( ) val nullableFieldType = nullableFields [ it . columnName ] ! ! . renderAccessorFieldType ( ) val columnType = it . renderColumnType ( ) val nullableColumnType = nullableFields [ it . columnName ] ! ! . renderColumnType ( ) declarations . addAll ( listOf ( generatePropertyCode ( marker = marker , shortMarkerName = shortMarkerName , typeName = dfTypename , name = name . quotedIfNeeded , propertyType = columnType , getter = getter , visibility = visibility , ) , generatePropertyCode ( marker = marker , shortMarkerName = shortMarkerName , typeName = rowTypename , name = name . quotedIfNeeded , propertyType = fieldType , getter = getter , visibility = visibility , ) ) ) if ( withNullable ) { declarations . addAll ( listOf ( generatePropertyCode ( marker = marker , shortMarkerName = nullableShortMarkerName , typeName = nullableDfTypename , name = name . quotedIfNeeded , propertyType = nullableColumnType , getter = getter , visibility = visibility , ) , generatePropertyCode ( marker = marker , shortMarkerName = nullableShortMarkerName , typeName = nullableRowTypename , name = name . quotedIfNeeded , propertyType = nullableFieldType , getter = getter , visibility = visibility , ) ) ) } } return declarations . joinToString ( \"\" ) }","docstring":"/**\n * nullable properties can be needed when *DECLARED* schema is referenced with nullability:\n * ```\n * @DataSchema\n * data class Schema(val i: Int)\n *\n * @DataSchema\n * data class A(\n * val prop: Schema?\n * )\n * ```\n * When converted `listOf().toDataFrame(maxDepth=2)` actual schema is\n * ```\n * prop:\n * i: Int?\n * ```\n * So this sudden `i: Int?` must be somehow handled.\n * However, REPL code generator will not create such a situation. Nullable properties are not needed then\n */"} {"signature":"@ SinceKotlin ( \"\" ) public actual fun Char . isISOControl ( ) : Boolean","body":"{ return this <= '' || this in '' .. '' }","docstring":"/**\n * Returns `true` if this character is an ISO control character.\n *\n * A character is considered to be an ISO control character if its [category] is [CharCategory.CONTROL].\n *\n * @sample samples.text.Chars.isISOControl\n */"} {"signature":"public actual fun Char . isHighSurrogate ( ) : Boolean","body":"= this in Char . MIN_HIGH_SURROGATE .. Char . MAX_HIGH_SURROGATE","docstring":"/**\n * Returns `true` if this character is a Unicode high-surrogate code unit (also known as leading-surrogate code unit).\n */"} {"signature":"public actual fun Char . isLowSurrogate ( ) : Boolean","body":"= this in Char . MIN_LOW_SURROGATE .. Char . MAX_LOW_SURROGATE","docstring":"/**\n * Returns `true` if this character is a Unicode low-surrogate code unit (also known as trailing-surrogate code unit).\n */"} {"signature":"internal fun Char . Companion . toCodePoint ( high : Char , low : Char ) : Int","body":"= ( ( ( high - MIN_HIGH_SURROGATE ) shl ) or ( low - MIN_LOW_SURROGATE ) ) + ","docstring":"/** Converts a surrogate pair to a unicode code point. Doesn't validate that the characters are a valid surrogate pair. */"} {"signature":"internal fun Char . Companion . isSupplementaryCodePoint ( codepoint : Int ) : Boolean","body":"= codepoint in MIN_SUPPLEMENTARY_CODE_POINT .. MAX_CODE_POINT","docstring":"/** Checks if the codepoint specified is a supplementary codepoint or not. */"} {"signature":"@ Suppress ( \"\" ) internal fun Char . Companion . toChars ( codePoint : Int ) : CharArray","body":"= when { codePoint in until MIN_SUPPLEMENTARY_CODE_POINT -> charArrayOf ( codePoint . toChar ( ) ) codePoint in MIN_SUPPLEMENTARY_CODE_POINT .. MAX_CODE_POINT -> { val low = ( ( codePoint - ) and ) + MIN_LOW_SURROGATE . toInt ( ) val high = ( ( ( codePoint - ) ushr ) and ) + MIN_HIGH_SURROGATE . toInt ( ) charArrayOf ( high . toChar ( ) , low . toChar ( ) ) } else -> throw IllegalArgumentException ( ) }","docstring":"/**\n * Converts the codepoint specified to a char array. If the codepoint is not supplementary, the method will\n * return an array with one element otherwise it will return an array A with a high surrogate in A[0] and\n * a low surrogate in A[1].\n */"} {"signature":"infix fun BuildResult ? . shouldHaveRunTask ( taskPath : String ) : BuildTask","body":"{ this should haveTask ( taskPath ) return this ? . task ( taskPath ) ! ! }","docstring":"/** Assert that a task ran. */"} {"signature":"fun BuildResult ? . shouldHaveRunTask ( taskPath : String , expectedOutcome : TaskOutcome ) : BuildTask","body":"{ this should haveTask ( taskPath ) val task = this ? . task ( taskPath ) ! ! task should haveOutcome ( expectedOutcome ) return task }","docstring":"/** Assert that a task ran, with an [expected outcome][expectedOutcome]. */"} {"signature":"infix fun BuildResult ? . shouldNotHaveRunTask ( taskPath : String )","body":"{ this shouldNot haveTask ( taskPath ) }","docstring":"/**\n * Assert that a task did not run.\n *\n * A task might not have run if one of its dependencies failed before it could be run.\n */"} {"signature":"public fun put ( key : K , value : @ UnsafeVariance V ) : PersistentMap < K , V >","body":"public fun put ( key : K , value : @ UnsafeVariance V ) : PersistentMap < K , V >","docstring":"/**\n * Returns the result of associating the specified [value] with the specified [key] in this map.\n *\n * If this map already contains a mapping for the key, the old value is replaced by the specified value.\n *\n * @return a new persistent map with the specified [value] associated with the specified [key];\n * or this instance if no modifications were made in the result of this operation.\n */"} {"signature":"public fun remove ( key : K ) : PersistentMap < K , V >","body":"public fun remove ( key : K ) : PersistentMap < K , V >","docstring":"/**\n * Returns the result of removing the specified [key] and its corresponding value from this map.\n *\n * @return a new persistent map with the specified [key] and its corresponding value removed;\n * or this instance if it contains no mapping for the key.\n */"} {"signature":"public fun remove ( key : K , value : @ UnsafeVariance V ) : PersistentMap < K , V >","body":"public fun remove ( key : K , value : @ UnsafeVariance V ) : PersistentMap < K , V >","docstring":"/**\n * Returns the result of removing the entry that maps the specified [key] to the specified [value].\n *\n * @return a new persistent map with the entry for the specified [key] and [value] removed;\n * or this instance if it contains no entry with the specified key and value.\n */"} {"signature":"public fun putAll ( m : Map < out K , @ UnsafeVariance V > ) : PersistentMap < K , V >","body":"public fun putAll ( m : Map < out K , @ UnsafeVariance V > ) : PersistentMap < K , V >","docstring":"/**\n * Returns the result of merging the specified [m] map with this map.\n *\n * The effect of this call is equivalent to that of calling `put(k, v)` once for each\n * mapping from key `k` to value `v` in the specified map.\n *\n * @return a new persistent map with keys and values from the specified map [m] associated;\n * or this instance if no modifications were made in the result of this operation.\n */"} {"signature":"public fun clear ( ) : PersistentMap < K , V >","body":"public fun clear ( ) : PersistentMap < K , V >","docstring":"/**\n * Returns an empty persistent map.\n */"} {"signature":"public fun build ( ) : PersistentMap < K , V >","body":"public fun build ( ) : PersistentMap < K , V >","docstring":"/**\n * Returns a persistent map with the same contents as this builder.\n *\n * This method can be called multiple times.\n *\n * If operations applied on this builder have caused no modifications:\n * - on the first call it returns the same persistent map instance this builder was obtained from.\n * - on subsequent calls it returns the same previously returned persistent map instance.\n */"} {"signature":"public fun builder ( ) : Builder < K , @ UnsafeVariance V >","body":"public fun builder ( ) : Builder < K , @ UnsafeVariance V >","docstring":"/**\n * Returns a new builder with the same contents as this map.\n *\n * The builder can be used to efficiently perform multiple modification operations.\n */"} {"signature":"public inline fun < reified T : Number > Multik . rand ( dim0 : Int ) : D1Array < T >","body":"{ require ( dim0 > ) { \"\" } val dtype = DataType . ofKClass ( T :: class ) val frand : ( ) -> T = fRand ( dtype ) val data = initMemoryView ( dim0 , dtype ) { frand ( ) } return D1Array ( data , shape = intArrayOf ( dim0 ) , dim = D1 ) }","docstring":"/**\n * Returns a vector of the specified size filled with random numbers uniformly distributed for:\n * Int - [Int.MIN_VALUE, Int.MAX_VALUE)\n * Long - [Long.MIN_VALUE, Long.MAX_VALUE)\n * Float - [0f, 1f)\n * Double - [0.0, 1.0)\n */"} {"signature":"public inline fun < reified T : Number > Multik . rand ( dim0 : Int , dim1 : Int ) : D2Array < T >","body":"{ val dtype = DataType . ofKClass ( T :: class ) val shape = intArrayOf ( dim0 , dim1 ) for ( i in shape . indices ) { require ( shape [ i ] > ) { \"\" } } val frand : ( ) -> T = fRand ( dtype ) val data = initMemoryView ( dim0 * dim1 , dtype ) { frand ( ) } return D2Array ( data , shape = shape , dim = D2 ) }","docstring":"/**\n * Returns a matrix of the specified shape filled with random numbers uniformly distributed for:\n * Int - [Int.MIN_VALUE, Int.MAX_VALUE)\n * Long - [Long.MIN_VALUE, Long.MAX_VALUE)\n * Float - [0f, 1f)\n * Double - [0.0, 1.0)\n */"} {"signature":"public inline fun < reified T : Number > Multik . rand ( dim0 : Int , dim1 : Int , dim2 : Int ) : D3Array < T >","body":"{ val dtype = DataType . ofKClass ( T :: class ) val shape = intArrayOf ( dim0 , dim1 , dim2 ) for ( i in shape . indices ) { require ( shape [ i ] > ) { \"\" } } val frand : ( ) -> T = fRand ( dtype ) val data = initMemoryView ( dim0 * dim1 * dim2 , dtype ) { frand ( ) } return D3Array ( data , shape = shape , dim = D3 ) }","docstring":"/**\n * Returns an NDArray of the specified shape filled with random numbers uniformly distributed for:\n * Int - [Int.MIN_VALUE, Int.MAX_VALUE)\n * Long - [Long.MIN_VALUE, Long.MAX_VALUE)\n * Float - [0f, 1f)\n * Double - [0.0, 1.0)\n */"} {"signature":"public inline fun < reified T : Number > Multik . rand ( dim0 : Int , dim1 : Int , dim2 : Int , dim3 : Int ) : D4Array < T >","body":"{ val dtype = DataType . ofKClass ( T :: class ) val shape = intArrayOf ( dim0 , dim1 , dim2 , dim3 ) for ( i in shape . indices ) { require ( shape [ i ] > ) { \"\" } } val frand : ( ) -> T = fRand ( dtype ) val data = initMemoryView ( dim0 * dim1 * dim2 * dim3 , dtype ) { frand ( ) } return D4Array ( data , shape = shape , dim = D4 ) }","docstring":"/**\n * Returns an NDArray of the specified shape filled with random numbers uniformly distributed for:\n * Int - [Int.MIN_VALUE, Int.MAX_VALUE)\n * Long - [Long.MIN_VALUE, Long.MAX_VALUE)\n * Float - [0f, 1f)\n * Double - [0.0, 1.0)\n */"} {"signature":"public inline fun < reified T : Number > Multik . rand ( dim0 : Int , dim1 : Int , dim2 : Int , dim3 : Int , vararg dims : Int ) : NDArray < T , DN >","body":"{ return rand ( intArrayOf ( dim0 , dim1 , dim2 , dim3 , * dims ) ) }","docstring":"/**\n * Returns an NDArray of the specified shape filled with random numbers uniformly distributed for:\n * Int - [Int.MIN_VALUE, Int.MAX_VALUE)\n * Long - [Long.MIN_VALUE, Long.MAX_VALUE)\n * Float - [0f, 1f)\n * Double - [0.0, 1.0)\n */"} {"signature":"public inline fun < reified T : Number , reified D : Dimension > Multik . rand ( shape : IntArray ) : NDArray < T , D >","body":"{ val dtype = DataType . ofKClass ( T :: class ) val dim = dimensionClassOf < D > ( shape . size ) requireDimension ( dim , shape . size ) for ( i in shape . indices ) { require ( shape [ i ] > ) { \"\" } } val size = shape . fold ( , Int :: times ) val frand : ( ) -> T = fRand ( dtype ) val data = initMemoryView ( size , dtype ) { frand ( ) } return NDArray ( data , shape = shape , dim = dim ) }","docstring":"/**\n * Returns an NDArray of the specified shape filled with random numbers uniformly distributed for:\n * Int - [Int.MIN_VALUE, Int.MAX_VALUE)\n * Long - [Long.MIN_VALUE, Long.MAX_VALUE)\n * Float - [0f, 1f)\n * Double - [0.0, 1.0)\n */"} {"signature":"@ JvmName ( \"\" ) public inline fun < reified T : Number , reified D : Dimension > Multik . rand ( from : T , until : T , vararg dims : Int ) : NDArray < T , D >","body":"= Multik . rand ( from , until , dims )","docstring":"/**\n * Returns an NDArray of the specified shape filled with number uniformly distributed between [[from], [until])\n */"} {"signature":"@ JvmName ( \"\" ) public inline fun < reified T : Number , reified D : Dimension > Multik . rand ( from : T , until : T , dims : IntArray ) : NDArray < T , D >","body":"{ val dtype = DataType . ofKClass ( T :: class ) val dim = dimensionClassOf < D > ( dims . size ) requireDimension ( dim , dims . size ) for ( i in dims . indices ) { require ( dims [ i ] > ) { \"\" } } val size = dims . fold ( , Int :: times ) val data = randData ( from , until , size , dtype ) return NDArray ( data , shape = dims , dim = dim ) }","docstring":"/**\n * Returns an NDArray of the specified shape filled with number uniformly distributed between [[from], [until])\n *\n * Note: Float generation is inefficient.\n */"} {"signature":"@ JvmName ( \"\" ) public inline fun < reified T : Number , reified D : Dimension > Multik . rand ( seed : Int , from : T , until : T , vararg dims : Int ) : NDArray < T , D >","body":"= Multik . rand ( Random ( seed ) , from , until , dims )","docstring":"/**\n * Returns an NDArray of the specified shape filled with number uniformly distributed between [[from], [until])\n * with the specified [seed].\n *\n * Note: Float generation is inefficient.\n */"} {"signature":"@ JvmName ( \"\" ) public inline fun < reified T : Number , reified D : Dimension > Multik . rand ( seed : Int , from : T , until : T , dims : IntArray ) : NDArray < T , D >","body":"= Multik . rand ( Random ( seed ) , from , until , dims )","docstring":"/**\n * Returns an NDArray of the specified shape filled with number uniformly distributed between [[from], [until])\n * with the specified [seed].\n *\n * Note: Float generation is inefficient.\n */"} {"signature":"@ JvmName ( \"\" ) public inline fun < reified T : Number , reified D : Dimension > Multik . rand ( gen : Random , from : T , until : T , vararg dims : Int ) : NDArray < T , D >","body":"= Multik . rand ( gen , from , until , dims )","docstring":"/**\n * Returns an NDArray of the specified shape filled with number uniformly distributed between [[from], [until])\n * with the specified [gen].\n *\n * Note: Float generation is inefficient.\n */"} {"signature":"@ JvmName ( \"\" ) public inline fun < reified T : Number , reified D : Dimension > Multik . rand ( gen : Random , from : T , until : T , dims : IntArray ) : NDArray < T , D >","body":"{ val dtype = DataType . ofKClass ( T :: class ) val dim = dimensionClassOf < D > ( dims . size ) requireDimension ( dim , dims . size ) for ( i in dims . indices ) { require ( dims [ i ] > ) { \"\" } } val size = dims . fold ( , Int :: times ) val data = randData ( from , until , size , dtype , gen ) return NDArray ( data , shape = dims , dim = dim ) }","docstring":"/**\n * Returns an NDArray of the specified shape filled with number uniformly distributed between [[from], [until])\n * with the specified [gen].\n *\n * Note: Float generation is inefficient.\n */"} {"signature":"fun declaredSchemaOf ( type : Type ) : Scheme","body":"fun declaredSchemaOf ( type : Type ) : Scheme","docstring":"/**\n * Given a type, return the declared scheme for the type.\n */"} {"signature":"fun currentInferredSchemeOf ( type : Type ) : Scheme ?","body":"fun currentInferredSchemeOf ( type : Type ) : Scheme ?","docstring":"/**\n * Given a type, return the last updated scheme. This is used to reduce the number of times\n * that [updatedInferredScheme] is called. Returning `null` will prevent\n * [updatedInferredScheme] from being called at all (for example, from the front-end which\n * ignores updates). If not caching to prevent [updatedInferredScheme] from being called too\n * often, return [declaredSchemaOf] instead. This will then call [updatedInferredScheme]\n * whenever it is different from what was declared.\n */"} {"signature":"fun updatedInferredScheme ( type : Type , scheme : Scheme )","body":"fun updatedInferredScheme ( type : Type , scheme : Scheme )","docstring":"/**\n * Called when the inferencer determines\n */"} {"signature":"fun containerOf ( node : Node ) : Node","body":"fun containerOf ( node : Node ) : Node","docstring":"/**\n * Return the container of the node. A container is the function or lambda the node is part of.\n */"} {"signature":"fun kindOf ( node : Node ) : NodeKind","body":"fun kindOf ( node : Node ) : NodeKind","docstring":"/**\n * Return the kind of the node that allows the node to be treated correctly by the inferencer.\n */"} {"signature":"fun schemeParameterIndexOf ( node : Node , container : Node ) : Int","body":"fun schemeParameterIndexOf ( node : Node , container : Node ) : Int","docstring":"/**\n * Return which parameter index this parameter references. The [node] passed in will only be\n * one for [kindOf] returns [NodeKind.ParameterReference].\n *\n * For parameter nodes the inferencer needs to determine which parameter of the scheme of the\n * node is being referenced to allow the scheme determined for the usage of the parameter to\n * infer the scheme of the parameter.\n */"} {"signature":"fun typeOf ( node : Node ) : Type ?","body":"fun typeOf ( node : Node ) : Type ?","docstring":"/**\n * Return an instance of type where [Type] is the type passed to the [TypeAdapter] of the\n * inferencer.\n */"} {"signature":"fun referencedContainerOf ( node : Node ) : Node ?","body":"fun referencedContainerOf ( node : Node ) : Node ?","docstring":"/**\n * When [node] is the target of a call this should return the container (e.g. the function or\n * lambda) being called. Otherwise, return `null`.\n */"} {"signature":"fun getLazyScheme ( node : Node ) : LazyScheme ?","body":"fun getLazyScheme ( node : Node ) : LazyScheme ?","docstring":"/**\n * Retrieve a lazy scheme from the store (such as a mutableMapOf().\n */"} {"signature":"fun storeLazyScheme ( node : Node , value : LazyScheme )","body":"fun storeLazyScheme ( node : Node , value : LazyScheme )","docstring":"/**\n * Store the lazy scheme [value] for [node].\n */"} {"signature":"fun reportCallError ( node : Node , expected : String , received : String )","body":"fun reportCallError ( node : Node , expected : String , received : String )","docstring":"/**\n * Report a call node applier is not correct.\n */"} {"signature":"fun reportParameterError ( node : Node , index : Int , expected : String , received : String )","body":"fun reportParameterError ( node : Node , index : Int , expected : String , received : String )","docstring":"/**\n * Report that the value or lambda passed to a parameter to a call was not correct.\n */"} {"signature":"fun log ( node : Node ? , message : String )","body":"fun log ( node : Node ? , message : String )","docstring":"/**\n * Log internal errors detected that indicate problems in the inference algorithm or when the\n * adapters violate an internal constraint such as the schemes are not the same shape for the\n * target of a call.\n */"} {"signature":"private fun Bindings . unify ( call : Node ? , a : CallBindings , b : CallBindings ) : Boolean","body":"{ if ( ! unify ( a . target , b . target ) ) { if ( call != null ) { val aName = a . target . safeToken val bName = b . target . safeToken errorReporter . reportCallError ( call , aName , bName ) } return false } val count = if ( a . parameters . size != b . parameters . size ) { if ( call != null ) errorReporter . log ( call , \"\" ) if ( a . parameters . size > b . parameters . size ) b . parameters . size else a . parameters . size } else a . parameters . size for ( i in until count ) { val ap = a . parameters [ i ] val bp = b . parameters [ i ] if ( ! unify ( null , ap , bp ) ) { if ( call != null ) { val aToken = ap . target . token val bToken = bp . target . token if ( aToken != null && bToken != null ) { errorReporter . reportParameterError ( call , i , bp . target . token ! ! , ap . target . token ! ! ) } else unify ( call , ap , bp ) } } } val aResult = a . result val bResult = b . result if ( aResult != null && bResult != null ) { return unify ( null , aResult , bResult ) } return true }","docstring":"/**\n * Perform structural unification of two call bindings. All bindings that are in the same\n * structural place must unify or there is an error in the source. That is the targets are\n * unified and the parameter call bindings are unified recursively as well as the call\n * binding of the result. If [call] is `null` then the error is reported by the caller\n * instead. For example, failing to unify the parameters of a call binding should be\n * considered a failure to unify the entire binding not just the parameter.\n */"} {"signature":"private fun restartable ( node : Node , block : ( Bindings , Binding , ( Node ) -> CallBindings ? ) -> Unit ) : Boolean","body":"{ if ( node in inProgress ) return false inProgress . add ( node ) try { val container = nodeAdapter . containerOf ( node ) val containerLazyScheme = container . toLazyScheme ( ) val bindings = containerLazyScheme . bindings fun observed ( lazyScheme : LazyScheme ) : LazyScheme { if ( lazyScheme . bindings != bindings && ! lazyScheme . closed ) { var remove = { } val result : ( ) -> Unit = { if ( node !in inProgress ) { remove ( ) pending . add { restartable ( node , block ) } } } remove = lazyScheme . onChange ( result ) } return lazyScheme } fun schemeOf ( node : Node ) : Scheme = observed ( node . toLazyScheme ( ) ) . toScheme ( ) fun callBindingsOf ( node : Node ) : CallBindings ? { return when ( nodeAdapter . kindOf ( node ) ) { NodeKind . ParameterReference -> { val parameterContainer = nodeAdapter . containerOf ( node ) val parameterContainerLazyScheme = parameterContainer . toLazyScheme ( ) val parameterContainerScheme = nodeAdapter . schemeParameterIndexOf ( node , parameterContainer ) if ( parameterContainerScheme !in parameterContainerLazyScheme . parameters . indices ) { return null } parameterContainerLazyScheme . parameters [ parameterContainerScheme ] . toCallBindings ( ) } NodeKind . Lambda , NodeKind . Variable , NodeKind . Expression -> observed ( node . toLazyScheme ( bindings ) ) . toCallBindings ( ) NodeKind . Function -> { schemeOf ( node ) . toCallBindings ( bindings ) } } } block ( bindings , containerLazyScheme . target , :: callBindingsOf ) if ( pending . isNotEmpty ( ) ) { val skipped = mutableListOf < ( ) -> Boolean > ( ) while ( pending . isNotEmpty ( ) ) { val pendingCall = pending . removeAt ( pending . lastIndex ) if ( ! pendingCall ( ) ) skipped . add ( pendingCall ) } skipped . forEach { pending . add ( it ) } } } finally { inProgress . remove ( node ) } return true }","docstring":"/**\n * Restart [block] if a [LazyScheme] used to produce a [CallBindings] changes. This also\n * informs the [TypeAdapter] when the inferencer infers a refinement of the scheme for the type\n * of the container of [node].\n */"} {"signature":"fun visitVariable ( variable : Node , initializer : Node )","body":"= restartable ( variable ) { bindings , _ , callBindingsOf -> val initializerBinding = callBindingsOf ( initializer ) ? : return@restartable val variableBindings = callBindingsOf ( variable ) ? : return@restartable bindings . unify ( variable , variableBindings , initializerBinding ) }","docstring":"/**\n * Infer the scheme of the variable from the scheme of the initializer.\n */"} {"signature":"fun visitCall ( call : Node , target : Node , arguments : List < Node > )","body":"= restartable ( call ) { bindings , currentApplier , callBindingsOf -> val targetCallBindings = callBindingsOf ( target ) ? : run { errorReporter . log ( call , \"\" ) return@restartable } val parameters = arguments . map { callBindingsOf ( it ) } if ( parameters . any { it == null } ) { errorReporter . log ( call , \"\" ) return@restartable } val result = if ( targetCallBindings . result != null ) { callBindingsOf ( call ) } else null val callBinding = CallBindings ( currentApplier , parameters = parameters . filterNotNull ( ) , result , anyParameters = false ) bindings . unify ( call , callBinding , targetCallBindings ) if ( callBinding . parameters . size == arguments . size ) { arguments . forEachIndexed { index , argument -> if ( nodeAdapter . kindOf ( argument ) == NodeKind . Lambda ) { val parameter = callBinding . parameters [ index ] val lambdaTarget = parameter . target if ( lambdaTarget . token == null ) { bindings . unify ( lambdaTarget , currentApplier ) } } } } for ( ( parameterBinding , argument ) in callBinding . parameters . zip ( arguments ) ) { if ( nodeAdapter . kindOf ( argument ) == NodeKind . Lambda && parameterBinding . target . token != null ) { val lambdaScheme = argument . toLazyScheme ( ) if ( lambdaScheme . target . token == null ) { lambdaScheme . bindings . unify ( lambdaScheme . target , parameterBinding . target ) } } } }","docstring":"/**\n * Infer the scheme of the container the target and the arguments of the call. This also infers\n * a scheme for the call when it is used as an argument or variable initializer.\n */"} {"signature":"fun toFinalScheme ( node : Node )","body":"= node . toLazyScheme ( ) . toScheme ( )","docstring":"/**\n * For testing, produce the scheme inferred or the scheme from the declaration.\n */"} {"signature":"protected open fun isTargetDeclaration ( declaration : IrDeclaration ) : Boolean","body":"= declaration . isExpect","docstring":"/**\n * [isTargetDeclaration] can be overridden to customize if an element referring to [declaration] should be transformed. This check\n * precedes [getActualClass], [getActualProperty], and so on.\n */"} {"signature":"@ Test fun testAwaitCancellation ( )","body":"= runTest { expect ( ) val completable = CompletableSource { s -> s . onSubscribe ( object : Disposable { override fun dispose ( ) { expect ( ) } override fun isDisposed ( ) : Boolean { expectUnreached ( ) ; return false } } ) } val job = launch ( start = CoroutineStart . UNDISPATCHED ) { try { expect ( ) completable . await ( ) } catch ( e : CancellationException ) { expect ( ) throw e } } expect ( ) job . cancelAndJoin ( ) finish ( ) }","docstring":"/** Tests that calls to [await] throw [CancellationException] and dispose of the subscription when their [Job] is\n * cancelled. */"} {"signature":"private fun batchNorm ( tf : Ops , x : Operand < Float > , gamma : Variable < Float > ? , beta : Operand < Float > ? , movingMean : Operand < Float > , movingVar : Operand < Float > , eps : Operand < Float > , ) : Operand < Float >","body":"{ var inv : Operand < Float > = tf . math . rsqrt ( tf . math . add ( movingVar , eps ) ) if ( scale ) inv = tf . math . mul ( inv , gamma ) val xNorm = tf . math . mul ( tf . math . sub ( x , movingMean ) , inv ) return if ( center ) tf . math . add ( xNorm , beta ) else xNorm }","docstring":"/**\n * ```\n * def batch_norm(X, gamma, beta, moving_mean, moving_var, eps):\n * # Compute reciprocal of square root of the moving variance element-wise\n * inv = tf.cast(tf.math.rsqrt(moving_var + eps), X.dtype)\n * # Scale and shift\n * inv *= gamma\n * Y = X * inv + (beta - moving_mean * inv)\n * return Y\n * ```\n */"} {"signature":"public actual fun < T > MutableList < T > . reverse ( ) : Unit","body":"{ val midPoint = ( size / ) - if ( midPoint < ) return var reverseIndex = lastIndex for ( index in .. midPoint ) { val tmp = this [ index ] this [ index ] = this [ reverseIndex ] this [ reverseIndex ] = tmp reverseIndex -- } }","docstring":"/**\n * Reverses elements in the list in-place.\n */"} {"signature":"@ ParameterizedTest ( name = \"\" ) @ ArgumentsSource ( LatestTestedVersionsArgumentsProvider :: class ) fun `should fail with DokkaException and readable message if failOnWarning is triggered` ( buildVersions : BuildVersions )","body":"{ val result = createGradleRunner ( buildVersions , \"\" , \"\" , \"\" , \"\" , \"\" ) . buildAndFail ( ) assertEquals ( TaskOutcome . FAILED , assertNotNull ( result . task ( \"\" ) ) . outcome ) result . output . contains ( \"\" ) result . output . contains ( \"\"\"\"\"\" . trimIndent ( ) . toRegex ( ) ) result . output . contains ( \"\" . toRegex ( ) ) }","docstring":"/**\n * The test project contains some undocumented declarations, so if both `reportUndocumented`\n * and `failOnWarning` are enabled - it should fail\n */"} {"signature":"internal fun < S : Segment < S > > S . findSegmentInternal ( id : Long , createNewSegment : ( id : Long , prev : S ) -> S ) : SegmentOrClosed < S >","body":"{ var cur : S = this while ( cur . id < id || cur . isRemoved ) { val next = cur . nextOrIfClosed { return SegmentOrClosed ( CLOSED ) } if ( next != null ) { cur = next continue } val newTail = createNewSegment ( cur . id + , cur ) if ( cur . trySetNext ( newTail ) ) { if ( cur . isRemoved ) cur . remove ( ) cur = newTail } } return SegmentOrClosed ( cur ) }","docstring":"/**\n * Returns the first segment `s` with `s.id >= id` or `CLOSED`\n * if all the segments in this linked list have lower `id`, and the list is closed for further segment additions.\n */"} {"signature":"@ Suppress ( \"\" , \"\" ) internal inline fun < S : Segment < S > > AtomicRef < S > . moveForward ( to : S ) : Boolean","body":"= loop { cur -> if ( cur . id >= to . id ) return true if ( ! to . tryIncPointers ( ) ) return false if ( compareAndSet ( cur , to ) ) { if ( cur . decPointers ( ) ) cur . remove ( ) return true } if ( to . decPointers ( ) ) to . remove ( ) }","docstring":"/**\n * Returns `false` if the segment `to` is logically removed, `true` on a successful update.\n */"} {"signature":"@ Suppress ( \"\" ) internal inline fun < S : Segment < S > > AtomicRef < S > . findSegmentAndMoveForward ( id : Long , startFrom : S , noinline createNewSegment : ( id : Long , prev : S ) -> S ) : SegmentOrClosed < S >","body":"{ while ( true ) { val s = startFrom . findSegmentInternal ( id , createNewSegment ) if ( s . isClosed || moveForward ( s . segment ) ) return s } }","docstring":"/**\n * Tries to find a segment with the specified [id] following by next references from the\n * [startFrom] segment and creating new ones if needed. The typical use-case is reading this `AtomicRef` values,\n * doing some synchronization, and invoking this function to find the required segment and update the pointer.\n * At the same time, [Segment.cleanPrev] should also be invoked if the previous segments are no longer needed\n * (e.g., queues should use it in dequeue operations).\n *\n * Since segments can be removed from the list, or it can be closed for further segment additions.\n * Returns the segment `s` with `s.id >= id` or `CLOSED` if all the segments in this linked list have lower `id`,\n * and the list is closed.\n */"} {"signature":"internal fun < N : ConcurrentLinkedListNode < N > > N . close ( ) : N","body":"{ var cur : N = this while ( true ) { val next = cur . nextOrIfClosed { return cur } if ( next === null ) { if ( cur . markAsClosed ( ) ) return cur } else { cur = next } } }","docstring":"/**\n * Closes this linked list of nodes by forbidding adding new ones,\n * returns the last node in the list.\n */"} {"signature":"@ Suppress ( \"\" ) inline fun nextOrIfClosed ( onClosedAction : ( ) -> Nothing ) : N ?","body":"= nextOrClosed . let { if ( it === CLOSED ) { onClosedAction ( ) } else { it as N ? } }","docstring":"/**\n * Returns the next segment or `null` of the one does not exist,\n * and invokes [onClosedAction] if this segment is marked as closed.\n */"} {"signature":"fun trySetNext ( value : N ) : Boolean","body":"= _next . compareAndSet ( null , value )","docstring":"/**\n * Tries to set the next segment if it is not specified and this segment is not marked as closed.\n */"} {"signature":"fun cleanPrev ( )","body":"{ _prev . lazySet ( null ) }","docstring":"/**\n * Cleans the pointer to the previous node.\n */"} {"signature":"fun markAsClosed ( )","body":"= _next . compareAndSet ( null , CLOSED )","docstring":"/**\n * Tries to mark the linked list as closed by forbidding adding new nodes after this one.\n */"} {"signature":"fun remove ( )","body":"{ assert { isRemoved || isTail } if ( isTail ) return while ( true ) { val prev = aliveSegmentLeft val next = aliveSegmentRight next . _prev . update { if ( it === null ) null else prev } if ( prev !== null ) prev . _next . value = next if ( next . isRemoved && ! next . isTail ) continue if ( prev !== null && prev . isRemoved ) continue return } }","docstring":"/**\n * Removes this node physically from this linked list. The node should be\n * logically removed (so [isRemoved] returns `true`) at the point of invocation.\n */"} {"signature":"abstract fun onCancellation ( index : Int , cause : Throwable ? , context : CoroutineContext )","body":"abstract fun onCancellation ( index : Int , cause : Throwable ? , context : CoroutineContext )","docstring":"/**\n * This function is invoked on continuation cancellation when this segment\n * with the specified [index] are installed as cancellation handler via\n * `SegmentDisposable.disposeOnCancellation(Segment, Int)`.\n *\n * @param index the index under which the sement registered itself in the continuation.\n * Indicies are opaque and arithmetics or numeric intepretation is not allowed on them,\n * as they may encode additional metadata.\n * @param cause the cause of the cancellation, with the same semantics as [CancellableContinuation.invokeOnCancellation]\n * @param context the context of the cancellable continuation the segment was registered in\n */"} {"signature":"fun onSlotCleaned ( )","body":"{ if ( cleanedAndPointers . incrementAndGet ( ) == numberOfSlots ) remove ( ) }","docstring":"/**\n * Invoked on each slot clean-up; should not be invoked twice for the same slot.\n */"} {"signature":"fun loadCache ( )","body":"fun loadCache ( )","docstring":"/** Push the cache object onto the stack. */"} {"signature":"fun initCache ( )","body":"fun initCache ( )","docstring":"/** Init cache field. */"} {"signature":"fun clearCache ( )","body":"fun clearCache ( )","docstring":"/** Clear cache. The cache storage should be on the stack. */"} {"signature":"fun getViewFromCache ( )","body":"fun getViewFromCache ( )","docstring":"/** Push the cached view onto the stack, or push `null` if the view is not cached. `Int` id should be on the stack. */"} {"signature":"fun putViewToCache ( getView : ( ) -> Unit )","body":"fun putViewToCache ( getView : ( ) -> Unit )","docstring":"/** Cache the view. `Int` id should be on the stack. */"} {"signature":"fun dependencies ( configure : KotlinDependencyHandler . ( ) -> Unit )","body":"fun dependencies ( configure : KotlinDependencyHandler . ( ) -> Unit )","docstring":"/**\n * Configures all dependencies for this entity.\n */"} {"signature":"fun dependencies ( configure : Action < KotlinDependencyHandler > )","body":"fun dependencies ( configure : Action < KotlinDependencyHandler > )","docstring":"/**\n * Configures all dependencies for this entity.\n */"} {"signature":"@ Deprecated ( message = \"\" , level = DeprecationLevel . ERROR ) fun warnNpmGenerateExternals ( logger : Logger )","body":"{ logger . warn ( \"\"\"\"\"\" . trimMargin ( ) ) }","docstring":"/**\n * @suppress\n */"} {"signature":"fun test ( )","body":"{ }","docstring":"/**\n * This is an example of html\n */"} {"signature":"fun testP ( )","body":"{ }","docstring":"/**\n * This is an documentation \n */"} {"signature":"private fun checkImpl ( candidate : Candidate , sink : CheckerSink , context : ResolutionContext , dslMarkersProvider : ( ) -> Set < ClassId > , isImplicitReceiverMatching : ( ImplicitReceiverValue < * > ) -> Boolean , )","body":"{ val resolvedReceiverIndex = context . bodyResolveContext . implicitReceiverStack . indexOfFirst { isImplicitReceiverMatching ( it ) } if ( resolvedReceiverIndex == - ) return val closerReceivers = context . bodyResolveContext . implicitReceiverStack . drop ( resolvedReceiverIndex + ) if ( closerReceivers . isEmpty ( ) ) return val dslMarkers = dslMarkersProvider ( ) if ( dslMarkers . isEmpty ( ) ) return if ( closerReceivers . any { receiver -> receiver . getDslMarkersOfImplicitReceiver ( context ) . any { it in dslMarkers } } ) { sink . reportDiagnostic ( DslScopeViolation ( candidate . symbol ) ) } }","docstring":"/**\n * Checks whether the implicit receiver (represented as an object of type `T`) violates DSL scope rules.\n */"} {"signature":"internal fun AbstractNativeSimpleTest . generateTestCaseWithSingleModule ( sourcesRoot : File ? , freeCompilerArgs : TestCompilerArgs = TestCompilerArgs . EMPTY , extras : TestCase . Extras = TestCase . WithTestRunnerExtras ( TestRunnerType . DEFAULT ) , ) : TestCase","body":"{ val moduleName : String = sourcesRoot ? . name ? . removeSuffix ( \"\" ) ? : LAUNCHER_MODULE_NAME val module = TestModule . Exclusive ( moduleName , emptySet ( ) , emptySet ( ) , emptySet ( ) ) sourcesRoot ? . walkTopDown ( ) ? . filter { it . isFile && it . extension == \"\" } ? . forEach { file -> module . files += TestFile . createCommitted ( file , module ) } return TestCase ( id = TestCaseId . Named ( moduleName ) , kind = TestKind . STANDALONE , modules = setOf ( module ) , freeCompilerArgs = freeCompilerArgs , nominalPackageName = PackageName . EMPTY , checks = TestRunChecks . Default ( testRunSettings . get < Timeouts > ( ) . executionTimeout ) , extras = extras ) . apply { initialize ( null , null ) } }","docstring":"/**\n * [sourcesRoot] points either to a .kt-file, or a folder.\n *\n * If it's present, then it's name (without .kt-extension, if it's a file) will be used as 'moduleName' for generated module.\n */"} {"signature":"private fun makePropertiesFilesReproducible ( )","body":"{ workDirectory . get ( ) . asFile . walk ( ) . filter { it . isFile && it . extension == \"\" } . forEach { file -> logger . info ( \"\" ) val comments = file . readLines ( ) . takeWhile { it . startsWith ( '' ) } . dropLast ( ) val properties = file . readLines ( ) . dropWhile { it . startsWith ( '' ) } val updatedProperties = ( comments + properties ) . joinToString ( \"\" ) file . writeText ( updatedProperties ) } }","docstring":"/**\n * Remove non-reproducible timestamps from any generated [Properties] files.\n */"} {"signature":"fun process ( host : KotlinKernelHost ) : FieldValue ?","body":"fun process ( host : KotlinKernelHost ) : FieldValue ?","docstring":"/**\n * Processes local variables and generates code snippets that perform type conversions\n */"} {"signature":"public operator fun get ( index : Int ) : T","body":"public operator fun get ( index : Int ) : T","docstring":"/**\n * Gets the row at given [index].\n *\n * NOTE: This doesn't work in the [ColumnsSelectionDsl], use [ColumnsSelectionDsl.col] to select a column by index.\n */"} {"signature":"public operator fun get ( firstIndex : Int , vararg otherIndices : Int ) : BaseColumn < T >","body":"= get ( headPlusIterable ( firstIndex , otherIndices . asIterable ( ) ) )","docstring":"/**\n * Gets the rows at given indices.\n *\n * NOTE: This doesn't work in the [ColumnsSelectionDsl], use [ColumnsSelectionDsl.cols] to select columns by index.\n */"} {"signature":"public operator fun get ( range : IntRange ) : BaseColumn < T >","body":"public operator fun get ( range : IntRange ) : BaseColumn < T >","docstring":"/**\n * Gets the rows at given range of indices.\n *\n * NOTE: This doesn't work in the [ColumnsSelectionDsl], use [ColumnsSelectionDsl.cols] to select columns by range.\n */"} {"signature":"public operator fun get ( indices : Iterable < Int > ) : BaseColumn < T >","body":"public operator fun get ( indices : Iterable < Int > ) : BaseColumn < T >","docstring":"/**\n * Gets the rows at given indices.\n *\n * NOTE: This doesn't work in the [ColumnsSelectionDsl], use [ColumnsSelectionDsl.cols] to select columns by index.\n */"} {"signature":"public fun customFormat ( layerNameColumnName : String = \"\" , outputShapeColumnName : String = \"\" , paramsCountColumnName : String = \"\" , connectedToColumnName : String = \"\" , columnSeparator : String = \"\" , lineSeparatorSymbol : Char = '' , thickLineSeparatorSymbol : Char = '' , withConnectionsColumn : Boolean = layersSummaries . any { it . inboundLayers . size > } ) : List < String >","body":"{ val headerRows = mutableListOf ( \"\" ) name ? . let { headerRows . add ( \"\" ) } val header = SimpleSection ( headerRows ) val rows = layersSummaries . map { layer -> val cells = mutableListOf ( Cell ( \"\" ) , Cell ( layer . outputShape . toString ( ) ) , Cell ( layer . paramsCount . toString ( ) ) ) if ( withConnectionsColumn ) { cells . add ( Cell ( layer . inboundLayers ) ) } TableRow ( cells ) } val columnNames = if ( withConnectionsColumn ) { listOf ( layerNameColumnName , outputShapeColumnName , paramsCountColumnName , connectedToColumnName ) } else { listOf ( layerNameColumnName , outputShapeColumnName , paramsCountColumnName ) } val mainSection = SectionWithColumns ( rows , columnNames ) val footer = SimpleSection ( listOf ( \"\" , \"\" , \"\" ) ) return formatTable ( listOf ( header , mainSection , footer ) , columnSeparator , lineSeparatorSymbol , thickLineSeparatorSymbol ) }","docstring":"/**\n * Formats model summary\n * @param [layerNameColumnName] title of the column with layer names\n * @param [outputShapeColumnName] title of the column with layer output shapes\n * @param [paramsCountColumnName] title of the column with layer parameter counts\n * @param [connectedToColumnName] title of the column with layers that are inputs for a layer\n * @param [columnSeparator] text chunk that will be used as column separator for the layer description table\n * @param [lineSeparatorSymbol] character that will be used to produce a string to separate rows of the layer description table\n * @param [thickLineSeparatorSymbol] character that will be used to produce a string to separate general model description,\n * header and body of the table with layers description, and description footer\n * @param [withConnectionsColumn] flag that turns on/off displaying of the column with names of inbound layers\n * @return description of model summary as list of strings, which are suitable for printing or logging\n */"} {"signature":"fun jvmToolchain ( action : Action < JavaToolchainSpec > )","body":"{ toolchainSupport . applyToolchain ( action ) }","docstring":"/**\n * Configures [Java toolchain](https://docs.gradle.org/current/userguide/toolchains.html) both for Kotlin JVM and Java tasks.\n *\n * @param action - action to configure [JavaToolchainSpec]\n */"} {"signature":"fun jvmToolchain ( jdkVersion : Int )","body":"{ jvmToolchain { it . languageVersion . set ( JavaLanguageVersion . of ( jdkVersion ) ) } }","docstring":"/**\n * Configures [Java toolchain](https://docs.gradle.org/current/userguide/toolchains.html) both for Kotlin JVM and Java tasks.\n *\n * @param jdkVersion - jdk version as number. For example, 17 for Java 17.\n */"} {"signature":"@ ExperimentalKotlinGradlePluginApi fun < T : Named > NamedDomainObjectContainer < T > . invokeWhenCreated ( name : String , configure : T . ( ) -> Unit )","body":"{ configureEach { if ( it . name == name ) it . configure ( ) } project . launchInStage ( KotlinPluginLifecycle . Stage . ReadyForExecution ) { if ( name !in names ) { named ( name ) . configure ( configure ) } } }","docstring":"/**\n * Can be used to configure objects that are not yet created, or will be created in\n * 'afterEvaluate' (e.g. typically Android source sets containing flavors and buildTypes)\n *\n * Will fail project evaluation if the domain object is not created before 'afterEvaluate' listeners in the buildscript.\n *\n * @param configure: Called inline, if the value is already present. Called once the domain object is created.\n */"} {"signature":"public fun < T > encodeToByteArray ( serializer : SerializationStrategy < T > , value : T ) : ByteArray","body":"public fun < T > encodeToByteArray ( serializer : SerializationStrategy < T > , value : T ) : ByteArray","docstring":"/**\n * Serializes and encodes the given [value] to byte array using the given [serializer].\n *\n * @throws SerializationException in case of any encoding-specific error\n * @throws IllegalArgumentException if the encoded input does not comply format's specification\n */"} {"signature":"public fun < T > decodeFromByteArray ( deserializer : DeserializationStrategy < T > , bytes : ByteArray ) : T","body":"public fun < T > decodeFromByteArray ( deserializer : DeserializationStrategy < T > , bytes : ByteArray ) : T","docstring":"/**\n * Decodes and deserializes the given [byte array][bytes] to the value of type [T] using the given [deserializer].\n *\n * @throws SerializationException in case of any decoding-specific error\n * @throws IllegalArgumentException if the decoded input is not a valid instance of [T]\n */"} {"signature":"public fun < T > encodeToString ( serializer : SerializationStrategy < T > , value : T ) : String","body":"public fun < T > encodeToString ( serializer : SerializationStrategy < T > , value : T ) : String","docstring":"/**\n * Serializes and encodes the given [value] to string using the given [serializer].\n *\n * @throws SerializationException in case of any encoding-specific error\n * @throws IllegalArgumentException if the encoded input does not comply format's specification\n */"} {"signature":"public fun < T > decodeFromString ( deserializer : DeserializationStrategy < T > , string : String ) : T","body":"public fun < T > decodeFromString ( deserializer : DeserializationStrategy < T > , string : String ) : T","docstring":"/**\n * Decodes and deserializes the given [string] to the value of type [T] using the given [deserializer].\n *\n * @throws SerializationException in case of any decoding-specific error\n * @throws IllegalArgumentException if the decoded input is not a valid instance of [T]\n */"} {"signature":"public inline fun < reified T > StringFormat . encodeToString ( value : T ) : String","body":"= encodeToString ( serializersModule . serializer ( ) , value )","docstring":"/**\n * Serializes and encodes the given [value] to string using serializer retrieved from the reified type parameter.\n *\n * @throws SerializationException in case of any encoding-specific error\n * @throws IllegalArgumentException if the encoded input does not comply format's specification\n */"} {"signature":"public inline fun < reified T > StringFormat . decodeFromString ( string : String ) : T","body":"= decodeFromString ( serializersModule . serializer ( ) , string )","docstring":"/**\n * Decodes and deserializes the given [string] to the value of type [T] using deserializer\n * retrieved from the reified type parameter.\n *\n * @throws SerializationException in case of any decoding-specific error\n * @throws IllegalArgumentException if the decoded input is not a valid instance of [T]\n */"} {"signature":"public fun < T > BinaryFormat . encodeToHexString ( serializer : SerializationStrategy < T > , value : T ) : String","body":"= InternalHexConverter . printHexBinary ( encodeToByteArray ( serializer , value ) , lowerCase = true )","docstring":"/**\n * Serializes and encodes the given [value] to byte array, delegating it to the [BinaryFormat],\n * and then encodes resulting bytes to hex string.\n *\n * Hex representation does not interfere with serialization and encoding process of the format and\n * only applies transformation to the resulting array. It is recommended to use for debugging and\n * testing purposes.\n *\n * @throws SerializationException in case of any encoding-specific error\n * @throws IllegalArgumentException if the encoded input does not comply format's specification\n */"} {"signature":"public fun < T > BinaryFormat . decodeFromHexString ( deserializer : DeserializationStrategy < T > , hex : String ) : T","body":"= decodeFromByteArray ( deserializer , InternalHexConverter . parseHexBinary ( hex ) )","docstring":"/**\n * Decodes byte array from the given [hex] string and the decodes and deserializes it\n * to the value of type [T], delegating it to the [BinaryFormat].\n *\n * This method is a counterpart to [encodeToHexString].\n *\n * @throws SerializationException in case of any decoding-specific error\n * @throws IllegalArgumentException if the decoded input is not a valid instance of [T]\n */"} {"signature":"public inline fun < reified T > BinaryFormat . encodeToHexString ( value : T ) : String","body":"= encodeToHexString ( serializersModule . serializer ( ) , value )","docstring":"/**\n * Serializes and encodes the given [value] to byte array, delegating it to the [BinaryFormat],\n * and then encodes resulting bytes to hex string.\n *\n * Hex representation does not interfere with serialization and encoding process of the format and\n * only applies transformation to the resulting array. It is recommended to use for debugging and\n * testing purposes.\n *\n * @throws SerializationException in case of any encoding-specific error\n * @throws IllegalArgumentException if the encoded input does not comply format's specification\n */"} {"signature":"public inline fun < reified T > BinaryFormat . decodeFromHexString ( hex : String ) : T","body":"= decodeFromHexString ( serializersModule . serializer ( ) , hex )","docstring":"/**\n * Decodes byte array from the given [hex] string and the decodes and deserializes it\n * to the value of type [T], delegating it to the [BinaryFormat].\n *\n * This method is a counterpart to [encodeToHexString].\n *\n * @throws SerializationException in case of any decoding-specific error\n * @throws IllegalArgumentException if the decoded input is not a valid instance of [T]\n */"} {"signature":"public inline fun < reified T > BinaryFormat . encodeToByteArray ( value : T ) : ByteArray","body":"= encodeToByteArray ( serializersModule . serializer ( ) , value )","docstring":"/**\n * Serializes and encodes the given [value] to byte array using serializer\n * retrieved from the reified type parameter.\n *\n * @throws SerializationException in case of any encoding-specific error\n * @throws IllegalArgumentException if the encoded input does not comply format's specification\n */"} {"signature":"public inline fun < reified T > BinaryFormat . decodeFromByteArray ( bytes : ByteArray ) : T","body":"= decodeFromByteArray ( serializersModule . serializer ( ) , bytes )","docstring":"/**\n * Decodes and deserializes the given [byte array][bytes] to the value of type [T] using deserializer\n * retrieved from the reified type parameter.\n *\n * @throws SerializationException in case of any decoding-specific error\n * @throws IllegalArgumentException if the decoded input is not a valid instance of [T]\n */"} {"signature":"fun isEnabled ( phase : AnyNamedPhase ) : Boolean","body":"fun isEnabled ( phase : AnyNamedPhase ) : Boolean","docstring":"/**\n * Check if the given [phase] should be executed during compilation.\n */"} {"signature":"fun isVerbose ( phase : AnyNamedPhase ) : Boolean","body":"fun isVerbose ( phase : AnyNamedPhase ) : Boolean","docstring":"/**\n * Check if the compiler should print additional information\n * during [phase] execution.\n */"} {"signature":"fun disable ( phase : AnyNamedPhase )","body":"fun disable ( phase : AnyNamedPhase )","docstring":"/**\n * Prevent compiler from executing the given [phase].\n */"} {"signature":"fun shouldDumpStateBefore ( phase : AnyNamedPhase ) : Boolean","body":"fun shouldDumpStateBefore ( phase : AnyNamedPhase ) : Boolean","docstring":"/**\n * Check if compiler should dump its state right before\n * the execution of the given [phase].\n */"} {"signature":"fun shouldDumpStateAfter ( phase : AnyNamedPhase ) : Boolean","body":"fun shouldDumpStateAfter ( phase : AnyNamedPhase ) : Boolean","docstring":"/**\n * Check if compiler should dump its state right after\n * the execution of the given [phase].\n */"} {"signature":"fun shouldValidateStateBefore ( phase : AnyNamedPhase ) : Boolean","body":"fun shouldValidateStateBefore ( phase : AnyNamedPhase ) : Boolean","docstring":"/**\n * Check if compiler should validate its state right before\n * the execution of the given [phase].\n */"} {"signature":"fun shouldValidateStateAfter ( phase : AnyNamedPhase ) : Boolean","body":"fun shouldValidateStateAfter ( phase : AnyNamedPhase ) : Boolean","docstring":"/**\n * Check if compiler should validate its state right after\n * the execution of the given [phase].\n */"} {"signature":"abstract fun add ( other : @ UnsafeVariance T ? ) : T ?","body":"abstract fun add ( other : @ UnsafeVariance T ? ) : T ?","docstring":"/**\n * This function is used to decide how multiple attributes should be united in presence of typealiases:\n * typealias B = @SomeAttribute(1) A\n * typealias C = @SomeAttribute(2) B\n *\n * For determining attribute value of expanded type of C we should add @SomeAttribute(2) to @SomeAttribute(1)\n *\n * This function must be symmetrical: a.add(b) == b.add(a)\n */"} {"signature":"infix fun definitelyDifferFrom ( other : ConeAttributes ) : Boolean","body":"{ if ( this === other ) return false if ( this . isEmpty ( ) && other . isEmpty ( ) ) return false for ( index in indices ) { val a = arrayMap [ index ] val b = other . arrayMap [ index ] if ( a == null && b == null ) continue if ( ( a == null ) != ( b == null ) ) return true if ( a ! ! . implementsEquality && a != b ) return true } return false }","docstring":"/**\n * Returns `true` if this instance is definitely not equal to the [other] instance.\n * This is `true` when one instance contains an attribute **type** that the other doesn't contain or both instances contain\n * an attribute of a type where [ConeAttribute.implementsEquality]` == true` and the attribute's [equals] method returns `false`.\n *\n * A return value of `false` doesn't guarantee that the instances are equal because [ConeAttribute.implementsEquality] is optional,\n * i.e., not all attributes can be compared structurally.\n *\n * @see org.jetbrains.kotlin.fir.types.impl.ConeClassLikeTypeImpl.equals\n */"} {"signature":"inline fun transformTypesWith ( transform : ( ConeKotlinType ) -> ConeKotlinType ? ) : ConeAttributes ?","body":"{ if ( isEmpty ( ) ) return null var newList : MutableList < ConeAttribute < * > > ? = null var hasDifference = false for ( ( i , attr ) in this . withIndex ( ) ) { if ( attr !is ConeAttributeWithConeType ) continue val substitutedAttribute = attr . transformOrNull ( transform ) ? : continue if ( newList == null ) { newList = this . toMutableList ( ) } newList [ i ] = substitutedAttribute hasDifference = hasDifference || substitutedAttribute != attr } if ( newList != null && ! hasDifference ) { return this } return newList ? . let ( Companion :: create ) }","docstring":"/**\n * Applies the [transform] to all attributes that are subtypes of [ConeAttributeWithConeType] and returns a [ConeAttributes]\n * with the results of transforms that were not-`null` or `null` if no attributes were transformed.\n */"} {"signature":"fun isKotlinInternalCompiledFile ( file : VirtualFile , fileContent : ByteArray ? = null ) : Boolean","body":"{ if ( ! file . isValidAndExists ( fileContent ) ) { return false } val clsKotlinBinaryClassCache = ClsKotlinBinaryClassCache . getInstance ( ) if ( ! clsKotlinBinaryClassCache . isKotlinJvmCompiledFile ( file , fileContent ) ) { return false } val innerClass = try { if ( fileContent == null ) { ClassFileViewProvider . isInnerClass ( file ) } else { ClassFileViewProvider . isInnerClass ( file , fileContent ) } } catch ( exception : Exception ) { Logger . getInstance ( \"\" ) . debug ( file . path , exception ) return false } if ( innerClass ) { return true } val header = clsKotlinBinaryClassCache . getKotlinBinaryClassHeaderData ( file , fileContent ) ? : return false if ( header . classId . isLocal ) return true return header . kind == KotlinClassHeader . Kind . SYNTHETIC_CLASS || header . kind == KotlinClassHeader . Kind . MULTIFILE_CLASS_PART }","docstring":"/**\n * Checks if this file is a compiled \"internal\" Kotlin class, i.e. a Kotlin class (not necessarily ABI-compatible with the current plugin)\n * which should NOT be decompiled (and, as a result, shown under the library in the Project view, be searchable via Find class, etc.)\n */"} {"signature":"@ Test fun createZeroFilledByteArray ( )","body":"{ val dim1 = val dim2 = val a = mk . zeros < Byte > ( dim1 , dim2 ) assertEquals ( dim1 * dim2 , a . size ) assertEquals ( dim1 * dim2 , a . data . size ) assertTrue { a . all { it == . toByte ( ) } } }","docstring":"/**\n * This method checks if a byte array of a given size is correctly created with all elements set to zero.\n */"} {"signature":"@ Test fun createByteArrayFilledWithOnes ( )","body":"{ val dim1 = val dim2 = val a = mk . ones < Byte > ( dim1 , dim2 ) assertEquals ( dim1 * dim2 , a . size ) assertEquals ( dim1 * dim2 , a . data . size ) assertTrue { a . all { it == . toByte ( ) } } }","docstring":"/**\n * Creates a byte array filled with ones of a given size and checks if all elements are set to one.\n */"} {"signature":"@ Test fun createIdentityByteMatrix ( )","body":"{ val n = val a = mk . identity < Byte > ( n ) assertEquals ( n * n , a . size ) for ( i in until n ) { for ( j in until n ) { if ( i == j ) assertEquals ( , a [ i , j ] , \"\" ) else assertEquals ( , a [ i , j ] , \"\" ) } } }","docstring":"/**\n * Tests the function 'mk.identity(n)' that creates an identity matrix of size n x n.\n * The test asserts that:\n * - The size of the resulting matrix matches n*n.\n * - The diagonal elements of the matrix are 1 and the non-diagonal elements are 0.\n */"} {"signature":"@ Test fun createTwoDimensionalArrayFromByteList ( )","body":"{ val list = listOf ( listOf < Byte > ( , , ) , listOf < Byte > ( , , ) ) val a : D2Array < Byte > = mk . ndarray ( list ) assertEquals ( list , a . toListD2 ( ) ) }","docstring":"/**\n * Creates a two-dimensional array from a list of byte lists\n * and checks if the array's list representation matches the input list.\n */"} {"signature":"@ Test fun createTwoDimensionalArrayFromByteSet ( )","body":"{ val set = setOf < Byte > ( , , , , , ) val shape = intArrayOf ( , ) val a : D2Array < Byte > = mk . ndarray ( set , shape = shape ) assertEquals ( set . size , a . size ) assertEquals ( set , a . toSet ( ) ) }","docstring":"/**\n * Creates a two-dimensional array from a set of bytes\n * and checks if the array's set representation matches the input set.\n */"} {"signature":"@ Test fun createTwoDimensionalArrayFromPrimitiveByteArray ( )","body":"{ val array = byteArrayOf ( , , , , , ) val a = mk . ndarray ( array , , ) assertEquals ( array . size , a . size ) a . data . getByteArray ( ) shouldBe array }","docstring":"/**\n * Creates a two-dimensional array from a primitive ByteArray\n * and checks if the array's ByteArray representation matches the input ByteArray.\n */"} {"signature":"@ Test fun createByte2DArrayWithInitializationFunction ( )","body":"{ val a = mk . d2array < Byte > ( , ) { ( it + ) . toByte ( ) } val expected = byteArrayOf ( , , , , , ) assertEquals ( expected . size , a . size ) a . data . getByteArray ( ) shouldBe expected }","docstring":"/**\n * Creates a two-dimensional array with a given size using an initialization function\n * and checks if the array's ByteArray representation matches the expected output.\n */"} {"signature":"@ Test fun createByte2DArrayWithInitAndIndices ( )","body":"{ val a = mk . d2arrayIndices ( , ) { i , j -> ( i * j + ) . toByte ( ) } val expected = byteArrayOf ( , , , , , ) assertEquals ( expected . size , a . size ) a . data . getByteArray ( ) shouldBe expected }","docstring":"/**\n * Creates a two-dimensional array with a given size using an initialization function and indices.\n * Checks if the array's ByteArray representation matches the expected output.\n */"} {"signature":"@ OptIn ( ExperimentalMultikApi :: class ) @ Test fun createAlignedByte2DArray ( )","body":"{ val list = listOf ( listOf < Byte > ( , , ) , listOf < Byte > ( , ) , listOf < Byte > ( , , , ) ) val expected = listOf ( listOf < Byte > ( , , , ) , listOf < Byte > ( , , , ) , listOf < Byte > ( , , , ) ) val a : D2Array < Byte > = mk . createAlignedNDArray ( list , filling = ) assertEquals ( expected , a . toListD2 ( ) ) }","docstring":"/**\n * Tests the function 'createAlignedNDArray' that creates a two-dimensional array from a list of number lists.\n * The test asserts that:\n * - The output array's size matches the size of the longest list in the input\n * and all lists are filled to match this length.\n * - The lists shorter than the longest one are filled with the specified filling value.\n */"} {"signature":"@ Test fun createZeroFilledShortArray ( )","body":"{ val dim1 = val dim2 = val a = mk . zeros < Short > ( dim1 , dim2 ) assertEquals ( dim1 * dim2 , a . size ) assertEquals ( dim1 * dim2 , a . data . size ) assertTrue { a . all { it == . toShort ( ) } } }","docstring":"/**\n * This method checks if a short array of a given size is correctly created with all elements set to zero.\n */"} {"signature":"@ Test fun createShortArrayFilledWithOnes ( )","body":"{ val dim1 = val dim2 = val a = mk . ones < Short > ( dim1 , dim2 ) assertEquals ( dim1 * dim2 , a . size ) assertEquals ( dim1 * dim2 , a . data . size ) assertTrue { a . all { it == . toShort ( ) } } }","docstring":"/**\n * Creates a short array filled with ones of a given size and checks if all elements are set to one.\n */"} {"signature":"@ Test fun createIdentityShortMatrix ( )","body":"{ val n = val a = mk . identity < Short > ( n ) assertEquals ( n * n , a . size ) for ( i in until n ) { for ( j in until n ) { if ( i == j ) assertEquals ( , a [ i , j ] , \"\" ) else assertEquals ( , a [ i , j ] , \"\" ) } } }","docstring":"/**\n * Tests the function 'mk.identity(n)' that creates an identity matrix of size n x n.\n * The test asserts that:\n * - The size of the resulting matrix matches n*n.\n * - The diagonal elements of the matrix are 1 and the non-diagonal elements are 0.\n */"} {"signature":"@ Test fun createTwoDimensionalArrayFromShortList ( )","body":"{ val list = listOf ( listOf < Short > ( , , ) , listOf < Short > ( , , ) ) val a : D2Array < Short > = mk . ndarray ( list ) assertEquals ( list , a . toListD2 ( ) ) }","docstring":"/**\n * Creates a two-dimensional array from a list of short lists\n * and checks if the array's list representation matches the input list.\n */"} {"signature":"@ Test @ Ignore fun createTwoDimensionalArrayFromShortSet ( )","body":"{ val set = setOf < Short > ( , , , , , ) val shape = intArrayOf ( , ) val a : D2Array < Short > = mk . ndarray ( set , shape = shape ) assertEquals ( set . size , a . size ) assertEquals ( set , a . toSet ( ) ) }","docstring":"/**\n * Creates a two-dimensional array from a set of shorts\n * and checks if the array's set representation matches the input set.\n */"} {"signature":"@ Test fun createTwoDimensionalArrayFromPrimitiveShortArray ( )","body":"{ val array = shortArrayOf ( , , , , , ) val a = mk . ndarray ( array , , ) assertEquals ( array . size , a . size ) a . data . getShortArray ( ) shouldBe array }","docstring":"/**\n * Creates a two-dimensional array from a primitive ShortArray\n * and checks if the array's ShortArray representation matches the input ShortArray.\n */"} {"signature":"@ Test fun createShort2DArrayWithInitializationFunction ( )","body":"{ val a = mk . d2array < Short > ( , ) { ( it + ) . toShort ( ) } val expected = shortArrayOf ( , , , , , ) assertEquals ( expected . size , a . size ) a . data . getShortArray ( ) shouldBe expected }","docstring":"/**\n * Creates a two-dimensional array with a given size using an initialization function\n * and checks if the array's ShortArray representation matches the expected output.\n */"} {"signature":"@ Test fun createShort2DArrayWithInitAndIndices ( )","body":"{ val a = mk . d2arrayIndices ( , ) { i , j -> ( i * j + ) . toShort ( ) } val expected = shortArrayOf ( , , , , , ) assertEquals ( expected . size , a . size ) a . data . getShortArray ( ) shouldBe expected }","docstring":"/**\n * Creates a two-dimensional array with a given size using an initialization function and indices.\n * Checks if the array's ShortArray representation matches the expected output.\n */"} {"signature":"@ OptIn ( ExperimentalMultikApi :: class ) @ Test fun createAlignedShort2DArray ( )","body":"{ val list = listOf ( listOf < Short > ( , , ) , listOf < Short > ( , ) , listOf < Short > ( , , , ) ) val expected = listOf ( listOf < Short > ( , , , ) , listOf < Short > ( , , , ) , listOf < Short > ( , , , ) ) val a : D2Array < Short > = mk . createAlignedNDArray ( list , filling = ) assertEquals ( expected , a . toListD2 ( ) ) }","docstring":"/**\n * Tests the function 'createAlignedNDArray' that creates a two-dimensional array from a list of number lists.\n * The test asserts that:\n * - The output array's size matches the size of the longest list in the input\n * and all lists are filled to match this length.\n * - The lists shorter than the longest one are filled with the specified filling value.\n */"} {"signature":"@ Test fun createZeroFilledIntArray ( )","body":"{ val dim1 = val dim2 = val a = mk . zeros < Int > ( dim1 , dim2 ) assertEquals ( dim1 * dim2 , a . size ) assertEquals ( dim1 * dim2 , a . data . size ) assertTrue { a . all { it == } } }","docstring":"/**\n * This method checks if an integer array of a given size is correctly created with all elements set to zero.\n */"} {"signature":"@ Test fun createIntArrayFilledWithOnes ( )","body":"{ val dim1 = val dim2 = val a = mk . ones < Int > ( dim1 , dim2 ) assertEquals ( dim1 * dim2 , a . size ) assertEquals ( dim1 * dim2 , a . data . size ) assertTrue { a . all { it == } } }","docstring":"/**\n * Creates an integer array filled with ones of a given size and checks if all elements are set to one.\n */"} {"signature":"@ Test fun createIdentityIntMatrix ( )","body":"{ val n = val a = mk . identity < Int > ( n ) assertEquals ( n * n , a . size ) for ( i in until n ) { for ( j in until n ) { if ( i == j ) assertEquals ( , a [ i , j ] , \"\" ) else assertEquals ( , a [ i , j ] , \"\" ) } } }","docstring":"/**\n * Tests the function 'mk.identity(n)' that creates an identity matrix of size n x n.\n * The test asserts that:\n * - The size of the resulting matrix matches n*n.\n * - The diagonal elements of the matrix are 1 and the non-diagonal elements are 0.\n */"} {"signature":"@ Test fun createTwoDimensionalArrayFromIntList ( )","body":"{ val list = listOf ( listOf ( , , ) , listOf ( , , ) ) val a : D2Array < Int > = mk . ndarray ( list ) assertEquals ( list , a . toListD2 ( ) ) }","docstring":"/**\n * Creates a two-dimensional array from a list of integer lists\n * and checks if the array's list representation matches the input list.\n */"} {"signature":"@ Test fun createTwoDimensionalArrayFromIntSet ( )","body":"{ val set = setOf ( , , , , , ) val shape = intArrayOf ( , ) val a : D2Array < Int > = mk . ndarray ( set , shape = shape ) assertEquals ( set . size , a . size ) assertEquals ( set , a . toSet ( ) ) }","docstring":"/**\n * Creates a two-dimensional array from a set of integers\n * and checks if the array's set representation matches the input set.\n */"} {"signature":"@ Test fun createTwoDimensionalArrayFromPrimitiveIntArray ( )","body":"{ val array = intArrayOf ( , , , , , ) val a = mk . ndarray ( array , , ) assertEquals ( array . size , a . size ) a . data . getIntArray ( ) shouldBe array }","docstring":"/**\n * Creates a two-dimensional array from a primitive IntArray\n * and checks if the array's IntArray representation matches the input IntArray.\n */"} {"signature":"@ Test fun createInt2DArrayWithInitializationFunction ( )","body":"{ val a = mk . d2array < Int > ( , ) { ( it + ) } val expected = intArrayOf ( , , , , , ) assertEquals ( expected . size , a . size ) a . data . getIntArray ( ) shouldBe expected }","docstring":"/**\n * Creates a two-dimensional array with a given size using an initialization function\n * and checks if the array's IntArray representation matches the expected output.\n */"} {"signature":"@ Test fun createInt2DArrayWithInitAndIndices ( )","body":"{ val a = mk . d2arrayIndices ( , ) { i , j -> i * j + } val expected = intArrayOf ( , , , , , ) assertEquals ( expected . size , a . size ) a . data . getIntArray ( ) shouldBe expected }","docstring":"/**\n * Creates a two-dimensional array with a given size using an initialization function and indices.\n * Checks if the array's IntArray representation matches the expected output.\n */"} {"signature":"@ OptIn ( ExperimentalMultikApi :: class ) @ Test fun createAlignedInt2DArray ( )","body":"{ val list = listOf ( listOf ( , , ) , listOf ( , ) , listOf ( , , , ) ) val expected = listOf ( listOf ( , , , ) , listOf ( , , , ) , listOf ( , , , ) ) val a : D2Array < Int > = mk . createAlignedNDArray ( list , filling = ) assertEquals ( expected , a . toListD2 ( ) ) }","docstring":"/**\n * Tests the function 'createAlignedNDArray' that creates a two-dimensional array from a list of number lists.\n * The test asserts that:\n * - The output array's size matches the size of the longest list in the input\n * and all lists are filled to match this length.\n * - The lists shorter than the longest one are filled with the specified filling value.\n */"} {"signature":"@ Test fun createZeroFilledLongArray ( )","body":"{ val dim1 = val dim2 = val a = mk . zeros < Long > ( dim1 , dim2 ) assertEquals ( dim1 * dim2 , a . size ) assertEquals ( dim1 * dim2 , a . data . size ) assertTrue { a . all { it == } } }","docstring":"/**\n * This method checks if a long array of a given size is correctly created with all elements set to zero.\n */"} {"signature":"@ Test fun createLongArrayFilledWithOnes ( )","body":"{ val dim1 = val dim2 = val a = mk . ones < Long > ( dim1 , dim2 ) assertEquals ( dim1 * dim2 , a . size ) assertEquals ( dim1 * dim2 , a . data . size ) assertTrue { a . all { it == } } }","docstring":"/**\n * Creates a long array filled with ones of a given size and checks if all elements are set to one.\n */"} {"signature":"@ Test fun createIdentityLongMatrix ( )","body":"{ val n = val a = mk . identity < Long > ( n ) assertEquals ( n * n , a . size ) for ( i in until n ) { for ( j in until n ) { if ( i == j ) assertEquals ( , a [ i , j ] , \"\" ) else assertEquals ( , a [ i , j ] , \"\" ) } } }","docstring":"/**\n * Tests the function 'mk.identity(n)' that creates an identity matrix of size n x n.\n * The test asserts that:\n * - The size of the resulting matrix matches n*n.\n * - The diagonal elements of the matrix are 1 and the non-diagonal elements are 0.\n */"} {"signature":"@ Test fun createTwoDimensionalArrayFromLongList ( )","body":"{ val list = listOf ( listOf ( , , ) , listOf ( , , ) ) val a : D2Array < Long > = mk . ndarray ( list ) assertEquals ( list , a . toListD2 ( ) ) }","docstring":"/**\n * Creates a two-dimensional array from a list of long lists\n * and checks if the array's list representation matches the input list.\n */"} {"signature":"@ Test fun createTwoDimensionalArrayFromLongSet ( )","body":"{ val set = setOf ( , , , , , ) val shape = intArrayOf ( , ) val a : D2Array < Long > = mk . ndarray ( set , shape = shape ) assertEquals ( set . size , a . size ) assertEquals ( set , a . toSet ( ) ) }","docstring":"/**\n * Creates a two-dimensional array from a set of longs\n * and checks if the array's set representation matches the input set.\n */"} {"signature":"@ Test fun createTwoDimensionalArrayFromPrimitiveLongArray ( )","body":"{ val array = longArrayOf ( , , , , , ) val a = mk . ndarray ( array , , ) assertEquals ( array . size , a . size ) a . data . getLongArray ( ) shouldBe array }","docstring":"/**\n * Creates a two-dimensional array from a primitive LongArray\n * and checks if the array's LongArray representation matches the input LongArray.\n */"} {"signature":"@ Test fun createLong2DArrayWithInitializationFunction ( )","body":"{ val a = mk . d2array < Long > ( , ) { it + } val expected = longArrayOf ( , , , , , ) assertEquals ( expected . size , a . size ) a . data . getLongArray ( ) shouldBe expected }","docstring":"/**\n * Creates a two-dimensional array with a given size using an initialization function\n * and checks if the array's LongArray representation matches the expected output.\n */"} {"signature":"@ Test fun createLong2DArrayWithInitAndIndices ( )","body":"{ val a = mk . d2arrayIndices < Long > ( , ) { i , j -> i * j + } val expected = longArrayOf ( , , , , , ) assertEquals ( expected . size , a . size ) a . data . getLongArray ( ) shouldBe expected }","docstring":"/**\n * Creates a two-dimensional array with a given size using an initialization function and indices.\n * Checks if the array's LongArray representation matches the expected output.\n */"} {"signature":"@ OptIn ( ExperimentalMultikApi :: class ) @ Test fun createAlignedLong2DArray ( )","body":"{ val list = listOf ( listOf < Long > ( , , ) , listOf < Long > ( , ) , listOf < Long > ( , , , ) ) val expected = listOf ( listOf < Long > ( , , , ) , listOf < Long > ( , , , ) , listOf < Long > ( , , , ) ) val a : D2Array < Long > = mk . createAlignedNDArray ( list , filling = ) assertEquals ( expected , a . toListD2 ( ) ) }","docstring":"/**\n * Tests the function 'createAlignedNDArray' that creates a two-dimensional array from a list of number lists.\n * The test asserts that:\n * - The output array's size matches the size of the longest list in the input\n * and all lists are filled to match this length.\n * - The lists shorter than the longest one are filled with the specified filling value.\n */"} {"signature":"@ Test fun createZeroFilledFloatArray ( )","body":"{ val dim1 = val dim2 = val a = mk . zeros < Float > ( dim1 , dim2 ) assertEquals ( dim1 * dim2 , a . size ) assertEquals ( dim1 * dim2 , a . data . size ) assertTrue { a . all { it == } } }","docstring":"/**\n * This method checks if a float array of a given size is correctly created with all elements set to zero.\n */"} {"signature":"@ Test fun createFloatArrayFilledWithOnes ( )","body":"{ val dim1 = val dim2 = val a = mk . ones < Float > ( dim1 , dim2 ) assertEquals ( dim1 * dim2 , a . size ) assertEquals ( dim1 * dim2 , a . data . size ) assertTrue { a . all { it == } } }","docstring":"/**\n * Creates a float array filled with ones of a given size and checks if all elements are set to one.\n */"} {"signature":"@ Test fun createIdentityFloatMatrix ( )","body":"{ val n = val a = mk . identity < Float > ( n ) assertEquals ( n * n , a . size ) for ( i in until n ) { for ( j in until n ) { if ( i == j ) assertEquals ( , a [ i , j ] , \"\" ) else assertEquals ( , a [ i , j ] , \"\" ) } } }","docstring":"/**\n * Tests the function 'mk.identity(n)' that creates an identity matrix of size n x n.\n * The test asserts that:\n * - The size of the resulting matrix matches n*n.\n * - The diagonal elements of the matrix are 1 and the non-diagonal elements are 0.\n */"} {"signature":"@ Test fun createTwoDimensionalArrayFromFloatList ( )","body":"{ val list = listOf ( listOf ( , , ) , listOf ( , , ) ) val a : D2Array < Float > = mk . ndarray ( list ) assertEquals ( list , a . toListD2 ( ) ) }","docstring":"/**\n * Creates a two-dimensional array from a list of float lists\n * and checks if the array's list representation matches the input list.\n */"} {"signature":"@ Test fun createTwoDimensionalArrayFromFloatSet ( )","body":"{ val set = setOf ( , , , , , ) val shape = intArrayOf ( , ) val a : D2Array < Float > = mk . ndarray ( set , shape = shape ) assertEquals ( set . size , a . size ) assertEquals ( set , a . toSet ( ) ) }","docstring":"/**\n * Creates a two-dimensional array from a set of floats\n * and checks if the array's set representation matches the input set.\n */"} {"signature":"@ Test fun createTwoDimensionalArrayFromPrimitiveFloatArray ( )","body":"{ val array = floatArrayOf ( , , , , , ) val a = mk . ndarray ( array , , ) assertEquals ( array . size , a . size ) a . data . getFloatArray ( ) shouldBe array }","docstring":"/**\n * Creates a two-dimensional array from a primitive FloatArray\n * and checks if the array's FloatArray representation matches the input FloatArray.\n */"} {"signature":"@ Test fun createFloat2DArrayWithInitializationFunction ( )","body":"{ val a = mk . d2array < Float > ( , ) { it + } val expected = floatArrayOf ( , , , , , ) assertEquals ( expected . size , a . size ) a . data . getFloatArray ( ) shouldBe expected }","docstring":"/**\n * Creates a two-dimensional array with a given size using an initialization function\n * and checks if the array's FloatArray representation matches the expected output.\n */"} {"signature":"@ Test fun createFloat2DArrayWithInitAndIndices ( )","body":"{ val a = mk . d2arrayIndices < Float > ( , ) { i , j -> i * j + } val expected = floatArrayOf ( , , , , , ) assertEquals ( expected . size , a . size ) a . data . getFloatArray ( ) shouldBe expected }","docstring":"/**\n * Creates a two-dimensional array with a given size using an initialization function and indices.\n * Checks if the array's FloatArray representation matches the expected output.\n */"} {"signature":"@ OptIn ( ExperimentalMultikApi :: class ) @ Test fun createAlignedFloat2DArray ( )","body":"{ val list = listOf ( listOf ( , , ) , listOf ( , ) , listOf ( , , , ) ) val expected = listOf ( listOf ( , , , ) , listOf ( , , , ) , listOf ( , , , ) ) val a : D2Array < Float > = mk . createAlignedNDArray ( list , filling = ) assertEquals ( expected , a . toListD2 ( ) ) }","docstring":"/**\n * Tests the function 'createAlignedNDArray' that creates a two-dimensional array from a list of number lists.\n * The test asserts that:\n * - The output array's size matches the size of the longest list in the input\n * and all lists are filled to match this length.\n * - The lists shorter than the longest one are filled with the specified filling value.\n */"} {"signature":"@ Test fun createZeroFilledDoubleArray ( )","body":"{ val dim1 = val dim2 = val a = mk . zeros < Double > ( dim1 , dim2 ) assertEquals ( dim1 * dim2 , a . size ) assertEquals ( dim1 * dim2 , a . data . size ) assertTrue { a . all { it == } } }","docstring":"/**\n * This method checks if a double array of a given size is correctly created with all elements set to zero.\n */"} {"signature":"@ Test fun createDoubleArrayFilledWithOnes ( )","body":"{ val dim1 = val dim2 = val a = mk . ones < Double > ( dim1 , dim2 ) assertEquals ( dim1 * dim2 , a . size ) assertEquals ( dim1 * dim2 , a . data . size ) assertTrue { a . all { it == } } }","docstring":"/**\n * Creates a double array filled with ones of a given size and checks if all elements are set to one.\n */"} {"signature":"@ Test fun createIdentityDoubleMatrix ( )","body":"{ val n = val a = mk . identity < Double > ( n ) assertEquals ( n * n , a . size ) for ( i in until n ) { for ( j in until n ) { if ( i == j ) assertEquals ( , a [ i , j ] , \"\" ) else assertEquals ( , a [ i , j ] , \"\" ) } } }","docstring":"/**\n * Tests the function 'mk.identity(n)' that creates an identity matrix of size n x n.\n * The test asserts that:\n * - The size of the resulting matrix matches n*n.\n * - The diagonal elements of the matrix are 1 and the non-diagonal elements are 0.\n */"} {"signature":"@ Test fun createTwoDimensionalArrayFromDoubleList ( )","body":"{ val list = listOf ( listOf ( , , ) , listOf ( , , ) ) val a : D2Array < Double > = mk . ndarray ( list ) assertEquals ( list , a . toListD2 ( ) ) }","docstring":"/**\n * Creates a two-dimensional array from a list of double lists\n * and checks if the array's list representation matches the input list.\n */"} {"signature":"@ Test fun createTwoDimensionalArrayFromDoubleSet ( )","body":"{ val set = setOf ( , , , , , ) val shape = intArrayOf ( , ) val a : D2Array < Double > = mk . ndarray ( set , shape = shape ) assertEquals ( set . size , a . size ) assertEquals ( set , a . toSet ( ) ) }","docstring":"/**\n * Creates a two-dimensional array from a set of doubles\n * and checks if the array's set representation matches the input set.\n */"} {"signature":"@ Test fun createTwoDimensionalArrayFromPrimitiveDoubleArray ( )","body":"{ val array = doubleArrayOf ( , , , , , ) val a = mk . ndarray ( array , , ) assertEquals ( array . size , a . size ) a . data . getDoubleArray ( ) shouldBe array }","docstring":"/**\n * Creates a two-dimensional array from a primitive DoubleArray\n * and checks if the array's DoubleArray representation matches the input DoubleArray.\n */"} {"signature":"@ Test fun createDouble2DArrayWithInitializationFunction ( )","body":"{ val a = mk . d2array < Double > ( , ) { it + } val expected = doubleArrayOf ( , , , , , ) assertEquals ( expected . size , a . size ) a . data . getDoubleArray ( ) shouldBe expected }","docstring":"/**\n * Creates a two-dimensional array with a given size using an initialization function\n * and checks if the array's DoubleArray representation matches the expected output.\n */"} {"signature":"@ Test fun createDouble2DArrayWithInitAndIndices ( )","body":"{ val a = mk . d2arrayIndices < Double > ( , ) { i , j -> i * j + } val expected = doubleArrayOf ( , , , , , ) assertEquals ( expected . size , a . size ) a . data . getDoubleArray ( ) shouldBe expected }","docstring":"/**\n * Creates a two-dimensional array with a given size using an initialization function and indices.\n * Checks if the array's DoubleArray representation matches the expected output.\n */"} {"signature":"@ OptIn ( ExperimentalMultikApi :: class ) @ Test fun createAlignedDouble2DArray ( )","body":"{ val list = listOf ( listOf ( , , ) , listOf ( , ) , listOf ( , , , ) ) val expected = listOf ( listOf ( , , , ) , listOf ( , , , ) , listOf ( , , , ) ) val a : D2Array < Double > = mk . createAlignedNDArray ( list , filling = ) assertEquals ( expected , a . toListD2 ( ) ) }","docstring":"/**\n * Tests the function 'createAlignedNDArray' that creates a two-dimensional array from a list of number lists.\n * The test asserts that:\n * - The output array's size matches the size of the longest list in the input\n * and all lists are filled to match this length.\n * - The lists shorter than the longest one are filled with the specified filling value.\n */"} {"signature":"@ Test fun createZeroFilledComplexFloatArray ( )","body":"{ val dim1 = val dim2 = val a = mk . zeros < ComplexFloat > ( dim1 , dim2 ) assertEquals ( dim1 * dim2 , a . size ) assertEquals ( dim1 * dim2 , a . data . size ) assertTrue { a . all { it == ComplexFloat . zero } } }","docstring":"/**\n * This method checks if a ComplexFloat array of a given size is correctly created with all elements set to zero.\n */"} {"signature":"@ Test fun createComplexFloatArrayFilledWithOnes ( )","body":"{ val dim1 = val dim2 = val a = mk . ones < ComplexFloat > ( dim1 , dim2 ) assertEquals ( dim1 * dim2 , a . size ) assertEquals ( dim1 * dim2 , a . data . size ) assertTrue { a . all { it == ComplexFloat . one } } }","docstring":"/**\n * Creates a ComplexFloat array filled with ones of a given size and checks if all elements are set to one.\n */"} {"signature":"@ Test fun createIdentityComplexFloatMatrix ( )","body":"{ val n = val a = mk . identity < ComplexFloat > ( n ) assertEquals ( n * n , a . size ) for ( i in until n ) { for ( j in until n ) { if ( i == j ) assertEquals ( ComplexFloat . one , a [ i , j ] , \"\" ) else assertEquals ( ComplexFloat . zero , a [ i , j ] , \"\" ) } } }","docstring":"/**\n * Tests the function 'mk.identity(n)' that creates an identity matrix of size n x n.\n * The test asserts that:\n * - The size of the resulting matrix matches n*n.\n * - The diagonal elements of the matrix are 1 and the non-diagonal elements are 0.\n */"} {"signature":"@ Test fun createTwoDimensionalArrayFromComplexFloatList ( )","body":"{ val list = listOf ( listOf ( ComplexFloat . one , + . i , + . i ) , listOf ( + . i , + . i , + . i ) ) val a : D2Array < ComplexFloat > = mk . ndarray ( list ) assertEquals ( list , a . toListD2 ( ) ) }","docstring":"/**\n * Creates a two-dimensional array from a list of complex float lists\n * and checks if the array's list representation matches the input list.\n */"} {"signature":"@ Test fun createTwoDimensionalArrayFromComplexFloatSet ( )","body":"{ val set = setOf ( + . i , + . i , + . i , + . i , + . i , + . i ) val shape = intArrayOf ( , ) val a : D2Array < ComplexFloat > = mk . ndarray ( set , shape = shape ) assertEquals ( set . size , a . size ) assertEquals ( set , a . toSet ( ) ) }","docstring":"/**\n * Creates a two-dimensional array from a set of complex floats\n * and checks if the array's set representation matches the input set.\n */"} {"signature":"@ Test fun createTwoDimensionalArrayFromPrimitiveComplexFloatArray ( )","body":"{ val array = complexFloatArrayOf ( + . i , + . i , + . i , + . i , + . i , + . i ) val a = mk . ndarray ( array , , ) assertEquals ( array . size , a . size ) a . data . getComplexFloatArray ( ) shouldBe array }","docstring":"/**\n * Creates a two-dimensional array from a primitive ComplexFloatArray\n * and checks if the array's ComplexFloatArray representation matches the input ComplexFloatArray.\n */"} {"signature":"@ Test fun createComplexFloat2DArrayWithInitializationFunction ( )","body":"{ val a = mk . d2array < ComplexFloat > ( , ) { ComplexFloat ( it + , round ( ( it - ) * ) / ) } val expected = complexFloatArrayOf ( - . i , + . i , + . i , + . i , + . i , + . i ) assertEquals ( expected . size , a . size ) a . data . getComplexFloatArray ( ) shouldBe expected }","docstring":"/**\n * Creates a two-dimensional array with a given size using an initialization function\n * and checks if the array's ComplexFloatArray representation matches the expected output.\n */"} {"signature":"@ Test fun createComplexFloat2DArrayWithInitAndIndices ( )","body":"{ val a = mk . d2arrayIndices < ComplexFloat > ( , ) { i , j -> i * j + ComplexFloat ( ) } val expected = complexFloatArrayOf ( + . i , + . i , + . i , + . i , + . i , + . i ) assertEquals ( expected . size , a . size ) a . data . getComplexFloatArray ( ) shouldBe expected }","docstring":"/**\n * Creates a two-dimensional array with a given size using an initialization function and indices.\n * Checks if the array's ComplexFloatArray representation matches the expected output.\n */"} {"signature":"@ Test fun createZeroFilledComplexDoubleArray ( )","body":"{ val dim1 = val dim2 = val a = mk . zeros < ComplexDouble > ( dim1 , dim2 ) assertEquals ( dim1 * dim2 , a . size ) assertEquals ( dim1 * dim2 , a . data . size ) assertTrue { a . all { it == ComplexDouble . zero } } }","docstring":"/**\n * This method checks if a ComplexDouble array of a given size is correctly created with all elements set to zero.\n */"} {"signature":"@ Test fun createComplexDoubleArrayFilledWithOnes ( )","body":"{ val dim1 = val dim2 = val a = mk . ones < ComplexDouble > ( dim1 , dim2 ) assertEquals ( dim1 * dim2 , a . size ) assertEquals ( dim1 * dim2 , a . data . size ) assertTrue { a . all { it == ComplexDouble . one } } }","docstring":"/**\n * Creates a ComplexDouble array filled with ones of a given size and checks if all elements are set to one.\n */"} {"signature":"@ Test fun createIdentityMatrix ( )","body":"{ val n = val a = mk . identity < ComplexDouble > ( n ) assertEquals ( n * n , a . size ) for ( i in until n ) { for ( j in until n ) { if ( i == j ) assertEquals ( ComplexDouble . one , a [ i , j ] , \"\" ) else assertEquals ( ComplexDouble . zero , a [ i , j ] , \"\" ) } } }","docstring":"/**\n * Tests the function 'mk.identity(n)' that creates an identity matrix of size n x n.\n * The test asserts that:\n * - The size of the resulting matrix matches n*n.\n * - The diagonal elements of the matrix are 1 and the non-diagonal elements are 0.\n */"} {"signature":"@ Test fun createTwoDimensionalArrayFromComplexDoubleList ( )","body":"{ val list = listOf ( listOf ( + . i , + . i , + . i ) , listOf ( + . i , + . i , + . i ) ) val a : D2Array < ComplexDouble > = mk . ndarray ( list ) assertEquals ( list , a . toListD2 ( ) ) }","docstring":"/**\n * Creates a two-dimensional array from a list of byte lists\n * and checks if the array's list representation matches the input list.\n */"} {"signature":"@ Test fun createTwoDimensionalArrayFromComplexDoubleSet ( )","body":"{ val set = setOf ( + . i , + . i , + . i , + . i , + . i , + . i ) val shape = intArrayOf ( , ) val a : D2Array < ComplexDouble > = mk . ndarray ( set , shape = shape ) assertEquals ( set . size , a . size ) assertEquals ( set , a . toSet ( ) ) }","docstring":"/**\n * Creates a two-dimensional array from a set of complex doubles\n * and checks if the array's set representation matches the input set.\n */"} {"signature":"@ Test fun createTwoDimensionalArrayFromPrimitiveComplexDoubleArray ( )","body":"{ val array = complexDoubleArrayOf ( + . i , + . i , + . i , + . i , + . i , + . i ) val a = mk . ndarray ( array , , ) assertEquals ( array . size , a . size ) a . data . getComplexDoubleArray ( ) shouldBe array }","docstring":"/**\n * Creates a two-dimensional array from a primitive ComplexDoubleArray\n * and checks if the array's ComplexDoubleArray representation matches the input ComplexDoubleArray.\n */"} {"signature":"@ Test fun createComplexDouble2DArrayWithInitializationFunction ( )","body":"{ val a = mk . d2array < ComplexDouble > ( , ) { ComplexDouble ( it + , round ( ( it - ) * ) / ) } val expected = complexDoubleArrayOf ( - . i , + . i , + . i , + . i , + . i , + . i ) assertEquals ( expected . size , a . size ) a . data . getComplexDoubleArray ( ) shouldBe expected }","docstring":"/**\n * Creates a two-dimensional array with a given size using an initialization function\n * and checks if the array's ComplexDoubleArray representation matches the expected output.\n */"} {"signature":"@ Test fun createComplexDouble2DArrayWithInitAndIndices ( )","body":"{ val a = mk . d2arrayIndices < ComplexDouble > ( , ) { i , j -> i * j + ComplexDouble ( ) } val expected = complexDoubleArrayOf ( + . i , + . i , + . i , + . i , + . i , + . i ) assertEquals ( expected . size , a . size ) a . data . getComplexDoubleArray ( ) shouldBe expected }","docstring":"/**\n * Creates a two-dimensional array with a given size using an initialization function and indices.\n * Checks if the array's ComplexDoubleArray representation matches the expected output.\n */"} {"signature":"public inline fun PlotContext . layout ( block : Layout . ( ) -> Unit )","body":"{ if ( plotFeatures [ Layout . NAME ] == null ) { plotFeatures [ Layout . NAME ] = Layout ( ) . apply ( block ) } ( plotFeatures [ Layout . NAME ] as Layout ) . apply ( block ) }","docstring":"/**\n * Provides a context for configuring the layout of a plot.\n *\n * Inside this context, you can set various layout properties such as\n * title, subtitle, caption, size, and others.\n *\n * ### Example\n *\n * ```kotlin\n * plot {\n * line { x(listOf(1, 2, 3)); y.constant(5) }\n * layout {\n * title = \"Main Title\"\n * subtitle = \"Subtitle\"\n * xAxisLabel = \"X-Axis\"\n * yAxisLabel = \"Y-Axis\"\n * style(Style.Grey)\n * }\n * }\n * ```\n */"} {"signature":"public inline fun style ( style : Style , block : CustomStyle . ( ) -> Unit = { } )","body":"{ this . style = style customStyle = CustomStyle ( ) . apply ( block ) }","docstring":"/**\n * Configures the style of the plot.\n *\n * @param style one of the predefined styles.\n * @param block additional customizations to apply on top of the main style.\n */"} {"signature":"public inline fun style ( block : CustomStyle . ( ) -> Unit )","body":"{ style = CustomStyle ( ) . apply ( block ) }","docstring":"/**\n * Configures a custom style for the plot.\n *\n * @param block a lambda function to define the custom style.\n */"} {"signature":"fun registerIntrinsic ( owner : FqName , receiverParameter : FqNameUnsafe ? , name : String , valueParameterCount : Int , impl : IntrinsicMethod )","body":"{ intrinsicsMap [ Key ( owner . toUnsafe ( ) , receiverParameter , name , valueParameterCount ) ] = impl }","docstring":"/**\n * @param valueParameterCount -1 for property\n */"} {"signature":"fun foo ( )","body":"{ }","docstring":"/**\n * [Nested]\n */"} {"signature":"private fun setup ( outputDirectory : File , content : String , resolutionTargetInFirstModule : DRI ? = null , resolutionTargetInSecondModule : DRI ? = null ) : File","body":"{ val innerModule1 = outputDirectory . resolve ( \"\" ) . also { assertTrue ( it . mkdirs ( ) ) } val innerModule2 = outputDirectory . resolve ( \"\" ) . also { assertTrue ( it . mkdirs ( ) ) } val packageList2 = innerModule2 . resolve ( \"\" ) packageList2 . writeText ( mockedPackageListForPackages ( RecognizedLinkFormat . DokkaHtml , \"\" ) ) val packageList1 = innerModule1 . resolve ( \"\" ) packageList1 . writeText ( mockedPackageListForPackages ( RecognizedLinkFormat . DokkaHtml , \"\" ) ) if ( resolutionTargetInFirstModule != null ) { val resolvedFile1 = innerModule1 . resolve ( \"\" ) resolvedFile1 . parentFile . mkdirs ( ) resolvedFile1 . createNewFile ( ) } if ( resolutionTargetInSecondModule != null ) { val resolvedFile2 = innerModule2 . resolve ( \"\" ) resolvedFile2 . parentFile . mkdirs ( ) resolvedFile2 . createNewFile ( ) } val contentFile = innerModule1 . resolve ( \"\" ) contentFile . writeText ( content ) return contentFile }","docstring":"/**\n * Create partial output for two modules: `module1` and `module2`.\n * The modules have the same package name `package2` in `package-list`s.\n */"} {"signature":"public fun analyseImports ( file : KtFile ) : KtImportOptimizerResult","body":"= withValidityAssertion { return analysisSession . importOptimizer . analyseImports ( file ) }","docstring":"/**\n * Takes [file] and inspects its imports and their usages,\n * so they can be optimized based on the resulting [KtImportOptimizerResult].\n *\n * Does **not** change the file.\n */"} {"signature":"public fun < T > Flow < T > . distinctUntilChanged ( ) : Flow < T >","body":"= when ( this ) { is StateFlow < * > -> this else -> distinctUntilChangedBy ( keySelector = defaultKeySelector , areEquivalent = defaultAreEquivalent ) }","docstring":"/**\n * Returns flow where all subsequent repetitions of the same value are filtered out.\n *\n * Note that any instance of [StateFlow] already behaves as if `distinctUntilChanged` operator is\n * applied to it, so applying `distinctUntilChanged` to a `StateFlow` has no effect.\n * See [StateFlow] documentation on Operator Fusion.\n * Also, repeated application of `distinctUntilChanged` operator on any flow has no effect.\n */"} {"signature":"@ Suppress ( \"\" ) public fun < T > Flow < T > . distinctUntilChanged ( areEquivalent : ( old : T , new : T ) -> Boolean ) : Flow < T >","body":"= distinctUntilChangedBy ( keySelector = defaultKeySelector , areEquivalent = areEquivalent as ( Any ? , Any ? ) -> Boolean )","docstring":"/**\n * Returns flow where all subsequent repetitions of the same value are filtered out, when compared\n * with each other via the provided [areEquivalent] function.\n *\n * Note that repeated application of `distinctUntilChanged` operator with the same parameter has no effect.\n */"} {"signature":"public fun < T , K > Flow < T > . distinctUntilChangedBy ( keySelector : ( T ) -> K ) : Flow < T >","body":"= distinctUntilChangedBy ( keySelector = keySelector , areEquivalent = defaultAreEquivalent )","docstring":"/**\n * Returns flow where all subsequent repetitions of the same key are filtered out, where\n * key is extracted with [keySelector] function.\n *\n * Note that repeated application of `distinctUntilChanged` operator with the same parameter has no effect.\n */"} {"signature":"private fun < T > Flow < T > . distinctUntilChangedBy ( keySelector : ( T ) -> Any ? , areEquivalent : ( old : Any ? , new : Any ? ) -> Boolean ) : Flow < T >","body":"= when { this is DistinctFlowImpl < * > && this . keySelector === keySelector && this . areEquivalent === areEquivalent -> this else -> DistinctFlowImpl ( this , keySelector , areEquivalent ) }","docstring":"/**\n * Returns flow where all subsequent repetitions of the same key are filtered out, where\n * keys are extracted with [keySelector] function and compared with each other via the\n * provided [areEquivalent] function.\n *\n * NOTE: It is non-inline to share a single implementing class.\n */"} {"signature":"@ Suppress ( \"\" , \"\" ) override fun hasOwnName ( name : String ) : Boolean","body":"= name in RESERVED_WORDS || name == ident || name == labelName ? . ident || parent ? . hasOwnName ( name ) ? : false","docstring":"/**\n * Safe call is necessary, because hasOwnName can be called\n * in constructor before labelName is initialized (see KT-4394)\n */"} {"signature":"public suspend fun < T > Flow < T > . count ( ) : Int","body":"{ var i = collect { ++ i } return i }","docstring":"/**\n * Returns the number of elements in this flow.\n */"} {"signature":"public suspend fun < T > Flow < T > . count ( predicate : suspend ( T ) -> Boolean ) : Int","body":"{ var i = collect { value -> if ( predicate ( value ) ) { ++ i } } return i }","docstring":"/**\n * Returns the number of elements matching the given predicate.\n */"} {"signature":"@ Suppress ( \"\" ) @ ExperimentalForeignApi public fun < T : Boolean > NativePlacement . alloc ( value : T ) : BooleanVarOf < T >","body":"= alloc < BooleanVarOf < T > > { this . value = value }","docstring":"/**\n * Allocates variable with given value type and initializes it with given value.\n */"} {"signature":"@ Suppress ( \"\" ) @ ExperimentalForeignApi public fun < T : Byte > NativePlacement . alloc ( value : T ) : ByteVarOf < T >","body":"= alloc < ByteVarOf < T > > { this . value = value }","docstring":"/**\n * Allocates variable with given value type and initializes it with given value.\n */"} {"signature":"@ Suppress ( \"\" ) @ ExperimentalForeignApi public fun < T : Short > NativePlacement . alloc ( value : T ) : ShortVarOf < T >","body":"= alloc < ShortVarOf < T > > { this . value = value }","docstring":"/**\n * Allocates variable with given value type and initializes it with given value.\n */"} {"signature":"@ Suppress ( \"\" ) @ ExperimentalForeignApi public fun < T : Int > NativePlacement . alloc ( value : T ) : IntVarOf < T >","body":"= alloc < IntVarOf < T > > { this . value = value }","docstring":"/**\n * Allocates variable with given value type and initializes it with given value.\n */"} {"signature":"@ Suppress ( \"\" ) @ ExperimentalForeignApi public fun < T : Long > NativePlacement . alloc ( value : T ) : LongVarOf < T >","body":"= alloc < LongVarOf < T > > { this . value = value }","docstring":"/**\n * Allocates variable with given value type and initializes it with given value.\n */"} {"signature":"@ Suppress ( \"\" ) @ ExperimentalForeignApi public fun < T : UByte > NativePlacement . alloc ( value : T ) : UByteVarOf < T >","body":"= alloc < UByteVarOf < T > > { this . value = value }","docstring":"/**\n * Allocates variable with given value type and initializes it with given value.\n */"} {"signature":"@ Suppress ( \"\" ) @ ExperimentalForeignApi public fun < T : UShort > NativePlacement . alloc ( value : T ) : UShortVarOf < T >","body":"= alloc < UShortVarOf < T > > { this . value = value }","docstring":"/**\n * Allocates variable with given value type and initializes it with given value.\n */"} {"signature":"@ Suppress ( \"\" ) @ ExperimentalForeignApi public fun < T : UInt > NativePlacement . alloc ( value : T ) : UIntVarOf < T >","body":"= alloc < UIntVarOf < T > > { this . value = value }","docstring":"/**\n * Allocates variable with given value type and initializes it with given value.\n */"} {"signature":"@ Suppress ( \"\" ) @ ExperimentalForeignApi public fun < T : ULong > NativePlacement . alloc ( value : T ) : ULongVarOf < T >","body":"= alloc < ULongVarOf < T > > { this . value = value }","docstring":"/**\n * Allocates variable with given value type and initializes it with given value.\n */"} {"signature":"@ Suppress ( \"\" ) @ ExperimentalForeignApi public fun < T : Float > NativePlacement . alloc ( value : T ) : FloatVarOf < T >","body":"= alloc < FloatVarOf < T > > { this . value = value }","docstring":"/**\n * Allocates variable with given value type and initializes it with given value.\n */"} {"signature":"@ Suppress ( \"\" ) @ ExperimentalForeignApi public fun < T : Double > NativePlacement . alloc ( value : T ) : DoubleVarOf < T >","body":"= alloc < DoubleVarOf < T > > { this . value = value }","docstring":"/**\n * Allocates variable with given value type and initializes it with given value.\n */"} {"signature":"fun efficientNet4LitePrediction ( )","body":"{ val modelHub = ONNXModelHub ( cacheDirectory = File ( \"\" ) ) val modelType = ONNXModels . CV . EfficientNet4Lite val model = modelHub . loadModel ( modelType ) model . printSummary ( ) val imageNetClassLabels = Imagenet . V1k . labels ( ) model . use { println ( it ) val fileDataLoader = modelType . createPreprocessing ( it ) . fileLoader ( ) for ( i in .. ) { val inputData = fileDataLoader . load ( getFileFromResource ( \"\" ) ) val res = it . predictLabel ( inputData ) println ( \"\" ) val top5 = it . predictTopNLabels ( inputData , imageNetClassLabels ) println ( top5 . toString ( ) ) } } }","docstring":"/**\n * This examples demonstrates the inference concept on EfficientNet4Lite model:\n * - Model configuration, model weights and labels are obtained from [ONNXModelHub].\n * - Model predicts on a few images located in resources.\n * - Special preprocessing (used in EfficientNet4Lite during training on ImageNet dataset) is applied to each image before prediction.\n */"} {"signature":"fun main ( ) : Unit","body":"= efficientNet4LitePrediction ( )","docstring":"/** */"} {"signature":"@ BuilderDsl public fun model ( block : T . ( ) -> Unit )","body":"{ modelBuilderBlock = block }","docstring":"/**\n * Model Builder.\n *\n * accept model, for example\n * ```\n * model {\n * name = \"MyModel\"\n * }\n * ```\n * @param [block] Model builder block.\n */"} {"signature":"@ BuilderDsl public fun layers ( block : LayerListBuilder . ( ) -> Unit )","body":"{ layerListBuilderBlock = block }","docstring":"/**\n * Layers Builder.\n *\n * @see [LayerListBuilder]\n * @param [block] Layer builder block.\n */"} {"signature":"@ BuilderDsl public fun use ( block : T . ( ) -> Unit )","body":"{ useBlock = block }","docstring":"/**\n * Use builder.\n *\n * Apply after model builder block, will close automatically.\n *\n * @param [block] Use builder block.\n */"} {"signature":"public operator fun Layer . unaryPlus ( ) : Layer","body":"{ layers . add ( this ) return this }","docstring":"/**\n * Unary plus.\n *\n * Add a layer to the list and return itself.\n *\n * We can do this\n * ```\n * +Input(128, 128)\n * ```\n * instead of\n * ```\n * layers.add(Input(128, 128))\n * ```\n * @return the layer\n */"} {"signature":"public fun toArray ( ) : Array < Layer >","body":"= layers . toTypedArray ( )","docstring":"/**\n * Converts layers to array.\n *\n * @return array of layers.\n */"} {"signature":"@ EntryDsl public fun sequential ( builder : GraphTrainableModelBuilder < Sequential > . ( ) -> Unit ) : Sequential","body":"{ return GraphTrainableModelBuilder ( Sequential . Companion :: of ) . apply ( builder ) . build ( ) }","docstring":"/**\n * Sequential model builder.\n *\n * @param [builder] The builder block.\n * @return a Sequential model.\n */"} {"signature":"@ EntryDsl public fun functional ( builder : GraphTrainableModelBuilder < Functional > . ( ) -> Unit ) : Functional","body":"{ return GraphTrainableModelBuilder ( Functional . Companion :: of ) . apply ( builder ) . build ( ) }","docstring":"/**\n * Functional model builder.\n *\n * @param [builder] The builder block.\n * @return a Functional model.\n */"} {"signature":"@ EntryDsl public operator fun < T : GraphTrainableModel > ( ( Array < Layer > ) -> T ) . invoke ( builder : GraphTrainableModelBuilder < T > . ( ) -> Unit ) : T","body":"{ return GraphTrainableModelBuilder ( this ) . apply ( builder ) . build ( ) }","docstring":"/**\n * Generic model builder.\n *\n * @receiver Function to create model, accepts an array of layer.\n * @param [T] type of model\n * @param [builder] The builder block.\n * @return a model corresponding to [T].\n */"} {"signature":"public inline fun LayerCollectorContext . abLine ( block : ABLineContext . ( ) -> Unit )","body":"{ addLayer ( ABLineContext ( this ) . apply ( block ) ) }","docstring":"/**\n * Adds an `abLine` layer to the plot.\n *\n * The `abLine` layer draws a line defined by its slope and y-intercept,\n * which is commonly used for regression lines or simple references in plots.\n *\n * This function creates a context where you can set aesthetic mappings (`aes`) or aesthetic constants.\n *\n * - Mappings are specified by calling methods that correspond to aesthetic names (`aes`).\n * - Constants are directly assigned using properties with the names corresponding to aesthetics.\n * For positional aesthetics, you can use the `.constant()` method.\n *\n * ## ABLine Aesthetics\n * * `slope` - Slope of the line.\n * * `intercept` - Y-intercept at which the line crosses the vertical axis.\n * * `color` - Color of the line.\n * * `type` - Style of the line, such as dashed or dotted.\n * * `width` - Width of the line.\n * * `alpha` - Transparency of the line.\n *\n * ## Example\n *\n * ```kotlin\n * plot {\n * abLine {\n * // Map values to intercept aesthetic\n * intercept(listOf(.1, .2, .3, .4, .5))\n * // Set a constant slope\n * slope.constant(0.5)\n * // Set a constant width for the line\n * width = 2.5\n * // Map categorical values to color aesthetic\n * color(listOf(\"A\", \"A\", \"B\", \"B\", \"C\")) {\n * // Additional mapping parameters, e.g., you can specify a color palette here\n * scale = categorical(\"A\" to Color.RED, \"B\" to Color.PURPLE, \"C\" to Color.BLUE)\n * }\n * // Set alpha (transparency) of the line\n * alpha = 0.7\n * }\n * }\n * ```\n */"} {"signature":"@ ContractsDsl @ ExperimentalContracts public infix fun implies ( booleanExpression : Boolean ) : ConditionalEffect","body":"@ ContractsDsl @ ExperimentalContracts public infix fun implies ( booleanExpression : Boolean ) : ConditionalEffect","docstring":"/**\n * Specifies that this effect, when observed, guarantees [booleanExpression] to be true.\n *\n * Note: [booleanExpression] can accept only a subset of boolean expressions,\n * where a function parameter or receiver (`this`) undergoes\n * - true of false checks, in case if the parameter or receiver is `Boolean`;\n * - null-checks (`== null`, `!= null`);\n * - instance-checks (`is`, `!is`);\n * - a combination of the above with the help of logic operators (`&&`, `||`, `!`).\n */"} {"signature":"override fun create ( parcel : Parcel ) : Pair < F , S >","body":"= firstParceler . create ( parcel ) to secondParceler . create ( parcel )","docstring":"/**\n * Reads the [T] instance state from the [parcel], constructs the new [T] instance and returns it.\n */"} {"signature":"override fun Pair < F , S > . write ( parcel : Parcel , flags : Int )","body":"{ with ( firstParceler ) { this@write . first . write ( parcel , ) } with ( secondParceler ) { this@write . second . write ( parcel , ) } }","docstring":"/**\n * Writes the [T] instance state to the [parcel].\n */"} {"signature":"override fun create ( parcel : Parcel ) : Int","body":"= parcel . readInt ( )","docstring":"/**\n * Reads the [T] instance state from the [parcel], constructs the new [T] instance and returns it.\n */"} {"signature":"override fun Int . write ( parcel : Parcel , flags : Int )","body":"{ parcel . writeInt ( this ) }","docstring":"/**\n * Writes the [T] instance state to the [parcel].\n */"} {"signature":"@ Suppress ( \"\" ) fun pom ( configurator : PomConfigurator )","body":"{ _pomConfigurator = configurator }","docstring":"/**\n * Setup additional configuration of Maven POM file.\n * You can use extensions defined in `pomUtil.kt` file.\n */"} {"signature":"@ Suppress ( \"\" ) fun pom ( configurator : Closure < in MavenPom > )","body":"{ _pomConfigurator = PomConfigurator { project . configure ( this , configurator ) } }","docstring":"/**\n * Setup additional configuration of Maven POM file.\n * You can use extensions defined in `pomUtil.kt` file.\n */"} {"signature":"@ Suppress ( \"\" ) fun signingCredentials ( ) : SigningCredentials ?","body":"= _signingCredentials","docstring":"/**\n * Returns settings of artifacts signing\n */"} {"signature":"@ Suppress ( \"\" ) fun signingCredentials ( key : String ? , privateKey : String ? , keyPassphrase : String ? )","body":"{ if ( key == null || privateKey == null || keyPassphrase == null ) return _signingCredentials = SigningCredentials ( key , privateKey , keyPassphrase ) }","docstring":"/**\n * Setup artifacts signing\n */"} {"signature":"@ Suppress ( \"\" ) fun sonatypeSettings ( ) : SonatypeSettings ?","body":"= _sonatypeSettings","docstring":"/**\n * Returns settings of publishing to Sonatype\n */"} {"signature":"@ Suppress ( \"\" ) fun sonatypeSettings ( username : String ? , password : String ? , repositoryDescription : String )","body":"{ _sonatypeSettings = SonatypeSettings ( username , password , repositoryDescription ) applyNexusPlugin ( _sonatypeSettings ! ! , defaultGroup . orNull ) }","docstring":"/**\n * Setup publishing to Sonatype repository\n */"} {"signature":"@ Suppress ( \"\" ) fun publication ( publication : ArtifactPublication )","body":"{ project . afterAllParentsEvaluate { addPublication ( publication ) } }","docstring":"/**\n * Adds a publication for this project\n */"} {"signature":"@ Suppress ( \"\" ) fun publication ( configuration : Action < in ArtifactPublication > )","body":"{ val res = ArtifactPublication ( project ) configuration ( res ) publication ( res ) }","docstring":"/**\n * Adds and configures a publication for this project\n */"} {"signature":"@ Suppress ( \"\" ) fun publication ( configuration : Closure < in ArtifactPublication > )","body":"{ val res = ArtifactPublication ( project ) project . configure ( res , configuration ) publication ( res ) }","docstring":"/**\n * Adds and configures a publication for this project\n */"} {"signature":"@ Suppress ( \"\" ) fun localRepositories ( configure : Action < in RepositoryHandler > )","body":"{ _repositoryConfigurators . add ( configure ) }","docstring":"/**\n * Configure repositories publishing to that will be bound to [PUBLISH_LOCAL_TASK] task\n */"} {"signature":"@ Suppress ( \"\" ) fun localRepositories ( configure : Closure < in RepositoryHandler > )","body":"{ _repositoryConfigurators . add { project . configure ( this as Any , configure ) } }","docstring":"/**\n * Configure repositories publishing to that will be bound to [PUBLISH_LOCAL_TASK] task\n */"} {"signature":"@ Suppress ( \"\" ) fun RepositoryHandler . localMavenRepository ( name : String ? , path : Any ) : MavenArtifactRepository","body":"{ return maven { name ? . let { this . name = it } this . url = project . file ( path ) . toURI ( ) } }","docstring":"/**\n * Adds Maven repository with specified [name] and local [path]\n */"} {"signature":"@ Suppress ( \"\" ) fun RepositoryHandler . localMavenRepository ( path : Any )","body":"= localMavenRepository ( null , path )","docstring":"/**\n * Adds Maven repository with [path] and default name\n */"} {"signature":"@ Suppress ( \"\" ) fun RepositoryHandler . defaultLocalMavenRepository ( )","body":"= localMavenRepository ( \"\" , project . findProperty ( \"\" ) ? : project . buildDir . toPath ( ) . resolve ( \"\" ) )","docstring":"/**\n * Adds Maven repository with name \"Local\".\n * Path of this repository is taken from project's property `localPublicationsRepo` if it is set,\n * and to \"$buildDir/artifacts/maven\" if it's not set.\n */"} {"signature":"fun < Function : FunctionHandle > findConcreteSuperDeclaration ( function : Function ) : Function ?","body":"{ require ( ! function . isAbstract ) { \"\" } if ( function . isDeclaration ) return function val result = findAllReachableDeclarations ( function ) val toRemove = HashSet < Function > ( ) for ( declaration in result ) { val reachable = findAllReachableDeclarations ( declaration ) reachable . remove ( declaration ) toRemove . addAll ( reachable ) } result . removeAll ( toRemove ) val concreteRelevantDeclarations = result . filter { ! it . isAbstract && it . mayBeUsedAsSuperImplementation } if ( concreteRelevantDeclarations . size != ) { if ( ! function . mightBeIncorrectCode ) { error ( \"\" ) } else { return null } } return concreteRelevantDeclarations [ ] }","docstring":"/**\n * Given a concrete function, finds an implementation (a concrete declaration) of this function in the supertypes.\n * The implementation is guaranteed to exist because if it wouldn't, the given function would've been abstract\n */"} {"signature":"fun < T : Number , E : Number > corrcoef ( x : KtNDArray < T > , y : KtNDArray < E > ? = null , rowvar : Boolean = true ) : KtNDArray < Double >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( x , y ? : None . none , rowvar ) )","docstring":"/**\n * Return Pearson product-moment correlation coefficients.\n */"} {"signature":"fun < T : Number , E : Number > correlate ( a : KtNDArray < T > , v : KtNDArray < E > , mode : ModeCorr = ModeCorr . VALID ) : KtNDArray < Double >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( a , v , mode . str ) )","docstring":"/**\n * Cross-correlation of two 1-dimensional sequences.\n */"} {"signature":"fun < T : Number , E : Number > cov ( m : KtNDArray < T > , y : KtNDArray < E > ? = null , rowvar : Boolean = true , bias : Boolean = false , ddof : Int ? = null , fweights : IntArray ? = null , aweights : IntArray ? = null ) : KtNDArray < Double >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( m , y ? : None . none , rowvar , bias , ddof ? : None . none , fweights ? : None . none , aweights ? : None . none ) )","docstring":"/**\n * Estimate a covariance matrix, given data and weights.\n */"} {"signature":"public fun exclude ( vararg classes : KClass < * > )","body":"public fun exclude ( vararg classes : KClass < * > )","docstring":"/**\n * Skip given [classes] during recursive (dfs) traversal\n */"} {"signature":"public fun exclude ( vararg properties : KProperty < * > )","body":"public fun exclude ( vararg properties : KProperty < * > )","docstring":"/**\n * Skip given [properties] during recursive (dfs) traversal\n */"} {"signature":"public fun preserve ( vararg classes : KClass < * > )","body":"public fun preserve ( vararg classes : KClass < * > )","docstring":"/**\n * Store given [classes] in ValueColumns without transformation into ColumnGroups or FrameColumns\n */"} {"signature":"public fun preserve ( vararg properties : KProperty < * > )","body":"public fun preserve ( vararg properties : KProperty < * > )","docstring":"/**\n * Store given [properties] in ValueColumns without transformation into ColumnGroups or FrameColumns\n */"} {"signature":"fun x ( )","body":"{ }","docstring":"/**\n * [AbstractCollection]\n */"} {"signature":"public suspend fun < T > awaitAll ( vararg deferreds : Deferred < T > ) : List < T >","body":"= if ( deferreds . isEmpty ( ) ) emptyList ( ) else AwaitAll ( deferreds ) . await ( )","docstring":"/**\n * Awaits for completion of given deferred values without blocking a thread and resumes normally with the list of values\n * when all deferred computations are complete or resumes with the first thrown exception if any of computations\n * complete exceptionally including cancellation.\n *\n * This function is **not** equivalent to `deferreds.map { it.await() }` which fails only when it sequentially\n * gets to wait for the failing deferred, while this `awaitAll` fails immediately as soon as any of the deferreds fail.\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 */"} {"signature":"public suspend fun < T > Collection < Deferred < T > > . awaitAll ( ) : List < T >","body":"= if ( isEmpty ( ) ) emptyList ( ) else AwaitAll ( toTypedArray ( ) ) . await ( )","docstring":"/**\n * Awaits for completion of given deferred values without blocking a thread and resumes normally with the list of values\n * when all deferred computations are complete or resumes with the first thrown exception if any of computations\n * complete exceptionally including cancellation.\n *\n * This function is **not** equivalent to `this.map { it.await() }` which fails only when it sequentially\n * gets to wait for the failing deferred, while this `awaitAll` fails immediately as soon as any of the deferreds fail.\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 */"} {"signature":"public suspend fun joinAll ( vararg jobs : Job ) : Unit","body":"= jobs . forEach { it . join ( ) }","docstring":"/**\n * Suspends current coroutine until all given jobs are complete.\n * This method is semantically equivalent to joining all given jobs one by one with `jobs.forEach { it.join() }`.\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 */"} {"signature":"public suspend fun Collection < Job > . joinAll ( ) : Unit","body":"= forEach { it . join ( ) }","docstring":"/**\n * Suspends current coroutine until all given jobs are complete.\n * This method is semantically equivalent to joining all given jobs one by one with `forEach { it.join() }`.\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 */"} {"signature":"private fun BasicClassInfo . isInaccessible ( ) : Boolean","body":"{ return when { isKotlinClass -> when ( kotlinClassHeader ! ! . kind ) { CLASS -> isPrivate || isLocal || isAnonymous || isSynthetic SYNTHETIC_CLASS -> true else -> false } else -> isPrivate || isLocal || isAnonymous || isSynthetic } }","docstring":"/**\n * Returns `true` if this class is inaccessible, and `false` otherwise (or if we don't know).\n *\n * A class is inaccessible if it can't be referenced from other source files (and therefore any changes in an inaccessible class will\n * not require recompilation of other source files).\n */"} {"signature":"private fun snapshotKotlinClass ( classFile : ClassFileWithContents , granularity : ClassSnapshotGranularity ) : KotlinClassSnapshot","body":"{ val kotlinClassInfo = KotlinClassInfo . createFrom ( classFile . classInfo . classId , classFile . classInfo . kotlinClassHeader ! ! , classFile . contents ) val classId = kotlinClassInfo . classId val classAbiHash = KotlinClassInfoExternalizer . toByteArray ( kotlinClassInfo ) . hashToLong ( ) val classMemberLevelSnapshot = kotlinClassInfo . takeIf { granularity == CLASS_MEMBER_LEVEL } return when ( kotlinClassInfo . classKind ) { CLASS -> RegularKotlinClassSnapshot ( classId , classAbiHash , classMemberLevelSnapshot , supertypes = classFile . classInfo . supertypes , companionObjectName = kotlinClassInfo . companionObject ? . shortClassName ? . identifier , constantsInCompanionObject = kotlinClassInfo . constantsInCompanionObject ) FILE_FACADE , MULTIFILE_CLASS_PART -> PackageFacadeKotlinClassSnapshot ( classId , classAbiHash , classMemberLevelSnapshot , packageMemberNames = ( kotlinClassInfo . protoData as PackagePartProtoData ) . getNonPrivateMembers ( ) . toSet ( ) ) MULTIFILE_CLASS -> MultifileClassKotlinClassSnapshot ( classId , classAbiHash , classMemberLevelSnapshot , constantNames = kotlinClassInfo . extraInfo . constantSnapshots . keys ) SYNTHETIC_CLASS -> error ( \"\" ) UNKNOWN -> error ( \"\" ) } }","docstring":"/** Computes a [KotlinClassSnapshot] of the given Kotlin class. */"} {"signature":"private fun snapshotJavaClass ( classFile : ClassFileWithContents , granularity : ClassSnapshotGranularity ) : JavaClassSnapshot","body":"{ val classNode = ClassNode ( ) val classReader = ClassReader ( classFile . contents ) val selectiveClassVisitor = SelectiveClassVisitor ( classNode , shouldVisitField = { _ : JvmMemberSignature . Field , isPrivate : Boolean , _ : Boolean -> ! isPrivate } , shouldVisitMethod = { _ : JvmMemberSignature . Method , isPrivate : Boolean -> ! isPrivate } ) classReader . accept ( selectiveClassVisitor , ClassReader . SKIP_CODE ) sortClassMembers ( classNode ) val classMemberLevelSnapshot = if ( granularity == CLASS_MEMBER_LEVEL ) { JavaClassMemberLevelSnapshot ( classAbiExcludingMembers = JavaElementSnapshot ( classNode . name , snapshotClassExcludingMembers ( classNode ) ) , fieldsAbi = classNode . fields . map { JavaElementSnapshot ( it . name , snapshotField ( it ) ) } , methodsAbi = classNode . methods . map { JavaElementSnapshot ( it . name , snapshotMethod ( it , classNode . version ) ) } ) } else { null } val classAbiHash = if ( granularity == CLASS_MEMBER_LEVEL ) { JavaClassMemberLevelSnapshotExternalizer . toByteArray ( classMemberLevelSnapshot ! ! ) . hashToLong ( ) } else { snapshotClass ( classNode ) } return JavaClassSnapshot ( classId = classFile . classInfo . classId , classAbiHash = classAbiHash , classMemberLevelSnapshot = classMemberLevelSnapshot , supertypes = classFile . classInfo . supertypes ) }","docstring":"/** Computes a [JavaClassSnapshot] of the given Java class. */"} {"signature":"fun getUnixStyleRelativePaths ( filter : ( unixStyleRelativePath : String , isDirectory : Boolean ) -> Boolean ) : List < String >","body":"fun getUnixStyleRelativePaths ( filter : ( unixStyleRelativePath : String , isDirectory : Boolean ) -> Boolean ) : List < String >","docstring":"/**\n * Returns the Unix-style relative paths of all entries under the containing directory or jar which satisfy the given [filter].\n *\n * The paths are in Unix style and are sorted to ensure deterministic results across platforms.\n *\n * If a jar has duplicate entries, only unique paths are kept in the returned list (similar to the way the compiler selects the first\n * class if the classpath has duplicate classes).\n */"} {"signature":"public fun < T : Any > rxSingle ( context : CoroutineContext = EmptyCoroutineContext , block : suspend CoroutineScope . ( ) -> T ) : Single < T >","body":"{ require ( context [ Job ] === null ) { \"\" + \"\" } return rxSingleInternal ( GlobalScope , context , block ) }","docstring":"/**\n * Creates cold [single][Single] that will run a given [block] in a coroutine and emits its result.\n * Every time the returned observable is subscribed, it starts a new coroutine.\n * Unsubscribing cancels running coroutine.\n * Coroutine context can be specified with [context] argument.\n * If the context does not have any dispatcher nor any other [ContinuationInterceptor], then [Dispatchers.Default] is used.\n * Method throws [IllegalArgumentException] if provided [context] contains a [Job] instance.\n */"} {"signature":"@ Deprecated ( message = \"\" , level = DeprecationLevel . HIDDEN , replaceWith = ReplaceWith ( \"\" ) ) public fun < T : Any > CoroutineScope . rxSingle ( context : CoroutineContext = EmptyCoroutineContext , block : suspend CoroutineScope . ( ) -> T ) : Single < T >","body":"= rxSingleInternal ( this , context , block )","docstring":"/** @suppress */"} {"signature":"fun kotlinJvmTestProject ( init : ( @ AnalysisTestDslMarker KotlinJvmTestProject ) . ( ) -> Unit ) : TestProject","body":"{ val testData = KotlinJvmTestProject ( ) testData . init ( ) return testData }","docstring":"/**\n * Creates a single-target Kotlin/JVM test project that only has Kotlin source code.\n *\n * See [javaTestProject] and [mixedJvmTestProject] if you want to check interoperability\n * with other JVM languages.\n *\n * By default, the sources are put in `/src/main/kotlin`, and the JVM version of Kotlin's\n * standard library is available on classpath.\n *\n * See [parse] and [useServices] functions to learn how to run Dokka with this project as input.\n *\n * @sample org.jetbrains.dokka.analysis.test.jvm.kotlin.SampleKotlinJvmAnalysisTest.sample\n */"} {"signature":"fun javaTestProject ( init : ( @ AnalysisTestDslMarker JavaTestProject ) . ( ) -> Unit ) : TestProject","body":"{ val testData = JavaTestProject ( ) testData . init ( ) return testData }","docstring":"/**\n * Creates a Java-only test project.\n *\n * This can be used to test Dokka's Java support or specific\n * corner cases related to parsing Java sources.\n *\n * By default, the sources are put in `/src/main/java`. No Kotlin source code is allowed.\n *\n * See [parse] and [useServices] functions to learn how to run Dokka with this project as input.\n *\n * @sample org.jetbrains.dokka.analysis.test.jvm.java.SampleJavaAnalysisTest.sample\n */"} {"signature":"fun mixedJvmTestProject ( init : ( @ AnalysisTestDslMarker MixedJvmTestProject ) . ( ) -> Unit ) : TestProject","body":"{ val testProject = MixedJvmTestProject ( ) testProject . init ( ) return testProject }","docstring":"/**\n * Creates a project where a number of JVM language sources are allowed,\n * like Java and Kotlin sources co-existing in the same source directory.\n *\n * This can be used to test interoperability between JVM languages.\n *\n * By default, this project consists of a single \"jvm\" source set, which has two source root directories:\n * * `/src/main/kotlin`\n * * `/src/main/java`\n *\n * See [parse] and [useServices] functions to learn how to run Dokka with this project as input.\n *\n * @sample org.jetbrains.dokka.analysis.test.jvm.mixed.SampleMixedJvmAnalysisTest.sample\n */"} {"signature":"@ Test fun testContextElement ( )","body":"= runTest { assertFailsWith < IllegalStateException > { withContext ( StandardTestDispatcher ( ) ) { } } }","docstring":"/** Tests that `TestCoroutineScheduler` attempts to detect if there are several instances of it. */"} {"signature":"@ Test fun testAdvanceTimeByDoesNotRunCurrent ( )","body":"= runTest { var entered = false launch { delay ( ) entered = true } testScheduler . advanceTimeBy ( . milliseconds ) assertFalse ( entered ) testScheduler . runCurrent ( ) assertTrue ( entered ) }","docstring":"/** Tests that, as opposed to [DelayController.advanceTimeBy] or [TestCoroutineScope.advanceTimeBy],\n * [TestCoroutineScheduler.advanceTimeBy] doesn't run the tasks scheduled at the target moment. */"} {"signature":"@ Test fun testAdvanceTimeByWithNegativeDelay ( )","body":"{ val scheduler = TestCoroutineScheduler ( ) assertFailsWith < IllegalArgumentException > { scheduler . advanceTimeBy ( ( - ) . milliseconds ) } }","docstring":"/** Tests that [TestCoroutineScheduler.advanceTimeBy] doesn't accept negative delays. */"} {"signature":"@ Test fun testAdvanceTimeByEnormousDelays ( )","body":"= forTestDispatchers { assertRunsFast { with ( TestScope ( it ) ) { launch { val initialDelay = delay ( initialDelay ) assertEquals ( initialDelay , currentTime ) var enteredInfinity = false launch { delay ( Long . MAX_VALUE - ) assertEquals ( Long . MAX_VALUE , currentTime ) enteredInfinity = true } var enteredNearInfinity = false launch { delay ( Long . MAX_VALUE - initialDelay - ) assertEquals ( Long . MAX_VALUE - , currentTime ) enteredNearInfinity = true } testScheduler . advanceTimeBy ( Duration . INFINITE ) assertFalse ( enteredInfinity ) assertTrue ( enteredNearInfinity ) assertEquals ( Long . MAX_VALUE , currentTime ) testScheduler . runCurrent ( ) assertTrue ( enteredInfinity ) } testScheduler . advanceUntilIdle ( ) } } }","docstring":"/** Tests that if [TestCoroutineScheduler.advanceTimeBy] encounters an arithmetic overflow, all the tasks scheduled\n * until the moment [Long.MAX_VALUE] get run. */"} {"signature":"@ Test fun testAdvanceTimeBy ( )","body":"= runTest { assertRunsFast { var stage = launch { delay ( ) assertEquals ( , currentTime ) stage = delay ( ) assertEquals ( , currentTime ) stage = delay ( ) assertEquals ( , currentTime ) stage = } assertEquals ( , stage ) assertEquals ( , currentTime ) advanceTimeBy ( . seconds ) assertEquals ( , stage ) assertEquals ( , currentTime ) advanceTimeBy ( . milliseconds ) assertEquals ( , stage ) assertEquals ( , currentTime ) } }","docstring":"/** Tests the basic functionality of [TestCoroutineScheduler.advanceTimeBy]. */"} {"signature":"@ Test fun testRunCurrent ( )","body":"= runTest { var stage = launch { delay ( ) ++ stage delay ( ) stage += } launch { delay ( ) ++ stage delay ( ) stage += } testScheduler . advanceTimeBy ( . milliseconds ) assertEquals ( , stage ) runCurrent ( ) assertEquals ( , stage ) testScheduler . advanceTimeBy ( . milliseconds ) assertEquals ( , stage ) runCurrent ( ) assertEquals ( , stage ) }","docstring":"/** Tests the basic functionality of [TestCoroutineScheduler.runCurrent]. */"} {"signature":"@ Test fun testRunCurrentNotDrainingQueue ( )","body":"= forTestDispatchers { assertRunsFast { val scheduler = it . scheduler val scope = TestScope ( it ) var stage = scope . launch { delay ( SLOW ) launch { delay ( SLOW ) stage = } scheduler . advanceTimeBy ( SLOW . milliseconds ) stage = } scheduler . advanceTimeBy ( SLOW . milliseconds ) assertEquals ( , stage ) scheduler . runCurrent ( ) assertEquals ( , stage ) scheduler . runCurrent ( ) assertEquals ( , stage ) } }","docstring":"/** Tests that [TestCoroutineScheduler.runCurrent] will not run new tasks after the current time has advanced. */"} {"signature":"@ Test fun testNestedAdvanceUntilIdle ( )","body":"= forTestDispatchers { assertRunsFast { val scheduler = it . scheduler val scope = TestScope ( it ) var executed = false scope . launch { launch { delay ( SLOW ) executed = true } scheduler . advanceUntilIdle ( ) } scheduler . advanceUntilIdle ( ) assertTrue ( executed ) } }","docstring":"/** Tests that [TestCoroutineScheduler.advanceUntilIdle] doesn't hang when itself running in a scheduler task. */"} {"signature":"@ Test fun testYield ( )","body":"= forTestDispatchers { val scope = TestScope ( it ) var stage = scope . launch { yield ( ) assertEquals ( , stage ) stage = } scope . launch { yield ( ) assertEquals ( , stage ) stage = } assertEquals ( , stage ) stage = scope . runCurrent ( ) }","docstring":"/** Tests [yield] scheduling tasks for future execution and not executing immediately. */"} {"signature":"@ Test fun testDelaysPriority ( )","body":"= forTestDispatchers { val scope = TestScope ( it ) var lastMeasurement = fun checkTime ( time : Long ) { assertTrue ( lastMeasurement < time ) assertEquals ( time , scope . currentTime ) lastMeasurement = scope . currentTime } scope . launch { launch { delay ( ) checkTime ( ) val deferred = async { delay ( ) checkTime ( ) } delay ( ) checkTime ( ) deferred . await ( ) delay ( ) checkTime ( ) } launch { delay ( ) checkTime ( ) } launch { delay ( ) checkTime ( ) delay ( ) checkTime ( ) } delay ( ) } scope . advanceUntilIdle ( ) checkTime ( ) }","docstring":"/** Tests that dispatching the delayed tasks is ordered by their waking times. */"} {"signature":"@ Test fun testSmallTimeouts ( )","body":"= forTestDispatchers { val scope = TestScope ( it ) scope . checkTimeout ( true ) { val half = SLOW / delay ( half ) delay ( SLOW - half ) } }","docstring":"/** Tests that timeouts get triggered. */"} {"signature":"@ Test fun testLargeTimeouts ( )","body":"= forTestDispatchers { val scope = TestScope ( it ) scope . checkTimeout ( false ) { val half = SLOW / delay ( half ) delay ( SLOW - half - ) } }","docstring":"/** Tests that timeouts don't get triggered if the code finishes in time. */"} {"signature":"@ Test fun testSmallAsynchronousTimeouts ( )","body":"= forTestDispatchers { val scope = TestScope ( it ) val deferred = CompletableDeferred < Unit > ( ) scope . launch { val half = SLOW / delay ( half ) delay ( SLOW - half ) deferred . complete ( Unit ) } scope . checkTimeout ( true ) { deferred . await ( ) } }","docstring":"/** Tests that timeouts get triggered if the code fails to finish in time asynchronously. */"} {"signature":"@ Test fun testLargeAsynchronousTimeouts ( )","body":"= forTestDispatchers { val scope = TestScope ( it ) val deferred = CompletableDeferred < Unit > ( ) scope . launch { val half = SLOW / delay ( half ) delay ( SLOW - half - ) deferred . complete ( Unit ) } scope . checkTimeout ( false ) { deferred . await ( ) } }","docstring":"/** Tests that timeouts don't get triggered if the code finishes in time, even if it does so asynchronously. */"} {"signature":"inline fun < T > assertRunsFast ( timeout : Duration , block : ( ) -> T ) : T","body":"{ val result : T val elapsed = TimeSource . Monotonic . measureTime { result = block ( ) } assertTrue ( \"\" ) { elapsed < timeout } return result }","docstring":"/**\n * Asserts that a block completed within [timeout].\n */"} {"signature":"inline fun < T > assertRunsFast ( block : ( ) -> T ) : T","body":"= assertRunsFast ( . seconds , block )","docstring":"/**\n * Asserts that a block completed within two seconds.\n */"} {"signature":"fun expect ( index : Int )","body":"fun expect ( index : Int )","docstring":"/** Expect the next action to be [index] in order. */"} {"signature":"fun finish ( index : Int )","body":"fun finish ( index : Int )","docstring":"/** Expect this action to be final, with the given [index]. */"} {"signature":"fun expectUnreached ( )","body":"fun expectUnreached ( )","docstring":"/** * Asserts that this line is never executed. */"} {"signature":"fun checkFinishCall ( allowNotUsingExpect : Boolean = true )","body":"fun checkFinishCall ( allowNotUsingExpect : Boolean = true )","docstring":"/**\n * Checks that [finish] was called.\n *\n * By default, it is allowed to not call [finish] if [expect] was not called.\n * This is useful for tests that don't check the ordering of events.\n * When [allowNotUsingExpect] is set to `false`, it is an error to not call [finish] in any case.\n */"} {"signature":"fun hasError ( ) : Boolean","body":"fun hasError ( ) : Boolean","docstring":"/**\n * Returns `true` if errors were logged in the test.\n */"} {"signature":"fun reportError ( error : Throwable )","body":"fun reportError ( error : Throwable )","docstring":"/**\n * Directly reports an error to the test catching facilities.\n */"} {"signature":"internal expect fun lastResortReportException ( error : Throwable )","body":"internal expect fun lastResortReportException ( error : Throwable )","docstring":"/**\n * Reports an error *somehow* so that it doesn't get completely forgotten.\n */"} {"signature":"public inline fun ErrorCatching . check ( value : Boolean , lazyMessage : ( ) -> Any )","body":"{ if ( ! value ) error ( lazyMessage ( ) ) }","docstring":"/**\n * Throws [IllegalStateException] when `value` is false, like `check` in stdlib, but also ensures that the\n * test will not complete successfully even if this exception is consumed somewhere in the test.\n */"} {"signature":"fun ErrorCatching . error ( message : Any , cause : Throwable ? = null ) : Nothing","body":"{ throw IllegalStateException ( message . toString ( ) , cause ) . also { reportError ( it ) } }","docstring":"/**\n * Throws [IllegalStateException], like `error` in stdlib, but also ensures that the test will not\n * complete successfully even if this exception is consumed somewhere in the test.\n */"} {"signature":"public fun reset ( )","body":"{ orderedExecutionDelegate . checkFinishCall ( ) orderedExecutionDelegate = OrderedExecution . Impl ( ) }","docstring":"/** Resets counter and finish flag. Workaround for parametrized tests absence in common */"} {"signature":"public fun labels ( zeroIndexed : Boolean = true ) : Map < Int , String >","body":"{ return when ( this ) { V1k -> if ( ! zeroIndexed ) toOneIndexed ( imagenetLabels ) else imagenetLabels V1001 -> if ( ! zeroIndexed ) toOneIndexed ( addBackgroundLabel ( imagenetLabels ) ) else addBackgroundLabel ( imagenetLabels ) } }","docstring":"/**\n * Returns a map of Imagenet labels according to the [Imagenet] version.\n * @param [zeroIndexed] if true, then labels are indexed from 0, otherwise from 1.\n */"} {"signature":"internal fun Project . registerKotlinPluginExtensions ( )","body":"{ KotlinProjectSetupAction . extensionPoint . apply { register ( project , AddNpmDependencyExtensionProjectSetupAction ) register ( project , RegisterBuildKotlinToolingMetadataTask ) register ( project , KotlinToolingDiagnosticsSetupAction ) register ( project , SyncLanguageSettingsWithKotlinExtensionSetupAction ) register ( project , UserDefinedAttributesSetupAction ) register ( project , CustomizeKotlinDependenciesSetupAction ) register ( project , AddKotlinPlatformIntegersSupportLibrary ) register ( project , SetupKotlinNativePlatformDependenciesForLegacyImport ) if ( isJvm || isMultiplatform ) { register ( project , ScriptingGradleSubpluginSetupAction ) } if ( isMultiplatform ) { register ( project , ApplyJavaBasePluginSetupAction ) register ( project , DeprecatedMppGradlePropertiesMigrationSetupAction ) register ( project , KotlinMultiplatformTargetPresetAction ) register ( project , KotlinMultiplatformSourceSetSetupAction ) register ( project , MultiplatformBuildStatsReportSetupAction ) register ( project , KotlinMetadataTargetSetupAction ) register ( project , KotlinArtifactsExtensionSetupAction ) register ( project , MultiplatformPublishingSetupAction ) register ( project , LanguageSettingsSetupAction ) register ( project , GlobalProjectStructureMetadataStorageSetupAction ) register ( project , IdeMultiplatformImportSetupAction ) register ( project , IdeResolveDependenciesTaskSetupAction ) register ( project , CInteropCommonizedCInteropApiElementsConfigurationsSetupAction ) register ( project , XcodeVersionSetupAction ) register ( project , AddBuildListenerForXCodeSetupAction ) register ( project , CreateFatFrameworksSetupAction ) register ( project , KotlinRegisterCompilationArchiveTasksExtension ) register ( project , IdeMultiplatformImportActionSetupAction ) register ( project , KotlinLLDBScriptSetupAction ) register ( project , ExcludeDefaultPlatformDependenciesFromKotlinNativeCompileTasks ) register ( project , SetupConsistentMetadataDependenciesResolution ) register ( project , RegisterMultiplatformResourcesPublicationExtensionAction ) register ( project , SetUpMultiplatformJvmResourcesPublicationAction ) register ( project , SetUpMultiplatformAndroidAssetsAndResourcesPublicationAction ) } } KotlinTargetSideEffect . extensionPoint . apply { register ( project , CreateDefaultCompilationsSideEffect ) register ( project , CreateTargetConfigurationsSideEffect ) register ( project , NativeForwardImplementationToApiElementsSideEffect ) register ( project , CreateArtifactsSideEffect ) register ( project , ConfigureBuildSideEffect ) register ( project , KotlinNativeConfigureBinariesSideEffect ) register ( project , CreateDefaultTestRunSideEffect ) register ( project , ConfigureFrameworkExportSideEffect ) register ( project , SetupCInteropApiElementsConfigurationSideEffect ) register ( project , SetupEmbedAndSignAppleFrameworkTaskSideEffect ) } KotlinCompilationSideEffect . extensionPoint . apply { register ( project , KotlinCreateSourcesJarTaskSideEffect ) register ( project , KotlinCreateResourcesTaskSideEffect ) register ( project , KotlinCreateLifecycleTasksSideEffect ) register ( project , KotlinCreateNativeCompileTasksSideEffect ) register ( project , KotlinCompilationProcessorSideEffect ) register ( project , KotlinCreateNativeCInteropTasksSideEffect ) register ( project , KotlinCreateCompilationArchivesTask ) register ( project , SetupKotlinNativePlatformDependenciesAndStdlib ) } KotlinTargetArtifact . extensionPoint . apply { register ( project , KotlinMetadataArtifact ) register ( project , KotlinLegacyCompatibilityMetadataArtifact ) register ( project , KotlinLegacyMetadataArtifact ) register ( project , KotlinJvmJarArtifact ) register ( project , KotlinJsKlibArtifact ) register ( project , KotlinNativeKlibArtifact ) register ( project , KotlinNativeHostSpecificMetadataArtifact ) } KotlinGradleProjectChecker . extensionPoint . apply { register ( project , CommonMainOrTestWithDependsOnChecker ) register ( project , DeprecatedKotlinNativeTargetsChecker ) register ( project , MissingNativeStdlibChecker ) register ( project , UnusedSourceSetsChecker ) register ( project , AndroidSourceSetLayoutV1SourceSetsNotFoundChecker ) register ( project , AndroidPluginWithoutAndroidTargetChecker ) register ( project , NoKotlinTargetsDeclaredChecker ) register ( project , DisabledCinteropCommonizationInHmppProjectChecker ) register ( project , DisabledNativeTargetsChecker ) register ( project , JsEnvironmentChecker ) register ( project , PreHmppDependenciesUsageChecker ) register ( project , ExperimentalTryNextUsageChecker ) register ( project , KotlinSourceSetTreeDependsOnMismatchChecker ) register ( project , PlatformSourceSetConventionsChecker ) register ( project , AndroidMainSourceSetConventionsChecker ) register ( project , IosSourceSetConventionChecker ) register ( project , KotlinTargetAlreadyDeclaredChecker ) register ( project , InternalGradlePropertiesUsageChecker ) register ( project , WasmSourceSetsNotFoundChecker ) register ( project , DuplicateSourceSetChecker ) register ( project , CInteropInputChecker ) register ( project , IncorrectCompileOnlyDependenciesChecker ) register ( project , GradleDeprecatedPropertyChecker ) if ( isMultiplatform ) { register ( project , KotlinMultiplatformAndroidGradlePluginCompatibilityChecker ) register ( project , MultipleSourceSetRootsInCompilationChecker ) } } }","docstring":"/**\n * Active Extensions (using the [KotlinGradlePluginExtensionPoint] infrastructure) will be registered here by the Kotlin Gradle Plugin.\n */"} {"signature":"public fun getRowsSubsetForRendering ( dataFrameLike : Any ? , startIdx : Int , endIdx : Int ) : DisableRowsLimitWrapper","body":"= when ( dataFrameLike ) { null -> throw IllegalArgumentException ( \"\" ) else -> getRowsSubsetForRendering ( convertToDataFrame ( dataFrameLike ) , startIdx , endIdx ) }","docstring":"/**\n * Returns a subset of rows from the given dataframe for rendering.\n * It's used for example for dynamic pagination in Kotlin Notebook Plugin.\n */"} {"signature":"public fun getRowsSubsetForRendering ( df : AnyFrame , startIdx : Int , endIdx : Int ) : DisableRowsLimitWrapper","body":"= DisableRowsLimitWrapper ( df [ startIdx ..< endIdx ] )","docstring":"/**\n * Returns a subset of rows from the given dataframe for rendering.\n * It's used for example for dynamic pagination in Kotlin Notebook Plugin.\n */"} {"signature":"public fun sortByColumns ( dataFrameLike : Any ? , columnPaths : List < List < String > > , desc : List < Boolean > ) : AnyFrame","body":"= when ( dataFrameLike ) { null -> throw IllegalArgumentException ( \"\" ) else -> sortByColumns ( convertToDataFrame ( dataFrameLike ) , columnPaths , desc ) }","docstring":"/**\n * Sorts a dataframe-like object by multiple columns.\n *\n * @param dataFrameLike The dataframe-like object to sort.\n * @param columnPaths The list of columns to sort by. Each element in the list represents a column path\n * @param desc The list of booleans indicating whether each column should be sorted in descending order.\n * The size of this list should be the same as the size of the `columns` list.\n *\n * @throws IllegalArgumentException if `dataFrameLike` is `null`.\n *\n * @return The sorted dataframe.\n */"} {"signature":"public fun sortByColumns ( df : AnyFrame , columnPaths : List < List < String > > , isDesc : List < Boolean > ) : AnyFrame","body":"= df . sortBy { require ( columnPaths . all { it . isNotEmpty ( ) } ) require ( columnPaths . size == isDesc . size ) val sortKeys = columnPaths . map { path -> ColumnPath ( path ) } ( sortKeys zip isDesc ) . map { ( key , desc ) -> if ( desc ) key . desc ( ) else key } . toColumnSet ( ) }","docstring":"/**\n * Sorts the given data frame by the specified columns.\n *\n * @param df The data frame to be sorted.\n * @param columnPaths The paths of the columns to be sorted. Each path is represented as a list of strings.\n * @param isDesc A list of booleans indicating whether each column should be sorted in descending order.\n * The size of this list must be equal to the size of the columnPaths list.\n * @return The sorted data frame.\n */"} {"signature":"public fun convertToDataFrame ( dataframeLike : Any ) : AnyFrame","body":"= when ( dataframeLike ) { is Pivot < * > -> dataframeLike . frames ( ) . toDataFrame ( ) is ReducedGroupBy < * , * > -> dataframeLike . values ( ) is ReducedPivot < * > -> dataframeLike . values ( ) . toDataFrame ( ) is PivotGroupBy < * > -> dataframeLike . frames ( ) is ReducedPivotGroupBy < * > -> dataframeLike . values ( ) is SplitWithTransform < * , * , * > -> dataframeLike . into ( ) is Split < * , * > -> dataframeLike . toDataFrame ( ) is Merge < * , * , * > -> dataframeLike . into ( generateRandomVariationOfColumnName ( \"\" , dataframeLike . df . columnNames ( ) ) ) is Gather < * , * , * , * > -> dataframeLike . into ( generateRandomVariationOfColumnName ( \"\" , dataframeLike . df . columnNames ( ) ) , generateRandomVariationOfColumnName ( \"\" , dataframeLike . df . columnNames ( ) ) ) is Update < * , * > -> dataframeLike . df is Convert < * , * > -> dataframeLike . df is FormattedFrame < * > -> dataframeLike . df is AnyCol -> dataFrameOf ( dataframeLike ) is AnyRow -> dataframeLike . toDataFrame ( ) is GroupBy < * , * > -> dataframeLike . toDataFrame ( ) is AnyFrame -> dataframeLike is DisableRowsLimitWrapper -> dataframeLike . value is MoveClause < * , * > -> dataframeLike . df is RenameClause < * , * > -> dataframeLike . df is ReplaceClause < * , * > -> dataframeLike . df is GroupClause < * , * > -> dataframeLike . into ( generateRandomVariationOfColumnName ( \"\" , dataframeLike . df . columnNames ( ) ) ) is InsertClause < * > -> dataframeLike . at ( ) is FormatClause < * , * > -> dataframeLike . df else -> throw IllegalArgumentException ( \"\" ) }","docstring":"/**\n * Converts [dataframeLike] to [AnyFrame].\n * If [dataframeLike] is already [AnyFrame] then it is returned as is.\n * If it's not possible to convert [dataframeLike] to [AnyFrame] then [IllegalArgumentException] is thrown.\n */"} {"signature":"public fun generateRandomVariationOfColumnName ( preferredName : String , usedNames : List < String > = emptyList ( ) ) : String","body":"= ColumnNameGenerator ( usedNames ) . addUnique ( preferredName )","docstring":"/**\n * Generates a random variation of a column name that is unique among the provided used names.\n *\n * @param preferredName The preferred name for the column.\n * @param usedNames The list of already used column names.\n * @return A unique random variation of the preferred name.\n */"} {"signature":"public fun getKotlinNotebookIDEBuildNumber ( ) : IdeBuildNumber ?","body":"{ val value = System . getProperty ( KTNB_IDE_BUILD_PROP , null ) ? : return null return IdeBuildNumber . fromString ( value ) }","docstring":"/**\n * Retrieves the build number of the Kotlin Notebook IDE.\n *\n * @return The build number of the Kotlin Notebook IDE as an instance of [IdeBuildNumber],\n * or null if the build number is not available.\n */"} {"signature":"public fun exhausted ( ) : Boolean","body":"public fun exhausted ( ) : Boolean","docstring":"/**\n * Returns true if there are no more bytes in this source.\n *\n * The call of this method will block until there are bytes to read or the source is definitely exhausted.\n *\n * @throws IllegalStateException when the source is closed.\n *\n * @sample kotlinx.io.samples.KotlinxIoCoreCommonSamples.exhausted\n */"} {"signature":"public fun require ( byteCount : Long )","body":"public fun require ( byteCount : Long )","docstring":"/**\n * Attempts to fill the buffer with at least [byteCount] bytes of data from the underlying source\n * and throw [EOFException] when the source is exhausted before fulfilling the requirement.\n *\n * If the buffer already contains required number of bytes then there will be no requests to\n * the underlying source.\n *\n * @param byteCount the number of bytes that the buffer should contain.\n *\n * @throws EOFException when the source is exhausted before the required bytes count could be read.\n * @throws IllegalStateException when the source is closed.\n * @throws IllegalArgumentException when [byteCount] is negative.\n *\n * @sample kotlinx.io.samples.KotlinxIoCoreCommonSamples.require\n */"} {"signature":"public fun request ( byteCount : Long ) : Boolean","body":"public fun request ( byteCount : Long ) : Boolean","docstring":"/**\n * Attempts to fill the buffer with at least [byteCount] bytes of data from the underlying source\n * and returns a value indicating if the requirement was successfully fulfilled.\n *\n * `false` value returned by this method indicates that the underlying source was exhausted before\n * filling the buffer with [byteCount] bytes of data.\n *\n * @param byteCount the number of bytes that the buffer should contain.\n *\n * @throws IllegalArgumentException when [byteCount] is negative.\n * @throws IllegalStateException when the source is closed.\n *\n * @sample kotlinx.io.samples.KotlinxIoCoreCommonSamples.request\n */"} {"signature":"public fun readByte ( ) : Byte","body":"public fun readByte ( ) : Byte","docstring":"/**\n * Removes a 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.readByte\n */"} {"signature":"public fun readShort ( ) : Short","body":"public fun readShort ( ) : Short","docstring":"/**\n * Removes two bytes from this source and returns a short integer composed of it according to the big-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.readShort\n */"} {"signature":"public fun readInt ( ) : Int","body":"public fun readInt ( ) : Int","docstring":"/**\n * Removes four bytes from this source and returns an integer composed of it according to the big-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.readInt\n */"} {"signature":"public fun readLong ( ) : Long","body":"public fun readLong ( ) : Long","docstring":"/**\n * Removes eight bytes from this source and returns a long integer composed of it according to the big-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.readLong\n */"} {"signature":"public fun skip ( byteCount : Long )","body":"public fun skip ( byteCount : Long )","docstring":"/**\n * Reads and discards [byteCount] bytes from this source.\n *\n * @param byteCount the number of bytes to be skipped.\n *\n * @throws EOFException when the source is exhausted before the requested number of bytes can be skipped.\n * @throws IllegalArgumentException when [byteCount] is negative.\n * @throws IllegalStateException when the source is closed.\n *\n * @sample kotlinx.io.samples.KotlinxIoCoreCommonSamples.skip\n */"} {"signature":"public fun readAtMostTo ( sink : ByteArray , startIndex : Int = , endIndex : Int = sink . size ) : Int","body":"public fun readAtMostTo ( sink : ByteArray , startIndex : Int = , endIndex : Int = sink . size ) : Int","docstring":"/**\n * Removes up to `endIndex - startIndex` bytes from this source, copies them into [sink] subrange starting at\n * [startIndex] and ending at [endIndex], and returns the number of bytes read, or -1 if this source is exhausted.\n *\n * @param sink the array to which data will be written from this source.\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 IndexOutOfBoundsException when [startIndex] or [endIndex] is out of range of [sink] array indices.\n * @throws IllegalArgumentException when `startIndex > endIndex`.\n * @throws IllegalStateException when the source is closed.\n *\n * @sample kotlinx.io.samples.KotlinxIoCoreCommonSamples.readAtMostToByteArray\n */"} {"signature":"public fun readTo ( sink : RawSink , byteCount : Long )","body":"public fun readTo ( sink : RawSink , byteCount : Long )","docstring":"/**\n * Removes exactly [byteCount] bytes from this source and writes them to [sink].\n *\n * @param sink the sink to which data will be written from this source.\n * @param byteCount the number of bytes that should be written into [sink]\n *\n * @throws IllegalArgumentException when [byteCount] is negative.\n * @throws EOFException when the requested number of bytes cannot be read.\n * @throws IllegalStateException when the source or [sink] is closed.\n *\n * @sample kotlinx.io.samples.KotlinxIoCoreCommonSamples.readSourceToSink\n */"} {"signature":"public fun transferTo ( sink : RawSink ) : Long","body":"public fun transferTo ( sink : RawSink ) : Long","docstring":"/**\n * Removes all bytes from this source, writes them to [sink], and returns the total number of bytes\n * written to [sink].\n *\n * Return 0 if this source is exhausted.\n *\n * @param sink the sink to which data will be written from this source.\n *\n * @throws IllegalStateException when the source or [sink] is closed.\n *\n * @sample kotlinx.io.samples.KotlinxIoCoreCommonSamples.transferTo\n */"} {"signature":"public fun peek ( ) : Source","body":"public fun peek ( ) : Source","docstring":"/**\n * Returns a new [Source] that can read data from this source without consuming it.\n * The returned source becomes invalid once this source is next read or closed.\n *\n * Peek could be used to lookahead and read the same data multiple times.\n *\n * @throws IllegalStateException when the source is closed.\n *\n * @sample kotlinx.io.samples.KotlinxIoCoreCommonSamples.peekSample\n */"} {"signature":"override fun hashCode ( ) : Int","body":"= MapImplementation . hashCode ( this )","docstring":"/**\n * We provide [equals], so as a matter of style, we should also provide [hashCode].\n *\n * Should be super.hashCode(), but https://youtrack.jetbrains.com/issue/KT-45673\n */"} {"signature":"fun writeCacheForUncachedTargets ( outputTargets : Set < SharedCommonizerTarget > , writeCacheAction : ( todoTargets : Set < SharedCommonizerTarget > ) -> Unit )","body":"= lock . withLock { val todoOutputTargets = todoTargets ( outputTargets ) if ( todoOutputTargets . isEmpty ( ) ) return@withLock writeCacheAction ( todoOutputTargets ) todoOutputTargets . map { outputTarget -> resolveCommonizedDirectory ( outputDirectory , outputTarget ) } . filter { commonizedDirectory -> commonizedDirectory . isDirectory } . forEach { commonizedDirectory -> commonizedDirectory . resolve ( \"\" ) . createNewFile ( ) } }","docstring":"/**\n * Calls [writeCacheAction] for uncached targets and marks them as cached if it succeeds\n */"} {"signature":"@ OptIn ( DelicateIoApi :: class ) public fun Sink . write ( byteString : ByteString , startIndex : Int = , endIndex : Int = byteString . size )","body":"{ checkBounds ( byteString . size , startIndex , endIndex ) if ( endIndex == startIndex ) { return } writeToInternalBuffer { buffer -> var offset = startIndex val tail = buffer . head ? . prev if ( tail != null ) { val bytesToWrite = min ( tail . data . size - tail . limit , endIndex - offset ) byteString . copyInto ( tail . data , tail . limit , offset , offset + bytesToWrite ) offset += bytesToWrite tail . limit += bytesToWrite buffer . size += bytesToWrite } while ( offset < endIndex ) { val bytesToWrite = min ( endIndex - offset , Segment . SIZE ) val seg = buffer . writableSegment ( bytesToWrite ) byteString . copyInto ( seg . data , seg . limit , offset , offset + bytesToWrite ) seg . limit += bytesToWrite buffer . size += bytesToWrite offset += bytesToWrite } } }","docstring":"/**\n * Writes subsequence of data from [byteString] starting at [startIndex] and ending at [endIndex] into a sink.\n *\n * @param byteString the byte string whose subsequence should be written to a sink.\n * @param startIndex the first index (inclusive) to copy data from the [byteString].\n * @param endIndex the last index (exclusive) to copy data from the [byteString]\n *\n * @throws IndexOutOfBoundsException when [startIndex] or [endIndex] is out of range of [byteString] indices.\n * @throws IllegalArgumentException when `startIndex > endIndex`.\n * @throws IllegalStateException if the sink is closed.\n *\n * @sample kotlinx.io.samples.ByteStringSamples.writeByteString\n */"} {"signature":"@ OptIn ( UnsafeByteStringApi :: class ) public fun Source . readByteString ( ) : ByteString","body":"{ return UnsafeByteStringOperations . wrapUnsafe ( readByteArray ( ) ) }","docstring":"/**\n * Consumes all bytes from this source and wraps it into a byte string.\n *\n * @throws IllegalStateException if the source is closed.\n *\n * @sample kotlinx.io.samples.ByteStringSamples.readByteString\n */"} {"signature":"@ OptIn ( UnsafeByteStringApi :: class ) public fun Source . readByteString ( byteCount : Int ) : ByteString","body":"{ return UnsafeByteStringOperations . wrapUnsafe ( readByteArray ( byteCount ) ) }","docstring":"/**\n * Consumes exactly [byteCount] bytes from this source and wraps it into a byte string.\n *\n * @param byteCount the number of bytes to read from the source.\n *\n * @throws EOFException when the source is exhausted before reading [byteCount] bytes from it.\n * @throws IllegalArgumentException when [byteCount] is negative.\n * @throws IllegalStateException if the source is closed.\n *\n * @sample kotlinx.io.samples.ByteStringSamples.readByteString\n */"} {"signature":"@ OptIn ( InternalIoApi :: class , UnsafeByteStringApi :: class ) public fun Source . indexOf ( byteString : ByteString , startIndex : Long = ) : Long","body":"{ require ( startIndex >= ) { \"\" } if ( byteString . isEmpty ( ) ) { return } var offset = startIndex while ( request ( offset + byteString . size ) ) { val idx = buffer . indexOf ( byteString , offset ) if ( idx < ) { offset = buffer . size - byteString . size + } else { return idx } } return - }","docstring":"/**\n * Returns the index of the first match for [byteString] in the source at or after [startIndex]. This\n * expands the source's buffer as necessary until [byteString] is found. This reads an unbounded number of\n * bytes into the buffer. Returns `-1` if the stream is exhausted before the requested bytes are found.\n *\n * @param byteString the sequence of bytes to find within the source.\n * @param startIndex the index into the source to start searching from.\n *\n * @throws IllegalArgumentException if [startIndex] is negative.\n * @throws IllegalStateException if the source is closed.\n *\n * @sample kotlinx.io.samples.ByteStringSamples.indexOfByteString\n */"} {"signature":"internal fun createObjCFramework ( config : KonanConfig , moduleDescriptor : ModuleDescriptor , exportedInterface : ObjCExportedInterface , frameworkDirectory : File )","body":"{ val frameworkName = frameworkDirectory . name . removeSuffix ( CompilerOutputKind . FRAMEWORK . suffix ( ) ) val frameworkBuilder = FrameworkBuilder ( config , infoPListBuilder = InfoPListBuilder ( config ) , moduleMapBuilder = ModuleMapBuilder ( ) , objCHeaderWriter = ObjCHeaderWriter ( ) , mainPackageGuesser = MainPackageGuesser ( ) , ) frameworkBuilder . build ( moduleDescriptor , frameworkDirectory , frameworkName , exportedInterface . headerLines , moduleDependencies = setOf ( \"\" ) ) }","docstring":"/**\n * Populate framework directory with headers, module and info.plist.\n */"} {"signature":"@ Suppress ( \"\" ) @ Deprecated ( \"\" ) fun String . removeJsCompilerSuffix ( compilerType : KotlinJsCompilerType ) : String","body":"{ val truncatedString = removeSuffix ( compilerType . lowerName ) if ( this != truncatedString ) { return truncatedString } return removeSuffix ( compilerType . lowerName . capitalize ( Locale . ENGLISH ) ) }","docstring":"/**\n * @suppress TODO: KT-58858 add documentation\n */"} {"signature":"@ kotlin . internal . InlineOnly public inline fun < @ kotlin . internal . OnlyInputTypes T > MutableCollection < out T > . remove ( element : T ) : Boolean","body":"= @ Suppress ( \"\" ) ( this as MutableCollection < T > ) . remove ( element )","docstring":"/**\n * Removes a single instance of the specified element from this\n * collection, if it is present.\n *\n * Allows to overcome type-safety restriction of `remove` that requires to pass an element of type `E`.\n *\n * @return `true` if the element has been successfully removed; `false` if it was not present in the collection.\n */"} {"signature":"@ kotlin . internal . InlineOnly public inline fun < @ kotlin . internal . OnlyInputTypes T > MutableCollection < out T > . removeAll ( elements : Collection < T > ) : Boolean","body":"= @ Suppress ( \"\" ) ( this as MutableCollection < T > ) . removeAll ( elements )","docstring":"/**\n * Removes all of this collection's elements that are also contained in the specified collection.\n\n * Allows to overcome type-safety restriction of `removeAll` that requires to pass a collection of type `Collection`.\n *\n * @return `true` if any of the specified elements was removed from the collection, `false` if the collection was not modified.\n */"} {"signature":"@ kotlin . internal . InlineOnly public inline fun < @ kotlin . internal . OnlyInputTypes T > MutableCollection < out T > . retainAll ( elements : Collection < T > ) : Boolean","body":"= @ Suppress ( \"\" ) ( this as MutableCollection < T > ) . retainAll ( elements )","docstring":"/**\n * Retains only the elements in this collection that are contained in the specified collection.\n *\n * Allows to overcome type-safety restriction of `retainAll` that requires to pass a collection of type `Collection`.\n *\n * @return `true` if any element was removed from the collection, `false` if the collection was not modified.\n */"} {"signature":"@ kotlin . internal . InlineOnly public inline operator fun < T > MutableCollection < in T > . plusAssign ( element : T )","body":"{ this . add ( element ) }","docstring":"/**\n * Adds the specified [element] to this mutable collection.\n */"} {"signature":"@ kotlin . internal . InlineOnly public inline operator fun < T > MutableCollection < in T > . plusAssign ( elements : Iterable < T > )","body":"{ this . addAll ( elements ) }","docstring":"/**\n * Adds all elements of the given [elements] collection to this mutable collection.\n */"} {"signature":"@ kotlin . internal . InlineOnly public inline operator fun < T > MutableCollection < in T > . plusAssign ( elements : Array < T > )","body":"{ this . addAll ( elements ) }","docstring":"/**\n * Adds all elements of the given [elements] array to this mutable collection.\n */"} {"signature":"@ kotlin . internal . InlineOnly public inline operator fun < T > MutableCollection < in T > . plusAssign ( elements : Sequence < T > )","body":"{ this . addAll ( elements ) }","docstring":"/**\n * Adds all elements of the given [elements] sequence to this mutable collection.\n */"} {"signature":"@ kotlin . internal . InlineOnly public inline operator fun < T > MutableCollection < in T > . minusAssign ( element : T )","body":"{ this . remove ( element ) }","docstring":"/**\n * Removes a single instance of the specified [element] from this mutable collection.\n */"} {"signature":"@ kotlin . internal . InlineOnly public inline operator fun < T > MutableCollection < in T > . minusAssign ( elements : Iterable < T > )","body":"{ this . removeAll ( elements ) }","docstring":"/**\n * Removes all elements contained in the given [elements] collection from this mutable collection.\n */"} {"signature":"@ kotlin . internal . InlineOnly public inline operator fun < T > MutableCollection < in T > . minusAssign ( elements : Array < T > )","body":"{ this . removeAll ( elements ) }","docstring":"/**\n * Removes all elements contained in the given [elements] array from this mutable collection.\n */"} {"signature":"@ kotlin . internal . InlineOnly public inline operator fun < T > MutableCollection < in T > . minusAssign ( elements : Sequence < T > )","body":"{ this . removeAll ( elements ) }","docstring":"/**\n * Removes all elements contained in the given [elements] sequence from this mutable collection.\n */"} {"signature":"public fun < T > MutableCollection < in T > . addAll ( elements : Iterable < T > ) : Boolean","body":"{ when ( elements ) { is Collection -> return addAll ( elements ) else -> { var result : Boolean = false for ( item in elements ) if ( add ( item ) ) result = true return result } } }","docstring":"/**\n * Adds all elements of the given [elements] collection to this [MutableCollection].\n */"} {"signature":"public fun < T > MutableCollection < in T > . addAll ( elements : Sequence < T > ) : Boolean","body":"{ var result : Boolean = false for ( item in elements ) { if ( add ( item ) ) result = true } return result }","docstring":"/**\n * Adds all elements of the given [elements] sequence to this [MutableCollection].\n */"} {"signature":"public fun < T > MutableCollection < in T > . addAll ( elements : Array < out T > ) : Boolean","body":"{ return addAll ( elements . asList ( ) ) }","docstring":"/**\n * Adds all elements of the given [elements] array to this [MutableCollection].\n */"} {"signature":"internal fun < T > Iterable < T > . convertToListIfNotCollection ( ) : Collection < T >","body":"= if ( this is Collection ) this else toList ( )","docstring":"/**\n * Converts this [Iterable] to a list if it is not a [Collection].\n * Otherwise, returns this.\n */"} {"signature":"public fun < T > MutableCollection < in T > . removeAll ( elements : Iterable < T > ) : Boolean","body":"{ return removeAll ( elements . convertToListIfNotCollection ( ) ) }","docstring":"/**\n * Removes all elements from this [MutableCollection] that are also contained in the given [elements] collection.\n */"} {"signature":"public fun < T > MutableCollection < in T > . removeAll ( elements : Sequence < T > ) : Boolean","body":"{ val list = elements . toList ( ) return list . isNotEmpty ( ) && removeAll ( list ) }","docstring":"/**\n * Removes all elements from this [MutableCollection] that are also contained in the given [elements] sequence.\n */"} {"signature":"public fun < T > MutableCollection < in T > . removeAll ( elements : Array < out T > ) : Boolean","body":"{ return elements . isNotEmpty ( ) && removeAll ( elements . asList ( ) ) }","docstring":"/**\n * Removes all elements from this [MutableCollection] that are also contained in the given [elements] array.\n */"} {"signature":"public fun < T > MutableCollection < in T > . retainAll ( elements : Iterable < T > ) : Boolean","body":"{ return retainAll ( elements . convertToListIfNotCollection ( ) ) }","docstring":"/**\n * Retains only elements of this [MutableCollection] that are contained in the given [elements] collection.\n */"} {"signature":"public fun < T > MutableCollection < in T > . retainAll ( elements : Array < out T > ) : Boolean","body":"{ if ( elements . isNotEmpty ( ) ) return retainAll ( elements . asList ( ) ) else return retainNothing ( ) }","docstring":"/**\n * Retains only elements of this [MutableCollection] that are contained in the given [elements] array.\n */"} {"signature":"public fun < T > MutableCollection < in T > . retainAll ( elements : Sequence < T > ) : Boolean","body":"{ val list = elements . toList ( ) if ( list . isNotEmpty ( ) ) return retainAll ( list ) else return retainNothing ( ) }","docstring":"/**\n * Retains only elements of this [MutableCollection] that are contained in the given [elements] sequence.\n */"} {"signature":"public fun < T > MutableIterable < T > . removeAll ( predicate : ( T ) -> Boolean ) : Boolean","body":"= filterInPlace ( predicate , true )","docstring":"/**\n * Removes all elements from this [MutableIterable] that match the given [predicate].\n *\n * @return `true` if any element was removed from this collection, or `false` when no elements were removed and collection was not modified.\n */"} {"signature":"public fun < T > MutableIterable < T > . retainAll ( predicate : ( T ) -> Boolean ) : Boolean","body":"= filterInPlace ( predicate , false )","docstring":"/**\n * Retains only elements of this [MutableIterable] that match the given [predicate].\n *\n * @return `true` if any element was removed from this collection, or `false` when all elements were retained and collection was not modified.\n */"} {"signature":"@ Deprecated ( \"\" , ReplaceWith ( \"\" ) , level = DeprecationLevel . ERROR ) @ kotlin . internal . InlineOnly public inline fun < T > MutableList < T > . remove ( index : Int ) : T","body":"= removeAt ( index )","docstring":"/**\n * Removes the element at the specified [index] from this list.\n * In Kotlin one should use the [MutableList.removeAt] function instead.\n */"} {"signature":"@ SinceKotlin ( \"\" ) public fun < T > MutableList < T > . removeFirst ( ) : T","body":"= if ( isEmpty ( ) ) throw NoSuchElementException ( \"\" ) else removeAt ( )","docstring":"/**\n * Removes the first element from this mutable list and returns that removed element, or throws [NoSuchElementException] if this list is empty.\n */"} {"signature":"@ SinceKotlin ( \"\" ) public fun < T > MutableList < T > . removeFirstOrNull ( ) : T ?","body":"= if ( isEmpty ( ) ) null else removeAt ( )","docstring":"/**\n * Removes the first element from this mutable list and returns that removed element, or returns `null` if this list is empty.\n */"} {"signature":"@ SinceKotlin ( \"\" ) public fun < T > MutableList < T > . removeLast ( ) : T","body":"= if ( isEmpty ( ) ) throw NoSuchElementException ( \"\" ) else removeAt ( lastIndex )","docstring":"/**\n * Removes the last element from this mutable list and returns that removed element, or throws [NoSuchElementException] if this list is empty.\n */"} {"signature":"@ SinceKotlin ( \"\" ) public fun < T > MutableList < T > . removeLastOrNull ( ) : T ?","body":"= if ( isEmpty ( ) ) null else removeAt ( lastIndex )","docstring":"/**\n * Removes the last element from this mutable list and returns that removed element, or returns `null` if this list is empty.\n */"} {"signature":"public fun < T > MutableList < T > . removeAll ( predicate : ( T ) -> Boolean ) : Boolean","body":"= filterInPlace ( predicate , true )","docstring":"/**\n * Removes all elements from this [MutableList] that match the given [predicate].\n *\n * @return `true` if any element was removed from this collection, or `false` when no elements were removed and collection was not modified.\n */"} {"signature":"public fun < T > MutableList < T > . retainAll ( predicate : ( T ) -> Boolean ) : Boolean","body":"= filterInPlace ( predicate , false )","docstring":"/**\n * Retains only elements of this [MutableList] that match the given [predicate].\n *\n * @return `true` if any element was removed from this collection, or `false` when all elements were retained and collection was not modified.\n */"} {"signature":"protected open fun beforeChange ( property : KProperty < * > , oldValue : V , newValue : V ) : Boolean","body":"= true","docstring":"/**\n * The callback which is called before a change to the property value is attempted.\n * The value of the property hasn't been changed yet, when this callback is invoked.\n * If the callback returns `true` the value of the property is being set to the new value,\n * and if the callback returns `false` the new value is discarded and the property remains its old value.\n */"} {"signature":"protected open fun afterChange ( property : KProperty < * > , oldValue : V , newValue : V ) : Unit","body":"{ }","docstring":"/**\n * The callback which is called after the change of the property is made. The value of the property\n * has already been changed when this callback is invoked.\n */"} {"signature":"fun dispose ( )","body":"fun dispose ( )","docstring":"/**\n * Called by [PhaseEngine.useContext] after action completion to cleanup resources.\n */"} {"signature":"inline fun < T : PhaseContext , R > useContext ( newContext : T , action : ( PhaseEngine < T > ) -> R ) : R","body":"{ val newEngine = PhaseEngine ( phaseConfig , phaserState , newContext ) try { return action ( newEngine ) } finally { newContext . dispose ( ) } }","docstring":"/**\n * Switch to a more specific phase engine.\n */"} {"signature":"inline fun < T : PhaseContext , R > newEngine ( newContext : T , action : ( PhaseEngine < T > ) -> R ) : R","body":"{ val newEngine = PhaseEngine ( phaseConfig , phaserState , newContext ) return action ( newEngine ) }","docstring":"/**\n * Create a new PhaseEngine instance for an existing context that should not be disposed after the action.\n * This is useful for creating engines for a sub/super context type.\n */"} {"signature":"@ SinceKotlin ( \"\" ) internal fun runSuspend ( block : suspend ( ) -> Unit )","body":"{ val run = RunSuspend ( ) block . startCoroutine ( run ) run . await ( ) }","docstring":"/**\n * Wrapper for `suspend fun main` and `@Test suspend fun testXXX` functions.\n */"} {"signature":"suspend fun waitForConditionToBecomeTrue ( predicate : ( ) -> Boolean )","body":"suspend fun waitForConditionToBecomeTrue ( predicate : ( ) -> Boolean )","docstring":"/**\n * On each incoming message invokes [predicate], and returns only when [predicate] returns `true`.\n */"} {"signature":"suspend inline fun < T > NodeJsInspectorClientContext . waitForValueToBecomeNonNull ( crossinline test : ( ) -> T ? ) : T","body":"{ var value : T ? = null waitForConditionToBecomeTrue { test ( ) ? . also { value = it } != null } return value ! ! }","docstring":"/**\n * On each incoming message checks whether [test] returns `null`, and returns only when [test] returns non-`null` value.\n */"} {"signature":"fun < T : Number > i0 ( x : KtNDArray < T > ) : KtNDArray < T >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( x ) )","docstring":"/**\n * Modified Bessel function of the first kind, order 0.\n */"} {"signature":"fun < T : Number > sinc ( x : KtNDArray < T > ) : KtNDArray < Double >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( x ) )","docstring":"/**\n * Return the sinc function.\n */"} {"signature":"override fun transformDeclarationContent ( declaration : FirDeclaration , data : ResolutionMode , ) : FirDeclaration","body":"= if ( implicitTypeOnly && declaration is FirRegularClass && ! declaration . isLocal ) { declaration . transformDeclarations ( this , data ) } else { super . transformDeclarationContent ( declaration , data ) }","docstring":"/**\n * This is required to avoid transformations of class annotations\n */"} {"signature":"@ Suppress ( \"\" ) public fun WhileSubscribed ( stopTimeoutMillis : Long = , replayExpirationMillis : Long = Long . MAX_VALUE ) : SharingStarted","body":"= StartedWhileSubscribed ( stopTimeoutMillis , replayExpirationMillis )","docstring":"/**\n * Sharing is started when the first subscriber appears, immediately stops when the last\n * subscriber disappears (by default), keeping the replay cache forever (by default).\n *\n * It has the following optional parameters:\n *\n * - [stopTimeoutMillis] — configures a delay (in milliseconds) between the disappearance of the last\n * subscriber and the stopping of the sharing coroutine. It defaults to zero (stop immediately).\n * - [replayExpirationMillis] — configures a delay (in milliseconds) between the stopping of\n * the sharing coroutine and the resetting of the replay cache (which makes the cache empty for the [shareIn] operator\n * and resets the cached value to the original `initialValue` for the [stateIn] operator).\n * It defaults to `Long.MAX_VALUE` (keep replay cache forever, never reset buffer).\n * Use zero value to expire the cache immediately.\n *\n * This function throws [IllegalArgumentException] when either [stopTimeoutMillis] or [replayExpirationMillis]\n * are negative.\n */"} {"signature":"public fun command ( subscriptionCount : StateFlow < Int > ) : Flow < SharingCommand >","body":"public fun command ( subscriptionCount : StateFlow < Int > ) : Flow < SharingCommand >","docstring":"/**\n * Transforms the [subscriptionCount][MutableSharedFlow.subscriptionCount] state of the shared flow into the\n * flow of [commands][SharingCommand] that control the sharing coroutine. See the [SharingStarted] interface\n * documentation for details.\n */"} {"signature":"@ Suppress ( \"\" ) public fun SharingStarted . Companion . WhileSubscribed ( stopTimeout : Duration = Duration . ZERO , replayExpiration : Duration = Duration . INFINITE ) : SharingStarted","body":"= StartedWhileSubscribed ( stopTimeout . inWholeMilliseconds , replayExpiration . inWholeMilliseconds )","docstring":"/**\n * Sharing is started when the first subscriber appears, immediately stops when the last\n * subscriber disappears (by default), keeping the replay cache forever (by default).\n *\n * It has the following optional parameters:\n *\n * - [stopTimeout] — configures a delay between the disappearance of the last\n * subscriber and the stopping of the sharing coroutine. It defaults to zero (stop immediately).\n * - [replayExpiration] — configures a delay between the stopping of\n * the sharing coroutine and the resetting of the replay cache (which makes the cache empty for the [shareIn] operator\n * and resets the cached value to the original `initialValue` for the [stateIn] operator).\n * It defaults to [Duration.INFINITE] (keep replay cache forever, never reset buffer).\n * Use [Duration.ZERO] value to expire the cache immediately.\n *\n * This function throws [IllegalArgumentException] when either [stopTimeout] or [replayExpiration]\n * are negative.\n */"} {"signature":"private fun malformed ( size : Int , index : Int , throwOnMalformed : Boolean ) : Int","body":"{ if ( throwOnMalformed ) throw CharacterCodingException ( \"\" ) return - size }","docstring":"/** Returns the negative [size] if [throwOnMalformed] is false, throws [CharacterCodingException] otherwise. */"} {"signature":"private fun codePointFromSurrogate ( string : String , high : Int , index : Int , endIndex : Int , throwOnMalformed : Boolean ) : Int","body":"{ if ( high !in .. || index >= endIndex ) { return malformed ( , index , throwOnMalformed ) } val low = string [ index ] . code if ( low !in .. ) { return malformed ( , index , throwOnMalformed ) } return + ( ( high and ) shl ) or ( low and ) }","docstring":"/**\n * Returns code point corresponding to UTF-16 surrogate pair,\n * where the first of the pair is the [high] and the second is in the [string] at the [index].\n * Returns zero if the pair is malformed and [throwOnMalformed] is false.\n *\n * @throws CharacterCodingException if the pair is malformed and [throwOnMalformed] is true.\n */"} {"signature":"private fun codePointFrom2 ( bytes : ByteArray , byte1 : Int , index : Int , endIndex : Int , throwOnMalformed : Boolean ) : Int","body":"{ if ( byte1 and == || index >= endIndex ) { return malformed ( , index , throwOnMalformed ) } val byte2 = bytes [ index ] . toInt ( ) if ( byte2 and != ) { return malformed ( , index , throwOnMalformed ) } return ( byte1 shl ) xor byte2 xor }","docstring":"/**\n * Returns code point corresponding to UTF-8 sequence of two bytes,\n * where the first byte of the sequence is the [byte1] and the second byte is in the [bytes] array at the [index].\n * Returns zero if the sequence is malformed and [throwOnMalformed] is false.\n *\n * @throws CharacterCodingException if the sequence of two bytes is malformed and [throwOnMalformed] is true.\n */"} {"signature":"private fun codePointFrom3 ( bytes : ByteArray , byte1 : Int , index : Int , endIndex : Int , throwOnMalformed : Boolean ) : Int","body":"{ if ( index >= endIndex ) { return malformed ( , index , throwOnMalformed ) } val byte2 = bytes [ index ] . toInt ( ) if ( byte1 and == ) { if ( byte2 and != ) { return malformed ( , index , throwOnMalformed ) } } else if ( byte1 and == ) { if ( byte2 and != ) { return malformed ( , index , throwOnMalformed ) } } else if ( byte2 and != ) { return malformed ( , index , throwOnMalformed ) } if ( index + == endIndex ) { return malformed ( , index , throwOnMalformed ) } val byte3 = bytes [ index + ] . toInt ( ) if ( byte3 and != ) { return malformed ( , index , throwOnMalformed ) } return ( byte1 shl ) xor ( byte2 shl ) xor byte3 xor - }","docstring":"/**\n * Returns code point corresponding to UTF-8 sequence of three bytes,\n * where the first byte of the sequence is the [byte1] and the others are in the [bytes] array starting from the [index].\n * Returns a non-positive value indicating number of bytes from [bytes] included in malformed sequence\n * if the sequence is malformed and [throwOnMalformed] is false.\n *\n * @throws CharacterCodingException if the sequence of three bytes is malformed and [throwOnMalformed] is true.\n */"} {"signature":"private fun codePointFrom4 ( bytes : ByteArray , byte1 : Int , index : Int , endIndex : Int , throwOnMalformed : Boolean ) : Int","body":"{ if ( index >= endIndex ) { malformed ( , index , throwOnMalformed ) } val byte2 = bytes [ index ] . toInt ( ) if ( byte1 and == ) { if ( byte2 and <= ) { return malformed ( , index , throwOnMalformed ) } } else if ( byte1 and == ) { if ( byte2 and != ) { return malformed ( , index , throwOnMalformed ) } } else if ( byte1 and > ) { return malformed ( , index , throwOnMalformed ) } else if ( byte2 and != ) { return malformed ( , index , throwOnMalformed ) } if ( index + == endIndex ) { return malformed ( , index , throwOnMalformed ) } val byte3 = bytes [ index + ] . toInt ( ) if ( byte3 and != ) { return malformed ( , index , throwOnMalformed ) } if ( index + == endIndex ) { return malformed ( , index , throwOnMalformed ) } val byte4 = bytes [ index + ] . toInt ( ) if ( byte4 and != ) { return malformed ( , index , throwOnMalformed ) } return ( byte1 shl ) xor ( byte2 shl ) xor ( byte3 shl ) xor byte4 xor }","docstring":"/**\n * Returns code point corresponding to UTF-8 sequence of four bytes,\n * where the first byte of the sequence is the [byte1] and the others are in the [bytes] array starting from the [index].\n * Returns a non-positive value indicating number of bytes from [bytes] included in malformed sequence\n * if the sequence is malformed and [throwOnMalformed] is false.\n *\n * @throws CharacterCodingException if the sequence of four bytes is malformed and [throwOnMalformed] is true.\n */"} {"signature":"internal fun encodeUtf8 ( string : String , startIndex : Int , endIndex : Int , throwOnMalformed : Boolean ) : ByteArray","body":"{ require ( startIndex >= && endIndex <= string . length && startIndex <= endIndex ) val bytes = ByteArray ( ( endIndex - startIndex ) * MAX_BYTES_PER_CHAR ) var byteIndex = var charIndex = startIndex while ( charIndex < endIndex ) { val code = string [ charIndex ++ ] . code when { code < -> bytes [ byteIndex ++ ] = code . toByte ( ) code < -> { bytes [ byteIndex ++ ] = ( ( code shr ) or ) . toByte ( ) bytes [ byteIndex ++ ] = ( ( code and ) or ) . toByte ( ) } code < || code >= -> { bytes [ byteIndex ++ ] = ( ( code shr ) or ) . toByte ( ) bytes [ byteIndex ++ ] = ( ( ( code shr ) and ) or ) . toByte ( ) bytes [ byteIndex ++ ] = ( ( code and ) or ) . toByte ( ) } else -> { val codePoint = codePointFromSurrogate ( string , code , charIndex , endIndex , throwOnMalformed ) if ( codePoint <= ) { bytes [ byteIndex ++ ] = REPLACEMENT_BYTE_SEQUENCE [ ] bytes [ byteIndex ++ ] = REPLACEMENT_BYTE_SEQUENCE [ ] bytes [ byteIndex ++ ] = REPLACEMENT_BYTE_SEQUENCE [ ] } else { bytes [ byteIndex ++ ] = ( ( codePoint shr ) or ) . toByte ( ) bytes [ byteIndex ++ ] = ( ( ( codePoint shr ) and ) or ) . toByte ( ) bytes [ byteIndex ++ ] = ( ( ( codePoint shr ) and ) or ) . toByte ( ) bytes [ byteIndex ++ ] = ( ( codePoint and ) or ) . toByte ( ) charIndex ++ } } } } return if ( bytes . size == byteIndex ) bytes else bytes . copyOf ( byteIndex ) }","docstring":"/**\n * Encodes the [string] using UTF-8 and returns the resulting [ByteArray].\n *\n * @param string the string to encode.\n * @param startIndex the start offset (inclusive) of the substring to encode.\n * @param endIndex the end offset (exclusive) of the substring to encode.\n * @param throwOnMalformed whether to throw on malformed char sequence or replace by the [REPLACEMENT_BYTE_SEQUENCE].\n *\n * @throws CharacterCodingException if the char sequence is malformed and [throwOnMalformed] is true.\n */"} {"signature":"internal fun decodeUtf8 ( bytes : ByteArray , startIndex : Int , endIndex : Int , throwOnMalformed : Boolean ) : String","body":"{ require ( startIndex >= && endIndex <= bytes . size && startIndex <= endIndex ) var byteIndex = startIndex val stringBuilder = StringBuilder ( ) while ( byteIndex < endIndex ) { val byte = bytes [ byteIndex ++ ] . toInt ( ) when { byte >= -> stringBuilder . append ( byte . toChar ( ) ) byte shr == - -> { val code = codePointFrom2 ( bytes , byte , byteIndex , endIndex , throwOnMalformed ) if ( code <= ) { stringBuilder . append ( REPLACEMENT_CHAR ) byteIndex += - code } else { stringBuilder . append ( code . toChar ( ) ) byteIndex += } } byte shr == - -> { val code = codePointFrom3 ( bytes , byte , byteIndex , endIndex , throwOnMalformed ) if ( code <= ) { stringBuilder . append ( REPLACEMENT_CHAR ) byteIndex += - code } else { stringBuilder . append ( code . toChar ( ) ) byteIndex += } } byte shr == - -> { val code = codePointFrom4 ( bytes , byte , byteIndex , endIndex , throwOnMalformed ) if ( code <= ) { stringBuilder . append ( REPLACEMENT_CHAR ) byteIndex += - code } else { val high = ( code - ) shr or val low = ( code and ) or stringBuilder . append ( high . toChar ( ) ) stringBuilder . append ( low . toChar ( ) ) byteIndex += } } else -> { malformed ( , byteIndex , throwOnMalformed ) stringBuilder . append ( REPLACEMENT_CHAR ) } } } return stringBuilder . toString ( ) }","docstring":"/**\n * Decodes the UTF-8 [bytes] array and returns the resulting [String].\n *\n * @param bytes the byte array to decode.\n * @param startIndex the start offset (inclusive) of the array to be decoded.\n * @param endIndex the end offset (exclusive) of the array to be encoded.\n * @param throwOnMalformed whether to throw on malformed byte sequence or replace by the [REPLACEMENT_CHAR].\n *\n * @throws CharacterCodingException if the array is malformed UTF-8 byte sequence and [throwOnMalformed] is true.\n */"} {"signature":"fun createResolved ( resolvedLibraries : KotlinLibraryResolveResult , storageManager : StorageManager , builtIns : KotlinBuiltIns ? , languageVersionSettings : LanguageVersionSettings , friendModuleFiles : Set < File > , refinesModuleFiles : Set < File > , includedLibraryFiles : Set < File > , additionalDependencyModules : Iterable < ModuleDescriptorImpl > , isForMetadataCompilation : Boolean , ) : KotlinResolvedModuleDescriptors","body":"fun createResolved ( resolvedLibraries : KotlinLibraryResolveResult , storageManager : StorageManager , builtIns : KotlinBuiltIns ? , languageVersionSettings : LanguageVersionSettings , friendModuleFiles : Set < File > , refinesModuleFiles : Set < File > , includedLibraryFiles : Set < File > , additionalDependencyModules : Iterable < ModuleDescriptorImpl > , isForMetadataCompilation : Boolean , ) : KotlinResolvedModuleDescriptors","docstring":"/**\n * Given the [resolvedLibraries] creates the list of [ModuleDescriptorImpl]s with properly installed\n * inter-dependencies. The result of this method is returned in a form of [KlibResolvedModuleDescriptors] instance.\n *\n * Please use this method with care: Unless this method accepts `null` for [builtIns], it is not recommended to\n * invoke it this way. If you are compiling a source module, please supply the non-null [builtIns] from the\n * source module, so that all modules created in your compilation session will share the same built-ins instance.\n *\n * Otherwise (if `null` was supplied), a new instance of [KotlinBuiltIns] will be created. The created built-ins\n * instance will be shared by all modules created in this method. But this instance will have no connection\n * with probably existing built-ins instance of your source module(s).\n */"} {"signature":"@ Test fun KT66375JvmDependenciesShouldNotDowngrade ( )","body":"{ val appProject = buildProject ( projectBuilder = { withName ( \"\" ) } ) val libProject = buildProject ( projectBuilder = { withName ( \"\" ) . withParent ( appProject ) } ) assertSourceSetDependenciesResolution ( \"\" , withProject = appProject ) { appProject . applyMultiplatformPlugin ( ) . apply { jvm ( ) ; linuxX64 ( ) sourceSets . getByName ( \"\" ) . dependencies { this . api ( mockedDependency ( \"\" , \"\" ) ) } sourceSets . jvmMain . dependencies { api ( project ( \"\" ) ) } } libProject . applyMultiplatformPlugin ( ) . apply { jvm ( ) ; linuxX64 ( ) sourceSets . jvmMain . dependencies { api ( mockedDependency ( \"\" , \"\" ) ) } } } }","docstring":"/**\n * after KT-66375 is fixed it is expected that all source sets will have foo:2.0 dependency\n * unless other is decided\n */"} {"signature":"@ Test fun leafHostSpecificSourceSetsDependencies ( )","body":"{ val appProject = buildProject ( projectBuilder = { withName ( \"\" ) } ) val libProject = buildProject ( projectBuilder = { withName ( \"\" ) . withParent ( appProject ) } ) assertSourceSetDependenciesResolution ( \"\" , withProject = appProject ) { appProject . applyMultiplatformPlugin ( ) . apply { jvm ( ) iosArm64 ( ) sourceSets . getByName ( \"\" ) . dependencies { api ( project ( \"\" ) ) } } libProject . applyMultiplatformPlugin ( ) . apply { jvm ( ) iosArm64 ( ) } } }","docstring":"/**\n * This test checks that `iosArm64` will successfully resolve `iosArm64`, even on\n * non-Mac hosts. If the test fails on non-Mac host, please DO NOT add @OsCondition\n * and investiagate\n */"} {"signature":"private fun findEntryAliases ( companionDescriptor : ClassDescriptor )","body":"= companionDescriptor . defaultType . memberScope . getContributedDescriptors ( ) . filterIsInstance < PropertyDescriptor > ( ) . filter { it . annotations . hasAnnotation ( cEnumEntryAliasAnnonation ) }","docstring":"/**\n * Returns all properties in companion object that represent aliases to\n * enum entries.\n */"} {"signature":"fun main ( )","body":"{ val modelHub = ONNXModelHub ( cacheDirectory = File ( \"\" ) ) val model = ONNXModels . FaceAlignment . Fan2d106 . pretrainedModel ( modelHub ) model . printSummary ( ) model . use { val result = mutableMapOf < BufferedImage , List < Landmark > > ( ) for ( i in .. ) { val file = getFileFromResource ( \"\" ) val image = ImageConverter . toBufferedImage ( file ) val landmarks = it . detectLandmarks ( image ) result [ image ] = landmarks } val panel = JPanel ( GridLayout ( , ) ) val resize = pipeline < BufferedImage > ( ) . resize { outputWidth = ; outputHeight = } for ( ( image , landmarks ) in result ) { panel . add ( createDetectedLandmarksPanel ( resize . apply ( image ) , landmarks ) ) } showFrame ( \"\" , panel ) } }","docstring":"/**\n * This examples demonstrates the light-weight inference API with [Fan2D106FaceAlignmentModel] on Fan2d106 model:\n * - Model is obtained from [ONNXModelHub].\n * - Model predicts landmarks on a few images located in resources.\n * - The detected landmarks are drawn on the images used for prediction.\n */"} {"signature":"fun x ( )","body":"{ }","docstring":"/**\n * [lst]\n */"} {"signature":"fun open ( )","body":"= Binding ( observers = setOf ( this ) )","docstring":"/**\n * Create a fresh open applier binding variable\n */"} {"signature":"fun closed ( target : String )","body":"= Binding ( token = target , emptySet ( ) )","docstring":"/**\n * Create a closed applier binding variable\n */"} {"signature":"fun onChange ( callback : ( ) -> Unit ) : ( ) -> Unit","body":"{ listeners . add ( callback ) return { listeners . remove ( callback ) } }","docstring":"/**\n * Listen for when a unification closed a binding or bound two binding groups together.\n */"} {"signature":"fun unify ( a : Binding , b : Binding ) : Boolean","body":"{ val at = a . value . token val bt = b . value . token return when { at != null && bt == null -> bind ( b , at ) at == null && bt != null -> bind ( a , bt ) at != null && bt != null -> at == bt else -> bind ( a , b ) } }","docstring":"/**\n * Unify a and b; returns true if the unification succeeded. If both a and b are unbound they\n * will be bound together and will simultaneously be bound if either is later bound. If only\n * one is bound the other will be bound to the bound token. If a and b are bound already,\n * unify() returns true if they are bound to the same token or false if they are not. Binding\n * two open bindings that are already bound together is a noop and succeeds.\n *\n * @param a an applier binding variable\n * @param b an applier binding variable\n * @return true if [a] and [b] can be unified together.\n */"} {"signature":"fun targetChildOutputDirectory ( parent : DokkaMultiModuleTask , child : AbstractDokkaTask ) : Provider < Directory >","body":"fun targetChildOutputDirectory ( parent : DokkaMultiModuleTask , child : AbstractDokkaTask ) : Provider < Directory >","docstring":"/**\n * @param parent: The [DokkaMultiModuleTask] that is initiating a composite documentation run\n * @param child: Some child task registered in [parent]\n * @return The target output directory of the [child] dokka task referenced by [parent]. This should\n * be unique for all registered child tasks.\n */"} {"signature":"public fun Sink . writeShortLe ( short : Short )","body":"{ this . writeShort ( short . reverseBytes ( ) ) }","docstring":"/**\n * Writes two bytes containing [short], in the little-endian order, to this sink.\n *\n * @param short the short integer to be written.\n *\n * @throws IllegalStateException when the sink is closed.\n *\n * @sample kotlinx.io.samples.KotlinxIoCoreCommonSamples.writeShortLe\n */"} {"signature":"public fun Sink . writeIntLe ( int : Int )","body":"{ this . writeInt ( int . reverseBytes ( ) ) }","docstring":"/**\n * Writes four bytes containing [int], in the little-endian order, to this sink.\n *\n * @param int the integer to be written.\n *\n * @throws IllegalStateException when the sink is closed.\n *\n * @sample kotlinx.io.samples.KotlinxIoCoreCommonSamples.writeIntLe\n */"} {"signature":"public fun Sink . writeLongLe ( long : Long )","body":"{ this . writeLong ( long . reverseBytes ( ) ) }","docstring":"/**\n * Writes eight bytes containing [long], in the little-endian order, to this sink.\n *\n * @param long the long integer to be written.\n *\n * @throws IllegalStateException when the sink is closed.\n *\n * @sample kotlinx.io.samples.KotlinxIoCoreCommonSamples.writeLongLe\n */"} {"signature":"@ OptIn ( DelicateIoApi :: class ) public fun Sink . writeDecimalLong ( long : Long )","body":"{ var v = long if ( v == ) { writeByte ( '' . code . toByte ( ) ) return } var negative = false if ( v < ) { v = - v if ( v < ) { writeString ( \"\" ) return } negative = true } var width = if ( v < ) if ( v < ) if ( v < ) if ( v < ) else else if ( v < ) else else if ( v < ) if ( v < ) else else if ( v < ) else else if ( v < ) if ( v < ) if ( v < ) else else if ( v < ) else else if ( v < ) if ( v < ) else if ( v < ) else else if ( v < ) if ( v < ) else else if ( v < ) else if ( negative ) { ++ width } writeToInternalBuffer { buffer -> val tail = buffer . writableSegment ( width ) val data = tail . data var pos = tail . limit + width while ( v != ) { val digit = ( v % ) . toInt ( ) data [ -- pos ] = HEX_DIGIT_BYTES [ digit ] v /= } if ( negative ) { data [ -- pos ] = '' . code . toByte ( ) } tail . limit += width buffer . size += width . toLong ( ) } }","docstring":"/**\n * Writes [long] to this sink in signed decimal form (i.e., as a string in base 10).\n *\n * Resulting string will not contain leading zeros, except the `0` value itself.\n *\n * @param long the long to be written.\n *\n * @throws IllegalStateException when the sink is closed.\n *\n * @sample kotlinx.io.samples.KotlinxIoCoreCommonSamples.writeDecimalLong\n */"} {"signature":"@ OptIn ( DelicateIoApi :: class ) public fun Sink . writeHexadecimalUnsignedLong ( long : Long )","body":"{ var v = long if ( v == ) { writeByte ( '' . code . toByte ( ) ) return } var x = v x = x or ( x ushr ) x = x or ( x ushr ) x = x or ( x ushr ) x = x or ( x ushr ) x = x or ( x ushr ) x = x or ( x ushr ) x -= x ushr and x = ( x ushr and ) + ( x and ) x = ( x ushr ) + x and x += x ushr x += x ushr x = ( x and ) + ( ( x ushr ) and ) val width = ( ( x + ) / ) . toInt ( ) writeToInternalBuffer { buffer -> val tail = buffer . writableSegment ( width ) val data = tail . data var pos = tail . limit + width - val start = tail . limit while ( pos >= start ) { data [ pos ] = HEX_DIGIT_BYTES [ ( v and ) . toInt ( ) ] v = v ushr pos -- } tail . limit += width buffer . size += width . toLong ( ) } }","docstring":"/**\n * Writes [long] to this sink in hexadecimal form (i.e., as a string in base 16).\n *\n * Resulting string will not contain leading zeros, except the `0` value itself.\n *\n * @param long the long to be written.\n *\n * @throws IllegalStateException when the sink is closed.\n *\n * @sample kotlinx.io.samples.KotlinxIoCoreCommonSamples.writeHexLong\n */"} {"signature":"public fun Sink . writeUByte ( byte : UByte )","body":"{ writeByte ( byte . toByte ( ) ) }","docstring":"/**\n * Writes am unsigned byte to this sink.\n *\n * @param byte the byte to be written.\n *\n * @throws IllegalStateException when the sink is closed.\n *\n * @sample kotlinx.io.samples.KotlinxIoCoreCommonSamples.writeUByte\n */"} {"signature":"public fun Sink . writeUShort ( short : UShort )","body":"{ writeShort ( short . toShort ( ) ) }","docstring":"/**\n * Writes two bytes containing [short], in the big-endian order, to this sink.\n *\n * @param short the unsigned short integer to be written.\n *\n * @throws IllegalStateException when the sink is closed.\n *\n * @sample kotlinx.io.samples.KotlinxIoCoreCommonSamples.writeUShort\n */"} {"signature":"public fun Sink . writeUInt ( int : UInt )","body":"{ writeInt ( int . toInt ( ) ) }","docstring":"/**\n * Writes four bytes containing [int], in the big-endian order, to this sink.\n *\n * @param int the unsigned integer to be written.\n *\n * @throws IllegalStateException when the sink is closed.\n *\n * @sample kotlinx.io.samples.KotlinxIoCoreCommonSamples.writeUInt\n */"} {"signature":"public fun Sink . writeULong ( long : ULong )","body":"{ writeLong ( long . toLong ( ) ) }","docstring":"/**\n * Writes eight bytes containing [long], in the big-endian order, to this sink.\n *\n * @param long the unsigned long integer to be written.\n *\n * @throws IllegalStateException when the sink is closed.\n *\n * @sample kotlinx.io.samples.KotlinxIoCoreCommonSamples.writeULong\n */"} {"signature":"public fun Sink . writeUShortLe ( short : UShort )","body":"{ writeShortLe ( short . toShort ( ) ) }","docstring":"/**\n * Writes two bytes containing [short], in the little-endian order, to this sink.\n *\n * @param short the unsigned short integer to be written.\n *\n * @throws IllegalStateException when the sink is closed.\n *\n * @sample kotlinx.io.samples.KotlinxIoCoreCommonSamples.writeUShortLe\n */"} {"signature":"public fun Sink . writeUIntLe ( int : UInt )","body":"{ writeIntLe ( int . toInt ( ) ) }","docstring":"/**\n * Writes four bytes containing [int], in the little-endian order, to this sink.\n *\n * @param int the unsigned integer to be written.\n *\n * @throws IllegalStateException when the sink is closed.\n *\n * @sample kotlinx.io.samples.KotlinxIoCoreCommonSamples.writeUIntLe\n */"} {"signature":"public fun Sink . writeULongLe ( long : ULong )","body":"{ writeLongLe ( long . toLong ( ) ) }","docstring":"/**\n * Writes eight bytes containing [long], in the little-endian order, to this sink.\n *\n * @param long the unsigned long integer to be written.\n *\n * @throws IllegalStateException when the sink is closed.\n *\n * @sample kotlinx.io.samples.KotlinxIoCoreCommonSamples.writeULongLe\n */"} {"signature":"public fun Sink . writeFloat ( float : Float )","body":"{ writeInt ( float . toBits ( ) ) }","docstring":"/**\n * Writes four bytes of a bit representation of [float], in the big-endian order, to this sink.\n * Bit representation of the [float] corresponds to the IEEE 754 floating-point \"single format\" bit layout.\n *\n * To obtain a bit representation, the [Float.toBits] function is used.\n *\n * Should be used with care when working with special values (like `NaN`) as bit patterns obtained for [Float.NaN] may vary depending on a platform.\n *\n * @param float the floating point number to be written.\n *\n * @throws IllegalStateException when the sink is closed.\n *\n * @sample kotlinx.io.samples.KotlinxIoCoreCommonSamples.writeFloat\n */"} {"signature":"public fun Sink . writeDouble ( double : Double )","body":"{ writeLong ( double . toBits ( ) ) }","docstring":"/**\n * Writes eight bytes of a bit representation of [double], in the big-endian order, to this sink.\n * Bit representation of the [double] corresponds to the IEEE 754 floating-point \"double format\" bit layout.\n *\n * To obtain a bit representation, the [Double.toBits] function is used.\n *\n * Should be used with care when working with special values (like `NaN`) as bit patterns obtained for [Double.NaN] may vary depending on a platform.\n *\n * @param double the floating point number to be written.\n *\n * @throws IllegalStateException when the sink is closed.\n *\n * @sample kotlinx.io.samples.KotlinxIoCoreCommonSamples.writeDouble\n */"} {"signature":"public fun Sink . writeFloatLe ( float : Float )","body":"{ writeIntLe ( float . toBits ( ) ) }","docstring":"/**\n * Writes four bytes of a bit representation of [float], in the little-endian order, to this sink.\n * Bit representation of the [float] corresponds to the IEEE 754 floating-point \"single format\" bit layout.\n *\n * To obtain a bit representation, the [Float.toBits] function is used.\n *\n * Should be used with care when working with special values (like `NaN`) as bit patterns obtained for [Float.NaN] may vary depending on a platform.\n *\n * @param float the floating point number to be written.\n *\n * @throws IllegalStateException when the sink is closed.\n *\n * @sample kotlinx.io.samples.KotlinxIoCoreCommonSamples.writeFloatLe\n */"} {"signature":"public fun Sink . writeDoubleLe ( double : Double )","body":"{ writeLongLe ( double . toBits ( ) ) }","docstring":"/**\n * Writes eight bytes of a bit representation of [double], in the little-endian order, to this sink.\n * Bit representation of the [double] corresponds to the IEEE 754 floating-point \"double format\" bit layout.\n *\n * To obtain a bit representation, the [Double.toBits] function is used.\n *\n * Should be used with care when working with special values (like `NaN`) as bit patterns obtained for [Double.NaN] may vary depending on a platform.\n *\n * @param double the floating point number to be written.\n *\n * @throws IllegalStateException when the sink is closed.\n *\n * @sample kotlinx.io.samples.KotlinxIoCoreCommonSamples.writeDoubleLe\n */"} {"signature":"@ DelicateIoApi @ OptIn ( InternalIoApi :: class ) public inline fun Sink . writeToInternalBuffer ( lambda : ( Buffer ) -> Unit )","body":"{ lambda ( this . buffer ) this . hintEmit ( ) }","docstring":"/**\n * Provides direct access to the sink's internal buffer and hints its emit before exit.\n *\n * The internal buffer is passed into [lambda],\n * and it may be partially emitted to the underlying sink before returning from this method.\n *\n * Use this method with care as the data within the buffer is not yet emitted to the underlying sink\n * and consumption of data from the buffer will cause its loss.\n *\n * @param lambda the callback accessing internal buffer.\n *\n * @throws IllegalStateException when the sink is closed.\n */"} {"signature":"@ Deprecated ( \"\" , ReplaceWith ( \"\" ) , DeprecationLevel . HIDDEN ) @ Suppress ( \"\" , \"\" ) public suspend fun < E : Any > ReceiveChannel < E > . receiveOrNull ( ) : E ?","body":"{ @ Suppress ( \"\" , \"\" ) return ( this as ReceiveChannel < E ? > ) . receiveOrNull ( ) }","docstring":"/**\n * This function is deprecated in the favour of [ReceiveChannel.receiveCatching].\n *\n * This function is considered error-prone for the following reasons;\n * - Is throwing if the channel has failed even though its signature may suggest it returns 'null'\n * - It is easy to forget that exception handling still have to be explicit\n * - During code reviews and code reading, intentions of the code are frequently unclear:\n * are potential exceptions ignored deliberately or not?\n *\n * @suppress doc\n */"} {"signature":"@ Deprecated ( \"\" , level = DeprecationLevel . HIDDEN ) @ Suppress ( \"\" ) public fun < E : Any > ReceiveChannel < E > . onReceiveOrNull ( ) : SelectClause1 < E ? >","body":"{ return ( this as ReceiveChannel < E ? > ) . onReceiveOrNull }","docstring":"/**\n * This function is deprecated in the favour of [ReceiveChannel.onReceiveCatching]\n */"} {"signature":"public inline fun < E , R > ReceiveChannel < E > . consume ( block : ReceiveChannel < E > . ( ) -> R ) : R","body":"{ contract { callsInPlace ( block , InvocationKind . EXACTLY_ONCE ) } var cause : Throwable ? = null try { return block ( ) } catch ( e : Throwable ) { cause = e throw e } finally { cancelConsumed ( cause ) } }","docstring":"/**\n * Makes sure that the given [block] consumes all elements from the given channel\n * by always invoking [cancel][ReceiveChannel.cancel] after the execution of the block.\n *\n * The operation is _terminal_.\n */"} {"signature":"public suspend inline fun < E > ReceiveChannel < E > . consumeEach ( action : ( E ) -> Unit ) : Unit","body":"= consume { for ( e in this ) action ( e ) }","docstring":"/**\n * Performs the given [action] for each received element and [cancels][ReceiveChannel.cancel]\n * the channel after the execution of the block.\n * If you need to iterate over the channel without consuming it, a regular `for` loop should be used instead.\n *\n * The operation is _terminal_.\n * This function [consumes][ReceiveChannel.consume] all elements of the original [ReceiveChannel].\n */"} {"signature":"public suspend fun < E > ReceiveChannel < E > . toList ( ) : List < E >","body":"= buildList { consumeEach { add ( it ) } }","docstring":"/**\n * Returns a [List] containing all elements.\n *\n * The operation is _terminal_.\n * This function [consumes][ReceiveChannel.consume] all elements of the original [ReceiveChannel].\n */"} {"signature":"public fun < I > Operation < I , FloatData > . onnx ( block : ONNXModelPreprocessor . ( ) -> Unit ) : Operation < I , FloatData >","body":"{ return PreprocessingPipeline ( this , ONNXModelPreprocessor ( null ) . apply ( block ) ) }","docstring":"/** Image DSL Preprocessing extension.*/"} {"signature":"private fun Path . toExpectedPath ( ) : Path","body":"{ val artifactDirPath = localRepoPath . relativize ( this ) . parent . parent val expectedFileName = \"\" return expectedRepoPath . resolve ( artifactDirPath . resolve ( expectedFileName ) ) }","docstring":"/**\n * convert:\n * ${mavenLocal}/org/jetbrains/kotlin/artifact/version/artifact-version.pom\n * to:\n * ${expectedRepository}/org/jetbrains/kotlin/artifact/artifact.pom\n */"} {"signature":"private fun Project . setupCInteropCommonizerDependenciesForIde ( sourceSet : DefaultKotlinSourceSet )","body":"= launch { addIntransitiveMetadataDependencyIfPossible ( sourceSet , cinteropCommonizerDependencies ( sourceSet ) ) }","docstring":"/**\n * IDE will resolve the dependencies provided on source sets.\n * This will use the [Project.copyCommonizeCInteropForIdeTask] over the regular cinterop commonization task.\n * The copying task prevent red code within the IDE after cleaning the build output.\n */"} {"signature":"operator fun < DsType > invoke ( vararg params : TypedColumn < DsType , T > ) : TypedColumn < DsType , R >","body":"= udf . apply ( * params ) . `as` ( encoder ) as TypedColumn < DsType , R >","docstring":"/**\n * Allows this UDF to be called in typed manner using columns in a [Dataset.selectTyped] call.\n * @see typedCol to create typed columns.\n * @see org.apache.spark.sql.expressions.UserDefinedFunction.apply\n */"} {"signature":"override fun withName ( name : String ) : NamedUserDefinedFunctionVararg < T , R >","body":"= NamedUserDefinedFunctionVararg ( name = name , udf = udf , encoder = encoder , )","docstring":"/** Returns named variant of this UDF. */"} {"signature":"override fun getValue ( thisRef : Any ? , property : KProperty < * > ) : NamedUserDefinedFunctionVararg < T , R >","body":"= withName ( property . name )","docstring":"/**\n * Returns named variant of this UDF.\n * @see withName\n */"} {"signature":"@ JvmName ( \"\" ) inline fun < reified R > udf ( name : String , nondeterministic : Boolean = false , varargFunc : UDF1 < ByteArray , R > , ) : NamedUserDefinedFunctionVararg < Byte , R >","body":"= udf ( nondeterministic , varargFunc ) . withName ( name )","docstring":"/**\n * Defines a named vararg UDF ([NamedUserDefinedFunctionVararg]) instance based on the (lambda) function [varargFunc].\n * For example: `val myUdf = udf(\"myUdf\") { t1: ByteArray -> ... }`\n * Name can also be supplied using delegate: `val myUdf by udf { t1: ByteArray -> ... }`\n * @see UserDefinedFunction.getValue\n *\n * If you want to process a column containing an ByteArray instead, use WrappedArray.\n *\n * @param name The name for this UDF.\n * @param nondeterministic Optional. If true, sets the UserDefinedFunction as nondeterministic.\n * @param varargFunc The function to convert to a UDF. Can be a lambda.\n */"} {"signature":"@ JvmName ( \"\" ) inline fun < reified R > udf ( nondeterministic : Boolean = false , varargFunc : UDF1 < ByteArray , R > , ) : UserDefinedFunctionVararg < Byte , R >","body":"{ return withAllowUntypedScalaUDF { UserDefinedFunctionVararg ( udf = functions . udf ( VarargUnwrapper ( varargFunc ) { i , init -> ByteArray ( i , init :: call ) } , schema ( typeOf < R > ( ) ) . unWrap ( ) ) . let { if ( nondeterministic ) it . asNondeterministic ( ) else it } . let { if ( typeOf < R > ( ) . isMarkedNullable ) it else it . asNonNullable ( ) } , encoder = encoder < R > ( ) , ) } }","docstring":"/**\n * Defines a vararg UDF ([UserDefinedFunctionVararg]) instance based on the (lambda) function [varargFunc].\n * For example: `val myUdf = udf { t1: ByteArray -> ... }`\n *\n * If you want to process a column containing an ByteArray instead, use WrappedArray.\n *\n * @param nondeterministic Optional. If true, sets the UserDefinedFunction as nondeterministic.\n * @param varargFunc The function to convert to a UDF. Can be a lambda.\n */"} {"signature":"@ JvmName ( \"\" ) inline fun < reified R > UDFRegistration . register ( name : String , nondeterministic : Boolean = false , varargFunc : UDF1 < ByteArray , R > , ) : NamedUserDefinedFunctionVararg < Byte , R >","body":"= register ( udf ( name , nondeterministic , varargFunc ) )","docstring":"/**\n * Defines and registers a named vararg UDF ([NamedUserDefinedFunctionVararg]) instance based on the (lambda) function [varargFunc].\n * For example: `val myUdf = udf.register(\"myUdf\") { t1: ByteArray -> ... }`\n *\n * If you want to process a column containing an ByteArray instead, use WrappedArray.\n *\n * @param name The name for this UDF.\n * @param nondeterministic Optional. If true, sets the UserDefinedFunction as nondeterministic.\n * @param varargFunc The function to convert to a UDF. Can be a lambda.\n */"} {"signature":"@ JvmName ( \"\" ) inline fun < reified R > udf ( varargFunc : KProperty0 < ( ByteArray ) -> R > , nondeterministic : Boolean = false , ) : NamedUserDefinedFunctionVararg < Byte , R >","body":"= udf ( varargFunc . name , varargFunc , nondeterministic )","docstring":"/**\n * Creates a vararg UDF ([NamedUserDefinedFunctionVararg]) from a function reference adapting its name by reflection.\n * For example: `val myUdf = udf(::myFunction)`\n *\n * If you want to process a column containing an ByteArray instead, use WrappedArray.\n *\n * @param varargFunc function reference\n * @param nondeterministic Optional. If true, sets the UserDefinedFunction as nondeterministic.\n * @see udf\n */"} {"signature":"@ JvmName ( \"\" ) inline fun < reified R > udf ( name : String , varargFunc : KProperty0 < ( ByteArray ) -> R > , nondeterministic : Boolean = false , ) : NamedUserDefinedFunctionVararg < Byte , R >","body":"= udf ( name , nondeterministic , varargFunc . get ( ) )","docstring":"/**\n * Creates a vararg UDF ([NamedUserDefinedFunctionVararg]) from a function reference.\n * For example: `val myUdf = udf(\"myFunction\", ::myFunction)`\n *\n * If you want to process a column containing an ByteArray instead, use WrappedArray.\n *\n * @param name Optional. Name for the UDF.\n * @param varargFunc function reference\n * @param nondeterministic Optional. If true, sets the UserDefinedFunction as nondeterministic.\n * @see udf\n */"} {"signature":"@ JvmName ( \"\" ) inline fun < reified R > UDFRegistration . register ( varargFunc : KProperty0 < ( ByteArray ) -> R > , nondeterministic : Boolean = false , ) : NamedUserDefinedFunctionVararg < Byte , R >","body":"= register ( udf ( varargFunc , nondeterministic ) )","docstring":"/**\n * Creates and registers a vararg UDF ([NamedUserDefinedFunctionVararg]) from a function reference adapting its name by reflection.\n * For example: `val myUdf = udf.register(::myFunction)`\n *\n * If you want to process a column containing an ByteArray instead, use WrappedArray.\n *\n * @param varargFunc function reference\n * @param nondeterministic Optional. If true, sets the UserDefinedFunction as nondeterministic.\n * @see udf\n */"} {"signature":"@ JvmName ( \"\" ) inline fun < reified R > UDFRegistration . register ( name : String , varargFunc : KProperty0 < ( ByteArray ) -> R > , nondeterministic : Boolean = false , ) : NamedUserDefinedFunctionVararg < Byte , R >","body":"= register ( udf ( name , varargFunc , nondeterministic ) )","docstring":"/**\n * Creates and registers a vararg UDF ([NamedUserDefinedFunctionVararg]) from a function reference.\n * For example: `val myUdf = udf.register(\"myFunction\", ::myFunction)`\n *\n * If you want to process a column containing an ByteArray instead, use WrappedArray.\n *\n * @param name Optional. Name for the UDF.\n * @param varargFunc function reference\n * @param nondeterministic Optional. If true, sets the UserDefinedFunction as nondeterministic.\n * @see udf\n */"} {"signature":"@ JvmName ( \"\" ) inline fun < reified R > udf ( varargFunc : KFunction1 < ByteArray , R > , nondeterministic : Boolean = false , ) : NamedUserDefinedFunctionVararg < Byte , R >","body":"= udf ( varargFunc . name , varargFunc , nondeterministic )","docstring":"/**\n * Creates a vararg UDF ([NamedUserDefinedFunctionVararg]) from a function reference adapting its name by reflection.\n * For example: `val myUdf = udf(::myFunction)`\n *\n * If you want to process a column containing an ByteArray instead, use WrappedArray.\n *\n * @param varargFunc function reference\n * @param nondeterministic Optional. If true, sets the UserDefinedFunction as nondeterministic.\n * @see udf\n */"} {"signature":"@ JvmName ( \"\" ) inline fun < reified R > udf ( name : String , varargFunc : KFunction1 < ByteArray , R > , nondeterministic : Boolean = false , ) : NamedUserDefinedFunctionVararg < Byte , R >","body":"= udf ( name , nondeterministic , varargFunc )","docstring":"/**\n * Creates a vararg UDF ([NamedUserDefinedFunctionVararg]) from a function reference.\n * For example: `val myUdf = udf(\"myFunction\", ::myFunction)`\n *\n * If you want to process a column containing an ByteArray instead, use WrappedArray.\n *\n * @param name Optional. Name for the UDF.\n * @param varargFunc function reference\n * @param nondeterministic Optional. If true, sets the UserDefinedFunction as nondeterministic.\n * @see udf\n */"} {"signature":"@ JvmName ( \"\" ) inline fun < reified R > UDFRegistration . register ( varargFunc : KFunction1 < ByteArray , R > , nondeterministic : Boolean = false , ) : NamedUserDefinedFunctionVararg < Byte , R >","body":"= register ( udf ( varargFunc , nondeterministic ) )","docstring":"/**\n * Creates and registers a vararg UDF ([NamedUserDefinedFunctionVararg]) from a function reference adapting its name by reflection.\n * For example: `val myUdf = udf.register(::myFunction)`\n *\n * If you want to process a column containing an ByteArray instead, use WrappedArray.\n *\n * @param varargFunc function reference\n * @param nondeterministic Optional. If true, sets the UserDefinedFunction as nondeterministic.\n * @see udf\n */"} {"signature":"@ JvmName ( \"\" ) inline fun < reified R > UDFRegistration . register ( name : String , varargFunc : KFunction1 < ByteArray , R > , nondeterministic : Boolean = false , ) : NamedUserDefinedFunctionVararg < Byte , R >","body":"= register ( udf ( name , varargFunc , nondeterministic ) )","docstring":"/**\n * Creates and registers a vararg UDF ([NamedUserDefinedFunctionVararg]) from a function reference.\n * For example: `val myUdf = udf.register(\"myFunction\", ::myFunction)`\n *\n * If you want to process a column containing an ByteArray instead, use WrappedArray.\n *\n * @param name Optional. Name for the UDF.\n * @param varargFunc function reference\n * @param nondeterministic Optional. If true, sets the UserDefinedFunction as nondeterministic.\n * @see udf\n */"} {"signature":"@ JvmName ( \"\" ) inline fun < reified R > udf ( name : String , nondeterministic : Boolean = false , varargFunc : UDF1 < ShortArray , R > , ) : NamedUserDefinedFunctionVararg < Short , R >","body":"= udf ( nondeterministic , varargFunc ) . withName ( name )","docstring":"/**\n * Defines a named vararg UDF ([NamedUserDefinedFunctionVararg]) instance based on the (lambda) function [varargFunc].\n * For example: `val myUdf = udf(\"myUdf\") { t1: ShortArray -> ... }`\n * Name can also be supplied using delegate: `val myUdf by udf { t1: ShortArray -> ... }`\n * @see UserDefinedFunction.getValue\n *\n * If you want to process a column containing an ShortArray instead, use WrappedArray.\n *\n * @param name The name for this UDF.\n * @param nondeterministic Optional. If true, sets the UserDefinedFunction as nondeterministic.\n * @param varargFunc The function to convert to a UDF. Can be a lambda.\n */"} {"signature":"@ JvmName ( \"\" ) inline fun < reified R > udf ( nondeterministic : Boolean = false , varargFunc : UDF1 < ShortArray , R > , ) : UserDefinedFunctionVararg < Short , R >","body":"{ return withAllowUntypedScalaUDF { UserDefinedFunctionVararg ( udf = functions . udf ( VarargUnwrapper ( varargFunc ) { i , init -> ShortArray ( i , init :: call ) } , schema ( typeOf < R > ( ) ) . unWrap ( ) ) . let { if ( nondeterministic ) it . asNondeterministic ( ) else it } . let { if ( typeOf < R > ( ) . isMarkedNullable ) it else it . asNonNullable ( ) } , encoder = encoder < R > ( ) , ) } }","docstring":"/**\n * Defines a vararg UDF ([UserDefinedFunctionVararg]) instance based on the (lambda) function [varargFunc].\n * For example: `val myUdf = udf { t1: ShortArray -> ... }`\n *\n * If you want to process a column containing an ShortArray instead, use WrappedArray.\n *\n * @param nondeterministic Optional. If true, sets the UserDefinedFunction as nondeterministic.\n * @param varargFunc The function to convert to a UDF. Can be a lambda.\n */"} {"signature":"@ JvmName ( \"\" ) inline fun < reified R > UDFRegistration . register ( name : String , nondeterministic : Boolean = false , varargFunc : UDF1 < ShortArray , R > , ) : NamedUserDefinedFunctionVararg < Short , R >","body":"= register ( udf ( name , nondeterministic , varargFunc ) )","docstring":"/**\n * Defines and registers a named vararg UDF ([NamedUserDefinedFunctionVararg]) instance based on the (lambda) function [varargFunc].\n * For example: `val myUdf = udf.register(\"myUdf\") { t1: ShortArray -> ... }`\n *\n * If you want to process a column containing an ShortArray instead, use WrappedArray.\n *\n * @param name The name for this UDF.\n * @param nondeterministic Optional. If true, sets the UserDefinedFunction as nondeterministic.\n * @param varargFunc The function to convert to a UDF. Can be a lambda.\n */"} {"signature":"@ JvmName ( \"\" ) inline fun < reified R > udf ( varargFunc : KProperty0 < ( ShortArray ) -> R > , nondeterministic : Boolean = false , ) : NamedUserDefinedFunctionVararg < Short , R >","body":"= udf ( varargFunc . name , varargFunc , nondeterministic )","docstring":"/**\n * Creates a vararg UDF ([NamedUserDefinedFunctionVararg]) from a function reference adapting its name by reflection.\n * For example: `val myUdf = udf(::myFunction)`\n *\n * If you want to process a column containing an ShortArray instead, use WrappedArray.\n *\n * @param varargFunc function reference\n * @param nondeterministic Optional. If true, sets the UserDefinedFunction as nondeterministic.\n * @see udf\n */"} {"signature":"@ JvmName ( \"\" ) inline fun < reified R > udf ( name : String , varargFunc : KProperty0 < ( ShortArray ) -> R > , nondeterministic : Boolean = false , ) : NamedUserDefinedFunctionVararg < Short , R >","body":"= udf ( name , nondeterministic , varargFunc . get ( ) )","docstring":"/**\n * Creates a vararg UDF ([NamedUserDefinedFunctionVararg]) from a function reference.\n * For example: `val myUdf = udf(\"myFunction\", ::myFunction)`\n *\n * If you want to process a column containing an ShortArray instead, use WrappedArray.\n *\n * @param name Optional. Name for the UDF.\n * @param varargFunc function reference\n * @param nondeterministic Optional. If true, sets the UserDefinedFunction as nondeterministic.\n * @see udf\n */"} {"signature":"@ JvmName ( \"\" ) inline fun < reified R > UDFRegistration . register ( varargFunc : KProperty0 < ( ShortArray ) -> R > , nondeterministic : Boolean = false , ) : NamedUserDefinedFunctionVararg < Short , R >","body":"= register ( udf ( varargFunc , nondeterministic ) )","docstring":"/**\n * Creates and registers a vararg UDF ([NamedUserDefinedFunctionVararg]) from a function reference adapting its name by reflection.\n * For example: `val myUdf = udf.register(::myFunction)`\n *\n * If you want to process a column containing an ShortArray instead, use WrappedArray.\n *\n * @param varargFunc function reference\n * @param nondeterministic Optional. If true, sets the UserDefinedFunction as nondeterministic.\n * @see udf\n */"} {"signature":"@ JvmName ( \"\" ) inline fun < reified R > UDFRegistration . register ( name : String , varargFunc : KProperty0 < ( ShortArray ) -> R > , nondeterministic : Boolean = false , ) : NamedUserDefinedFunctionVararg < Short , R >","body":"= register ( udf ( name , varargFunc , nondeterministic ) )","docstring":"/**\n * Creates and registers a vararg UDF ([NamedUserDefinedFunctionVararg]) from a function reference.\n * For example: `val myUdf = udf.register(\"myFunction\", ::myFunction)`\n *\n * If you want to process a column containing an ShortArray instead, use WrappedArray.\n *\n * @param name Optional. Name for the UDF.\n * @param varargFunc function reference\n * @param nondeterministic Optional. If true, sets the UserDefinedFunction as nondeterministic.\n * @see udf\n */"} {"signature":"@ JvmName ( \"\" ) inline fun < reified R > udf ( varargFunc : KFunction1 < ShortArray , R > , nondeterministic : Boolean = false , ) : NamedUserDefinedFunctionVararg < Short , R >","body":"= udf ( varargFunc . name , varargFunc , nondeterministic )","docstring":"/**\n * Creates a vararg UDF ([NamedUserDefinedFunctionVararg]) from a function reference adapting its name by reflection.\n * For example: `val myUdf = udf(::myFunction)`\n *\n * If you want to process a column containing an ShortArray instead, use WrappedArray.\n *\n * @param varargFunc function reference\n * @param nondeterministic Optional. If true, sets the UserDefinedFunction as nondeterministic.\n * @see udf\n */"} {"signature":"@ JvmName ( \"\" ) inline fun < reified R > udf ( name : String , varargFunc : KFunction1 < ShortArray , R > , nondeterministic : Boolean = false , ) : NamedUserDefinedFunctionVararg < Short , R >","body":"= udf ( name , nondeterministic , varargFunc )","docstring":"/**\n * Creates a vararg UDF ([NamedUserDefinedFunctionVararg]) from a function reference.\n * For example: `val myUdf = udf(\"myFunction\", ::myFunction)`\n *\n * If you want to process a column containing an ShortArray instead, use WrappedArray.\n *\n * @param name Optional. Name for the UDF.\n * @param varargFunc function reference\n * @param nondeterministic Optional. If true, sets the UserDefinedFunction as nondeterministic.\n * @see udf\n */"} {"signature":"@ JvmName ( \"\" ) inline fun < reified R > UDFRegistration . register ( varargFunc : KFunction1 < ShortArray , R > , nondeterministic : Boolean = false , ) : NamedUserDefinedFunctionVararg < Short , R >","body":"= register ( udf ( varargFunc , nondeterministic ) )","docstring":"/**\n * Creates and registers a vararg UDF ([NamedUserDefinedFunctionVararg]) from a function reference adapting its name by reflection.\n * For example: `val myUdf = udf.register(::myFunction)`\n *\n * If you want to process a column containing an ShortArray instead, use WrappedArray.\n *\n * @param varargFunc function reference\n * @param nondeterministic Optional. If true, sets the UserDefinedFunction as nondeterministic.\n * @see udf\n */"} {"signature":"@ JvmName ( \"\" ) inline fun < reified R > UDFRegistration . register ( name : String , varargFunc : KFunction1 < ShortArray , R > , nondeterministic : Boolean = false , ) : NamedUserDefinedFunctionVararg < Short , R >","body":"= register ( udf ( name , varargFunc , nondeterministic ) )","docstring":"/**\n * Creates and registers a vararg UDF ([NamedUserDefinedFunctionVararg]) from a function reference.\n * For example: `val myUdf = udf.register(\"myFunction\", ::myFunction)`\n *\n * If you want to process a column containing an ShortArray instead, use WrappedArray.\n *\n * @param name Optional. Name for the UDF.\n * @param varargFunc function reference\n * @param nondeterministic Optional. If true, sets the UserDefinedFunction as nondeterministic.\n * @see udf\n */"} {"signature":"@ JvmName ( \"\" ) inline fun < reified R > udf ( name : String , nondeterministic : Boolean = false , varargFunc : UDF1 < IntArray , R > , ) : NamedUserDefinedFunctionVararg < Int , R >","body":"= udf ( nondeterministic , varargFunc ) . withName ( name )","docstring":"/**\n * Defines a named vararg UDF ([NamedUserDefinedFunctionVararg]) instance based on the (lambda) function [varargFunc].\n * For example: `val myUdf = udf(\"myUdf\") { t1: IntArray -> ... }`\n * Name can also be supplied using delegate: `val myUdf by udf { t1: IntArray -> ... }`\n * @see UserDefinedFunction.getValue\n *\n * If you want to process a column containing an IntArray instead, use WrappedArray.\n *\n * @param name The name for this UDF.\n * @param nondeterministic Optional. If true, sets the UserDefinedFunction as nondeterministic.\n * @param varargFunc The function to convert to a UDF. Can be a lambda.\n */"} {"signature":"@ JvmName ( \"\" ) inline fun < reified R > udf ( nondeterministic : Boolean = false , varargFunc : UDF1 < IntArray , R > , ) : UserDefinedFunctionVararg < Int , R >","body":"{ return withAllowUntypedScalaUDF { UserDefinedFunctionVararg ( udf = functions . udf ( VarargUnwrapper ( varargFunc ) { i , init -> IntArray ( i , init :: call ) } , schema ( typeOf < R > ( ) ) . unWrap ( ) ) . let { if ( nondeterministic ) it . asNondeterministic ( ) else it } . let { if ( typeOf < R > ( ) . isMarkedNullable ) it else it . asNonNullable ( ) } , encoder = encoder < R > ( ) , ) } }","docstring":"/**\n * Defines a vararg UDF ([UserDefinedFunctionVararg]) instance based on the (lambda) function [varargFunc].\n * For example: `val myUdf = udf { t1: IntArray -> ... }`\n *\n * If you want to process a column containing an IntArray instead, use WrappedArray.\n *\n * @param nondeterministic Optional. If true, sets the UserDefinedFunction as nondeterministic.\n * @param varargFunc The function to convert to a UDF. Can be a lambda.\n */"} {"signature":"@ JvmName ( \"\" ) inline fun < reified R > UDFRegistration . register ( name : String , nondeterministic : Boolean = false , varargFunc : UDF1 < IntArray , R > , ) : NamedUserDefinedFunctionVararg < Int , R >","body":"= register ( udf ( name , nondeterministic , varargFunc ) )","docstring":"/**\n * Defines and registers a named vararg UDF ([NamedUserDefinedFunctionVararg]) instance based on the (lambda) function [varargFunc].\n * For example: `val myUdf = udf.register(\"myUdf\") { t1: IntArray -> ... }`\n *\n * If you want to process a column containing an IntArray instead, use WrappedArray.\n *\n * @param name The name for this UDF.\n * @param nondeterministic Optional. If true, sets the UserDefinedFunction as nondeterministic.\n * @param varargFunc The function to convert to a UDF. Can be a lambda.\n */"} {"signature":"@ JvmName ( \"\" ) inline fun < reified R > udf ( varargFunc : KProperty0 < ( IntArray ) -> R > , nondeterministic : Boolean = false , ) : NamedUserDefinedFunctionVararg < Int , R >","body":"= udf ( varargFunc . name , varargFunc , nondeterministic )","docstring":"/**\n * Creates a vararg UDF ([NamedUserDefinedFunctionVararg]) from a function reference adapting its name by reflection.\n * For example: `val myUdf = udf(::myFunction)`\n *\n * If you want to process a column containing an IntArray instead, use WrappedArray.\n *\n * @param varargFunc function reference\n * @param nondeterministic Optional. If true, sets the UserDefinedFunction as nondeterministic.\n * @see udf\n */"} {"signature":"@ JvmName ( \"\" ) inline fun < reified R > udf ( name : String , varargFunc : KProperty0 < ( IntArray ) -> R > , nondeterministic : Boolean = false , ) : NamedUserDefinedFunctionVararg < Int , R >","body":"= udf ( name , nondeterministic , varargFunc . get ( ) )","docstring":"/**\n * Creates a vararg UDF ([NamedUserDefinedFunctionVararg]) from a function reference.\n * For example: `val myUdf = udf(\"myFunction\", ::myFunction)`\n *\n * If you want to process a column containing an IntArray instead, use WrappedArray.\n *\n * @param name Optional. Name for the UDF.\n * @param varargFunc function reference\n * @param nondeterministic Optional. If true, sets the UserDefinedFunction as nondeterministic.\n * @see udf\n */"} {"signature":"@ JvmName ( \"\" ) inline fun < reified R > UDFRegistration . register ( varargFunc : KProperty0 < ( IntArray ) -> R > , nondeterministic : Boolean = false , ) : NamedUserDefinedFunctionVararg < Int , R >","body":"= register ( udf ( varargFunc , nondeterministic ) )","docstring":"/**\n * Creates and registers a vararg UDF ([NamedUserDefinedFunctionVararg]) from a function reference adapting its name by reflection.\n * For example: `val myUdf = udf.register(::myFunction)`\n *\n * If you want to process a column containing an IntArray instead, use WrappedArray.\n *\n * @param varargFunc function reference\n * @param nondeterministic Optional. If true, sets the UserDefinedFunction as nondeterministic.\n * @see udf\n */"} {"signature":"@ JvmName ( \"\" ) inline fun < reified R > UDFRegistration . register ( name : String , varargFunc : KProperty0 < ( IntArray ) -> R > , nondeterministic : Boolean = false , ) : NamedUserDefinedFunctionVararg < Int , R >","body":"= register ( udf ( name , varargFunc , nondeterministic ) )","docstring":"/**\n * Creates and registers a vararg UDF ([NamedUserDefinedFunctionVararg]) from a function reference.\n * For example: `val myUdf = udf.register(\"myFunction\", ::myFunction)`\n *\n * If you want to process a column containing an IntArray instead, use WrappedArray.\n *\n * @param name Optional. Name for the UDF.\n * @param varargFunc function reference\n * @param nondeterministic Optional. If true, sets the UserDefinedFunction as nondeterministic.\n * @see udf\n */"} {"signature":"@ JvmName ( \"\" ) inline fun < reified R > udf ( varargFunc : KFunction1 < IntArray , R > , nondeterministic : Boolean = false , ) : NamedUserDefinedFunctionVararg < Int , R >","body":"= udf ( varargFunc . name , varargFunc , nondeterministic )","docstring":"/**\n * Creates a vararg UDF ([NamedUserDefinedFunctionVararg]) from a function reference adapting its name by reflection.\n * For example: `val myUdf = udf(::myFunction)`\n *\n * If you want to process a column containing an IntArray instead, use WrappedArray.\n *\n * @param varargFunc function reference\n * @param nondeterministic Optional. If true, sets the UserDefinedFunction as nondeterministic.\n * @see udf\n */"} {"signature":"@ JvmName ( \"\" ) inline fun < reified R > udf ( name : String , varargFunc : KFunction1 < IntArray , R > , nondeterministic : Boolean = false , ) : NamedUserDefinedFunctionVararg < Int , R >","body":"= udf ( name , nondeterministic , varargFunc )","docstring":"/**\n * Creates a vararg UDF ([NamedUserDefinedFunctionVararg]) from a function reference.\n * For example: `val myUdf = udf(\"myFunction\", ::myFunction)`\n *\n * If you want to process a column containing an IntArray instead, use WrappedArray.\n *\n * @param name Optional. Name for the UDF.\n * @param varargFunc function reference\n * @param nondeterministic Optional. If true, sets the UserDefinedFunction as nondeterministic.\n * @see udf\n */"} {"signature":"@ JvmName ( \"\" ) inline fun < reified R > UDFRegistration . register ( varargFunc : KFunction1 < IntArray , R > , nondeterministic : Boolean = false , ) : NamedUserDefinedFunctionVararg < Int , R >","body":"= register ( udf ( varargFunc , nondeterministic ) )","docstring":"/**\n * Creates and registers a vararg UDF ([NamedUserDefinedFunctionVararg]) from a function reference adapting its name by reflection.\n * For example: `val myUdf = udf.register(::myFunction)`\n *\n * If you want to process a column containing an IntArray instead, use WrappedArray.\n *\n * @param varargFunc function reference\n * @param nondeterministic Optional. If true, sets the UserDefinedFunction as nondeterministic.\n * @see udf\n */"} {"signature":"@ JvmName ( \"\" ) inline fun < reified R > UDFRegistration . register ( name : String , varargFunc : KFunction1 < IntArray , R > , nondeterministic : Boolean = false , ) : NamedUserDefinedFunctionVararg < Int , R >","body":"= register ( udf ( name , varargFunc , nondeterministic ) )","docstring":"/**\n * Creates and registers a vararg UDF ([NamedUserDefinedFunctionVararg]) from a function reference.\n * For example: `val myUdf = udf.register(\"myFunction\", ::myFunction)`\n *\n * If you want to process a column containing an IntArray instead, use WrappedArray.\n *\n * @param name Optional. Name for the UDF.\n * @param varargFunc function reference\n * @param nondeterministic Optional. If true, sets the UserDefinedFunction as nondeterministic.\n * @see udf\n */"} {"signature":"@ JvmName ( \"\" ) inline fun < reified R > udf ( name : String , nondeterministic : Boolean = false , varargFunc : UDF1 < LongArray , R > , ) : NamedUserDefinedFunctionVararg < Long , R >","body":"= udf ( nondeterministic , varargFunc ) . withName ( name )","docstring":"/**\n * Defines a named vararg UDF ([NamedUserDefinedFunctionVararg]) instance based on the (lambda) function [varargFunc].\n * For example: `val myUdf = udf(\"myUdf\") { t1: LongArray -> ... }`\n * Name can also be supplied using delegate: `val myUdf by udf { t1: LongArray -> ... }`\n * @see UserDefinedFunction.getValue\n *\n * If you want to process a column containing an LongArray instead, use WrappedArray.\n *\n * @param name The name for this UDF.\n * @param nondeterministic Optional. If true, sets the UserDefinedFunction as nondeterministic.\n * @param varargFunc The function to convert to a UDF. Can be a lambda.\n */"} {"signature":"@ JvmName ( \"\" ) inline fun < reified R > udf ( nondeterministic : Boolean = false , varargFunc : UDF1 < LongArray , R > , ) : UserDefinedFunctionVararg < Long , R >","body":"{ return withAllowUntypedScalaUDF { UserDefinedFunctionVararg ( udf = functions . udf ( VarargUnwrapper ( varargFunc ) { i , init -> LongArray ( i , init :: call ) } , schema ( typeOf < R > ( ) ) . unWrap ( ) ) . let { if ( nondeterministic ) it . asNondeterministic ( ) else it } . let { if ( typeOf < R > ( ) . isMarkedNullable ) it else it . asNonNullable ( ) } , encoder = encoder < R > ( ) , ) } }","docstring":"/**\n * Defines a vararg UDF ([UserDefinedFunctionVararg]) instance based on the (lambda) function [varargFunc].\n * For example: `val myUdf = udf { t1: LongArray -> ... }`\n *\n * If you want to process a column containing an LongArray instead, use WrappedArray.\n *\n * @param nondeterministic Optional. If true, sets the UserDefinedFunction as nondeterministic.\n * @param varargFunc The function to convert to a UDF. Can be a lambda.\n */"} {"signature":"@ JvmName ( \"\" ) inline fun < reified R > UDFRegistration . register ( name : String , nondeterministic : Boolean = false , varargFunc : UDF1 < LongArray , R > , ) : NamedUserDefinedFunctionVararg < Long , R >","body":"= register ( udf ( name , nondeterministic , varargFunc ) )","docstring":"/**\n * Defines and registers a named vararg UDF ([NamedUserDefinedFunctionVararg]) instance based on the (lambda) function [varargFunc].\n * For example: `val myUdf = udf.register(\"myUdf\") { t1: LongArray -> ... }`\n *\n * If you want to process a column containing an LongArray instead, use WrappedArray.\n *\n * @param name The name for this UDF.\n * @param nondeterministic Optional. If true, sets the UserDefinedFunction as nondeterministic.\n * @param varargFunc The function to convert to a UDF. Can be a lambda.\n */"} {"signature":"@ JvmName ( \"\" ) inline fun < reified R > udf ( varargFunc : KProperty0 < ( LongArray ) -> R > , nondeterministic : Boolean = false , ) : NamedUserDefinedFunctionVararg < Long , R >","body":"= udf ( varargFunc . name , varargFunc , nondeterministic )","docstring":"/**\n * Creates a vararg UDF ([NamedUserDefinedFunctionVararg]) from a function reference adapting its name by reflection.\n * For example: `val myUdf = udf(::myFunction)`\n *\n * If you want to process a column containing an LongArray instead, use WrappedArray.\n *\n * @param varargFunc function reference\n * @param nondeterministic Optional. If true, sets the UserDefinedFunction as nondeterministic.\n * @see udf\n */"} {"signature":"@ JvmName ( \"\" ) inline fun < reified R > udf ( name : String , varargFunc : KProperty0 < ( LongArray ) -> R > , nondeterministic : Boolean = false , ) : NamedUserDefinedFunctionVararg < Long , R >","body":"= udf ( name , nondeterministic , varargFunc . get ( ) )","docstring":"/**\n * Creates a vararg UDF ([NamedUserDefinedFunctionVararg]) from a function reference.\n * For example: `val myUdf = udf(\"myFunction\", ::myFunction)`\n *\n * If you want to process a column containing an LongArray instead, use WrappedArray.\n *\n * @param name Optional. Name for the UDF.\n * @param varargFunc function reference\n * @param nondeterministic Optional. If true, sets the UserDefinedFunction as nondeterministic.\n * @see udf\n */"} {"signature":"@ JvmName ( \"\" ) inline fun < reified R > UDFRegistration . register ( varargFunc : KProperty0 < ( LongArray ) -> R > , nondeterministic : Boolean = false , ) : NamedUserDefinedFunctionVararg < Long , R >","body":"= register ( udf ( varargFunc , nondeterministic ) )","docstring":"/**\n * Creates and registers a vararg UDF ([NamedUserDefinedFunctionVararg]) from a function reference adapting its name by reflection.\n * For example: `val myUdf = udf.register(::myFunction)`\n *\n * If you want to process a column containing an LongArray instead, use WrappedArray.\n *\n * @param varargFunc function reference\n * @param nondeterministic Optional. If true, sets the UserDefinedFunction as nondeterministic.\n * @see udf\n */"} {"signature":"@ JvmName ( \"\" ) inline fun < reified R > UDFRegistration . register ( name : String , varargFunc : KProperty0 < ( LongArray ) -> R > , nondeterministic : Boolean = false , ) : NamedUserDefinedFunctionVararg < Long , R >","body":"= register ( udf ( name , varargFunc , nondeterministic ) )","docstring":"/**\n * Creates and registers a vararg UDF ([NamedUserDefinedFunctionVararg]) from a function reference.\n * For example: `val myUdf = udf.register(\"myFunction\", ::myFunction)`\n *\n * If you want to process a column containing an LongArray instead, use WrappedArray.\n *\n * @param name Optional. Name for the UDF.\n * @param varargFunc function reference\n * @param nondeterministic Optional. If true, sets the UserDefinedFunction as nondeterministic.\n * @see udf\n */"} {"signature":"@ JvmName ( \"\" ) inline fun < reified R > udf ( varargFunc : KFunction1 < LongArray , R > , nondeterministic : Boolean = false , ) : NamedUserDefinedFunctionVararg < Long , R >","body":"= udf ( varargFunc . name , varargFunc , nondeterministic )","docstring":"/**\n * Creates a vararg UDF ([NamedUserDefinedFunctionVararg]) from a function reference adapting its name by reflection.\n * For example: `val myUdf = udf(::myFunction)`\n *\n * If you want to process a column containing an LongArray instead, use WrappedArray.\n *\n * @param varargFunc function reference\n * @param nondeterministic Optional. If true, sets the UserDefinedFunction as nondeterministic.\n * @see udf\n */"} {"signature":"@ JvmName ( \"\" ) inline fun < reified R > udf ( name : String , varargFunc : KFunction1 < LongArray , R > , nondeterministic : Boolean = false , ) : NamedUserDefinedFunctionVararg < Long , R >","body":"= udf ( name , nondeterministic , varargFunc )","docstring":"/**\n * Creates a vararg UDF ([NamedUserDefinedFunctionVararg]) from a function reference.\n * For example: `val myUdf = udf(\"myFunction\", ::myFunction)`\n *\n * If you want to process a column containing an LongArray instead, use WrappedArray.\n *\n * @param name Optional. Name for the UDF.\n * @param varargFunc function reference\n * @param nondeterministic Optional. If true, sets the UserDefinedFunction as nondeterministic.\n * @see udf\n */"} {"signature":"@ JvmName ( \"\" ) inline fun < reified R > UDFRegistration . register ( varargFunc : KFunction1 < LongArray , R > , nondeterministic : Boolean = false , ) : NamedUserDefinedFunctionVararg < Long , R >","body":"= register ( udf ( varargFunc , nondeterministic ) )","docstring":"/**\n * Creates and registers a vararg UDF ([NamedUserDefinedFunctionVararg]) from a function reference adapting its name by reflection.\n * For example: `val myUdf = udf.register(::myFunction)`\n *\n * If you want to process a column containing an LongArray instead, use WrappedArray.\n *\n * @param varargFunc function reference\n * @param nondeterministic Optional. If true, sets the UserDefinedFunction as nondeterministic.\n * @see udf\n */"} {"signature":"@ JvmName ( \"\" ) inline fun < reified R > UDFRegistration . register ( name : String , varargFunc : KFunction1 < LongArray , R > , nondeterministic : Boolean = false , ) : NamedUserDefinedFunctionVararg < Long , R >","body":"= register ( udf ( name , varargFunc , nondeterministic ) )","docstring":"/**\n * Creates and registers a vararg UDF ([NamedUserDefinedFunctionVararg]) from a function reference.\n * For example: `val myUdf = udf.register(\"myFunction\", ::myFunction)`\n *\n * If you want to process a column containing an LongArray instead, use WrappedArray.\n *\n * @param name Optional. Name for the UDF.\n * @param varargFunc function reference\n * @param nondeterministic Optional. If true, sets the UserDefinedFunction as nondeterministic.\n * @see udf\n */"} {"signature":"@ JvmName ( \"\" ) inline fun < reified R > udf ( name : String , nondeterministic : Boolean = false , varargFunc : UDF1 < FloatArray , R > , ) : NamedUserDefinedFunctionVararg < Float , R >","body":"= udf ( nondeterministic , varargFunc ) . withName ( name )","docstring":"/**\n * Defines a named vararg UDF ([NamedUserDefinedFunctionVararg]) instance based on the (lambda) function [varargFunc].\n * For example: `val myUdf = udf(\"myUdf\") { t1: FloatArray -> ... }`\n * Name can also be supplied using delegate: `val myUdf by udf { t1: FloatArray -> ... }`\n * @see UserDefinedFunction.getValue\n *\n * If you want to process a column containing an FloatArray instead, use WrappedArray.\n *\n * @param name The name for this UDF.\n * @param nondeterministic Optional. If true, sets the UserDefinedFunction as nondeterministic.\n * @param varargFunc The function to convert to a UDF. Can be a lambda.\n */"} {"signature":"@ JvmName ( \"\" ) inline fun < reified R > udf ( nondeterministic : Boolean = false , varargFunc : UDF1 < FloatArray , R > , ) : UserDefinedFunctionVararg < Float , R >","body":"{ return withAllowUntypedScalaUDF { UserDefinedFunctionVararg ( udf = functions . udf ( VarargUnwrapper ( varargFunc ) { i , init -> FloatArray ( i , init :: call ) } , schema ( typeOf < R > ( ) ) . unWrap ( ) ) . let { if ( nondeterministic ) it . asNondeterministic ( ) else it } . let { if ( typeOf < R > ( ) . isMarkedNullable ) it else it . asNonNullable ( ) } , encoder = encoder < R > ( ) , ) } }","docstring":"/**\n * Defines a vararg UDF ([UserDefinedFunctionVararg]) instance based on the (lambda) function [varargFunc].\n * For example: `val myUdf = udf { t1: FloatArray -> ... }`\n *\n * If you want to process a column containing an FloatArray instead, use WrappedArray.\n *\n * @param nondeterministic Optional. If true, sets the UserDefinedFunction as nondeterministic.\n * @param varargFunc The function to convert to a UDF. Can be a lambda.\n */"} {"signature":"@ JvmName ( \"\" ) inline fun < reified R > UDFRegistration . register ( name : String , nondeterministic : Boolean = false , varargFunc : UDF1 < FloatArray , R > , ) : NamedUserDefinedFunctionVararg < Float , R >","body":"= register ( udf ( name , nondeterministic , varargFunc ) )","docstring":"/**\n * Defines and registers a named vararg UDF ([NamedUserDefinedFunctionVararg]) instance based on the (lambda) function [varargFunc].\n * For example: `val myUdf = udf.register(\"myUdf\") { t1: FloatArray -> ... }`\n *\n * If you want to process a column containing an FloatArray instead, use WrappedArray.\n *\n * @param name The name for this UDF.\n * @param nondeterministic Optional. If true, sets the UserDefinedFunction as nondeterministic.\n * @param varargFunc The function to convert to a UDF. Can be a lambda.\n */"} {"signature":"@ JvmName ( \"\" ) inline fun < reified R > udf ( varargFunc : KProperty0 < ( FloatArray ) -> R > , nondeterministic : Boolean = false , ) : NamedUserDefinedFunctionVararg < Float , R >","body":"= udf ( varargFunc . name , varargFunc , nondeterministic )","docstring":"/**\n * Creates a vararg UDF ([NamedUserDefinedFunctionVararg]) from a function reference adapting its name by reflection.\n * For example: `val myUdf = udf(::myFunction)`\n *\n * If you want to process a column containing an FloatArray instead, use WrappedArray.\n *\n * @param varargFunc function reference\n * @param nondeterministic Optional. If true, sets the UserDefinedFunction as nondeterministic.\n * @see udf\n */"} {"signature":"@ JvmName ( \"\" ) inline fun < reified R > udf ( name : String , varargFunc : KProperty0 < ( FloatArray ) -> R > , nondeterministic : Boolean = false , ) : NamedUserDefinedFunctionVararg < Float , R >","body":"= udf ( name , nondeterministic , varargFunc . get ( ) )","docstring":"/**\n * Creates a vararg UDF ([NamedUserDefinedFunctionVararg]) from a function reference.\n * For example: `val myUdf = udf(\"myFunction\", ::myFunction)`\n *\n * If you want to process a column containing an FloatArray instead, use WrappedArray.\n *\n * @param name Optional. Name for the UDF.\n * @param varargFunc function reference\n * @param nondeterministic Optional. If true, sets the UserDefinedFunction as nondeterministic.\n * @see udf\n */"} {"signature":"@ JvmName ( \"\" ) inline fun < reified R > UDFRegistration . register ( varargFunc : KProperty0 < ( FloatArray ) -> R > , nondeterministic : Boolean = false , ) : NamedUserDefinedFunctionVararg < Float , R >","body":"= register ( udf ( varargFunc , nondeterministic ) )","docstring":"/**\n * Creates and registers a vararg UDF ([NamedUserDefinedFunctionVararg]) from a function reference adapting its name by reflection.\n * For example: `val myUdf = udf.register(::myFunction)`\n *\n * If you want to process a column containing an FloatArray instead, use WrappedArray.\n *\n * @param varargFunc function reference\n * @param nondeterministic Optional. If true, sets the UserDefinedFunction as nondeterministic.\n * @see udf\n */"} {"signature":"@ JvmName ( \"\" ) inline fun < reified R > UDFRegistration . register ( name : String , varargFunc : KProperty0 < ( FloatArray ) -> R > , nondeterministic : Boolean = false , ) : NamedUserDefinedFunctionVararg < Float , R >","body":"= register ( udf ( name , varargFunc , nondeterministic ) )","docstring":"/**\n * Creates and registers a vararg UDF ([NamedUserDefinedFunctionVararg]) from a function reference.\n * For example: `val myUdf = udf.register(\"myFunction\", ::myFunction)`\n *\n * If you want to process a column containing an FloatArray instead, use WrappedArray.\n *\n * @param name Optional. Name for the UDF.\n * @param varargFunc function reference\n * @param nondeterministic Optional. If true, sets the UserDefinedFunction as nondeterministic.\n * @see udf\n */"} {"signature":"@ JvmName ( \"\" ) inline fun < reified R > udf ( varargFunc : KFunction1 < FloatArray , R > , nondeterministic : Boolean = false , ) : NamedUserDefinedFunctionVararg < Float , R >","body":"= udf ( varargFunc . name , varargFunc , nondeterministic )","docstring":"/**\n * Creates a vararg UDF ([NamedUserDefinedFunctionVararg]) from a function reference adapting its name by reflection.\n * For example: `val myUdf = udf(::myFunction)`\n *\n * If you want to process a column containing an FloatArray instead, use WrappedArray.\n *\n * @param varargFunc function reference\n * @param nondeterministic Optional. If true, sets the UserDefinedFunction as nondeterministic.\n * @see udf\n */"} {"signature":"@ JvmName ( \"\" ) inline fun < reified R > udf ( name : String , varargFunc : KFunction1 < FloatArray , R > , nondeterministic : Boolean = false , ) : NamedUserDefinedFunctionVararg < Float , R >","body":"= udf ( name , nondeterministic , varargFunc )","docstring":"/**\n * Creates a vararg UDF ([NamedUserDefinedFunctionVararg]) from a function reference.\n * For example: `val myUdf = udf(\"myFunction\", ::myFunction)`\n *\n * If you want to process a column containing an FloatArray instead, use WrappedArray.\n *\n * @param name Optional. Name for the UDF.\n * @param varargFunc function reference\n * @param nondeterministic Optional. If true, sets the UserDefinedFunction as nondeterministic.\n * @see udf\n */"} {"signature":"@ JvmName ( \"\" ) inline fun < reified R > UDFRegistration . register ( varargFunc : KFunction1 < FloatArray , R > , nondeterministic : Boolean = false , ) : NamedUserDefinedFunctionVararg < Float , R >","body":"= register ( udf ( varargFunc , nondeterministic ) )","docstring":"/**\n * Creates and registers a vararg UDF ([NamedUserDefinedFunctionVararg]) from a function reference adapting its name by reflection.\n * For example: `val myUdf = udf.register(::myFunction)`\n *\n * If you want to process a column containing an FloatArray instead, use WrappedArray.\n *\n * @param varargFunc function reference\n * @param nondeterministic Optional. If true, sets the UserDefinedFunction as nondeterministic.\n * @see udf\n */"} {"signature":"@ JvmName ( \"\" ) inline fun < reified R > UDFRegistration . register ( name : String , varargFunc : KFunction1 < FloatArray , R > , nondeterministic : Boolean = false , ) : NamedUserDefinedFunctionVararg < Float , R >","body":"= register ( udf ( name , varargFunc , nondeterministic ) )","docstring":"/**\n * Creates and registers a vararg UDF ([NamedUserDefinedFunctionVararg]) from a function reference.\n * For example: `val myUdf = udf.register(\"myFunction\", ::myFunction)`\n *\n * If you want to process a column containing an FloatArray instead, use WrappedArray.\n *\n * @param name Optional. Name for the UDF.\n * @param varargFunc function reference\n * @param nondeterministic Optional. If true, sets the UserDefinedFunction as nondeterministic.\n * @see udf\n */"} {"signature":"@ JvmName ( \"\" ) inline fun < reified R > udf ( name : String , nondeterministic : Boolean = false , varargFunc : UDF1 < DoubleArray , R > , ) : NamedUserDefinedFunctionVararg < Double , R >","body":"= udf ( nondeterministic , varargFunc ) . withName ( name )","docstring":"/**\n * Defines a named vararg UDF ([NamedUserDefinedFunctionVararg]) instance based on the (lambda) function [varargFunc].\n * For example: `val myUdf = udf(\"myUdf\") { t1: DoubleArray -> ... }`\n * Name can also be supplied using delegate: `val myUdf by udf { t1: DoubleArray -> ... }`\n * @see UserDefinedFunction.getValue\n *\n * If you want to process a column containing an DoubleArray instead, use WrappedArray.\n *\n * @param name The name for this UDF.\n * @param nondeterministic Optional. If true, sets the UserDefinedFunction as nondeterministic.\n * @param varargFunc The function to convert to a UDF. Can be a lambda.\n */"} {"signature":"@ JvmName ( \"\" ) inline fun < reified R > udf ( nondeterministic : Boolean = false , varargFunc : UDF1 < DoubleArray , R > , ) : UserDefinedFunctionVararg < Double , R >","body":"{ return withAllowUntypedScalaUDF { UserDefinedFunctionVararg ( udf = functions . udf ( VarargUnwrapper ( varargFunc ) { i , init -> DoubleArray ( i , init :: call ) } , schema ( typeOf < R > ( ) ) . unWrap ( ) ) . let { if ( nondeterministic ) it . asNondeterministic ( ) else it } . let { if ( typeOf < R > ( ) . isMarkedNullable ) it else it . asNonNullable ( ) } , encoder = encoder < R > ( ) , ) } }","docstring":"/**\n * Defines a vararg UDF ([UserDefinedFunctionVararg]) instance based on the (lambda) function [varargFunc].\n * For example: `val myUdf = udf { t1: DoubleArray -> ... }`\n *\n * If you want to process a column containing an DoubleArray instead, use WrappedArray.\n *\n * @param nondeterministic Optional. If true, sets the UserDefinedFunction as nondeterministic.\n * @param varargFunc The function to convert to a UDF. Can be a lambda.\n */"} {"signature":"@ JvmName ( \"\" ) inline fun < reified R > UDFRegistration . register ( name : String , nondeterministic : Boolean = false , varargFunc : UDF1 < DoubleArray , R > , ) : NamedUserDefinedFunctionVararg < Double , R >","body":"= register ( udf ( name , nondeterministic , varargFunc ) )","docstring":"/**\n * Defines and registers a named vararg UDF ([NamedUserDefinedFunctionVararg]) instance based on the (lambda) function [varargFunc].\n * For example: `val myUdf = udf.register(\"myUdf\") { t1: DoubleArray -> ... }`\n *\n * If you want to process a column containing an DoubleArray instead, use WrappedArray.\n *\n * @param name The name for this UDF.\n * @param nondeterministic Optional. If true, sets the UserDefinedFunction as nondeterministic.\n * @param varargFunc The function to convert to a UDF. Can be a lambda.\n */"} {"signature":"@ JvmName ( \"\" ) inline fun < reified R > udf ( varargFunc : KProperty0 < ( DoubleArray ) -> R > , nondeterministic : Boolean = false , ) : NamedUserDefinedFunctionVararg < Double , R >","body":"= udf ( varargFunc . name , varargFunc , nondeterministic )","docstring":"/**\n * Creates a vararg UDF ([NamedUserDefinedFunctionVararg]) from a function reference adapting its name by reflection.\n * For example: `val myUdf = udf(::myFunction)`\n *\n * If you want to process a column containing an DoubleArray instead, use WrappedArray.\n *\n * @param varargFunc function reference\n * @param nondeterministic Optional. If true, sets the UserDefinedFunction as nondeterministic.\n * @see udf\n */"} {"signature":"@ JvmName ( \"\" ) inline fun < reified R > udf ( name : String , varargFunc : KProperty0 < ( DoubleArray ) -> R > , nondeterministic : Boolean = false , ) : NamedUserDefinedFunctionVararg < Double , R >","body":"= udf ( name , nondeterministic , varargFunc . get ( ) )","docstring":"/**\n * Creates a vararg UDF ([NamedUserDefinedFunctionVararg]) from a function reference.\n * For example: `val myUdf = udf(\"myFunction\", ::myFunction)`\n *\n * If you want to process a column containing an DoubleArray instead, use WrappedArray.\n *\n * @param name Optional. Name for the UDF.\n * @param varargFunc function reference\n * @param nondeterministic Optional. If true, sets the UserDefinedFunction as nondeterministic.\n * @see udf\n */"} {"signature":"@ JvmName ( \"\" ) inline fun < reified R > UDFRegistration . register ( varargFunc : KProperty0 < ( DoubleArray ) -> R > , nondeterministic : Boolean = false , ) : NamedUserDefinedFunctionVararg < Double , R >","body":"= register ( udf ( varargFunc , nondeterministic ) )","docstring":"/**\n * Creates and registers a vararg UDF ([NamedUserDefinedFunctionVararg]) from a function reference adapting its name by reflection.\n * For example: `val myUdf = udf.register(::myFunction)`\n *\n * If you want to process a column containing an DoubleArray instead, use WrappedArray.\n *\n * @param varargFunc function reference\n * @param nondeterministic Optional. If true, sets the UserDefinedFunction as nondeterministic.\n * @see udf\n */"} {"signature":"@ JvmName ( \"\" ) inline fun < reified R > UDFRegistration . register ( name : String , varargFunc : KProperty0 < ( DoubleArray ) -> R > , nondeterministic : Boolean = false , ) : NamedUserDefinedFunctionVararg < Double , R >","body":"= register ( udf ( name , varargFunc , nondeterministic ) )","docstring":"/**\n * Creates and registers a vararg UDF ([NamedUserDefinedFunctionVararg]) from a function reference.\n * For example: `val myUdf = udf.register(\"myFunction\", ::myFunction)`\n *\n * If you want to process a column containing an DoubleArray instead, use WrappedArray.\n *\n * @param name Optional. Name for the UDF.\n * @param varargFunc function reference\n * @param nondeterministic Optional. If true, sets the UserDefinedFunction as nondeterministic.\n * @see udf\n */"} {"signature":"@ JvmName ( \"\" ) inline fun < reified R > udf ( varargFunc : KFunction1 < DoubleArray , R > , nondeterministic : Boolean = false , ) : NamedUserDefinedFunctionVararg < Double , R >","body":"= udf ( varargFunc . name , varargFunc , nondeterministic )","docstring":"/**\n * Creates a vararg UDF ([NamedUserDefinedFunctionVararg]) from a function reference adapting its name by reflection.\n * For example: `val myUdf = udf(::myFunction)`\n *\n * If you want to process a column containing an DoubleArray instead, use WrappedArray.\n *\n * @param varargFunc function reference\n * @param nondeterministic Optional. If true, sets the UserDefinedFunction as nondeterministic.\n * @see udf\n */"} {"signature":"@ JvmName ( \"\" ) inline fun < reified R > udf ( name : String , varargFunc : KFunction1 < DoubleArray , R > , nondeterministic : Boolean = false , ) : NamedUserDefinedFunctionVararg < Double , R >","body":"= udf ( name , nondeterministic , varargFunc )","docstring":"/**\n * Creates a vararg UDF ([NamedUserDefinedFunctionVararg]) from a function reference.\n * For example: `val myUdf = udf(\"myFunction\", ::myFunction)`\n *\n * If you want to process a column containing an DoubleArray instead, use WrappedArray.\n *\n * @param name Optional. Name for the UDF.\n * @param varargFunc function reference\n * @param nondeterministic Optional. If true, sets the UserDefinedFunction as nondeterministic.\n * @see udf\n */"} {"signature":"@ JvmName ( \"\" ) inline fun < reified R > UDFRegistration . register ( varargFunc : KFunction1 < DoubleArray , R > , nondeterministic : Boolean = false , ) : NamedUserDefinedFunctionVararg < Double , R >","body":"= register ( udf ( varargFunc , nondeterministic ) )","docstring":"/**\n * Creates and registers a vararg UDF ([NamedUserDefinedFunctionVararg]) from a function reference adapting its name by reflection.\n * For example: `val myUdf = udf.register(::myFunction)`\n *\n * If you want to process a column containing an DoubleArray instead, use WrappedArray.\n *\n * @param varargFunc function reference\n * @param nondeterministic Optional. If true, sets the UserDefinedFunction as nondeterministic.\n * @see udf\n */"} {"signature":"@ JvmName ( \"\" ) inline fun < reified R > UDFRegistration . register ( name : String , varargFunc : KFunction1 < DoubleArray , R > , nondeterministic : Boolean = false , ) : NamedUserDefinedFunctionVararg < Double , R >","body":"= register ( udf ( name , varargFunc , nondeterministic ) )","docstring":"/**\n * Creates and registers a vararg UDF ([NamedUserDefinedFunctionVararg]) from a function reference.\n * For example: `val myUdf = udf.register(\"myFunction\", ::myFunction)`\n *\n * If you want to process a column containing an DoubleArray instead, use WrappedArray.\n *\n * @param name Optional. Name for the UDF.\n * @param varargFunc function reference\n * @param nondeterministic Optional. If true, sets the UserDefinedFunction as nondeterministic.\n * @see udf\n */"} {"signature":"@ JvmName ( \"\" ) inline fun < reified R > udf ( name : String , nondeterministic : Boolean = false , varargFunc : UDF1 < BooleanArray , R > , ) : NamedUserDefinedFunctionVararg < Boolean , R >","body":"= udf ( nondeterministic , varargFunc ) . withName ( name )","docstring":"/**\n * Defines a named vararg UDF ([NamedUserDefinedFunctionVararg]) instance based on the (lambda) function [varargFunc].\n * For example: `val myUdf = udf(\"myUdf\") { t1: BooleanArray -> ... }`\n * Name can also be supplied using delegate: `val myUdf by udf { t1: BooleanArray -> ... }`\n * @see UserDefinedFunction.getValue\n *\n * If you want to process a column containing an BooleanArray instead, use WrappedArray.\n *\n * @param name The name for this UDF.\n * @param nondeterministic Optional. If true, sets the UserDefinedFunction as nondeterministic.\n * @param varargFunc The function to convert to a UDF. Can be a lambda.\n */"} {"signature":"@ JvmName ( \"\" ) inline fun < reified R > udf ( nondeterministic : Boolean = false , varargFunc : UDF1 < BooleanArray , R > , ) : UserDefinedFunctionVararg < Boolean , R >","body":"{ return withAllowUntypedScalaUDF { UserDefinedFunctionVararg ( udf = functions . udf ( VarargUnwrapper ( varargFunc ) { i , init -> BooleanArray ( i , init :: call ) } , schema ( typeOf < R > ( ) ) . unWrap ( ) ) . let { if ( nondeterministic ) it . asNondeterministic ( ) else it } . let { if ( typeOf < R > ( ) . isMarkedNullable ) it else it . asNonNullable ( ) } , encoder = encoder < R > ( ) , ) } }","docstring":"/**\n * Defines a vararg UDF ([UserDefinedFunctionVararg]) instance based on the (lambda) function [varargFunc].\n * For example: `val myUdf = udf { t1: BooleanArray -> ... }`\n *\n * If you want to process a column containing an BooleanArray instead, use WrappedArray.\n *\n * @param nondeterministic Optional. If true, sets the UserDefinedFunction as nondeterministic.\n * @param varargFunc The function to convert to a UDF. Can be a lambda.\n */"} {"signature":"@ JvmName ( \"\" ) inline fun < reified R > UDFRegistration . register ( name : String , nondeterministic : Boolean = false , varargFunc : UDF1 < BooleanArray , R > , ) : NamedUserDefinedFunctionVararg < Boolean , R >","body":"= register ( udf ( name , nondeterministic , varargFunc ) )","docstring":"/**\n * Defines and registers a named vararg UDF ([NamedUserDefinedFunctionVararg]) instance based on the (lambda) function [varargFunc].\n * For example: `val myUdf = udf.register(\"myUdf\") { t1: BooleanArray -> ... }`\n *\n * If you want to process a column containing an BooleanArray instead, use WrappedArray.\n *\n * @param name The name for this UDF.\n * @param nondeterministic Optional. If true, sets the UserDefinedFunction as nondeterministic.\n * @param varargFunc The function to convert to a UDF. Can be a lambda.\n */"} {"signature":"@ JvmName ( \"\" ) inline fun < reified R > udf ( varargFunc : KProperty0 < ( BooleanArray ) -> R > , nondeterministic : Boolean = false , ) : NamedUserDefinedFunctionVararg < Boolean , R >","body":"= udf ( varargFunc . name , varargFunc , nondeterministic )","docstring":"/**\n * Creates a vararg UDF ([NamedUserDefinedFunctionVararg]) from a function reference adapting its name by reflection.\n * For example: `val myUdf = udf(::myFunction)`\n *\n * If you want to process a column containing an BooleanArray instead, use WrappedArray.\n *\n * @param varargFunc function reference\n * @param nondeterministic Optional. If true, sets the UserDefinedFunction as nondeterministic.\n * @see udf\n */"} {"signature":"@ JvmName ( \"\" ) inline fun < reified R > udf ( name : String , varargFunc : KProperty0 < ( BooleanArray ) -> R > , nondeterministic : Boolean = false , ) : NamedUserDefinedFunctionVararg < Boolean , R >","body":"= udf ( name , nondeterministic , varargFunc . get ( ) )","docstring":"/**\n * Creates a vararg UDF ([NamedUserDefinedFunctionVararg]) from a function reference.\n * For example: `val myUdf = udf(\"myFunction\", ::myFunction)`\n *\n * If you want to process a column containing an BooleanArray instead, use WrappedArray.\n *\n * @param name Optional. Name for the UDF.\n * @param varargFunc function reference\n * @param nondeterministic Optional. If true, sets the UserDefinedFunction as nondeterministic.\n * @see udf\n */"} {"signature":"@ JvmName ( \"\" ) inline fun < reified R > UDFRegistration . register ( varargFunc : KProperty0 < ( BooleanArray ) -> R > , nondeterministic : Boolean = false , ) : NamedUserDefinedFunctionVararg < Boolean , R >","body":"= register ( udf ( varargFunc , nondeterministic ) )","docstring":"/**\n * Creates and registers a vararg UDF ([NamedUserDefinedFunctionVararg]) from a function reference adapting its name by reflection.\n * For example: `val myUdf = udf.register(::myFunction)`\n *\n * If you want to process a column containing an BooleanArray instead, use WrappedArray.\n *\n * @param varargFunc function reference\n * @param nondeterministic Optional. If true, sets the UserDefinedFunction as nondeterministic.\n * @see udf\n */"} {"signature":"@ JvmName ( \"\" ) inline fun < reified R > UDFRegistration . register ( name : String , varargFunc : KProperty0 < ( BooleanArray ) -> R > , nondeterministic : Boolean = false , ) : NamedUserDefinedFunctionVararg < Boolean , R >","body":"= register ( udf ( name , varargFunc , nondeterministic ) )","docstring":"/**\n * Creates and registers a vararg UDF ([NamedUserDefinedFunctionVararg]) from a function reference.\n * For example: `val myUdf = udf.register(\"myFunction\", ::myFunction)`\n *\n * If you want to process a column containing an BooleanArray instead, use WrappedArray.\n *\n * @param name Optional. Name for the UDF.\n * @param varargFunc function reference\n * @param nondeterministic Optional. If true, sets the UserDefinedFunction as nondeterministic.\n * @see udf\n */"} {"signature":"@ JvmName ( \"\" ) inline fun < reified R > udf ( varargFunc : KFunction1 < BooleanArray , R > , nondeterministic : Boolean = false , ) : NamedUserDefinedFunctionVararg < Boolean , R >","body":"= udf ( varargFunc . name , varargFunc , nondeterministic )","docstring":"/**\n * Creates a vararg UDF ([NamedUserDefinedFunctionVararg]) from a function reference adapting its name by reflection.\n * For example: `val myUdf = udf(::myFunction)`\n *\n * If you want to process a column containing an BooleanArray instead, use WrappedArray.\n *\n * @param varargFunc function reference\n * @param nondeterministic Optional. If true, sets the UserDefinedFunction as nondeterministic.\n * @see udf\n */"} {"signature":"@ JvmName ( \"\" ) inline fun < reified R > udf ( name : String , varargFunc : KFunction1 < BooleanArray , R > , nondeterministic : Boolean = false , ) : NamedUserDefinedFunctionVararg < Boolean , R >","body":"= udf ( name , nondeterministic , varargFunc )","docstring":"/**\n * Creates a vararg UDF ([NamedUserDefinedFunctionVararg]) from a function reference.\n * For example: `val myUdf = udf(\"myFunction\", ::myFunction)`\n *\n * If you want to process a column containing an BooleanArray instead, use WrappedArray.\n *\n * @param name Optional. Name for the UDF.\n * @param varargFunc function reference\n * @param nondeterministic Optional. If true, sets the UserDefinedFunction as nondeterministic.\n * @see udf\n */"} {"signature":"@ JvmName ( \"\" ) inline fun < reified R > UDFRegistration . register ( varargFunc : KFunction1 < BooleanArray , R > , nondeterministic : Boolean = false , ) : NamedUserDefinedFunctionVararg < Boolean , R >","body":"= register ( udf ( varargFunc , nondeterministic ) )","docstring":"/**\n * Creates and registers a vararg UDF ([NamedUserDefinedFunctionVararg]) from a function reference adapting its name by reflection.\n * For example: `val myUdf = udf.register(::myFunction)`\n *\n * If you want to process a column containing an BooleanArray instead, use WrappedArray.\n *\n * @param varargFunc function reference\n * @param nondeterministic Optional. If true, sets the UserDefinedFunction as nondeterministic.\n * @see udf\n */"} {"signature":"@ JvmName ( \"\" ) inline fun < reified R > UDFRegistration . register ( name : String , varargFunc : KFunction1 < BooleanArray , R > , nondeterministic : Boolean = false , ) : NamedUserDefinedFunctionVararg < Boolean , R >","body":"= register ( udf ( name , varargFunc , nondeterministic ) )","docstring":"/**\n * Creates and registers a vararg UDF ([NamedUserDefinedFunctionVararg]) from a function reference.\n * For example: `val myUdf = udf.register(\"myFunction\", ::myFunction)`\n *\n * If you want to process a column containing an BooleanArray instead, use WrappedArray.\n *\n * @param name Optional. Name for the UDF.\n * @param varargFunc function reference\n * @param nondeterministic Optional. If true, sets the UserDefinedFunction as nondeterministic.\n * @see udf\n */"} {"signature":"@ JvmName ( \"\" ) inline fun < reified T , reified R > udf ( name : String , nondeterministic : Boolean = false , varargFunc : UDF1 < Array < T > , R > , ) : NamedUserDefinedFunctionVararg < T , R >","body":"= udf ( nondeterministic , varargFunc ) . withName ( name )","docstring":"/**\n * Defines a named vararg UDF ([NamedUserDefinedFunctionVararg]) instance based on the (lambda) function [varargFunc].\n * For example: `val myUdf = udf(\"myUdf\") { t1: Array -> ... }`\n * Name can also be supplied using delegate: `val myUdf by udf { t1: Array -> ... }`\n * @see UserDefinedFunction.getValue\n *\n * If you want to process a column containing an Array instead, use WrappedArray.\n *\n * @param name The name for this UDF.\n * @param nondeterministic Optional. If true, sets the UserDefinedFunction as nondeterministic.\n * @param varargFunc The function to convert to a UDF. Can be a lambda.\n */"} {"signature":"@ JvmName ( \"\" ) inline fun < reified T , reified R > udf ( nondeterministic : Boolean = false , varargFunc : UDF1 < Array < T > , R > , ) : UserDefinedFunctionVararg < T , R >","body":"{ T :: class . checkForValidType ( \"\" ) return withAllowUntypedScalaUDF { UserDefinedFunctionVararg ( udf = functions . udf ( VarargUnwrapper ( varargFunc ) { i , init -> Array < T > ( i , init :: call ) } , schema ( typeOf < R > ( ) ) . unWrap ( ) ) . let { if ( nondeterministic ) it . asNondeterministic ( ) else it } . let { if ( typeOf < R > ( ) . isMarkedNullable ) it else it . asNonNullable ( ) } , encoder = encoder < R > ( ) , ) } }","docstring":"/**\n * Defines a vararg UDF ([UserDefinedFunctionVararg]) instance based on the (lambda) function [varargFunc].\n * For example: `val myUdf = udf { t1: Array -> ... }`\n *\n * If you want to process a column containing an Array instead, use WrappedArray.\n *\n * @param nondeterministic Optional. If true, sets the UserDefinedFunction as nondeterministic.\n * @param varargFunc The function to convert to a UDF. Can be a lambda.\n */"} {"signature":"@ JvmName ( \"\" ) inline fun < reified T , reified R > UDFRegistration . register ( name : String , nondeterministic : Boolean = false , varargFunc : UDF1 < Array < T > , R > , ) : NamedUserDefinedFunctionVararg < T , R >","body":"= register ( udf ( name , nondeterministic , varargFunc ) )","docstring":"/**\n * Defines and registers a named vararg UDF ([NamedUserDefinedFunctionVararg]) instance based on the (lambda) function [varargFunc].\n * For example: `val myUdf = udf.register(\"myUdf\") { t1: Array -> ... }`\n *\n * If you want to process a column containing an Array instead, use WrappedArray.\n *\n * @param name The name for this UDF.\n * @param nondeterministic Optional. If true, sets the UserDefinedFunction as nondeterministic.\n * @param varargFunc The function to convert to a UDF. Can be a lambda.\n */"} {"signature":"@ JvmName ( \"\" ) inline fun < reified T , reified R > udf ( varargFunc : KProperty0 < ( Array < T > ) -> R > , nondeterministic : Boolean = false , ) : NamedUserDefinedFunctionVararg < T , R >","body":"= udf ( varargFunc . name , varargFunc , nondeterministic )","docstring":"/**\n * Creates a vararg UDF ([NamedUserDefinedFunctionVararg]) from a function reference adapting its name by reflection.\n * For example: `val myUdf = udf(::myFunction)`\n *\n * If you want to process a column containing an Array instead, use WrappedArray.\n *\n * @param varargFunc function reference\n * @param nondeterministic Optional. If true, sets the UserDefinedFunction as nondeterministic.\n * @see udf\n */"} {"signature":"@ JvmName ( \"\" ) inline fun < reified T , reified R > udf ( name : String , varargFunc : KProperty0 < ( Array < T > ) -> R > , nondeterministic : Boolean = false , ) : NamedUserDefinedFunctionVararg < T , R >","body":"= udf ( name , nondeterministic , varargFunc . get ( ) )","docstring":"/**\n * Creates a vararg UDF ([NamedUserDefinedFunctionVararg]) from a function reference.\n * For example: `val myUdf = udf(\"myFunction\", ::myFunction)`\n *\n * If you want to process a column containing an Array instead, use WrappedArray.\n *\n * @param name Optional. Name for the UDF.\n * @param varargFunc function reference\n * @param nondeterministic Optional. If true, sets the UserDefinedFunction as nondeterministic.\n * @see udf\n */"} {"signature":"@ JvmName ( \"\" ) inline fun < reified T , reified R > UDFRegistration . register ( varargFunc : KProperty0 < ( Array < T > ) -> R > , nondeterministic : Boolean = false , ) : NamedUserDefinedFunctionVararg < T , R >","body":"= register ( udf ( varargFunc , nondeterministic ) )","docstring":"/**\n * Creates and registers a vararg UDF ([NamedUserDefinedFunctionVararg]) from a function reference adapting its name by reflection.\n * For example: `val myUdf = udf.register(::myFunction)`\n *\n * If you want to process a column containing an Array instead, use WrappedArray.\n *\n * @param varargFunc function reference\n * @param nondeterministic Optional. If true, sets the UserDefinedFunction as nondeterministic.\n * @see udf\n */"} {"signature":"@ JvmName ( \"\" ) inline fun < reified T , reified R > UDFRegistration . register ( name : String , varargFunc : KProperty0 < ( Array < T > ) -> R > , nondeterministic : Boolean = false , ) : NamedUserDefinedFunctionVararg < T , R >","body":"= register ( udf ( name , varargFunc , nondeterministic ) )","docstring":"/**\n * Creates and registers a vararg UDF ([NamedUserDefinedFunctionVararg]) from a function reference.\n * For example: `val myUdf = udf.register(\"myFunction\", ::myFunction)`\n *\n * If you want to process a column containing an Array instead, use WrappedArray.\n *\n * @param name Optional. Name for the UDF.\n * @param varargFunc function reference\n * @param nondeterministic Optional. If true, sets the UserDefinedFunction as nondeterministic.\n * @see udf\n */"} {"signature":"@ JvmName ( \"\" ) inline fun < reified T , reified R > udf ( varargFunc : KFunction1 < Array < T > , R > , nondeterministic : Boolean = false , ) : NamedUserDefinedFunctionVararg < T , R >","body":"= udf ( varargFunc . name , varargFunc , nondeterministic )","docstring":"/**\n * Creates a vararg UDF ([NamedUserDefinedFunctionVararg]) from a function reference adapting its name by reflection.\n * For example: `val myUdf = udf(::myFunction)`\n *\n * If you want to process a column containing an Array instead, use WrappedArray.\n *\n * @param varargFunc function reference\n * @param nondeterministic Optional. If true, sets the UserDefinedFunction as nondeterministic.\n * @see udf\n */"} {"signature":"@ JvmName ( \"\" ) inline fun < reified T , reified R > udf ( name : String , varargFunc : KFunction1 < Array < T > , R > , nondeterministic : Boolean = false , ) : NamedUserDefinedFunctionVararg < T , R >","body":"= udf ( name , nondeterministic , varargFunc )","docstring":"/**\n * Creates a vararg UDF ([NamedUserDefinedFunctionVararg]) from a function reference.\n * For example: `val myUdf = udf(\"myFunction\", ::myFunction)`\n *\n * If you want to process a column containing an Array instead, use WrappedArray.\n *\n * @param name Optional. Name for the UDF.\n * @param varargFunc function reference\n * @param nondeterministic Optional. If true, sets the UserDefinedFunction as nondeterministic.\n * @see udf\n */"} {"signature":"@ JvmName ( \"\" ) inline fun < reified T , reified R > UDFRegistration . register ( varargFunc : KFunction1 < Array < T > , R > , nondeterministic : Boolean = false , ) : NamedUserDefinedFunctionVararg < T , R >","body":"= register ( udf ( varargFunc , nondeterministic ) )","docstring":"/**\n * Creates and registers a vararg UDF ([NamedUserDefinedFunctionVararg]) from a function reference adapting its name by reflection.\n * For example: `val myUdf = udf.register(::myFunction)`\n *\n * If you want to process a column containing an Array instead, use WrappedArray.\n *\n * @param varargFunc function reference\n * @param nondeterministic Optional. If true, sets the UserDefinedFunction as nondeterministic.\n * @see udf\n */"} {"signature":"@ JvmName ( \"\" ) inline fun < reified T , reified R > UDFRegistration . register ( name : String , varargFunc : KFunction1 < Array < T > , R > , nondeterministic : Boolean = false , ) : NamedUserDefinedFunctionVararg < T , R >","body":"= register ( udf ( name , varargFunc , nondeterministic ) )","docstring":"/**\n * Creates and registers a vararg UDF ([NamedUserDefinedFunctionVararg]) from a function reference.\n * For example: `val myUdf = udf.register(\"myFunction\", ::myFunction)`\n *\n * If you want to process a column containing an Array instead, use WrappedArray.\n *\n * @param name Optional. Name for the UDF.\n * @param varargFunc function reference\n * @param nondeterministic Optional. If true, sets the UserDefinedFunction as nondeterministic.\n * @see udf\n */"} {"signature":"fun x ( )","body":"{ }","docstring":"/**\n * [kotlin.collections.AbstractCollection]\n */"} {"signature":"internal fun < T > ( suspend ( ) -> T ) . startCoroutineUnintercepted ( completion : Continuation < T > )","body":"{ startDirect ( completion ) { actualCompletion -> startCoroutineUninterceptedOrReturn ( actualCompletion ) } }","docstring":"/**\n * Use this function to restart a coroutine directly from inside of [suspendCoroutine],\n * when the code is already in the context of this coroutine.\n * It does not use [ContinuationInterceptor] and does not update the context of the current thread.\n */"} {"signature":"internal fun < R , T > ( suspend ( R ) -> T ) . startCoroutineUndispatched ( receiver : R , completion : Continuation < T > )","body":"{ startDirect ( completion ) { actualCompletion -> withCoroutineContext ( completion . context , null ) { startCoroutineUninterceptedOrReturn ( receiver , actualCompletion ) } } }","docstring":"/**\n * Use this function to start a new coroutine in [CoroutineStart.UNDISPATCHED] mode —\n * immediately execute the coroutine in the current thread until the next suspension.\n * It does not use [ContinuationInterceptor], but updates the context of the current thread for the new coroutine.\n */"} {"signature":"private inline fun < T > startDirect ( completion : Continuation < T > , block : ( Continuation < T > ) -> Any ? )","body":"{ val actualCompletion = probeCoroutineCreated ( completion ) val value = try { block ( actualCompletion ) } catch ( e : Throwable ) { actualCompletion . resumeWithException ( e ) return } if ( value !== COROUTINE_SUSPENDED ) { @ Suppress ( \"\" ) actualCompletion . resume ( value as T ) } }","docstring":"/**\n * Starts the given [block] immediately in the current stack-frame until the first suspension point.\n * This method supports debug probes and thus can intercept completion, thus completion is provided\n * as the parameter of [block].\n */"} {"signature":"internal fun < T , R > ScopeCoroutine < T > . startUndispatchedOrReturn ( receiver : R , block : suspend R . ( ) -> T ) : Any ?","body":"{ return undispatchedResult ( { true } ) { block . startCoroutineUninterceptedOrReturn ( receiver , this ) } }","docstring":"/**\n * Starts this coroutine with the given code [block] in the same context and returns the coroutine result when it\n * completes without suspension.\n * This function shall be invoked at most once on this coroutine.\n * This function checks cancellation of the outer [Job] on fast-path.\n *\n * It starts the coroutine using [startCoroutineUninterceptedOrReturn].\n */"} {"signature":"internal fun < T , R > ScopeCoroutine < T > . startUndispatchedOrReturnIgnoreTimeout ( receiver : R , block : suspend R . ( ) -> T ) : Any ?","body":"{ return undispatchedResult ( { e -> ! ( e is TimeoutCancellationException && e . coroutine === this ) } ) { block . startCoroutineUninterceptedOrReturn ( receiver , this ) } }","docstring":"/**\n * Same as [startUndispatchedOrReturn], but ignores [TimeoutCancellationException] on fast-path.\n */"} {"signature":"internal fun CommonizerParameters . commonModuleNames ( target : CommonizerTarget ) : Set < String >","body":"{ val supportedTargets = target . withAllLeaves ( ) . mapNotNull ( targetProviders :: getOrNull ) if ( supportedTargets . isEmpty ( ) ) return emptySet ( ) val allModuleNames : List < Set < String > > = supportedTargets . toList ( ) . map { targetProvider -> targetProvider . modulesProvider . moduleInfos . mapTo ( HashSet ( ) ) { it . name } } return allModuleNames . reduce { a , b -> a intersect b } }","docstring":"/**\n * @return Set of module names that is available across all children targets\n */"} {"signature":"internal fun CommonizerParameters . commonModuleNames ( targetProvider : TargetProvider ) : Set < String >","body":"{ return outputTargets . filter { target -> ( target . allLeaves ( ) intersect targetProvider . target . allLeaves ( ) ) . isNotEmpty ( ) } . map { target -> commonModuleNames ( target ) } . fold ( emptySet ( ) ) { acc , names -> acc + names } }","docstring":"/**\n * @return Set of module names that this [targetProvider] shares with *at least* one other target\n */"} {"signature":"internal fun Project . androidCompilationKits ( androidExtension : DynamicBean , kotlinTarget : DynamicBean ) : List < AndroidVariantOrigin >","body":"{ val variants = if ( \"\" in androidExtension ) { androidExtension . beanCollection ( \"\" ) } else { androidExtension . beanCollection ( \"\" ) } val fallbacks = findFallbacks ( androidExtension ) return variants . map { extractAndroidKit ( androidExtension , kotlinTarget , fallbacks , it ) } }","docstring":"/**\n * Locate Android compilation kits for the given Kotlin Target.\n */"} {"signature":"fun dwarfVersion ( config : KonanConfig )","body":"= when ( config . debugInfoVersion ( ) ) { -> -> else -> TODO ( \"\" ) }","docstring":"/**\n * Note: Kotlin language constant appears in DWARF v6, while modern linker fails to links DWARF other then [2;4],\n * that why we emit version 4 actually.\n */"} {"signature":"fun modernLenet ( )","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 ( \"\" ) it . reset ( ) accuracy = it . evaluate ( dataset = test , batchSize = TEST_BATCH_SIZE ) . metrics [ Metrics . ACCURACY ] println ( \"\" ) it . fit ( dataset = train , epochs = EPOCHS , batchSize = TRAINING_BATCH_SIZE ) 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 [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":"= modernLenet ( )","docstring":"/** */"} {"signature":"@ Throws ( IOException :: class ) public fun extractCifar10Images ( archiveName : String ) : Array < FloatArray >","body":"{ return loadImagesFromDirectory ( DATASET_SIZE , archiveName ) }","docstring":"/** Loads images from [archiveName] to heap memory and applies basic normalization preprocessing. */"} {"signature":"@ Throws ( IOException :: class ) public fun extractCifar10Labels ( pathToLabels : String ) : FloatArray","body":"{ val labelCount = DATASET_SIZE println ( String . format ( \"\" , labelCount , pathToLabels ) ) val labelBuffer = ByteArray ( labelCount ) var cnt = csvReader ( ) . open ( pathToLabels ) { readAllAsSequence ( ) . forEach { row -> labelBuffer [ cnt ] = dictionary . getOrElse ( row [ ] ) { } . toByte ( ) cnt ++ } } val floats = FloatArray ( labelCount ) for ( i in until labelCount ) { floats [ i ] = OnHeapDataset . convertByteToFloat ( labelBuffer [ i ] ) } return floats }","docstring":"/** Loads labels from [pathToLabels] csv file to heap memory and converts to Floats. */"} {"signature":"@ Throws ( IOException :: class ) public fun extractCifar10LabelsAnsSort ( pathToLabels : String ) : FloatArray","body":"{ val labelCount = DATASET_SIZE println ( String . format ( \"\" , labelCount , pathToLabels ) ) val labelSorter = mutableMapOf < String , Int > ( ) csvReader ( ) . open ( pathToLabels ) { readAllAsSequence ( ) . forEach { row -> labelSorter [ row [ ] ] = dictionary . getOrElse ( row [ ] ) { } } } val sortedMap = labelSorter . toSortedMap ( ) val labelBuffer = sortedMap . values . toIntArray ( ) val floats = FloatArray ( labelCount ) for ( i in until labelCount ) { floats [ i ] = OnHeapDataset . convertByteToFloat ( labelBuffer [ i ] . toByte ( ) ) } return floats }","docstring":"/**\n * Loads labels from [pathToLabels] csv file to heap memory and converts to Floats, after that it sorts\n * it to have the same order as image files.\n *\n * NOTE: It's important if you're going to use it with [org.jetbrains.kotlinx.dl.dataset.OnFlyImageDataset].\n */"} {"signature":"public fun top ( distance : Int ? = null , rotate : Int ? = null ) : LabelPosition","body":"= LabelPosition ( \"\" , distance , rotate )","docstring":"/**\n * `top` label position with [distance] and [rotate]\n *\n * @param distance distance to the host graphic element.\n * @param rotate rotate label, from `-90` degree to `90`, positive value represents rotate anti-clockwise.\n */"} {"signature":"public fun left ( distance : Int ? = null , rotate : Int ? = null ) : LabelPosition","body":"= LabelPosition ( \"\" , distance , rotate )","docstring":"/**\n * `left` label position with [distance] and [rotate]\n *\n * @param distance distance to the host graphic element.\n * @param rotate rotate label, from `-90` degree to `90`, positive value represents rotate anti-clockwise.\n */"} {"signature":"public fun right ( distance : Int ? = null , rotate : Int ? = null ) : LabelPosition","body":"= LabelPosition ( \"\" , distance , rotate )","docstring":"/**\n * `right` label position with [distance] and [rotate]\n *\n * @param distance distance to the host graphic element.\n * @param rotate rotate label, from `-90` degree to `90`, positive value represents rotate anti-clockwise.\n */"} {"signature":"public fun bottom ( distance : Int ? = null , rotate : Int ? = null ) : LabelPosition","body":"= LabelPosition ( \"\" , distance , rotate )","docstring":"/**\n * `bottom` label position with [distance] and [rotate]\n *\n * @param distance distance to the host graphic element.\n * @param rotate rotate label, from `-90` degree to `90`, positive value represents rotate anti-clockwise.\n */"} {"signature":"public fun inside ( distance : Int ? = null , rotate : Int ? = null ) : LabelPosition","body":"= LabelPosition ( \"\" , distance , rotate )","docstring":"/**\n * `inside` label position with [distance] and [rotate]\n *\n * @param distance distance to the host graphic element.\n * @param rotate rotate label, from `-90` degree to `90`, positive value represents rotate anti-clockwise.\n */"} {"signature":"public fun insideLeft ( distance : Int ? = null , rotate : Int ? = null ) : LabelPosition","body":"= LabelPosition ( \"\" , distance , rotate )","docstring":"/**\n * `insideLeft` label position with [distance] and [rotate]\n *\n * @param distance distance to the host graphic element.\n * @param rotate rotate label, from `-90` degree to `90`, positive value represents rotate anti-clockwise.\n */"} {"signature":"public fun insideRight ( distance : Int ? = null , rotate : Int ? = null ) : LabelPosition","body":"= LabelPosition ( \"\" , distance , rotate )","docstring":"/**\n * `insideRight` label position with [distance] and [rotate]\n *\n * @param distance distance to the host graphic element.\n * @param rotate rotate label, from `-90` degree to `90`, positive value represents rotate anti-clockwise.\n */"} {"signature":"public fun insideTop ( distance : Int ? = null , rotate : Int ? = null ) : LabelPosition","body":"= LabelPosition ( \"\" , distance , rotate )","docstring":"/**\n * `insideTop` label position with [distance] and [rotate]\n *\n * @param distance distance to the host graphic element.\n * @param rotate rotate label, from `-90` degree to `90`, positive value represents rotate anti-clockwise.\n */"} {"signature":"public fun insideBottom ( distance : Int ? = null , rotate : Int ? = null ) : LabelPosition","body":"= LabelPosition ( \"\" , distance , rotate )","docstring":"/**\n * `insideBottom` label position with [distance] and [rotate]\n *\n * @param distance distance to the host graphic element.\n * @param rotate rotate label, from `-90` degree to `90`, positive value represents rotate anti-clockwise.\n */"} {"signature":"public fun insideTopLeft ( distance : Int ? = null , rotate : Int ? = null ) : LabelPosition","body":"= LabelPosition ( \"\" , distance , rotate )","docstring":"/**\n * `insideTopLeft` label position with [distance] and [rotate]\n *\n * @param distance distance to the host graphic element.\n * @param rotate rotate label, from `-90` degree to `90`, positive value represents rotate anti-clockwise.\n */"} {"signature":"public fun insideBottomLeft ( distance : Int ? = null , rotate : Int ? = null ) : LabelPosition","body":"= LabelPosition ( \"\" , distance , rotate )","docstring":"/**\n * `insideBottomLeft` label position with [distance] and [rotate]\n *\n * @param distance distance to the host graphic element.\n * @param rotate rotate label, from `-90` degree to `90`, positive value represents rotate anti-clockwise.\n */"} {"signature":"public fun insideTopRight ( distance : Int ? = null , rotate : Int ? = null ) : LabelPosition","body":"= LabelPosition ( \"\" , distance , rotate )","docstring":"/**\n * `insideTopRight` label position with [distance] and [rotate]\n *\n * @param distance distance to the host graphic element.\n * @param rotate rotate label, from `-90` degree to `90`, positive value represents rotate anti-clockwise.\n */"} {"signature":"public fun insideBottomRight ( distance : Int ? = null , rotate : Int ? = null ) : LabelPosition","body":"= LabelPosition ( \"\" , distance , rotate )","docstring":"/**\n * `insideBottomRight` label position with [distance] and [rotate]\n *\n * @param distance distance to the host graphic element.\n * @param rotate rotate label, from `-90` degree to `90`, positive value represents rotate anti-clockwise.\n */"} {"signature":"public fun fromPx ( pair : Pair < Pixel , Pixel > , rotate : Int ? = null ) : LabelPosition","body":"= LabelPosition ( pair , rotate )","docstring":"/**\n * Represents position of label relative to a top-left corner of bounding box in absolute pixel values.\n *\n * @param pair pair of absolute pixel values\n * @param rotate rotate label, from `-90` degree to `90`, positive value represents rotate anti-clockwise.\n */"} {"signature":"public fun fromPx ( first : Pixel , second : Pixel , rotate : Int ? = null ) : LabelPosition","body":"= LabelPosition ( first to second , rotate )","docstring":"/**\n * Represents position of label relative to a top-left corner of bounding box in absolute pixel values.\n *\n * @param first pixel value along the x-axis\n * @param second pixel value along the y-axis\n * @param rotate rotate label, from `-90` degree to `90`, positive value represents rotate anti-clockwise.\n */"} {"signature":"public fun fromPct ( pair : Pair < Percentage , Percentage > , rotate : Int ? = null ) : LabelPosition","body":"= LabelPosition ( pair , rotate )","docstring":"/**\n * Represents position of label relative to a top-left corner of bounding box in relative percentage.\n *\n * @param pair pair of relative percentages\n * @param rotate rotate label, from `-90` degree to `90`, positive value represents rotate anti-clockwise.\n */"} {"signature":"public fun fromPct ( first : Percentage , second : Percentage , rotate : Int ? = null ) : LabelPosition","body":"= LabelPosition ( first to second , rotate )","docstring":"/**\n * Represents position of label relative to a top-left corner of bounding box in relative percentage.\n *\n * @param first relative percentage along the x-axis\n * @param second relative percentage along the y-axis\n * @param rotate rotate label, from `-90` degree to `90`, positive value represents rotate anti-clockwise.\n */"} {"signature":"override fun put ( key : K , value : V ) : V ?","body":"{ if ( put ( array , shift , key , value ) ) { if ( ++ size_ >= ( THRESHOLD ushr shift ) ) { rehash ( ) } } return null }","docstring":"/**\n * Never returns previous values\n */"} {"signature":"public fun KtAnnotated . hasAnnotation ( classId : ClassId , useSiteTargetFilter : AnnotationUseSiteTargetFilter = AnyAnnotationUseSiteTargetFilter , ) : Boolean","body":"= annotationsList . hasAnnotation ( classId , useSiteTargetFilter )","docstring":"/**\n * Checks if entity has annotation with specified [classId] and filtered by [useSiteTargetFilter].\n *\n * @see [KtAnnotationsList.hasAnnotation]\n */"} {"signature":"public fun KtAnnotated . annotationsByClassId ( classId : ClassId , useSiteTargetFilter : AnnotationUseSiteTargetFilter = AnyAnnotationUseSiteTargetFilter , ) : List < KtAnnotationApplicationWithArgumentsInfo >","body":"= annotationsList . annotationsByClassId ( classId , useSiteTargetFilter )","docstring":"/**\n * A list of annotations applied with specified [classId] and filtered by [useSiteTargetFilter].\n *\n * @see [KtAnnotationsList.annotationClassIds]\n */"} {"signature":"private fun isStringConcatenationExpression ( expression : IrExpression ) : Boolean","body":"= ( expression is IrStringConcatenation ) || ( expression is IrCall ) && expression . isStringPlusCall","docstring":"/** @return true if the given expression is a [IrStringConcatenation], or an [IrCall] to [String.plus]. */"} {"signature":"private fun collectStringConcatenationArguments ( expression : IrExpression ) : List < IrExpression >","body":"{ val arguments = mutableListOf < IrExpression > ( ) expression . acceptChildrenVoid ( object : IrElementVisitorVoid { override fun visitElement ( element : IrElement ) { element . acceptChildrenVoid ( this ) } override fun visitCall ( expression : IrCall ) { if ( isStringConcatenationExpression ( expression ) || expression . isToStringCall ) { expression . acceptChildrenVoid ( this ) } else { arguments . add ( expression ) } } override fun visitStringConcatenation ( expression : IrStringConcatenation ) { expression . acceptChildrenVoid ( this ) } override fun visitExpression ( expression : IrExpression ) { arguments . add ( expression ) } } ) return arguments }","docstring":"/** Recursively collects string concatenation arguments from the given expression. */"} {"signature":"override fun updateThreadContext ( context : CoroutineContext ) : MDCContextMap","body":"{ val oldState = MDC . getCopyOfContextMap ( ) setCurrent ( contextMap ) return oldState }","docstring":"/** @suppress */"} {"signature":"override fun restoreThreadContext ( context : CoroutineContext , oldState : MDCContextMap )","body":"{ setCurrent ( oldState ) }","docstring":"/** @suppress */"} {"signature":"@ Operation fun computeReplaceValue ( key : Int , @ Param ( name = \"\" ) newValue : ValueWithCleanup , ) : ValueWithCleanup ?","body":"= cache . compute ( key ) { _ , _ -> newValue }","docstring":"/**\n * Models a computation that replaces the cache's existing value for [key] with [newValue].\n */"} {"signature":"@ Operation fun computeKeepValue ( key : Int ) : ValueWithCleanup ?","body":"= cache . compute ( key ) { _ , existingValue -> existingValue }","docstring":"/**\n * Models a computation that keeps the cache's existing value for [key].\n */"} {"signature":"@ Operation fun computeRemoveValue ( key : Int ) : ValueWithCleanup ?","body":"= cache . compute ( key ) { _ , _ -> null }","docstring":"/**\n * Models a computation that removes the cache's existing value for [key] (if any).\n */"} {"signature":"internal fun List < IrDeclaration > . stableOrdered ( ) : List < IrDeclaration >","body":"{ val strictOrder = hashMapOf < IrDeclaration , Int > ( ) var idx = forEach { val shouldPreserveRelativeOrder = when ( it ) { is IrProperty -> it . backingField != null && ! it . isConst is IrAnonymousInitializer , is IrEnumEntry , is IrField -> true else -> false } if ( shouldPreserveRelativeOrder ) { strictOrder [ it ] = idx ++ } } return sortedWith { a , b -> val strictA = strictOrder [ a ] ? : Int . MAX_VALUE val strictB = strictOrder [ b ] ? : Int . MAX_VALUE if ( strictA == strictB ) { val rA = a . render ( ) val rB = b . render ( ) rA . compareTo ( rB ) } else strictA - strictB } }","docstring":"/**\n * Sorts the declarations in the list using the result of [IrDeclaration.render] as the sorting key.\n *\n * The exceptions for which relative order is preserved as it matters for code generation:\n * * Properties with backing field\n * * Anonymous initializers\n * * Enum entries\n * * Fields\n */"} {"signature":"@ ExperimentalSerializationApi public abstract fun < T : Any > getContextual ( kClass : KClass < T > , typeArgumentsSerializers : List < KSerializer < * > > = emptyList ( ) ) : KSerializer < T > ?","body":"@ ExperimentalSerializationApi public abstract fun < T : Any > getContextual ( kClass : KClass < T > , typeArgumentsSerializers : List < KSerializer < * > > = emptyList ( ) ) : KSerializer < T > ?","docstring":"/**\n * Returns a contextual serializer associated with a given [kClass].\n * If given class has generic parameters and module has provider for [kClass],\n * [typeArgumentsSerializers] are used to create serializer.\n * This method is used in context-sensitive operations on a property marked with [Contextual] by a [ContextualSerializer].\n *\n * @see SerializersModuleBuilder.contextual\n */"} {"signature":"@ ExperimentalSerializationApi public abstract fun < T : Any > getPolymorphic ( baseClass : KClass < in T > , value : T ) : SerializationStrategy < T > ?","body":"@ ExperimentalSerializationApi public abstract fun < T : Any > getPolymorphic ( baseClass : KClass < in T > , value : T ) : SerializationStrategy < T > ?","docstring":"/**\n * Returns a polymorphic serializer registered for a class of the given [value] in the scope of [baseClass].\n */"} {"signature":"@ ExperimentalSerializationApi public abstract fun < T : Any > getPolymorphic ( baseClass : KClass < in T > , serializedClassName : String ? ) : DeserializationStrategy < T > ?","body":"@ ExperimentalSerializationApi public abstract fun < T : Any > getPolymorphic ( baseClass : KClass < in T > , serializedClassName : String ? ) : DeserializationStrategy < T > ?","docstring":"/**\n * Returns a polymorphic deserializer registered for a [serializedClassName] in the scope of [baseClass]\n * or default value constructed from [serializedClassName] if a default serializer provider was registered.\n */"} {"signature":"@ ExperimentalSerializationApi public abstract fun dumpTo ( collector : SerializersModuleCollector )","body":"@ ExperimentalSerializationApi public abstract fun dumpTo ( collector : SerializersModuleCollector )","docstring":"/**\n * Copies contents of this module to the given [collector].\n */"} {"signature":"public operator fun SerializersModule . plus ( other : SerializersModule ) : SerializersModule","body":"= SerializersModule { include ( this @ plus ) include ( other ) }","docstring":"/**\n * Returns a combination of two serial modules\n *\n * If serializer for some class presents in both modules, a [SerializerAlreadyRegisteredException] is thrown.\n * To overwrite serializers, use [SerializersModule.overwriteWith] function.\n */"} {"signature":"@ OptIn ( ExperimentalSerializationApi :: class ) public infix fun SerializersModule . overwriteWith ( other : SerializersModule ) : SerializersModule","body":"= SerializersModule { include ( this @ overwriteWith ) other . dumpTo ( object : SerializersModuleCollector { override fun < T : Any > contextual ( kClass : KClass < T > , serializer : KSerializer < T > ) { registerSerializer ( kClass , ContextualProvider . Argless ( serializer ) , allowOverwrite = true ) } override fun < T : Any > contextual ( kClass : KClass < T > , provider : ( serializers : List < KSerializer < * > > ) -> KSerializer < * > ) { registerSerializer ( kClass , ContextualProvider . WithTypeArguments ( provider ) , allowOverwrite = true ) } override fun < Base : Any , Sub : Base > polymorphic ( baseClass : KClass < Base > , actualClass : KClass < Sub > , actualSerializer : KSerializer < Sub > ) { registerPolymorphicSerializer ( baseClass , actualClass , actualSerializer , allowOverwrite = true ) } override fun < Base : Any > polymorphicDefaultSerializer ( baseClass : KClass < Base > , defaultSerializerProvider : ( value : Base ) -> SerializationStrategy < Base > ? ) { registerDefaultPolymorphicSerializer ( baseClass , defaultSerializerProvider , allowOverwrite = true ) } override fun < Base : Any > polymorphicDefaultDeserializer ( baseClass : KClass < Base > , defaultDeserializerProvider : ( className : String ? ) -> DeserializationStrategy < Base > ? ) { registerDefaultPolymorphicDeserializer ( baseClass , defaultDeserializerProvider , allowOverwrite = true ) } } ) }","docstring":"/**\n * Returns a combination of two serial modules\n *\n * If serializer for some class presents in both modules, result module\n * will contain serializer from [other] module.\n */"} {"signature":"private fun createDependencyContainerForStdlibIfKlib ( stdlibFilePath : Path , environment : KotlinCoreEnvironment , projectContext : ProjectContext , ) : CommonDependenciesContainerImpl ?","body":"{ val stdlibKlib = resolveSingleFileKlib ( KFile ( stdlibFilePath ) , strategy = ToolingSingleFileKlibResolveStrategy ) . also { try { it . moduleName } catch ( e : IOException ) { return null } } val stdlibModuleDescriptor = createAndInitializeKlibBasedStdlibCommonDescriptor ( stdlibKlib , environment , projectContext ) return CommonDependenciesContainerImpl ( listOf ( stdlibModuleDescriptor ) ) }","docstring":"/**\n * Creates a dependency container that includes common stdlib, if the passed file path points to a metadata KLIB in the supported format.\n * Note that [resolveSingleFileKlib] is sensitive to the library layout and to the file extension.\n * In the case of a custom klib layout or file extension other than .klib, the library won't be resolved even if it contains .knm files.\n * For the current kotlin-stdlib-common.jar it will always return null, the purpose of the function is to simplify future migration.\n * It's been checked that the dependency container for a library with the supported layout is functional.\n * See KTI-1457.\n */"} {"signature":"fun ClassLoweringPass . runOnFileInOrder ( irFile : IrFile )","body":"{ irFile . acceptVoid ( object : IrElementVisitorVoid { override fun visitElement ( element : IrElement ) { element . acceptChildrenVoid ( this ) } override fun visitClass ( declaration : IrClass ) { lower ( declaration ) declaration . acceptChildrenVoid ( this ) } } ) }","docstring":"/**\n * Copy of [runOnFilePostfix], but this implementation first lowers declaration, then its children.\n */"} {"signature":"private fun smallestUnresolvablePrefix ( qualifiers : List < FirQualifierPart > , partiallyResolvedTypeRef : FirResolvedTypeRef ? , ) : List < FirQualifierPart >","body":"{ val totalQualifierCount = qualifiers . size val resolvedQualifierCount = ( partiallyResolvedTypeRef ? . delegatedTypeRef as? FirUserTypeRef ) ? . qualifier ? . size ? : calculatePartiallyResolvablePackageSegments ( qualifiers ) val unresolvedQualifierCount = totalQualifierCount - resolvedQualifierCount return if ( unresolvedQualifierCount > ) { qualifiers . dropLast ( unresolvedQualifierCount - ) } else { qualifiers } }","docstring":"/**\n * Returns the smallest non-resolvable prefix of the given [qualifiers].\n *\n * Examples:\n *\n * - Given `A.B.C` and `A.B` can be resolved, then `A.B.C` will be returned\n * - Given `A.B.C` and `A` cannot be resolved, then `A` will be returned\n * - Given `a.b.C` and package `a` exists but package `a.b` doesn't exist, `a.b.` will be returned.\n */"} {"signature":"private fun tryCalculatingPartiallyResolvedTypeRef ( typeRef : FirTypeRef , data : ScopeClassDeclaration ) : FirResolvedTypeRef ?","body":"{ if ( typeRef !is FirUserTypeRef ) return null val qualifiers = typeRef . qualifier if ( qualifiers . size <= ) { return null } val qualifiersToTry = qualifiers . toMutableList ( ) while ( qualifiersToTry . size > ) { qualifiersToTry . removeLast ( ) val typeRefToTry = buildUserTypeRef { qualifier += qualifiersToTry isMarkedNullable = false source = typeRef . source } val ( resolvedType , diagnostic ) = resolveType ( typeRefToTry , data ) if ( resolvedType is ConeErrorType || diagnostic != null ) continue return buildResolvedTypeRef { source = qualifiersToTry . last ( ) . source type = resolvedType delegatedTypeRef = typeRefToTry } } return null }","docstring":"/**\n * Tries to calculate a partially resolved type reference for a type reference which was resolved to an error type.\n * It will attempt to resolve the type with a decreasing number of qualifiers until it succeeds, allowing\n * partial resolution in case of errors in the type reference.\n *\n * This is useful for providing better IDE support when resolving partially incorrect types.\n *\n * @param typeRef The type reference for which to try to calculate a partially resolved type reference.\n * @param data The scope class declaration containing relevant information for resolving the reference.\n * @return A partially resolved type reference if it was resolved, or `null` otherwise.\n */"} {"signature":"private fun calculatePartiallyResolvablePackageSegments ( qualifiers : List < FirQualifierPart > ) : Int","body":"{ if ( qualifiers . size <= ) { return } val packageSegmentsToTry = qualifiers . mapTo ( mutableListOf ( ) ) { it . name . asString ( ) } while ( packageSegmentsToTry . size > ) { packageSegmentsToTry . removeLast ( ) if ( session . symbolProvider . getPackage ( FqName . fromSegments ( packageSegmentsToTry ) ) != null ) { return packageSegmentsToTry . size } } return }","docstring":"/**\n * If the given [qualifiers] are interpreted as a fully qualified name,\n * calculates how many segments (from the left) can be resolved to an existing package.\n *\n * This is useful for providing better IDE support when resolving partially incorrect types.\n *\n * The last segment is never considered, i.e., if [qualifiers] is not empty, the result is always `< qualifiers.size`.\n */"} {"signature":"fun test ( )","body":"{ }","docstring":"/**\n * [ClassWithCompanion.foo]\n */"} {"signature":"private fun searchInheritors ( firClass : FirClass ) : List < ClassId >","body":"{ val ktClass = firClass . psi as? KtClass ? : return emptyList ( ) val ktModule = when ( val classKtModule = firClass . llFirModuleData . ktModule ) { is KtDanglingFileModule -> classKtModule . contextModule else -> classKtModule } val scope = if ( firClass . isExpect ) { val refinementDependents = KotlinModuleDependentsProvider . getInstance ( project ) . getRefinementDependents ( ktModule ) GlobalSearchScope . union ( refinementDependents . map { it . contentScope } + ktModule . contentScope ) } else { ktModule . contentScope } return searchInScope ( ktClass , firClass . classId , scope ) }","docstring":"/**\n * Some notes about the search:\n *\n * - A Java class cannot legally extend a sealed Kotlin class (even in the same package), so we don't need to search for Java class\n * inheritors.\n * - Technically, we could use a package scope to narrow the search, but the search is already sufficiently narrow because it uses\n * supertype indices and is confined to the current `KtModule` in most cases (except for 'expect' classes). Finding a `PsiPackage`\n * for a `PackageScope` is not cheap, hence the decision to avoid it. If a `PackageScope` is needed in the future, it'd be best to\n * extract a `PackageNameScope` which operates just with the qualified package name, to avoid `PsiPackage`. (At the time of writing,\n * this is possible with the implementation of `PackageScope`.)\n * - We ignore local classes to avoid lazy resolve contract violations.\n * See KT-63795.\n * - For `expect` declarations, the search scope includes all modules with a dependsOn dependency on the containing module.\n * At the same time, `actual` declarations are restricted to the same module and require no special handling.\n * See KT-45842.\n * - KMP libraries are not yet supported.\n * See KT-65591.\n */"} {"signature":"fun File . unzipTo ( destinationDirectory : File , fromSubdirectory : File = File ( \"\" ) , resetTimeAttributes : Boolean = false )","body":"{ withZipFileSystem { it . file ( fromSubdirectory ) . recursiveCopyTo ( destinationDirectory , resetTimeAttributes ) } }","docstring":"/**\n * Unpacks the contents of a zip archive located in [this] into the [destinationDirectory].\n *\n * @param destinationDirectory The directory to unpack the contents to.\n * @param resetTimeAttributes Whether to set the newly created files' time attributes\n * (creation time, last access time, and last modification time) to zero.\n * @param fromSubdirectory A subdirectory inside the archive to unpack. Specify \"/\" if you need to unpack the whole archive.\n */"} {"signature":"fun Path . unzipTo ( destinationDirectory : Path , fromSubdirectory : Path = Paths . get ( \"\" ) , resetTimeAttributes : Boolean = false )","body":"{ File ( this ) . unzipTo ( File ( destinationDirectory ) , File ( fromSubdirectory ) , resetTimeAttributes ) }","docstring":"/**\n * Unpacks the contents of a zip archive located in [this] into the [destinationDirectory].\n *\n * @param destinationDirectory The directory to unpack the contents to.\n * @param resetTimeAttributes Whether to set the newly created files' time attributes\n * (creation time, last access time, and last modification time) to zero.\n * @param fromSubdirectory A subdirectory inside the archive to unpack. Specify \"/\" if you need to unpack the whole archive.\n */"} {"signature":"fun loadExportedForwardDeclarations ( modulesProviders : List < ModulesProvider > ) : CirProvidedClassifiers","body":"{ val classifiers = CommonizerMap < CirEntityId , CirProvided . Classifier > ( ) modulesProviders . flatMap { moduleProvider -> moduleProvider . moduleInfos } . mapNotNull { moduleInfo -> moduleInfo . cInteropAttributes } . forEach { attrs -> readExportedForwardDeclarations ( attrs , classifiers :: set ) } if ( classifiers . isEmpty ( ) ) return CirProvidedClassifiers . EMPTY return CirProvidedClassifiersByModules ( true , classifiers ) }","docstring":"/**\n * Will load *all* forward declarations provided by all modules into a flat [CirProvidedClassifiers].\n * Note: This builds a union *not an intersection* of forward declarations.\n */"} {"signature":"@ Test fun testEncodePackedFloatArrayProtobuf ( )","body":"{ val obj = PackedFloatArrayCarrier ( . toULong ( ) , floatArrayOf ( , , ) ) val s = ProtoBuf . encodeToHexString ( PackedFloatArrayCarrier . serializer ( ) , obj ) . uppercase ( ) assertEquals ( \"\"\"\"\"\" , s ) }","docstring":"/**\n * Test that when packing is specified the array is encoded as packed\n */"} {"signature":"@ Test fun testEncodeNonPackedFloatArrayProtobuf ( )","body":"{ val obj = NonPackedFloatArrayCarrier ( . toULong ( ) , floatArrayOf ( , , ) ) val s = ProtoBuf . encodeToHexString ( NonPackedFloatArrayCarrier . serializer ( ) , obj ) . uppercase ( ) assertEquals ( \"\"\"\"\"\" , s ) }","docstring":"/**\n * Test that when packing is not specified the array is not encoded as packed. Note that protobuf 3\n * should encode as packed by default. The format doesn't allow specifying versions at this point so\n * the default remains the original.\n */"} {"signature":"@ Test fun testDecodePackedFloatArrayProtobuf ( )","body":"{ val obj : BaseFloatArrayCarrier = PackedFloatArrayCarrier ( . toULong ( ) , floatArrayOf ( , , ) ) val s = \"\"\"\"\"\" val decodedPacked = ProtoBuf . decodeFromHexString ( PackedFloatArrayCarrier . serializer ( ) , s ) assertEquals ( obj , decodedPacked ) val decodedNonPacked = ProtoBuf . decodeFromHexString ( NonPackedFloatArrayCarrier . serializer ( ) , s ) assertEquals ( obj , decodedNonPacked ) }","docstring":"/**\n * Per the specification decoders should support both packed and repeated fields independent of whether\n * a field is specified as packed in the schema. Check that decoding works with both types (packed and non-packed)\n * if the data itself is packed.\n */"} {"signature":"@ Test fun testDecodeNonPackedFloatArrayProtobuf ( )","body":"{ val obj : BaseFloatArrayCarrier = PackedFloatArrayCarrier ( . toULong ( ) , floatArrayOf ( , , ) ) val s = \"\"\"\"\"\" val decodedPacked = ProtoBuf . decodeFromHexString ( PackedFloatArrayCarrier . serializer ( ) , s ) assertEquals ( obj , decodedPacked ) val decodedNonPacked = ProtoBuf . decodeFromHexString ( NonPackedFloatArrayCarrier . serializer ( ) , s ) assertEquals ( obj , decodedNonPacked ) }","docstring":"/**\n * Per the specification decoders should support both packed and repeated fields independent of whether\n * a field is specified as packed in the schema. Check that decoding works with both types (packed and non-packed)\n * if the data itself is not packed.\n */"} {"signature":"@ Test fun testEncodeAnnotatedStringList ( )","body":"{ val obj = PackedStringCarrier ( listOf ( \"\" , \"\" , \"\" ) ) val expectedHex = \"\" val encodedHex = ProtoBuf . encodeToHexString ( obj ) assertEquals ( expectedHex , encodedHex ) assertEquals ( obj , ProtoBuf . decodeFromHexString < PackedStringCarrier > ( expectedHex ) ) val invalidPackedHex = \"\" val decoded = ProtoBuf . decodeFromHexString < PackedStringCarrier > ( invalidPackedHex ) val invalidString = \"\" assertEquals ( PackedStringCarrier ( listOf ( invalidString ) ) , decoded ) }","docstring":"/**\n * Test that serializing a list of strings is never packed, and deserialization ignores the packing annotation.\n */"} {"signature":"@ Test fun testDecodeToplevelPackedList ( )","body":"{ val input = \"\" val listData = listOf ( , , , ) val decoded = ProtoBuf . decodeFromHexString < List < Int > > ( input ) assertEquals ( listData , decoded ) }","docstring":"/**\n * Test that toplevel \"packed\" lists with only byte length also work.\n */"} {"signature":"fun preprocessSources ( srcFiles : List < File > ) : List < File >","body":"fun preprocessSources ( srcFiles : List < File > ) : List < File >","docstring":"/**\n * Preprocess some sources and return path to the resulting file.\n * This function should be pure and should return the same output for given input\n * (required for incremental compilation).\n */"} {"signature":"fun preprocessSources ( srcFiles : List < File > ) : List < File >","body":"{ var result = srcFiles JpsServiceManager . getInstance ( ) . getExtensions ( SourcesPreprocessor :: class . java ) . forEach { result = it . preprocessSources ( result ) } return result }","docstring":"/**\n * Preprocess some sources and return path to the resulting file.\n * This function should be pure and should return the same output for given input\n * (required for incremental compilation).\n */"} {"signature":"internal fun shouldPerformPreLink ( config : KonanConfig , caches : ResolvedCacheBinaries , linkerOutputKind : LinkerOutputKind ) : Boolean","body":"{ val isStaticLibrary = linkerOutputKind == LinkerOutputKind . STATIC_LIBRARY && config . isFinalBinary val enabled = config . cacheSupport . preLinkCaches val nonEmptyCaches = caches . static . isNotEmpty ( ) return isStaticLibrary && enabled && nonEmptyCaches }","docstring":"/**\n * Check if we should link static caches into an object file before running full linkage.\n */"} {"signature":"internal fun resolveCacheBinaries ( cachedLibraries : CachedLibraries , dependenciesTrackingResult : DependenciesTrackingResult , ) : ResolvedCacheBinaries","body":"{ val staticCaches = mutableListOf < String > ( ) val dynamicCaches = mutableListOf < String > ( ) dependenciesTrackingResult . allCachedBitcodeDependencies . forEach { dependency -> val library = dependency . library val cache = cachedLibraries . getLibraryCache ( library ) ? : error ( \"\" ) val list = when ( cache . kind ) { CachedLibraries . Kind . DYNAMIC -> dynamicCaches CachedLibraries . Kind . STATIC -> staticCaches CachedLibraries . Kind . HEADER -> error ( \"\" ) } list += if ( dependency . kind is DependenciesTracker . DependencyKind . CertainFiles && cache is CachedLibraries . Cache . PerFile ) dependency . kind . files . map { cache . getFileBinaryPath ( it ) } else cache . binariesPaths } return ResolvedCacheBinaries ( static = staticCaches , dynamic = dynamicCaches ) }","docstring":"/**\n * Find binary files for compiler caches that are actually required for the linkage.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalPathApi :: class ) @ kotlin . internal . InlineOnly public inline fun Path . absolute ( ) : Path","body":"= toAbsolutePath ( )","docstring":"/**\n * Converts this possibly relative path to an absolute path.\n *\n * If this path is already [absolute][Path.isAbsolute], returns this path unchanged.\n * Otherwise, resolves this path, usually against the default directory of the file system.\n *\n * May throw an exception if the file system is inaccessible or getting the default directory path is prohibited.\n *\n * See [Path.toAbsolutePath] for further details about the function contract and possible exceptions.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalPathApi :: class ) @ kotlin . internal . InlineOnly public inline fun Path . absolutePathString ( ) : String","body":"= toAbsolutePath ( ) . toString ( )","docstring":"/**\n * Converts this possibly relative path to an absolute path and returns its string representation.\n *\n * Basically, this method is a combination of calling [absolute] and [pathString].\n *\n * May throw an exception if the file system is inaccessible or getting the default directory path is prohibited.\n *\n * See [Path.toAbsolutePath] for further details about the function contract and possible exceptions.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalPathApi :: class ) public fun Path . relativeTo ( base : Path ) : Path","body":"= try { PathRelativizer . tryRelativeTo ( this , base ) } catch ( e : IllegalArgumentException ) { throw IllegalArgumentException ( e . message + \"\" , e ) }","docstring":"/**\n * Calculates the relative path for this path from a [base] path.\n *\n * Note that the [base] path is treated as a directory.\n * If this path matches the [base] path, then a [Path] with an empty path will be returned.\n *\n * @return the relative path from [base] to this.\n *\n * @throws IllegalArgumentException if this and base paths have different roots.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalPathApi :: class ) public fun Path . relativeToOrSelf ( base : Path ) : Path","body":"= relativeToOrNull ( base ) ? : this","docstring":"/**\n * Calculates the relative path for this path from a [base] path.\n *\n * Note that the [base] path is treated as a directory.\n * If this path matches the [base] path, then a [Path] with an empty path will be returned.\n *\n * @return the relative path from [base] to this, or `this` if this and base paths have different roots.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalPathApi :: class ) public fun Path . relativeToOrNull ( base : Path ) : Path ?","body":"= try { PathRelativizer . tryRelativeTo ( this , base ) } catch ( e : IllegalArgumentException ) { null }","docstring":"/**\n * Calculates the relative path for this path from a [base] path.\n *\n * Note that the [base] path is treated as a directory.\n * If this path matches the [base] path, then a [Path] with an empty path will be returned.\n *\n * @return the relative path from [base] to this, or `null` if this and base paths have different roots.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalPathApi :: class ) @ Throws ( IOException :: class ) @ kotlin . internal . InlineOnly public inline fun Path . copyTo ( target : Path , overwrite : Boolean = false ) : Path","body":"{ val options = if ( overwrite ) arrayOf < CopyOption > ( StandardCopyOption . REPLACE_EXISTING ) else emptyArray ( ) return Files . copy ( this , target , * options ) }","docstring":"/**\n * Copies a file or directory located by this path to the given [target] path.\n *\n * Unlike `File.copyTo`, if some directories on the way to the [target] are missing, then they won't be created automatically.\n * You can use the [createParentDirectories] function to ensure that required intermediate directories are created:\n * ```\n * sourcePath.copyTo(destinationPath.createParentDirectories())\n * ```\n *\n * If the [target] path already exists, this function will fail unless [overwrite] argument is set to `true`.\n *\n * When [overwrite] is `true` and [target] is a directory, it is replaced only if it is empty.\n *\n * If this path is a directory, it is copied without its content, i.e. an empty [target] directory is created.\n * If you want to copy directory including its contents, use [copyToRecursively].\n *\n * The operation doesn't preserve copied file attributes such as creation/modification date, permissions, etc.\n *\n * @param overwrite `true` if destination overwrite is allowed.\n * @return the [target] path.\n * @throws NoSuchFileException if the source path doesn't exist.\n * @throws FileAlreadyExistsException if the destination path already exists and [overwrite] argument is set to `false`.\n * @throws DirectoryNotEmptyException if the destination path point to an existing directory and [overwrite] argument is `true`,\n * when the directory being replaced is not empty.\n * @throws IOException if any errors occur while copying.\n *\n * @see Files.copy\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalPathApi :: class ) @ Throws ( IOException :: class ) @ kotlin . internal . InlineOnly public inline fun Path . copyTo ( target : Path , vararg options : CopyOption ) : Path","body":"{ return Files . copy ( this , target , * options ) }","docstring":"/**\n * Copies a file or directory located by this path to the given [target] path.\n *\n * Unlike `File.copyTo`, if some directories on the way to the [target] are missing, then they won't be created automatically.\n * You can use the [createParentDirectories] function to ensure that required intermediate directories are created:\n * ```\n * sourcePath.copyTo(destinationPath.createParentDirectories())\n * ```\n *\n * If the [target] path already exists, this function will fail unless the\n * [REPLACE_EXISTING][StandardCopyOption.REPLACE_EXISTING] is option is used.\n *\n * When [REPLACE_EXISTING][StandardCopyOption.REPLACE_EXISTING] is used and [target] is a directory,\n * it is replaced only if it is empty.\n *\n * If this path is a directory, it is copied *without* its content, i.e. an empty [target] directory is created.\n * If you want to copy a directory including its contents, use [copyToRecursively].\n *\n * The operation doesn't preserve copied file attributes such as creation/modification date,\n * permissions, etc. unless [COPY_ATTRIBUTES][StandardCopyOption.COPY_ATTRIBUTES] is used.\n *\n * @param options options to control how the path is copied.\n * @return the [target] path.\n * @throws NoSuchFileException if the source path doesn't exist.\n * @throws FileAlreadyExistsException if the destination path already exists and [REPLACE_EXISTING][StandardCopyOption.REPLACE_EXISTING] is not used.\n * @throws DirectoryNotEmptyException if the destination path point to an existing directory and [REPLACE_EXISTING][StandardCopyOption.REPLACE_EXISTING] is used,\n * when the directory being replaced is not empty.\n * @throws IOException if any errors occur while copying.\n *\n * @see Files.copy\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalPathApi :: class ) @ kotlin . internal . InlineOnly public inline fun Path . exists ( vararg options : LinkOption ) : Boolean","body":"= Files . exists ( this , * options )","docstring":"/**\n * Checks if the file located by this path exists.\n *\n * @return `true`, if the file definitely exists, `false` otherwise,\n * including situations when the existence cannot be determined.\n *\n * @param options options to control how symbolic links are handled.\n *\n * @see Files.exists\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalPathApi :: class ) @ kotlin . internal . InlineOnly public inline fun Path . notExists ( vararg options : LinkOption ) : Boolean","body":"= Files . notExists ( this , * options )","docstring":"/**\n * Checks if the file located by this path does not exist.\n *\n * @return `true`, if the file definitely does not exist, `false` otherwise,\n * including situations when the existence cannot be determined.\n *\n * @param options options to control how symbolic links are handled.\n *\n * @see Files.notExists\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalPathApi :: class ) @ kotlin . internal . InlineOnly public inline fun Path . isRegularFile ( vararg options : LinkOption ) : Boolean","body":"= Files . isRegularFile ( this , * options )","docstring":"/**\n * Checks if the file located by this path is a regular file.\n *\n * @param options options to control how symbolic links are handled.\n *\n * @see Files.isRegularFile\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalPathApi :: class ) @ kotlin . internal . InlineOnly public inline fun Path . isDirectory ( vararg options : LinkOption ) : Boolean","body":"= Files . isDirectory ( this , * options )","docstring":"/**\n * Checks if the file located by this path is a directory.\n *\n * By default, symbolic links in the path are followed.\n *\n * @param options options to control how symbolic links are handled.\n *\n * @see Files.isDirectory\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalPathApi :: class ) @ kotlin . internal . InlineOnly public inline fun Path . isSymbolicLink ( ) : Boolean","body":"= Files . isSymbolicLink ( this )","docstring":"/**\n * Checks if the file located by this path exists and is a symbolic link.\n *\n * @see Files.isSymbolicLink\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalPathApi :: class ) @ kotlin . internal . InlineOnly public inline fun Path . isExecutable ( ) : Boolean","body":"= Files . isExecutable ( this )","docstring":"/**\n * Checks if the file located by this path exists and is executable.\n *\n * @see Files.isExecutable\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalPathApi :: class ) @ Throws ( IOException :: class ) @ kotlin . internal . InlineOnly public inline fun Path . isHidden ( ) : Boolean","body":"= Files . isHidden ( this )","docstring":"/**\n * Checks if the file located by this path is considered hidden.\n *\n * This check is dependant on the current filesystem. For example, on UNIX-like operating systems, a\n * path is considered hidden if its name begins with a dot. On Windows, file attributes are checked.\n *\n * @see Files.isHidden\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalPathApi :: class ) @ kotlin . internal . InlineOnly public inline fun Path . isReadable ( ) : Boolean","body":"= Files . isReadable ( this )","docstring":"/**\n * Checks if the file located by this path exists and is readable.\n *\n * @see Files.isReadable\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalPathApi :: class ) @ kotlin . internal . InlineOnly public inline fun Path . isWritable ( ) : Boolean","body":"= Files . isWritable ( this )","docstring":"/**\n * Checks if the file located by this path exists and is writable.\n *\n * @see Files.isWritable\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalPathApi :: class ) @ Throws ( IOException :: class ) @ kotlin . internal . InlineOnly public inline fun Path . isSameFileAs ( other : Path ) : Boolean","body":"= Files . isSameFile ( this , other )","docstring":"/**\n * Checks if the file located by this path points to the same file or directory as [other].\n *\n * @see Files.isSameFile\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalPathApi :: class ) @ Throws ( IOException :: class ) public fun Path . listDirectoryEntries ( glob : String = \"\" ) : List < Path >","body":"{ return Files . newDirectoryStream ( this , glob ) . use { it . toList ( ) } }","docstring":"/**\n * Returns a list of the entries in this directory optionally filtered by matching against the specified [glob] pattern.\n *\n * @param glob the globbing pattern. The syntax is specified by the [FileSystem.getPathMatcher] method.\n *\n * @throws java.util.regex.PatternSyntaxException if the glob pattern is invalid.\n * @throws NotDirectoryException If this path does not refer to a directory.\n * @throws IOException If an I/O error occurs.\n *\n * @see Files.newDirectoryStream\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalPathApi :: class ) @ Throws ( IOException :: class ) @ kotlin . internal . InlineOnly public inline fun < T > Path . useDirectoryEntries ( glob : String = \"\" , block : ( Sequence < Path > ) -> T ) : T","body":"{ return Files . newDirectoryStream ( this , glob ) . use { block ( it . asSequence ( ) ) } }","docstring":"/**\n * Calls the [block] callback with a sequence of all entries in this directory\n * optionally filtered by matching against the specified [glob] pattern.\n *\n * @param glob the globbing pattern. The syntax is specified by the [FileSystem.getPathMatcher] method.\n *\n * @throws java.util.regex.PatternSyntaxException if the glob pattern is invalid.\n * @throws NotDirectoryException If this path does not refer to a directory.\n * @throws IOException If an I/O error occurs.\n * @return the value returned by [block].\n *\n * @see Files.newDirectoryStream\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalPathApi :: class ) @ Throws ( IOException :: class ) @ kotlin . internal . InlineOnly public inline fun Path . forEachDirectoryEntry ( glob : String = \"\" , action : ( Path ) -> Unit )","body":"{ return Files . newDirectoryStream ( this , glob ) . use { it . forEach ( action ) } }","docstring":"/**\n * Performs the given [action] on each entry in this directory optionally filtered by matching against the specified [glob] pattern.\n *\n * @param glob the globbing pattern. The syntax is specified by the [FileSystem.getPathMatcher] method.\n *\n * @throws java.util.regex.PatternSyntaxException if the glob pattern is invalid.\n * @throws NotDirectoryException If this path does not refer to a directory.\n * @throws IOException If an I/O error occurs.\n *\n * @see Files.newDirectoryStream\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalPathApi :: class ) @ Throws ( IOException :: class ) @ kotlin . internal . InlineOnly public inline fun Path . fileSize ( ) : Long","body":"= Files . size ( this )","docstring":"/**\n * Returns the size of a regular file as a [Long] value of bytes or throws an exception if the file doesn't exist.\n *\n * @throws IOException if an I/O error occurred.\n * @see Files.size\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalPathApi :: class ) @ Throws ( IOException :: class ) @ kotlin . internal . InlineOnly public inline fun Path . deleteExisting ( )","body":"{ Files . delete ( this ) }","docstring":"/**\n * Deletes the existing file or empty directory specified by this path.\n *\n * @throws NoSuchFileException if the file or directory does not exist.\n * @throws DirectoryNotEmptyException if the directory exists but is not empty.\n *\n * @see Files.delete\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalPathApi :: class ) @ Throws ( IOException :: class ) @ kotlin . internal . InlineOnly public inline fun Path . deleteIfExists ( ) : Boolean","body":"= Files . deleteIfExists ( this )","docstring":"/**\n * Deletes the file or empty directory specified by this path if it exists.\n *\n * @return `true` if the existing file was successfully deleted, `false` if the file does not exist.\n *\n * @throws DirectoryNotEmptyException if the directory exists but is not empty\n *\n * @see Files.deleteIfExists\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalPathApi :: class ) @ Throws ( IOException :: class ) @ kotlin . internal . InlineOnly public inline fun Path . createDirectory ( vararg attributes : FileAttribute < * > ) : Path","body":"= Files . createDirectory ( this , * attributes )","docstring":"/**\n * Creates a new directory or throws an exception if there is already a file or directory located by this path.\n *\n * Note that the parent directory where this directory is going to be created must already exist.\n * If you need to create all non-existent parent directories, use [Path.createDirectories].\n *\n * @param attributes an optional list of file attributes to set atomically when creating the directory.\n *\n * @throws FileAlreadyExistsException if there is already a file or directory located by this path\n * (optional specific exception, some implementations may throw more general [IOException]).\n * @throws IOException if an I/O error occurs or the parent directory does not exist.\n * @throws UnsupportedOperationException if the [attributes ]array contains an attribute that cannot be set atomically\n * when creating the directory.\n *\n * @see Files.createDirectory\n * @see Path.createDirectories\n * @see Path.createParentDirectories\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalPathApi :: class ) @ Throws ( IOException :: class ) @ kotlin . internal . InlineOnly public inline fun Path . createDirectories ( vararg attributes : FileAttribute < * > ) : Path","body":"= Files . createDirectories ( this , * attributes )","docstring":"/**\n * Creates a directory ensuring that all nonexistent parent directories exist by creating them first.\n *\n * If the directory already exists, this function does not throw an exception, unlike [Path.createDirectory].\n *\n * @return the path of this directory if it already exists or has been created successfully.\n * The returned path can be converted [Path.toAbsolutePath][to absolute path] if it was relative.\n *\n * @param attributes an optional list of file attributes to set atomically when creating the directory.\n *\n * @throws FileAlreadyExistsException if there is already a file located by this path or one of its parent paths\n * (optional specific exception, some implementations may throw more general [IOException]).\n * @throws IOException if an I/O error occurs.\n * @throws UnsupportedOperationException if the [attributes] array contains an attribute that cannot be set atomically\n * when creating the directory.\n *\n * @see Files.createDirectories\n * @see Path.createDirectory\n * @see Path.createParentDirectories\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ Throws ( IOException :: class ) public fun Path . createParentDirectories ( vararg attributes : FileAttribute < * > ) : Path","body":"= also { val parent = it . parent if ( parent != null && ! parent . isDirectory ( ) ) { try { parent . createDirectories ( * attributes ) } catch ( e : FileAlreadyExistsException ) { if ( ! parent . isDirectory ( ) ) throw e } } }","docstring":"/**\n * Ensures that all parent directories of this path exist, creating them if required.\n *\n * If the parent directory already exists, this function does nothing.\n *\n * Note that the [parent][Path.getParent] directory is not always the directory that contains the entry specified by this path.\n * For example, the parent of the path `x/y/.` is `x/y`, which is logically the same directory,\n * and the parent of `x/y/..` (which means just `x/`) is also `x/y`.\n * Use the function [Path.normalize] to eliminate redundant name elements from the path.\n *\n * @param attributes an optional list of file attributes to set atomically when creating the missing parent directories.\n *\n * @return this path unchanged if all parent directories already exist or have been created successfully.\n *\n * @throws FileAlreadyExistsException if there is already a file located by the [parent][Path.getParent] path or one of its parent paths\n * (optional specific exception, some implementations may throw more general [IOException]).\n * @throws IOException if an I/O error occurs.\n * @throws UnsupportedOperationException if the [attributes] array contains an attribute that cannot be set atomically\n * when creating the directory.\n *\n * @see Path.getParent\n * @see Path.createDirectories\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalPathApi :: class ) @ Throws ( IOException :: class ) @ kotlin . internal . InlineOnly public inline fun Path . moveTo ( target : Path , vararg options : CopyOption ) : Path","body":"= Files . move ( this , target , * options )","docstring":"/**\n * Moves or renames the file located by this path to the [target] path.\n *\n * @param options options specifying how the move should be done, see [StandardCopyOption], [LinkOption].\n *\n * @throws FileAlreadyExistsException if the target file exists but cannot be replaced because the\n * [StandardCopyOption.REPLACE_EXISTING] option is not specified (optional specific exception).\n * @throws DirectoryNotEmptyException the [StandardCopyOption.REPLACE_EXISTING] option is specified but the file\n * cannot be replaced because it is a non-empty directory, or the\n * source is a non-empty directory containing entries that would\n * be required to be moved (optional specific exception).\n *\n * @see Files.move\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalPathApi :: class ) @ Throws ( IOException :: class ) @ kotlin . internal . InlineOnly public inline fun Path . moveTo ( target : Path , overwrite : Boolean = false ) : Path","body":"{ val options = if ( overwrite ) arrayOf < CopyOption > ( StandardCopyOption . REPLACE_EXISTING ) else emptyArray ( ) return Files . move ( this , target , * options ) }","docstring":"/**\n * Moves or renames the file located by this path to the [target] path.\n *\n * @param overwrite allows to overwrite the target if it already exists.\n *\n * @throws FileAlreadyExistsException if the target file exists but cannot be replaced because the\n * `overwrite = true` option is not specified (optional specific exception).\n * @throws DirectoryNotEmptyException the `overwrite = true` option is specified but the file\n * cannot be replaced because it is a non-empty directory, or the\n * source is a non-empty directory containing entries that would\n * be required to be moved (optional specific exception).\n *\n * @see Files.move\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalPathApi :: class ) @ Throws ( IOException :: class ) @ kotlin . internal . InlineOnly public inline fun Path . fileStore ( ) : FileStore","body":"= Files . getFileStore ( this )","docstring":"/**\n * Returns the [FileStore] representing the file store where a file is located.\n *\n * @see Files.getFileStore\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalPathApi :: class ) @ Throws ( IOException :: class ) @ kotlin . internal . InlineOnly public inline fun Path . getAttribute ( attribute : String , vararg options : LinkOption ) : Any ?","body":"= Files . getAttribute ( this , attribute , * options )","docstring":"/**\n * Reads the value of a file attribute.\n *\n * The attribute name is specified with the [attribute] parameter optionally prefixed with the attribute view name:\n * ```\n * [view_name:]attribute_name\n * ```\n * When the view name is not specified, it defaults to `basic`.\n *\n * @throws UnsupportedOperationException if the attribute view is not supported.\n * @throws IllegalArgumentException if the attribute name is not specified or is not recognized.\n * @see Files.getAttribute\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalPathApi :: class ) @ Throws ( IOException :: class ) @ kotlin . internal . InlineOnly public inline fun Path . setAttribute ( attribute : String , value : Any ? , vararg options : LinkOption ) : Path","body":"= Files . setAttribute ( this , attribute , value , * options )","docstring":"/**\n * Sets the value of a file attribute.\n *\n * The attribute name is specified with the [attribute] parameter optionally prefixed with the attribute view name:\n * ```\n * [view_name:]attribute_name\n * ```\n * When the view name is not specified, it defaults to `basic`.\n *\n * @throws UnsupportedOperationException if the attribute view is not supported.\n * @throws IllegalArgumentException if the attribute name is not specified or is not recognized, or\n * the attribute value is of the correct type but has an inappropriate value.\n * @throws ClassCastException if the attribute value is not of the expected type\n * @see Files.setAttribute\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalPathApi :: class ) @ kotlin . internal . InlineOnly public inline fun < reified V : FileAttributeView > Path . fileAttributesViewOrNull ( vararg options : LinkOption ) : V ?","body":"= Files . getFileAttributeView ( this , V :: class . java , * options )","docstring":"/**\n * Returns a file attributes view of a given type [V]\n * or `null` if the requested attribute view type is not available.\n *\n * The returned view allows to read and optionally to modify attributes of a file.\n *\n * @param V the reified type of the desired attribute view.\n *\n * @see Files.getFileAttributeView\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalPathApi :: class ) @ kotlin . internal . InlineOnly public inline fun < reified V : FileAttributeView > Path . fileAttributesView ( vararg options : LinkOption ) : V","body":"= Files . getFileAttributeView ( this , V :: class . java , * options ) ? : fileAttributeViewNotAvailable ( this , V :: class . java )","docstring":"/**\n * Returns a file attributes view of a given type [V]\n * or throws an [UnsupportedOperationException] if the requested attribute view type is not available..\n *\n * The returned view allows to read and optionally to modify attributes of a file.\n *\n * @param V the reified type of the desired attribute view, a subtype of [FileAttributeView].\n *\n * @see Files.getFileAttributeView\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalPathApi :: class ) @ Throws ( IOException :: class ) @ kotlin . internal . InlineOnly public inline fun < reified A : BasicFileAttributes > Path . readAttributes ( vararg options : LinkOption ) : A","body":"= Files . readAttributes ( this , A :: class . java , * options )","docstring":"/**\n * Reads a file's attributes of the specified type [A] in bulk.\n *\n * @param A the reified type of the desired attributes, a subtype of [BasicFileAttributes].\n *\n * @throws UnsupportedOperationException if the given attributes type [A] is not supported.\n * @see Files.readAttributes\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalPathApi :: class ) @ Throws ( IOException :: class ) @ kotlin . internal . InlineOnly public inline fun Path . readAttributes ( attributes : String , vararg options : LinkOption ) : Map < String , Any ? >","body":"= Files . readAttributes ( this , attributes , * options )","docstring":"/**\n * Reads the specified list of attributes of a file in bulk.\n *\n * The list of [attributes] to read is specified in the following string form:\n * ```\n * [view:]attribute_name1[,attribute_name2...]\n * ```\n * So the names are comma-separated and optionally prefixed by the attribute view type name, `basic` by default.\n * The special `*` attribute name can be used to read all attributes of the specified view.\n *\n * @return a [Map][Map] having an entry for an each attribute read, where the key is the attribute name and the value is the attribute value.\n * @throws UnsupportedOperationException if the attribute view is not supported.\n * @throws IllegalArgumentException if no attributes are specified or an unrecognized attribute is specified.\n * @see Files.readAttributes\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalPathApi :: class ) @ Throws ( IOException :: class ) @ kotlin . internal . InlineOnly public inline fun Path . getLastModifiedTime ( vararg options : LinkOption ) : FileTime","body":"= Files . getLastModifiedTime ( this , * options )","docstring":"/**\n * Returns the last modified time of the file located by this path.\n *\n * If the file system does not support modification timestamps, some implementation-specific default is returned.\n *\n * @see Files.getLastModifiedTime\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalPathApi :: class ) @ Throws ( IOException :: class ) @ kotlin . internal . InlineOnly public inline fun Path . setLastModifiedTime ( value : FileTime ) : Path","body":"= Files . setLastModifiedTime ( this , value )","docstring":"/**\n * Sets the last modified time attribute for the file located by this path.\n *\n * If the file system does not support modification timestamps, the behavior of this method is not defined.\n *\n * @see Files.setLastModifiedTime\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalPathApi :: class ) @ Throws ( IOException :: class ) @ kotlin . internal . InlineOnly public inline fun Path . getOwner ( vararg options : LinkOption ) : UserPrincipal ?","body":"= Files . getOwner ( this , * options )","docstring":"/**\n * Returns the owner of a file.\n *\n * @throws UnsupportedOperationException if the associated file system does not support the [FileOwnerAttributeView].\n *\n * @see Files.getOwner\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalPathApi :: class ) @ Throws ( IOException :: class ) @ kotlin . internal . InlineOnly public inline fun Path . setOwner ( value : UserPrincipal ) : Path","body":"= Files . setOwner ( this , value )","docstring":"/**\n * Sets the file owner to the specified [value].\n *\n * @throws UnsupportedOperationException if the associated file system does not support the [FileOwnerAttributeView].\n *\n * @see Files.setOwner\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalPathApi :: class ) @ Throws ( IOException :: class ) @ kotlin . internal . InlineOnly public inline fun Path . getPosixFilePermissions ( vararg options : LinkOption ) : Set < PosixFilePermission >","body":"= Files . getPosixFilePermissions ( this , * options )","docstring":"/**\n * Returns the POSIX file permissions of the file located by this path.\n *\n * @throws UnsupportedOperationException if the associated file system does not support the [PosixFileAttributeView].\n *\n * @see Files.getPosixFilePermissions\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalPathApi :: class ) @ Throws ( IOException :: class ) @ kotlin . internal . InlineOnly public inline fun Path . setPosixFilePermissions ( value : Set < PosixFilePermission > ) : Path","body":"= Files . setPosixFilePermissions ( this , value )","docstring":"/**\n * Sets the POSIX file permissions for the file located by this path.\n *\n * @throws UnsupportedOperationException if the associated file system does not support the [PosixFileAttributeView].\n *\n * @see Files.setPosixFilePermissions\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalPathApi :: class ) @ Throws ( IOException :: class ) @ kotlin . internal . InlineOnly public inline fun Path . createLinkPointingTo ( target : Path ) : Path","body":"= Files . createLink ( this , target )","docstring":"/**\n * Creates a new link (directory entry) located by this path for the existing file [target].\n *\n * Calling this function may require the process to be started with implementation specific privileges to create hard links\n * or to create links to directories.\n *\n * @throws FileAlreadyExistsException if a file with this name already exists\n * (optional specific exception, some implementations may throw a more general one).\n * @throws UnsupportedOperationException if the implementation does not support creating a hard link.\n *\n * @see Files.createLink\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalPathApi :: class ) @ Throws ( IOException :: class ) @ kotlin . internal . InlineOnly public inline fun Path . createSymbolicLinkPointingTo ( target : Path , vararg attributes : FileAttribute < * > ) : Path","body":"= Files . createSymbolicLink ( this , target , * attributes )","docstring":"/**\n * Creates a new symbolic link located by this path to the given [target].\n *\n * Calling this function may require the process to be started with implementation specific privileges to\n * create symbolic links.\n *\n * @throws FileAlreadyExistsException if a file with this name already exists\n * (optional specific exception, some implementations may throw a more general one).\n * @throws UnsupportedOperationException if the implementation does not support symbolic links or the\n * [attributes] array contains an attribute that cannot be set atomically when creating the symbolic link.\n *\n * @see Files.createSymbolicLink\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalPathApi :: class ) @ Throws ( IOException :: class ) @ kotlin . internal . InlineOnly public inline fun Path . readSymbolicLink ( ) : Path","body":"= Files . readSymbolicLink ( this )","docstring":"/**\n * Reads the target of a symbolic link located by this path.\n *\n * @throws UnsupportedOperationException if symbolic links are not supported by this implementation.\n * @throws NotLinkException if the target is not a symbolic link\n * (optional specific exception, some implementations may throw a more general one).\n *\n * @see Files.readSymbolicLink\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalPathApi :: class ) @ Throws ( IOException :: class ) @ kotlin . internal . InlineOnly public inline fun Path . createFile ( vararg attributes : FileAttribute < * > ) : Path","body":"= Files . createFile ( this , * attributes )","docstring":"/**\n * Creates a new and empty file specified by this path, failing if the file already exists.\n *\n * @param attributes an optional list of file attributes to set atomically when creating the file.\n *\n * @throws FileAlreadyExistsException if a file specified by this path already exists\n * (optional specific exception, some implementations may throw more general [IOException]).\n * @throws UnsupportedOperationException if the [attributes] array contains an attribute that cannot be set atomically\n * when creating the file.\n *\n * @see Files.createFile\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalPathApi :: class ) @ Throws ( IOException :: class ) @ kotlin . internal . InlineOnly public inline fun createTempFile ( prefix : String ? = null , suffix : String ? = null , vararg attributes : FileAttribute < * > ) : Path","body":"= Files . createTempFile ( prefix , suffix , * attributes )","docstring":"/**\n * Creates an empty file in the default temp directory, using\n * the given [prefix] and [suffix] to generate its name.\n *\n * @param attributes an optional list of file attributes to set atomically when creating the file.\n * @return the path to the newly created file that did not exist before.\n *\n * @throws UnsupportedOperationException if the array contains an attribute that cannot be set atomically\n * when creating the file.\n *\n * @see Files.createTempFile\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalPathApi :: class ) @ Throws ( IOException :: class ) public fun createTempFile ( directory : Path ? , prefix : String ? = null , suffix : String ? = null , vararg attributes : FileAttribute < * > ) : Path","body":"= if ( directory != null ) Files . createTempFile ( directory , prefix , suffix , * attributes ) else Files . createTempFile ( prefix , suffix , * attributes )","docstring":"/**\n * Creates an empty file in the specified [directory], using\n * the given [prefix] and [suffix] to generate its name.\n *\n * @param directory the parent directory in which to create a new file.\n * It can be `null`, in that case the new file is created in the default temp directory.\n * @param attributes an optional list of file attributes to set atomically when creating the file.\n * @return the path to the newly created file that did not exist before.\n *\n * @throws UnsupportedOperationException if the array contains an attribute that cannot be set atomically\n * when creating the file.\n *\n * @see Files.createTempFile\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalPathApi :: class ) @ Throws ( IOException :: class ) @ kotlin . internal . InlineOnly public inline fun createTempDirectory ( prefix : String ? = null , vararg attributes : FileAttribute < * > ) : Path","body":"= Files . createTempDirectory ( prefix , * attributes )","docstring":"/**\n * Creates a new directory in the default temp directory, using the given [prefix] to generate its name.\n *\n * @param attributes an optional list of file attributes to set atomically when creating the directory.\n * @return the path to the newly created directory that did not exist before.\n *\n * @throws UnsupportedOperationException if the array contains an attribute that cannot be set atomically\n * when creating the directory.\n *\n * @see Files.createTempDirectory\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalPathApi :: class ) @ Throws ( IOException :: class ) public fun createTempDirectory ( directory : Path ? , prefix : String ? = null , vararg attributes : FileAttribute < * > ) : Path","body":"= if ( directory != null ) Files . createTempDirectory ( directory , prefix , * attributes ) else Files . createTempDirectory ( prefix , * attributes )","docstring":"/**\n * Creates a new directory in the specified [directory], using the given [prefix] to generate its name.\n *\n * @param directory the parent directory in which to create a new directory.\n * It can be `null`, in that case the new directory is created in the default temp directory.\n * @param attributes an optional list of file attributes to set atomically when creating the directory.\n * @return the path to the newly created directory that did not exist before.\n *\n * @throws UnsupportedOperationException if the array contains an attribute that cannot be set atomically\n * when creating the directory.\n *\n * @see Files.createTempDirectory\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalPathApi :: class ) @ kotlin . internal . InlineOnly public inline operator fun Path . div ( other : Path ) : Path","body":"= this . resolve ( other )","docstring":"/**\n * Resolves the given [other] path against this path.\n *\n * This operator is a shortcut for the [Path.resolve] function.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalPathApi :: class ) @ kotlin . internal . InlineOnly public inline operator fun Path . div ( other : String ) : Path","body":"= this . resolve ( other )","docstring":"/**\n * Resolves the given [other] path string against this path.\n *\n * This operator is a shortcut for the [Path.resolve] function.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalPathApi :: class ) @ kotlin . internal . InlineOnly public inline fun Path ( path : String ) : Path","body":"= Paths . get ( path )","docstring":"/**\n * Converts the provided [path] string to a [Path] object of the [default][FileSystems.getDefault] filesystem.\n *\n * @see Paths.get\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalPathApi :: class ) @ kotlin . internal . InlineOnly public inline fun Path ( base : String , vararg subpaths : String ) : Path","body":"= Paths . get ( base , * subpaths )","docstring":"/**\n * Converts the name sequence specified with the [base] path string and a number of [subpaths] additional names\n * to a [Path] object of the [default][FileSystems.getDefault] filesystem.\n *\n * @see Paths.get\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalPathApi :: class ) @ kotlin . internal . InlineOnly public inline fun URI . toPath ( ) : Path","body":"= Paths . get ( this )","docstring":"/**\n * Converts this URI to a [Path] object.\n *\n * @see Paths.get\n */"} {"signature":"@ ExperimentalPathApi @ SinceKotlin ( \"\" ) public fun Path . walk ( vararg options : PathWalkOption ) : Sequence < Path >","body":"= PathTreeWalk ( this , options )","docstring":"/**\n * Returns a sequence of paths for visiting this directory and all its content.\n *\n * By default, only files are visited, in depth-first order, and symbolic links are not followed.\n * If encountered, symbolic links are included in the sequence as-is, and the content of the directory they point to is not visited.\n * The combination of [options] overrides the default behavior. See [PathWalkOption].\n *\n * The order in which sibling files are visited is unspecified.\n *\n * If after calling this function new files get added or deleted from the file tree rooted at this directory,\n * the changes may or may not appear in the returned sequence.\n *\n * If the file located by this path does not exist, an empty sequence is returned.\n * If the file located by this path is not a directory, a sequence containing only this path is returned.\n *\n * When iterating the returned sequence, the following exceptions could be thrown:\n * * [FileSystemException] if the traversal reaches an entry with an illegal name such as \".\" or \"..\".\n * * [FileSystemLoopException] if the traversal reaches a cycle.\n * * [SecurityException] if a security manager is installed and the traversal reaches an entry whose access is not permitted.\n * * [IOException] if any errors arise while opening a directory.\n */"} {"signature":"@ ExperimentalPathApi @ SinceKotlin ( \"\" ) public fun Path . visitFileTree ( visitor : FileVisitor < Path > , maxDepth : Int = Int . MAX_VALUE , followLinks : Boolean = false ) : Unit","body":"{ val options = if ( followLinks ) setOf ( FileVisitOption . FOLLOW_LINKS ) else setOf ( ) Files . walkFileTree ( this , options , maxDepth , visitor ) }","docstring":"/**\n * Visits this directory and all its content with the specified [visitor].\n *\n * The traversal is in depth-first order and starts at this directory. The specified [visitor] is invoked on each file encountered.\n *\n * @param visitor the [FileVisitor] that receives callbacks.\n * @param maxDepth the maximum depth to traverse. By default, there is no limit.\n * @param followLinks specifies whether to follow symbolic links, `false` by default.\n *\n * @see Files.walkFileTree\n */"} {"signature":"@ ExperimentalPathApi @ SinceKotlin ( \"\" ) public fun Path . visitFileTree ( maxDepth : Int = Int . MAX_VALUE , followLinks : Boolean = false , builderAction : FileVisitorBuilder . ( ) -> Unit ) : Unit","body":"{ contract { callsInPlace ( builderAction , InvocationKind . EXACTLY_ONCE ) } visitFileTree ( fileVisitor ( builderAction ) , maxDepth , followLinks ) }","docstring":"/**\n * Visits this directory and all its content with the [FileVisitor] defined in [builderAction].\n *\n * This function works the same as [Path.visitFileTree]. It is introduced to streamline\n * the cases when a [FileVisitor] is created only to be immediately used for a file tree traversal.\n * The trailing lambda [builderAction] is passed to [fileVisitor] to get the file visitor.\n *\n * Example:\n *\n * ``` kotlin\n * projectDirectory.visitFileTree {\n * onPreVisitDirectory { directory, _ ->\n * if (directory.name == \"build\") {\n * directory.toFile().deleteRecursively()\n * FileVisitResult.SKIP_SUBTREE\n * } else {\n * FileVisitResult.CONTINUE\n * }\n * }\n *\n * onVisitFile { file, _ ->\n * if (file.extension == \"class\") {\n * file.deleteExisting()\n * }\n * FileVisitResult.CONTINUE\n * }\n * }\n * ```\n *\n * @param maxDepth the maximum depth to traverse. By default, there is no limit.\n * @param followLinks specifies whether to follow symbolic links, `false` by default.\n * @param builderAction the function that defines [FileVisitor].\n *\n * @see Path.visitFileTree\n * @see fileVisitor\n */"} {"signature":"@ ExperimentalPathApi @ SinceKotlin ( \"\" ) public fun fileVisitor ( builderAction : FileVisitorBuilder . ( ) -> Unit ) : FileVisitor < Path >","body":"{ contract { callsInPlace ( builderAction , InvocationKind . EXACTLY_ONCE ) } return FileVisitorBuilderImpl ( ) . apply ( builderAction ) . build ( ) }","docstring":"/**\n * Builds a [FileVisitor] whose implementation is defined in [builderAction].\n *\n * By default, the returned file visitor visits all files and re-throws I/O errors, that is:\n * * [FileVisitor.preVisitDirectory] returns [FileVisitResult.CONTINUE].\n * * [FileVisitor.visitFile] returns [FileVisitResult.CONTINUE].\n * * [FileVisitor.visitFileFailed] re-throws the I/O exception that prevented the file from being visited.\n * * [FileVisitor.postVisitDirectory] returns [FileVisitResult.CONTINUE] if the directory iteration completes without an I/O exception;\n * otherwise it re-throws the I/O exception that caused the iteration of the directory to terminate prematurely.\n *\n * To override a function provide its implementation to the corresponding\n * function of the [FileVisitorBuilder] that was passed as a receiver to [builderAction].\n * Note that each function can be overridden only once.\n * Repeated override of a function throws [IllegalStateException].\n *\n * The builder is valid only inside [builderAction] function.\n * Using it outside the function throws [IllegalStateException].\n *\n * Example:\n *\n * ``` kotlin\n * val cleanVisitor = fileVisitor {\n * onPreVisitDirectory { directory, _ ->\n * if (directory.name == \"build\") {\n * directory.toFile().deleteRecursively()\n * FileVisitResult.SKIP_SUBTREE\n * } else {\n * FileVisitResult.CONTINUE\n * }\n * }\n *\n * onVisitFile { file, _ ->\n * if (file.extension == \"class\") {\n * file.deleteExisting()\n * }\n * FileVisitResult.CONTINUE\n * }\n * }\n * ```\n */"} {"signature":"fun url ( @ Language ( \"\" ) value : String ) : Unit","body":"= url . set ( URI ( value ) )","docstring":"/**\n * Set the value of [url].\n *\n * @param[value] will be converted to a [URI]\n */"} {"signature":"fun url ( value : Provider < String > ) : Unit","body":"= url . set ( value . map ( :: URI ) )","docstring":"/**\n * Set the value of [url].\n *\n * @param[value] will be converted to a [URI]\n */"} {"signature":"fun packageListUrl ( @ Language ( \"\" ) value : String ) : Unit","body":"= packageListUrl . set ( URI ( value ) )","docstring":"/**\n * Set the value of [packageListUrl].\n *\n * @param[value] will be converted to a [URI]\n */"} {"signature":"fun packageListUrl ( value : Provider < String > ) : Unit","body":"= packageListUrl . set ( value . map ( :: URI ) )","docstring":"/**\n * Set the value of [packageListUrl].\n *\n * @param[value] will be converted to a [URI]\n */"} {"signature":"fun append ( line : UnicodeDataLine )","body":"{ val charCode = line . char . hexToInt ( ) val equivalent = mappingEquivalent ( line ) ? . hexToInt ( ) ? : return val mapping = equivalent - charCode check ( ( charCode > Char . MAX_VALUE . code ) == ( equivalent > Char . MAX_VALUE . code ) ) { \"\" } if ( patterns . isEmpty ( ) ) { patterns . add ( createPattern ( charCode , line . categoryCode , mapping ) ) return } val lastPattern = patterns . last ( ) if ( ! lastPattern . append ( charCode , line . categoryCode , mapping ) ) { val newLastPattern = evolveLastPattern ( lastPattern , charCode , line . categoryCode , mapping ) if ( newLastPattern != null ) { patterns [ patterns . lastIndex ] = newLastPattern } else { patterns . add ( createPattern ( charCode , line . categoryCode , mapping ) ) } } }","docstring":"/**\n * Appends a line from the UnicodeData.txt file.\n */"} {"signature":"fun build ( ) : List < MappingPattern >","body":"{ return patterns }","docstring":"/**\n * Returns the resulting mapping patterns.\n */"} {"signature":"abstract fun mappingEquivalent ( line : UnicodeDataLine ) : String ?","body":"abstract fun mappingEquivalent ( line : UnicodeDataLine ) : String ?","docstring":"/**\n * Returns the mapping equivalent this builder is responsible for.\n */"} {"signature":"protected open fun evolveLastPattern ( lastPattern : MappingPattern , charCode : Int , categoryCode : String , mapping : Int ) : MappingPattern ?","body":"{ return null }","docstring":"/**\n * Appends the [charCode] with the specified [categoryCode] and [mapping] to the [lastPattern] and returns the resulting pattern,\n * or returns `null` if the [charCode] can't be appended to the [lastPattern].\n * The [lastPattern] can be transformed to another pattern type to accommodate the [charCode].\n */"} {"signature":"public actual fun < T > listOf ( element : T ) : List < T >","body":"= java . util . Collections . singletonList ( element )","docstring":"/**\n * Returns a new read-only list containing only the specified object [element].\n *\n * The returned list is serializable.\n *\n * @sample samples.collections.Collections.Lists.singletonReadOnlyList\n */"} {"signature":"@ kotlin . internal . InlineOnly public inline fun < T > java . util . Enumeration < T > . toList ( ) : List < T >","body":"= java . util . Collections . list ( this )","docstring":"/**\n * Returns a list containing the elements returned by this enumeration\n * in the order they are returned by the enumeration.\n * @sample samples.collections.Collections.Lists.listFromEnumeration\n */"} {"signature":"@ SinceKotlin ( \"\" ) public actual fun < T > Iterable < T > . shuffled ( ) : List < T >","body":"= toMutableList ( ) . apply { shuffle ( ) }","docstring":"/**\n * Returns a new list with the elements of this collection randomly shuffled.\n */"} {"signature":"@ SinceKotlin ( \"\" ) public fun < T > Iterable < T > . shuffled ( random : java . util . Random ) : List < T >","body":"= toMutableList ( ) . apply { shuffle ( random ) }","docstring":"/**\n * Returns a new list with the elements of this list randomly shuffled\n * using the specified [random] instance as the source of randomness.\n */"} {"signature":"fun ktFile ( pathFromSrc : String , fqPackageName : String = filePathToPackageName ( pathFromSrc ) , fillFile : KotlinTestDataFile . ( ) -> Unit )","body":"fun ktFile ( pathFromSrc : String , fqPackageName : String = filePathToPackageName ( pathFromSrc ) , fillFile : KotlinTestDataFile . ( ) -> Unit )","docstring":"/**\n * Creates a `.kt` file.\n *\n * By default, the package of this file is deduced automatically from the [pathFromSrc] param.\n * For example, for a path `org/jetbrains/dokka/test` the package will be `org.jetbrains.dokka.test`.\n * The package can be overridden by setting [fqPackageName].\n *\n * @param pathFromSrc path relative to the source code directory of the project.\n * Must contain packages (if any) and end in `.kt`.\n * Example: `org/jetbrains/dokka/test/File.kt`\n * @param fqPackageName package name to be used in the `package` statement of this file.\n * This value overrides the automatically deduced package.\n */"} {"signature":"public fun < T > CoroutineScope . promise ( context : CoroutineContext = EmptyCoroutineContext , start : CoroutineStart = CoroutineStart . DEFAULT , block : suspend CoroutineScope . ( ) -> T ) : Promise < T >","body":"= async ( context , start , block ) . asPromise ( )","docstring":"/**\n * Starts new coroutine and returns its result as an implementation of [Promise].\n *\n * Coroutine context is inherited from a [CoroutineScope], additional context elements can be specified with [context] argument.\n * If the context does not have any dispatcher nor any other [ContinuationInterceptor], then [Dispatchers.Default] is used.\n * The parent job is inherited from a [CoroutineScope] as well, but it can also be overridden\n * with corresponding [context] element.\n *\n * By default, the coroutine is immediately scheduled for execution.\n * Other options can be specified via `start` parameter. See [CoroutineStart] for details.\n *\n * @param context additional to [CoroutineScope.coroutineContext] context of the coroutine.\n * @param start coroutine start option. The default value is [CoroutineStart.DEFAULT].\n * @param block the coroutine code.\n */"} {"signature":"public fun < T > Deferred < T > . asPromise ( ) : Promise < T >","body":"{ val promise = Promise < T > { resolve , reject -> invokeOnCompletion { val e = getCompletionExceptionOrNull ( ) if ( e != null ) { reject ( e ) } else { resolve ( getCompleted ( ) ) } } } promise . asDynamic ( ) . deferred = this return promise }","docstring":"/**\n * Converts this deferred value to the instance of [Promise].\n */"} {"signature":"public fun < T > Promise < T > . asDeferred ( ) : Deferred < T >","body":"{ val deferred = asDynamic ( ) . deferred @ Suppress ( \"\" ) return deferred ? : GlobalScope . async ( start = CoroutineStart . UNDISPATCHED ) { await ( ) } }","docstring":"/**\n * Converts this promise value to the instance of [Deferred].\n */"} {"signature":"public suspend fun < T > Promise < T > . await ( ) : T","body":"= suspendCancellableCoroutine { cont : CancellableContinuation < T > -> this@await . then ( onFulfilled = { cont . resume ( it ) } , onRejected = { cont . resumeWithException ( it ) } ) }","docstring":"/**\n * Awaits for completion of the promise without blocking.\n *\n * This suspending function is cancellable: if the [Job] of the current coroutine is cancelled while this\n * suspending function is waiting on the promise, 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 */"} {"signature":"private fun < Data , Context : PhaseContext > createLlvmDumperAction ( ) : Action < Data , Context >","body":"= fun ( state : ActionState , data : Data , context : Context ) { if ( state . phase . name in context . config . configuration . getList ( KonanConfigKeys . SAVE_LLVM_IR ) ) { val llvmModule = findLlvmModule ( data , context ) if ( llvmModule == null ) { context . messageCollector . report ( CompilerMessageSeverity . WARNING , \"\" ) return } val moduleName : String = llvmModule . getName ( ) val output = File ( context . config . saveLlvmIrDirectory , \"\" ) if ( LLVMPrintModuleToFile ( llvmModule , output . absolutePath , null ) != ) { error ( \"\" ) } } }","docstring":"/**\n * Create action that searches context and data for LLVM IR and dumps it.\n */"} {"signature":"private fun < Data , Context : PhaseContext > createLlvmVerifierAction ( ) : Action < Data , Context >","body":"= fun ( actionState : ActionState , data : Data , context : Context ) { if ( ! context . config . configuration . getBoolean ( KonanConfigKeys . VERIFY_BITCODE ) ) { return } val llvmModule = findLlvmModule ( data , context ) if ( llvmModule == null ) { context . messageCollector . report ( CompilerMessageSeverity . WARNING , \"\" ) return } verifyModule ( llvmModule ) }","docstring":"/**\n *\n */"} {"signature":"@ Suppress ( \"\" ) private fun < Data , Context : PhaseContext > findLlvmModule ( data : Data , context : Context ) : LLVMModuleRef ?","body":"= when { data is CPointer < * > -> data as LLVMModuleRef data is LlvmIrHolder -> data . llvmModule context is LlvmIrHolder -> context . llvmModule else -> null }","docstring":"/**\n *\n */"} {"signature":"internal fun < Data , Context : PhaseContext > getDefaultLlvmModuleActions ( ) : Set < Action < Data , Context > >","body":"= setOf ( createLlvmDumperAction ( ) , createLlvmVerifierAction ( ) )","docstring":"/**\n * Default set of dump and validate actions for LLVM phases.\n */"} {"signature":"fun < K , V > JavaRDD < Tuple2 < K , V > > . toJavaPairRDD ( ) : JavaPairRDD < K , V >","body":"= JavaPairRDD . fromJavaRDD ( this )","docstring":"/** Utility method to convert [JavaRDD]<[Tuple2]> to [JavaPairRDD]. */"} {"signature":"fun < K , V > JavaPairRDD < K , V > . toTupleRDD ( ) : JavaRDD < Tuple2 < K , V > >","body":"= JavaPairRDD . toRDD ( this ) . toJavaRDD ( )","docstring":"/** Utility method to convert [JavaPairRDD] to [JavaRDD]<[Tuple2]>. */"} {"signature":"fun < K , V , C > JavaRDD < Tuple2 < K , V > > . combineByKey ( createCombiner : ( V ) -> C , mergeValue : ( C , V ) -> C , mergeCombiners : ( C , C ) -> C , partitioner : Partitioner , mapSideCombine : Boolean = true , serializer : Serializer ? = null , ) : JavaRDD < Tuple2 < K , C > >","body":"= toJavaPairRDD ( ) . combineByKey ( createCombiner , mergeValue , mergeCombiners , partitioner , mapSideCombine , serializer ) . toTupleRDD ( )","docstring":"/**\n * Generic function to combine the elements for each key using a custom set of aggregation\n * functions. This method is here for backward compatibility. It does not provide combiner\n * classtag information to the shuffle.\n */"} {"signature":"fun < K , V , C > JavaRDD < Tuple2 < K , V > > . combineByKey ( createCombiner : ( V ) -> C , mergeValue : ( C , V ) -> C , mergeCombiners : ( C , C ) -> C , numPartitions : Int , ) : JavaRDD < Tuple2 < K , C > >","body":"= toJavaPairRDD ( ) . combineByKey ( createCombiner , mergeValue , mergeCombiners , numPartitions ) . toTupleRDD ( )","docstring":"/**\n * Simplified version of combineByKeyWithClassTag that hash-partitions the output RDD.\n * This method is here for backward compatibility. It does not provide combiner\n * classtag information to the shuffle.\n */"} {"signature":"fun < K , V , U > JavaRDD < Tuple2 < K , V > > . aggregateByKey ( zeroValue : U , partitioner : Partitioner , seqFunc : ( U , V ) -> U , combFunc : ( U , U ) -> U , ) : JavaRDD < Tuple2 < K , U > >","body":"= toJavaPairRDD ( ) . aggregateByKey ( zeroValue , partitioner , seqFunc , combFunc ) . toTupleRDD ( )","docstring":"/**\n * Aggregate the values of each key, using given combine functions and a neutral \"zero value\".\n * This function can return a different result type, [U], than the type of the values in this RDD,\n * [V]. Thus, we need one operation for merging a [V] into a [U] and one operation for merging two [U]'s,\n * as in scala.TraversableOnce. The former operation is used for merging values within a\n * partition, and the latter is used for merging values between partitions. To avoid memory\n * allocation, both of these functions are allowed to modify and return their first argument\n * instead of creating a new [U].\n */"} {"signature":"fun < K , V , U > JavaRDD < Tuple2 < K , V > > . aggregateByKey ( zeroValue : U , numPartitions : Int , seqFunc : ( U , V ) -> U , combFunc : ( U , U ) -> U , ) : JavaRDD < Tuple2 < K , U > >","body":"= toJavaPairRDD ( ) . aggregateByKey ( zeroValue , numPartitions , seqFunc , combFunc ) . toTupleRDD ( )","docstring":"/**\n * Aggregate the values of each key, using given combine functions and a neutral \"zero value\".\n * This function can return a different result type, [U], than the type of the values in this RDD,\n * [V]. Thus, we need one operation for merging a [V] into a [U] and one operation for merging two [U]'s,\n * as in scala.TraversableOnce. The former operation is used for merging values within a\n * partition, and the latter is used for merging values between partitions. To avoid memory\n * allocation, both of these functions are allowed to modify and return their first argument\n * instead of creating a new [U].\n */"} {"signature":"fun < K , V , U > JavaRDD < Tuple2 < K , V > > . aggregateByKey ( zeroValue : U , seqFunc : ( U , V ) -> U , combFunc : ( U , U ) -> U , ) : JavaRDD < Tuple2 < K , U > >","body":"= toJavaPairRDD ( ) . aggregateByKey ( zeroValue , seqFunc , combFunc ) . toTupleRDD ( )","docstring":"/**\n * Aggregate the values of each key, using given combine functions and a neutral \"zero value\".\n * This function can return a different result type, [U], than the type of the values in this RDD,\n * [V]. Thus, we need one operation for merging a [V] into a [U] and one operation for merging two [U]'s,\n * as in scala.TraversableOnce. The former operation is used for merging values within a\n * partition, and the latter is used for merging values between partitions. To avoid memory\n * allocation, both of these functions are allowed to modify and return their first argument\n * instead of creating a new [U].\n */"} {"signature":"fun < K , V > JavaRDD < Tuple2 < K , V > > . foldByKey ( zeroValue : V , partitioner : Partitioner , func : ( V , V ) -> V , ) : JavaRDD < Tuple2 < K , V > >","body":"= toJavaPairRDD ( ) . foldByKey ( zeroValue , partitioner , func ) . toTupleRDD ( )","docstring":"/**\n * Merge the values for each key using an associative function and a neutral \"zero value\" which\n * may be added to the result an arbitrary number of times, and must not change the result\n * (e.g., [emptyList] for list concatenation, 0 for addition, or 1 for multiplication.).\n */"} {"signature":"fun < K , V > JavaRDD < Tuple2 < K , V > > . foldByKey ( zeroValue : V , numPartitions : Int , func : ( V , V ) -> V , ) : JavaRDD < Tuple2 < K , V > >","body":"= toJavaPairRDD ( ) . foldByKey ( zeroValue , numPartitions , func ) . toTupleRDD ( )","docstring":"/**\n * Merge the values for each key using an associative function and a neutral \"zero value\" which\n * may be added to the result an arbitrary number of times, and must not change the result\n * (e.g., [emptyList] for list concatenation, 0 for addition, or 1 for multiplication.).\n */"} {"signature":"fun < K , V > JavaRDD < Tuple2 < K , V > > . foldByKey ( zeroValue : V , func : ( V , V ) -> V , ) : JavaRDD < Tuple2 < K , V > >","body":"= toJavaPairRDD ( ) . foldByKey ( zeroValue , func ) . toTupleRDD ( )","docstring":"/**\n * Merge the values for each key using an associative function and a neutral \"zero value\" which\n * may be added to the result an arbitrary number of times, and must not change the result\n * (e.g., [emptyList] for list concatenation, 0 for addition, or 1 for multiplication.).\n */"} {"signature":"fun < K , V > JavaRDD < Tuple2 < K , V > > . sampleByKey ( withReplacement : Boolean , fractions : Map < K , Double > , seed : Long = Random . nextLong ( ) , ) : JavaRDD < Tuple2 < K , V > >","body":"= toJavaPairRDD ( ) . sampleByKey ( withReplacement , fractions , seed ) . toTupleRDD ( )","docstring":"/**\n * Return a subset of this RDD sampled by key (via stratified sampling).\n *\n * Create a sample of this RDD using variable sampling rates for different keys as specified by\n * [fractions], a key to sampling rate map, via simple random sampling with one pass over the\n * RDD, to produce a sample of size that's approximately equal to the sum of\n * math.ceil(numItems * samplingRate) over all key values.\n *\n * @param withReplacement whether to sample with or without replacement\n * @param fractions map of specific keys to sampling rates\n * @param seed seed for the random number generator\n * @return RDD containing the sampled subset\n */"} {"signature":"fun < K , V > JavaRDD < Tuple2 < K , V > > . sampleByKeyExact ( withReplacement : Boolean , fractions : Map < K , Double > , seed : Long = Random . nextLong ( ) , ) : JavaRDD < Tuple2 < K , V > >","body":"= toJavaPairRDD ( ) . sampleByKeyExact ( withReplacement , fractions , seed ) . toTupleRDD ( )","docstring":"/**\n * Return a subset of this RDD sampled by key (via stratified sampling) containing exactly\n * math.ceil(numItems * samplingRate) for each stratum (group of pairs with the same key).\n *\n * This method differs from [sampleByKey] in that we make additional passes over the RDD to\n * create a sample size that's exactly equal to the sum of math.ceil(numItems * samplingRate)\n * over all key values with a 99.99% confidence. When sampling without replacement, we need one\n * additional pass over the RDD to guarantee sample size; when sampling with replacement, we need\n * two additional passes.\n *\n * @param withReplacement whether to sample with or without replacement\n * @param fractions map of specific keys to sampling rates\n * @param seed seed for the random number generator\n * @return RDD containing the sampled subset\n */"} {"signature":"fun < K , V > JavaRDD < Tuple2 < K , V > > . reduceByKey ( partitioner : Partitioner , func : ( V , V ) -> V , ) : JavaRDD < Tuple2 < K , V > >","body":"= toJavaPairRDD ( ) . reduceByKey ( partitioner , func ) . toTupleRDD ( )","docstring":"/**\n * Merge the values for each key using an associative and commutative reduce function. This will\n * also perform the merging locally on each mapper before sending results to a reducer, similarly\n * to a \"combiner\" in MapReduce.\n */"} {"signature":"fun < K , V > JavaRDD < Tuple2 < K , V > > . reduceByKey ( numPartitions : Int , func : ( V , V ) -> V , ) : JavaRDD < Tuple2 < K , V > >","body":"= toJavaPairRDD ( ) . reduceByKey ( func , numPartitions ) . toTupleRDD ( )","docstring":"/**\n * Merge the values for each key using an associative and commutative reduce function. This will\n * also perform the merging locally on each mapper before sending results to a reducer, similarly\n * to a \"combiner\" in MapReduce. Output will be hash-partitioned with numPartitions partitions.\n */"} {"signature":"fun < K , V > JavaRDD < Tuple2 < K , V > > . reduceByKey ( func : ( V , V ) -> V , ) : JavaRDD < Tuple2 < K , V > >","body":"= toJavaPairRDD ( ) . reduceByKey ( func ) . toTupleRDD ( )","docstring":"/**\n * Merge the values for each key using an associative and commutative reduce function. This will\n * also perform the merging locally on each mapper before sending results to a reducer, similarly\n * to a \"combiner\" in MapReduce. Output will be hash-partitioned with the existing partitioner/\n * parallelism level.\n */"} {"signature":"fun < K , V > JavaRDD < Tuple2 < K , V > > . reduceByKeyLocally ( func : ( V , V ) -> V , ) : Map < K , V >","body":"= toJavaPairRDD ( ) . reduceByKeyLocally ( func )","docstring":"/**\n * Merge the values for each key using an associative and commutative reduce function, but return\n * the results immediately to the master as a Map. This will also perform the merging locally on\n * each mapper before sending results to a reducer, similarly to a \"combiner\" in MapReduce.\n */"} {"signature":"fun < K , V > JavaRDD < Tuple2 < K , V > > . countByKey ( ) : Map < K , Long >","body":"= toJavaPairRDD ( ) . countByKey ( )","docstring":"/**\n * Count the number of elements for each key, collecting the results to a local Map.\n *\n * This method should only be used if the resulting map is expected to be small, as\n * the whole thing is loaded into the driver's memory.\n * To handle very large results, consider using `rdd.mapValues { 1L }.reduceByKey(Long::plus)`, which\n * returns an [RDD] instead of a map.\n */"} {"signature":"fun < K , V > JavaRDD < Tuple2 < K , V > > . countByKeyApprox ( timeout : Long , confidence : Double = , ) : PartialResult < Map < K , BoundedDouble > >","body":"= toJavaPairRDD ( ) . countByKeyApprox ( timeout , confidence )","docstring":"/**\n * Approximate version of countByKey that can return a partial result if it does\n * not finish within a timeout.\n *\n * The confidence is the probability that the error bounds of the result will\n * contain the true value. That is, if countApprox were called repeatedly\n * with confidence 0.9, we would expect 90% of the results to contain the\n * true count. The confidence must be in the range <0,1> or an exception will\n * be thrown.\n *\n * @param timeout maximum time to wait for the job, in milliseconds\n * @param confidence the desired statistical confidence in the result\n * @return a potentially incomplete result, with error bounds\n */"} {"signature":"fun < K , V > JavaRDD < Tuple2 < K , V > > . groupByKey ( partitioner : Partitioner , ) : JavaRDD < Tuple2 < K , Iterable < V > > >","body":"= toJavaPairRDD ( ) . groupByKey ( partitioner ) . toTupleRDD ( )","docstring":"/**\n * Group the values for each key in the RDD into a single sequence. Allows controlling the\n * partitioning of the resulting key-value pair RDD by passing a Partitioner.\n * The ordering of elements within each group is not guaranteed, and may even differ\n * each time the resulting RDD is evaluated.\n *\n * Note: This operation may be very expensive. If you are grouping in order to perform an\n * aggregation (such as a sum or average) over each key, using [aggregateByKey]\n * or [reduceByKey] will provide much better performance.\n *\n * Note: As currently implemented, groupByKey must be able to hold all the key-value pairs for any\n * key in memory. If a key has too many values, it can result in an [OutOfMemoryError].\n */"} {"signature":"fun < K , V > JavaRDD < Tuple2 < K , V > > . groupByKey ( numPartitions : Int , ) : JavaRDD < Tuple2 < K , Iterable < V > > >","body":"= toJavaPairRDD ( ) . groupByKey ( numPartitions ) . toTupleRDD ( )","docstring":"/**\n * Group the values for each key in the RDD into a single sequence. Hash-partitions the\n * resulting RDD with into [numPartitions] partitions. The ordering of elements within\n * each group is not guaranteed, and may even differ each time the resulting RDD is evaluated.\n *\n * Note: This operation may be very expensive. If you are grouping in order to perform an\n * aggregation (such as a sum or average) over each key, using [aggregateByKey]\n * or [reduceByKey] will provide much better performance.\n *\n * Note: As currently implemented, groupByKey must be able to hold all the key-value pairs for any\n * key in memory. If a key has too many values, it can result in an [OutOfMemoryError].\n */"} {"signature":"fun < K , V > JavaRDD < Tuple2 < K , V > > . partitionBy ( partitioner : Partitioner , ) : JavaRDD < Tuple2 < K , V > >","body":"= toJavaPairRDD ( ) . partitionBy ( partitioner ) . toTupleRDD ( )","docstring":"/**\n * Return a copy of the RDD partitioned using the specified partitioner.\n */"} {"signature":"fun < K , V , W > JavaRDD < Tuple2 < K , V > > . join ( other : JavaRDD < Tuple2 < K , W > > , partitioner : Partitioner , ) : JavaRDD < Tuple2 < K , Tuple2 < V , W > > >","body":"= toJavaPairRDD ( ) . join ( other . toJavaPairRDD ( ) , partitioner ) . toTupleRDD ( )","docstring":"/**\n * Return an RDD containing all pairs of elements with matching keys in [this] and [other]. Each\n * pair of elements will be returned as a (k, (v1, v2)) tuple, where (k, v1) is in [this] and\n * (k, v2) is in [other]. Uses the given Partitioner to partition the output RDD.\n */"} {"signature":"fun < K , V , W > JavaRDD < Tuple2 < K , V > > . leftOuterJoin ( other : JavaRDD < Tuple2 < K , W > > , partitioner : Partitioner , ) : JavaRDD < Tuple2 < K , Tuple2 < V , Optional < W > > > >","body":"= toJavaPairRDD ( ) . leftOuterJoin ( other . toJavaPairRDD ( ) , partitioner ) . toTupleRDD ( )","docstring":"/**\n * Perform a left outer join of [this] and [other]. For each element (k, v) in [this], the\n * resulting RDD will either contain all pairs (k, (v, Some(w))) for w in [other], or the\n * pair (k, (v, None)) if no elements in [other] have key k. Uses the given Partitioner to\n * partition the output RDD.\n */"} {"signature":"fun < K , V , W > JavaRDD < Tuple2 < K , V > > . rightOuterJoin ( other : JavaRDD < Tuple2 < K , W > > , partitioner : Partitioner , ) : JavaRDD < Tuple2 < K , Tuple2 < Optional < V > , W > > >","body":"= toJavaPairRDD ( ) . rightOuterJoin ( other . toJavaPairRDD ( ) , partitioner ) . toTupleRDD ( )","docstring":"/**\n * Perform a right outer join of [this] and [other]. For each element (k, w) in [other], the\n * resulting RDD will either contain all pairs (k, (Some(v), w)) for v in [this], or the\n * pair (k, (None, w)) if no elements in [this] have key k. Uses the given Partitioner to\n * partition the output RDD.\n */"} {"signature":"fun < K , V , W > JavaRDD < Tuple2 < K , V > > . fullOuterJoin ( other : JavaRDD < Tuple2 < K , W > > , partitioner : Partitioner , ) : JavaRDD < Tuple2 < K , Tuple2 < Optional < V > , Optional < W > > > >","body":"= toJavaPairRDD ( ) . fullOuterJoin ( other . toJavaPairRDD ( ) , partitioner ) . toTupleRDD ( )","docstring":"/**\n * Perform a full outer join of [this] and [other]. For each element (k, v) in [this], the\n * resulting RDD will either contain all pairs (k, (Some(v), Some(w))) for w in [other], or\n * the pair (k, (Some(v), None)) if no elements in [other] have key k. Similarly, for each\n * element (k, w) in [other], the resulting RDD will either contain all pairs\n * (k, (Some(v), Some(w))) for v in [this], or the pair (k, (None, Some(w))) if no elements\n * in [this] have key k. Uses the given Partitioner to partition the output RDD.\n */"} {"signature":"fun < K , V , C > JavaRDD < Tuple2 < K , V > > . combineByKey ( createCombiner : ( V ) -> C , mergeValue : ( C , V ) -> C , mergeCombiners : ( C , C ) -> C , ) : JavaRDD < Tuple2 < K , C > >","body":"= toJavaPairRDD ( ) . combineByKey ( createCombiner , mergeValue , mergeCombiners ) . toTupleRDD ( )","docstring":"/**\n * Simplified version of combineByKeyWithClassTag that hash-partitions the resulting RDD using the\n * existing partitioner/parallelism level. This method is here for backward compatibility. It\n * does not provide combiner classtag information to the shuffle.\n */"} {"signature":"fun < K , V > JavaRDD < Tuple2 < K , V > > . groupByKey ( ) : JavaRDD < Tuple2 < K , Iterable < V > > >","body":"= toJavaPairRDD ( ) . groupByKey ( ) . toTupleRDD ( )","docstring":"/**\n * Group the values for each key in the RDD into a single sequence. Hash-partitions the\n * resulting RDD with the existing partitioner/parallelism level. The ordering of elements\n * within each group is not guaranteed, and may even differ each time the resulting RDD is\n * evaluated.\n *\n * Note: This operation may be very expensive. If you are grouping in order to perform an\n * aggregation (such as a sum or average) over each key, using [aggregateByKey]\n * or [reduceByKey] will provide much better performance.\n */"} {"signature":"fun < K , V , W > JavaRDD < Tuple2 < K , V > > . join ( other : JavaRDD < Tuple2 < K , W > > ) : JavaRDD < Tuple2 < K , Tuple2 < V , W > > >","body":"= toJavaPairRDD ( ) . join ( other . toJavaPairRDD ( ) ) . toTupleRDD ( )","docstring":"/**\n * Return an RDD containing all pairs of elements with matching keys in [this] and [other]. Each\n * pair of elements will be returned as a (k, (v1, v2)) tuple, where (k, v1) is in [this] and\n * (k, v2) is in [other]. Performs a hash join across the cluster.\n */"} {"signature":"fun < K , V , W > JavaRDD < Tuple2 < K , V > > . join ( other : JavaRDD < Tuple2 < K , W > > , numPartitions : Int , ) : JavaRDD < Tuple2 < K , Tuple2 < V , W > > >","body":"= toJavaPairRDD ( ) . join ( other . toJavaPairRDD ( ) , numPartitions ) . toTupleRDD ( )","docstring":"/**\n * Return an RDD containing all pairs of elements with matching keys in [this] and [other]. Each\n * pair of elements will be returned as a (k, (v1, v2)) tuple, where (k, v1) is in [this] and\n * (k, v2) is in [other]. Performs a hash join across the cluster.\n */"} {"signature":"fun < K , V , W > JavaRDD < Tuple2 < K , V > > . leftOuterJoin ( other : JavaRDD < Tuple2 < K , W > > , ) : JavaRDD < Tuple2 < K , Tuple2 < V , Optional < W > > > >","body":"= toJavaPairRDD ( ) . leftOuterJoin ( other . toJavaPairRDD ( ) ) . toTupleRDD ( )","docstring":"/**\n * Perform a left outer join of [this] and [other]. For each element (k, v) in [this], the\n * resulting RDD will either contain all pairs (k, (v, Some(w))) for w in [other], or the\n * pair (k, (v, None)) if no elements in [other] have key k. Hash-partitions the output\n * using the existing partitioner/parallelism level.\n */"} {"signature":"fun < K , V , W > JavaRDD < Tuple2 < K , V > > . leftOuterJoin ( other : JavaRDD < Tuple2 < K , W > > , numPartitions : Int , ) : JavaRDD < Tuple2 < K , Tuple2 < V , Optional < W > > > >","body":"= toJavaPairRDD ( ) . leftOuterJoin ( other . toJavaPairRDD ( ) , numPartitions ) . toTupleRDD ( )","docstring":"/**\n * Perform a left outer join of [this] and [other]. For each element (k, v) in [this], the\n * resulting RDD will either contain all pairs (k, (v, Some(w))) for w in [other], or the\n * pair (k, (v, None)) if no elements in [other] have key k. Hash-partitions the output\n * into [numPartitions] partitions.\n */"} {"signature":"fun < K , V , W > JavaRDD < Tuple2 < K , V > > . rightOuterJoin ( other : JavaRDD < Tuple2 < K , W > > , ) : JavaRDD < Tuple2 < K , Tuple2 < Optional < V > , W > > >","body":"= toJavaPairRDD ( ) . rightOuterJoin ( other . toJavaPairRDD ( ) ) . toTupleRDD ( )","docstring":"/**\n * Perform a right outer join of [this] and [other]. For each element (k, w) in [other], the\n * resulting RDD will either contain all pairs (k, (Some(v), w)) for v in [this], or the\n * pair (k, (None, w)) if no elements in [this] have key k. Hash-partitions the resulting\n * RDD using the existing partitioner/parallelism level.\n */"} {"signature":"fun < K , V , W > JavaRDD < Tuple2 < K , V > > . rightOuterJoin ( other : JavaRDD < Tuple2 < K , W > > , numPartitions : Int , ) : JavaRDD < Tuple2 < K , Tuple2 < Optional < V > , W > > >","body":"= toJavaPairRDD ( ) . rightOuterJoin ( other . toJavaPairRDD ( ) , numPartitions ) . toTupleRDD ( )","docstring":"/**\n * Perform a right outer join of [this] and [other]. For each element (k, w) in [other], the\n * resulting RDD will either contain all pairs (k, (Some(v), w)) for v in [this], or the\n * pair (k, (None, w)) if no elements in [this] have key k. Hash-partitions the resulting\n * RDD into the given number of partitions.\n */"} {"signature":"fun < K , V , W > JavaRDD < Tuple2 < K , V > > . fullOuterJoin ( other : JavaRDD < Tuple2 < K , W > > , ) : JavaRDD < Tuple2 < K , Tuple2 < Optional < V > , Optional < W > > > >","body":"= toJavaPairRDD ( ) . fullOuterJoin ( other . toJavaPairRDD ( ) ) . toTupleRDD ( )","docstring":"/**\n * Perform a full outer join of [this] and [other]. For each element (k, v) in [this], the\n * resulting RDD will either contain all pairs (k, (Some(v), Some(w))) for w in [other], or\n * the pair (k, (Some(v), None)) if no elements in [other] have key k. Similarly, for each\n * element (k, w) in [other], the resulting RDD will either contain all pairs\n * (k, (Some(v), Some(w))) for v in [this], or the pair (k, (None, Some(w))) if no elements\n * in [this] have key k. Hash-partitions the resulting RDD using the existing partitioner/\n * parallelism level.\n */"} {"signature":"fun < K , V , W > JavaRDD < Tuple2 < K , V > > . fullOuterJoin ( other : JavaRDD < Tuple2 < K , W > > , numPartitions : Int , ) : JavaRDD < Tuple2 < K , Tuple2 < Optional < V > , Optional < W > > > >","body":"= toJavaPairRDD ( ) . fullOuterJoin ( other . toJavaPairRDD ( ) , numPartitions ) . toTupleRDD ( )","docstring":"/**\n * Perform a full outer join of [this] and [other]. For each element (k, v) in [this], the\n * resulting RDD will either contain all pairs (k, (Some(v), Some(w))) for w in [other], or\n * the pair (k, (Some(v), None)) if no elements in [other] have key k. Similarly, for each\n * element (k, w) in [other], the resulting RDD will either contain all pairs\n * (k, (Some(v), Some(w))) for v in [this], or the pair (k, (None, Some(w))) if no elements\n * in [this] have key k. Hash-partitions the resulting RDD into the given number of partitions.\n */"} {"signature":"fun < K , V > JavaRDD < Tuple2 < K , V > > . collectAsMap ( ) : Map < K , V >","body":"= toJavaPairRDD ( ) . collectAsMap ( )","docstring":"/**\n * Return the key-value pairs in this RDD to the master as a Map.\n *\n * Warning: this doesn't return a multimap (so if you have multiple values to the same key, only\n * one value per key is preserved in the map returned)\n *\n * Note: this method should only be used if the resulting data is expected to be small, as\n * all the data is loaded into the driver's memory.\n */"} {"signature":"fun < K , V , U > JavaRDD < Tuple2 < K , V > > . mapKeys ( f : ( K ) -> U ) : JavaRDD < Tuple2 < U , V > >","body":"= mapPartitions ( { it . map { ( _1 , _2 ) -> tupleOf ( f ( _1 ) , _2 ) } } , true )","docstring":"/**\n * Pass each key in the key-value pair RDD through a map function without changing the values;\n * this also retains the original RDD's partitioning.\n */"} {"signature":"fun < K , V , U > JavaRDD < Tuple2 < K , V > > . mapValues ( f : ( V ) -> U ) : JavaRDD < Tuple2 < K , U > >","body":"= toJavaPairRDD ( ) . mapValues ( f ) . toTupleRDD ( )","docstring":"/**\n * Pass each value in the key-value pair RDD through a map function without changing the keys;\n * this also retains the original RDD's partitioning.\n */"} {"signature":"fun < K , V , U > JavaRDD < Tuple2 < K , V > > . flatMapValues ( f : ( V ) -> Iterator < U > ) : JavaRDD < Tuple2 < K , U > >","body":"= toJavaPairRDD ( ) . flatMapValues ( f ) . toTupleRDD ( )","docstring":"/**\n * Pass each value in the key-value pair RDD through a flatMap function without changing the\n * keys; this also retains the original RDD's partitioning.\n */"} {"signature":"fun < K , V , W1 , W2 , W3 > JavaRDD < Tuple2 < K , V > > . cogroup ( other1 : JavaRDD < Tuple2 < K , W1 > > , other2 : JavaRDD < Tuple2 < K , W2 > > , other3 : JavaRDD < Tuple2 < K , W3 > > , partitioner : Partitioner , ) : JavaRDD < Tuple2 < K , Tuple4 < Iterable < V > , Iterable < W1 > , Iterable < W2 > , Iterable < W3 > > > >","body":"= toJavaPairRDD ( ) . cogroup ( other1 . toJavaPairRDD ( ) , other2 . toJavaPairRDD ( ) , other3 . toJavaPairRDD ( ) , partitioner ) . toTupleRDD ( )","docstring":"/**\n * For each key k in [this] or [other1] or [other2] or [other3],\n * return a resulting RDD that contains a tuple with the list of values\n * for that key in [this], [other1], [other2] and [other3].\n */"} {"signature":"fun < K , V , W > JavaRDD < Tuple2 < K , V > > . cogroup ( other : JavaRDD < Tuple2 < K , W > > , partitioner : Partitioner , ) : JavaRDD < Tuple2 < K , Tuple2 < Iterable < V > , Iterable < W > > > >","body":"= toJavaPairRDD ( ) . cogroup ( other . toJavaPairRDD ( ) , partitioner ) . toTupleRDD ( )","docstring":"/**\n * For each key k in [this] or [other], return a resulting RDD that contains a tuple with the\n * list of values for that key in [this] as well as [other].\n */"} {"signature":"fun < K , V , W1 , W2 > JavaRDD < Tuple2 < K , V > > . cogroup ( other1 : JavaRDD < Tuple2 < K , W1 > > , other2 : JavaRDD < Tuple2 < K , W2 > > , partitioner : Partitioner , ) : JavaRDD < Tuple2 < K , Tuple3 < Iterable < V > , Iterable < W1 > , Iterable < W2 > > > >","body":"= toJavaPairRDD ( ) . cogroup ( other1 . toJavaPairRDD ( ) , other2 . toJavaPairRDD ( ) , partitioner ) . toTupleRDD ( )","docstring":"/**\n * For each key k in [this] or [other1] or [other2], return a resulting RDD that contains a\n * tuple with the list of values for that key in [this], [other1] and [other2].\n */"} {"signature":"fun < K , V , W1 , W2 , W3 > JavaRDD < Tuple2 < K , V > > . cogroup ( other1 : JavaRDD < Tuple2 < K , W1 > > , other2 : JavaRDD < Tuple2 < K , W2 > > , other3 : JavaRDD < Tuple2 < K , W3 > > , ) : JavaRDD < Tuple2 < K , Tuple4 < Iterable < V > , Iterable < W1 > , Iterable < W2 > , Iterable < W3 > > > >","body":"= toJavaPairRDD ( ) . cogroup ( other1 . toJavaPairRDD ( ) , other2 . toJavaPairRDD ( ) , other3 . toJavaPairRDD ( ) ) . toTupleRDD ( )","docstring":"/**\n * For each key k in [this] or [other1] or [other2] or [other3],\n * return a resulting RDD that contains a tuple with the list of values\n * for that key in [this], [other1], [other2] and [other3].\n */"} {"signature":"fun < K , V , W > JavaRDD < Tuple2 < K , V > > . cogroup ( other : JavaRDD < Tuple2 < K , W > > , ) : JavaRDD < Tuple2 < K , Tuple2 < Iterable < V > , Iterable < W > > > >","body":"= toJavaPairRDD ( ) . cogroup ( other . toJavaPairRDD ( ) ) . toTupleRDD ( )","docstring":"/**\n * For each key k in [this] or [other], return a resulting RDD that contains a tuple with the\n * list of values for that key in [this] as well as [other].\n */"} {"signature":"fun < K , V , W1 , W2 > JavaRDD < Tuple2 < K , V > > . cogroup ( other1 : JavaRDD < Tuple2 < K , W1 > > , other2 : JavaRDD < Tuple2 < K , W2 > > , ) : JavaRDD < Tuple2 < K , Tuple3 < Iterable < V > , Iterable < W1 > , Iterable < W2 > > > >","body":"= toJavaPairRDD ( ) . cogroup ( other1 . toJavaPairRDD ( ) , other2 . toJavaPairRDD ( ) ) . toTupleRDD ( )","docstring":"/**\n * For each key k in [this] or [other1] or [other2], return a resulting RDD that contains a\n * tuple with the list of values for that key in [this], [other1] and [other2].\n */"} {"signature":"fun < K , V , W > JavaRDD < Tuple2 < K , V > > . cogroup ( other : JavaRDD < Tuple2 < K , W > > , numPartitions : Int , ) : JavaRDD < Tuple2 < K , Tuple2 < Iterable < V > , Iterable < W > > > >","body":"= toJavaPairRDD ( ) . cogroup ( other . toJavaPairRDD ( ) , numPartitions ) . toTupleRDD ( )","docstring":"/**\n * For each key k in [this] or [other], return a resulting RDD that contains a tuple with the\n * list of values for that key in [this] as well as [other].\n */"} {"signature":"fun < K , V , W1 , W2 > JavaRDD < Tuple2 < K , V > > . cogroup ( other1 : JavaRDD < Tuple2 < K , W1 > > , other2 : JavaRDD < Tuple2 < K , W2 > > , numPartitions : Int , ) : JavaRDD < Tuple2 < K , Tuple3 < Iterable < V > , Iterable < W1 > , Iterable < W2 > > > >","body":"= toJavaPairRDD ( ) . cogroup ( other1 . toJavaPairRDD ( ) , other2 . toJavaPairRDD ( ) , numPartitions ) . toTupleRDD ( )","docstring":"/**\n * For each key k in [this] or [other1] or [other2], return a resulting RDD that contains a\n * tuple with the list of values for that key in [this], [other1] and [other2].\n */"} {"signature":"fun < K , V , W1 , W2 , W3 > JavaRDD < Tuple2 < K , V > > . cogroup ( other1 : JavaRDD < Tuple2 < K , W1 > > , other2 : JavaRDD < Tuple2 < K , W2 > > , other3 : JavaRDD < Tuple2 < K , W3 > > , numPartitions : Int , ) : JavaRDD < Tuple2 < K , Tuple4 < Iterable < V > , Iterable < W1 > , Iterable < W2 > , Iterable < W3 > > > >","body":"= toJavaPairRDD ( ) . cogroup ( other1 . toJavaPairRDD ( ) , other2 . toJavaPairRDD ( ) , other3 . toJavaPairRDD ( ) , numPartitions ) . toTupleRDD ( )","docstring":"/**\n * For each key k in [this] or [other1] or [other2] or [other3],\n * return a resulting RDD that contains a tuple with the list of values\n * for that key in [this], [other1], [other2] and [other3].\n */"} {"signature":"fun < K , V , W > JavaRDD < Tuple2 < K , V > > . groupWith ( other : JavaRDD < Tuple2 < K , W > > , ) : JavaRDD < Tuple2 < K , Tuple2 < Iterable < V > , Iterable < W > > > >","body":"= toJavaPairRDD ( ) . groupWith ( other . toJavaPairRDD ( ) ) . toTupleRDD ( )","docstring":"/** Alias for [cogroup]. */"} {"signature":"fun < K , V , W1 , W2 > JavaRDD < Tuple2 < K , V > > . groupWith ( other1 : JavaRDD < Tuple2 < K , W1 > > , other2 : JavaRDD < Tuple2 < K , W2 > > , ) : JavaRDD < Tuple2 < K , Tuple3 < Iterable < V > , Iterable < W1 > , Iterable < W2 > > > >","body":"= toJavaPairRDD ( ) . groupWith ( other1 . toJavaPairRDD ( ) , other2 . toJavaPairRDD ( ) ) . toTupleRDD ( )","docstring":"/** Alias for [cogroup]. */"} {"signature":"fun < K , V , W1 , W2 , W3 > JavaRDD < Tuple2 < K , V > > . groupWith ( other1 : JavaRDD < Tuple2 < K , W1 > > , other2 : JavaRDD < Tuple2 < K , W2 > > , other3 : JavaRDD < Tuple2 < K , W3 > > , ) : JavaRDD < Tuple2 < K , Tuple4 < Iterable < V > , Iterable < W1 > , Iterable < W2 > , Iterable < W3 > > > >","body":"= toJavaPairRDD ( ) . groupWith ( other1 . toJavaPairRDD ( ) , other2 . toJavaPairRDD ( ) , other3 . toJavaPairRDD ( ) ) . toTupleRDD ( )","docstring":"/** Alias for [cogroup]. */"} {"signature":"fun < K , V , W > JavaRDD < Tuple2 < K , V > > . subtractByKey ( other : JavaRDD < Tuple2 < K , W > > ) : JavaRDD < Tuple2 < K , V > >","body":"= toJavaPairRDD ( ) . subtractByKey ( other . toJavaPairRDD ( ) ) . toTupleRDD ( )","docstring":"/**\n * Return an RDD with the pairs from [this] whose keys are not in [other].\n *\n * Uses [this] partitioner/partition size, because even if [other] is huge, the resulting\n * RDD will be less than or equal to us.\n */"} {"signature":"fun < K , V , W > JavaRDD < Tuple2 < K , V > > . subtractByKey ( other : JavaRDD < Tuple2 < K , W > > , numPartitions : Int , ) : JavaRDD < Tuple2 < K , V > >","body":"= toJavaPairRDD ( ) . subtractByKey ( other . toJavaPairRDD ( ) , numPartitions ) . toTupleRDD ( )","docstring":"/**\n * Return an RDD with the pairs from [this] whose keys are not in [other].\n */"} {"signature":"fun < K , V , W > JavaRDD < Tuple2 < K , V > > . subtractByKey ( other : JavaRDD < Tuple2 < K , W > > , p : Partitioner , ) : JavaRDD < Tuple2 < K , V > >","body":"= toJavaPairRDD ( ) . subtractByKey ( other . toJavaPairRDD ( ) , p ) . toTupleRDD ( )","docstring":"/**\n * Return an RDD with the pairs from [this] whose keys are not in [other].\n */"} {"signature":"fun < K , V > JavaRDD < Tuple2 < K , V > > . lookup ( key : K ) : List < V >","body":"= toJavaPairRDD ( ) . lookup ( key )","docstring":"/**\n * Return the list of values in the RDD for key [key]. This operation is done efficiently if the\n * RDD has a known partitioner by only searching the partition that the key maps to.\n */"} {"signature":"fun < K , V , F : OutputFormat < * , * > > JavaRDD < Tuple2 < K , V > > . saveAsHadoopFile ( path : String , keyClass : Class < * > , valueClass : Class < * > , outputFormatClass : Class < F > , conf : JobConf , ) : Unit","body":"= toJavaPairRDD ( ) . saveAsHadoopFile ( path , keyClass , valueClass , outputFormatClass , conf )","docstring":"/** Output the RDD to any Hadoop-supported file system. */"} {"signature":"fun < K , V , F : OutputFormat < * , * > > JavaRDD < Tuple2 < K , V > > . saveAsHadoopFile ( path : String , keyClass : Class < * > , valueClass : Class < * > , outputFormatClass : Class < F > , ) : Unit","body":"= toJavaPairRDD ( ) . saveAsHadoopFile ( path , keyClass , valueClass , outputFormatClass )","docstring":"/** Output the RDD to any Hadoop-supported file system. */"} {"signature":"fun < K , V , F : OutputFormat < * , * > > JavaRDD < Tuple2 < K , V > > . saveAsHadoopFile ( path : String , keyClass : Class < * > , valueClass : Class < * > , outputFormatClass : Class < F > , codec : Class < CompressionCodec > , ) : Unit","body":"= toJavaPairRDD ( ) . saveAsHadoopFile ( path , keyClass , valueClass , outputFormatClass , codec )","docstring":"/** Output the RDD to any Hadoop-supported file system, compressing with the supplied codec. */"} {"signature":"fun < K , V , F : NewOutputFormat < * , * > > JavaRDD < Tuple2 < K , V > > . saveAsNewAPIHadoopFile ( path : String , keyClass : Class < * > , valueClass : Class < * > , outputFormatClass : Class < F > , conf : Configuration , ) : Unit","body":"= toJavaPairRDD ( ) . saveAsNewAPIHadoopFile ( path , keyClass , valueClass , outputFormatClass , conf )","docstring":"/** Output the RDD to any Hadoop-supported file system. */"} {"signature":"fun < K , V > JavaRDD < Tuple2 < K , V > > . saveAsNewAPIHadoopDataset ( conf : Configuration ) : Unit","body":"= toJavaPairRDD ( ) . saveAsNewAPIHadoopDataset ( conf )","docstring":"/**\n * Output the RDD to any Hadoop-supported storage system, using\n * a Configuration object for that storage system.\n */"} {"signature":"fun < K , V , F : NewOutputFormat < * , * > > JavaRDD < Tuple2 < K , V > > . saveAsNewAPIHadoopFile ( path : String , keyClass : Class < * > , valueClass : Class < * > , outputFormatClass : Class < F > , ) : Unit","body":"= toJavaPairRDD ( ) . saveAsNewAPIHadoopFile ( path , keyClass , valueClass , outputFormatClass )","docstring":"/** Output the RDD to any Hadoop-supported file system. */"} {"signature":"fun < K , V > JavaRDD < Tuple2 < K , V > > . saveAsHadoopDataset ( conf : JobConf ) : Unit","body":"= toJavaPairRDD ( ) . saveAsHadoopDataset ( conf )","docstring":"/**\n * Output the RDD to any Hadoop-supported storage system, using a Hadoop JobConf object for\n * that storage system. The JobConf should set an OutputFormat and any output paths required\n * (e.g. a table name to write to) in the same way as it would be configured for a Hadoop\n * MapReduce job.\n */"} {"signature":"fun < K , V > JavaRDD < Tuple2 < K , V > > . repartitionAndSortWithinPartitions ( partitioner : Partitioner ) : JavaRDD < Tuple2 < K , V > >","body":"= toJavaPairRDD ( ) . repartitionAndSortWithinPartitions ( partitioner ) . toTupleRDD ( )","docstring":"/**\n * Repartition the RDD according to the given partitioner and, within each resulting partition,\n * sort records by their keys.\n *\n * This is more efficient than calling [JavaRDD.repartition] and then sorting within each partition\n * because it can push the sorting down into the shuffle machinery.\n */"} {"signature":"fun < K , V > JavaRDD < Tuple2 < K , V > > . repartitionAndSortWithinPartitions ( partitioner : Partitioner , comp : Comparator < K > , ) : JavaRDD < Tuple2 < K , V > >","body":"= toJavaPairRDD ( ) . repartitionAndSortWithinPartitions ( partitioner , comp ) . toTupleRDD ( )","docstring":"/**\n * Repartition the RDD according to the given partitioner and, within each resulting partition,\n * sort records by their keys.\n *\n * This is more efficient than calling [JavaRDD.repartition] and then sorting within each partition\n * because it can push the sorting down into the shuffle machinery.\n */"} {"signature":"fun < K , V > JavaRDD < Tuple2 < K , V > > . sortByKey ( ascending : Boolean = true ) : JavaRDD < Tuple2 < K , V > >","body":"= toJavaPairRDD ( ) . sortByKey ( ascending ) . toTupleRDD ( )","docstring":"/**\n * Sort the RDD by key, so that each partition contains a sorted range of the elements. Calling\n * [JavaRDD.collect] or `save` on the resulting RDD will return or output an ordered list of records\n * (in the `save` case, they will be written to multiple `part-X` files in the filesystem, in\n * order of the keys).\n */"} {"signature":"fun < K , V > JavaRDD < Tuple2 < K , V > > . sortByKey ( ascending : Boolean , numPartitions : Int ) : JavaRDD < Tuple2 < K , V > >","body":"= toJavaPairRDD ( ) . sortByKey ( ascending , numPartitions ) . toTupleRDD ( )","docstring":"/**\n * Sort the RDD by key, so that each partition contains a sorted range of the elements. Calling\n * [JavaRDD.collect] or `save` on the resulting RDD will return or output an ordered list of records\n * (in the `save` case, they will be written to multiple `part-X` files in the filesystem, in\n * order of the keys).\n */"} {"signature":"fun < K , V > JavaRDD < Tuple2 < K , V > > . sortByKey ( comp : Comparator < K > , ascending : Boolean = true ) : JavaRDD < Tuple2 < K , V > >","body":"= toJavaPairRDD ( ) . sortByKey ( comp , ascending ) . toTupleRDD ( )","docstring":"/**\n * Sort the RDD by key, so that each partition contains a sorted range of the elements. Calling\n * [JavaRDD.collect] or `save` on the resulting RDD will return or output an ordered list of records\n * (in the `save` case, they will be written to multiple `part-X` files in the filesystem, in\n * order of the keys).\n */"} {"signature":"fun < K , V > JavaRDD < Tuple2 < K , V > > . sortByKey ( comp : Comparator < K > , ascending : Boolean , numPartitions : Int , ) : JavaRDD < Tuple2 < K , V > >","body":"= toJavaPairRDD ( ) . sortByKey ( comp , ascending , numPartitions ) . toTupleRDD ( )","docstring":"/**\n * Sort the RDD by key, so that each partition contains a sorted range of the elements. Calling\n * [JavaRDD.collect] or `save` on the resulting RDD will return or output an ordered list of records\n * (in the `save` case, they will be written to multiple `part-X` files in the filesystem, in\n * order of the keys).\n */"} {"signature":"fun < K , V > JavaRDD < Tuple2 < K , V > > . filterByRange ( lower : K , upper : K ) : JavaRDD < Tuple2 < K , V > >","body":"= toJavaPairRDD ( ) . filterByRange ( lower , upper ) . toTupleRDD ( )","docstring":"/**\n * Return a RDD containing only the elements in the inclusive range [lower] to [upper].\n * If the RDD has been partitioned using a [RangePartitioner], then this operation can be\n * performed efficiently by only scanning the partitions that might contain matching elements.\n * Otherwise, a standard [filter] is applied to all partitions.\n *\n * @since 3.1.0\n */"} {"signature":"fun < K : Comparable < K > , V > JavaRDD < Tuple2 < K , V > > . filterByRange ( range : ClosedRange < K > ) : JavaRDD < Tuple2 < K , V > >","body":"= filterByRange ( range . start , range . endInclusive )","docstring":"/**\n * Return a RDD containing only the elements in the range [range].\n * If the RDD has been partitioned using a [RangePartitioner], then this operation can be\n * performed efficiently by only scanning the partitions that might contain matching elements.\n * Otherwise, a standard [filter] is applied to all partitions.\n *\n * @since 3.1.0\n */"} {"signature":"fun < K , V > JavaRDD < Tuple2 < K , V > > . filterByRange ( comp : Comparator < K > , lower : K , upper : K , ) : JavaRDD < Tuple2 < K , V > >","body":"= toJavaPairRDD ( ) . filterByRange ( comp , lower , upper ) . toTupleRDD ( )","docstring":"/**\n * Return a RDD containing only the elements in the inclusive range [lower] to [upper].\n * If the RDD has been partitioned using a [RangePartitioner], then this operation can be\n * performed efficiently by only scanning the partitions that might contain matching elements.\n * Otherwise, a standard [filter] is applied to all partitions.\n *\n * @since 3.1.0\n */"} {"signature":"fun < K : Comparable < K > , V > JavaRDD < Tuple2 < K , V > > . filterByRange ( comp : Comparator < K > , range : ClosedRange < K > , ) : JavaRDD < Tuple2 < K , V > >","body":"= toJavaPairRDD ( ) . filterByRange ( comp , range . start , range . endInclusive ) . toTupleRDD ( )","docstring":"/**\n * Return a RDD containing only the elements in the inclusive range [range].\n * If the RDD has been partitioned using a [RangePartitioner], then this operation can be\n * performed efficiently by only scanning the partitions that might contain matching elements.\n * Otherwise, a standard [filter] is applied to all partitions.\n *\n * @since 3.1.0\n */"} {"signature":"fun < K , V > JavaRDD < Tuple2 < K , V > > . keys ( ) : JavaRDD < K >","body":"= toJavaPairRDD ( ) . keys ( )","docstring":"/**\n * Return an RDD with the keys of each tuple.\n */"} {"signature":"fun < K , V > JavaRDD < Tuple2 < K , V > > . values ( ) : JavaRDD < V >","body":"= toJavaPairRDD ( ) . values ( )","docstring":"/**\n * Return an RDD with the values of each tuple.\n */"} {"signature":"fun < K , V > JavaRDD < Tuple2 < K , V > > . countApproxDistinctByKey ( relativeSD : Double , partitioner : Partitioner , ) : JavaRDD < Tuple2 < K , Long > >","body":"= toJavaPairRDD ( ) . countApproxDistinctByKey ( relativeSD , partitioner ) . toTupleRDD ( )","docstring":"/**\n * Return approximate number of distinct values for each key in this RDD.\n *\n * The algorithm used is based on streamlib's implementation of \"HyperLogLog in Practice:\n * Algorithmic Engineering of a State of The Art Cardinality Estimation Algorithm\", available\n * here.\n *\n * @param relativeSD Relative accuracy. Smaller values create counters that require more space.\n * It must be greater than 0.000017.\n * @param partitioner partitioner of the resulting RDD.\n */"} {"signature":"fun < K , V > JavaRDD < Tuple2 < K , V > > . countApproxDistinctByKey ( relativeSD : Double , numPartitions : Int , ) : JavaRDD < Tuple2 < K , Long > >","body":"= toJavaPairRDD ( ) . countApproxDistinctByKey ( relativeSD , numPartitions ) . toTupleRDD ( )","docstring":"/**\n * Return approximate number of distinct values for each key in this RDD.\n *\n * The algorithm used is based on streamlib's implementation of \"HyperLogLog in Practice:\n * Algorithmic Engineering of a State of The Art Cardinality Estimation Algorithm\", available\n * [here](https://doi.org/10.1145/2452376.2452456).\n *\n * @param relativeSD Relative accuracy. Smaller values create counters that require more space.\n * It must be greater than 0.000017.\n * @param numPartitions number of partitions of the resulting RDD.\n */"} {"signature":"fun < K , V > JavaRDD < Tuple2 < K , V > > . countApproxDistinctByKey ( relativeSD : Double ) : JavaRDD < Tuple2 < K , Long > >","body":"= toJavaPairRDD ( ) . countApproxDistinctByKey ( relativeSD ) . toTupleRDD ( )","docstring":"/**\n * Return approximate number of distinct values for each key in this RDD.\n *\n * The algorithm used is based on streamlib's implementation of \"HyperLogLog in Practice:\n * Algorithmic Engineering of a State of The Art Cardinality Estimation Algorithm\", available\n * [here](https://doi.org/10.1145/2452376.2452456).\n *\n * @param relativeSD Relative accuracy. Smaller values create counters that require more space.\n * It must be greater than 0.000017.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . internal . InlineOnly public inline operator fun < V > KProperty0 < V > . getValue ( thisRef : Any ? , property : KProperty < * > ) : V","body":"{ return get ( ) }","docstring":"/**\n * An extension operator that allows delegating a read-only property of type [V]\n * to a property reference to a property of type [V] or its subtype.\n *\n * @receiver A property reference to a read-only or mutable property of type [V] or its subtype.\n * The reference is without a receiver, i.e. it either references a top-level property or\n * has the receiver bound to it.\n *\n * Example:\n *\n * ```\n * class Login(val username: String)\n * val defaultLogin = Login(\"Admin\")\n * val defaultUsername by defaultLogin::username\n * // equivalent to\n * val defaultUserName get() = defaultLogin.username\n * ```\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . internal . InlineOnly public inline operator fun < V > KMutableProperty0 < V > . setValue ( thisRef : Any ? , property : KProperty < * > , value : V )","body":"{ set ( value ) }","docstring":"/**\n * An extension operator that allows delegating a mutable property of type [V]\n * to a property reference to a mutable property of the same type [V].\n *\n * @receiver A property reference to a mutable property of type [V].\n * The reference is without a receiver, i.e. it either references a top-level property or\n * has the receiver bound to it.\n *\n * Example:\n *\n * ```\n * class Login(val username: String, var incorrectAttemptCounter: Int = 0)\n * val defaultLogin = Login(\"Admin\")\n * var defaultLoginAttempts by defaultLogin::incorrectAttemptCounter\n * // equivalent to\n * var defaultLoginAttempts: Int\n * get() = defaultLogin.incorrectAttemptCounter\n * set(value) { defaultLogin.incorrectAttemptCounter = value }\n * ```\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . internal . InlineOnly public inline operator fun < T , V > KProperty1 < T , V > . getValue ( thisRef : T , property : KProperty < * > ) : V","body":"{ return get ( thisRef ) }","docstring":"/**\n * An extension operator that allows delegating a read-only member or extension property of type [V]\n * to a property reference to a member or extension property of type [V] or its subtype.\n *\n * @receiver A property reference to a read-only or mutable property of type [V] or its subtype.\n * The reference has an unbound receiver of type [T].\n *\n * Example:\n *\n * ```\n * class Login(val username: String)\n * val Login.user by Login::username\n * // equivalent to\n * val Login.user get() = this.username\n * ```\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . internal . InlineOnly public inline operator fun < T , V > KMutableProperty1 < T , V > . setValue ( thisRef : T , property : KProperty < * > , value : V )","body":"{ set ( thisRef , value ) }","docstring":"/**\n * An extension operator that allows delegating a mutable member or extension property of type [V]\n * to a property reference to a member or extension mutable property of the same type [V].\n *\n * @receiver A property reference to a read-only or mutable property of type [V] or its subtype.\n * The reference has an unbound receiver of type [T].\n *\n * Example:\n *\n * ```\n * class Login(val username: String, var incorrectAttemptCounter: Int)\n * var Login.attempts by Login::incorrectAttemptCounter\n * // equivalent to\n * var Login.attempts: Int\n * get() = this.incorrectAttemptCounter\n * set(value) { this.incorrectAttemptCounter = value }\n * ```\n */"} {"signature":"fun Project . configureCommonPublicationSettingsForGradle ( signingRequired : Boolean , sbom : Boolean = true , )","body":"{ plugins . withId ( \"\" ) { extensions . configure < PublishingExtension > { publications . withType < MavenPublication > ( ) . configureEach { configureKotlinPomAttributes ( project ) if ( sbom && project . name !in internalPlugins ) { if ( name == \"\" ) { val sbomTask = configureSbom ( target = \"\" ) artifact ( sbomTask ) { extension = \"\" builtBy ( sbomTask ) } } else if ( name == \"\" ) { val sbomTask = configureSbom ( ) artifact ( sbomTask ) { extension = \"\" builtBy ( sbomTask ) } } } } } } configureDefaultPublishing ( signingRequired ) }","docstring":"/**\n * Configures common pom configuration parameters\n */"} {"signature":"fun Configuration . excludeGradleCommonDependencies ( )","body":"{ dependencies . withType < ModuleDependency > ( ) . configureEach { exclude ( group = \"\" , module = \"\" ) exclude ( group = \"\" , module = \"\" ) exclude ( group = \"\" , module = \"\" ) exclude ( group = \"\" , module = \"\" ) exclude ( group = \"\" , module = \"\" ) exclude ( group = \"\" , module = \"\" ) } }","docstring":"/**\n * These dependencies will be provided by Gradle, and we should prevent version conflict\n */"} {"signature":"fun Project . excludeGradleCommonDependencies ( sourceSet : SourceSet )","body":"{ configurations [ sourceSet . implementationConfigurationName ] . excludeGradleCommonDependencies ( ) configurations [ sourceSet . apiConfigurationName ] . excludeGradleCommonDependencies ( ) configurations [ sourceSet . runtimeOnlyConfigurationName ] . excludeGradleCommonDependencies ( ) }","docstring":"/**\n * Exclude Gradle runtime from given SourceSet configurations.\n */"} {"signature":"fun Project . createGradleCommonSourceSet ( ) : SourceSet","body":"{ val commonSourceSet = sourceSets . create ( commonSourceSetName ) { excludeGradleCommonDependencies ( this ) val commonGradleApiConfiguration = configurations . create ( \"\" ) { isVisible = false isCanBeConsumed = false isCanBeResolved = true } configurations [ compileClasspathConfigurationName ] . extendsFrom ( commonGradleApiConfiguration ) dependencies { compileOnlyConfigurationName ( kotlinStdlib ( ) ) \"\" ( \"\" ) if ( this @ createGradleCommonSourceSet . name !in testPlugins ) { compileOnlyConfigurationName ( project ( \"\" ) ) { capabilities { requireCapability ( \"\" ) } } } } } plugins . withType < JavaLibraryPlugin > ( ) . configureEach { this@createGradleCommonSourceSet . extensions . configure < JavaPluginExtension > { registerFeature ( commonSourceSet . name ) { usingSourceSet ( commonSourceSet ) disablePublication ( ) } } } tasks . named < KotlinJvmCompile > ( \"\" ) { compilerOptions . moduleName . set ( \"\" ) } registerValidatePluginTasks ( commonSourceSet ) return commonSourceSet }","docstring":"/**\n * Common sources for all variants.\n * Should contain classes that are independent of Gradle API version or using minimal supported Gradle api.\n */"} {"signature":"private fun Project . fixWiredSourceSetSecondaryVariants ( wireSourceSet : SourceSet , commonSourceSet : SourceSet , )","body":"{ configurations . matching { it . name == wireSourceSet . apiElementsConfigurationName || it . name == wireSourceSet . runtimeElementsConfigurationName } . configureEach { outgoing { variants . maybeCreate ( \"\" ) . apply { attributes { attribute ( LibraryElements . LIBRARY_ELEMENTS_ATTRIBUTE , objects . named ( LibraryElements . CLASSES ) ) } ( commonSourceSet . output . classesDirs . files + wireSourceSet . output . classesDirs . files ) . toSet ( ) . forEach { if ( ! artifacts . files . contains ( it ) ) { artifact ( it ) { type = ArtifactTypeDefinition . JVM_CLASS_DIRECTORY } } } } } } configurations . matching { it . name == wireSourceSet . runtimeElementsConfigurationName } . configureEach { outgoing { val resourcesDirectories = listOfNotNull ( commonSourceSet . output . resourcesDir , wireSourceSet . output . resourcesDir ) if ( resourcesDirectories . isNotEmpty ( ) ) { variants . maybeCreate ( \"\" ) . apply { attributes { attribute ( LibraryElements . LIBRARY_ELEMENTS_ATTRIBUTE , objects . named ( LibraryElements . RESOURCES ) ) } resourcesDirectories . forEach { if ( ! artifacts . files . contains ( it ) ) { artifact ( it ) { type = ArtifactTypeDefinition . JVM_RESOURCES_DIRECTORY } } } } } } } }","docstring":"/**\n * Fixes wired SourceSet does not expose compiled common classes and common resources as secondary variant\n * which is used in the Kotlin Project compilation.\n */"} {"signature":"fun Project . wireGradleVariantToCommonGradleVariant ( wireSourceSet : SourceSet , commonSourceSet : SourceSet , )","body":"{ wireSourceSet . compileClasspath += commonSourceSet . output wireSourceSet . runtimeClasspath += commonSourceSet . output ( extensions . getByName ( \"\" ) as KotlinSingleJavaTargetExtension ) . target . compilations . run { getByName ( wireSourceSet . name ) . associateWith ( getByName ( commonSourceSet . name ) ) } configurations [ wireSourceSet . apiConfigurationName ] . extendsFrom ( configurations [ commonSourceSet . apiConfigurationName ] ) configurations [ wireSourceSet . implementationConfigurationName ] . extendsFrom ( configurations [ commonSourceSet . implementationConfigurationName ] ) configurations [ wireSourceSet . runtimeOnlyConfigurationName ] . extendsFrom ( configurations [ commonSourceSet . runtimeOnlyConfigurationName ] ) configurations [ wireSourceSet . compileOnlyConfigurationName ] . extendsFrom ( configurations [ commonSourceSet . compileOnlyConfigurationName ] ) fixWiredSourceSetSecondaryVariants ( wireSourceSet , commonSourceSet ) tasks . withType < Jar > ( ) . configureEach { if ( name == wireSourceSet . jarTaskName ) { from ( wireSourceSet . output , commonSourceSet . output ) setupPublicJar ( archiveBaseName . get ( ) ) addEmbeddedRuntime ( ) addEmbeddedRuntime ( wireSourceSet . embeddedConfigurationName ) } else if ( name == wireSourceSet . sourcesJarTaskName ) { from ( wireSourceSet . allSource , commonSourceSet . allSource ) } } }","docstring":"/**\n * Make [wireSourceSet] to extend [commonSourceSet].\n */"} {"signature":"fun Project . reconfigureMainSourcesSetForGradlePlugin ( commonSourceSet : SourceSet , )","body":"{ sourceSets . named ( SourceSet . MAIN_SOURCE_SET_NAME ) { plugins . withType < JavaGradlePluginPlugin > ( ) . configureEach { configurations [ apiConfigurationName ] . dependencies . remove ( dependencies . gradleApi ( ) ) } dependencies { \"\" ( kotlinStdlib ( ) ) \"\" ( \"\" ) if ( this @ reconfigureMainSourcesSetForGradlePlugin . name !in testPlugins ) { \"\" ( project ( \"\" ) ) } } excludeGradleCommonDependencies ( this ) wireGradleVariantToCommonGradleVariant ( this , commonSourceSet ) if ( configurations [ \"\" ] . attributes . contains ( TargetJvmEnvironment . TARGET_JVM_ENVIRONMENT_ATTRIBUTE ) ) { configurations [ \"\" ] . attributes . attribute ( TargetJvmEnvironment . TARGET_JVM_ENVIRONMENT_ATTRIBUTE , objects . named ( TargetJvmEnvironment :: class , \"\" ) ) } plugins . withType < JavaLibraryPlugin > ( ) . configureEach { this@reconfigureMainSourcesSetForGradlePlugin . extensions . configure < JavaPluginExtension > { withSourcesJar ( ) if ( kotlinBuildProperties . publishGradlePluginsJavadoc ) { withJavadocJar ( ) } } configurations . create ( sourceSets . getByName ( \"\" ) . embeddedConfigurationName ) { isCanBeConsumed = false isCanBeResolved = true attributes { attribute ( Usage . USAGE_ATTRIBUTE , objects . named ( Usage . JAVA_RUNTIME ) ) attribute ( LibraryElements . LIBRARY_ELEMENTS_ATTRIBUTE , objects . named ( LibraryElements . JAR ) ) } } } val javaComponent = project . components [ \"\" ] as AdhocComponentWithVariants listOf ( runtimeElementsConfigurationName , apiElementsConfigurationName ) . map { configurations [ it ] } . forEach { originalConfiguration -> configurations . create ( \"\" ) { isCanBeResolved = originalConfiguration . isCanBeResolved isCanBeConsumed = originalConfiguration . isCanBeConsumed isVisible = originalConfiguration . isVisible setExtendsFrom ( originalConfiguration . extendsFrom ) artifacts { originalConfiguration . artifacts . forEach { add ( name , it ) } } attributes { originalConfiguration . attributes . keySet ( ) . filter { it . name != KotlinPlatformType . attribute . name } . forEach { originalAttribute -> @ Suppress ( \"\" ) attribute ( originalAttribute as Attribute < Any > , originalConfiguration . attributes . getAttribute ( originalAttribute ) ! ! ) } plugins . withType < JavaPlugin > { tasks . named < JavaCompile > ( compileJavaTaskName ) . get ( ) . apply { attribute ( TargetJvmVersion . TARGET_JVM_VERSION_ATTRIBUTE , when ( targetCompatibility ) { \"\" -> else -> targetCompatibility . toInt ( ) } ) } } } val expectedAttributes = setOf ( Category . CATEGORY_ATTRIBUTE , Bundling . BUNDLING_ATTRIBUTE , Usage . USAGE_ATTRIBUTE , LibraryElements . LIBRARY_ELEMENTS_ATTRIBUTE , TargetJvmEnvironment . TARGET_JVM_ENVIRONMENT_ATTRIBUTE , TargetJvmVersion . TARGET_JVM_VERSION_ATTRIBUTE ) if ( attributes . keySet ( ) != expectedAttributes ) { error ( \"\" + \"\" + \"\" ) } javaComponent . addVariantsFromConfiguration ( this ) { mapToMavenScope ( when ( originalConfiguration . name ) { runtimeElementsConfigurationName -> \"\" apiElementsConfigurationName -> \"\" else -> error ( \"\" ) } ) } originalConfiguration . isCanBeConsumed = false originalConfiguration . isVisible = false javaComponent . withVariantsFromConfiguration ( originalConfiguration ) { skip ( ) } } } } sourceSets . named ( SourceSet . TEST_SOURCE_SET_NAME ) { compileClasspath += commonSourceSet . output runtimeClasspath += commonSourceSet . output } ( extensions . getByName ( \"\" ) as KotlinSingleJavaTargetExtension ) . target . compilations . run { getByName ( SourceSet . TEST_SOURCE_SET_NAME ) . associateWith ( getByName ( commonSourceSet . name ) ) } }","docstring":"/**\n * 'main' sources are used for minimal supported Gradle versions (6.7) up to Gradle 7.0.\n */"} {"signature":"fun Project . createGradlePluginVariant ( variant : GradlePluginVariant , commonSourceSet : SourceSet , isGradlePlugin : Boolean = true , ) : SourceSet","body":"{ val variantSourceSet = sourceSets . create ( variant . sourceSetName ) { excludeGradleCommonDependencies ( this ) wireGradleVariantToCommonGradleVariant ( this , commonSourceSet ) } plugins . withType < JavaLibraryPlugin > ( ) . configureEach { extensions . configure < JavaPluginExtension > { registerFeature ( variantSourceSet . name ) { usingSourceSet ( variantSourceSet ) if ( isGradlePlugin ) { capability ( project . group . toString ( ) , project . name , project . version . toString ( ) ) } if ( kotlinBuildProperties . publishGradlePluginsJavadoc ) { withJavadocJar ( ) } withSourcesJar ( ) } configurations . named ( variantSourceSet . apiElementsConfigurationName , commonVariantAttributes ( ) ) configurations . named ( variantSourceSet . runtimeElementsConfigurationName , commonVariantAttributes ( ) ) configurations . create ( variantSourceSet . embeddedConfigurationName ) { isCanBeConsumed = false isCanBeResolved = true attributes { attribute ( Usage . USAGE_ATTRIBUTE , objects . named ( Usage . JAVA_RUNTIME ) ) attribute ( LibraryElements . LIBRARY_ELEMENTS_ATTRIBUTE , objects . named ( LibraryElements . JAR ) ) } } } tasks . named < Jar > ( variantSourceSet . sourcesJarTaskName ) { addEmbeddedSources ( ) addEmbeddedSources ( variantSourceSet . embeddedConfigurationName ) } } plugins . withId ( \"\" ) { tasks . named < Copy > ( variantSourceSet . processResourcesTaskName ) { val copyPluginDescriptors = rootSpec . addChild ( ) copyPluginDescriptors . into ( \"\" ) copyPluginDescriptors . from ( tasks . named ( \"\" ) ) } } configurations . configureEach { if ( this @ configureEach . name . startsWith ( variantSourceSet . name ) && ( isCanBeResolved || isCanBeConsumed ) ) { attributes { attribute ( GradlePluginApiVersion . GRADLE_PLUGIN_API_VERSION_ATTRIBUTE , objects . named ( variant . minimalSupportedGradleVersion ) ) } } } tasks . named < KotlinJvmCompile > ( \"\" ) { compilerOptions . moduleName . set ( this @ createGradlePluginVariant . name ) } dependencies { variantSourceSet . compileOnlyConfigurationName ( kotlinStdlib ( ) ) variantSourceSet . compileOnlyConfigurationName ( \"\" ) if ( this @ createGradlePluginVariant . name !in testPlugins ) { variantSourceSet . apiConfigurationName ( project ( \"\" ) ) { capabilities { requireCapability ( \"\" ) } } } } registerValidatePluginTasks ( variantSourceSet ) return variantSourceSet }","docstring":"/**\n * Adding plugin variants: https://docs.gradle.org/current/userguide/implementing_gradle_plugins.html#plugin-with-variants\n */"} {"signature":"private fun Project . commonVariantAttributes ( ) : Action < Configuration >","body":"= Action < Configuration > { attributes { attribute ( TargetJvmEnvironment . TARGET_JVM_ENVIRONMENT_ATTRIBUTE , objects . named ( TargetJvmEnvironment . STANDARD_JVM ) ) } }","docstring":"/**\n * All additional configuration attributes in plugin variant should be the same as in the 'main' variant.\n * Otherwise, Gradle <7.0 will fail to select plugin variant.\n */"} {"signature":"fun report ( whenExpressionFilePath : String , enumClassFqName : String )","body":"fun report ( whenExpressionFilePath : String , enumClassFqName : String )","docstring":"/**\n * Report Java enum class, which FqName is [enumClassFqName].\n * This enum class is used in Kotlin file with [whenExpressionFilePath] path in when expression.\n * Format of [enumClassFqName] class is \"package.Outer$Inner\"\n */"} {"signature":"fun reference ( classifier : Classifier ) : String","body":"fun reference ( classifier : Classifier ) : String","docstring":"/**\n * @return the string to be used to reference the classifier in current scope.\n */"} {"signature":"fun declare ( classifier : Classifier ) : String","body":"fun declare ( classifier : Classifier ) : String","docstring":"/**\n * @return the string to be used as a name in the declaration of the classifier in current scope.\n */"} {"signature":"fun declareProperty ( receiver : String ? , name : String ) : String ?","body":"fun declareProperty ( receiver : String ? , name : String ) : String ?","docstring":"/**\n * @return the string to be used as a name in the declaration of the property in current scope,\n * or `null` if the property with given name can't be declared.\n */"} {"signature":"fun render ( scope : KotlinScope ) : String","body":"fun render ( scope : KotlinScope ) : String","docstring":"/**\n * @return the string to be used in the given scope to denote this.\n */"} {"signature":"@ Test fun testCrossModule_ComposableInterfaceFunctionWithInlineClasses ( )","body":"{ compile ( mapOf ( \"\" to mapOf ( \"\" to \"\"\"\"\"\" . trimIndent ( ) ) , \"\" to mapOf ( \"\" to \"\"\"\"\"\" . trimIndent ( ) ) ) ) }","docstring":"/**\n * Test for b/169071070\n */"} {"signature":"@ Test fun testOverriddenSymbolParentsInDefaultParameters ( )","body":"{ compile ( mapOf ( \"\" to mapOf ( \"\" to \"\"\"\"\"\" ) , \"\" to mapOf ( \"\" to \"\"\"\"\"\" ) ) ) }","docstring":"/**\n * Test for b/221280935\n */"} {"signature":"public operator fun < C > ColumnReference < C > . invoke ( ) : DataColumn < C >","body":"= get ( this )","docstring":"/**\n * @include [CommonColumnReferenceInvokeDocs]\n * @return The [DataColumn] this [Column Reference][ColumnReference] or [-Accessor][ColumnAccessor] points to.\n */"} {"signature":"public operator fun < T > ColumnReference < DataRow < T > > . invoke ( ) : ColumnGroup < T >","body":"= get ( this )","docstring":"/**\n * @include [CommonColumnReferenceInvokeDocs]\n * @return The [ColumnGroup] this [Column Reference][ColumnReference] or [-Accessor][ColumnAccessor] points to.\n */"} {"signature":"public operator fun < T > ColumnReference < DataFrame < T > > . invoke ( ) : FrameColumn < T >","body":"= get ( this )","docstring":"/**\n * @include [CommonColumnReferenceInvokeDocs]\n * @return The [FrameColumn] this [Column Reference][ColumnReference] or [-Accessor][ColumnAccessor] points to.\n */"} {"signature":"public operator fun < C > ColumnPath . invoke ( ) : DataColumn < C >","body":"= getColumn ( this ) . cast ( )","docstring":"/**\n * Retrieves the value of this [ColumnPath] from the [DataFrame].\n * This is a shorthand for [getColumn][ColumnsContainer.getColumn]`(myColumnPath)` and\n * is most often used in combination with `operator fun String.get(column: String)`, {@comment cannot point to the right function.}\n * for instance:\n * ```kotlin\n * \"myColumn\"[\"myNestedColumn\"]()\n * ```\n *\n * @throws [IllegalArgumentException] if the column is not found.\n * @return The [DataColumn] this [ColumnPath] points to.\n */"} {"signature":"public operator fun < T > KProperty < T > . invoke ( ) : DataColumn < T >","body":"= this@ColumnSelectionDsl [ this ]","docstring":"/**\n * @include [CommonKPropertyInvokeDocs]\n * @return The [DataColumn] this [KProperty Accessor][KProperty] points to.\n */"} {"signature":"public operator fun < T > KProperty < DataRow < T > > . invoke ( ) : ColumnGroup < T >","body":"= this@ColumnSelectionDsl [ this ]","docstring":"/**\n * @include [CommonKPropertyInvokeDocs]\n * @return The [ColumnGroup] this [KProperty Accessor][KProperty] points to.\n */"} {"signature":"public operator fun < T > KProperty < DataFrame < T > > . invoke ( ) : FrameColumn < T >","body":"= this@ColumnSelectionDsl [ this ]","docstring":"/**\n * @include [CommonKPropertyInvokeDocs]\n * @return The [FrameColumn] this [KProperty Accessor][KProperty] points to.\n */"} {"signature":"@ Suppress ( \"\" ) @ JvmName ( \"\" ) public operator fun < T , R > KProperty < DataRow < T > > . get ( column : KProperty < R > ) : DataColumn < R >","body":"= invoke ( ) [ column ]","docstring":"/**\n * @include [CommonKPropertyGetDocs]\n * @return The [DataColumn] these [KProperty Accessors][KProperty] point to.\n */"} {"signature":"@ Suppress ( \"\" ) @ JvmName ( \"\" ) public operator fun < T , R > KProperty < DataRow < T > > . get ( column : KProperty < DataRow < R > > ) : ColumnGroup < R >","body":"= invoke ( ) [ column ]","docstring":"/**\n * @include [CommonKPropertyGetDocs]\n * @return The [ColumnGroup] these [KProperty Accessors][KProperty] point to.\n */"} {"signature":"@ Suppress ( \"\" ) @ JvmName ( \"\" ) public operator fun < T , R > KProperty < DataRow < T > > . get ( column : KProperty < DataFrame < R > > ) : FrameColumn < R >","body":"= invoke ( ) [ column ]","docstring":"/**\n * @include [CommonKPropertyGetDocs]\n * @return The [FrameColumn] these [KProperty Accessors][KProperty] point to.\n */"} {"signature":"public operator fun < T , R > KProperty < T > . get ( column : KProperty < R > ) : DataColumn < R >","body":"= invoke ( ) . asColumnGroup ( ) [ column ]","docstring":"/**\n * @include [CommonKPropertyGetDocs]\n * @return The [DataColumn] these [KProperty Accessors][KProperty] point to.\n */"} {"signature":"public operator fun < T , R > KProperty < T > . get ( column : KProperty < DataRow < R > > ) : ColumnGroup < R >","body":"= invoke ( ) . asColumnGroup ( ) [ column ]","docstring":"/**\n * @include [CommonKPropertyGetDocs]\n * @return The [ColumnGroup] these [KProperty Accessors][KProperty] point to.\n */"} {"signature":"public operator fun < T , R > KProperty < T > . get ( column : KProperty < DataFrame < R > > ) : FrameColumn < R >","body":"= invoke ( ) . asColumnGroup ( ) [ column ]","docstring":"/**\n * @include [CommonKPropertyGetDocs]\n * @return The [FrameColumn] these [KProperty Accessors][KProperty] point to.\n */"} {"signature":"@ Suppress ( \"\" ) @ JvmName ( \"\" ) public operator fun < C > String . invoke ( ) : DataColumn < C >","body":"= getColumn ( this ) . cast ( )","docstring":"/**\n * Retrieves the value of the column with this name from the [DataFrame]. This can be\n * both typed and untyped.\n * This is a shorthand for [get][ColumnsContainer.get]`(\"myColumnName\")` and can be\n * written as `\"myColumnName\"()` instead.\n *\n * @throws [IllegalArgumentException] if there is no column with this name.\n * @return The [DataColumn] with this name.\n */"} {"signature":"@ Suppress ( \"\" ) @ JvmName ( \"\" ) public operator fun String . invoke ( ) : DataColumn < * >","body":"= getColumn ( this )","docstring":"/**\n * Retrieves the value of the column with this name from the [DataFrame]. This can be\n * both typed and untyped.\n * This is a shorthand for [get][ColumnsContainer.get]`(\"myColumnName\")` and can be\n * written as `\"myColumnName\"()` instead.\n *\n * @throws [IllegalArgumentException] if there is no column with this name.\n * @return The [DataColumn] with this name.\n */"} {"signature":"public operator fun String . get ( column : String ) : ColumnPath","body":"= pathOf ( this , column )","docstring":"/**\n * Creates a [ColumnPath] from the receiver and the given column name [column].\n * This is a shorthand for [pathOf]`(\"myColumnName\", \"myNestedColumnName\")` and is often used\n * in combination with [ColumnPath.invoke] to retrieve the value of a nested column.\n * For instance:\n * ```kotlin\n * \"myColumn\"[\"myNestedColumn\"]()\n *\n * \"myColumn\"[\"myNestedColumn\"][\"myDoublyNestedColumn\"]()\n * ```\n */"} {"signature":"public operator fun ColumnPath . get ( column : String ) : ColumnPath","body":"= this + column","docstring":"/**\n * As extension to `\"myColumn\"[\"myNestedColumn\"]`, this function enables\n * `\"myColumn\"[\"myNestedColumn\"][\"myDoublyNestedColumn\"]` as alternative to\n * [pathOf]`(\"myColumn\", \"myNestedColumn\", \"myDoublyNestedColumn\")`\n */"} {"signature":"internal fun List < Layer > . variables ( ) : List < KVariable >","body":"{ return filterIsInstance < ParametrizedLayer > ( ) . flatMap { it . variables } }","docstring":"/**\n * Returns all variables used in all layers.\n */"} {"signature":"internal fun List < Layer > . trainableVariables ( ) : List < KVariable >","body":"{ return filterIsInstance < TrainableLayer > ( ) . filter { it . isTrainable } . flatMap { it . variables } }","docstring":"/**\n * Returns a list of trainable variables used in the layers.\n */"} {"signature":"internal fun List < Layer > . frozenVariables ( ) : List < KVariable >","body":"{ return filterIsInstance < ParametrizedLayer > ( ) . filter { it !is TrainableLayer || ! it . isTrainable } . flatMap { it . variables } }","docstring":"/**\n * Returns a list of non-trainable, 'frozen' variables used in the layers.\n */"} {"signature":"public fun ParametrizedLayer . initialize ( session : Session )","body":"{ variables . map { it . initializerOperation } . init ( session ) }","docstring":"/**\n * Initializes this layers variables using provided initializer operands.\n */"} {"signature":"public fun List < Layer > . initializeVariables ( session : Session )","body":"{ filterIsInstance < ParametrizedLayer > ( ) . forEach { it . initialize ( session ) } }","docstring":"/**\n * Initializes variables for [ParametrizedLayer] instances using provided initializer operands.\n */"} {"signature":"abstract fun computeSealedSubclasses ( sealedClass : ClassDescriptor , allowSealedInheritorsInDifferentFilesOfSamePackage : Boolean ) : Collection < ClassDescriptor >","body":"abstract fun computeSealedSubclasses ( sealedClass : ClassDescriptor , allowSealedInheritorsInDifferentFilesOfSamePackage : Boolean ) : Collection < ClassDescriptor >","docstring":"/**\n * This method may be called by compiler only for classes/interfaces with sealed modality\n */"} {"signature":"@ HtmlTagMarker inline fun FlowContent . address ( classes : String ? = null , crossinline block : ADDRESS . ( ) -> Unit = { } ) : Unit","body":"= ADDRESS ( attributesMapOf ( \"\" , classes ) , consumer ) . visit ( block )","docstring":"/**\n * Information on author\n */"} {"signature":"@ HtmlTagMarker inline fun FlowContent . blockQuote ( classes : String ? = null , crossinline block : BLOCKQUOTE . ( ) -> Unit = { } ) : Unit","body":"= BLOCKQUOTE ( attributesMapOf ( \"\" , classes ) , consumer ) . visit ( block )","docstring":"/**\n * Long quotation\n */"} {"signature":"@ HtmlTagMarker inline fun FlowContent . dialog ( classes : String ? = null , crossinline block : DIALOG . ( ) -> Unit = { } ) : Unit","body":"= DIALOG ( attributesMapOf ( \"\" , classes ) , consumer ) . visit ( block )","docstring":"/**\n * Dialog box or window\n */"} {"signature":"@ HtmlTagMarker inline fun FlowContent . div ( classes : String ? = null , crossinline block : DIV . ( ) -> Unit = { } ) : Unit","body":"= DIV ( attributesMapOf ( \"\" , classes ) , consumer ) . visit ( block )","docstring":"/**\n * Generic language/style container\n */"} {"signature":"@ HtmlTagMarker inline fun FlowContent . dl ( classes : String ? = null , crossinline block : DL . ( ) -> Unit = { } ) : Unit","body":"= DL ( attributesMapOf ( \"\" , classes ) , consumer ) . visit ( block )","docstring":"/**\n * Definition list\n */"} {"signature":"@ HtmlTagMarker inline fun FlowContent . fieldSet ( classes : String ? = null , crossinline block : FIELDSET . ( ) -> Unit = { } ) : Unit","body":"= FIELDSET ( attributesMapOf ( \"\" , classes ) , consumer ) . visit ( block )","docstring":"/**\n * Form control group\n */"} {"signature":"@ HtmlTagMarker inline fun FlowContent . figure ( classes : String ? = null , crossinline block : FIGURE . ( ) -> Unit = { } ) : Unit","body":"= FIGURE ( attributesMapOf ( \"\" , classes ) , consumer ) . visit ( block )","docstring":"/**\n * Figure with optional caption\n */"} {"signature":"@ HtmlTagMarker inline fun FlowContent . figcaption ( classes : String ? = null , crossinline block : FIGCAPTION . ( ) -> Unit = { } ) : Unit","body":"= FIGCAPTION ( attributesMapOf ( \"\" , classes ) , consumer ) . visit ( block )","docstring":"/**\n * Caption for \n */"} {"signature":"@ HtmlTagMarker inline fun FlowContent . footer ( classes : String ? = null , crossinline block : FOOTER . ( ) -> Unit = { } ) : Unit","body":"= FOOTER ( attributesMapOf ( \"\" , classes ) , consumer ) . visit ( block )","docstring":"/**\n * Footer for a page or section\n */"} {"signature":"@ HtmlTagMarker inline fun FlowContent . form ( action : String ? = null , encType : FormEncType ? = null , method : FormMethod ? = null , classes : String ? = null , crossinline block : FORM . ( ) -> Unit = { } ) : Unit","body":"= FORM ( attributesMapOf ( \"\" , action , \"\" , encType ? . enumEncode ( ) , \"\" , method ? . enumEncode ( ) , \"\" , classes ) , consumer ) . visit ( block )","docstring":"/**\n * Interactive form\n */"} {"signature":"@ HtmlTagMarker inline fun FlowContent . header ( classes : String ? = null , crossinline block : HEADER . ( ) -> Unit = { } ) : Unit","body":"= HEADER ( attributesMapOf ( \"\" , classes ) , consumer ) . visit ( block )","docstring":"/**\n * Introductory or navigational aids for a page or section\n */"} {"signature":"@ HtmlTagMarker inline fun FlowContent . hr ( classes : String ? = null , crossinline block : HR . ( ) -> Unit = { } ) : Unit","body":"= HR ( attributesMapOf ( \"\" , classes ) , consumer ) . visit ( block )","docstring":"/**\n * Horizontal rule\n */"} {"signature":"@ HtmlTagMarker inline fun FlowContent . ol ( classes : String ? = null , crossinline block : OL . ( ) -> Unit = { } ) : Unit","body":"= OL ( attributesMapOf ( \"\" , classes ) , consumer ) . visit ( block )","docstring":"/**\n * Ordered list\n */"} {"signature":"@ HtmlTagMarker inline fun FlowContent . p ( classes : String ? = null , crossinline block : P . ( ) -> Unit = { } ) : Unit","body":"= P ( attributesMapOf ( \"\" , classes ) , consumer ) . visit ( block )","docstring":"/**\n * Paragraph\n */"} {"signature":"@ HtmlTagMarker inline fun FlowContent . pre ( classes : String ? = null , crossinline block : PRE . ( ) -> Unit = { } ) : Unit","body":"= PRE ( attributesMapOf ( \"\" , classes ) , consumer ) . visit ( block )","docstring":"/**\n * Preformatted text\n */"} {"signature":"@ HtmlTagMarker inline fun FlowContent . summary ( classes : String ? = null , crossinline block : SUMMARY . ( ) -> Unit = { } ) : Unit","body":"= SUMMARY ( attributesMapOf ( \"\" , classes ) , consumer ) . visit ( block )","docstring":"/**\n * Caption for \n */"} {"signature":"@ HtmlTagMarker inline fun FlowContent . table ( classes : String ? = null , crossinline block : TABLE . ( ) -> Unit = { } ) : Unit","body":"= TABLE ( attributesMapOf ( \"\" , classes ) , consumer ) . visit ( block )","docstring":"/**\n * \n */"} {"signature":"@ HtmlTagMarker inline fun FlowContent . u ( classes : String ? = null , crossinline block : U . ( ) -> Unit = { } ) : Unit","body":"= U ( attributesMapOf ( \"\" , classes ) , consumer ) . visit ( block )","docstring":"/**\n * Underlined text style\n */"} {"signature":"@ HtmlTagMarker inline fun FlowContent . ul ( classes : String ? = null , crossinline block : UL . ( ) -> Unit = { } ) : Unit","body":"= UL ( attributesMapOf ( \"\" , classes ) , consumer ) . visit ( block )","docstring":"/**\n * Unordered list\n */"} {"signature":"@ HtmlTagMarker inline fun FlowContent . s ( classes : String ? = null , crossinline block : S . ( ) -> Unit = { } ) : Unit","body":"= S ( attributesMapOf ( \"\" , classes ) , consumer ) . visit ( block )","docstring":"/**\n * Strike-through text style\n */"} {"signature":"@ HtmlTagMarker inline fun MetaDataContent . base ( classes : String ? = null , crossinline block : BASE . ( ) -> Unit = { } ) : Unit","body":"= BASE ( attributesMapOf ( \"\" , classes ) , consumer ) . visit ( block )","docstring":"/**\n * Document base URI\n */"} {"signature":"@ HtmlTagMarker inline fun MetaDataContent . title ( crossinline block : TITLE . ( ) -> Unit = { } ) : Unit","body":"= TITLE ( emptyMap , consumer ) . visit ( block )","docstring":"/**\n * Document title\n */"} {"signature":"@ HtmlTagMarker fun MetaDataContent . title ( content : String = \"\" ) : Unit","body":"= TITLE ( emptyMap , consumer ) . visit ( { + content } )","docstring":"/**\n * Document title\n */"} {"signature":"@ HtmlTagMarker inline fun PhrasingContent . template ( classes : String ? = null , crossinline block : TEMPLATE . ( ) -> Unit = { } ) : Unit","body":"= TEMPLATE ( attributesMapOf ( \"\" , classes ) , consumer ) . visit ( block )","docstring":"/**\n * Template\n */"} {"signature":"private fun String . looksLikeRemovedTarget ( ) : Boolean","body":"= this in removedTargetsNames || this . startsWith ( \"\" )","docstring":"/**\n * [this] is a value passed to `-target` CLI-argument (see [KonanConfigKeys.TARGET])\n * Returns 'true' if this argument is most likely a removed [KonanTarget], allowing for a\n * more readable and graceful error message.\n */"} {"signature":"public fun < T : Number , D : Dimension > median ( a : MultiArray < T , D > ) : Double ?","body":"public fun < T : Number , D : Dimension > median ( a : MultiArray < T , D > ) : Double ?","docstring":"/**\n * Returns the median of the [a] elements.\n */"} {"signature":"public fun < T : Number , D : Dimension > average ( a : MultiArray < T , D > , weights : MultiArray < T , D > ? = null ) : Double","body":"public fun < T : Number , D : Dimension > average ( a : MultiArray < T , D > , weights : MultiArray < T , D > ? = null ) : Double","docstring":"/**\n * Returns the weighted average over the [a] elements and [weights] elements.\n */"} {"signature":"public fun < T : Number , D : Dimension > mean ( a : MultiArray < T , D > ) : Double","body":"public fun < T : Number , D : Dimension > mean ( a : MultiArray < T , D > ) : Double","docstring":"/**\n * Returns the arithmetic mean of the [a] elements.\n */"} {"signature":"public fun < T : Number , D : Dimension , O : Dimension > mean ( a : MultiArray < T , D > , axis : Int ) : NDArray < Double , O >","body":"public fun < T : Number , D : Dimension , O : Dimension > mean ( a : MultiArray < T , D > , axis : Int ) : NDArray < Double , O >","docstring":"/**\n * Returns the arithmetic mean of the [a] elements along the given [axis].\n */"} {"signature":"public fun < T : Number > meanD2 ( a : MultiArray < T , D2 > , axis : Int ) : NDArray < Double , D1 >","body":"public fun < T : Number > meanD2 ( a : MultiArray < T , D2 > , axis : Int ) : NDArray < Double , D1 >","docstring":"/**\n * Returns the arithmetic mean of the two-dimensional ndarray [a] elements along the given [axis].\n */"} {"signature":"public fun < T : Number > meanD3 ( a : MultiArray < T , D3 > , axis : Int ) : NDArray < Double , D2 >","body":"public fun < T : Number > meanD3 ( a : MultiArray < T , D3 > , axis : Int ) : NDArray < Double , D2 >","docstring":"/**\n * Returns the arithmetic mean of the three-dimensional ndarray [a] elements along the given [axis].\n */"} {"signature":"public fun < T : Number > meanD4 ( a : MultiArray < T , D4 > , axis : Int ) : NDArray < Double , D3 >","body":"public fun < T : Number > meanD4 ( a : MultiArray < T , D4 > , axis : Int ) : NDArray < Double , D3 >","docstring":"/**\n * Returns the arithmetic mean of the four-dimensional ndarray [a] elements along the given [axis].\n */"} {"signature":"public fun < T : Number > meanDN ( a : MultiArray < T , DN > , axis : Int ) : NDArray < Double , D4 >","body":"public fun < T : Number > meanDN ( a : MultiArray < T , DN > , axis : Int ) : NDArray < Double , D4 >","docstring":"/**\n * Returns the arithmetic mean of the n-dimensional ndarray [a] elements along the given [axis].\n */"} {"signature":"@ JvmName ( \"\" ) public fun < D : Dimension > abs ( a : MultiArray < Byte , D > ) : NDArray < Byte , D >","body":"{ val ret = initMemoryView < Byte > ( a . size , a . dtype ) var index = for ( element in a ) { ret [ index ++ ] = absByte ( element ) } return NDArray ( ret , , a . shape . copyOf ( ) , dim = a . dim ) }","docstring":"/**\n * Returns the absolute value of the given ndarray [a].\n */"} {"signature":"@ JvmName ( \"\" ) public fun < D : Dimension > abs ( a : MultiArray < Short , D > ) : NDArray < Short , D >","body":"{ val ret = initMemoryView < Short > ( a . size , a . dtype ) var index = for ( element in a ) { ret [ index ++ ] = absShort ( element ) } return NDArray ( ret , , a . shape . copyOf ( ) , dim = a . dim ) }","docstring":"/**\n * Returns the absolute value of the given ndarray [a].\n */"} {"signature":"@ JvmName ( \"\" ) public fun < D : Dimension > abs ( a : MultiArray < Int , D > ) : NDArray < Int , D >","body":"{ val ret = initMemoryView < Int > ( a . size , a . dtype ) var index = for ( element in a ) { ret [ index ++ ] = kotlin . math . abs ( element ) } return NDArray ( ret , , a . shape . copyOf ( ) , dim = a . dim ) }","docstring":"/**\n * Returns the absolute value of the given ndarray [a].\n */"} {"signature":"@ JvmName ( \"\" ) public fun < D : Dimension > abs ( a : MultiArray < Long , D > ) : NDArray < Long , D >","body":"{ val ret = initMemoryView < Long > ( a . size , a . dtype ) var index = for ( element in a ) { ret [ index ++ ] = kotlin . math . abs ( element ) } return NDArray ( ret , , a . shape . copyOf ( ) , dim = a . dim ) }","docstring":"/**\n * Returns the absolute value of the given ndarray [a].\n */"} {"signature":"@ JvmName ( \"\" ) public fun < D : Dimension > abs ( a : MultiArray < Float , D > ) : NDArray < Float , D >","body":"{ val ret = initMemoryView < Float > ( a . size ) var index = for ( element in a ) { ret [ index ++ ] = kotlin . math . abs ( element ) } return NDArray ( ret , , a . shape . copyOf ( ) , dim = a . dim ) }","docstring":"/**\n * Returns the absolute value of the given ndarray [a].\n */"} {"signature":"@ JvmName ( \"\" ) public fun < D : Dimension > abs ( a : MultiArray < Double , D > ) : NDArray < Double , D >","body":"{ val ret = initMemoryView < Double > ( a . size ) var index = for ( element in a ) { ret [ index ++ ] = kotlin . math . abs ( element ) } return NDArray ( ret , , a . shape . copyOf ( ) , dim = a . dim ) }","docstring":"/**\n * Returns the absolute value of the given ndarray [a].\n */"} {"signature":"@ JvmName ( \"\" ) public fun < D : Dimension > abs ( a : MultiArray < ComplexFloat , D > ) : NDArray < Float , D >","body":"{ val ret = initMemoryView < Float > ( a . size ) var index = for ( element in a ) { ret [ index ++ ] = element . abs ( ) } return NDArray ( ret , , a . shape . copyOf ( ) , dim = a . dim ) }","docstring":"/**\n * Returns the absolute value of the given ndarray [a].\n */"} {"signature":"@ JvmName ( \"\" ) public fun < D : Dimension > abs ( a : MultiArray < ComplexDouble , D > ) : NDArray < Double , D >","body":"{ val ret = initMemoryView < Double > ( a . size ) var index = for ( element in a ) { ret [ index ++ ] = element . abs ( ) } return NDArray ( ret , , a . shape . copyOf ( ) , dim = a . dim ) }","docstring":"/**\n * Returns the absolute value of the given ndarray [a].\n */"} {"signature":"@ Suppress ( \"\" ) private inline fun absByte ( a : Byte ) : Byte","body":"= if ( a < ) ( - a ) . toByte ( ) else a","docstring":"/**\n * Returns the absolute value of the given value [a].\n */"} {"signature":"@ Suppress ( \"\" ) private inline fun absShort ( a : Short ) : Short","body":"= if ( a < ) ( - a ) . toShort ( ) else a","docstring":"/**\n * Returns the absolute value of the given value [a].\n */"} {"signature":"@ Test fun loadSequentialJSONConfigWithUnsupportedJSONFormat ( )","body":"{ val jsonConfigFile = File ( realPathToConfigWithWrongJSON ) val exception = assertThrows ( IllegalArgumentException :: class . java ) { Sequential . loadModelConfiguration ( jsonConfigFile ) } assertEquals ( \"\" , exception . message ) }","docstring":"/**\n * This test covers the case, when Python Keras user saves JSON as a String.\n *\n * ```\n * json_config = model.to_json()\n * with open('keras-cifar-10/model.json', 'w') as f:\n * json.dump(json_config, f)\n * ```\n */"} {"signature":"@ Test fun loadModelConfigFromKerasAndTrain ( )","body":"{ val jsonConfigFile = File ( realPathToConfig ) val testModel = Sequential . loadModelConfiguration ( jsonConfigFile ) val ( train , test ) = fashionMnist ( ) testModel . use { it . compile ( optimizer = Adam ( ) , loss = Losses . SOFT_MAX_CROSS_ENTROPY_WITH_LOGITS , metric = Metrics . ACCURACY ) it . fit ( dataset = train , validationRate = VALIDATION_RATE , epochs = EPOCHS , trainBatchSize = TRAINING_BATCH_SIZE , validationBatchSize = VALIDATION_BATCH_SIZE ) val accuracy = it . evaluate ( dataset = test , batchSize = VALIDATION_BATCH_SIZE ) . metrics [ Metrics . ACCURACY ] if ( accuracy != null ) { assertTrue ( accuracy > ) } } }","docstring":"/** Weights are not loaded, but initialized via default initializers. */"} {"signature":"@ Test fun loadModelConfigFromKerasAndMissCompilation ( )","body":"{ val jsonConfigFile = File ( realPathToConfig ) val testModel = Sequential . loadModelConfiguration ( jsonConfigFile ) val ( train , _ ) = fashionMnist ( ) testModel . use { val exception = assertThrows ( IllegalStateException :: class . java ) { it . fit ( dataset = train , validationRate = VALIDATION_RATE , epochs = EPOCHS , trainBatchSize = TRAINING_BATCH_SIZE , validationBatchSize = VALIDATION_BATCH_SIZE ) } assertEquals ( \"\" , exception . message ) } }","docstring":"/** Compilation is missed. */"} {"signature":"@ Test fun loadModelConfigAndWeightsFromKerasAndTrain ( )","body":"{ val jsonConfigFile = File ( realPathToConfig ) val testModel = Sequential . loadModelConfiguration ( jsonConfigFile ) val file = File ( realPathToWeights ) val hdfFile = HdfFile ( file ) val ( train , test ) = fashionMnist ( ) testModel . use { it . compile ( optimizer = Adam ( ) , loss = Losses . SOFT_MAX_CROSS_ENTROPY_WITH_LOGITS , metric = Metrics . ACCURACY ) it . loadWeights ( hdfFile ) val accuracyBefore = it . evaluate ( dataset = test , batchSize = ) . metrics [ Metrics . ACCURACY ] if ( accuracyBefore != null ) { assertTrue ( accuracyBefore > ) } it . fit ( dataset = train , validationRate = , epochs = , trainBatchSize = , validationBatchSize = ) val accuracyAfterTraining = it . evaluate ( dataset = test , batchSize = ) . metrics [ Metrics . ACCURACY ] if ( accuracyAfterTraining != null && accuracyBefore != null ) { assertTrue ( accuracyAfterTraining > accuracyBefore ) } } }","docstring":"/** Simple transfer learning with additional training and without layers freezing. */"} {"signature":"@ Test fun loadModelConfigAndWeightsFromKerasAndTrainDenseLayersOnly ( )","body":"{ val jsonConfigFile = File ( realPathToConfig ) val testModel = Sequential . loadModelConfiguration ( jsonConfigFile ) val file = File ( realPathToWeights ) val hdfFile = HdfFile ( file ) val ( train , test ) = fashionMnist ( ) testModel . use { it . layers . filterIsInstance < Conv2D > ( ) . forEach ( Layer :: freeze ) it . compile ( optimizer = Adam ( ) , loss = Losses . SOFT_MAX_CROSS_ENTROPY_WITH_LOGITS , metric = Metrics . ACCURACY ) it . loadWeights ( hdfFile ) val accuracyBefore = it . evaluate ( dataset = test , batchSize = ) . metrics [ Metrics . ACCURACY ] if ( accuracyBefore != null ) { assertTrue ( accuracyBefore > ) } val conv2DKernelWeightsBeforeTraining = it . getLayer ( \"\" ) . weights [ \"\" ] as Array < Array < Array < FloatArray > > > assertEquals ( conv2DKernelWeightsBeforeTraining [ ] [ ] [ ] [ ] , ) val denseDKernelWeightsBeforeTraining = it . getLayer ( \"\" ) . weights [ \"\" ] as Array < FloatArray > assertEquals ( denseDKernelWeightsBeforeTraining [ ] [ ] , ) it . fit ( dataset = train , validationRate = , epochs = , trainBatchSize = , validationBatchSize = ) val conv2DKernelWeightsAfterTraining = it . getLayer ( \"\" ) . weights [ \"\" ] as Array < Array < Array < FloatArray > > > assertEquals ( conv2DKernelWeightsAfterTraining [ ] [ ] [ ] [ ] , ) assertArrayEquals ( conv2DKernelWeightsBeforeTraining , conv2DKernelWeightsAfterTraining ) val denseDKernelWeightsAfterTraining = it . getLayer ( \"\" ) . weights [ \"\" ] assertFalse ( denseDKernelWeightsBeforeTraining . contentEquals ( denseDKernelWeightsAfterTraining ) ) val accuracyAfterTraining = it . evaluate ( dataset = test , batchSize = ) . metrics [ Metrics . ACCURACY ] if ( accuracyAfterTraining != null && accuracyBefore != null ) { assertTrue ( accuracyAfterTraining > accuracyBefore ) } } }","docstring":"/** Simple transfer learning with additional training and Conv2D layers weights freezing. */"} {"signature":"@ Test fun loadModelConfigAndWeightsPartiallyFromKerasAndTrainDenseLayersOnly ( )","body":"{ val jsonConfigFile = File ( realPathToConfig ) val testModel = Sequential . loadModelConfiguration ( jsonConfigFile ) val file = File ( realPathToWeights ) val hdfFile = HdfFile ( file ) val ( train , test ) = fashionMnist ( ) testModel . use { val layerList = it . layers . filterIsInstance < Conv2D > ( ) layerList . forEach ( Layer :: freeze ) it . compile ( optimizer = Adam ( ) , loss = Losses . SOFT_MAX_CROSS_ENTROPY_WITH_LOGITS , metric = Metrics . ACCURACY ) it . loadWeights ( hdfFile , layerList ) val accuracyBefore = it . evaluate ( dataset = test , batchSize = ) . metrics [ Metrics . ACCURACY ] if ( accuracyBefore != null ) { assertTrue ( accuracyBefore > ) } val conv2DKernelWeighsBeforeTraining = it . getLayer ( \"\" ) . weights . values . toTypedArray ( ) [ ] as Array < Array < Array < FloatArray > > > assertEquals ( conv2DKernelWeighsBeforeTraining [ ] [ ] [ ] [ ] , ) val denseDKernelWeightsBeforeTraining = it . getLayer ( \"\" ) . weights . values . toTypedArray ( ) [ ] as Array < FloatArray > assertEquals ( denseDKernelWeightsBeforeTraining [ ] [ ] , ) it . fit ( dataset = train , validationRate = , epochs = , trainBatchSize = , validationBatchSize = ) val conv2DKernelWeightsAfterTraining = it . getLayer ( \"\" ) . weights . values . toTypedArray ( ) [ ] as Array < Array < Array < FloatArray > > > assertEquals ( conv2DKernelWeightsAfterTraining [ ] [ ] [ ] [ ] , ) assertArrayEquals ( conv2DKernelWeighsBeforeTraining , conv2DKernelWeightsAfterTraining ) val denseDKernelWeightsAfterTraining = it . getLayer ( \"\" ) . weights . values . toTypedArray ( ) [ ] as Array < FloatArray > assertFalse ( denseDKernelWeightsBeforeTraining . contentEquals ( denseDKernelWeightsAfterTraining ) ) val accuracyAfterTraining = it . evaluate ( dataset = test , batchSize = ) . metrics [ Metrics . ACCURACY ] if ( accuracyAfterTraining != null && accuracyBefore != null ) { assertTrue ( accuracyAfterTraining > accuracyBefore ) } } }","docstring":"/**\n * Simple transfer learning with additional training and Conv2D layers weights freezing.\n *\n * NOTE: Dense weights are initialized via default initializers and trained from zero to hero.\n */"} {"signature":"@ Test fun loadModelConfigAndWeightsPartiallyByLayersListFromKerasAndTrainDenseLayersOnly ( )","body":"{ val jsonConfigFile = File ( realPathToConfig ) val testModel = Sequential . loadModelConfiguration ( jsonConfigFile ) val file = File ( realPathToWeights ) val hdfFile = HdfFile ( file ) val ( train , test ) = fashionMnist ( ) testModel . use { it . layers . filterIsInstance < Conv2D > ( ) . forEach ( Layer :: freeze ) it . compile ( optimizer = Adam ( ) , loss = Losses . SOFT_MAX_CROSS_ENTROPY_WITH_LOGITS , metric = Metrics . ACCURACY ) it . loadWeightsForFrozenLayers ( hdfFile ) val accuracyBefore = it . evaluate ( dataset = test , batchSize = ) . metrics [ Metrics . ACCURACY ] if ( accuracyBefore != null ) { assertTrue ( accuracyBefore > ) } val conv2DKernelWeighsBeforeTraining = it . getLayer ( \"\" ) . weights . values . toTypedArray ( ) [ ] as Array < Array < Array < FloatArray > > > assertEquals ( conv2DKernelWeighsBeforeTraining [ ] [ ] [ ] [ ] , ) val denseDKernelWeightsBeforeTraining = it . getLayer ( \"\" ) . weights . values . toTypedArray ( ) [ ] as Array < FloatArray > assertEquals ( denseDKernelWeightsBeforeTraining [ ] [ ] , ) it . fit ( dataset = train , validationRate = , epochs = , trainBatchSize = , validationBatchSize = ) val conv2DKernelWeightsAfterTraining = it . getLayer ( \"\" ) . weights . values . toTypedArray ( ) [ ] as Array < Array < Array < FloatArray > > > assertEquals ( conv2DKernelWeightsAfterTraining [ ] [ ] [ ] [ ] , ) assertArrayEquals ( conv2DKernelWeighsBeforeTraining , conv2DKernelWeightsAfterTraining ) val denseDKernelWeightsAfterTraining = it . getLayer ( \"\" ) . weights . values . toTypedArray ( ) [ ] as Array < FloatArray > assertFalse ( denseDKernelWeightsBeforeTraining . contentEquals ( denseDKernelWeightsAfterTraining ) ) val accuracyAfterTraining = it . evaluate ( dataset = test , batchSize = ) . metrics [ Metrics . ACCURACY ] if ( accuracyAfterTraining != null && accuracyBefore != null ) { assertTrue ( accuracyAfterTraining > accuracyBefore ) } } }","docstring":"/**\n * Simple transfer learning with additional training and Conv2D layers weights freezing.\n *\n * NOTE: Dense weights are initialized via default initializers and trained from zero to hero.\n */"} {"signature":"public fun SinglePoseDetectionModelBase < Bitmap > . detectPose ( imageProxy : ImageProxy ) : DetectedPose","body":"= when ( this ) { is CameraXCompatibleModel -> { doWithRotation ( imageProxy . imageInfo . rotationDegrees ) { detectPose ( imageProxy . toBitmap ( ) ) } } else -> detectPose ( imageProxy . toBitmap ( applyRotation = true ) ) }","docstring":"/**\n * Detects a pose 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 */"} {"signature":"override fun iterator ( ) : Iterator < T >","body":"{ return MyIterator ( ) }","docstring":"/**\n * Collection iterator\n * Amortized next()/hasNext() complexity: O(1)\n */"} {"signature":"fun add ( value : T , priority : Int , )","body":"{ if ( latterFirst ) { ++ count } else { -- count } c . add ( Entry ( value , priority , count ) ) }","docstring":"/**\n * Adds [value] to the list with specified [priority]\n * Complexity: O(log n)\n */"} {"signature":"fun remove ( value : T )","body":"{ removeIf { it == value } }","docstring":"/**\n * Removes all values that are equal to [value]\n * Complexity: O(n + k * log(n)) where k is a number of elements to remove\n */"} {"signature":"fun elements ( ) : Collection < T >","body":"{ return c . map { it . value } }","docstring":"/**\n * All collection elements\n * Complexity: O(n)\n */"} {"signature":"fun addOrUpdatePriority ( value : T , priority : Int , )","body":"{ val maxPriority : Int ? = c . filter { it . value == value } . maxByOrNull { it . priority } ? . priority if ( maxPriority != null ) { if ( maxPriority >= priority ) { return } else { remove ( value ) } } add ( value , priority ) }","docstring":"/**\n * If a [value] wasn't previously added to the list, simply adds it with a given [priority].\n * Otherwise, in case if [priority] is less or equal to the priority of existent element(s), does nothing.\n * Otherwise, removes all existing elements from the list and adds [value] with a given [priority].\n * Complexity: O(n + k * log(n)) where k is a number of elements equal to [value]\n */"} {"signature":"fun elementsWithPriority ( ) : List < Pair < T , Int > >","body":"{ return c . sortedBy { it . order } . map { it . value to it . priority } }","docstring":"/**\n * All elements with their priorities ordered by the time of adding\n * (elements added earlier go first)\n * Complexity: O(n log(n))\n */"} {"signature":"public fun < T : Number , D : Dimension > argMax ( a : MultiArray < T , D > ) : Int","body":"public fun < T : Number , D : Dimension > argMax ( a : MultiArray < T , D > ) : Int","docstring":"/**\n * Returns flat index of maximum element in an ndarray.\n */"} {"signature":"public fun < T : Number , D : Dimension , O : Dimension > argMax ( a : MultiArray < T , D > , axis : Int ) : NDArray < Int , O >","body":"public fun < T : Number , D : Dimension , O : Dimension > argMax ( a : MultiArray < T , D > , axis : Int ) : NDArray < Int , O >","docstring":"/**\n * Returns an ndarray of indices of maximum elements in an ndarray [a] over a given [axis].\n */"} {"signature":"public fun < T : Number > argMaxD2 ( a : MultiArray < T , D2 > , axis : Int ) : NDArray < Int , D1 >","body":"public fun < T : Number > argMaxD2 ( a : MultiArray < T , D2 > , axis : Int ) : NDArray < Int , D1 >","docstring":"/**\n * Returns an ndarray of indices of maximum elements in a two-dimensional ndarray [a] over a given [axis].\n */"} {"signature":"public fun < T : Number > argMaxD3 ( a : MultiArray < T , D3 > , axis : Int ) : NDArray < Int , D2 >","body":"public fun < T : Number > argMaxD3 ( a : MultiArray < T , D3 > , axis : Int ) : NDArray < Int , D2 >","docstring":"/**\n * Returns an ndarray of indices of maximum elements in a three-dimensional ndarray [a] over a given [axis].\n */"} {"signature":"public fun < T : Number > argMaxD4 ( a : MultiArray < T , D4 > , axis : Int ) : NDArray < Int , D3 >","body":"public fun < T : Number > argMaxD4 ( a : MultiArray < T , D4 > , axis : Int ) : NDArray < Int , D3 >","docstring":"/**\n * Returns an ndarray of indices of maximum elements in a four-dimensional ndarray [a] over a given [axis].\n */"} {"signature":"public fun < T : Number > argMaxDN ( a : MultiArray < T , DN > , axis : Int ) : NDArray < Int , DN >","body":"public fun < T : Number > argMaxDN ( a : MultiArray < T , DN > , axis : Int ) : NDArray < Int , DN >","docstring":"/**\n * Returns an ndarray of indices of maximum elements in an n-dimensional ndarray [a] over a given [axis].\n */"} {"signature":"public fun < T : Number , D : Dimension > argMin ( a : MultiArray < T , D > ) : Int","body":"public fun < T : Number , D : Dimension > argMin ( a : MultiArray < T , D > ) : Int","docstring":"/**\n * Returns flat index of minimum element in an ndarray.\n */"} {"signature":"public fun < T : Number , D : Dimension , O : Dimension > argMin ( a : MultiArray < T , D > , axis : Int ) : NDArray < Int , O >","body":"public fun < T : Number , D : Dimension , O : Dimension > argMin ( a : MultiArray < T , D > , axis : Int ) : NDArray < Int , O >","docstring":"/**\n * Returns an ndarray of indices of minimum elements in an ndarray [a] over a given [axis].\n */"} {"signature":"public fun < T : Number > argMinD2 ( a : MultiArray < T , D2 > , axis : Int ) : NDArray < Int , D1 >","body":"public fun < T : Number > argMinD2 ( a : MultiArray < T , D2 > , axis : Int ) : NDArray < Int , D1 >","docstring":"/**\n * Returns an ndarray of indices of minimum elements in a two-dimensional ndarray [a] over a given [axis].\n */"} {"signature":"public fun < T : Number > argMinD3 ( a : MultiArray < T , D3 > , axis : Int ) : NDArray < Int , D2 >","body":"public fun < T : Number > argMinD3 ( a : MultiArray < T , D3 > , axis : Int ) : NDArray < Int , D2 >","docstring":"/**\n * Returns an ndarray of indices of minimum elements in a three-dimensional ndarray [a] over a given [axis].\n */"} {"signature":"public fun < T : Number > argMinD4 ( a : MultiArray < T , D4 > , axis : Int ) : NDArray < Int , D3 >","body":"public fun < T : Number > argMinD4 ( a : MultiArray < T , D4 > , axis : Int ) : NDArray < Int , D3 >","docstring":"/**\n * Returns an ndarray of indices of minimum elements in a four-dimensional ndarray [a] over a given [axis].\n */"} {"signature":"public fun < T : Number > argMinDN ( a : MultiArray < T , DN > , axis : Int ) : NDArray < Int , DN >","body":"public fun < T : Number > argMinDN ( a : MultiArray < T , DN > , axis : Int ) : NDArray < Int , DN >","docstring":"/**\n * Returns an ndarray of indices of minimum elements in an n-dimensional ndarray [a] over a given [axis].\n */"} {"signature":"public fun < T : Number , D : Dimension > max ( a : MultiArray < T , D > ) : T","body":"public fun < T : Number , D : Dimension > max ( a : MultiArray < T , D > ) : T","docstring":"/**\n * Returns maximum element of the given ndarray.\n */"} {"signature":"public fun < T : Number , D : Dimension , O : Dimension > max ( a : MultiArray < T , D > , axis : Int ) : NDArray < T , O >","body":"public fun < T : Number , D : Dimension , O : Dimension > max ( a : MultiArray < T , D > , axis : Int ) : NDArray < T , O >","docstring":"/**\n * Returns maximum of an ndarray [a] along a given [axis].\n */"} {"signature":"public fun < T : Number > maxD2 ( a : MultiArray < T , D2 > , axis : Int ) : NDArray < T , D1 >","body":"public fun < T : Number > maxD2 ( a : MultiArray < T , D2 > , axis : Int ) : NDArray < T , D1 >","docstring":"/**\n * Returns maximum of a two-dimensional ndarray [a] along a given [axis].\n */"} {"signature":"public fun < T : Number > maxD3 ( a : MultiArray < T , D3 > , axis : Int ) : NDArray < T , D2 >","body":"public fun < T : Number > maxD3 ( a : MultiArray < T , D3 > , axis : Int ) : NDArray < T , D2 >","docstring":"/**\n * Returns maximum of a three-dimensional ndarray [a] along a given [axis].\n */"} {"signature":"public fun < T : Number > maxD4 ( a : MultiArray < T , D4 > , axis : Int ) : NDArray < T , D3 >","body":"public fun < T : Number > maxD4 ( a : MultiArray < T , D4 > , axis : Int ) : NDArray < T , D3 >","docstring":"/**\n * Returns maximum of a four-dimensional ndarray [a] along a given [axis].\n */"} {"signature":"public fun < T : Number > maxDN ( a : MultiArray < T , DN > , axis : Int ) : NDArray < T , DN >","body":"public fun < T : Number > maxDN ( a : MultiArray < T , DN > , axis : Int ) : NDArray < T , DN >","docstring":"/**\n * Returns maximum of an n-dimensional ndarray [a] along a given [axis].\n */"} {"signature":"public fun < T : Number , D : Dimension > min ( a : MultiArray < T , D > ) : T","body":"public fun < T : Number , D : Dimension > min ( a : MultiArray < T , D > ) : T","docstring":"/**\n * Returns minimum element of the given ndarray.\n */"} {"signature":"public fun < T : Number , D : Dimension , O : Dimension > min ( a : MultiArray < T , D > , axis : Int ) : NDArray < T , O >","body":"public fun < T : Number , D : Dimension , O : Dimension > min ( a : MultiArray < T , D > , axis : Int ) : NDArray < T , O >","docstring":"/**\n * Returns minimum of an ndarray [a] along a given [axis].\n */"} {"signature":"public fun < T : Number > minD2 ( a : MultiArray < T , D2 > , axis : Int ) : NDArray < T , D1 >","body":"public fun < T : Number > minD2 ( a : MultiArray < T , D2 > , axis : Int ) : NDArray < T , D1 >","docstring":"/**\n * Returns minimum of a two-dimensional ndarray [a] along a given [axis].\n */"} {"signature":"public fun < T : Number > minD3 ( a : MultiArray < T , D3 > , axis : Int ) : NDArray < T , D2 >","body":"public fun < T : Number > minD3 ( a : MultiArray < T , D3 > , axis : Int ) : NDArray < T , D2 >","docstring":"/**\n * Returns minimum of a three-dimensional ndarray [a] along a given [axis].\n */"} {"signature":"public fun < T : Number > minD4 ( a : MultiArray < T , D4 > , axis : Int ) : NDArray < T , D3 >","body":"public fun < T : Number > minD4 ( a : MultiArray < T , D4 > , axis : Int ) : NDArray < T , D3 >","docstring":"/**\n * Returns minimum of a four-dimensional ndarray [a] along a given [axis].\n */"} {"signature":"public fun < T : Number > minDN ( a : MultiArray < T , DN > , axis : Int ) : NDArray < T , DN >","body":"public fun < T : Number > minDN ( a : MultiArray < T , DN > , axis : Int ) : NDArray < T , DN >","docstring":"/**\n * Returns minimum of an n-dimensional ndarray [a] along a given [axis].\n */"} {"signature":"public fun < T : Number , D : Dimension > sum ( a : MultiArray < T , D > ) : T","body":"public fun < T : Number , D : Dimension > sum ( a : MultiArray < T , D > ) : T","docstring":"/**\n * Returns sum of all elements in the given ndarray.\n */"} {"signature":"public fun < T : Number , D : Dimension , O : Dimension > sum ( a : MultiArray < T , D > , axis : Int ) : NDArray < T , O >","body":"public fun < T : Number , D : Dimension , O : Dimension > sum ( a : MultiArray < T , D > , axis : Int ) : NDArray < T , O >","docstring":"/**\n * Returns an ndarray of sum all elements over a given [axis].\n */"} {"signature":"public fun < T : Number > sumD2 ( a : MultiArray < T , D2 > , axis : Int ) : NDArray < T , D1 >","body":"public fun < T : Number > sumD2 ( a : MultiArray < T , D2 > , axis : Int ) : NDArray < T , D1 >","docstring":"/**\n * Returns an ndarray of sum all elements in a two-dimensional ndarray [a] over a given [axis].\n */"} {"signature":"public fun < T : Number > sumD3 ( a : MultiArray < T , D3 > , axis : Int ) : NDArray < T , D2 >","body":"public fun < T : Number > sumD3 ( a : MultiArray < T , D3 > , axis : Int ) : NDArray < T , D2 >","docstring":"/**\n * Returns an ndarray of sum all elements in a three-dimensional ndarray [a] over a given [axis].\n */"} {"signature":"public fun < T : Number > sumD4 ( a : MultiArray < T , D4 > , axis : Int ) : NDArray < T , D3 >","body":"public fun < T : Number > sumD4 ( a : MultiArray < T , D4 > , axis : Int ) : NDArray < T , D3 >","docstring":"/**\n * Returns an ndarray of sum all elements in a four-dimensional ndarray [a] over a given [axis].\n */"} {"signature":"public fun < T : Number > sumDN ( a : MultiArray < T , DN > , axis : Int ) : NDArray < T , DN >","body":"public fun < T : Number > sumDN ( a : MultiArray < T , DN > , axis : Int ) : NDArray < T , DN >","docstring":"/**\n * Returns an ndarray of sum all elements in a n-dimensional ndarray [a] over a given [axis].\n */"} {"signature":"public fun < T : Number , D : Dimension > cumSum ( a : MultiArray < T , D > ) : D1Array < T >","body":"public fun < T : Number , D : Dimension > cumSum ( a : MultiArray < T , D > ) : D1Array < T >","docstring":"/**\n * Returns cumulative sum of all elements in the given ndarray.\n */"} {"signature":"public fun < T : Number , D : Dimension > cumSum ( a : MultiArray < T , D > , axis : Int ) : NDArray < T , D >","body":"public fun < T : Number , D : Dimension > cumSum ( a : MultiArray < T , D > , axis : Int ) : NDArray < T , D >","docstring":"/**\n * Returns cumulative sum of all elements in the given ndarray along the given [axis].\n */"} {"signature":"private fun storeMetricsIntoFile ( buildId : String )","body":"{ try { statisticsFolder . mkdirs ( ) val file = File ( statisticsFolder , buildId + PROFILE_FILE_NAME_SUFFIX ) FileOutputStream ( file , true ) . bufferedWriter ( ) . use { metricsContainer . flush ( it ) } } catch ( _ : IOException ) { } }","docstring":"/**\n * Initializes a new build report file\n * The following contracts are implemented:\n * - each file contains metrics for one build\n * - any other process can add metrics to the file during build\n * - files with age (current time - last modified) more than maxFileAge should be deleted (if we trust lastModified returned by FS)\n */"} {"signature":"public fun start ( errorReporting : Boolean = true , name : String ? = null ) : Worker ","body":"= Worker ( startInternal ( errorReporting , name ) )","docstring":"/**\n * Start new scheduling primitive, such as thread, to accept new tasks via `execute` interface.\n * Typically new worker may be needed for computations offload to another core, for IO it may be\n * better to use non-blocking IO combined with more lightweight coroutines.\n *\n * @param errorReporting controls if an uncaught exceptions in the worker will be reported.\n * @param name defines the optional name of this worker, if none - default naming is used.\n * @return worker object, usable across multiple concurrent contexts.\n */"} {"signature":"@ Deprecated ( \"\" , level = DeprecationLevel . WARNING ) public fun fromCPointer ( pointer : COpaquePointer ? ) : Worker","body":"= if ( pointer != null ) Worker ( pointer . toLong ( ) . toInt ( ) ) else throw IllegalArgumentException ( )","docstring":"/**\n * Create worker object from a C pointer.\n *\n * This function is deprecated. See [Worker.asCPointer] for more details.\n *\n * @param pointer value returned earlier by [Worker.asCPointer]\n */"} {"signature":"public fun requestTermination ( processScheduledJobs : Boolean = true ) : Future < Unit >","body":"= Future < Unit > ( requestTerminationInternal ( id , processScheduledJobs ) )","docstring":"/**\n * Requests termination of the worker.\n *\n * Returns [Future] that **must** be joined with [Future.result] blocking call.\n * Failure to do so will leak native memory and underlying native thread handles.\n *\n * @param processScheduledJobs controls is we shall wait until all scheduled jobs processed,\n * or terminate immediately. If there are jobs to be execucted with [executeAfter] their execution\n * is awaited for.\n */"} {"signature":"@ Suppress ( \"\" ) @ TypedIntrinsic ( IntrinsicType . WORKER_EXECUTE ) public fun < T1 , T2 > execute ( mode : TransferMode , producer : ( ) -> T1 , @ VolatileLambda job : ( T1 ) -> T2 ) : Future < T2 >","body":"= throw RuntimeException ( \"\" )","docstring":"/**\n * Plan job for further execution in the worker. Execute is a two-phase operation:\n * 1. [producer] function is executed on the caller's thread.\n * 2. the result of [producer] and [job] function pointer is being added to jobs queue\n * of the selected worker. Note that [job] must not capture any state itself.\n *\n * Parameter [mode] has no effect.\n *\n * Behavior is more complex in case of legacy memory manager:\n *\n * - first [producer] function is executed, and resulting object and whatever it refers to\n * is analyzed for being an isolated object subgraph, if in checked mode.\n * - Afterwards, this disconnected object graph and [job] function pointer is being added to jobs queue\n * of the selected worker. Note that [job] must not capture any state itself, so that whole state is\n * explicitly stored in object produced by [producer]. Scheduled job is being executed by the worker,\n * and result of such a execution is being disconnected from worker's object graph. Whoever will consume\n * the future, can use result of worker's computations.\n * Note, that some technically disjoint subgraphs may lead to `kotlin.IllegalStateException`\n * so `kotlin.native.runtime.GC.collect()` could be called in the end of `producer` and `job`\n * if garbage cyclic structures or other uncollected objects refer to the value being transferred.\n *\n * @return the future with the computation result of [job].\n */"} {"signature":"@ OptIn ( ExperimentalNativeApi :: class ) public fun executeAfter ( afterMicroseconds : Long = , operation : ( ) -> Unit ) : Unit","body":"{ val current = currentInternal ( ) if ( Platform . memoryModel != MemoryModel . EXPERIMENTAL && current != id && ! operation . isFrozen ) throw IllegalStateException ( \"\" ) if ( afterMicroseconds < ) throw IllegalArgumentException ( \"\" ) executeAfterInternal ( id , operation , afterMicroseconds ) }","docstring":"/**\n * Plan job for further execution in the worker.\n *\n * If the worker was created with `errorReporting` set to true, any exception escaping from [operation] will\n * be handled by [processUnhandledException].\n *\n * @param afterMicroseconds defines after how many microseconds delay execution shall happen, 0 means immediately,\n * @throws [IllegalArgumentException] on negative values of [afterMicroseconds].\n * @throws [IllegalStateException] if [operation] parameter is not frozen and worker is not current.\n */"} {"signature":"public fun processQueue ( ) : Boolean","body":"= processQueueInternal ( id )","docstring":"/**\n * Process pending job(s) on the queue of this worker.\n * Note that jobs scheduled with [executeAfter] using non-zero timeout are\n * not processed this way. If termination request arrives while processing the queue via this API,\n * worker is marked as terminated and will exit once the current request is done with.\n *\n * @throws [IllegalStateException] if this request is executed on non-current [Worker].\n * @return `true` if request(s) was processed and `false` otherwise.\n */"} {"signature":"public fun park ( timeoutMicroseconds : Long , process : Boolean = false ) : Boolean","body":"{ if ( timeoutMicroseconds < - ) throw IllegalArgumentException ( ) return parkInternal ( id , timeoutMicroseconds , process ) }","docstring":"/**\n * Park execution of the current worker until a new request arrives or timeout specified in\n * [timeoutMicroseconds] elapsed. If [process] is true, pending queue elements are processed,\n * including delayed requests. Note that multiple requests could be processed this way.\n *\n * @param timeoutMicroseconds defines how long to park worker if no requests arrive, waits forever if -1.\n * @param process defines if arrived request(s) shall be processed.\n * @return if [process] is `true`: if request(s) was processed `true` and `false` otherwise.\n * if [process] is `false`:` true` if request(s) has arrived and `false` if timeout happens.\n * @throws [IllegalStateException] if this request is executed on non-current [Worker].\n * @throws [IllegalArgumentException] if timeout value is incorrect.\n */"} {"signature":"override public fun toString ( ) : String","body":"= \"\"","docstring":"/**\n * String representation of the worker.\n */"} {"signature":"@ Deprecated ( \"\" , level = DeprecationLevel . WARNING ) public fun asCPointer ( ) : COpaquePointer ?","body":"= id . toLong ( ) . toCPointer ( )","docstring":"/**\n * Convert worker to a COpaquePointer value that could be passed via native void* pointer.\n * Can be used as an argument of [Worker.fromCPointer].\n *\n * This function is deprecated. Use `kotlinx.cinterop.StableRef.create(worker).asCPointer()` instead.\n * The result can be unwrapped with `pointer.asStableRef().get()`.\n * [StableRef] should be eventually disposed manually with [StableRef.dispose].\n *\n * @return worker identifier as C pointer.\n */"} {"signature":"@ ObsoleteWorkersApi public inline fun < R > withWorker ( name : String ? = null , errorReporting : Boolean = true , block : Worker . ( ) -> R ) : R","body":"{ val worker = Worker . start ( errorReporting , name ) try { return worker . block ( ) } finally { worker . requestTermination ( ) . result } }","docstring":"/**\n * Executes [block] with new [Worker] as resource, by starting the new worker, calling provided [block]\n * (in current context) with newly started worker as [this] and terminating worker after the block completes.\n * Note that this operation is pretty heavyweight, use preconfigured worker or worker pool if need to\n * execute it frequently.\n *\n * @param name of the started worker.\n * @param errorReporting controls if uncaught errors in worker to be reported.\n * @param block to be executed.\n * @return value returned by the block.\n */"} {"signature":"@ Test fun indexOfByteStringAcrossSegmentBoundaries ( )","body":"{ sink . writeString ( \"\" . repeat ( Segment . SIZE * - ) ) sink . writeString ( \"\" ) sink . emit ( ) assertEquals ( ( Segment . SIZE * - ) . toLong ( ) , source . indexOf ( \"\" . encodeToByteString ( ) ) ) assertEquals ( ( Segment . SIZE * - ) . toLong ( ) , source . indexOf ( \"\" . encodeToByteString ( ) ) ) assertEquals ( ( Segment . SIZE * - ) . toLong ( ) , source . indexOf ( \"\" . encodeToByteString ( ) ) ) assertEquals ( ( Segment . SIZE * - ) . toLong ( ) , source . indexOf ( \"\" . encodeToByteString ( ) ) ) assertEquals ( ( Segment . SIZE * - ) . toLong ( ) , source . indexOf ( \"\" . encodeToByteString ( ) ) ) assertEquals ( ( Segment . SIZE * - ) . toLong ( ) , source . indexOf ( \"\" . encodeToByteString ( ) ) ) assertEquals ( ( Segment . SIZE * - ) . toLong ( ) , source . indexOf ( \"\" . encodeToByteString ( ) ) ) assertEquals ( ( Segment . SIZE * - ) . toLong ( ) , source . indexOf ( \"\" . encodeToByteString ( ) ) ) assertEquals ( ( Segment . SIZE * - ) . toLong ( ) , source . indexOf ( \"\" . encodeToByteString ( ) ) ) assertEquals ( ( Segment . SIZE * ) . toLong ( ) , source . indexOf ( \"\" . encodeToByteString ( ) ) ) assertEquals ( ( Segment . SIZE * + ) . toLong ( ) , source . indexOf ( \"\" . encodeToByteString ( ) ) ) assertEquals ( ( Segment . SIZE * + ) . toLong ( ) , source . indexOf ( \"\" . encodeToByteString ( ) ) ) }","docstring":"/**\n * With [BufferedSourceFactory.ONE_BYTE_AT_A_TIME_BUFFERED_SOURCE], this code was extremely slow.\n * https://github.com/square/okio/issues/171\n */"} {"signature":"private fun IrFunction . isTargetMethod ( ) : Boolean","body":"{ val fqName = fqNameWhenAvailable ? . asString ( ) ? : return false return fqName == \"\" || fqName == \"\" }","docstring":"/**\n * Method for intrinsification `kotlinx.serialization.serializer` is a top-level function.\n * For the rest of the world, it is located in the facade `kotlinx.serialization.SerializersKt`.\n * However, when we compile `kotlinx-serialization-core` itself, facade contains only synthetic bridges.\n * Real function is contained in IR class with `SerializersKt__SerializersKt` name.\n * (as we have `@file:JvmMultifileClass @file:JvmName(\"SerializersKt\")` on both common Serializers.kt and a platform-specific SerializersJvm.kt files)\n */"} {"signature":"override fun rewritePluginDefinedOperationMarker ( v : InstructionAdapter , reifiedInsn : AbstractInsnNode , instructions : InsnList , type : IrType ) : Boolean","body":"{ val operationTypeStr = ( reifiedInsn . next as LdcInsnNode ) . cst as String if ( ! operationTypeStr . startsWith ( magicMarkerStringPrefix ) ) return false val operationType = if ( operationTypeStr . endsWith ( \"\" ) ) { val aload = reifiedInsn . next . next . next as VarInsnNode val storedVar = aload . `var` instructions . remove ( aload . next ) instructions . remove ( aload ) IntrinsicType . WithModule ( storedVar ) } else IntrinsicType . Simple instructions . remove ( reifiedInsn . next . next . next ) instructions . remove ( reifiedInsn . next . next ) instructions . remove ( reifiedInsn . next ) instructions . remove ( reifiedInsn ) generateSerializerForType ( type , v , operationType ) return true }","docstring":"/**\n * Instructions at the moment of call:\n *\n * -3: iconst(6) // TYPE_OF\n * -2: aconst(typeParamName) // TYPE_OF\n * -1: invokestatic(reifiedOperationMarker)\n * < instructions from instructionAdapter will be inserted here by inliner >\n * 0 (stubConstNull): aconst(null)\n * 1: aconst(kotlinx.serialization.serializer.)\n * 2: invokestatic(voidMagicApiCall)\n * 3: aload(moduleVar) // if withModule\n * 4: swap // if withModule\n * 5: invokestatic(kotlinx.serialization.serializer(module?, kType)\n *\n * We need to remove instructions from 0 to 5\n * Instructions -1, -2 and -3 would be removed by inliner.\n */"} {"signature":"private fun InstructionAdapter . putReifyMarkerIfNeeded ( type : IrType , intrinsicType : IntrinsicType ) : Boolean","body":"= with ( typeSystemContext ) { val typeDescriptor = type . typeConstructor ( ) . getTypeParameterClassifier ( ) if ( typeDescriptor != null ) { ReifiedTypeInliner . putReifiedOperationMarkerIfNeeded ( typeDescriptor , type . isMarkedNullable ( ) , ReifiedTypeInliner . OperationKind . TYPE_OF , this @ putReifyMarkerIfNeeded , typeSystemContext ) aconst ( null ) aconst ( intrinsicType . magicMarkerString ( ) ) invokestatic ( pluginIntrinsicsMarkerOwner , pluginIntrinsicsMarkerMethod , pluginIntrinsicsMarkerSignature , false ) if ( intrinsicType is IntrinsicType . WithModule ) { load ( intrinsicType . storedIndex , serializersModuleType ) swap ( ) } invokestatic ( serializersKtInternalName , callMethodName , intrinsicType . methodDescriptor , false ) return true } return false }","docstring":"/**\n * This function produces identical to TYPE_OF reification marker. This is needed for compatibility reasons:\n * old compiler should be able to inline and run newer versions of kotlinx-serialization or other libraries.\n *\n * Operation detection in new compilers performed by voidMagicApiCall.\n */"} {"signature":"private fun LLFirDeclarationModificationService . modifyElement ( element : PsiElement ) : Boolean","body":"{ val disposable = Disposer . newDisposable ( \"\" ) var isOutOfBlock = false try { project . analysisMessageBus . connect ( disposable ) . subscribe ( KotlinTopics . MODULE_OUT_OF_BLOCK_MODIFICATION , KotlinModuleOutOfBlockModificationListener { isOutOfBlock = true } , ) elementModified ( element ) } finally { Disposer . dispose ( disposable ) } return isOutOfBlock }","docstring":"/**\n * @return **true** if out-of-block happens\n */"} {"signature":"private fun PsiElement . modify ( )","body":"{ for ( parent in parentsWithSelf ) { when ( parent ) { is ASTDelegatePsiElement -> parent . subtreeChanged ( ) is KtCodeFragment -> parent . subtreeChanged ( ) } } }","docstring":"/**\n * Emulate modification inside the body\n */"} {"signature":"private fun createIncrementalCompilationContext ( fileLocations : FileLocations ? , transaction : CompilationTransaction , fragmentContext : FragmentContext ? = null , )","body":"= IncrementalCompilationContext ( pathConverterForSourceFiles = fileLocations ? . getRelocatablePathConverterForSourceFiles ( ) ? : BasicFileToPathConverter , pathConverterForOutputFiles = fileLocations ? . getRelocatablePathConverterForOutputFiles ( ) ? : BasicFileToPathConverter , transaction = transaction , reporter = reporter , trackChangesInLookupCache = shouldTrackChangesInLookupCache , storeFullFqNamesInLookupCache = shouldStoreFullFqNamesInLookupCache , icFeatures = icFeatures , fragmentContext = fragmentContext , )","docstring":"/**\n * Creates an instance of [IncrementalCompilationContext] that holds common incremental compilation context mostly required for [CacheManager]\n */"} {"signature":"private fun tryCompileIncrementally ( allSourceFiles : List < File > , changedFiles : ChangedFiles ? , args : Args , fileLocations : FileLocations ? , messageCollector : MessageCollector , ) : ICResult","body":"{ if ( changedFiles is ChangedFiles . Unknown ) { return ICResult . RequiresRebuild ( UNKNOWN_CHANGES_IN_GRADLE_INPUTS ) } val fragmentContext = if ( ! icFeatures . enableUnsafeIncrementalCompilationForMultiplatform ) { FragmentContext . fromCompilerArguments ( args ) } else { null } return createTransaction ( ) . runWithin ( :: incrementalCompilationExceptionTransformer ) { transaction -> val icContext = createIncrementalCompilationContext ( fileLocations , transaction , fragmentContext ) val caches = createCacheManager ( icContext , args ) . also { transaction . cachesManager = it } fun compile ( ) : ICResult { val knownChangedFiles : ChangedFiles . Known = try { getChangedFiles ( changedFiles as ChangedFiles . Known ? , allSourceFiles , caches ) } catch ( e : Throwable ) { return ICResult . Failed ( IC_FAILED_TO_GET_CHANGED_FILES , e ) } val classpathAbiSnapshot = if ( icFeatures . withAbiSnapshot ) getClasspathAbiSnapshot ( args ) else null val compilationMode = try { reporter . measure ( GradleBuildTime . IC_CALCULATE_INITIAL_DIRTY_SET ) { calculateSourcesToCompile ( caches , knownChangedFiles , args , messageCollector , classpathAbiSnapshot ? : emptyMap ( ) ) } } catch ( e : Throwable ) { return ICResult . Failed ( IC_FAILED_TO_COMPUTE_FILES_TO_RECOMPILE , e ) } if ( compilationMode is CompilationMode . Rebuild ) { return ICResult . RequiresRebuild ( compilationMode . reason ) } val abiSnapshotData = if ( icFeatures . withAbiSnapshot ) { if ( ! abiSnapshotFile . exists ( ) ) { reporter . debug { \"\" } return ICResult . RequiresRebuild ( NO_ABI_SNAPSHOT ) } reporter . info { \"\" } AbiSnapshotData ( snapshot = AbiSnapshotImpl . read ( abiSnapshotFile ) , classpathAbiSnapshot = classpathAbiSnapshot ! ! ) } else null val exitCode = try { compileImpl ( icContext , compilationMode as CompilationMode . Incremental , allSourceFiles , args , caches , abiSnapshotData , messageCollector , ) } catch ( e : RequireRebuildForCorrectnessInKMPException ) { return ICResult . RequiresRebuild ( UNSAFE_INCREMENTAL_CHANGE_KT_62686 ) } catch ( e : Throwable ) { return ICResult . Failed ( IC_FAILED_TO_COMPILE_INCREMENTALLY , e ) } return ICResult . Completed ( exitCode ) } compile ( ) . also { icResult -> if ( icResult is ICResult . Completed && icResult . exitCode == ExitCode . OK ) { transaction . markAsSuccessful ( ) } } } }","docstring":"/**\n * Attempts to compile incrementally and returns either [ICResult.Completed], [ICResult.RequiresRebuild], or [ICResult.Failed].\n *\n * Note that parts of this function may still throw exceptions that are not caught and wrapped by [ICResult.Failed] because they are not\n * meant to be caught.\n */"} {"signature":"private fun cleanOrCreateDirectories ( outputDirs : Collection < File > )","body":"{ outputDirs . toSet ( ) . forEach { when { it . isDirectory -> it . deleteDirectoryContents ( ) it . isFile -> \"\" else -> it . createDirectory ( ) } } }","docstring":"/**\n * Deletes the contents of the given directories (not the directories themselves).\n *\n * If the directories do not yet exist, they will be created.\n */"} {"signature":"fun lenetWithMultipleCallbacks ( )","body":"{ val ( train , test ) = mnist ( ) lenet5Classic . use { val earlyStopping = EarlyStopping ( monitor = EpochTrainingEvent :: valLossValue , minDelta = , patience = , verbose = true , mode = EarlyStoppingMode . AUTO , baseline = , restoreBestWeights = false ) val terminateOnNaN = TerminateOnNaN ( ) 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 , callbacks = listOf ( earlyStopping , terminateOnNaN ) ) val accuracy = it . evaluate ( dataset = test , batchSize = TEST_BATCH_SIZE , callback = EvaluateCallback ( ) ) . metrics [ Metrics . ACCURACY ] println ( \"\" ) val predictions = it . predict ( dataset = test , batchSize = TEST_BATCH_SIZE , callback = PredictCallback ( ) ) println ( predictions . size ) } }","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 * - callback definition\n * - model compilation with [EarlyStopping] and [TerminateOnNaN] callbacks\n * - model summary\n * - model training\n * - model evaluation\n */"} {"signature":"fun main ( ) : Unit","body":"= lenetWithMultipleCallbacks ( )","docstring":"/** */"} {"signature":"public operator fun CoroutineScope . plus ( context : CoroutineContext ) : CoroutineScope","body":"= ContextScope ( coroutineContext + context )","docstring":"/**\n * Adds the specified coroutine context to this scope, overriding existing elements in the current\n * scope's context with the corresponding keys.\n *\n * This is a shorthand for `CoroutineScope(thisScope.coroutineContext + context)`.\n */"} {"signature":"@ Suppress ( \"\" ) public fun MainScope ( ) : CoroutineScope","body":"= ContextScope ( SupervisorJob ( ) + Dispatchers . Main )","docstring":"/**\n * Creates the main [CoroutineScope] for UI components.\n *\n * Example of use:\n * ```\n * class MyAndroidActivity {\n * private val scope = MainScope()\n *\n * override fun onDestroy() {\n * super.onDestroy()\n * scope.cancel()\n * }\n * }\n * ```\n *\n * The resulting scope has [SupervisorJob] and [Dispatchers.Main] context elements.\n * If you want to append additional elements to the main scope, use [CoroutineScope.plus] operator:\n * `val scope = MainScope() + CoroutineName(\"MyActivity\")`.\n */"} {"signature":"public suspend fun < R > coroutineScope ( block : suspend CoroutineScope . ( ) -> R ) : R","body":"{ contract { callsInPlace ( block , InvocationKind . EXACTLY_ONCE ) } return suspendCoroutineUninterceptedOrReturn { uCont -> val coroutine = ScopeCoroutine ( uCont . context , uCont ) coroutine . startUndispatchedOrReturn ( coroutine , block ) } }","docstring":"/**\n * Creates a [CoroutineScope] and calls the specified suspend block with this scope.\n * The provided scope inherits its [coroutineContext][CoroutineScope.coroutineContext] from the outer scope, using the\n * [Job] from that context as the parent for a new [Job].\n *\n * This function is designed for _concurrent decomposition_ of work. When any child coroutine in this scope fails,\n * this scope fails, cancelling all the other children (for a different behavior, see [supervisorScope]).\n * This function returns as soon as the given block and all its child coroutines are completed.\n * A usage of a scope looks like this:\n *\n * ```\n * suspend fun showSomeData() = coroutineScope {\n * val data = async(Dispatchers.IO) { // <- extension on current scope\n * ... load some UI data for the Main thread ...\n * }\n *\n * withContext(Dispatchers.Main) {\n * doSomeWork()\n * val result = data.await()\n * display(result)\n * }\n * }\n * ```\n *\n * The scope in this example has the following semantics:\n * 1) `showSomeData` returns as soon as the data is loaded and displayed in the UI.\n * 2) If `doSomeWork` throws an exception, then the `async` task is cancelled and `showSomeData` rethrows that exception.\n * 3) If the outer scope of `showSomeData` is cancelled, both started `async` and `withContext` blocks are cancelled.\n * 4) If the `async` block fails, `withContext` will be cancelled.\n *\n * The method may throw a [CancellationException] if the current job was cancelled externally,\n * rethrow the exception thrown by [block], or throw an unhandled [Throwable] if there is one\n * (for example, from a crashed coroutine that was started with [launch][CoroutineScope.launch] in this scope).\n */"} {"signature":"@ Suppress ( \"\" ) public fun CoroutineScope ( context : CoroutineContext ) : CoroutineScope","body":"= ContextScope ( if ( context [ Job ] != null ) context else context + Job ( ) )","docstring":"/**\n * Creates a [CoroutineScope] that wraps the given coroutine [context].\n *\n * If the given [context] does not contain a [Job] element, then a default `Job()` is created.\n * This way, failure of any child coroutine in this scope or [cancellation][CoroutineScope.cancel] of the scope itself\n * cancels all the scope's children, just like inside [coroutineScope] block.\n */"} {"signature":"public fun CoroutineScope . cancel ( cause : CancellationException ? = null )","body":"{ val job = coroutineContext [ Job ] ? : error ( \"\" ) job . cancel ( cause ) }","docstring":"/**\n * Cancels this scope, including its job and all its children with an optional cancellation [cause].\n * A cause can be used to specify an error message or to provide other details on\n * a cancellation reason for debugging purposes.\n * Throws [IllegalStateException] if the scope does not have a job in it.\n */"} {"signature":"public fun CoroutineScope . cancel ( message : String , cause : Throwable ? = null ) : Unit","body":"= cancel ( CancellationException ( message , cause ) )","docstring":"/**\n * Cancels this scope, including its job and all its children with a specified diagnostic error [message].\n * A [cause] can be specified to provide additional details on a cancellation reason for debugging purposes.\n * Throws [IllegalStateException] if the scope does not have a job in it.\n */"} {"signature":"public fun CoroutineScope . ensureActive ( ) : Unit","body":"= coroutineContext . ensureActive ( )","docstring":"/**\n * Ensures that current scope is [active][CoroutineScope.isActive].\n *\n * If the job is no longer active, throws [CancellationException].\n * If the job was cancelled, thrown exception contains the original cancellation cause.\n * This function does not do anything if there is no [Job] in the scope's [coroutineContext][CoroutineScope.coroutineContext].\n *\n * This method is a drop-in replacement for the following code, but with more precise exception:\n * ```\n * if (!isActive) {\n * throw CancellationException()\n * }\n * ```\n *\n * @see CoroutineContext.ensureActive\n */"} {"signature":"public suspend inline fun currentCoroutineContext ( ) : CoroutineContext","body":"= coroutineContext","docstring":"/**\n * Returns the current [CoroutineContext] retrieved by using [kotlin.coroutines.coroutineContext].\n * This function is an alias to avoid name clash with [CoroutineScope.coroutineContext] in a receiver position:\n *\n * ```\n * launch { // this: CoroutineScope\n * val flow = flow {\n * coroutineContext // Resolves into the context of outer launch, which is incorrect, see KT-38033\n * currentCoroutineContext() // Retrieves actual context where the flow is collected\n * }\n * }\n * ```\n */"} {"signature":"fun ValueParameterDescriptor . hasDefaultValue ( ) : Boolean","body":"{ return DFS . ifAny ( listOf ( this ) , { current -> current . overriddenDescriptors . map ( ValueParameterDescriptor :: getOriginal ) } , { it . declaresDefaultValue ( ) || it . isActualParameterWithCorrespondingExpectedDefault } ) }","docstring":"/**\n * @return `true` iff the parameter has a default value, i.e. declares it, inherits it by overriding a parameter which has a default value,\n * or is a parameter of an 'actual' declaration, such that the corresponding 'expect' parameter has a default value.\n */"} {"signature":"internal fun < T > assertJsonFormAndRestored ( serializer : KSerializer < T > , data : T , expected : String , json : Json = default )","body":"{ parametrizedTest { jsonTestingMode -> val serialized = json . encodeToString ( serializer , data , jsonTestingMode ) assertEquals ( expected , serialized , \"\" ) val deserialized : T = json . decodeFromString ( serializer , serialized , jsonTestingMode ) assertEquals ( data , deserialized , \"\" ) } }","docstring":"/**\n * Same as [assertStringFormAndRestored], but tests both json converters (streaming and tree)\n * via [parametrizedTest]\n */"} {"signature":"internal fun < T > assertJsonFormAndRestoredCustom ( serializer : KSerializer < T > , data : T , expected : String , check : ( T , T ) -> Boolean )","body":"{ parametrizedTest { jsonTestingMode -> val serialized = Json . encodeToString ( serializer , data , jsonTestingMode ) assertEquals ( expected , serialized , \"\" ) val deserialized : T = Json . decodeFromString ( serializer , serialized , jsonTestingMode ) assertTrue ( \"\" ) { check ( data , deserialized ) } } }","docstring":"/**\n * Same as [assertStringFormAndRestored], but tests both json converters (streaming and tree)\n * via [parametrizedTest]. Use custom checker for deserialized value.\n */"} {"signature":"private fun findLibraries ( unresolvedLibraries : List < UnresolvedLibrary > , noStdLib : Boolean , noDefaultLibs : Boolean , noEndorsedLibs : Boolean , ) : List < KotlinLibrary >","body":"{ val userProvidedLibraries = unresolvedLibraries . asSequence ( ) . mapNotNull { searchPathResolver . resolve ( it ) } . toList ( ) val defaultLibraries = searchPathResolver . defaultLinks ( noStdLib , noDefaultLibs , noEndorsedLibs ) return userProvidedLibraries + defaultLibraries }","docstring":"/**\n * Returns the list of libraries based on [libraryNames], [noStdLib], [noDefaultLibs] and [noEndorsedLibs] criteria.\n *\n * This method does not return any libraries that might be available via transitive dependencies\n * from the original library set (root set).\n */"} {"signature":"private fun List < KotlinLibrary > . leaveDistinct ( ) : List < KotlinLibrary >","body":"{ if ( size <= ) return this val deduplicatedLibraries : Map < String , List < KotlinLibrary > > = groupByTo ( linkedMapOf ( ) ) { it . libraryFile . absolutePath } return deduplicatedLibraries . values . map { it . first ( ) } }","docstring":"/**\n * Leaves only distinct libraries (by absolute path).\n */"} {"signature":"private fun List < KotlinLibrary > . omitDuplicateNames ( )","body":"= groupBy { it . uniqueName } . let { groupedByUniqName -> val librariesWithDuplicatedUniqueNames = groupedByUniqName . filterValues { it . size > } librariesWithDuplicatedUniqueNames . entries . sortedBy { it . key } . forEach { ( uniqueName , libraries ) -> val libraryPaths = libraries . map { it . libraryFile . absolutePath } . sorted ( ) . joinToString ( ) logger . warning ( \"\" ) } groupedByUniqName . map { it . value . first ( ) } }","docstring":"/**\n * Having two libraries with the same `unique_name` we only keep the first one.\n *\n * TODO: This is actually undesirable behavior.\n * - In certain situations it harms, e.g. KT-63573\n * - But sometimes it is really necessary, e.g. KT-64115\n * - Overall, we should not do any resolve inside the compiler (such as skipping KLIBs that happen to have repeated `unique_name`).\n * This is an opaque process which better should be performed by the build system (e.g. Gradle). To be fixed in KT-64169\n */"} {"signature":"override fun List < KotlinLibrary > . resolveDependencies ( ) : KotlinLibraryResolveResult","body":"{ val rootLibraries = this . map { KotlinResolvedLibraryImpl ( it ) } val result = KotlinLibraryResolverResultImpl ( rootLibraries ) val cache = mutableMapOf < Any , KotlinResolvedLibrary > ( ) cache . putAll ( rootLibraries . map { it . library . libraryFile . fileKey to it } ) var newDependencies = rootLibraries do { newDependencies = newDependencies . map { library : KotlinResolvedLibraryImpl -> library . library . unresolvedDependencies ( resolveManifestDependenciesLenient ) . asSequence ( ) . filterNot { searchPathResolver . isProvidedByDefault ( it ) } . mapNotNull { searchPathResolver . resolve ( it ) ? . let ( :: KotlinResolvedLibraryImpl ) } . map { resolved -> val fileKey = resolved . library . libraryFile . fileKey if ( fileKey in cache ) { library . addDependency ( cache [ fileKey ] ! ! ) null } else { cache . put ( fileKey , resolved ) library . addDependency ( resolved ) resolved } } . filterNotNull ( ) . toList ( ) } . flatten ( ) } while ( newDependencies . isNotEmpty ( ) ) return result }","docstring":"/**\n * Given the list of root libraries does the following:\n *\n * 1. Evaluates other libraries that are available via transitive dependencies.\n * 2. Wraps each [KotlinLibrary] into a [KotlinResolvedLibrary] with information about dependencies on other libraries.\n * 3. Creates resulting [KotlinLibraryResolveResult] object.\n */"} {"signature":"@ ExperimentalSerializationApi public fun Cbor ( from : Cbor = Cbor , builderAction : CborBuilder . ( ) -> Unit ) : Cbor","body":"{ val builder = CborBuilder ( from ) builder . builderAction ( ) return CborImpl ( builder . encodeDefaults , builder . ignoreUnknownKeys , builder . serializersModule ) }","docstring":"/**\n * Creates an instance of [Cbor] configured from the optionally given [Cbor instance][from]\n * and adjusted with [builderAction].\n */"} {"signature":"public fun content ( value : Any ? , configuration : DisplayConfiguration ) : RenderedContent","body":"public fun content ( value : Any ? , configuration : DisplayConfiguration ) : RenderedContent","docstring":"/**\n * Returns [value] rendered to HTML text, or null if such rendering is impossible\n */"} {"signature":"public fun tooltip ( value : Any ? , configuration : DisplayConfiguration ) : String","body":"public fun tooltip ( value : Any ? , configuration : DisplayConfiguration ) : String","docstring":"/**\n * Returns cell tooltip for this [value]\n */"} {"signature":"fun invokeInterop ( flavor : String , args : Array < String > , runFromDaemon : Boolean ) : Array < String > ?","body":"{ check ( flavor == \"\" ) { \"\" } val arguments = CInteropArguments ( ) arguments . argParser . parse ( args ) val outputFileName = arguments . output val noDefaultLibs = arguments . nodefaultlibs || arguments . nodefaultlibsDeprecated val noEndorsedLibs = arguments . noendorsedlibs val purgeUserLibs = arguments . purgeUserLibs val nopack = arguments . nopack val temporaryFilesDir = arguments . tempDir val moduleName = arguments . moduleName val shortModuleName = arguments . shortModuleName val buildDir = File ( \"\" ) val generatedDir = File ( buildDir , \"\" ) val nativesDir = File ( buildDir , \"\" ) val manifest = File ( buildDir , \"\" ) val cstubsName = \"\" val libraries = arguments . library val repos = arguments . repo val targetRequest = arguments . target val target = PlatformManager ( KotlinNativePaths . homePath . absolutePath , konanDataDir = arguments . konanDataDir ) . targetManager ( targetRequest ) . target val cinteropArgsToCompiler = Interop ( ) . interop ( \"\" , args , InternalInteropOptions ( generatedDir . absolutePath , nativesDir . absolutePath , manifest . path , cstubsName ) , runFromDaemon ) ? : return null val nativeStubs = arrayOf ( \"\" , File ( nativesDir , \"\" ) . path ) return arrayOf ( generatedDir . path , \"\" , \"\" , \"\" , outputFileName , \"\" , target . visibleName , \"\" , manifest . path , \"\" , \"\" ) + nativeStubs + cinteropArgsToCompiler + libraries . flatMap { listOf ( \"\" , it ) } + repos . flatMap { listOf ( \"\" , it ) } + ( if ( noDefaultLibs ) arrayOf ( \"\" ) else emptyArray ( ) ) + ( if ( noEndorsedLibs ) arrayOf ( \"\" ) else emptyArray ( ) ) + ( if ( purgeUserLibs ) arrayOf ( \"\" ) else emptyArray ( ) ) + ( if ( nopack ) arrayOf ( \"\" ) else emptyArray ( ) ) + moduleName ? . let { arrayOf ( \"\" , it ) } . orEmpty ( ) + shortModuleName ? . let { arrayOf ( \"\" ) } . orEmpty ( ) + \"\" + arguments . kotlincOption }","docstring":"/**\n * @return null if there is no need in compiler invocation.\n * Otherwise returns array of compiler args.\n */"} {"signature":"abstract override fun equals ( other : Any ? ) : Boolean","body":"abstract override fun equals ( other : Any ? ) : Boolean","docstring":"/**\n * @return true if this type is equal to [other] symbolically. Note that this is NOT EQUIVALENT to the full type checking algorithm\n * used in the compiler frontend. For example, this method will return `false` on the types `List<*>` and `List`,\n * whereas the real type checker from the compiler frontend would return `true`.\n *\n * Classes are compared by FQ names, which means that even if two types refer to different symbols of the class with the same FQ name,\n * such types will be considered equal. Type annotations do not have any effect on the behavior of this method.\n */"} {"signature":"inline fun checkParcelizeClassSymbols ( symbol : FirClassSymbol < * > , session : FirSession , predicate : ( FirClassSymbol < * > ) -> Boolean , ) : Boolean","body":"{ if ( predicate ( symbol ) ) return true return symbol . resolvedSuperTypeRefs . any { superTypeRef -> val superTypeSymbol = superTypeRef . type . toRegularClassSymbol ( session ) ? . takeIf { it . rawStatus . modality == Modality . SEALED } ? : return@any false predicate ( superTypeSymbol ) } }","docstring":"/**\n * Check all related [FirClassSymbol]s to the provided [symbol] which are valid locations for a\n * `Parcelize` annotation to be present. This commonizes class symbol navigation between checker and\n * generator, even though [predicate] implementation is different.\n */"} {"signature":"fun < K , V : Any > createMemoizedFunction ( compute : ( K ) -> V ) : MemoizedFunctionToNotNull < K , V >","body":"fun < K , V : Any > createMemoizedFunction ( compute : ( K ) -> V ) : MemoizedFunctionToNotNull < K , V >","docstring":"/**\n * Given a function compute: K -> V create a memoized version of it that computes a value only once for each key\n * @param compute the function to be memoized\n * @param valuesReferenceKind how to store the memoized values\n *\n * NOTE: if compute() has side-effects the WEAK reference kind is dangerous: the side-effects will be repeated if\n * the value gets collected and then re-computed\n */"} {"signature":"fun < T : Any > createLazyValueWithPostCompute ( computable : ( ) -> T , onRecursiveCall : ( ( Boolean ) -> T ) ? , postCompute : ( T ) -> Unit ) : NotNullLazyValue < T >","body":"fun < T : Any > createLazyValueWithPostCompute ( computable : ( ) -> T , onRecursiveCall : ( ( Boolean ) -> T ) ? , postCompute : ( T ) -> Unit ) : NotNullLazyValue < T >","docstring":"/**\n * @param onRecursiveCall is called if the computation calls itself recursively.\n * The parameter to it is {@code true} for the first call, {@code false} otherwise.\n * If {@code onRecursiveCall} is {@code null}, an exception will be thrown on a recursive call,\n * otherwise it's executed and its result is returned\n *\n * @param postCompute is called after the value is computed AND published (and some clients rely on that\n * behavior - notably, AbstractTypeConstructor). It means that it is up to particular implementation\n * to provide (or not to provide) thread-safety guarantees on writes made in postCompute -- see javadoc for\n * LockBasedLazyValue for details.\n */"} {"signature":"fun < T : Any > createNullableLazyValueWithPostCompute ( computable : ( ) -> T ? , postCompute : ( T ? ) -> Unit ) : NullableLazyValue < T >","body":"fun < T : Any > createNullableLazyValueWithPostCompute ( computable : ( ) -> T ? , postCompute : ( T ? ) -> Unit ) : NullableLazyValue < T >","docstring":"/**\n * See javadoc for createLazyValueWithPostCompute\n */"} {"signature":"public fun load ( dataSource : D ) : FloatData","body":"public fun load ( dataSource : D ) : FloatData","docstring":"/**\n * Load the data from the specified [dataSource].\n */"} {"signature":"fun < TypeParam > Receiver . function ( param1 : Param1 , param2 : Param2 ) : TypeParam","body":"{ }","docstring":"/**\n * [param1]\n */"} {"signature":"private fun dropOutdatedModifications ( ktModuleWithOutOfBlockModification : KtModule )","body":"{ processQueue { value , iterator -> if ( value . ktModule == ktModuleWithOutOfBlockModification ) iterator . remove ( ) } }","docstring":"/**\n * We can avoid processing of in-block modification with the same [KtModule] because they\n * will be invalidated anyway by OOBM\n */"} {"signature":"private inline fun processQueue ( action : ( value : ChangeType . InBlock , iterator : MutableIterator < ChangeType . InBlock > ) -> Unit )","body":"{ val queue = inBlockModificationQueue ? : return val iterator = queue . iterator ( ) while ( iterator . hasNext ( ) ) { val element = iterator . next ( ) if ( ! element . blockOwner . isValid ) { iterator . remove ( ) continue } action ( element , iterator ) } }","docstring":"/**\n * Process valid elements in the current queue.\n * Non-valid elements will be dropped from the queue during this iteration.\n *\n * @param action will be executed for each valid element in the queue;\n * **value** is a current element;\n * **iterator** is the corresponding iterator for this element.\n */"} {"signature":"fun flushModifications ( )","body":"{ ApplicationManager . getApplication ( ) . assertIsWriteThread ( ) processQueue { value , _ -> inBlockModification ( value . blockOwner , value . ktModule ) } inBlockModificationQueue = null }","docstring":"/**\n * Force the service to publish delayed modifications.\n * This action is required to fix inconsistencies in [FirFile][org.jetbrains.kotlin.fir.declarations.FirFile] tree.\n */"} {"signature":"fun elementModified ( element : PsiElement , modificationType : ModificationType = ModificationType . Unknown )","body":"{ ApplicationManager . getApplication ( ) . assertIsWriteThread ( ) when ( val changeType = calculateChangeType ( element , modificationType ) ) { is ChangeType . Invisible -> { } is ChangeType . InBlock -> addModificationToQueue ( changeType ) is ChangeType . OutOfBlock -> outOfBlockModification ( element ) } }","docstring":"/**\n * This method should be called during some [PsiElement] modification.\n * This method must be called from write action.\n *\n * Will publish event to [MODULE_OUT_OF_BLOCK_MODIFICATION] in case of out-of-block modification.\n *\n * @param element is an element that we want to/did already modify, remove, or add.\n * Some examples:\n * * [element] is [KtNamedFunction][org.jetbrains.kotlin.psi.KtNamedFunction] if we\n * dropped body ([KtBlockExpression][org.jetbrains.kotlin.psi.KtBlockExpression]) of this function\n * * [element] is [KtBlockExpression][org.jetbrains.kotlin.psi.KtBlockExpression] if we replaced one body-expression with another one\n * * [element] is [KtBlockExpression][org.jetbrains.kotlin.psi.KtBlockExpression] if added a body to the function without body\n * * [element] is the parent of an already removed element, while [ModificationType.ElementRemoved] will contain the removed element\n *\n * @param modificationType additional information to make more accurate decisions\n */"} {"signature":"private fun PsiElement . isNewDirectChildOf ( inBlockModificationOwner : KtAnnotated , modificationType : ModificationType ) : Boolean","body":"= modificationType == ModificationType . ElementAdded && parent == inBlockModificationOwner","docstring":"/**\n * This check covers cases such as a new body that was added to a function, which should cause an out-of-block modification.\n */"} {"signature":"private fun ModificationType . isContractRemoval ( ) : Boolean","body":"= this is ModificationType . ElementRemoved && ( removedElement as? KtExpression ) ? . isContractDescriptionCallPsiCheck ( ) == true","docstring":"/**\n * Contract changes are always out-of-block modifications. If a contract is removed all at once, e.g. via [PsiElement.delete],\n * [isElementInsideBody] will not see the removed contract inside the PSI *after* removal and treat the change as an in-block\n * modification. \"Before removal\" events aren't necessarily paired up with \"after removal\" events in the IDE, so we cannot rely on the\n * presence of the contract statement in some \"before removal\" event.\n *\n * [isContractRemoval] has to analyze the removed element out of context, as it has already been removed from its parent PSI. There\n * might occasionally be false positives, for example removing the contract statement from:\n *\n * ```\n * if (condition) {\n * contract { ... }\n * }\n * ```\n *\n * As it is not a valid contract statement, its removal doesn't need to trigger an out-of-block modification. Nonetheless, as such a\n * situation should not occur frequently, false positives are acceptable and this simplifies the analysis, making it less error-prone.\n */"} {"signature":"fun elementToRehighlight ( changedElement : PsiElement ) : PsiElement ?","body":"{ return nonLocalDeclarationForLocalChange ( changedElement ) }","docstring":"/**\n * @return the psi element (ancestor of the changedElement) which should be re-highlighted in case of in-block changes or null if unsure\n */"} {"signature":"internal fun bodyResolved ( element : FirElementWithResolveState , phase : FirResolvePhase )","body":"{ when ( element ) { is FirSimpleFunction -> { if ( phase != FirResolvePhase . BODY_RESOLVE ) return } is FirProperty -> { if ( phase != FirResolvePhase . BODY_RESOLVE && phase != FirResolvePhase . IMPLICIT_TYPES_BODY_RESOLVE ) return } is FirCodeFragment -> { if ( phase != FirResolvePhase . BODY_RESOLVE ) return } else -> return } val declaration = element . source ? . psi as? KtAnnotated ? : return when ( declaration ) { is KtNamedFunction -> { if ( declaration . isReanalyzableContainer ( ) ) { declaration . hasFirBody = true } } is KtProperty -> { if ( declaration . isReanalyzableContainer ( ) || declaration . accessors . any ( KtPropertyAccessor :: isReanalyzableContainer ) ) { declaration . hasFirBody = true } } is KtCodeFragment -> { declaration . hasFirBody = true } } }","docstring":"/**\n * This function have to be called from Low Level FIR body transformers.\n * It is fine to have false-positives, but false-negatives are not acceptable.\n */"} {"signature":"internal fun PsiElement . getNonLocalReanalyzableContainingDeclaration ( ) : KtDeclaration ?","body":"{ return when ( val declaration = getNonLocalContainingOrThisDeclaration ( ) ) { is KtNamedFunction -> declaration . takeIf { function -> function . isReanalyzableContainer ( ) && isElementInsideBody ( declaration = function , child = this ) } is KtPropertyAccessor -> declaration . takeIf { accessor -> accessor . isReanalyzableContainer ( ) && isElementInsideBody ( declaration = accessor , child = this ) } is KtProperty -> declaration . takeIf { property -> property . isReanalyzableContainer ( ) && property . delegateExpressionOrInitializer ? . isAncestor ( this ) == true } else -> null } }","docstring":"/**\n * Covered by org.jetbrains.kotlin.analysis.low.level.api.fir.file.structure.AbstractInBlockModificationTest\n * on the compiler side and by\n * org.jetbrains.kotlin.idea.fir.analysis.providers.trackers.AbstractProjectWideOutOfBlockKotlinModificationTrackerTest\n * on the plugin part\n *\n * @return The declaration in which a change of the passed receiver parameter can be treated as in-block modification\n */"} {"signature":"private fun TypeSystemCommonSuperTypesContext . allCommonSuperTypeConstructors ( types : List < SimpleTypeMarker > , stateStubTypesEqualToAnything : TypeCheckerState ) : List < TypeConstructorMarker >","body":"{ val result = collectAllSupertypes ( types . first ( ) , stateStubTypesEqualToAnything ) for ( type in types ) { if ( type === types . first ( ) ) continue result . retainAll ( collectAllSupertypes ( type , stateStubTypesEqualToAnything ) ) } return result . filterNot { target -> result . any { other -> other != target && other . supertypes ( ) . any { it . typeConstructor ( ) == target } } } }","docstring":"/**\n * Note that if there is captured type C, then no one else is not subtype of C => lowerType cannot help here\n */"} {"signature":"private fun TypeSystemCommonSuperTypesContext . checkRecursion ( originalTypesForCst : List < SimpleTypeMarker > , typeArgumentsForSuperConstructorParameter : List < TypeArgumentMarker > , parameter : TypeParameterMarker , ) : Boolean","body":"{ if ( parameter . getVariance ( ) == TypeVariance . IN ) return false val originalTypesSet = originalTypesForCst . mapTo ( mutableSetOf ( ) ) { it . lowerBoundIfFlexible ( ) . originalIfDefinitelyNotNullable ( ) } val typeArgumentsTypeSet = typeArgumentsForSuperConstructorParameter . mapTo ( mutableSetOf ( ) ) { it . getType ( ) . lowerBoundIfFlexible ( ) . originalIfDefinitelyNotNullable ( ) } if ( originalTypesSet . size != typeArgumentsTypeSet . size ) return false val originalTypeConstructorSet by lazy { typeConstructorsWithExpandedStarProjections ( originalTypesSet ) . toSet ( ) } for ( argumentType in typeArgumentsTypeSet ) { if ( argumentType in originalTypesSet ) continue var starProjectionFound = false for ( supertype in supertypesIfCapturedStarProjection ( argumentType ) . orEmpty ( ) ) { if ( supertype . lowerBoundIfFlexible ( ) . originalIfDefinitelyNotNullable ( ) . typeConstructor ( ) !in originalTypeConstructorSet ) return false else starProjectionFound = true } if ( ! starProjectionFound ) return false } return true }","docstring":"/**\n * This function returns true in case of detected recursion in type arguments.\n *\n * For situations with self type arguments (or similar ones), the call of this function\n * prevents too deep type argument analysis during super type calculation.\n * Typical examples use something like this interface in hierarchy:\n * ```\n * interface Some>\n * ```\n * From point of view of this function we have here something like `Some` in [originalTypesForCst],\n * and the captured type in argument has the same `Some` as its constructor supertype.\n *\n * See also the test 'multirecursion.kt' and comment to the fix of [KT-38544](https://youtrack.jetbrains.com/issue/KT-38544):\n * for single super type constructor create star projection argument when types for that argument are equal to the original types.\n * Captured star projections are replaced with their corresponding supertypes during this check.\n * The check is skipped for contravariant parameters, for which recursive cst calculation never happens.\n */"} {"signature":"fun < T , R > Iterator < T > . transformAsSequence ( func : Sequence < T > . ( ) -> Sequence < R > ) : Iterator < R >","body":"= func ( this . asSequence ( ) ) . iterator ( )","docstring":"/** Allows to transform an Iterator using the Sequence functions. */"} {"signature":"fun < T > Iterator < Iterator < T > > . flatten ( ) : Iterator < T >","body":"= transformAsSequence { flatMap { it . asSequence ( ) } }","docstring":"/** Flattens iterator. */"} {"signature":"fun < T , R > Iterator < T > . map ( func : ( T ) -> R ) : Iterator < R >","body":"= transformAsSequence { map ( func ) }","docstring":"/** Maps the values of the iterator lazily using [func]. */"} {"signature":"fun < T > Iterator < T > . filter ( predicate : ( T ) -> Boolean ) : Iterator < T >","body":"= transformAsSequence { filter ( predicate ) }","docstring":"/** Filters the values of the iterator lazily using [predicate]. */"} {"signature":"fun < T > Iterator < T > . partition ( size : Int , cutIncomplete : Boolean = false ) : Iterator < List < T > >","body":"= PartitioningIterator ( this , size , cutIncomplete )","docstring":"/** Partitions the values of the iterator lazily in groups of [size]. */"} {"signature":"private fun checkAndReportDeprecatedMppProperties ( project : Project )","body":"{ val projectProperties = project . kotlinPropertiesProvider val usedProperties = deprecatedMppProperties . mapNotNull { propertyName -> if ( propertyName in propertiesSetByPlugin && projectProperties . mpp13XFlagsSetByPlugin ) return@mapNotNull null propertyName . takeIf { projectProperties . property ( propertyName ) . orNull != null } } if ( usedProperties . isEmpty ( ) ) return project . kotlinToolingDiagnosticsCollector . reportOncePerGradleBuild ( project , KotlinToolingDiagnostics . PreHMPPFlagsError ( usedProperties ) ) }","docstring":"/**\n * Declared properties have to be captured during plugin application phase before the HMPP migration util sets them.\n * Warnings have to be reported only for successfully evaluated projects without errors.\n */"} {"signature":"protected open fun defaultLanguageVersionSettings ( ) : LanguageVersionSettings","body":"{ return CompilerTestLanguageVersionSettings ( DEFAULT_DIAGNOSTIC_TESTS_FEATURES , LanguageVersionSettingsImpl . DEFAULT . apiVersion , LanguageVersionSettingsImpl . DEFAULT . languageVersion ) }","docstring":"/**\n * Version settings used when no test data files have overriding version directives\n */"} {"signature":"@ Test fun testCancelAndResumeWithException ( )","body":"= runTest { var continuation : Continuation < Unit > ? = null val job = launch { try { expect ( ) suspendCancellableCoroutine < Unit > { c -> continuation = c } } catch ( e : CancellationException ) { expect ( ) } } expect ( ) yield ( ) job . cancel ( ) yield ( ) continuation ! ! . resumeWithException ( TestException ( ) ) finish ( ) }","docstring":"/**\n * Cancelling outer job may, in practise, race with attempt to resume continuation and resumes\n * should be ignored. Here suspended coroutine is cancelled but then resumed with exception.\n */"} {"signature":"@ Test fun testCancelAndResume ( )","body":"= runTest { var continuation : Continuation < Unit > ? = null val job = launch { try { expect ( ) suspendCancellableCoroutine < Unit > { c -> continuation = c } } catch ( e : CancellationException ) { expect ( ) } } expect ( ) yield ( ) job . cancel ( ) yield ( ) continuation ! ! . resume ( Unit ) finish ( ) }","docstring":"/**\n * Cancelling outer job may, in practise, race with attempt to resume continuation and resumes\n * should be ignored. Here suspended coroutine is cancelled but then resumed with exception.\n */"} {"signature":"fun printAllImports ( printer : Appendable ) : Boolean","body":"{ var atLeastOneImport = false for ( ( packageName , entities ) in imports ) { for ( entity in entities ) { atLeastOneImport = true printer . append ( \"\" , packageName , \"\" , entity , \"\" ) } } return atLeastOneImport }","docstring":"/**\n * Prints all the collected imports in alphabetical order.\n *\n * @return `true` if at least one import was printed, `false` if no imports were printed.\n */"} {"signature":"public fun Operation < BufferedImage , FloatData > . fileLoader ( ) : DataLoader < File >","body":"= PreprocessingFileDataLoader ( this )","docstring":"/**\n * Returns a [DataLoader] instance which loads images from files and uses this [Operation] to process them.\n */"} {"signature":"public fun Operation < BufferedImage , FloatData > . inputStreamLoader ( ) : DataLoader < InputStream >","body":"= PreprocessingInputStreamDataLoader ( this )","docstring":"/**\n * Returns a [DataLoader] instance which loads images from input streams and uses this [Operation] to process them.\n */"} {"signature":"fun getReplResult ( id : String ) : Any ?","body":"fun getReplResult ( id : String ) : Any ?","docstring":"/**\n * Returns the REPL result for a given id or `null` if no result exists or `null` was the result.\n * @param id unique id for the given REPL result. Normally this is [DisplayResult.id].\n * @return the repl result associated with the given [id] or `null` if no result was found.\n */"} {"signature":"fun addReplResult ( result : Any ? ) : String","body":"fun addReplResult ( result : Any ? ) : String","docstring":"/**\n * Add a REPL result without an ID. An ID will be auto-generated and returned.\n *\n * @param result the REPL result to store.\n * @return the id the [result] was stored under.\n */"} {"signature":"fun setReplResult ( id : String , result : Any ? , )","body":"fun setReplResult ( id : String , result : Any ? , )","docstring":"/**\n * Sets the REPL result for a given id.\n * @param id unique id for the given REPL result. Normally this is [DisplayResult.id].\n * @param result the REPL result to store.\n */"} {"signature":"fun removeReplResult ( id : String ) : Boolean","body":"fun removeReplResult ( id : String ) : Boolean","docstring":"/**\n * Removes the REPL result with the given [id] from the holder.\n * Returns `true` if an entry was removed, `false` if not.\n */"} {"signature":"private fun getCombinedFirKotlinDeclaredMemberScope ( symbolWithMembers : KtSymbolWithMembers ) : FirContainingNamesAwareScope","body":"{ val useSiteSession = analysisSession . useSiteSession return when ( symbolWithMembers ) { is KtFirScriptSymbol -> FirScriptDeclarationsScope ( useSiteSession , symbolWithMembers . firSymbol . fir ) else -> useSiteSession . declaredMemberScope ( symbolWithMembers . getFirForScope ( ) , memberRequiredPhase = null ) } }","docstring":"/**\n * Returns a declared member scope which contains both static and non-static callables, as well as all classifiers. Java classes need to\n * be handled specially, because [declaredMemberScope] doesn't handle Java enhancement properly.\n */"} {"signature":"fun registerServices ( project : Project )","body":"{ val mbs : MBeanServer = ManagementFactory . getPlatformMBeanServer ( ) registerStatsService ( mbs , DefaultKotlinBuildStatsBeanService ( project , getBeanName ( DEFAULT_SERVICE_QUALIFIER ) ) , KotlinBuildStatsMXBean :: class . java , DEFAULT_SERVICE_QUALIFIER ) registerStatsService ( mbs , Pre232IdeaKotlinBuildStatsBeanService ( project , getBeanName ( LEGACY_SERVICE_QUALIFIER ) ) , Pre232IdeaKotlinBuildStatsMXBean :: class . java , LEGACY_SERVICE_QUALIFIER ) }","docstring":"/**\n * Registers the Kotlin build stats services for the given project.\n *\n * The registry must be closed at the end of the usage.\n */"} {"signature":"override fun close ( )","body":"{ for ( service in services . values ) { service . close ( ) } services . clear ( ) }","docstring":"/**\n * Unregisters all the registered JMX services and may release other resources allocated by a service.\n */"} {"signature":"override fun toString ( ) : String","body":"{ val verb = when ( this ) { is KeepOriginalDependency -> \"\" is Exclude -> \"\" is ChooseVisibleSourceSets -> \"\" } return \"\" }","docstring":"/** Evaluate and store the value, as the [dependency] will be lost during Gradle instant execution */"} {"signature":"override fun toString ( ) : String","body":"= super . toString ( ) + \"\" + allVisibleSourceSetNames . joinToString ( \"\" , \"\" , \"\" ) { ( if ( it in visibleSourceSetNamesExcludingDependsOn ) \"\" else \"\" ) + it }","docstring":"/** Evaluate and store the value, as the [dependency] will be lost during Gradle instant execution */"} {"signature":"override fun toString ( ) : String","body":"= \"\"","docstring":"/** Evaluate and store the value, as the [dependency] will be lost during Gradle instant execution */"} {"signature":"private fun processDependency ( dependency : ResolvedDependencyResult , sourceSetsVisibleInParents : Set < String > , ) : MetadataDependencyResolution","body":"{ val module = dependency . selected val moduleId = module . id val compositeMetadataArtifact = params . resolvedMetadataConfiguration . getArtifacts ( dependency ) . singleOrNull ( ) ? . takeIf { it . variant . attributes . containsMultiplatformAttributes } ? : return MetadataDependencyResolution . KeepOriginalDependency ( module ) logger . debug ( \"\" ) val mppDependencyMetadataExtractor = params . projectStructureMetadataExtractorFactory . create ( compositeMetadataArtifact ) val projectStructureMetadata = mppDependencyMetadataExtractor . getProjectStructureMetadata ( ) ? : return MetadataDependencyResolution . KeepOriginalDependency ( module ) if ( ! projectStructureMetadata . isPublishedAsRoot ) { error ( \"\" ) } val isResolvedToProject = moduleId in params . build val sourceSetVisibility = params . sourceSetVisibilityProvider . getVisibleSourceSets ( params . sourceSetName , dependency , projectStructureMetadata , isResolvedToProject ) val allVisibleSourceSets = sourceSetVisibility . visibleSourceSetNames val requestedTransitiveDependencies : Set < ModuleDependencyIdentifier > = mutableSetOf < ModuleDependencyIdentifier > ( ) . apply { projectStructureMetadata . sourceSetModuleDependencies . forEach { ( sourceSetName , moduleDependencies ) -> if ( sourceSetName in allVisibleSourceSets ) { addAll ( moduleDependencies ) } } } val transitiveDependenciesToVisit = module . dependencies . filterIsInstance < ResolvedDependencyResult > ( ) . filterTo ( mutableSetOf ( ) ) { it . toModuleDependencyIdentifier ( ) in requestedTransitiveDependencies } if ( params . sourceSetName in params . platformCompilationSourceSets && ! isResolvedToProject ) return MetadataDependencyResolution . Exclude . PublishedPlatformSourceSetDependency ( module , transitiveDependenciesToVisit ) val visibleSourceSetsExcludingDependsOn = allVisibleSourceSets . filterTo ( mutableSetOf ( ) ) { it !in sourceSetsVisibleInParents } val metadataProvider = when ( mppDependencyMetadataExtractor ) { is ProjectMppDependencyProjectStructureMetadataExtractor -> ProjectMetadataProvider ( sourceSetMetadataOutputs = params . projectData [ mppDependencyMetadataExtractor . projectPath ] ? . sourceSetMetadataOutputs ? . getOrThrow ( ) ? : error ( \"\" ) ) is JarMppDependencyProjectStructureMetadataExtractor -> ArtifactMetadataProvider ( CompositeMetadataArtifactImpl ( moduleDependencyIdentifier = dependency . toModuleDependencyIdentifier ( ) , moduleDependencyVersion = module . moduleVersion ? . version ? : \"\" , kotlinProjectStructureMetadata = projectStructureMetadata , primaryArtifactFile = mppDependencyMetadataExtractor . primaryArtifactFile , hostSpecificArtifactFilesBySourceSetName = sourceSetVisibility . hostSpecificMetadataArtifactBySourceSet ) ) } return MetadataDependencyResolution . ChooseVisibleSourceSets ( dependency = module , projectStructureMetadata = projectStructureMetadata , allVisibleSourceSetNames = allVisibleSourceSets , visibleSourceSetNamesExcludingDependsOn = visibleSourceSetsExcludingDependsOn , visibleTransitiveDependencies = transitiveDependenciesToVisit , metadataProvider = metadataProvider ) }","docstring":"/**\n * If the [module] is an MPP metadata module, we extract [KotlinProjectStructureMetadata] and do the following:\n *\n * * get the [KotlinProjectStructureMetadata] from the dependency (either deserialize from the artifact or build from the project)\n *\n * * determine the set *S* of source sets that should be seen in the [kotlinSourceSet] by finding which variants the [parent]\n * dependency got resolved for the compilations where [kotlinSourceSet] participates:\n *\n * * transform the single Kotlin metadata artifact into a set of Kotlin metadata artifacts for the particular source sets in\n * *S* and add the results as [MetadataDependencyResolution.ChooseVisibleSourceSets]\n *\n * * based on the project structure metadata, determine which of the module's dependencies are requested by the\n * source sets in *S*, then consider only these transitive dependencies, ignore the others;\n */"} {"signature":"private fun ResolvedDependencyResult . toModuleDependencyIdentifier ( ) : ModuleDependencyIdentifier","body":"{ val component = selected return when ( val componentId = component . id ) { is ModuleComponentIdentifier -> ModuleDependencyIdentifier ( componentId . group , componentId . module ) is ProjectComponentIdentifier -> { if ( componentId in params . build ) { params . projectData [ componentId . projectPath ] ? . moduleId ? . getOrThrow ( ) ? : error ( \"\" ) } else { ModuleDependencyIdentifier ( component . moduleVersion ? . group ? : \"\" , component . moduleVersion ? . name ? : \"\" ) } } else -> error ( \"\" ) } }","docstring":"/**\n * Behaves as [ModuleIds.fromComponent]\n */"} {"signature":"fun accepts ( value : Any ? , property : KProperty < * > , ) : Boolean","body":"fun accepts ( value : Any ? , property : KProperty < * > , ) : Boolean","docstring":"/**\n * Tells if this handler accepts the given property\n * Called for each variable in the cells executed by users,\n * except those names are starting from [TEMP_PROPERTY_PREFIX]\n * or those that have been already consumed by another handler\n *\n * @param value Property value\n * @param property Property compile-time information\n */"} {"signature":"fun finalize ( host : KotlinKernelHost )","body":"{ }","docstring":"/**\n * Called one time per cell after all the variables have been processed,\n * and only if this handler accepted at least one variable\n *\n * @param host Host for running executions\n */"} {"signature":"fun acceptsType ( type : KType ) : Boolean","body":"fun acceptsType ( type : KType ) : Boolean","docstring":"/**\n * Returns true if this converter accepts [type], false otherwise\n */"} {"signature":"public fun < T > face ( column : ColumnReference < T > , ) : NonPositionalMapping < T , FontFace >","body":"{ return addNonPositionalMapping < T , FontFace > ( FONT_FACE , column . name ( ) , null ) }","docstring":"/**\n * Maps the `face` aesthetic to a data column by [ColumnReference].\n *\n * @param column the data column to be mapped.\n * @return a [NonPositionalMapping] object representing the mapping.\n */"} {"signature":"public fun < T > face ( column : KProperty < T > , ) : NonPositionalMapping < T , FontFace >","body":"{ return addNonPositionalMapping < T , FontFace > ( FONT_FACE , column . name , null ) }","docstring":"/**\n * Maps the `face` aesthetic to a data column by [KProperty].\n *\n * @param column the data column to be mapped.\n * @return a [NonPositionalMapping] object representing the mapping.\n */"} {"signature":"public fun face ( column : String , ) : NonPositionalMapping < Any ? , FontFace >","body":"{ return addNonPositionalMapping < Any ? , FontFace > ( FONT_FACE , column , null ) }","docstring":"/**\n * Maps the `face` aesthetic to a data column by [String].\n *\n * @param column the data column to be mapped.\n * @return a [NonPositionalMapping] object representing the mapping.\n */"} {"signature":"public fun < T > face ( values : Iterable < T > , name : String ? = null ) : NonPositionalMapping < T , FontFace >","body":"{ return addNonPositionalMapping < T , FontFace > ( FONT_FACE , values . toList ( ) , name , null ) }","docstring":"/**\n * Maps the `face` aesthetic to the iterable of values.\n *\n * @param values the iterable of values to be mapped.\n * @param name optional name for this aesthetic mapping.\n * @return a [NonPositionalMapping] object representing the mapping.\n */"} {"signature":"public fun < T > face ( values : DataColumn < T > , ) : NonPositionalMapping < T , FontFace >","body":"{ return addNonPositionalMapping < T , FontFace > ( FONT_FACE , values , null ) }","docstring":"/**\n * Maps the `face` aesthetic to a data column.\n *\n * @param values the data column to be mapped.\n * @return a [NonPositionalMapping] object representing the mapping.\n */"} {"signature":"fun lenetWithTimeStoppingCallback ( )","body":"{ val ( train , test ) = mnist ( ) lenet5Classic . use { val timeStopping = TimeStopping ( seconds = , verbose = true ) 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 , callback = timeStopping ) 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 * - callback definition\n * - model compilation with [TimeStopping] callback\n * - model summary\n * - model training\n * - model evaluation\n */"} {"signature":"private inline fun < A : KtCallableDeclaration > forEachCallableProvider ( packageFqName : FqName , name : Name , getCallables : ( CallableId ) -> Collection < A > , provide : LLFirKotlinSymbolProvider . ( CallableId , Collection < A > ) -> Unit , )","body":"{ if ( ! symbolNamesProvider . mayHaveTopLevelCallable ( packageFqName , name ) ) return val callableId = CallableId ( packageFqName , name ) getCallables ( callableId ) . groupBy { getModule ( it ) } . forEach { ( ktModule , callables ) -> val provider = providersByKtModule [ ktModule ] ? : return@forEach provider . provide ( callableId , callables ) } }","docstring":"/**\n * Calls [provide] on those providers which can contribute a callable of the given name.\n */"} {"signature":"private fun KotlinDeclarationProvider . getTopLevelCallables ( callableId : CallableId ) : List < KtCallableDeclaration >","body":"= getTopLevelFunctions ( callableId ) + getTopLevelProperties ( callableId )","docstring":"/**\n * Callables are provided very rarely (compared to functions/properties individually), so it's okay to hit indices twice here.\n */"} {"signature":"public fun identity ( ) : Position","body":"= Identity","docstring":"/**\n * Returns an [Identity] position adjustment.\n *\n * With `Identity`, no position adjustment will be done.\n *\n * @return [Identity] position adjustment object.\n */"} {"signature":"public fun stack ( ) : Position","body":"= Stack","docstring":"/**\n * Returns a [Stack] position adjustment.\n *\n * With `Stack`, overlapping elements will be stacked on top of each other.\n *\n * @return [Stack] position adjustment object.\n */"} {"signature":"public fun dodge ( width : Double ? = null ) : Position","body":"= Dodge ( width )","docstring":"/**\n * Returns a [Dodge] position adjustment.\n *\n * With `Dodge`, overlapping elements will be dodged side-to-side.\n *\n * @param width the dodging width, different from the individual element's width.\n * @return [Dodge] position adjustment object.\n */"} {"signature":"public fun jitter ( width : Double ? = null , height : Double ? = null ) : Position","body":"= Jitter ( width , height )","docstring":"/**\n * Returns a [Jitter] position adjustment.\n *\n * With `Jitter`, a small random offset will be applied to avoid overlap.\n *\n * @param width the amount of vertical jitter.\n * @param height the amount of horizontal jitter.\n * @return [Jitter] position adjustment object.\n */"} {"signature":"public fun nudge ( x : Double ? = null , y : Double ? = null ) : Position","body":"= Nudge ( x , y )","docstring":"/**\n * Returns a [Nudge] position adjustment.\n *\n * With `Nudge`, elements will be moved a fixed distance vertically and/or horizontally.\n *\n * @param x the vertical distance to move.\n * @param y the horizontal distance to move.\n * @return [Nudge] position adjustment object.\n */"} {"signature":"public fun jitterDodge ( dodgeWidth : Double ? = null , jitterWidth : Double ? = null , jitterHeight : Double ? = null ) : Position","body":"= JitterDodge ( dodgeWidth , jitterWidth , jitterHeight )","docstring":"/**\n * Returns a [JitterDodge] position adjustment.\n *\n * With `JitterDodge`, dodge and jitter adjustments will be combined.\n *\n * @param dodgeWidth the dodging width in the x-direction.\n * @param jitterWidth the jitter width in the x-direction.\n * @param jitterHeight the jitter height in the y-direction.\n * @return [JitterDodge] position adjustment object.\n */"} {"signature":"@ kotlin . internal . InlineOnly public actual inline fun < T > Array < out 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 array.\n * \n * @sample samples.collections.Collections.Elements.elementAt\n */"} {"signature":"@ kotlin . internal . InlineOnly public actual inline fun ByteArray . elementAt ( index : Int ) : Byte","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 array.\n * \n * @sample samples.collections.Collections.Elements.elementAt\n */"} {"signature":"@ kotlin . internal . InlineOnly public actual inline fun ShortArray . elementAt ( index : Int ) : Short","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 array.\n * \n * @sample samples.collections.Collections.Elements.elementAt\n */"} {"signature":"@ kotlin . internal . InlineOnly public actual inline fun IntArray . elementAt ( index : Int ) : Int","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 array.\n * \n * @sample samples.collections.Collections.Elements.elementAt\n */"} {"signature":"@ kotlin . internal . InlineOnly public actual inline fun LongArray . elementAt ( index : Int ) : Long","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 array.\n * \n * @sample samples.collections.Collections.Elements.elementAt\n */"} {"signature":"@ kotlin . internal . InlineOnly public actual inline fun FloatArray . elementAt ( index : Int ) : Float","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 array.\n * \n * @sample samples.collections.Collections.Elements.elementAt\n */"} {"signature":"@ kotlin . internal . InlineOnly public actual inline fun DoubleArray . elementAt ( index : Int ) : Double","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 array.\n * \n * @sample samples.collections.Collections.Elements.elementAt\n */"} {"signature":"@ kotlin . internal . InlineOnly public actual inline fun BooleanArray . elementAt ( index : Int ) : Boolean","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 array.\n * \n * @sample samples.collections.Collections.Elements.elementAt\n */"} {"signature":"@ kotlin . internal . InlineOnly public actual inline fun CharArray . elementAt ( index : Int ) : Char","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 array.\n * \n * @sample samples.collections.Collections.Elements.elementAt\n */"} {"signature":"public actual fun < T > Array < out T > . asList ( ) : List < T >","body":"{ return object : AbstractList < T > ( ) , RandomAccess { override val size : Int get ( ) = this@asList . size override fun isEmpty ( ) : Boolean = this@asList . isEmpty ( ) override fun contains ( element : T ) : Boolean = this@asList . contains ( element ) override fun get ( index : Int ) : T = this@asList [ index ] override fun indexOf ( element : T ) : Int = this@asList . indexOf ( element ) override fun lastIndexOf ( element : T ) : Int = this@asList . lastIndexOf ( element ) } }","docstring":"/**\n * Returns a [List] that wraps the original array.\n */"} {"signature":"public actual fun ByteArray . asList ( ) : List < Byte >","body":"{ return object : AbstractList < Byte > ( ) , RandomAccess { override val size : Int get ( ) = this@asList . size override fun isEmpty ( ) : Boolean = this@asList . isEmpty ( ) override fun contains ( element : Byte ) : Boolean = this@asList . contains ( element ) override fun get ( index : Int ) : Byte = this@asList [ index ] override fun indexOf ( element : Byte ) : Int = this@asList . indexOf ( element ) override fun lastIndexOf ( element : Byte ) : Int = this@asList . lastIndexOf ( element ) } }","docstring":"/**\n * Returns a [List] that wraps the original array.\n */"} {"signature":"public actual fun ShortArray . asList ( ) : List < Short >","body":"{ return object : AbstractList < Short > ( ) , RandomAccess { override val size : Int get ( ) = this@asList . size override fun isEmpty ( ) : Boolean = this@asList . isEmpty ( ) override fun contains ( element : Short ) : Boolean = this@asList . contains ( element ) override fun get ( index : Int ) : Short = this@asList [ index ] override fun indexOf ( element : Short ) : Int = this@asList . indexOf ( element ) override fun lastIndexOf ( element : Short ) : Int = this@asList . lastIndexOf ( element ) } }","docstring":"/**\n * Returns a [List] that wraps the original array.\n */"} {"signature":"public actual fun IntArray . asList ( ) : List < Int >","body":"{ return object : AbstractList < Int > ( ) , RandomAccess { override val size : Int get ( ) = this@asList . size override fun isEmpty ( ) : Boolean = this@asList . isEmpty ( ) override fun contains ( element : Int ) : Boolean = this@asList . contains ( element ) override fun get ( index : Int ) : Int = this@asList [ index ] override fun indexOf ( element : Int ) : Int = this@asList . indexOf ( element ) override fun lastIndexOf ( element : Int ) : Int = this@asList . lastIndexOf ( element ) } }","docstring":"/**\n * Returns a [List] that wraps the original array.\n */"} {"signature":"public actual fun LongArray . asList ( ) : List < Long >","body":"{ return object : AbstractList < Long > ( ) , RandomAccess { override val size : Int get ( ) = this@asList . size override fun isEmpty ( ) : Boolean = this@asList . isEmpty ( ) override fun contains ( element : Long ) : Boolean = this@asList . contains ( element ) override fun get ( index : Int ) : Long = this@asList [ index ] override fun indexOf ( element : Long ) : Int = this@asList . indexOf ( element ) override fun lastIndexOf ( element : Long ) : Int = this@asList . lastIndexOf ( element ) } }","docstring":"/**\n * Returns a [List] that wraps the original array.\n */"} {"signature":"public actual fun FloatArray . asList ( ) : List < Float >","body":"{ return object : AbstractList < Float > ( ) , RandomAccess { override val size : Int get ( ) = this@asList . size override fun isEmpty ( ) : Boolean = this@asList . isEmpty ( ) override fun contains ( element : Float ) : Boolean = this@asList . any { it . toBits ( ) == element . toBits ( ) } override fun get ( index : Int ) : Float = this@asList [ index ] override fun indexOf ( element : Float ) : Int = this@asList . indexOfFirst { it . toBits ( ) == element . toBits ( ) } override fun lastIndexOf ( element : Float ) : Int = this@asList . indexOfLast { it . toBits ( ) == element . toBits ( ) } } }","docstring":"/**\n * Returns a [List] that wraps the original array.\n */"} {"signature":"public actual fun DoubleArray . asList ( ) : List < Double >","body":"{ return object : AbstractList < Double > ( ) , RandomAccess { override val size : Int get ( ) = this@asList . size override fun isEmpty ( ) : Boolean = this@asList . isEmpty ( ) override fun contains ( element : Double ) : Boolean = this@asList . any { it . toBits ( ) == element . toBits ( ) } override fun get ( index : Int ) : Double = this@asList [ index ] override fun indexOf ( element : Double ) : Int = this@asList . indexOfFirst { it . toBits ( ) == element . toBits ( ) } override fun lastIndexOf ( element : Double ) : Int = this@asList . indexOfLast { it . toBits ( ) == element . toBits ( ) } } }","docstring":"/**\n * Returns a [List] that wraps the original array.\n */"} {"signature":"public actual fun BooleanArray . asList ( ) : List < Boolean >","body":"{ return object : AbstractList < Boolean > ( ) , RandomAccess { override val size : Int get ( ) = this@asList . size override fun isEmpty ( ) : Boolean = this@asList . isEmpty ( ) override fun contains ( element : Boolean ) : Boolean = this@asList . contains ( element ) override fun get ( index : Int ) : Boolean = this@asList [ index ] override fun indexOf ( element : Boolean ) : Int = this@asList . indexOf ( element ) override fun lastIndexOf ( element : Boolean ) : Int = this@asList . lastIndexOf ( element ) } }","docstring":"/**\n * Returns a [List] that wraps the original array.\n */"} {"signature":"public actual fun CharArray . asList ( ) : List < Char >","body":"{ return object : AbstractList < Char > ( ) , RandomAccess { override val size : Int get ( ) = this@asList . size override fun isEmpty ( ) : Boolean = this@asList . isEmpty ( ) override fun contains ( element : Char ) : Boolean = this@asList . contains ( element ) override fun get ( index : Int ) : Char = this@asList [ index ] override fun indexOf ( element : Char ) : Int = this@asList . indexOf ( element ) override fun lastIndexOf ( element : Char ) : Int = this@asList . lastIndexOf ( element ) } }","docstring":"/**\n * Returns a [List] that wraps the original array.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . internal . LowPriorityInOverloadResolution public actual infix fun < T > Array < out T > . contentDeepEquals ( other : Array < out T > ) : Boolean","body":"{ return this . contentDeepEquals ( other ) }","docstring":"/**\n * Checks if the two specified arrays are *deeply* equal to one another.\n * \n * Two arrays are considered deeply equal if they have the same size, and elements at corresponding indices are deeply equal.\n * That is, if two corresponding elements are nested arrays, they are also compared deeply.\n * Elements of other types are compared for equality using the [equals][Any.equals] function.\n * For floating point numbers, this means `NaN` is equal to itself and `-0.0` is not equal to `0.0`.\n * \n * If any of the arrays contain themselves at any nesting level, the behavior is undefined.\n * \n * @param other the array to compare deeply with this array.\n * @return `true` if the two arrays are deeply equal, `false` otherwise.\n * \n * @sample samples.collections.Arrays.ContentOperations.contentDeepEquals\n */"} {"signature":"@ SinceKotlin ( \"\" ) public actual infix fun < T > Array < out T > ? . contentDeepEquals ( other : Array < out T > ? ) : Boolean","body":"{ return contentDeepEqualsImpl ( other ) }","docstring":"/**\n * Checks if the two specified arrays are *deeply* equal to one another.\n * \n * Two arrays are considered deeply equal if they have the same size, and elements at corresponding indices are deeply equal.\n * That is, if two corresponding elements are nested arrays, they are also compared deeply.\n * Elements of other types are compared for equality using the [equals][Any.equals] function.\n * For floating point numbers, this means `NaN` is equal to itself and `-0.0` is not equal to `0.0`.\n * \n * The arrays are also considered deeply equal if both are `null`.\n * \n * If any of the arrays contain themselves at any nesting level, the behavior is undefined.\n * \n * @param other the array to compare deeply with this array.\n * @return `true` if the two arrays are deeply equal, `false` otherwise.\n * \n * @sample samples.collections.Arrays.ContentOperations.contentDeepEquals\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . internal . LowPriorityInOverloadResolution public actual fun < T > Array < out T > . contentDeepHashCode ( ) : Int","body":"{ return this . contentDeepHashCode ( ) }","docstring":"/**\n * Returns a hash code based on the contents of this array as if it is [List].\n * Nested arrays are treated as lists too.\n * \n * If any of arrays contains itself on any nesting level the behavior is undefined.\n */"} {"signature":"@ SinceKotlin ( \"\" ) public actual fun < T > Array < out T > ? . contentDeepHashCode ( ) : Int","body":"{ return contentDeepHashCodeImpl ( ) }","docstring":"/**\n * Returns a hash code based on the contents of this array as if it is [List].\n * Nested arrays are treated as lists too.\n * \n * If any of arrays contains itself on any nesting level the behavior is undefined.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . internal . LowPriorityInOverloadResolution public actual fun < T > Array < out T > . contentDeepToString ( ) : String","body":"{ return this . contentDeepToString ( ) }","docstring":"/**\n * Returns a string representation of the contents of this array as if it is a [List].\n * Nested arrays are treated as lists too.\n * \n * If any of arrays contains itself on any nesting level that reference\n * is rendered as `\"[...]\"` to prevent recursion.\n * \n * @sample samples.collections.Arrays.ContentOperations.contentDeepToString\n */"} {"signature":"@ SinceKotlin ( \"\" ) public actual fun < T > Array < out T > ? . contentDeepToString ( ) : String","body":"{ return contentDeepToStringImpl ( ) }","docstring":"/**\n * Returns a string representation of the contents of this array as if it is a [List].\n * Nested arrays are treated as lists too.\n * \n * If any of arrays contains itself on any nesting level that reference\n * is rendered as `\"[...]\"` to prevent recursion.\n * \n * @sample samples.collections.Arrays.ContentOperations.contentDeepToString\n */"} {"signature":"@ Deprecated ( \"\" ) @ SinceKotlin ( \"\" ) @ DeprecatedSinceKotlin ( hiddenSince = \"\" ) public infix fun < T > Array < out T > . contentEquals ( other : Array < out T > ) : Boolean","body":"{ return this . contentEquals ( other ) }","docstring":"/**\n * Checks if the two specified arrays are *structurally* equal to one another.\n * \n * Two arrays are considered structurally equal if they have the same size, and elements at corresponding indices are equal.\n * Elements are compared for equality using the [equals][Any.equals] function.\n * For floating point numbers, this means `NaN` is equal to itself and `-0.0` is not equal to `0.0`.\n * \n * If the arrays contain nested arrays, use [contentDeepEquals] to recursively compare their elements.\n * \n * @param other the array to compare with this array.\n * @return `true` if the two arrays are structurally equal, `false` otherwise.\n * \n * @sample samples.collections.Arrays.ContentOperations.arrayContentEquals\n */"} {"signature":"@ Deprecated ( \"\" ) @ SinceKotlin ( \"\" ) @ DeprecatedSinceKotlin ( hiddenSince = \"\" ) public infix fun ByteArray . contentEquals ( other : ByteArray ) : Boolean","body":"{ return this . contentEquals ( other ) }","docstring":"/**\n * Checks if the two specified arrays are *structurally* equal to one another.\n * \n * Two arrays are considered structurally equal if they have the same size, and elements at corresponding indices are equal.\n * \n * @param other the array to compare with this array.\n * @return `true` if the two arrays are structurally equal, `false` otherwise.\n * \n * @sample samples.collections.Arrays.ContentOperations.intArrayContentEquals\n */"} {"signature":"@ Deprecated ( \"\" ) @ SinceKotlin ( \"\" ) @ DeprecatedSinceKotlin ( hiddenSince = \"\" ) public infix fun ShortArray . contentEquals ( other : ShortArray ) : Boolean","body":"{ return this . contentEquals ( other ) }","docstring":"/**\n * Checks if the two specified arrays are *structurally* equal to one another.\n * \n * Two arrays are considered structurally equal if they have the same size, and elements at corresponding indices are equal.\n * \n * @param other the array to compare with this array.\n * @return `true` if the two arrays are structurally equal, `false` otherwise.\n * \n * @sample samples.collections.Arrays.ContentOperations.intArrayContentEquals\n */"} {"signature":"@ Deprecated ( \"\" ) @ SinceKotlin ( \"\" ) @ DeprecatedSinceKotlin ( hiddenSince = \"\" ) public infix fun IntArray . contentEquals ( other : IntArray ) : Boolean","body":"{ return this . contentEquals ( other ) }","docstring":"/**\n * Checks if the two specified arrays are *structurally* equal to one another.\n * \n * Two arrays are considered structurally equal if they have the same size, and elements at corresponding indices are equal.\n * \n * @param other the array to compare with this array.\n * @return `true` if the two arrays are structurally equal, `false` otherwise.\n * \n * @sample samples.collections.Arrays.ContentOperations.intArrayContentEquals\n */"} {"signature":"@ Deprecated ( \"\" ) @ SinceKotlin ( \"\" ) @ DeprecatedSinceKotlin ( hiddenSince = \"\" ) public infix fun LongArray . contentEquals ( other : LongArray ) : Boolean","body":"{ return this . contentEquals ( other ) }","docstring":"/**\n * Checks if the two specified arrays are *structurally* equal to one another.\n * \n * Two arrays are considered structurally equal if they have the same size, and elements at corresponding indices are equal.\n * \n * @param other the array to compare with this array.\n * @return `true` if the two arrays are structurally equal, `false` otherwise.\n * \n * @sample samples.collections.Arrays.ContentOperations.intArrayContentEquals\n */"} {"signature":"@ Deprecated ( \"\" ) @ SinceKotlin ( \"\" ) @ DeprecatedSinceKotlin ( hiddenSince = \"\" ) public infix fun FloatArray . contentEquals ( other : FloatArray ) : Boolean","body":"{ return this . contentEquals ( other ) }","docstring":"/**\n * Checks if the two specified arrays are *structurally* equal to one another.\n * \n * Two arrays are considered structurally equal if they have the same size, and elements at corresponding indices are equal.\n * Elements are compared for equality using the [equals][Any.equals] function.\n * This means `NaN` is equal to itself and `-0.0` is not equal to `0.0`.\n * \n * @param other the array to compare with this array.\n * @return `true` if the two arrays are structurally equal, `false` otherwise.\n * \n * @sample samples.collections.Arrays.ContentOperations.doubleArrayContentEquals\n */"} {"signature":"@ Deprecated ( \"\" ) @ SinceKotlin ( \"\" ) @ DeprecatedSinceKotlin ( hiddenSince = \"\" ) public infix fun DoubleArray . contentEquals ( other : DoubleArray ) : Boolean","body":"{ return this . contentEquals ( other ) }","docstring":"/**\n * Checks if the two specified arrays are *structurally* equal to one another.\n * \n * Two arrays are considered structurally equal if they have the same size, and elements at corresponding indices are equal.\n * Elements are compared for equality using the [equals][Any.equals] function.\n * This means `NaN` is equal to itself and `-0.0` is not equal to `0.0`.\n * \n * @param other the array to compare with this array.\n * @return `true` if the two arrays are structurally equal, `false` otherwise.\n * \n * @sample samples.collections.Arrays.ContentOperations.doubleArrayContentEquals\n */"} {"signature":"@ Deprecated ( \"\" ) @ SinceKotlin ( \"\" ) @ DeprecatedSinceKotlin ( hiddenSince = \"\" ) public infix fun BooleanArray . contentEquals ( other : BooleanArray ) : Boolean","body":"{ return this . contentEquals ( other ) }","docstring":"/**\n * Checks if the two specified arrays are *structurally* equal to one another.\n * \n * Two arrays are considered structurally equal if they have the same size, and elements at corresponding indices are equal.\n * \n * @param other the array to compare with this array.\n * @return `true` if the two arrays are structurally equal, `false` otherwise.\n * \n * @sample samples.collections.Arrays.ContentOperations.booleanArrayContentEquals\n */"} {"signature":"@ Deprecated ( \"\" ) @ SinceKotlin ( \"\" ) @ DeprecatedSinceKotlin ( hiddenSince = \"\" ) public infix fun CharArray . contentEquals ( other : CharArray ) : Boolean","body":"{ return this . contentEquals ( other ) }","docstring":"/**\n * Checks if the two specified arrays are *structurally* equal to one another.\n * \n * Two arrays are considered structurally equal if they have the same size, and elements at corresponding indices are equal.\n * \n * @param other the array to compare with this array.\n * @return `true` if the two arrays are structurally equal, `false` otherwise.\n * \n * @sample samples.collections.Arrays.ContentOperations.charArrayContentEquals\n */"} {"signature":"@ SinceKotlin ( \"\" ) public actual infix fun < T > Array < out T > ? . contentEquals ( other : Array < out T > ? ) : Boolean","body":"{ if ( this === other ) return true if ( this === null || other === null ) return false if ( size != other . size ) return false for ( i in indices ) { if ( this [ i ] != other [ i ] ) return false } return true }","docstring":"/**\n * Checks if the two specified arrays are *structurally* equal to one another.\n * \n * Two arrays are considered structurally equal if they have the same size, and elements at corresponding indices are equal.\n * Elements are compared for equality using the [equals][Any.equals] function.\n * For floating point numbers, this means `NaN` is equal to itself and `-0.0` is not equal to `0.0`.\n * \n * The arrays are also considered structurally equal if both are `null`.\n * \n * If the arrays contain nested arrays, use [contentDeepEquals] to recursively compare their elements.\n * \n * @param other the array to compare with this array.\n * @return `true` if the two arrays are structurally equal, `false` otherwise.\n * \n * @sample samples.collections.Arrays.ContentOperations.arrayContentEquals\n */"} {"signature":"@ SinceKotlin ( \"\" ) public actual infix fun ByteArray ? . contentEquals ( other : ByteArray ? ) : Boolean","body":"{ if ( this === other ) return true if ( this === null || other === null ) return false if ( size != other . size ) return false for ( i in indices ) { if ( this [ i ] != other [ i ] ) return false } return true }","docstring":"/**\n * Checks if the two specified arrays are *structurally* equal to one another.\n * \n * Two arrays are considered structurally equal if they have the same size, and elements at corresponding indices are equal.\n * \n * The arrays are also considered structurally equal if both are `null`.\n * \n * @param other the array to compare with this array.\n * @return `true` if the two arrays are structurally equal, `false` otherwise.\n * \n * @sample samples.collections.Arrays.ContentOperations.intArrayContentEquals\n */"} {"signature":"@ SinceKotlin ( \"\" ) public actual infix fun ShortArray ? . contentEquals ( other : ShortArray ? ) : Boolean","body":"{ if ( this === other ) return true if ( this === null || other === null ) return false if ( size != other . size ) return false for ( i in indices ) { if ( this [ i ] != other [ i ] ) return false } return true }","docstring":"/**\n * Checks if the two specified arrays are *structurally* equal to one another.\n * \n * Two arrays are considered structurally equal if they have the same size, and elements at corresponding indices are equal.\n * \n * The arrays are also considered structurally equal if both are `null`.\n * \n * @param other the array to compare with this array.\n * @return `true` if the two arrays are structurally equal, `false` otherwise.\n * \n * @sample samples.collections.Arrays.ContentOperations.intArrayContentEquals\n */"} {"signature":"@ SinceKotlin ( \"\" ) public actual infix fun IntArray ? . contentEquals ( other : IntArray ? ) : Boolean","body":"{ if ( this === other ) return true if ( this === null || other === null ) return false if ( size != other . size ) return false for ( i in indices ) { if ( this [ i ] != other [ i ] ) return false } return true }","docstring":"/**\n * Checks if the two specified arrays are *structurally* equal to one another.\n * \n * Two arrays are considered structurally equal if they have the same size, and elements at corresponding indices are equal.\n * \n * The arrays are also considered structurally equal if both are `null`.\n * \n * @param other the array to compare with this array.\n * @return `true` if the two arrays are structurally equal, `false` otherwise.\n * \n * @sample samples.collections.Arrays.ContentOperations.intArrayContentEquals\n */"} {"signature":"@ SinceKotlin ( \"\" ) public actual infix fun LongArray ? . contentEquals ( other : LongArray ? ) : Boolean","body":"{ if ( this === other ) return true if ( this === null || other === null ) return false if ( size != other . size ) return false for ( i in indices ) { if ( this [ i ] != other [ i ] ) return false } return true }","docstring":"/**\n * Checks if the two specified arrays are *structurally* equal to one another.\n * \n * Two arrays are considered structurally equal if they have the same size, and elements at corresponding indices are equal.\n * \n * The arrays are also considered structurally equal if both are `null`.\n * \n * @param other the array to compare with this array.\n * @return `true` if the two arrays are structurally equal, `false` otherwise.\n * \n * @sample samples.collections.Arrays.ContentOperations.intArrayContentEquals\n */"} {"signature":"@ SinceKotlin ( \"\" ) public actual infix fun FloatArray ? . contentEquals ( other : FloatArray ? ) : Boolean","body":"{ if ( this === other ) return true if ( this === null || other === null ) return false if ( size != other . size ) return false for ( i in indices ) { if ( ! this [ i ] . equals ( other [ i ] ) ) return false } return true }","docstring":"/**\n * Checks if the two specified arrays are *structurally* equal to one another.\n * \n * Two arrays are considered structurally equal if they have the same size, and elements at corresponding indices are equal.\n * Elements are compared for equality using the [equals][Any.equals] function.\n * This means `NaN` is equal to itself and `-0.0` is not equal to `0.0`.\n * \n * The arrays are also considered structurally equal if both are `null`.\n * \n * @param other the array to compare with this array.\n * @return `true` if the two arrays are structurally equal, `false` otherwise.\n * \n * @sample samples.collections.Arrays.ContentOperations.doubleArrayContentEquals\n */"} {"signature":"@ SinceKotlin ( \"\" ) public actual infix fun DoubleArray ? . contentEquals ( other : DoubleArray ? ) : Boolean","body":"{ if ( this === other ) return true if ( this === null || other === null ) return false if ( size != other . size ) return false for ( i in indices ) { if ( ! this [ i ] . equals ( other [ i ] ) ) return false } return true }","docstring":"/**\n * Checks if the two specified arrays are *structurally* equal to one another.\n * \n * Two arrays are considered structurally equal if they have the same size, and elements at corresponding indices are equal.\n * Elements are compared for equality using the [equals][Any.equals] function.\n * This means `NaN` is equal to itself and `-0.0` is not equal to `0.0`.\n * \n * The arrays are also considered structurally equal if both are `null`.\n * \n * @param other the array to compare with this array.\n * @return `true` if the two arrays are structurally equal, `false` otherwise.\n * \n * @sample samples.collections.Arrays.ContentOperations.doubleArrayContentEquals\n */"} {"signature":"@ SinceKotlin ( \"\" ) public actual infix fun BooleanArray ? . contentEquals ( other : BooleanArray ? ) : Boolean","body":"{ if ( this === other ) return true if ( this === null || other === null ) return false if ( size != other . size ) return false for ( i in indices ) { if ( this [ i ] != other [ i ] ) return false } return true }","docstring":"/**\n * Checks if the two specified arrays are *structurally* equal to one another.\n * \n * Two arrays are considered structurally equal if they have the same size, and elements at corresponding indices are equal.\n * \n * The arrays are also considered structurally equal if both are `null`.\n * \n * @param other the array to compare with this array.\n * @return `true` if the two arrays are structurally equal, `false` otherwise.\n * \n * @sample samples.collections.Arrays.ContentOperations.booleanArrayContentEquals\n */"} {"signature":"@ SinceKotlin ( \"\" ) public actual infix fun CharArray ? . contentEquals ( other : CharArray ? ) : Boolean","body":"{ if ( this === other ) return true if ( this === null || other === null ) return false if ( size != other . size ) return false for ( i in indices ) { if ( this [ i ] != other [ i ] ) return false } return true }","docstring":"/**\n * Checks if the two specified arrays are *structurally* equal to one another.\n * \n * Two arrays are considered structurally equal if they have the same size, and elements at corresponding indices are equal.\n * \n * The arrays are also considered structurally equal if both are `null`.\n * \n * @param other the array to compare with this array.\n * @return `true` if the two arrays are structurally equal, `false` otherwise.\n * \n * @sample samples.collections.Arrays.ContentOperations.charArrayContentEquals\n */"} {"signature":"@ Deprecated ( \"\" ) @ SinceKotlin ( \"\" ) @ DeprecatedSinceKotlin ( hiddenSince = \"\" ) public fun < T > Array < out T > . contentHashCode ( ) : Int","body":"{ return this . contentHashCode ( ) }","docstring":"/**\n * Returns a hash code based on the contents of this array as if it is [List].\n */"} {"signature":"@ Deprecated ( \"\" ) @ SinceKotlin ( \"\" ) @ DeprecatedSinceKotlin ( hiddenSince = \"\" ) public fun ByteArray . contentHashCode ( ) : Int","body":"{ return this . contentHashCode ( ) }","docstring":"/**\n * Returns a hash code based on the contents of this array as if it is [List].\n */"} {"signature":"@ Deprecated ( \"\" ) @ SinceKotlin ( \"\" ) @ DeprecatedSinceKotlin ( hiddenSince = \"\" ) public fun ShortArray . contentHashCode ( ) : Int","body":"{ return this . contentHashCode ( ) }","docstring":"/**\n * Returns a hash code based on the contents of this array as if it is [List].\n */"} {"signature":"@ Deprecated ( \"\" ) @ SinceKotlin ( \"\" ) @ DeprecatedSinceKotlin ( hiddenSince = \"\" ) public fun IntArray . contentHashCode ( ) : Int","body":"{ return this . contentHashCode ( ) }","docstring":"/**\n * Returns a hash code based on the contents of this array as if it is [List].\n */"} {"signature":"@ Deprecated ( \"\" ) @ SinceKotlin ( \"\" ) @ DeprecatedSinceKotlin ( hiddenSince = \"\" ) public fun LongArray . contentHashCode ( ) : Int","body":"{ return this . contentHashCode ( ) }","docstring":"/**\n * Returns a hash code based on the contents of this array as if it is [List].\n */"} {"signature":"@ Deprecated ( \"\" ) @ SinceKotlin ( \"\" ) @ DeprecatedSinceKotlin ( hiddenSince = \"\" ) public fun FloatArray . contentHashCode ( ) : Int","body":"{ return this . contentHashCode ( ) }","docstring":"/**\n * Returns a hash code based on the contents of this array as if it is [List].\n */"} {"signature":"@ Deprecated ( \"\" ) @ SinceKotlin ( \"\" ) @ DeprecatedSinceKotlin ( hiddenSince = \"\" ) public fun DoubleArray . contentHashCode ( ) : Int","body":"{ return this . contentHashCode ( ) }","docstring":"/**\n * Returns a hash code based on the contents of this array as if it is [List].\n */"} {"signature":"@ Deprecated ( \"\" ) @ SinceKotlin ( \"\" ) @ DeprecatedSinceKotlin ( hiddenSince = \"\" ) public fun BooleanArray . contentHashCode ( ) : Int","body":"{ return this . contentHashCode ( ) }","docstring":"/**\n * Returns a hash code based on the contents of this array as if it is [List].\n */"} {"signature":"@ Deprecated ( \"\" ) @ SinceKotlin ( \"\" ) @ DeprecatedSinceKotlin ( hiddenSince = \"\" ) public fun CharArray . contentHashCode ( ) : Int","body":"{ return this . contentHashCode ( ) }","docstring":"/**\n * Returns a hash code based on the contents of this array as if it is [List].\n */"} {"signature":"@ SinceKotlin ( \"\" ) public actual fun < T > Array < out T > ? . contentHashCode ( ) : Int","body":"{ if ( this === null ) return var result = for ( element in this ) result = * result + element . hashCode ( ) return result }","docstring":"/**\n * Returns a hash code based on the contents of this array as if it is [List].\n */"} {"signature":"@ SinceKotlin ( \"\" ) public actual fun ByteArray ? . contentHashCode ( ) : Int","body":"{ if ( this === null ) return var result = for ( element in this ) result = * result + element . hashCode ( ) return result }","docstring":"/**\n * Returns a hash code based on the contents of this array as if it is [List].\n */"} {"signature":"@ SinceKotlin ( \"\" ) public actual fun ShortArray ? . contentHashCode ( ) : Int","body":"{ if ( this === null ) return var result = for ( element in this ) result = * result + element . hashCode ( ) return result }","docstring":"/**\n * Returns a hash code based on the contents of this array as if it is [List].\n */"} {"signature":"@ SinceKotlin ( \"\" ) public actual fun IntArray ? . contentHashCode ( ) : Int","body":"{ if ( this === null ) return var result = for ( element in this ) result = * result + element . hashCode ( ) return result }","docstring":"/**\n * Returns a hash code based on the contents of this array as if it is [List].\n */"} {"signature":"@ SinceKotlin ( \"\" ) public actual fun LongArray ? . contentHashCode ( ) : Int","body":"{ if ( this === null ) return var result = for ( element in this ) result = * result + element . hashCode ( ) return result }","docstring":"/**\n * Returns a hash code based on the contents of this array as if it is [List].\n */"} {"signature":"@ SinceKotlin ( \"\" ) public actual fun FloatArray ? . contentHashCode ( ) : Int","body":"{ if ( this === null ) return var result = for ( element in this ) result = * result + element . hashCode ( ) return result }","docstring":"/**\n * Returns a hash code based on the contents of this array as if it is [List].\n */"} {"signature":"@ SinceKotlin ( \"\" ) public actual fun DoubleArray ? . contentHashCode ( ) : Int","body":"{ if ( this === null ) return var result = for ( element in this ) result = * result + element . hashCode ( ) return result }","docstring":"/**\n * Returns a hash code based on the contents of this array as if it is [List].\n */"} {"signature":"@ SinceKotlin ( \"\" ) public actual fun BooleanArray ? . contentHashCode ( ) : Int","body":"{ if ( this === null ) return var result = for ( element in this ) result = * result + element . hashCode ( ) return result }","docstring":"/**\n * Returns a hash code based on the contents of this array as if it is [List].\n */"} {"signature":"@ SinceKotlin ( \"\" ) public actual fun CharArray ? . contentHashCode ( ) : Int","body":"{ if ( this === null ) return var result = for ( element in this ) result = * result + element . hashCode ( ) return result }","docstring":"/**\n * Returns a hash code based on the contents of this array as if it is [List].\n */"} {"signature":"@ Deprecated ( \"\" ) @ SinceKotlin ( \"\" ) @ DeprecatedSinceKotlin ( hiddenSince = \"\" ) public fun < T > Array < out T > . contentToString ( ) : String","body":"{ return this . contentToString ( ) }","docstring":"/**\n * Returns a string representation of the contents of the specified array as if it is [List].\n * \n * @sample samples.collections.Arrays.ContentOperations.contentToString\n */"} {"signature":"@ Deprecated ( \"\" ) @ SinceKotlin ( \"\" ) @ DeprecatedSinceKotlin ( hiddenSince = \"\" ) public fun ByteArray . contentToString ( ) : String","body":"{ return this . contentToString ( ) }","docstring":"/**\n * Returns a string representation of the contents of the specified array as if it is [List].\n * \n * @sample samples.collections.Arrays.ContentOperations.contentToString\n */"} {"signature":"@ Deprecated ( \"\" ) @ SinceKotlin ( \"\" ) @ DeprecatedSinceKotlin ( hiddenSince = \"\" ) public fun ShortArray . contentToString ( ) : String","body":"{ return this . contentToString ( ) }","docstring":"/**\n * Returns a string representation of the contents of the specified array as if it is [List].\n * \n * @sample samples.collections.Arrays.ContentOperations.contentToString\n */"} {"signature":"@ Deprecated ( \"\" ) @ SinceKotlin ( \"\" ) @ DeprecatedSinceKotlin ( hiddenSince = \"\" ) public fun IntArray . contentToString ( ) : String","body":"{ return this . contentToString ( ) }","docstring":"/**\n * Returns a string representation of the contents of the specified array as if it is [List].\n * \n * @sample samples.collections.Arrays.ContentOperations.contentToString\n */"} {"signature":"@ Deprecated ( \"\" ) @ SinceKotlin ( \"\" ) @ DeprecatedSinceKotlin ( hiddenSince = \"\" ) public fun LongArray . contentToString ( ) : String","body":"{ return this . contentToString ( ) }","docstring":"/**\n * Returns a string representation of the contents of the specified array as if it is [List].\n * \n * @sample samples.collections.Arrays.ContentOperations.contentToString\n */"} {"signature":"@ Deprecated ( \"\" ) @ SinceKotlin ( \"\" ) @ DeprecatedSinceKotlin ( hiddenSince = \"\" ) public fun FloatArray . contentToString ( ) : String","body":"{ return this . contentToString ( ) }","docstring":"/**\n * Returns a string representation of the contents of the specified array as if it is [List].\n * \n * @sample samples.collections.Arrays.ContentOperations.contentToString\n */"} {"signature":"@ Deprecated ( \"\" ) @ SinceKotlin ( \"\" ) @ DeprecatedSinceKotlin ( hiddenSince = \"\" ) public fun DoubleArray . contentToString ( ) : String","body":"{ return this . contentToString ( ) }","docstring":"/**\n * Returns a string representation of the contents of the specified array as if it is [List].\n * \n * @sample samples.collections.Arrays.ContentOperations.contentToString\n */"} {"signature":"@ Deprecated ( \"\" ) @ SinceKotlin ( \"\" ) @ DeprecatedSinceKotlin ( hiddenSince = \"\" ) public fun BooleanArray . contentToString ( ) : String","body":"{ return this . contentToString ( ) }","docstring":"/**\n * Returns a string representation of the contents of the specified array as if it is [List].\n * \n * @sample samples.collections.Arrays.ContentOperations.contentToString\n */"} {"signature":"@ Deprecated ( \"\" ) @ SinceKotlin ( \"\" ) @ DeprecatedSinceKotlin ( hiddenSince = \"\" ) public fun CharArray . contentToString ( ) : String","body":"{ return this . contentToString ( ) }","docstring":"/**\n * Returns a string representation of the contents of the specified array as if it is [List].\n * \n * @sample samples.collections.Arrays.ContentOperations.contentToString\n */"} {"signature":"@ SinceKotlin ( \"\" ) public actual fun < T > Array < out T > ? . contentToString ( ) : String","body":"{ return this ? . joinToString ( \"\" , \"\" , \"\" ) ? : \"\" }","docstring":"/**\n * Returns a string representation of the contents of the specified array as if it is [List].\n * \n * @sample samples.collections.Arrays.ContentOperations.contentToString\n */"} {"signature":"@ SinceKotlin ( \"\" ) public actual fun ByteArray ? . contentToString ( ) : String","body":"{ return this ? . joinToString ( \"\" , \"\" , \"\" ) ? : \"\" }","docstring":"/**\n * Returns a string representation of the contents of the specified array as if it is [List].\n * \n * @sample samples.collections.Arrays.ContentOperations.contentToString\n */"} {"signature":"@ SinceKotlin ( \"\" ) public actual fun ShortArray ? . contentToString ( ) : String","body":"{ return this ? . joinToString ( \"\" , \"\" , \"\" ) ? : \"\" }","docstring":"/**\n * Returns a string representation of the contents of the specified array as if it is [List].\n * \n * @sample samples.collections.Arrays.ContentOperations.contentToString\n */"} {"signature":"@ SinceKotlin ( \"\" ) public actual fun IntArray ? . contentToString ( ) : String","body":"{ return this ? . joinToString ( \"\" , \"\" , \"\" ) ? : \"\" }","docstring":"/**\n * Returns a string representation of the contents of the specified array as if it is [List].\n * \n * @sample samples.collections.Arrays.ContentOperations.contentToString\n */"} {"signature":"@ SinceKotlin ( \"\" ) public actual fun LongArray ? . contentToString ( ) : String","body":"{ return this ? . joinToString ( \"\" , \"\" , \"\" ) ? : \"\" }","docstring":"/**\n * Returns a string representation of the contents of the specified array as if it is [List].\n * \n * @sample samples.collections.Arrays.ContentOperations.contentToString\n */"} {"signature":"@ SinceKotlin ( \"\" ) public actual fun FloatArray ? . contentToString ( ) : String","body":"{ return this ? . joinToString ( \"\" , \"\" , \"\" ) ? : \"\" }","docstring":"/**\n * Returns a string representation of the contents of the specified array as if it is [List].\n * \n * @sample samples.collections.Arrays.ContentOperations.contentToString\n */"} {"signature":"@ SinceKotlin ( \"\" ) public actual fun DoubleArray ? . contentToString ( ) : String","body":"{ return this ? . joinToString ( \"\" , \"\" , \"\" ) ? : \"\" }","docstring":"/**\n * Returns a string representation of the contents of the specified array as if it is [List].\n * \n * @sample samples.collections.Arrays.ContentOperations.contentToString\n */"} {"signature":"@ SinceKotlin ( \"\" ) public actual fun BooleanArray ? . contentToString ( ) : String","body":"{ return this ? . joinToString ( \"\" , \"\" , \"\" ) ? : \"\" }","docstring":"/**\n * Returns a string representation of the contents of the specified array as if it is [List].\n * \n * @sample samples.collections.Arrays.ContentOperations.contentToString\n */"} {"signature":"@ SinceKotlin ( \"\" ) public actual fun CharArray ? . contentToString ( ) : String","body":"{ return this ? . joinToString ( \"\" , \"\" , \"\" ) ? : \"\" }","docstring":"/**\n * Returns a string representation of the contents of the specified array as if it is [List].\n * \n * @sample samples.collections.Arrays.ContentOperations.contentToString\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ Suppress ( \"\" ) public actual fun < T > Array < out T > . copyInto ( destination : Array < T > , destinationOffset : Int = , startIndex : Int = , endIndex : Int = size ) : Array < T >","body":"{ AbstractList . checkRangeIndexes ( startIndex , endIndex , this . size ) val rangeSize = endIndex - startIndex AbstractList . checkRangeIndexes ( destinationOffset , destinationOffset + rangeSize , destination . size ) kotlin . wasm . internal . copyWasmArray ( this . storage , destination . storage , startIndex , destinationOffset , rangeSize ) return destination }","docstring":"/**\n * Copies this array or its subrange into the [destination] array and returns that array.\n * \n * It's allowed to pass the same array in the [destination] and even specify the subrange so that it overlaps with the destination range.\n * \n * @param destination the array to copy to.\n * @param destinationOffset the position in the [destination] array to copy to, 0 by default.\n * @param startIndex the beginning (inclusive) of the subrange to copy, 0 by default.\n * @param endIndex the end (exclusive) of the subrange to copy, size of this array by default.\n * \n * @throws IndexOutOfBoundsException or [IllegalArgumentException] when [startIndex] or [endIndex] is out of range of this array 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 * \n * @return the [destination] array.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ Suppress ( \"\" ) public actual fun ByteArray . copyInto ( destination : ByteArray , destinationOffset : Int = , startIndex : Int = , endIndex : Int = size ) : ByteArray","body":"{ AbstractList . checkRangeIndexes ( startIndex , endIndex , this . size ) val rangeSize = endIndex - startIndex AbstractList . checkRangeIndexes ( destinationOffset , destinationOffset + rangeSize , destination . size ) kotlin . wasm . internal . copyWasmArray ( this . storage , destination . storage , startIndex , destinationOffset , rangeSize ) return destination }","docstring":"/**\n * Copies this array or its subrange into the [destination] array and returns that array.\n * \n * It's allowed to pass the same array in the [destination] and even specify the subrange so that it overlaps with the destination range.\n * \n * @param destination the array to copy to.\n * @param destinationOffset the position in the [destination] array to copy to, 0 by default.\n * @param startIndex the beginning (inclusive) of the subrange to copy, 0 by default.\n * @param endIndex the end (exclusive) of the subrange to copy, size of this array by default.\n * \n * @throws IndexOutOfBoundsException or [IllegalArgumentException] when [startIndex] or [endIndex] is out of range of this array 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 * \n * @return the [destination] array.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ Suppress ( \"\" ) public actual fun ShortArray . copyInto ( destination : ShortArray , destinationOffset : Int = , startIndex : Int = , endIndex : Int = size ) : ShortArray","body":"{ AbstractList . checkRangeIndexes ( startIndex , endIndex , this . size ) val rangeSize = endIndex - startIndex AbstractList . checkRangeIndexes ( destinationOffset , destinationOffset + rangeSize , destination . size ) kotlin . wasm . internal . copyWasmArray ( this . storage , destination . storage , startIndex , destinationOffset , rangeSize ) return destination }","docstring":"/**\n * Copies this array or its subrange into the [destination] array and returns that array.\n * \n * It's allowed to pass the same array in the [destination] and even specify the subrange so that it overlaps with the destination range.\n * \n * @param destination the array to copy to.\n * @param destinationOffset the position in the [destination] array to copy to, 0 by default.\n * @param startIndex the beginning (inclusive) of the subrange to copy, 0 by default.\n * @param endIndex the end (exclusive) of the subrange to copy, size of this array by default.\n * \n * @throws IndexOutOfBoundsException or [IllegalArgumentException] when [startIndex] or [endIndex] is out of range of this array 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 * \n * @return the [destination] array.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ Suppress ( \"\" ) public actual fun IntArray . copyInto ( destination : IntArray , destinationOffset : Int = , startIndex : Int = , endIndex : Int = size ) : IntArray","body":"{ AbstractList . checkRangeIndexes ( startIndex , endIndex , this . size ) val rangeSize = endIndex - startIndex AbstractList . checkRangeIndexes ( destinationOffset , destinationOffset + rangeSize , destination . size ) kotlin . wasm . internal . copyWasmArray ( this . storage , destination . storage , startIndex , destinationOffset , rangeSize ) return destination }","docstring":"/**\n * Copies this array or its subrange into the [destination] array and returns that array.\n * \n * It's allowed to pass the same array in the [destination] and even specify the subrange so that it overlaps with the destination range.\n * \n * @param destination the array to copy to.\n * @param destinationOffset the position in the [destination] array to copy to, 0 by default.\n * @param startIndex the beginning (inclusive) of the subrange to copy, 0 by default.\n * @param endIndex the end (exclusive) of the subrange to copy, size of this array by default.\n * \n * @throws IndexOutOfBoundsException or [IllegalArgumentException] when [startIndex] or [endIndex] is out of range of this array 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 * \n * @return the [destination] array.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ Suppress ( \"\" ) public actual fun LongArray . copyInto ( destination : LongArray , destinationOffset : Int = , startIndex : Int = , endIndex : Int = size ) : LongArray","body":"{ AbstractList . checkRangeIndexes ( startIndex , endIndex , this . size ) val rangeSize = endIndex - startIndex AbstractList . checkRangeIndexes ( destinationOffset , destinationOffset + rangeSize , destination . size ) kotlin . wasm . internal . copyWasmArray ( this . storage , destination . storage , startIndex , destinationOffset , rangeSize ) return destination }","docstring":"/**\n * Copies this array or its subrange into the [destination] array and returns that array.\n * \n * It's allowed to pass the same array in the [destination] and even specify the subrange so that it overlaps with the destination range.\n * \n * @param destination the array to copy to.\n * @param destinationOffset the position in the [destination] array to copy to, 0 by default.\n * @param startIndex the beginning (inclusive) of the subrange to copy, 0 by default.\n * @param endIndex the end (exclusive) of the subrange to copy, size of this array by default.\n * \n * @throws IndexOutOfBoundsException or [IllegalArgumentException] when [startIndex] or [endIndex] is out of range of this array 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 * \n * @return the [destination] array.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ Suppress ( \"\" ) public actual fun FloatArray . copyInto ( destination : FloatArray , destinationOffset : Int = , startIndex : Int = , endIndex : Int = size ) : FloatArray","body":"{ AbstractList . checkRangeIndexes ( startIndex , endIndex , this . size ) val rangeSize = endIndex - startIndex AbstractList . checkRangeIndexes ( destinationOffset , destinationOffset + rangeSize , destination . size ) kotlin . wasm . internal . copyWasmArray ( this . storage , destination . storage , startIndex , destinationOffset , rangeSize ) return destination }","docstring":"/**\n * Copies this array or its subrange into the [destination] array and returns that array.\n * \n * It's allowed to pass the same array in the [destination] and even specify the subrange so that it overlaps with the destination range.\n * \n * @param destination the array to copy to.\n * @param destinationOffset the position in the [destination] array to copy to, 0 by default.\n * @param startIndex the beginning (inclusive) of the subrange to copy, 0 by default.\n * @param endIndex the end (exclusive) of the subrange to copy, size of this array by default.\n * \n * @throws IndexOutOfBoundsException or [IllegalArgumentException] when [startIndex] or [endIndex] is out of range of this array 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 * \n * @return the [destination] array.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ Suppress ( \"\" ) public actual fun DoubleArray . copyInto ( destination : DoubleArray , destinationOffset : Int = , startIndex : Int = , endIndex : Int = size ) : DoubleArray","body":"{ AbstractList . checkRangeIndexes ( startIndex , endIndex , this . size ) val rangeSize = endIndex - startIndex AbstractList . checkRangeIndexes ( destinationOffset , destinationOffset + rangeSize , destination . size ) kotlin . wasm . internal . copyWasmArray ( this . storage , destination . storage , startIndex , destinationOffset , rangeSize ) return destination }","docstring":"/**\n * Copies this array or its subrange into the [destination] array and returns that array.\n * \n * It's allowed to pass the same array in the [destination] and even specify the subrange so that it overlaps with the destination range.\n * \n * @param destination the array to copy to.\n * @param destinationOffset the position in the [destination] array to copy to, 0 by default.\n * @param startIndex the beginning (inclusive) of the subrange to copy, 0 by default.\n * @param endIndex the end (exclusive) of the subrange to copy, size of this array by default.\n * \n * @throws IndexOutOfBoundsException or [IllegalArgumentException] when [startIndex] or [endIndex] is out of range of this array 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 * \n * @return the [destination] array.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ Suppress ( \"\" ) public actual fun BooleanArray . copyInto ( destination : BooleanArray , destinationOffset : Int = , startIndex : Int = , endIndex : Int = size ) : BooleanArray","body":"{ AbstractList . checkRangeIndexes ( startIndex , endIndex , this . size ) val rangeSize = endIndex - startIndex AbstractList . checkRangeIndexes ( destinationOffset , destinationOffset + rangeSize , destination . size ) kotlin . wasm . internal . copyWasmArray ( this . storage , destination . storage , startIndex , destinationOffset , rangeSize ) return destination }","docstring":"/**\n * Copies this array or its subrange into the [destination] array and returns that array.\n * \n * It's allowed to pass the same array in the [destination] and even specify the subrange so that it overlaps with the destination range.\n * \n * @param destination the array to copy to.\n * @param destinationOffset the position in the [destination] array to copy to, 0 by default.\n * @param startIndex the beginning (inclusive) of the subrange to copy, 0 by default.\n * @param endIndex the end (exclusive) of the subrange to copy, size of this array by default.\n * \n * @throws IndexOutOfBoundsException or [IllegalArgumentException] when [startIndex] or [endIndex] is out of range of this array 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 * \n * @return the [destination] array.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ Suppress ( \"\" ) public actual fun CharArray . copyInto ( destination : CharArray , destinationOffset : Int = , startIndex : Int = , endIndex : Int = size ) : CharArray","body":"{ AbstractList . checkRangeIndexes ( startIndex , endIndex , this . size ) val rangeSize = endIndex - startIndex AbstractList . checkRangeIndexes ( destinationOffset , destinationOffset + rangeSize , destination . size ) kotlin . wasm . internal . copyWasmArray ( this . storage , destination . storage , startIndex , destinationOffset , rangeSize ) return destination }","docstring":"/**\n * Copies this array or its subrange into the [destination] array and returns that array.\n * \n * It's allowed to pass the same array in the [destination] and even specify the subrange so that it overlaps with the destination range.\n * \n * @param destination the array to copy to.\n * @param destinationOffset the position in the [destination] array to copy to, 0 by default.\n * @param startIndex the beginning (inclusive) of the subrange to copy, 0 by default.\n * @param endIndex the end (exclusive) of the subrange to copy, size of this array by default.\n * \n * @throws IndexOutOfBoundsException or [IllegalArgumentException] when [startIndex] or [endIndex] is out of range of this array 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 * \n * @return the [destination] array.\n */"} {"signature":"public actual fun < T > Array < T > . copyOf ( ) : Array < T >","body":"{ return this . copyOfUninitializedElements ( size ) }","docstring":"/**\n * Returns new array which is a copy of the original array.\n * \n * @sample samples.collections.Arrays.CopyOfOperations.copyOf\n */"} {"signature":"public actual fun ByteArray . copyOf ( ) : ByteArray","body":"{ return this . copyOfUninitializedElements ( size ) }","docstring":"/**\n * Returns new array which is a copy of the original array.\n * \n * @sample samples.collections.Arrays.CopyOfOperations.copyOf\n */"} {"signature":"public actual fun ShortArray . copyOf ( ) : ShortArray","body":"{ return this . copyOfUninitializedElements ( size ) }","docstring":"/**\n * Returns new array which is a copy of the original array.\n * \n * @sample samples.collections.Arrays.CopyOfOperations.copyOf\n */"} {"signature":"public actual fun IntArray . copyOf ( ) : IntArray","body":"{ return this . copyOfUninitializedElements ( size ) }","docstring":"/**\n * Returns new array which is a copy of the original array.\n * \n * @sample samples.collections.Arrays.CopyOfOperations.copyOf\n */"} {"signature":"public actual fun LongArray . copyOf ( ) : LongArray","body":"{ return this . copyOfUninitializedElements ( size ) }","docstring":"/**\n * Returns new array which is a copy of the original array.\n * \n * @sample samples.collections.Arrays.CopyOfOperations.copyOf\n */"} {"signature":"public actual fun FloatArray . copyOf ( ) : FloatArray","body":"{ return this . copyOfUninitializedElements ( size ) }","docstring":"/**\n * Returns new array which is a copy of the original array.\n * \n * @sample samples.collections.Arrays.CopyOfOperations.copyOf\n */"} {"signature":"public actual fun DoubleArray . copyOf ( ) : DoubleArray","body":"{ return this . copyOfUninitializedElements ( size ) }","docstring":"/**\n * Returns new array which is a copy of the original array.\n * \n * @sample samples.collections.Arrays.CopyOfOperations.copyOf\n */"} {"signature":"public actual fun BooleanArray . copyOf ( ) : BooleanArray","body":"{ return this . copyOfUninitializedElements ( size ) }","docstring":"/**\n * Returns new array which is a copy of the original array.\n * \n * @sample samples.collections.Arrays.CopyOfOperations.copyOf\n */"} {"signature":"public actual fun CharArray . copyOf ( ) : CharArray","body":"{ return this . copyOfUninitializedElements ( size ) }","docstring":"/**\n * Returns new array which is a copy of the original array.\n * \n * @sample samples.collections.Arrays.CopyOfOperations.copyOf\n */"} {"signature":"public actual fun ByteArray . copyOf ( newSize : Int ) : ByteArray","body":"{ return this . copyOfUninitializedElements ( newSize ) }","docstring":"/**\n * Returns new array which is a copy of the original array, resized to the given [newSize].\n * The copy is either truncated or padded at the end with zero values if necessary.\n * \n * - If [newSize] is less than the size of the original array, the copy array is truncated to the [newSize].\n * - If [newSize] is greater than the size of the original array, the extra elements in the copy array are filled with zero values.\n * \n * @sample samples.collections.Arrays.CopyOfOperations.resizedPrimitiveCopyOf\n */"} {"signature":"public actual fun ShortArray . copyOf ( newSize : Int ) : ShortArray","body":"{ return this . copyOfUninitializedElements ( newSize ) }","docstring":"/**\n * Returns new array which is a copy of the original array, resized to the given [newSize].\n * The copy is either truncated or padded at the end with zero values if necessary.\n * \n * - If [newSize] is less than the size of the original array, the copy array is truncated to the [newSize].\n * - If [newSize] is greater than the size of the original array, the extra elements in the copy array are filled with zero values.\n * \n * @sample samples.collections.Arrays.CopyOfOperations.resizedPrimitiveCopyOf\n */"} {"signature":"public actual fun IntArray . copyOf ( newSize : Int ) : IntArray","body":"{ return this . copyOfUninitializedElements ( newSize ) }","docstring":"/**\n * Returns new array which is a copy of the original array, resized to the given [newSize].\n * The copy is either truncated or padded at the end with zero values if necessary.\n * \n * - If [newSize] is less than the size of the original array, the copy array is truncated to the [newSize].\n * - If [newSize] is greater than the size of the original array, the extra elements in the copy array are filled with zero values.\n * \n * @sample samples.collections.Arrays.CopyOfOperations.resizedPrimitiveCopyOf\n */"} {"signature":"public actual fun LongArray . copyOf ( newSize : Int ) : LongArray","body":"{ return this . copyOfUninitializedElements ( newSize ) }","docstring":"/**\n * Returns new array which is a copy of the original array, resized to the given [newSize].\n * The copy is either truncated or padded at the end with zero values if necessary.\n * \n * - If [newSize] is less than the size of the original array, the copy array is truncated to the [newSize].\n * - If [newSize] is greater than the size of the original array, the extra elements in the copy array are filled with zero values.\n * \n * @sample samples.collections.Arrays.CopyOfOperations.resizedPrimitiveCopyOf\n */"} {"signature":"public actual fun FloatArray . copyOf ( newSize : Int ) : FloatArray","body":"{ return this . copyOfUninitializedElements ( newSize ) }","docstring":"/**\n * Returns new array which is a copy of the original array, resized to the given [newSize].\n * The copy is either truncated or padded at the end with zero values if necessary.\n * \n * - If [newSize] is less than the size of the original array, the copy array is truncated to the [newSize].\n * - If [newSize] is greater than the size of the original array, the extra elements in the copy array are filled with zero values.\n * \n * @sample samples.collections.Arrays.CopyOfOperations.resizedPrimitiveCopyOf\n */"} {"signature":"public actual fun DoubleArray . copyOf ( newSize : Int ) : DoubleArray","body":"{ return this . copyOfUninitializedElements ( newSize ) }","docstring":"/**\n * Returns new array which is a copy of the original array, resized to the given [newSize].\n * The copy is either truncated or padded at the end with zero values if necessary.\n * \n * - If [newSize] is less than the size of the original array, the copy array is truncated to the [newSize].\n * - If [newSize] is greater than the size of the original array, the extra elements in the copy array are filled with zero values.\n * \n * @sample samples.collections.Arrays.CopyOfOperations.resizedPrimitiveCopyOf\n */"} {"signature":"public actual fun BooleanArray . copyOf ( newSize : Int ) : BooleanArray","body":"{ return this . copyOfUninitializedElements ( newSize ) }","docstring":"/**\n * Returns new array which is a copy of the original array, resized to the given [newSize].\n * The copy is either truncated or padded at the end with `false` values if necessary.\n * \n * - If [newSize] is less than the size of the original array, the copy array is truncated to the [newSize].\n * - If [newSize] is greater than the size of the original array, the extra elements in the copy array are filled with `false` values.\n * \n * @sample samples.collections.Arrays.CopyOfOperations.resizedPrimitiveCopyOf\n */"} {"signature":"public actual fun CharArray . copyOf ( newSize : Int ) : CharArray","body":"{ return this . copyOfUninitializedElements ( newSize ) }","docstring":"/**\n * Returns new array which is a copy of the original array, resized to the given [newSize].\n * The copy is either truncated or padded at the end with null char (`\\u0000`) values if necessary.\n * \n * - If [newSize] is less than the size of the original array, the copy array is truncated to the [newSize].\n * - If [newSize] is greater than the size of the original array, the extra elements in the copy array are filled with null char (`\\u0000`) values.\n * \n * @sample samples.collections.Arrays.CopyOfOperations.resizedPrimitiveCopyOf\n */"} {"signature":"public actual fun < T > Array < T > . copyOf ( newSize : Int ) : Array < T ? >","body":"{ return this . copyOfNulls ( newSize ) }","docstring":"/**\n * Returns new array which is a copy of the original array, resized to the given [newSize].\n * The copy is either truncated or padded at the end with `null` values if necessary.\n * \n * - If [newSize] is less than the size of the original array, the copy array is truncated to the [newSize].\n * - If [newSize] is greater than the size of the original array, the extra elements in the copy array are filled with `null` values.\n * \n * @sample samples.collections.Arrays.CopyOfOperations.resizingCopyOf\n */"} {"signature":"public actual fun < T > Array < T > . copyOfRange ( fromIndex : Int , toIndex : Int ) : Array < T >","body":"{ checkCopyOfRangeArguments ( fromIndex , toIndex , size ) return copyOfUninitializedElements ( fromIndex , toIndex ) }","docstring":"/**\n * Returns a new array which is a copy of the specified range of the original array.\n * \n * @param fromIndex the start of the range (inclusive) to copy.\n * @param toIndex the end of the range (exclusive) to copy.\n * \n * @throws IndexOutOfBoundsException if [fromIndex] is less than zero or [toIndex] is greater than the size of this array.\n * @throws IllegalArgumentException if [fromIndex] is greater than [toIndex].\n */"} {"signature":"public actual fun ByteArray . copyOfRange ( fromIndex : Int , toIndex : Int ) : ByteArray","body":"{ checkCopyOfRangeArguments ( fromIndex , toIndex , size ) return copyOfUninitializedElements ( fromIndex , toIndex ) }","docstring":"/**\n * Returns a new array which is a copy of the specified range of the original array.\n * \n * @param fromIndex the start of the range (inclusive) to copy.\n * @param toIndex the end of the range (exclusive) to copy.\n * \n * @throws IndexOutOfBoundsException if [fromIndex] is less than zero or [toIndex] is greater than the size of this array.\n * @throws IllegalArgumentException if [fromIndex] is greater than [toIndex].\n */"} {"signature":"public actual fun ShortArray . copyOfRange ( fromIndex : Int , toIndex : Int ) : ShortArray","body":"{ checkCopyOfRangeArguments ( fromIndex , toIndex , size ) return copyOfUninitializedElements ( fromIndex , toIndex ) }","docstring":"/**\n * Returns a new array which is a copy of the specified range of the original array.\n * \n * @param fromIndex the start of the range (inclusive) to copy.\n * @param toIndex the end of the range (exclusive) to copy.\n * \n * @throws IndexOutOfBoundsException if [fromIndex] is less than zero or [toIndex] is greater than the size of this array.\n * @throws IllegalArgumentException if [fromIndex] is greater than [toIndex].\n */"} {"signature":"public actual fun IntArray . copyOfRange ( fromIndex : Int , toIndex : Int ) : IntArray","body":"{ checkCopyOfRangeArguments ( fromIndex , toIndex , size ) return copyOfUninitializedElements ( fromIndex , toIndex ) }","docstring":"/**\n * Returns a new array which is a copy of the specified range of the original array.\n * \n * @param fromIndex the start of the range (inclusive) to copy.\n * @param toIndex the end of the range (exclusive) to copy.\n * \n * @throws IndexOutOfBoundsException if [fromIndex] is less than zero or [toIndex] is greater than the size of this array.\n * @throws IllegalArgumentException if [fromIndex] is greater than [toIndex].\n */"} {"signature":"public actual fun LongArray . copyOfRange ( fromIndex : Int , toIndex : Int ) : LongArray","body":"{ checkCopyOfRangeArguments ( fromIndex , toIndex , size ) return copyOfUninitializedElements ( fromIndex , toIndex ) }","docstring":"/**\n * Returns a new array which is a copy of the specified range of the original array.\n * \n * @param fromIndex the start of the range (inclusive) to copy.\n * @param toIndex the end of the range (exclusive) to copy.\n * \n * @throws IndexOutOfBoundsException if [fromIndex] is less than zero or [toIndex] is greater than the size of this array.\n * @throws IllegalArgumentException if [fromIndex] is greater than [toIndex].\n */"} {"signature":"public actual fun FloatArray . copyOfRange ( fromIndex : Int , toIndex : Int ) : FloatArray","body":"{ checkCopyOfRangeArguments ( fromIndex , toIndex , size ) return copyOfUninitializedElements ( fromIndex , toIndex ) }","docstring":"/**\n * Returns a new array which is a copy of the specified range of the original array.\n * \n * @param fromIndex the start of the range (inclusive) to copy.\n * @param toIndex the end of the range (exclusive) to copy.\n * \n * @throws IndexOutOfBoundsException if [fromIndex] is less than zero or [toIndex] is greater than the size of this array.\n * @throws IllegalArgumentException if [fromIndex] is greater than [toIndex].\n */"} {"signature":"public actual fun DoubleArray . copyOfRange ( fromIndex : Int , toIndex : Int ) : DoubleArray","body":"{ checkCopyOfRangeArguments ( fromIndex , toIndex , size ) return copyOfUninitializedElements ( fromIndex , toIndex ) }","docstring":"/**\n * Returns a new array which is a copy of the specified range of the original array.\n * \n * @param fromIndex the start of the range (inclusive) to copy.\n * @param toIndex the end of the range (exclusive) to copy.\n * \n * @throws IndexOutOfBoundsException if [fromIndex] is less than zero or [toIndex] is greater than the size of this array.\n * @throws IllegalArgumentException if [fromIndex] is greater than [toIndex].\n */"} {"signature":"public actual fun BooleanArray . copyOfRange ( fromIndex : Int , toIndex : Int ) : BooleanArray","body":"{ checkCopyOfRangeArguments ( fromIndex , toIndex , size ) return copyOfUninitializedElements ( fromIndex , toIndex ) }","docstring":"/**\n * Returns a new array which is a copy of the specified range of the original array.\n * \n * @param fromIndex the start of the range (inclusive) to copy.\n * @param toIndex the end of the range (exclusive) to copy.\n * \n * @throws IndexOutOfBoundsException if [fromIndex] is less than zero or [toIndex] is greater than the size of this array.\n * @throws IllegalArgumentException if [fromIndex] is greater than [toIndex].\n */"} {"signature":"public actual fun CharArray . copyOfRange ( fromIndex : Int , toIndex : Int ) : CharArray","body":"{ checkCopyOfRangeArguments ( fromIndex , toIndex , size ) return copyOfUninitializedElements ( fromIndex , toIndex ) }","docstring":"/**\n * Returns a new array which is a copy of the specified range of the original array.\n * \n * @param fromIndex the start of the range (inclusive) to copy.\n * @param toIndex the end of the range (exclusive) to copy.\n * \n * @throws IndexOutOfBoundsException if [fromIndex] is less than zero or [toIndex] is greater than the size of this array.\n * @throws IllegalArgumentException if [fromIndex] is greater than [toIndex].\n */"} {"signature":"internal fun < T > Array < T > . copyOfUninitializedElements ( fromIndex : Int , toIndex : Int ) : Array < T >","body":"{ val newSize = toIndex - fromIndex if ( newSize < ) { throw IllegalArgumentException ( \"\" ) } val result = arrayOfUninitializedElements < T > ( newSize ) this . copyInto ( result , , fromIndex , toIndex . coerceAtMost ( size ) ) return result }","docstring":"/**\n * Returns new array which is a copy of the original array's range between [fromIndex] (inclusive)\n * and [toIndex] (exclusive) with new elements filled with **lateinit** _uninitialized_ values.\n * Attempts to read _uninitialized_ values from this array work in implementation-dependent manner,\n * either throwing exception or returning some kind of implementation-specific default value.\n */"} {"signature":"internal fun ByteArray . copyOfUninitializedElements ( fromIndex : Int , toIndex : Int ) : ByteArray","body":"{ val newSize = toIndex - fromIndex if ( newSize < ) { throw IllegalArgumentException ( \"\" ) } val result = ByteArray ( newSize ) this . copyInto ( result , , fromIndex , toIndex . coerceAtMost ( size ) ) return result }","docstring":"/**\n * Returns new array which is a copy of the original array's range between [fromIndex] (inclusive)\n * and [toIndex] (exclusive) with new elements filled with **lateinit** _uninitialized_ values.\n * Attempts to read _uninitialized_ values from this array work in implementation-dependent manner,\n * either throwing exception or returning some kind of implementation-specific default value.\n */"} {"signature":"internal fun ShortArray . copyOfUninitializedElements ( fromIndex : Int , toIndex : Int ) : ShortArray","body":"{ val newSize = toIndex - fromIndex if ( newSize < ) { throw IllegalArgumentException ( \"\" ) } val result = ShortArray ( newSize ) this . copyInto ( result , , fromIndex , toIndex . coerceAtMost ( size ) ) return result }","docstring":"/**\n * Returns new array which is a copy of the original array's range between [fromIndex] (inclusive)\n * and [toIndex] (exclusive) with new elements filled with **lateinit** _uninitialized_ values.\n * Attempts to read _uninitialized_ values from this array work in implementation-dependent manner,\n * either throwing exception or returning some kind of implementation-specific default value.\n */"} {"signature":"internal fun IntArray . copyOfUninitializedElements ( fromIndex : Int , toIndex : Int ) : IntArray","body":"{ val newSize = toIndex - fromIndex if ( newSize < ) { throw IllegalArgumentException ( \"\" ) } val result = IntArray ( newSize ) this . copyInto ( result , , fromIndex , toIndex . coerceAtMost ( size ) ) return result }","docstring":"/**\n * Returns new array which is a copy of the original array's range between [fromIndex] (inclusive)\n * and [toIndex] (exclusive) with new elements filled with **lateinit** _uninitialized_ values.\n * Attempts to read _uninitialized_ values from this array work in implementation-dependent manner,\n * either throwing exception or returning some kind of implementation-specific default value.\n */"} {"signature":"internal fun LongArray . copyOfUninitializedElements ( fromIndex : Int , toIndex : Int ) : LongArray","body":"{ val newSize = toIndex - fromIndex if ( newSize < ) { throw IllegalArgumentException ( \"\" ) } val result = LongArray ( newSize ) this . copyInto ( result , , fromIndex , toIndex . coerceAtMost ( size ) ) return result }","docstring":"/**\n * Returns new array which is a copy of the original array's range between [fromIndex] (inclusive)\n * and [toIndex] (exclusive) with new elements filled with **lateinit** _uninitialized_ values.\n * Attempts to read _uninitialized_ values from this array work in implementation-dependent manner,\n * either throwing exception or returning some kind of implementation-specific default value.\n */"} {"signature":"internal fun FloatArray . copyOfUninitializedElements ( fromIndex : Int , toIndex : Int ) : FloatArray","body":"{ val newSize = toIndex - fromIndex if ( newSize < ) { throw IllegalArgumentException ( \"\" ) } val result = FloatArray ( newSize ) this . copyInto ( result , , fromIndex , toIndex . coerceAtMost ( size ) ) return result }","docstring":"/**\n * Returns new array which is a copy of the original array's range between [fromIndex] (inclusive)\n * and [toIndex] (exclusive) with new elements filled with **lateinit** _uninitialized_ values.\n * Attempts to read _uninitialized_ values from this array work in implementation-dependent manner,\n * either throwing exception or returning some kind of implementation-specific default value.\n */"} {"signature":"internal fun DoubleArray . copyOfUninitializedElements ( fromIndex : Int , toIndex : Int ) : DoubleArray","body":"{ val newSize = toIndex - fromIndex if ( newSize < ) { throw IllegalArgumentException ( \"\" ) } val result = DoubleArray ( newSize ) this . copyInto ( result , , fromIndex , toIndex . coerceAtMost ( size ) ) return result }","docstring":"/**\n * Returns new array which is a copy of the original array's range between [fromIndex] (inclusive)\n * and [toIndex] (exclusive) with new elements filled with **lateinit** _uninitialized_ values.\n * Attempts to read _uninitialized_ values from this array work in implementation-dependent manner,\n * either throwing exception or returning some kind of implementation-specific default value.\n */"} {"signature":"internal fun BooleanArray . copyOfUninitializedElements ( fromIndex : Int , toIndex : Int ) : BooleanArray","body":"{ val newSize = toIndex - fromIndex if ( newSize < ) { throw IllegalArgumentException ( \"\" ) } val result = BooleanArray ( newSize ) this . copyInto ( result , , fromIndex , toIndex . coerceAtMost ( size ) ) return result }","docstring":"/**\n * Returns new array which is a copy of the original array's range between [fromIndex] (inclusive)\n * and [toIndex] (exclusive) with new elements filled with **lateinit** _uninitialized_ values.\n * Attempts to read _uninitialized_ values from this array work in implementation-dependent manner,\n * either throwing exception or returning some kind of implementation-specific default value.\n */"} {"signature":"internal fun CharArray . copyOfUninitializedElements ( fromIndex : Int , toIndex : Int ) : CharArray","body":"{ val newSize = toIndex - fromIndex if ( newSize < ) { throw IllegalArgumentException ( \"\" ) } val result = CharArray ( newSize ) this . copyInto ( result , , fromIndex , toIndex . coerceAtMost ( size ) ) return result }","docstring":"/**\n * Returns new array which is a copy of the original array's range between [fromIndex] (inclusive)\n * and [toIndex] (exclusive) with new elements filled with **lateinit** _uninitialized_ values.\n * Attempts to read _uninitialized_ values from this array work in implementation-dependent manner,\n * either throwing exception or returning some kind of implementation-specific default value.\n */"} {"signature":"internal fun < T > Array < T > . copyOfUninitializedElements ( newSize : Int ) : Array < T >","body":"{ return copyOfUninitializedElements ( , newSize ) }","docstring":"/**\n * Returns new array which is a copy of the original array with new elements filled with **lateinit** _uninitialized_ values.\n * Attempts to read _uninitialized_ values from this array work in implementation-dependent manner,\n * either throwing exception or returning some kind of implementation-specific default value.\n */"} {"signature":"internal fun ByteArray . copyOfUninitializedElements ( newSize : Int ) : ByteArray","body":"{ return copyOfUninitializedElements ( , newSize ) }","docstring":"/**\n * Returns new array which is a copy of the original array with new elements filled with **lateinit** _uninitialized_ values.\n * Attempts to read _uninitialized_ values from this array work in implementation-dependent manner,\n * either throwing exception or returning some kind of implementation-specific default value.\n */"} {"signature":"internal fun ShortArray . copyOfUninitializedElements ( newSize : Int ) : ShortArray","body":"{ return copyOfUninitializedElements ( , newSize ) }","docstring":"/**\n * Returns new array which is a copy of the original array with new elements filled with **lateinit** _uninitialized_ values.\n * Attempts to read _uninitialized_ values from this array work in implementation-dependent manner,\n * either throwing exception or returning some kind of implementation-specific default value.\n */"} {"signature":"internal fun IntArray . copyOfUninitializedElements ( newSize : Int ) : IntArray","body":"{ return copyOfUninitializedElements ( , newSize ) }","docstring":"/**\n * Returns new array which is a copy of the original array with new elements filled with **lateinit** _uninitialized_ values.\n * Attempts to read _uninitialized_ values from this array work in implementation-dependent manner,\n * either throwing exception or returning some kind of implementation-specific default value.\n */"} {"signature":"internal fun LongArray . copyOfUninitializedElements ( newSize : Int ) : LongArray","body":"{ return copyOfUninitializedElements ( , newSize ) }","docstring":"/**\n * Returns new array which is a copy of the original array with new elements filled with **lateinit** _uninitialized_ values.\n * Attempts to read _uninitialized_ values from this array work in implementation-dependent manner,\n * either throwing exception or returning some kind of implementation-specific default value.\n */"} {"signature":"internal fun FloatArray . copyOfUninitializedElements ( newSize : Int ) : FloatArray","body":"{ return copyOfUninitializedElements ( , newSize ) }","docstring":"/**\n * Returns new array which is a copy of the original array with new elements filled with **lateinit** _uninitialized_ values.\n * Attempts to read _uninitialized_ values from this array work in implementation-dependent manner,\n * either throwing exception or returning some kind of implementation-specific default value.\n */"} {"signature":"internal fun DoubleArray . copyOfUninitializedElements ( newSize : Int ) : DoubleArray","body":"{ return copyOfUninitializedElements ( , newSize ) }","docstring":"/**\n * Returns new array which is a copy of the original array with new elements filled with **lateinit** _uninitialized_ values.\n * Attempts to read _uninitialized_ values from this array work in implementation-dependent manner,\n * either throwing exception or returning some kind of implementation-specific default value.\n */"} {"signature":"internal fun BooleanArray . copyOfUninitializedElements ( newSize : Int ) : BooleanArray","body":"{ return copyOfUninitializedElements ( , newSize ) }","docstring":"/**\n * Returns new array which is a copy of the original array with new elements filled with **lateinit** _uninitialized_ values.\n * Attempts to read _uninitialized_ values from this array work in implementation-dependent manner,\n * either throwing exception or returning some kind of implementation-specific default value.\n */"} {"signature":"internal fun CharArray . copyOfUninitializedElements ( newSize : Int ) : CharArray","body":"{ return copyOfUninitializedElements ( , newSize ) }","docstring":"/**\n * Returns new array which is a copy of the original array with new elements filled with **lateinit** _uninitialized_ values.\n * Attempts to read _uninitialized_ values from this array work in implementation-dependent manner,\n * either throwing exception or returning some kind of implementation-specific default value.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ Suppress ( \"\" ) public actual fun < T > Array < T > . fill ( element : T , fromIndex : Int = , toIndex : Int = size ) : Unit","body":"{ AbstractList . checkRangeIndexes ( fromIndex , toIndex , size ) for ( index in fromIndex until toIndex ) { this [ index ] = element } }","docstring":"/**\n * Fills this array or its subrange with the specified [element] value.\n * \n * @param fromIndex the start of the range (inclusive) to fill, 0 by default.\n * @param toIndex the end of the range (exclusive) to fill, size of this array by default.\n * \n * @throws IndexOutOfBoundsException if [fromIndex] is less than zero or [toIndex] is greater than the size of this array.\n * @throws IllegalArgumentException if [fromIndex] is greater than [toIndex].\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ Suppress ( \"\" ) public actual fun ByteArray . fill ( element : Byte , fromIndex : Int = , toIndex : Int = size ) : Unit","body":"{ AbstractList . checkRangeIndexes ( fromIndex , toIndex , size ) for ( index in fromIndex until toIndex ) { this [ index ] = element } }","docstring":"/**\n * Fills this array or its subrange with the specified [element] value.\n * \n * @param fromIndex the start of the range (inclusive) to fill, 0 by default.\n * @param toIndex the end of the range (exclusive) to fill, size of this array by default.\n * \n * @throws IndexOutOfBoundsException if [fromIndex] is less than zero or [toIndex] is greater than the size of this array.\n * @throws IllegalArgumentException if [fromIndex] is greater than [toIndex].\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ Suppress ( \"\" ) public actual fun ShortArray . fill ( element : Short , fromIndex : Int = , toIndex : Int = size ) : Unit","body":"{ AbstractList . checkRangeIndexes ( fromIndex , toIndex , size ) for ( index in fromIndex until toIndex ) { this [ index ] = element } }","docstring":"/**\n * Fills this array or its subrange with the specified [element] value.\n * \n * @param fromIndex the start of the range (inclusive) to fill, 0 by default.\n * @param toIndex the end of the range (exclusive) to fill, size of this array by default.\n * \n * @throws IndexOutOfBoundsException if [fromIndex] is less than zero or [toIndex] is greater than the size of this array.\n * @throws IllegalArgumentException if [fromIndex] is greater than [toIndex].\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ Suppress ( \"\" ) public actual fun IntArray . fill ( element : Int , fromIndex : Int = , toIndex : Int = size ) : Unit","body":"{ AbstractList . checkRangeIndexes ( fromIndex , toIndex , size ) for ( index in fromIndex until toIndex ) { this [ index ] = element } }","docstring":"/**\n * Fills this array or its subrange with the specified [element] value.\n * \n * @param fromIndex the start of the range (inclusive) to fill, 0 by default.\n * @param toIndex the end of the range (exclusive) to fill, size of this array by default.\n * \n * @throws IndexOutOfBoundsException if [fromIndex] is less than zero or [toIndex] is greater than the size of this array.\n * @throws IllegalArgumentException if [fromIndex] is greater than [toIndex].\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ Suppress ( \"\" ) public actual fun LongArray . fill ( element : Long , fromIndex : Int = , toIndex : Int = size ) : Unit","body":"{ AbstractList . checkRangeIndexes ( fromIndex , toIndex , size ) for ( index in fromIndex until toIndex ) { this [ index ] = element } }","docstring":"/**\n * Fills this array or its subrange with the specified [element] value.\n * \n * @param fromIndex the start of the range (inclusive) to fill, 0 by default.\n * @param toIndex the end of the range (exclusive) to fill, size of this array by default.\n * \n * @throws IndexOutOfBoundsException if [fromIndex] is less than zero or [toIndex] is greater than the size of this array.\n * @throws IllegalArgumentException if [fromIndex] is greater than [toIndex].\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ Suppress ( \"\" ) public actual fun FloatArray . fill ( element : Float , fromIndex : Int = , toIndex : Int = size ) : Unit","body":"{ AbstractList . checkRangeIndexes ( fromIndex , toIndex , size ) for ( index in fromIndex until toIndex ) { this [ index ] = element } }","docstring":"/**\n * Fills this array or its subrange with the specified [element] value.\n * \n * @param fromIndex the start of the range (inclusive) to fill, 0 by default.\n * @param toIndex the end of the range (exclusive) to fill, size of this array by default.\n * \n * @throws IndexOutOfBoundsException if [fromIndex] is less than zero or [toIndex] is greater than the size of this array.\n * @throws IllegalArgumentException if [fromIndex] is greater than [toIndex].\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ Suppress ( \"\" ) public actual fun DoubleArray . fill ( element : Double , fromIndex : Int = , toIndex : Int = size ) : Unit","body":"{ AbstractList . checkRangeIndexes ( fromIndex , toIndex , size ) for ( index in fromIndex until toIndex ) { this [ index ] = element } }","docstring":"/**\n * Fills this array or its subrange with the specified [element] value.\n * \n * @param fromIndex the start of the range (inclusive) to fill, 0 by default.\n * @param toIndex the end of the range (exclusive) to fill, size of this array by default.\n * \n * @throws IndexOutOfBoundsException if [fromIndex] is less than zero or [toIndex] is greater than the size of this array.\n * @throws IllegalArgumentException if [fromIndex] is greater than [toIndex].\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ Suppress ( \"\" ) public actual fun BooleanArray . fill ( element : Boolean , fromIndex : Int = , toIndex : Int = size ) : Unit","body":"{ AbstractList . checkRangeIndexes ( fromIndex , toIndex , size ) for ( index in fromIndex until toIndex ) { this [ index ] = element } }","docstring":"/**\n * Fills this array or its subrange with the specified [element] value.\n * \n * @param fromIndex the start of the range (inclusive) to fill, 0 by default.\n * @param toIndex the end of the range (exclusive) to fill, size of this array by default.\n * \n * @throws IndexOutOfBoundsException if [fromIndex] is less than zero or [toIndex] is greater than the size of this array.\n * @throws IllegalArgumentException if [fromIndex] is greater than [toIndex].\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ Suppress ( \"\" ) public actual fun CharArray . fill ( element : Char , fromIndex : Int = , toIndex : Int = size ) : Unit","body":"{ AbstractList . checkRangeIndexes ( fromIndex , toIndex , size ) for ( index in fromIndex until toIndex ) { this [ index ] = element } }","docstring":"/**\n * Fills this array or its subrange with the specified [element] value.\n * \n * @param fromIndex the start of the range (inclusive) to fill, 0 by default.\n * @param toIndex the end of the range (exclusive) to fill, size of this array by default.\n * \n * @throws IndexOutOfBoundsException if [fromIndex] is less than zero or [toIndex] is greater than the size of this array.\n * @throws IllegalArgumentException if [fromIndex] is greater than [toIndex].\n */"} {"signature":"public actual operator fun < T > Array < T > . plus ( element : T ) : Array < T >","body":"{ val index = size val result = copyOfUninitializedElements ( index + ) result [ index ] = element return result }","docstring":"/**\n * Returns an array containing all elements of the original array and then the given [element].\n */"} {"signature":"public actual operator fun ByteArray . plus ( element : Byte ) : ByteArray","body":"{ val index = size val result = copyOfUninitializedElements ( index + ) result [ index ] = element return result }","docstring":"/**\n * Returns an array containing all elements of the original array and then the given [element].\n */"} {"signature":"public actual operator fun ShortArray . plus ( element : Short ) : ShortArray","body":"{ val index = size val result = copyOfUninitializedElements ( index + ) result [ index ] = element return result }","docstring":"/**\n * Returns an array containing all elements of the original array and then the given [element].\n */"} {"signature":"public actual operator fun IntArray . plus ( element : Int ) : IntArray","body":"{ val index = size val result = copyOfUninitializedElements ( index + ) result [ index ] = element return result }","docstring":"/**\n * Returns an array containing all elements of the original array and then the given [element].\n */"} {"signature":"public actual operator fun LongArray . plus ( element : Long ) : LongArray","body":"{ val index = size val result = copyOfUninitializedElements ( index + ) result [ index ] = element return result }","docstring":"/**\n * Returns an array containing all elements of the original array and then the given [element].\n */"} {"signature":"public actual operator fun FloatArray . plus ( element : Float ) : FloatArray","body":"{ val index = size val result = copyOfUninitializedElements ( index + ) result [ index ] = element return result }","docstring":"/**\n * Returns an array containing all elements of the original array and then the given [element].\n */"} {"signature":"public actual operator fun DoubleArray . plus ( element : Double ) : DoubleArray","body":"{ val index = size val result = copyOfUninitializedElements ( index + ) result [ index ] = element return result }","docstring":"/**\n * Returns an array containing all elements of the original array and then the given [element].\n */"} {"signature":"public actual operator fun BooleanArray . plus ( element : Boolean ) : BooleanArray","body":"{ val index = size val result = copyOfUninitializedElements ( index + ) result [ index ] = element return result }","docstring":"/**\n * Returns an array containing all elements of the original array and then the given [element].\n */"} {"signature":"public actual operator fun CharArray . plus ( element : Char ) : CharArray","body":"{ val index = size val result = copyOfUninitializedElements ( index + ) result [ index ] = element return result }","docstring":"/**\n * Returns an array containing all elements of the original array and then the given [element].\n */"} {"signature":"public actual operator fun < T > Array < T > . plus ( elements : Collection < T > ) : Array < T >","body":"{ var index = size val result = copyOfUninitializedElements ( index + elements . size ) for ( element in elements ) result [ index ++ ] = element return result }","docstring":"/**\n * Returns an array containing all elements of the original array and then all elements of the given [elements] collection.\n */"} {"signature":"public actual operator fun ByteArray . plus ( elements : Collection < Byte > ) : ByteArray","body":"{ var index = size val result = copyOfUninitializedElements ( index + elements . size ) for ( element in elements ) result [ index ++ ] = element return result }","docstring":"/**\n * Returns an array containing all elements of the original array and then all elements of the given [elements] collection.\n */"} {"signature":"public actual operator fun ShortArray . plus ( elements : Collection < Short > ) : ShortArray","body":"{ var index = size val result = copyOfUninitializedElements ( index + elements . size ) for ( element in elements ) result [ index ++ ] = element return result }","docstring":"/**\n * Returns an array containing all elements of the original array and then all elements of the given [elements] collection.\n */"} {"signature":"public actual operator fun IntArray . plus ( elements : Collection < Int > ) : IntArray","body":"{ var index = size val result = copyOfUninitializedElements ( index + elements . size ) for ( element in elements ) result [ index ++ ] = element return result }","docstring":"/**\n * Returns an array containing all elements of the original array and then all elements of the given [elements] collection.\n */"} {"signature":"public actual operator fun LongArray . plus ( elements : Collection < Long > ) : LongArray","body":"{ var index = size val result = copyOfUninitializedElements ( index + elements . size ) for ( element in elements ) result [ index ++ ] = element return result }","docstring":"/**\n * Returns an array containing all elements of the original array and then all elements of the given [elements] collection.\n */"} {"signature":"public actual operator fun FloatArray . plus ( elements : Collection < Float > ) : FloatArray","body":"{ var index = size val result = copyOfUninitializedElements ( index + elements . size ) for ( element in elements ) result [ index ++ ] = element return result }","docstring":"/**\n * Returns an array containing all elements of the original array and then all elements of the given [elements] collection.\n */"} {"signature":"public actual operator fun DoubleArray . plus ( elements : Collection < Double > ) : DoubleArray","body":"{ var index = size val result = copyOfUninitializedElements ( index + elements . size ) for ( element in elements ) result [ index ++ ] = element return result }","docstring":"/**\n * Returns an array containing all elements of the original array and then all elements of the given [elements] collection.\n */"} {"signature":"public actual operator fun BooleanArray . plus ( elements : Collection < Boolean > ) : BooleanArray","body":"{ var index = size val result = copyOfUninitializedElements ( index + elements . size ) for ( element in elements ) result [ index ++ ] = element return result }","docstring":"/**\n * Returns an array containing all elements of the original array and then all elements of the given [elements] collection.\n */"} {"signature":"public actual operator fun CharArray . plus ( elements : Collection < Char > ) : CharArray","body":"{ var index = size val result = copyOfUninitializedElements ( index + elements . size ) for ( element in elements ) result [ index ++ ] = element return result }","docstring":"/**\n * Returns an array containing all elements of the original array and then all elements of the given [elements] collection.\n */"} {"signature":"public actual operator fun < T > Array < T > . plus ( elements : Array < out T > ) : Array < T >","body":"{ val thisSize = size val arraySize = elements . size val result = copyOfUninitializedElements ( thisSize + arraySize ) elements . copyInto ( result , thisSize ) return result }","docstring":"/**\n * Returns an array containing all elements of the original array and then all elements of the given [elements] array.\n */"} {"signature":"public actual operator fun ByteArray . plus ( elements : ByteArray ) : ByteArray","body":"{ val thisSize = size val arraySize = elements . size val result = copyOfUninitializedElements ( thisSize + arraySize ) elements . copyInto ( result , thisSize ) return result }","docstring":"/**\n * Returns an array containing all elements of the original array and then all elements of the given [elements] array.\n */"} {"signature":"public actual operator fun ShortArray . plus ( elements : ShortArray ) : ShortArray","body":"{ val thisSize = size val arraySize = elements . size val result = copyOfUninitializedElements ( thisSize + arraySize ) elements . copyInto ( result , thisSize ) return result }","docstring":"/**\n * Returns an array containing all elements of the original array and then all elements of the given [elements] array.\n */"} {"signature":"public actual operator fun IntArray . plus ( elements : IntArray ) : IntArray","body":"{ val thisSize = size val arraySize = elements . size val result = copyOfUninitializedElements ( thisSize + arraySize ) elements . copyInto ( result , thisSize ) return result }","docstring":"/**\n * Returns an array containing all elements of the original array and then all elements of the given [elements] array.\n */"} {"signature":"public actual operator fun LongArray . plus ( elements : LongArray ) : LongArray","body":"{ val thisSize = size val arraySize = elements . size val result = copyOfUninitializedElements ( thisSize + arraySize ) elements . copyInto ( result , thisSize ) return result }","docstring":"/**\n * Returns an array containing all elements of the original array and then all elements of the given [elements] array.\n */"} {"signature":"public actual operator fun FloatArray . plus ( elements : FloatArray ) : FloatArray","body":"{ val thisSize = size val arraySize = elements . size val result = copyOfUninitializedElements ( thisSize + arraySize ) elements . copyInto ( result , thisSize ) return result }","docstring":"/**\n * Returns an array containing all elements of the original array and then all elements of the given [elements] array.\n */"} {"signature":"public actual operator fun DoubleArray . plus ( elements : DoubleArray ) : DoubleArray","body":"{ val thisSize = size val arraySize = elements . size val result = copyOfUninitializedElements ( thisSize + arraySize ) elements . copyInto ( result , thisSize ) return result }","docstring":"/**\n * Returns an array containing all elements of the original array and then all elements of the given [elements] array.\n */"} {"signature":"public actual operator fun BooleanArray . plus ( elements : BooleanArray ) : BooleanArray","body":"{ val thisSize = size val arraySize = elements . size val result = copyOfUninitializedElements ( thisSize + arraySize ) elements . copyInto ( result , thisSize ) return result }","docstring":"/**\n * Returns an array containing all elements of the original array and then all elements of the given [elements] array.\n */"} {"signature":"public actual operator fun CharArray . plus ( elements : CharArray ) : CharArray","body":"{ val thisSize = size val arraySize = elements . size val result = copyOfUninitializedElements ( thisSize + arraySize ) elements . copyInto ( result , thisSize ) return result }","docstring":"/**\n * Returns an array containing all elements of the original array and then all elements of the given [elements] array.\n */"} {"signature":"@ kotlin . internal . InlineOnly public actual inline fun < T > Array < T > . plusElement ( element : T ) : Array < T >","body":"{ return plus ( element ) }","docstring":"/**\n * Returns an array containing all elements of the original array and then the given [element].\n */"} {"signature":"public actual fun IntArray . sort ( ) : Unit","body":"{ if ( size > ) sortArray ( this , , size ) }","docstring":"/**\n * Sorts the array in-place.\n * \n * @sample samples.collections.Arrays.Sorting.sortArray\n */"} {"signature":"public actual fun LongArray . sort ( ) : Unit","body":"{ if ( size > ) sortArray ( this , , size ) }","docstring":"/**\n * Sorts the array in-place.\n * \n * @sample samples.collections.Arrays.Sorting.sortArray\n */"} {"signature":"public actual fun ByteArray . sort ( ) : Unit","body":"{ if ( size > ) sortArray ( this , , size ) }","docstring":"/**\n * Sorts the array in-place.\n * \n * @sample samples.collections.Arrays.Sorting.sortArray\n */"} {"signature":"public actual fun ShortArray . sort ( ) : Unit","body":"{ if ( size > ) sortArray ( this , , size ) }","docstring":"/**\n * Sorts the array in-place.\n * \n * @sample samples.collections.Arrays.Sorting.sortArray\n */"} {"signature":"public actual fun DoubleArray . sort ( ) : Unit","body":"{ if ( size > ) sortArray ( this , , size ) }","docstring":"/**\n * Sorts the array in-place.\n * \n * @sample samples.collections.Arrays.Sorting.sortArray\n */"} {"signature":"public actual fun FloatArray . sort ( ) : Unit","body":"{ if ( size > ) sortArray ( this , , size ) }","docstring":"/**\n * Sorts the array in-place.\n * \n * @sample samples.collections.Arrays.Sorting.sortArray\n */"} {"signature":"public actual fun CharArray . sort ( ) : Unit","body":"{ if ( size > ) sortArray ( this , , size ) }","docstring":"/**\n * Sorts the array in-place.\n * \n * @sample samples.collections.Arrays.Sorting.sortArray\n */"} {"signature":"public actual fun < T : Comparable < T > > Array < out T > . sort ( ) : Unit","body":"{ if ( size > ) sortArray ( this , , size ) }","docstring":"/**\n * Sorts the array in-place according to the natural order of its elements.\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.Arrays.Sorting.sortArrayOfComparable\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ Suppress ( \"\" ) public actual fun < T : Comparable < T > > Array < out T > . sort ( fromIndex : Int = , toIndex : Int = size ) : Unit","body":"{ AbstractList . checkRangeIndexes ( fromIndex , toIndex , size ) sortArray ( this , fromIndex , toIndex ) }","docstring":"/**\n * Sorts a range in the array in-place.\n * \n * The sort is _stable_. It means that equal elements preserve their order relative to each other after sorting.\n * \n * @param fromIndex the start of the range (inclusive) to sort, 0 by default.\n * @param toIndex the end of the range (exclusive) to sort, size of this array by default.\n * \n * @throws IndexOutOfBoundsException if [fromIndex] is less than zero or [toIndex] is greater than the size of this array.\n * @throws IllegalArgumentException if [fromIndex] is greater than [toIndex].\n * \n * @sample samples.collections.Arrays.Sorting.sortRangeOfArrayOfComparable\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ Suppress ( \"\" ) public actual fun ByteArray . sort ( fromIndex : Int = , toIndex : Int = size ) : Unit","body":"{ AbstractList . checkRangeIndexes ( fromIndex , toIndex , size ) sortArray ( this , fromIndex , toIndex ) }","docstring":"/**\n * Sorts a range in the array in-place.\n * \n * @param fromIndex the start of the range (inclusive) to sort, 0 by default.\n * @param toIndex the end of the range (exclusive) to sort, size of this array by default.\n * \n * @throws IndexOutOfBoundsException if [fromIndex] is less than zero or [toIndex] is greater than the size of this array.\n * @throws IllegalArgumentException if [fromIndex] is greater than [toIndex].\n * \n * @sample samples.collections.Arrays.Sorting.sortRangeOfArray\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ Suppress ( \"\" ) public actual fun ShortArray . sort ( fromIndex : Int = , toIndex : Int = size ) : Unit","body":"{ AbstractList . checkRangeIndexes ( fromIndex , toIndex , size ) sortArray ( this , fromIndex , toIndex ) }","docstring":"/**\n * Sorts a range in the array in-place.\n * \n * @param fromIndex the start of the range (inclusive) to sort, 0 by default.\n * @param toIndex the end of the range (exclusive) to sort, size of this array by default.\n * \n * @throws IndexOutOfBoundsException if [fromIndex] is less than zero or [toIndex] is greater than the size of this array.\n * @throws IllegalArgumentException if [fromIndex] is greater than [toIndex].\n * \n * @sample samples.collections.Arrays.Sorting.sortRangeOfArray\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ Suppress ( \"\" ) public actual fun IntArray . sort ( fromIndex : Int = , toIndex : Int = size ) : Unit","body":"{ AbstractList . checkRangeIndexes ( fromIndex , toIndex , size ) sortArray ( this , fromIndex , toIndex ) }","docstring":"/**\n * Sorts a range in the array in-place.\n * \n * @param fromIndex the start of the range (inclusive) to sort, 0 by default.\n * @param toIndex the end of the range (exclusive) to sort, size of this array by default.\n * \n * @throws IndexOutOfBoundsException if [fromIndex] is less than zero or [toIndex] is greater than the size of this array.\n * @throws IllegalArgumentException if [fromIndex] is greater than [toIndex].\n * \n * @sample samples.collections.Arrays.Sorting.sortRangeOfArray\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ Suppress ( \"\" ) public actual fun LongArray . sort ( fromIndex : Int = , toIndex : Int = size ) : Unit","body":"{ AbstractList . checkRangeIndexes ( fromIndex , toIndex , size ) sortArray ( this , fromIndex , toIndex ) }","docstring":"/**\n * Sorts a range in the array in-place.\n * \n * @param fromIndex the start of the range (inclusive) to sort, 0 by default.\n * @param toIndex the end of the range (exclusive) to sort, size of this array by default.\n * \n * @throws IndexOutOfBoundsException if [fromIndex] is less than zero or [toIndex] is greater than the size of this array.\n * @throws IllegalArgumentException if [fromIndex] is greater than [toIndex].\n * \n * @sample samples.collections.Arrays.Sorting.sortRangeOfArray\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ Suppress ( \"\" ) public actual fun FloatArray . sort ( fromIndex : Int = , toIndex : Int = size ) : Unit","body":"{ AbstractList . checkRangeIndexes ( fromIndex , toIndex , size ) sortArray ( this , fromIndex , toIndex ) }","docstring":"/**\n * Sorts a range in the array in-place.\n * \n * @param fromIndex the start of the range (inclusive) to sort, 0 by default.\n * @param toIndex the end of the range (exclusive) to sort, size of this array by default.\n * \n * @throws IndexOutOfBoundsException if [fromIndex] is less than zero or [toIndex] is greater than the size of this array.\n * @throws IllegalArgumentException if [fromIndex] is greater than [toIndex].\n * \n * @sample samples.collections.Arrays.Sorting.sortRangeOfArray\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ Suppress ( \"\" ) public actual fun DoubleArray . sort ( fromIndex : Int = , toIndex : Int = size ) : Unit","body":"{ AbstractList . checkRangeIndexes ( fromIndex , toIndex , size ) sortArray ( this , fromIndex , toIndex ) }","docstring":"/**\n * Sorts a range in the array in-place.\n * \n * @param fromIndex the start of the range (inclusive) to sort, 0 by default.\n * @param toIndex the end of the range (exclusive) to sort, size of this array by default.\n * \n * @throws IndexOutOfBoundsException if [fromIndex] is less than zero or [toIndex] is greater than the size of this array.\n * @throws IllegalArgumentException if [fromIndex] is greater than [toIndex].\n * \n * @sample samples.collections.Arrays.Sorting.sortRangeOfArray\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ Suppress ( \"\" ) public actual fun CharArray . sort ( fromIndex : Int = , toIndex : Int = size ) : Unit","body":"{ AbstractList . checkRangeIndexes ( fromIndex , toIndex , size ) sortArray ( this , fromIndex , toIndex ) }","docstring":"/**\n * Sorts a range in the array in-place.\n * \n * @param fromIndex the start of the range (inclusive) to sort, 0 by default.\n * @param toIndex the end of the range (exclusive) to sort, size of this array by default.\n * \n * @throws IndexOutOfBoundsException if [fromIndex] is less than zero or [toIndex] is greater than the size of this array.\n * @throws IllegalArgumentException if [fromIndex] is greater than [toIndex].\n * \n * @sample samples.collections.Arrays.Sorting.sortRangeOfArray\n */"} {"signature":"public actual fun < T > Array < out T > . sortWith ( comparator : Comparator < in T > ) : Unit","body":"{ if ( size > ) sortArrayWith ( this , , size , comparator ) }","docstring":"/**\n * Sorts the array in-place according to the order specified by the given [comparator].\n * \n * The sort is _stable_. It means that equal elements preserve their order relative to each other after sorting.\n */"} {"signature":"@ Suppress ( \"\" ) public actual fun < T > Array < out T > . sortWith ( comparator : Comparator < in T > , fromIndex : Int = , toIndex : Int = size ) : Unit","body":"{ AbstractList . checkRangeIndexes ( fromIndex , toIndex , size ) sortArrayWith ( this , fromIndex , toIndex , comparator ) }","docstring":"/**\n * Sorts a range in the array in-place with the given [comparator].\n * \n * The sort is _stable_. It means that equal elements preserve their order relative to each other after sorting.\n * \n * @param fromIndex the start of the range (inclusive) to sort, 0 by default.\n * @param toIndex the end of the range (exclusive) to sort, size of this array by default.\n * \n * @throws IndexOutOfBoundsException if [fromIndex] is less than zero or [toIndex] is greater than the size of this array.\n * @throws IllegalArgumentException if [fromIndex] is greater than [toIndex].\n */"} {"signature":"public actual fun ByteArray . toTypedArray ( ) : Array < Byte >","body":"{ return Array ( size ) { index -> this [ index ] } }","docstring":"/**\n * Returns a *typed* object array containing all of the elements of this primitive array.\n */"} {"signature":"public actual fun ShortArray . toTypedArray ( ) : Array < Short >","body":"{ return Array ( size ) { index -> this [ index ] } }","docstring":"/**\n * Returns a *typed* object array containing all of the elements of this primitive array.\n */"} {"signature":"public actual fun IntArray . toTypedArray ( ) : Array < Int >","body":"{ return Array ( size ) { index -> this [ index ] } }","docstring":"/**\n * Returns a *typed* object array containing all of the elements of this primitive array.\n */"} {"signature":"public actual fun LongArray . toTypedArray ( ) : Array < Long >","body":"{ return Array ( size ) { index -> this [ index ] } }","docstring":"/**\n * Returns a *typed* object array containing all of the elements of this primitive array.\n */"} {"signature":"public actual fun FloatArray . toTypedArray ( ) : Array < Float >","body":"{ return Array ( size ) { index -> this [ index ] } }","docstring":"/**\n * Returns a *typed* object array containing all of the elements of this primitive array.\n */"} {"signature":"public actual fun DoubleArray . toTypedArray ( ) : Array < Double >","body":"{ return Array ( size ) { index -> this [ index ] } }","docstring":"/**\n * Returns a *typed* object array containing all of the elements of this primitive array.\n */"} {"signature":"public actual fun BooleanArray . toTypedArray ( ) : Array < Boolean >","body":"{ return Array ( size ) { index -> this [ index ] } }","docstring":"/**\n * Returns a *typed* object array containing all of the elements of this primitive array.\n */"} {"signature":"public actual fun CharArray . toTypedArray ( ) : Array < Char >","body":"{ return Array ( size ) { index -> this [ index ] } }","docstring":"/**\n * Returns a *typed* object array containing all of the elements of this primitive array.\n */"} {"signature":"fun Gradle . registerMinimalVariantImplementationFactoriesForTests ( )","body":"{ VariantImplementationFactoriesConfigurator . get ( gradle ) . putIfAbsent ( ConfigurationTimePropertiesAccessor . ConfigurationTimePropertiesAccessorVariantFactory :: class , DefaultConfigurationTimePropertiesAccessorVariantFactory ( ) ) VariantImplementationFactoriesConfigurator . get ( gradle ) . putIfAbsent ( IdeaSyncDetector . IdeaSyncDetectorVariantFactory :: class , DefaultIdeaSyncDetectorVariantFactory ( ) ) }","docstring":"/**\n * Configures some default factories that are usually automatically registered in\n * [org.jetbrains.kotlin.gradle.plugin.DefaultKotlinBasePlugin.apply]\n *\n * This function can be used in some minimal tests that do not apply the full KGP plugin but still touch\n * some parts of its code\n */"} {"signature":"private fun configureDokkaPublicationsDefaults ( dokkatooExtension : DokkatooExtension , )","body":"{ dokkatooExtension . dokkatooPublications . all { enabled . convention ( true ) cacheRoot . convention ( dokkatooExtension . dokkatooCacheDirectory ) delayTemplateSubstitution . convention ( false ) failOnWarning . convention ( false ) finalizeCoroutines . convention ( false ) moduleName . convention ( dokkatooExtension . moduleName ) moduleVersion . convention ( dokkatooExtension . moduleVersion ) offlineMode . convention ( false ) outputDir . convention ( dokkatooExtension . dokkatooPublicationDirectory ) suppressInheritedMembers . convention ( false ) suppressObviousFunctions . convention ( true ) } }","docstring":"/** Set defaults in all [DokkatooExtension.dokkatooPublications]s */"} {"signature":"private fun NamedDomainObjectContainer < DokkaSourceSetSpec > . configureDefaults ( sourceSetScopeConvention : Property < String > , )","body":"{ configureEach dss @ { analysisPlatform . convention ( KotlinPlatform . DEFAULT ) displayName . convention ( analysisPlatform . map { platform -> when { name . endsWith ( \"\" ) -> name . substringBeforeLast ( \"\" ) else -> platform . displayName } } ) documentedVisibilities . convention ( setOf ( VisibilityModifier . PUBLIC ) ) jdkVersion . convention ( ) enableKotlinStdLibDocumentationLink . convention ( true ) enableJdkDocumentationLink . convention ( true ) enableAndroidDocumentationLink . convention ( analysisPlatform . map { it == KotlinPlatform . AndroidJVM } ) reportUndocumented . convention ( false ) skipDeprecated . convention ( false ) skipEmptyPackages . convention ( true ) sourceSetScope . convention ( sourceSetScopeConvention ) suppress . convention ( false ) suppressGeneratedFiles . convention ( true ) sourceLinks . configureEach { localDirectory . convention ( layout . projectDirectory ) remoteLineSuffix . convention ( \"\" ) } perPackageOptions . configureEach { matchingRegex . convention ( \"\" ) suppress . convention ( false ) skipDeprecated . convention ( false ) reportUndocumented . convention ( false ) } externalDocumentationLinks { configureEach { enabled . convention ( true ) packageListUrl . convention ( url . map { it . appendPath ( \"\" ) } ) } maybeCreate ( \"\" ) { enabled . convention ( this @ dss . enableJdkDocumentationLink ) url ( this @ dss . jdkVersion . map { jdkVersion -> when { jdkVersion < -> \"\" else -> \"\" } } ) packageListUrl ( this @ dss . jdkVersion . map { jdkVersion -> when { jdkVersion < -> \"\" else -> \"\" } } ) } maybeCreate ( \"\" ) { enabled . convention ( this @ dss . enableKotlinStdLibDocumentationLink ) url ( \"\" ) } maybeCreate ( \"\" ) { enabled . convention ( this @ dss . enableAndroidDocumentationLink ) url ( \"\" ) } maybeCreate ( \"\" ) { enabled . convention ( this @ dss . enableAndroidDocumentationLink ) url ( \"\" ) packageListUrl ( \"\" ) } } } }","docstring":"/** Set conventions for all [DokkaSourceSetSpec] properties */"} {"signature":"protected fun String . appendFormat ( ) : String","body":"= when ( val name = formatName ) { null -> this else -> this + name . uppercaseFirstChar ( ) }","docstring":"/** Appends [formatName] to the end of the string, camelcase style, if [formatName] is not null */"} {"signature":"@ kotlin . internal . InlineOnly public actual inline fun < T > Array < out 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 array.\n * \n * @sample samples.collections.Collections.Elements.elementAt\n */"} {"signature":"@ kotlin . internal . InlineOnly public actual inline fun ByteArray . elementAt ( index : Int ) : Byte","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 array.\n * \n * @sample samples.collections.Collections.Elements.elementAt\n */"} {"signature":"@ kotlin . internal . InlineOnly public actual inline fun ShortArray . elementAt ( index : Int ) : Short","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 array.\n * \n * @sample samples.collections.Collections.Elements.elementAt\n */"} {"signature":"@ kotlin . internal . InlineOnly public actual inline fun IntArray . elementAt ( index : Int ) : Int","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 array.\n * \n * @sample samples.collections.Collections.Elements.elementAt\n */"} {"signature":"@ kotlin . internal . InlineOnly public actual inline fun LongArray . elementAt ( index : Int ) : Long","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 array.\n * \n * @sample samples.collections.Collections.Elements.elementAt\n */"} {"signature":"@ kotlin . internal . InlineOnly public actual inline fun FloatArray . elementAt ( index : Int ) : Float","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 array.\n * \n * @sample samples.collections.Collections.Elements.elementAt\n */"} {"signature":"@ kotlin . internal . InlineOnly public actual inline fun DoubleArray . elementAt ( index : Int ) : Double","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 array.\n * \n * @sample samples.collections.Collections.Elements.elementAt\n */"} {"signature":"@ kotlin . internal . InlineOnly public actual inline fun BooleanArray . elementAt ( index : Int ) : Boolean","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 array.\n * \n * @sample samples.collections.Collections.Elements.elementAt\n */"} {"signature":"@ kotlin . internal . InlineOnly public actual inline fun CharArray . elementAt ( index : Int ) : Char","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 array.\n * \n * @sample samples.collections.Collections.Elements.elementAt\n */"} {"signature":"public fun < R > Array < * > . filterIsInstance ( klass : Class < R > ) : List < R >","body":"{ return filterIsInstanceTo ( ArrayList < R > ( ) , klass ) }","docstring":"/**\n * Returns a list containing all elements that are instances of specified class.\n * \n * @sample samples.collections.Collections.Filtering.filterIsInstanceJVM\n */"} {"signature":"public fun < C : MutableCollection < in R > , R > Array < * > . 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 * @sample samples.collections.Collections.Filtering.filterIsInstanceToJVM\n */"} {"signature":"public actual fun < T > Array < out T > . asList ( ) : List < T >","body":"{ return ArraysUtilJVM . asList ( this ) }","docstring":"/**\n * Returns a [List] that wraps the original array.\n */"} {"signature":"public actual fun ByteArray . asList ( ) : List < Byte >","body":"{ return object : AbstractList < Byte > ( ) , RandomAccess { override val size : Int get ( ) = this@asList . size override fun isEmpty ( ) : Boolean = this@asList . isEmpty ( ) override fun contains ( element : Byte ) : Boolean = this@asList . contains ( element ) override fun get ( index : Int ) : Byte = this@asList [ index ] override fun indexOf ( element : Byte ) : Int = this@asList . indexOf ( element ) override fun lastIndexOf ( element : Byte ) : Int = this@asList . lastIndexOf ( element ) } }","docstring":"/**\n * Returns a [List] that wraps the original array.\n */"} {"signature":"public actual fun ShortArray . asList ( ) : List < Short >","body":"{ return object : AbstractList < Short > ( ) , RandomAccess { override val size : Int get ( ) = this@asList . size override fun isEmpty ( ) : Boolean = this@asList . isEmpty ( ) override fun contains ( element : Short ) : Boolean = this@asList . contains ( element ) override fun get ( index : Int ) : Short = this@asList [ index ] override fun indexOf ( element : Short ) : Int = this@asList . indexOf ( element ) override fun lastIndexOf ( element : Short ) : Int = this@asList . lastIndexOf ( element ) } }","docstring":"/**\n * Returns a [List] that wraps the original array.\n */"} {"signature":"public actual fun IntArray . asList ( ) : List < Int >","body":"{ return object : AbstractList < Int > ( ) , RandomAccess { override val size : Int get ( ) = this@asList . size override fun isEmpty ( ) : Boolean = this@asList . isEmpty ( ) override fun contains ( element : Int ) : Boolean = this@asList . contains ( element ) override fun get ( index : Int ) : Int = this@asList [ index ] override fun indexOf ( element : Int ) : Int = this@asList . indexOf ( element ) override fun lastIndexOf ( element : Int ) : Int = this@asList . lastIndexOf ( element ) } }","docstring":"/**\n * Returns a [List] that wraps the original array.\n */"} {"signature":"public actual fun LongArray . asList ( ) : List < Long >","body":"{ return object : AbstractList < Long > ( ) , RandomAccess { override val size : Int get ( ) = this@asList . size override fun isEmpty ( ) : Boolean = this@asList . isEmpty ( ) override fun contains ( element : Long ) : Boolean = this@asList . contains ( element ) override fun get ( index : Int ) : Long = this@asList [ index ] override fun indexOf ( element : Long ) : Int = this@asList . indexOf ( element ) override fun lastIndexOf ( element : Long ) : Int = this@asList . lastIndexOf ( element ) } }","docstring":"/**\n * Returns a [List] that wraps the original array.\n */"} {"signature":"public actual fun FloatArray . asList ( ) : List < Float >","body":"{ return object : AbstractList < Float > ( ) , RandomAccess { override val size : Int get ( ) = this@asList . size override fun isEmpty ( ) : Boolean = this@asList . isEmpty ( ) override fun contains ( element : Float ) : Boolean = this@asList . any { it . toBits ( ) == element . toBits ( ) } override fun get ( index : Int ) : Float = this@asList [ index ] override fun indexOf ( element : Float ) : Int = this@asList . indexOfFirst { it . toBits ( ) == element . toBits ( ) } override fun lastIndexOf ( element : Float ) : Int = this@asList . indexOfLast { it . toBits ( ) == element . toBits ( ) } } }","docstring":"/**\n * Returns a [List] that wraps the original array.\n */"} {"signature":"public actual fun DoubleArray . asList ( ) : List < Double >","body":"{ return object : AbstractList < Double > ( ) , RandomAccess { override val size : Int get ( ) = this@asList . size override fun isEmpty ( ) : Boolean = this@asList . isEmpty ( ) override fun contains ( element : Double ) : Boolean = this@asList . any { it . toBits ( ) == element . toBits ( ) } override fun get ( index : Int ) : Double = this@asList [ index ] override fun indexOf ( element : Double ) : Int = this@asList . indexOfFirst { it . toBits ( ) == element . toBits ( ) } override fun lastIndexOf ( element : Double ) : Int = this@asList . indexOfLast { it . toBits ( ) == element . toBits ( ) } } }","docstring":"/**\n * Returns a [List] that wraps the original array.\n */"} {"signature":"public actual fun BooleanArray . asList ( ) : List < Boolean >","body":"{ return object : AbstractList < Boolean > ( ) , RandomAccess { override val size : Int get ( ) = this@asList . size override fun isEmpty ( ) : Boolean = this@asList . isEmpty ( ) override fun contains ( element : Boolean ) : Boolean = this@asList . contains ( element ) override fun get ( index : Int ) : Boolean = this@asList [ index ] override fun indexOf ( element : Boolean ) : Int = this@asList . indexOf ( element ) override fun lastIndexOf ( element : Boolean ) : Int = this@asList . lastIndexOf ( element ) } }","docstring":"/**\n * Returns a [List] that wraps the original array.\n */"} {"signature":"public actual fun CharArray . asList ( ) : List < Char >","body":"{ return object : AbstractList < Char > ( ) , RandomAccess { override val size : Int get ( ) = this@asList . size override fun isEmpty ( ) : Boolean = this@asList . isEmpty ( ) override fun contains ( element : Char ) : Boolean = this@asList . contains ( element ) override fun get ( index : Int ) : Char = this@asList [ index ] override fun indexOf ( element : Char ) : Int = this@asList . indexOf ( element ) override fun lastIndexOf ( element : Char ) : Int = this@asList . lastIndexOf ( element ) } }","docstring":"/**\n * Returns a [List] that wraps the original array.\n */"} {"signature":"public fun < T > Array < out T > . binarySearch ( element : T , comparator : Comparator < in T > , fromIndex : Int = , toIndex : Int = size ) : Int","body":"{ return java . util . Arrays . binarySearch ( this , fromIndex , toIndex , element , comparator ) }","docstring":"/**\n * Searches the array or the range of the array for the provided [element] using the binary search algorithm.\n * The array is expected to be sorted according to the specified [comparator], otherwise the result is undefined.\n * \n * If the array contains multiple elements equal to the specified [element], there is no guarantee which one will be found.\n * \n * @param element the element to search for.\n * @param comparator the comparator according to which this array is sorted.\n * @param fromIndex the start of the range (inclusive) to search in, 0 by default.\n * @param toIndex the end of the range (exclusive) to search in, size of this array by default.\n * \n * @return the index of the element, if it is contained in the array within the specified range;\n * otherwise, the inverted insertion point `(-insertion point - 1)`.\n * The insertion point is defined as the index at which the element should be inserted,\n * so that the array (or the specified subrange of array) still remains sorted according to the specified [comparator].\n * \n * @throws IndexOutOfBoundsException if [fromIndex] is less than zero or [toIndex] is greater than the size of this array.\n * @throws IllegalArgumentException if [fromIndex] is greater than [toIndex].\n */"} {"signature":"public fun < T > Array < out T > . binarySearch ( element : T , fromIndex : Int = , toIndex : Int = size ) : Int","body":"{ return java . util . Arrays . binarySearch ( this , fromIndex , toIndex , element ) }","docstring":"/**\n * Searches the array or the range of the array for the provided [element] using the binary search algorithm.\n * The array is expected to be sorted, otherwise the result is undefined.\n * \n * If the array contains multiple elements equal to the specified [element], there is no guarantee which one will be found.\n * \n * @param element the to search for.\n * @param fromIndex the start of the range (inclusive) to search in, 0 by default.\n * @param toIndex the end of the range (exclusive) to search in, size of this array by default.\n * \n * @return the index of the element, if it is contained in the array within the specified range;\n * otherwise, the inverted insertion point `(-insertion point - 1)`.\n * The insertion point is defined as the index at which the element should be inserted,\n * so that the array (or the specified subrange of array) still remains sorted.\n * \n * @throws IndexOutOfBoundsException if [fromIndex] is less than zero or [toIndex] is greater than the size of this array.\n * @throws IllegalArgumentException if [fromIndex] is greater than [toIndex].\n */"} {"signature":"public fun ByteArray . binarySearch ( element : Byte , fromIndex : Int = , toIndex : Int = size ) : Int","body":"{ return java . util . Arrays . binarySearch ( this , fromIndex , toIndex , element ) }","docstring":"/**\n * Searches the array or the range of the array for the provided [element] using the binary search algorithm.\n * The array is expected to be sorted, otherwise the result is undefined.\n * \n * If the array contains multiple elements equal to the specified [element], there is no guarantee which one will be found.\n * \n * @param element the to search for.\n * @param fromIndex the start of the range (inclusive) to search in, 0 by default.\n * @param toIndex the end of the range (exclusive) to search in, size of this array by default.\n * \n * @return the index of the element, if it is contained in the array within the specified range;\n * otherwise, the inverted insertion point `(-insertion point - 1)`.\n * The insertion point is defined as the index at which the element should be inserted,\n * so that the array (or the specified subrange of array) still remains sorted.\n * \n * @throws IndexOutOfBoundsException if [fromIndex] is less than zero or [toIndex] is greater than the size of this array.\n * @throws IllegalArgumentException if [fromIndex] is greater than [toIndex].\n */"} {"signature":"public fun ShortArray . binarySearch ( element : Short , fromIndex : Int = , toIndex : Int = size ) : Int","body":"{ return java . util . Arrays . binarySearch ( this , fromIndex , toIndex , element ) }","docstring":"/**\n * Searches the array or the range of the array for the provided [element] using the binary search algorithm.\n * The array is expected to be sorted, otherwise the result is undefined.\n * \n * If the array contains multiple elements equal to the specified [element], there is no guarantee which one will be found.\n * \n * @param element the to search for.\n * @param fromIndex the start of the range (inclusive) to search in, 0 by default.\n * @param toIndex the end of the range (exclusive) to search in, size of this array by default.\n * \n * @return the index of the element, if it is contained in the array within the specified range;\n * otherwise, the inverted insertion point `(-insertion point - 1)`.\n * The insertion point is defined as the index at which the element should be inserted,\n * so that the array (or the specified subrange of array) still remains sorted.\n * \n * @throws IndexOutOfBoundsException if [fromIndex] is less than zero or [toIndex] is greater than the size of this array.\n * @throws IllegalArgumentException if [fromIndex] is greater than [toIndex].\n */"} {"signature":"public fun IntArray . binarySearch ( element : Int , fromIndex : Int = , toIndex : Int = size ) : Int","body":"{ return java . util . Arrays . binarySearch ( this , fromIndex , toIndex , element ) }","docstring":"/**\n * Searches the array or the range of the array for the provided [element] using the binary search algorithm.\n * The array is expected to be sorted, otherwise the result is undefined.\n * \n * If the array contains multiple elements equal to the specified [element], there is no guarantee which one will be found.\n * \n * @param element the to search for.\n * @param fromIndex the start of the range (inclusive) to search in, 0 by default.\n * @param toIndex the end of the range (exclusive) to search in, size of this array by default.\n * \n * @return the index of the element, if it is contained in the array within the specified range;\n * otherwise, the inverted insertion point `(-insertion point - 1)`.\n * The insertion point is defined as the index at which the element should be inserted,\n * so that the array (or the specified subrange of array) still remains sorted.\n * \n * @throws IndexOutOfBoundsException if [fromIndex] is less than zero or [toIndex] is greater than the size of this array.\n * @throws IllegalArgumentException if [fromIndex] is greater than [toIndex].\n */"} {"signature":"public fun LongArray . binarySearch ( element : Long , fromIndex : Int = , toIndex : Int = size ) : Int","body":"{ return java . util . Arrays . binarySearch ( this , fromIndex , toIndex , element ) }","docstring":"/**\n * Searches the array or the range of the array for the provided [element] using the binary search algorithm.\n * The array is expected to be sorted, otherwise the result is undefined.\n * \n * If the array contains multiple elements equal to the specified [element], there is no guarantee which one will be found.\n * \n * @param element the to search for.\n * @param fromIndex the start of the range (inclusive) to search in, 0 by default.\n * @param toIndex the end of the range (exclusive) to search in, size of this array by default.\n * \n * @return the index of the element, if it is contained in the array within the specified range;\n * otherwise, the inverted insertion point `(-insertion point - 1)`.\n * The insertion point is defined as the index at which the element should be inserted,\n * so that the array (or the specified subrange of array) still remains sorted.\n * \n * @throws IndexOutOfBoundsException if [fromIndex] is less than zero or [toIndex] is greater than the size of this array.\n * @throws IllegalArgumentException if [fromIndex] is greater than [toIndex].\n */"} {"signature":"public fun FloatArray . binarySearch ( element : Float , fromIndex : Int = , toIndex : Int = size ) : Int","body":"{ return java . util . Arrays . binarySearch ( this , fromIndex , toIndex , element ) }","docstring":"/**\n * Searches the array or the range of the array for the provided [element] using the binary search algorithm.\n * The array is expected to be sorted, otherwise the result is undefined.\n * \n * If the array contains multiple elements equal to the specified [element], there is no guarantee which one will be found.\n * \n * @param element the to search for.\n * @param fromIndex the start of the range (inclusive) to search in, 0 by default.\n * @param toIndex the end of the range (exclusive) to search in, size of this array by default.\n * \n * @return the index of the element, if it is contained in the array within the specified range;\n * otherwise, the inverted insertion point `(-insertion point - 1)`.\n * The insertion point is defined as the index at which the element should be inserted,\n * so that the array (or the specified subrange of array) still remains sorted.\n * \n * @throws IndexOutOfBoundsException if [fromIndex] is less than zero or [toIndex] is greater than the size of this array.\n * @throws IllegalArgumentException if [fromIndex] is greater than [toIndex].\n */"} {"signature":"public fun DoubleArray . binarySearch ( element : Double , fromIndex : Int = , toIndex : Int = size ) : Int","body":"{ return java . util . Arrays . binarySearch ( this , fromIndex , toIndex , element ) }","docstring":"/**\n * Searches the array or the range of the array for the provided [element] using the binary search algorithm.\n * The array is expected to be sorted, otherwise the result is undefined.\n * \n * If the array contains multiple elements equal to the specified [element], there is no guarantee which one will be found.\n * \n * @param element the to search for.\n * @param fromIndex the start of the range (inclusive) to search in, 0 by default.\n * @param toIndex the end of the range (exclusive) to search in, size of this array by default.\n * \n * @return the index of the element, if it is contained in the array within the specified range;\n * otherwise, the inverted insertion point `(-insertion point - 1)`.\n * The insertion point is defined as the index at which the element should be inserted,\n * so that the array (or the specified subrange of array) still remains sorted.\n * \n * @throws IndexOutOfBoundsException if [fromIndex] is less than zero or [toIndex] is greater than the size of this array.\n * @throws IllegalArgumentException if [fromIndex] is greater than [toIndex].\n */"} {"signature":"public fun CharArray . binarySearch ( element : Char , fromIndex : Int = , toIndex : Int = size ) : Int","body":"{ return java . util . Arrays . binarySearch ( this , fromIndex , toIndex , element ) }","docstring":"/**\n * Searches the array or the range of the array for the provided [element] using the binary search algorithm.\n * The array is expected to be sorted, otherwise the result is undefined.\n * \n * If the array contains multiple elements equal to the specified [element], there is no guarantee which one will be found.\n * \n * @param element the to search for.\n * @param fromIndex the start of the range (inclusive) to search in, 0 by default.\n * @param toIndex the end of the range (exclusive) to search in, size of this array by default.\n * \n * @return the index of the element, if it is contained in the array within the specified range;\n * otherwise, the inverted insertion point `(-insertion point - 1)`.\n * The insertion point is defined as the index at which the element should be inserted,\n * so that the array (or the specified subrange of array) still remains sorted.\n * \n * @throws IndexOutOfBoundsException if [fromIndex] is less than zero or [toIndex] is greater than the size of this array.\n * @throws IllegalArgumentException if [fromIndex] is greater than [toIndex].\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . internal . LowPriorityInOverloadResolution @ JvmName ( \"\" ) @ kotlin . internal . InlineOnly public actual inline infix fun < T > Array < out T > . contentDeepEquals ( other : Array < out T > ) : Boolean","body":"{ return this . contentDeepEquals ( other ) }","docstring":"/**\n * Checks if the two specified arrays are *deeply* equal to one another.\n * \n * Two arrays are considered deeply equal if they have the same size, and elements at corresponding indices are deeply equal.\n * That is, if two corresponding elements are nested arrays, they are also compared deeply.\n * Elements of other types are compared for equality using the [equals][Any.equals] function.\n * For floating point numbers, this means `NaN` is equal to itself and `-0.0` is not equal to `0.0`.\n * \n * If any of the arrays contain themselves at any nesting level, the behavior is undefined.\n * \n * @param other the array to compare deeply with this array.\n * @return `true` if the two arrays are deeply equal, `false` otherwise.\n * \n * @sample samples.collections.Arrays.ContentOperations.contentDeepEquals\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ JvmName ( \"\" ) @ kotlin . internal . InlineOnly public actual inline infix fun < T > Array < out T > ? . contentDeepEquals ( other : Array < out T > ? ) : Boolean","body":"{ if ( kotlin . internal . apiVersionIsAtLeast ( , , ) ) return contentDeepEqualsImpl ( other ) else return java . util . Arrays . deepEquals ( this , other ) }","docstring":"/**\n * Checks if the two specified arrays are *deeply* equal to one another.\n * \n * Two arrays are considered deeply equal if they have the same size, and elements at corresponding indices are deeply equal.\n * That is, if two corresponding elements are nested arrays, they are also compared deeply.\n * Elements of other types are compared for equality using the [equals][Any.equals] function.\n * For floating point numbers, this means `NaN` is equal to itself and `-0.0` is not equal to `0.0`.\n * \n * The arrays are also considered deeply equal if both are `null`.\n * \n * If any of the arrays contain themselves at any nesting level, the behavior is undefined.\n * \n * @param other the array to compare deeply with this array.\n * @return `true` if the two arrays are deeply equal, `false` otherwise.\n * \n * @sample samples.collections.Arrays.ContentOperations.contentDeepEquals\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . internal . LowPriorityInOverloadResolution @ JvmName ( \"\" ) @ kotlin . internal . InlineOnly public actual inline fun < T > Array < out T > . contentDeepHashCode ( ) : Int","body":"{ return this . contentDeepHashCode ( ) }","docstring":"/**\n * Returns a hash code based on the contents of this array as if it is [List].\n * Nested arrays are treated as lists too.\n * \n * If any of arrays contains itself on any nesting level the behavior is undefined.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ JvmName ( \"\" ) @ kotlin . internal . InlineOnly public actual inline fun < T > Array < out T > ? . contentDeepHashCode ( ) : Int","body":"{ if ( kotlin . internal . apiVersionIsAtLeast ( , , ) ) return contentDeepHashCodeImpl ( ) else return java . util . Arrays . deepHashCode ( this ) }","docstring":"/**\n * Returns a hash code based on the contents of this array as if it is [List].\n * Nested arrays are treated as lists too.\n * \n * If any of arrays contains itself on any nesting level the behavior is undefined.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . internal . LowPriorityInOverloadResolution @ JvmName ( \"\" ) @ kotlin . internal . InlineOnly public actual inline fun < T > Array < out T > . contentDeepToString ( ) : String","body":"{ return this . contentDeepToString ( ) }","docstring":"/**\n * Returns a string representation of the contents of this array as if it is a [List].\n * Nested arrays are treated as lists too.\n * \n * If any of arrays contains itself on any nesting level that reference\n * is rendered as `\"[...]\"` to prevent recursion.\n * \n * @sample samples.collections.Arrays.ContentOperations.contentDeepToString\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ JvmName ( \"\" ) @ kotlin . internal . InlineOnly public actual inline fun < T > Array < out T > ? . contentDeepToString ( ) : String","body":"{ if ( kotlin . internal . apiVersionIsAtLeast ( , , ) ) return contentDeepToStringImpl ( ) else return java . util . Arrays . deepToString ( this ) }","docstring":"/**\n * Returns a string representation of the contents of this array as if it is a [List].\n * Nested arrays are treated as lists too.\n * \n * If any of arrays contains itself on any nesting level that reference\n * is rendered as `\"[...]\"` to prevent recursion.\n * \n * @sample samples.collections.Arrays.ContentOperations.contentDeepToString\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . internal . InlineOnly public actual inline infix fun < T > Array < out T > ? . contentEquals ( other : Array < out T > ? ) : Boolean","body":"{ return java . util . Arrays . equals ( this , other ) }","docstring":"/**\n * Checks if the two specified arrays are *structurally* equal to one another.\n * \n * Two arrays are considered structurally equal if they have the same size, and elements at corresponding indices are equal.\n * Elements are compared for equality using the [equals][Any.equals] function.\n * For floating point numbers, this means `NaN` is equal to itself and `-0.0` is not equal to `0.0`.\n * \n * The arrays are also considered structurally equal if both are `null`.\n * \n * If the arrays contain nested arrays, use [contentDeepEquals] to recursively compare their elements.\n * \n * @param other the array to compare with this array.\n * @return `true` if the two arrays are structurally equal, `false` otherwise.\n * \n * @sample samples.collections.Arrays.ContentOperations.arrayContentEquals\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . internal . InlineOnly public actual inline infix fun ByteArray ? . contentEquals ( other : ByteArray ? ) : Boolean","body":"{ return java . util . Arrays . equals ( this , other ) }","docstring":"/**\n * Checks if the two specified arrays are *structurally* equal to one another.\n * \n * Two arrays are considered structurally equal if they have the same size, and elements at corresponding indices are equal.\n * \n * The arrays are also considered structurally equal if both are `null`.\n * \n * @param other the array to compare with this array.\n * @return `true` if the two arrays are structurally equal, `false` otherwise.\n * \n * @sample samples.collections.Arrays.ContentOperations.intArrayContentEquals\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . internal . InlineOnly public actual inline infix fun ShortArray ? . contentEquals ( other : ShortArray ? ) : Boolean","body":"{ return java . util . Arrays . equals ( this , other ) }","docstring":"/**\n * Checks if the two specified arrays are *structurally* equal to one another.\n * \n * Two arrays are considered structurally equal if they have the same size, and elements at corresponding indices are equal.\n * \n * The arrays are also considered structurally equal if both are `null`.\n * \n * @param other the array to compare with this array.\n * @return `true` if the two arrays are structurally equal, `false` otherwise.\n * \n * @sample samples.collections.Arrays.ContentOperations.intArrayContentEquals\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . internal . InlineOnly public actual inline infix fun IntArray ? . contentEquals ( other : IntArray ? ) : Boolean","body":"{ return java . util . Arrays . equals ( this , other ) }","docstring":"/**\n * Checks if the two specified arrays are *structurally* equal to one another.\n * \n * Two arrays are considered structurally equal if they have the same size, and elements at corresponding indices are equal.\n * \n * The arrays are also considered structurally equal if both are `null`.\n * \n * @param other the array to compare with this array.\n * @return `true` if the two arrays are structurally equal, `false` otherwise.\n * \n * @sample samples.collections.Arrays.ContentOperations.intArrayContentEquals\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . internal . InlineOnly public actual inline infix fun LongArray ? . contentEquals ( other : LongArray ? ) : Boolean","body":"{ return java . util . Arrays . equals ( this , other ) }","docstring":"/**\n * Checks if the two specified arrays are *structurally* equal to one another.\n * \n * Two arrays are considered structurally equal if they have the same size, and elements at corresponding indices are equal.\n * \n * The arrays are also considered structurally equal if both are `null`.\n * \n * @param other the array to compare with this array.\n * @return `true` if the two arrays are structurally equal, `false` otherwise.\n * \n * @sample samples.collections.Arrays.ContentOperations.intArrayContentEquals\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . internal . InlineOnly public actual inline infix fun FloatArray ? . contentEquals ( other : FloatArray ? ) : Boolean","body":"{ return java . util . Arrays . equals ( this , other ) }","docstring":"/**\n * Checks if the two specified arrays are *structurally* equal to one another.\n * \n * Two arrays are considered structurally equal if they have the same size, and elements at corresponding indices are equal.\n * Elements are compared for equality using the [equals][Any.equals] function.\n * This means `NaN` is equal to itself and `-0.0` is not equal to `0.0`.\n * \n * The arrays are also considered structurally equal if both are `null`.\n * \n * @param other the array to compare with this array.\n * @return `true` if the two arrays are structurally equal, `false` otherwise.\n * \n * @sample samples.collections.Arrays.ContentOperations.doubleArrayContentEquals\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . internal . InlineOnly public actual inline infix fun DoubleArray ? . contentEquals ( other : DoubleArray ? ) : Boolean","body":"{ return java . util . Arrays . equals ( this , other ) }","docstring":"/**\n * Checks if the two specified arrays are *structurally* equal to one another.\n * \n * Two arrays are considered structurally equal if they have the same size, and elements at corresponding indices are equal.\n * Elements are compared for equality using the [equals][Any.equals] function.\n * This means `NaN` is equal to itself and `-0.0` is not equal to `0.0`.\n * \n * The arrays are also considered structurally equal if both are `null`.\n * \n * @param other the array to compare with this array.\n * @return `true` if the two arrays are structurally equal, `false` otherwise.\n * \n * @sample samples.collections.Arrays.ContentOperations.doubleArrayContentEquals\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . internal . InlineOnly public actual inline infix fun BooleanArray ? . contentEquals ( other : BooleanArray ? ) : Boolean","body":"{ return java . util . Arrays . equals ( this , other ) }","docstring":"/**\n * Checks if the two specified arrays are *structurally* equal to one another.\n * \n * Two arrays are considered structurally equal if they have the same size, and elements at corresponding indices are equal.\n * \n * The arrays are also considered structurally equal if both are `null`.\n * \n * @param other the array to compare with this array.\n * @return `true` if the two arrays are structurally equal, `false` otherwise.\n * \n * @sample samples.collections.Arrays.ContentOperations.booleanArrayContentEquals\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . internal . InlineOnly public actual inline infix fun CharArray ? . contentEquals ( other : CharArray ? ) : Boolean","body":"{ return java . util . Arrays . equals ( this , other ) }","docstring":"/**\n * Checks if the two specified arrays are *structurally* equal to one another.\n * \n * Two arrays are considered structurally equal if they have the same size, and elements at corresponding indices are equal.\n * \n * The arrays are also considered structurally equal if both are `null`.\n * \n * @param other the array to compare with this array.\n * @return `true` if the two arrays are structurally equal, `false` otherwise.\n * \n * @sample samples.collections.Arrays.ContentOperations.charArrayContentEquals\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . internal . InlineOnly public actual inline fun < T > Array < out T > ? . contentHashCode ( ) : Int","body":"{ return java . util . Arrays . hashCode ( this ) }","docstring":"/**\n * Returns a hash code based on the contents of this array as if it is [List].\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . internal . InlineOnly public actual inline fun ByteArray ? . contentHashCode ( ) : Int","body":"{ return java . util . Arrays . hashCode ( this ) }","docstring":"/**\n * Returns a hash code based on the contents of this array as if it is [List].\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . internal . InlineOnly public actual inline fun ShortArray ? . contentHashCode ( ) : Int","body":"{ return java . util . Arrays . hashCode ( this ) }","docstring":"/**\n * Returns a hash code based on the contents of this array as if it is [List].\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . internal . InlineOnly public actual inline fun IntArray ? . contentHashCode ( ) : Int","body":"{ return java . util . Arrays . hashCode ( this ) }","docstring":"/**\n * Returns a hash code based on the contents of this array as if it is [List].\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . internal . InlineOnly public actual inline fun LongArray ? . contentHashCode ( ) : Int","body":"{ return java . util . Arrays . hashCode ( this ) }","docstring":"/**\n * Returns a hash code based on the contents of this array as if it is [List].\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . internal . InlineOnly public actual inline fun FloatArray ? . contentHashCode ( ) : Int","body":"{ return java . util . Arrays . hashCode ( this ) }","docstring":"/**\n * Returns a hash code based on the contents of this array as if it is [List].\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . internal . InlineOnly public actual inline fun DoubleArray ? . contentHashCode ( ) : Int","body":"{ return java . util . Arrays . hashCode ( this ) }","docstring":"/**\n * Returns a hash code based on the contents of this array as if it is [List].\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . internal . InlineOnly public actual inline fun BooleanArray ? . contentHashCode ( ) : Int","body":"{ return java . util . Arrays . hashCode ( this ) }","docstring":"/**\n * Returns a hash code based on the contents of this array as if it is [List].\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . internal . InlineOnly public actual inline fun CharArray ? . contentHashCode ( ) : Int","body":"{ return java . util . Arrays . hashCode ( this ) }","docstring":"/**\n * Returns a hash code based on the contents of this array as if it is [List].\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . internal . InlineOnly public actual inline fun < T > Array < out T > ? . contentToString ( ) : String","body":"{ return java . util . Arrays . toString ( this ) }","docstring":"/**\n * Returns a string representation of the contents of the specified array as if it is [List].\n * \n * @sample samples.collections.Arrays.ContentOperations.contentToString\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . internal . InlineOnly public actual inline fun ByteArray ? . contentToString ( ) : String","body":"{ return java . util . Arrays . toString ( this ) }","docstring":"/**\n * Returns a string representation of the contents of the specified array as if it is [List].\n * \n * @sample samples.collections.Arrays.ContentOperations.contentToString\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . internal . InlineOnly public actual inline fun ShortArray ? . contentToString ( ) : String","body":"{ return java . util . Arrays . toString ( this ) }","docstring":"/**\n * Returns a string representation of the contents of the specified array as if it is [List].\n * \n * @sample samples.collections.Arrays.ContentOperations.contentToString\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . internal . InlineOnly public actual inline fun IntArray ? . contentToString ( ) : String","body":"{ return java . util . Arrays . toString ( this ) }","docstring":"/**\n * Returns a string representation of the contents of the specified array as if it is [List].\n * \n * @sample samples.collections.Arrays.ContentOperations.contentToString\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . internal . InlineOnly public actual inline fun LongArray ? . contentToString ( ) : String","body":"{ return java . util . Arrays . toString ( this ) }","docstring":"/**\n * Returns a string representation of the contents of the specified array as if it is [List].\n * \n * @sample samples.collections.Arrays.ContentOperations.contentToString\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . internal . InlineOnly public actual inline fun FloatArray ? . contentToString ( ) : String","body":"{ return java . util . Arrays . toString ( this ) }","docstring":"/**\n * Returns a string representation of the contents of the specified array as if it is [List].\n * \n * @sample samples.collections.Arrays.ContentOperations.contentToString\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . internal . InlineOnly public actual inline fun DoubleArray ? . contentToString ( ) : String","body":"{ return java . util . Arrays . toString ( this ) }","docstring":"/**\n * Returns a string representation of the contents of the specified array as if it is [List].\n * \n * @sample samples.collections.Arrays.ContentOperations.contentToString\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . internal . InlineOnly public actual inline fun BooleanArray ? . contentToString ( ) : String","body":"{ return java . util . Arrays . toString ( this ) }","docstring":"/**\n * Returns a string representation of the contents of the specified array as if it is [List].\n * \n * @sample samples.collections.Arrays.ContentOperations.contentToString\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . internal . InlineOnly public actual inline fun CharArray ? . contentToString ( ) : String","body":"{ return java . util . Arrays . toString ( this ) }","docstring":"/**\n * Returns a string representation of the contents of the specified array as if it is [List].\n * \n * @sample samples.collections.Arrays.ContentOperations.contentToString\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ Suppress ( \"\" ) public actual fun < T > Array < out T > . copyInto ( destination : Array < T > , destinationOffset : Int = , startIndex : Int = , endIndex : Int = size ) : Array < T >","body":"{ System . arraycopy ( this , startIndex , destination , destinationOffset , endIndex - startIndex ) return destination }","docstring":"/**\n * Copies this array or its subrange into the [destination] array and returns that array.\n * \n * It's allowed to pass the same array in the [destination] and even specify the subrange so that it overlaps with the destination range.\n * \n * @param destination the array to copy to.\n * @param destinationOffset the position in the [destination] array to copy to, 0 by default.\n * @param startIndex the beginning (inclusive) of the subrange to copy, 0 by default.\n * @param endIndex the end (exclusive) of the subrange to copy, size of this array by default.\n * \n * @throws IndexOutOfBoundsException or [IllegalArgumentException] when [startIndex] or [endIndex] is out of range of this array 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 * \n * @return the [destination] array.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ Suppress ( \"\" ) public actual fun ByteArray . copyInto ( destination : ByteArray , destinationOffset : Int = , startIndex : Int = , endIndex : Int = size ) : ByteArray","body":"{ System . arraycopy ( this , startIndex , destination , destinationOffset , endIndex - startIndex ) return destination }","docstring":"/**\n * Copies this array or its subrange into the [destination] array and returns that array.\n * \n * It's allowed to pass the same array in the [destination] and even specify the subrange so that it overlaps with the destination range.\n * \n * @param destination the array to copy to.\n * @param destinationOffset the position in the [destination] array to copy to, 0 by default.\n * @param startIndex the beginning (inclusive) of the subrange to copy, 0 by default.\n * @param endIndex the end (exclusive) of the subrange to copy, size of this array by default.\n * \n * @throws IndexOutOfBoundsException or [IllegalArgumentException] when [startIndex] or [endIndex] is out of range of this array 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 * \n * @return the [destination] array.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ Suppress ( \"\" ) public actual fun ShortArray . copyInto ( destination : ShortArray , destinationOffset : Int = , startIndex : Int = , endIndex : Int = size ) : ShortArray","body":"{ System . arraycopy ( this , startIndex , destination , destinationOffset , endIndex - startIndex ) return destination }","docstring":"/**\n * Copies this array or its subrange into the [destination] array and returns that array.\n * \n * It's allowed to pass the same array in the [destination] and even specify the subrange so that it overlaps with the destination range.\n * \n * @param destination the array to copy to.\n * @param destinationOffset the position in the [destination] array to copy to, 0 by default.\n * @param startIndex the beginning (inclusive) of the subrange to copy, 0 by default.\n * @param endIndex the end (exclusive) of the subrange to copy, size of this array by default.\n * \n * @throws IndexOutOfBoundsException or [IllegalArgumentException] when [startIndex] or [endIndex] is out of range of this array 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 * \n * @return the [destination] array.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ Suppress ( \"\" ) public actual fun IntArray . copyInto ( destination : IntArray , destinationOffset : Int = , startIndex : Int = , endIndex : Int = size ) : IntArray","body":"{ System . arraycopy ( this , startIndex , destination , destinationOffset , endIndex - startIndex ) return destination }","docstring":"/**\n * Copies this array or its subrange into the [destination] array and returns that array.\n * \n * It's allowed to pass the same array in the [destination] and even specify the subrange so that it overlaps with the destination range.\n * \n * @param destination the array to copy to.\n * @param destinationOffset the position in the [destination] array to copy to, 0 by default.\n * @param startIndex the beginning (inclusive) of the subrange to copy, 0 by default.\n * @param endIndex the end (exclusive) of the subrange to copy, size of this array by default.\n * \n * @throws IndexOutOfBoundsException or [IllegalArgumentException] when [startIndex] or [endIndex] is out of range of this array 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 * \n * @return the [destination] array.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ Suppress ( \"\" ) public actual fun LongArray . copyInto ( destination : LongArray , destinationOffset : Int = , startIndex : Int = , endIndex : Int = size ) : LongArray","body":"{ System . arraycopy ( this , startIndex , destination , destinationOffset , endIndex - startIndex ) return destination }","docstring":"/**\n * Copies this array or its subrange into the [destination] array and returns that array.\n * \n * It's allowed to pass the same array in the [destination] and even specify the subrange so that it overlaps with the destination range.\n * \n * @param destination the array to copy to.\n * @param destinationOffset the position in the [destination] array to copy to, 0 by default.\n * @param startIndex the beginning (inclusive) of the subrange to copy, 0 by default.\n * @param endIndex the end (exclusive) of the subrange to copy, size of this array by default.\n * \n * @throws IndexOutOfBoundsException or [IllegalArgumentException] when [startIndex] or [endIndex] is out of range of this array 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 * \n * @return the [destination] array.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ Suppress ( \"\" ) public actual fun FloatArray . copyInto ( destination : FloatArray , destinationOffset : Int = , startIndex : Int = , endIndex : Int = size ) : FloatArray","body":"{ System . arraycopy ( this , startIndex , destination , destinationOffset , endIndex - startIndex ) return destination }","docstring":"/**\n * Copies this array or its subrange into the [destination] array and returns that array.\n * \n * It's allowed to pass the same array in the [destination] and even specify the subrange so that it overlaps with the destination range.\n * \n * @param destination the array to copy to.\n * @param destinationOffset the position in the [destination] array to copy to, 0 by default.\n * @param startIndex the beginning (inclusive) of the subrange to copy, 0 by default.\n * @param endIndex the end (exclusive) of the subrange to copy, size of this array by default.\n * \n * @throws IndexOutOfBoundsException or [IllegalArgumentException] when [startIndex] or [endIndex] is out of range of this array 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 * \n * @return the [destination] array.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ Suppress ( \"\" ) public actual fun DoubleArray . copyInto ( destination : DoubleArray , destinationOffset : Int = , startIndex : Int = , endIndex : Int = size ) : DoubleArray","body":"{ System . arraycopy ( this , startIndex , destination , destinationOffset , endIndex - startIndex ) return destination }","docstring":"/**\n * Copies this array or its subrange into the [destination] array and returns that array.\n * \n * It's allowed to pass the same array in the [destination] and even specify the subrange so that it overlaps with the destination range.\n * \n * @param destination the array to copy to.\n * @param destinationOffset the position in the [destination] array to copy to, 0 by default.\n * @param startIndex the beginning (inclusive) of the subrange to copy, 0 by default.\n * @param endIndex the end (exclusive) of the subrange to copy, size of this array by default.\n * \n * @throws IndexOutOfBoundsException or [IllegalArgumentException] when [startIndex] or [endIndex] is out of range of this array 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 * \n * @return the [destination] array.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ Suppress ( \"\" ) public actual fun BooleanArray . copyInto ( destination : BooleanArray , destinationOffset : Int = , startIndex : Int = , endIndex : Int = size ) : BooleanArray","body":"{ System . arraycopy ( this , startIndex , destination , destinationOffset , endIndex - startIndex ) return destination }","docstring":"/**\n * Copies this array or its subrange into the [destination] array and returns that array.\n * \n * It's allowed to pass the same array in the [destination] and even specify the subrange so that it overlaps with the destination range.\n * \n * @param destination the array to copy to.\n * @param destinationOffset the position in the [destination] array to copy to, 0 by default.\n * @param startIndex the beginning (inclusive) of the subrange to copy, 0 by default.\n * @param endIndex the end (exclusive) of the subrange to copy, size of this array by default.\n * \n * @throws IndexOutOfBoundsException or [IllegalArgumentException] when [startIndex] or [endIndex] is out of range of this array 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 * \n * @return the [destination] array.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ Suppress ( \"\" ) public actual fun CharArray . copyInto ( destination : CharArray , destinationOffset : Int = , startIndex : Int = , endIndex : Int = size ) : CharArray","body":"{ System . arraycopy ( this , startIndex , destination , destinationOffset , endIndex - startIndex ) return destination }","docstring":"/**\n * Copies this array or its subrange into the [destination] array and returns that array.\n * \n * It's allowed to pass the same array in the [destination] and even specify the subrange so that it overlaps with the destination range.\n * \n * @param destination the array to copy to.\n * @param destinationOffset the position in the [destination] array to copy to, 0 by default.\n * @param startIndex the beginning (inclusive) of the subrange to copy, 0 by default.\n * @param endIndex the end (exclusive) of the subrange to copy, size of this array by default.\n * \n * @throws IndexOutOfBoundsException or [IllegalArgumentException] when [startIndex] or [endIndex] is out of range of this array 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 * \n * @return the [destination] array.\n */"} {"signature":"@ kotlin . internal . InlineOnly public actual inline fun < T > Array < T > . copyOf ( ) : Array < T >","body":"{ return java . util . Arrays . copyOf ( this , size ) }","docstring":"/**\n * Returns new array which is a copy of the original array.\n * \n * @sample samples.collections.Arrays.CopyOfOperations.copyOf\n */"} {"signature":"@ kotlin . internal . InlineOnly public actual inline fun ByteArray . copyOf ( ) : ByteArray","body":"{ return java . util . Arrays . copyOf ( this , size ) }","docstring":"/**\n * Returns new array which is a copy of the original array.\n * \n * @sample samples.collections.Arrays.CopyOfOperations.copyOf\n */"} {"signature":"@ kotlin . internal . InlineOnly public actual inline fun ShortArray . copyOf ( ) : ShortArray","body":"{ return java . util . Arrays . copyOf ( this , size ) }","docstring":"/**\n * Returns new array which is a copy of the original array.\n * \n * @sample samples.collections.Arrays.CopyOfOperations.copyOf\n */"} {"signature":"@ kotlin . internal . InlineOnly public actual inline fun IntArray . copyOf ( ) : IntArray","body":"{ return java . util . Arrays . copyOf ( this , size ) }","docstring":"/**\n * Returns new array which is a copy of the original array.\n * \n * @sample samples.collections.Arrays.CopyOfOperations.copyOf\n */"} {"signature":"@ kotlin . internal . InlineOnly public actual inline fun LongArray . copyOf ( ) : LongArray","body":"{ return java . util . Arrays . copyOf ( this , size ) }","docstring":"/**\n * Returns new array which is a copy of the original array.\n * \n * @sample samples.collections.Arrays.CopyOfOperations.copyOf\n */"} {"signature":"@ kotlin . internal . InlineOnly public actual inline fun FloatArray . copyOf ( ) : FloatArray","body":"{ return java . util . Arrays . copyOf ( this , size ) }","docstring":"/**\n * Returns new array which is a copy of the original array.\n * \n * @sample samples.collections.Arrays.CopyOfOperations.copyOf\n */"} {"signature":"@ kotlin . internal . InlineOnly public actual inline fun DoubleArray . copyOf ( ) : DoubleArray","body":"{ return java . util . Arrays . copyOf ( this , size ) }","docstring":"/**\n * Returns new array which is a copy of the original array.\n * \n * @sample samples.collections.Arrays.CopyOfOperations.copyOf\n */"} {"signature":"@ kotlin . internal . InlineOnly public actual inline fun BooleanArray . copyOf ( ) : BooleanArray","body":"{ return java . util . Arrays . copyOf ( this , size ) }","docstring":"/**\n * Returns new array which is a copy of the original array.\n * \n * @sample samples.collections.Arrays.CopyOfOperations.copyOf\n */"} {"signature":"@ kotlin . internal . InlineOnly public actual inline fun CharArray . copyOf ( ) : CharArray","body":"{ return java . util . Arrays . copyOf ( this , size ) }","docstring":"/**\n * Returns new array which is a copy of the original array.\n * \n * @sample samples.collections.Arrays.CopyOfOperations.copyOf\n */"} {"signature":"@ kotlin . internal . InlineOnly public actual inline fun ByteArray . copyOf ( newSize : Int ) : ByteArray","body":"{ return java . util . Arrays . copyOf ( this , newSize ) }","docstring":"/**\n * Returns new array which is a copy of the original array, resized to the given [newSize].\n * The copy is either truncated or padded at the end with zero values if necessary.\n * \n * - If [newSize] is less than the size of the original array, the copy array is truncated to the [newSize].\n * - If [newSize] is greater than the size of the original array, the extra elements in the copy array are filled with zero values.\n * \n * @sample samples.collections.Arrays.CopyOfOperations.resizedPrimitiveCopyOf\n */"} {"signature":"@ kotlin . internal . InlineOnly public actual inline fun ShortArray . copyOf ( newSize : Int ) : ShortArray","body":"{ return java . util . Arrays . copyOf ( this , newSize ) }","docstring":"/**\n * Returns new array which is a copy of the original array, resized to the given [newSize].\n * The copy is either truncated or padded at the end with zero values if necessary.\n * \n * - If [newSize] is less than the size of the original array, the copy array is truncated to the [newSize].\n * - If [newSize] is greater than the size of the original array, the extra elements in the copy array are filled with zero values.\n * \n * @sample samples.collections.Arrays.CopyOfOperations.resizedPrimitiveCopyOf\n */"} {"signature":"@ kotlin . internal . InlineOnly public actual inline fun IntArray . copyOf ( newSize : Int ) : IntArray","body":"{ return java . util . Arrays . copyOf ( this , newSize ) }","docstring":"/**\n * Returns new array which is a copy of the original array, resized to the given [newSize].\n * The copy is either truncated or padded at the end with zero values if necessary.\n * \n * - If [newSize] is less than the size of the original array, the copy array is truncated to the [newSize].\n * - If [newSize] is greater than the size of the original array, the extra elements in the copy array are filled with zero values.\n * \n * @sample samples.collections.Arrays.CopyOfOperations.resizedPrimitiveCopyOf\n */"} {"signature":"@ kotlin . internal . InlineOnly public actual inline fun LongArray . copyOf ( newSize : Int ) : LongArray","body":"{ return java . util . Arrays . copyOf ( this , newSize ) }","docstring":"/**\n * Returns new array which is a copy of the original array, resized to the given [newSize].\n * The copy is either truncated or padded at the end with zero values if necessary.\n * \n * - If [newSize] is less than the size of the original array, the copy array is truncated to the [newSize].\n * - If [newSize] is greater than the size of the original array, the extra elements in the copy array are filled with zero values.\n * \n * @sample samples.collections.Arrays.CopyOfOperations.resizedPrimitiveCopyOf\n */"} {"signature":"@ kotlin . internal . InlineOnly public actual inline fun FloatArray . copyOf ( newSize : Int ) : FloatArray","body":"{ return java . util . Arrays . copyOf ( this , newSize ) }","docstring":"/**\n * Returns new array which is a copy of the original array, resized to the given [newSize].\n * The copy is either truncated or padded at the end with zero values if necessary.\n * \n * - If [newSize] is less than the size of the original array, the copy array is truncated to the [newSize].\n * - If [newSize] is greater than the size of the original array, the extra elements in the copy array are filled with zero values.\n * \n * @sample samples.collections.Arrays.CopyOfOperations.resizedPrimitiveCopyOf\n */"} {"signature":"@ kotlin . internal . InlineOnly public actual inline fun DoubleArray . copyOf ( newSize : Int ) : DoubleArray","body":"{ return java . util . Arrays . copyOf ( this , newSize ) }","docstring":"/**\n * Returns new array which is a copy of the original array, resized to the given [newSize].\n * The copy is either truncated or padded at the end with zero values if necessary.\n * \n * - If [newSize] is less than the size of the original array, the copy array is truncated to the [newSize].\n * - If [newSize] is greater than the size of the original array, the extra elements in the copy array are filled with zero values.\n * \n * @sample samples.collections.Arrays.CopyOfOperations.resizedPrimitiveCopyOf\n */"} {"signature":"@ kotlin . internal . InlineOnly public actual inline fun BooleanArray . copyOf ( newSize : Int ) : BooleanArray","body":"{ return java . util . Arrays . copyOf ( this , newSize ) }","docstring":"/**\n * Returns new array which is a copy of the original array, resized to the given [newSize].\n * The copy is either truncated or padded at the end with `false` values if necessary.\n * \n * - If [newSize] is less than the size of the original array, the copy array is truncated to the [newSize].\n * - If [newSize] is greater than the size of the original array, the extra elements in the copy array are filled with `false` values.\n * \n * @sample samples.collections.Arrays.CopyOfOperations.resizedPrimitiveCopyOf\n */"} {"signature":"@ kotlin . internal . InlineOnly public actual inline fun CharArray . copyOf ( newSize : Int ) : CharArray","body":"{ return java . util . Arrays . copyOf ( this , newSize ) }","docstring":"/**\n * Returns new array which is a copy of the original array, resized to the given [newSize].\n * The copy is either truncated or padded at the end with null char (`\\u0000`) values if necessary.\n * \n * - If [newSize] is less than the size of the original array, the copy array is truncated to the [newSize].\n * - If [newSize] is greater than the size of the original array, the extra elements in the copy array are filled with null char (`\\u0000`) values.\n * \n * @sample samples.collections.Arrays.CopyOfOperations.resizedPrimitiveCopyOf\n */"} {"signature":"@ kotlin . internal . InlineOnly public actual inline fun < T > Array < T > . copyOf ( newSize : Int ) : Array < T ? >","body":"{ return java . util . Arrays . copyOf ( this , newSize ) }","docstring":"/**\n * Returns new array which is a copy of the original array, resized to the given [newSize].\n * The copy is either truncated or padded at the end with `null` values if necessary.\n * \n * - If [newSize] is less than the size of the original array, the copy array is truncated to the [newSize].\n * - If [newSize] is greater than the size of the original array, the extra elements in the copy array are filled with `null` values.\n * \n * @sample samples.collections.Arrays.CopyOfOperations.resizingCopyOf\n */"} {"signature":"@ JvmName ( \"\" ) @ kotlin . internal . InlineOnly public actual inline fun < T > Array < T > . copyOfRange ( fromIndex : Int , toIndex : Int ) : Array < T >","body":"{ return if ( kotlin . internal . apiVersionIsAtLeast ( , , ) ) { copyOfRangeImpl ( fromIndex , toIndex ) } else { if ( toIndex > size ) throw IndexOutOfBoundsException ( \"\" ) java . util . Arrays . copyOfRange ( this , fromIndex , toIndex ) } }","docstring":"/**\n * Returns a new array which is a copy of the specified range of the original array.\n * \n * @param fromIndex the start of the range (inclusive) to copy.\n * @param toIndex the end of the range (exclusive) to copy.\n * \n * @throws IndexOutOfBoundsException if [fromIndex] is less than zero or [toIndex] is greater than the size of this array.\n * @throws IllegalArgumentException if [fromIndex] is greater than [toIndex].\n */"} {"signature":"@ JvmName ( \"\" ) @ kotlin . internal . InlineOnly public actual inline fun ByteArray . copyOfRange ( fromIndex : Int , toIndex : Int ) : ByteArray","body":"{ return if ( kotlin . internal . apiVersionIsAtLeast ( , , ) ) { copyOfRangeImpl ( fromIndex , toIndex ) } else { if ( toIndex > size ) throw IndexOutOfBoundsException ( \"\" ) java . util . Arrays . copyOfRange ( this , fromIndex , toIndex ) } }","docstring":"/**\n * Returns a new array which is a copy of the specified range of the original array.\n * \n * @param fromIndex the start of the range (inclusive) to copy.\n * @param toIndex the end of the range (exclusive) to copy.\n * \n * @throws IndexOutOfBoundsException if [fromIndex] is less than zero or [toIndex] is greater than the size of this array.\n * @throws IllegalArgumentException if [fromIndex] is greater than [toIndex].\n */"} {"signature":"@ JvmName ( \"\" ) @ kotlin . internal . InlineOnly public actual inline fun ShortArray . copyOfRange ( fromIndex : Int , toIndex : Int ) : ShortArray","body":"{ return if ( kotlin . internal . apiVersionIsAtLeast ( , , ) ) { copyOfRangeImpl ( fromIndex , toIndex ) } else { if ( toIndex > size ) throw IndexOutOfBoundsException ( \"\" ) java . util . Arrays . copyOfRange ( this , fromIndex , toIndex ) } }","docstring":"/**\n * Returns a new array which is a copy of the specified range of the original array.\n * \n * @param fromIndex the start of the range (inclusive) to copy.\n * @param toIndex the end of the range (exclusive) to copy.\n * \n * @throws IndexOutOfBoundsException if [fromIndex] is less than zero or [toIndex] is greater than the size of this array.\n * @throws IllegalArgumentException if [fromIndex] is greater than [toIndex].\n */"} {"signature":"@ JvmName ( \"\" ) @ kotlin . internal . InlineOnly public actual inline fun IntArray . copyOfRange ( fromIndex : Int , toIndex : Int ) : IntArray","body":"{ return if ( kotlin . internal . apiVersionIsAtLeast ( , , ) ) { copyOfRangeImpl ( fromIndex , toIndex ) } else { if ( toIndex > size ) throw IndexOutOfBoundsException ( \"\" ) java . util . Arrays . copyOfRange ( this , fromIndex , toIndex ) } }","docstring":"/**\n * Returns a new array which is a copy of the specified range of the original array.\n * \n * @param fromIndex the start of the range (inclusive) to copy.\n * @param toIndex the end of the range (exclusive) to copy.\n * \n * @throws IndexOutOfBoundsException if [fromIndex] is less than zero or [toIndex] is greater than the size of this array.\n * @throws IllegalArgumentException if [fromIndex] is greater than [toIndex].\n */"} {"signature":"@ JvmName ( \"\" ) @ kotlin . internal . InlineOnly public actual inline fun LongArray . copyOfRange ( fromIndex : Int , toIndex : Int ) : LongArray","body":"{ return if ( kotlin . internal . apiVersionIsAtLeast ( , , ) ) { copyOfRangeImpl ( fromIndex , toIndex ) } else { if ( toIndex > size ) throw IndexOutOfBoundsException ( \"\" ) java . util . Arrays . copyOfRange ( this , fromIndex , toIndex ) } }","docstring":"/**\n * Returns a new array which is a copy of the specified range of the original array.\n * \n * @param fromIndex the start of the range (inclusive) to copy.\n * @param toIndex the end of the range (exclusive) to copy.\n * \n * @throws IndexOutOfBoundsException if [fromIndex] is less than zero or [toIndex] is greater than the size of this array.\n * @throws IllegalArgumentException if [fromIndex] is greater than [toIndex].\n */"} {"signature":"@ JvmName ( \"\" ) @ kotlin . internal . InlineOnly public actual inline fun FloatArray . copyOfRange ( fromIndex : Int , toIndex : Int ) : FloatArray","body":"{ return if ( kotlin . internal . apiVersionIsAtLeast ( , , ) ) { copyOfRangeImpl ( fromIndex , toIndex ) } else { if ( toIndex > size ) throw IndexOutOfBoundsException ( \"\" ) java . util . Arrays . copyOfRange ( this , fromIndex , toIndex ) } }","docstring":"/**\n * Returns a new array which is a copy of the specified range of the original array.\n * \n * @param fromIndex the start of the range (inclusive) to copy.\n * @param toIndex the end of the range (exclusive) to copy.\n * \n * @throws IndexOutOfBoundsException if [fromIndex] is less than zero or [toIndex] is greater than the size of this array.\n * @throws IllegalArgumentException if [fromIndex] is greater than [toIndex].\n */"} {"signature":"@ JvmName ( \"\" ) @ kotlin . internal . InlineOnly public actual inline fun DoubleArray . copyOfRange ( fromIndex : Int , toIndex : Int ) : DoubleArray","body":"{ return if ( kotlin . internal . apiVersionIsAtLeast ( , , ) ) { copyOfRangeImpl ( fromIndex , toIndex ) } else { if ( toIndex > size ) throw IndexOutOfBoundsException ( \"\" ) java . util . Arrays . copyOfRange ( this , fromIndex , toIndex ) } }","docstring":"/**\n * Returns a new array which is a copy of the specified range of the original array.\n * \n * @param fromIndex the start of the range (inclusive) to copy.\n * @param toIndex the end of the range (exclusive) to copy.\n * \n * @throws IndexOutOfBoundsException if [fromIndex] is less than zero or [toIndex] is greater than the size of this array.\n * @throws IllegalArgumentException if [fromIndex] is greater than [toIndex].\n */"} {"signature":"@ JvmName ( \"\" ) @ kotlin . internal . InlineOnly public actual inline fun BooleanArray . copyOfRange ( fromIndex : Int , toIndex : Int ) : BooleanArray","body":"{ return if ( kotlin . internal . apiVersionIsAtLeast ( , , ) ) { copyOfRangeImpl ( fromIndex , toIndex ) } else { if ( toIndex > size ) throw IndexOutOfBoundsException ( \"\" ) java . util . Arrays . copyOfRange ( this , fromIndex , toIndex ) } }","docstring":"/**\n * Returns a new array which is a copy of the specified range of the original array.\n * \n * @param fromIndex the start of the range (inclusive) to copy.\n * @param toIndex the end of the range (exclusive) to copy.\n * \n * @throws IndexOutOfBoundsException if [fromIndex] is less than zero or [toIndex] is greater than the size of this array.\n * @throws IllegalArgumentException if [fromIndex] is greater than [toIndex].\n */"} {"signature":"@ JvmName ( \"\" ) @ kotlin . internal . InlineOnly public actual inline fun CharArray . copyOfRange ( fromIndex : Int , toIndex : Int ) : CharArray","body":"{ return if ( kotlin . internal . apiVersionIsAtLeast ( , , ) ) { copyOfRangeImpl ( fromIndex , toIndex ) } else { if ( toIndex > size ) throw IndexOutOfBoundsException ( \"\" ) java . util . Arrays . copyOfRange ( this , fromIndex , toIndex ) } }","docstring":"/**\n * Returns a new array which is a copy of the specified range of the original array.\n * \n * @param fromIndex the start of the range (inclusive) to copy.\n * @param toIndex the end of the range (exclusive) to copy.\n * \n * @throws IndexOutOfBoundsException if [fromIndex] is less than zero or [toIndex] is greater than the size of this array.\n * @throws IllegalArgumentException if [fromIndex] is greater than [toIndex].\n */"} {"signature":"@ Suppress ( \"\" ) public actual fun < T > Array < T > . fill ( element : T , fromIndex : Int = , toIndex : Int = size ) : Unit","body":"{ java . util . Arrays . fill ( this , fromIndex , toIndex , element ) }","docstring":"/**\n * Fills this array or its subrange with the specified [element] value.\n * \n * @param fromIndex the start of the range (inclusive) to fill, 0 by default.\n * @param toIndex the end of the range (exclusive) to fill, size of this array by default.\n * \n * @throws IndexOutOfBoundsException if [fromIndex] is less than zero or [toIndex] is greater than the size of this array.\n * @throws IllegalArgumentException if [fromIndex] is greater than [toIndex].\n */"} {"signature":"@ Suppress ( \"\" ) public actual fun ByteArray . fill ( element : Byte , fromIndex : Int = , toIndex : Int = size ) : Unit","body":"{ java . util . Arrays . fill ( this , fromIndex , toIndex , element ) }","docstring":"/**\n * Fills this array or its subrange with the specified [element] value.\n * \n * @param fromIndex the start of the range (inclusive) to fill, 0 by default.\n * @param toIndex the end of the range (exclusive) to fill, size of this array by default.\n * \n * @throws IndexOutOfBoundsException if [fromIndex] is less than zero or [toIndex] is greater than the size of this array.\n * @throws IllegalArgumentException if [fromIndex] is greater than [toIndex].\n */"} {"signature":"@ Suppress ( \"\" ) public actual fun ShortArray . fill ( element : Short , fromIndex : Int = , toIndex : Int = size ) : Unit","body":"{ java . util . Arrays . fill ( this , fromIndex , toIndex , element ) }","docstring":"/**\n * Fills this array or its subrange with the specified [element] value.\n * \n * @param fromIndex the start of the range (inclusive) to fill, 0 by default.\n * @param toIndex the end of the range (exclusive) to fill, size of this array by default.\n * \n * @throws IndexOutOfBoundsException if [fromIndex] is less than zero or [toIndex] is greater than the size of this array.\n * @throws IllegalArgumentException if [fromIndex] is greater than [toIndex].\n */"} {"signature":"@ Suppress ( \"\" ) public actual fun IntArray . fill ( element : Int , fromIndex : Int = , toIndex : Int = size ) : Unit","body":"{ java . util . Arrays . fill ( this , fromIndex , toIndex , element ) }","docstring":"/**\n * Fills this array or its subrange with the specified [element] value.\n * \n * @param fromIndex the start of the range (inclusive) to fill, 0 by default.\n * @param toIndex the end of the range (exclusive) to fill, size of this array by default.\n * \n * @throws IndexOutOfBoundsException if [fromIndex] is less than zero or [toIndex] is greater than the size of this array.\n * @throws IllegalArgumentException if [fromIndex] is greater than [toIndex].\n */"} {"signature":"@ Suppress ( \"\" ) public actual fun LongArray . fill ( element : Long , fromIndex : Int = , toIndex : Int = size ) : Unit","body":"{ java . util . Arrays . fill ( this , fromIndex , toIndex , element ) }","docstring":"/**\n * Fills this array or its subrange with the specified [element] value.\n * \n * @param fromIndex the start of the range (inclusive) to fill, 0 by default.\n * @param toIndex the end of the range (exclusive) to fill, size of this array by default.\n * \n * @throws IndexOutOfBoundsException if [fromIndex] is less than zero or [toIndex] is greater than the size of this array.\n * @throws IllegalArgumentException if [fromIndex] is greater than [toIndex].\n */"} {"signature":"@ Suppress ( \"\" ) public actual fun FloatArray . fill ( element : Float , fromIndex : Int = , toIndex : Int = size ) : Unit","body":"{ java . util . Arrays . fill ( this , fromIndex , toIndex , element ) }","docstring":"/**\n * Fills this array or its subrange with the specified [element] value.\n * \n * @param fromIndex the start of the range (inclusive) to fill, 0 by default.\n * @param toIndex the end of the range (exclusive) to fill, size of this array by default.\n * \n * @throws IndexOutOfBoundsException if [fromIndex] is less than zero or [toIndex] is greater than the size of this array.\n * @throws IllegalArgumentException if [fromIndex] is greater than [toIndex].\n */"} {"signature":"@ Suppress ( \"\" ) public actual fun DoubleArray . fill ( element : Double , fromIndex : Int = , toIndex : Int = size ) : Unit","body":"{ java . util . Arrays . fill ( this , fromIndex , toIndex , element ) }","docstring":"/**\n * Fills this array or its subrange with the specified [element] value.\n * \n * @param fromIndex the start of the range (inclusive) to fill, 0 by default.\n * @param toIndex the end of the range (exclusive) to fill, size of this array by default.\n * \n * @throws IndexOutOfBoundsException if [fromIndex] is less than zero or [toIndex] is greater than the size of this array.\n * @throws IllegalArgumentException if [fromIndex] is greater than [toIndex].\n */"} {"signature":"@ Suppress ( \"\" ) public actual fun BooleanArray . fill ( element : Boolean , fromIndex : Int = , toIndex : Int = size ) : Unit","body":"{ java . util . Arrays . fill ( this , fromIndex , toIndex , element ) }","docstring":"/**\n * Fills this array or its subrange with the specified [element] value.\n * \n * @param fromIndex the start of the range (inclusive) to fill, 0 by default.\n * @param toIndex the end of the range (exclusive) to fill, size of this array by default.\n * \n * @throws IndexOutOfBoundsException if [fromIndex] is less than zero or [toIndex] is greater than the size of this array.\n * @throws IllegalArgumentException if [fromIndex] is greater than [toIndex].\n */"} {"signature":"@ Suppress ( \"\" ) public actual fun CharArray . fill ( element : Char , fromIndex : Int = , toIndex : Int = size ) : Unit","body":"{ java . util . Arrays . fill ( this , fromIndex , toIndex , element ) }","docstring":"/**\n * Fills this array or its subrange with the specified [element] value.\n * \n * @param fromIndex the start of the range (inclusive) to fill, 0 by default.\n * @param toIndex the end of the range (exclusive) to fill, size of this array by default.\n * \n * @throws IndexOutOfBoundsException if [fromIndex] is less than zero or [toIndex] is greater than the size of this array.\n * @throws IllegalArgumentException if [fromIndex] is greater than [toIndex].\n */"} {"signature":"public actual operator fun < T > Array < T > . plus ( element : T ) : Array < T >","body":"{ val index = size val result = java . util . Arrays . copyOf ( this , index + ) result [ index ] = element return result }","docstring":"/**\n * Returns an array containing all elements of the original array and then the given [element].\n */"} {"signature":"public actual operator fun ByteArray . plus ( element : Byte ) : ByteArray","body":"{ val index = size val result = java . util . Arrays . copyOf ( this , index + ) result [ index ] = element return result }","docstring":"/**\n * Returns an array containing all elements of the original array and then the given [element].\n */"} {"signature":"public actual operator fun ShortArray . plus ( element : Short ) : ShortArray","body":"{ val index = size val result = java . util . Arrays . copyOf ( this , index + ) result [ index ] = element return result }","docstring":"/**\n * Returns an array containing all elements of the original array and then the given [element].\n */"} {"signature":"public actual operator fun IntArray . plus ( element : Int ) : IntArray","body":"{ val index = size val result = java . util . Arrays . copyOf ( this , index + ) result [ index ] = element return result }","docstring":"/**\n * Returns an array containing all elements of the original array and then the given [element].\n */"} {"signature":"public actual operator fun LongArray . plus ( element : Long ) : LongArray","body":"{ val index = size val result = java . util . Arrays . copyOf ( this , index + ) result [ index ] = element return result }","docstring":"/**\n * Returns an array containing all elements of the original array and then the given [element].\n */"} {"signature":"public actual operator fun FloatArray . plus ( element : Float ) : FloatArray","body":"{ val index = size val result = java . util . Arrays . copyOf ( this , index + ) result [ index ] = element return result }","docstring":"/**\n * Returns an array containing all elements of the original array and then the given [element].\n */"} {"signature":"public actual operator fun DoubleArray . plus ( element : Double ) : DoubleArray","body":"{ val index = size val result = java . util . Arrays . copyOf ( this , index + ) result [ index ] = element return result }","docstring":"/**\n * Returns an array containing all elements of the original array and then the given [element].\n */"} {"signature":"public actual operator fun BooleanArray . plus ( element : Boolean ) : BooleanArray","body":"{ val index = size val result = java . util . Arrays . copyOf ( this , index + ) result [ index ] = element return result }","docstring":"/**\n * Returns an array containing all elements of the original array and then the given [element].\n */"} {"signature":"public actual operator fun CharArray . plus ( element : Char ) : CharArray","body":"{ val index = size val result = java . util . Arrays . copyOf ( this , index + ) result [ index ] = element return result }","docstring":"/**\n * Returns an array containing all elements of the original array and then the given [element].\n */"} {"signature":"public actual operator fun < T > Array < T > . plus ( elements : Collection < T > ) : Array < T >","body":"{ var index = size val result = java . util . Arrays . copyOf ( this , index + elements . size ) for ( element in elements ) result [ index ++ ] = element return result }","docstring":"/**\n * Returns an array containing all elements of the original array and then all elements of the given [elements] collection.\n */"} {"signature":"public actual operator fun ByteArray . plus ( elements : Collection < Byte > ) : ByteArray","body":"{ var index = size val result = java . util . Arrays . copyOf ( this , index + elements . size ) for ( element in elements ) result [ index ++ ] = element return result }","docstring":"/**\n * Returns an array containing all elements of the original array and then all elements of the given [elements] collection.\n */"} {"signature":"public actual operator fun ShortArray . plus ( elements : Collection < Short > ) : ShortArray","body":"{ var index = size val result = java . util . Arrays . copyOf ( this , index + elements . size ) for ( element in elements ) result [ index ++ ] = element return result }","docstring":"/**\n * Returns an array containing all elements of the original array and then all elements of the given [elements] collection.\n */"} {"signature":"public actual operator fun IntArray . plus ( elements : Collection < Int > ) : IntArray","body":"{ var index = size val result = java . util . Arrays . copyOf ( this , index + elements . size ) for ( element in elements ) result [ index ++ ] = element return result }","docstring":"/**\n * Returns an array containing all elements of the original array and then all elements of the given [elements] collection.\n */"} {"signature":"public actual operator fun LongArray . plus ( elements : Collection < Long > ) : LongArray","body":"{ var index = size val result = java . util . Arrays . copyOf ( this , index + elements . size ) for ( element in elements ) result [ index ++ ] = element return result }","docstring":"/**\n * Returns an array containing all elements of the original array and then all elements of the given [elements] collection.\n */"} {"signature":"public actual operator fun FloatArray . plus ( elements : Collection < Float > ) : FloatArray","body":"{ var index = size val result = java . util . Arrays . copyOf ( this , index + elements . size ) for ( element in elements ) result [ index ++ ] = element return result }","docstring":"/**\n * Returns an array containing all elements of the original array and then all elements of the given [elements] collection.\n */"} {"signature":"public actual operator fun DoubleArray . plus ( elements : Collection < Double > ) : DoubleArray","body":"{ var index = size val result = java . util . Arrays . copyOf ( this , index + elements . size ) for ( element in elements ) result [ index ++ ] = element return result }","docstring":"/**\n * Returns an array containing all elements of the original array and then all elements of the given [elements] collection.\n */"} {"signature":"public actual operator fun BooleanArray . plus ( elements : Collection < Boolean > ) : BooleanArray","body":"{ var index = size val result = java . util . Arrays . copyOf ( this , index + elements . size ) for ( element in elements ) result [ index ++ ] = element return result }","docstring":"/**\n * Returns an array containing all elements of the original array and then all elements of the given [elements] collection.\n */"} {"signature":"public actual operator fun CharArray . plus ( elements : Collection < Char > ) : CharArray","body":"{ var index = size val result = java . util . Arrays . copyOf ( this , index + elements . size ) for ( element in elements ) result [ index ++ ] = element return result }","docstring":"/**\n * Returns an array containing all elements of the original array and then all elements of the given [elements] collection.\n */"} {"signature":"public actual operator fun < T > Array < T > . plus ( elements : Array < out T > ) : Array < T >","body":"{ val thisSize = size val arraySize = elements . size val result = java . util . Arrays . copyOf ( this , thisSize + arraySize ) System . arraycopy ( elements , , result , thisSize , arraySize ) return result }","docstring":"/**\n * Returns an array containing all elements of the original array and then all elements of the given [elements] array.\n */"} {"signature":"public actual operator fun ByteArray . plus ( elements : ByteArray ) : ByteArray","body":"{ val thisSize = size val arraySize = elements . size val result = java . util . Arrays . copyOf ( this , thisSize + arraySize ) System . arraycopy ( elements , , result , thisSize , arraySize ) return result }","docstring":"/**\n * Returns an array containing all elements of the original array and then all elements of the given [elements] array.\n */"} {"signature":"public actual operator fun ShortArray . plus ( elements : ShortArray ) : ShortArray","body":"{ val thisSize = size val arraySize = elements . size val result = java . util . Arrays . copyOf ( this , thisSize + arraySize ) System . arraycopy ( elements , , result , thisSize , arraySize ) return result }","docstring":"/**\n * Returns an array containing all elements of the original array and then all elements of the given [elements] array.\n */"} {"signature":"public actual operator fun IntArray . plus ( elements : IntArray ) : IntArray","body":"{ val thisSize = size val arraySize = elements . size val result = java . util . Arrays . copyOf ( this , thisSize + arraySize ) System . arraycopy ( elements , , result , thisSize , arraySize ) return result }","docstring":"/**\n * Returns an array containing all elements of the original array and then all elements of the given [elements] array.\n */"} {"signature":"public actual operator fun LongArray . plus ( elements : LongArray ) : LongArray","body":"{ val thisSize = size val arraySize = elements . size val result = java . util . Arrays . copyOf ( this , thisSize + arraySize ) System . arraycopy ( elements , , result , thisSize , arraySize ) return result }","docstring":"/**\n * Returns an array containing all elements of the original array and then all elements of the given [elements] array.\n */"} {"signature":"public actual operator fun FloatArray . plus ( elements : FloatArray ) : FloatArray","body":"{ val thisSize = size val arraySize = elements . size val result = java . util . Arrays . copyOf ( this , thisSize + arraySize ) System . arraycopy ( elements , , result , thisSize , arraySize ) return result }","docstring":"/**\n * Returns an array containing all elements of the original array and then all elements of the given [elements] array.\n */"} {"signature":"public actual operator fun DoubleArray . plus ( elements : DoubleArray ) : DoubleArray","body":"{ val thisSize = size val arraySize = elements . size val result = java . util . Arrays . copyOf ( this , thisSize + arraySize ) System . arraycopy ( elements , , result , thisSize , arraySize ) return result }","docstring":"/**\n * Returns an array containing all elements of the original array and then all elements of the given [elements] array.\n */"} {"signature":"public actual operator fun BooleanArray . plus ( elements : BooleanArray ) : BooleanArray","body":"{ val thisSize = size val arraySize = elements . size val result = java . util . Arrays . copyOf ( this , thisSize + arraySize ) System . arraycopy ( elements , , result , thisSize , arraySize ) return result }","docstring":"/**\n * Returns an array containing all elements of the original array and then all elements of the given [elements] array.\n */"} {"signature":"public actual operator fun CharArray . plus ( elements : CharArray ) : CharArray","body":"{ val thisSize = size val arraySize = elements . size val result = java . util . Arrays . copyOf ( this , thisSize + arraySize ) System . arraycopy ( elements , , result , thisSize , arraySize ) return result }","docstring":"/**\n * Returns an array containing all elements of the original array and then all elements of the given [elements] array.\n */"} {"signature":"@ kotlin . internal . InlineOnly public actual inline fun < T > Array < T > . plusElement ( element : T ) : Array < T >","body":"{ return plus ( element ) }","docstring":"/**\n * Returns an array containing all elements of the original array and then the given [element].\n */"} {"signature":"public actual fun IntArray . sort ( ) : Unit","body":"{ if ( size > ) java . util . Arrays . sort ( this ) }","docstring":"/**\n * Sorts the array in-place.\n * \n * @sample samples.collections.Arrays.Sorting.sortArray\n */"} {"signature":"public actual fun LongArray . sort ( ) : Unit","body":"{ if ( size > ) java . util . Arrays . sort ( this ) }","docstring":"/**\n * Sorts the array in-place.\n * \n * @sample samples.collections.Arrays.Sorting.sortArray\n */"} {"signature":"public actual fun ByteArray . sort ( ) : Unit","body":"{ if ( size > ) java . util . Arrays . sort ( this ) }","docstring":"/**\n * Sorts the array in-place.\n * \n * @sample samples.collections.Arrays.Sorting.sortArray\n */"} {"signature":"public actual fun ShortArray . sort ( ) : Unit","body":"{ if ( size > ) java . util . Arrays . sort ( this ) }","docstring":"/**\n * Sorts the array in-place.\n * \n * @sample samples.collections.Arrays.Sorting.sortArray\n */"} {"signature":"public actual fun DoubleArray . sort ( ) : Unit","body":"{ if ( size > ) java . util . Arrays . sort ( this ) }","docstring":"/**\n * Sorts the array in-place.\n * \n * @sample samples.collections.Arrays.Sorting.sortArray\n */"} {"signature":"public actual fun FloatArray . sort ( ) : Unit","body":"{ if ( size > ) java . util . Arrays . sort ( this ) }","docstring":"/**\n * Sorts the array in-place.\n * \n * @sample samples.collections.Arrays.Sorting.sortArray\n */"} {"signature":"public actual fun CharArray . sort ( ) : Unit","body":"{ if ( size > ) java . util . Arrays . sort ( this ) }","docstring":"/**\n * Sorts the array in-place.\n * \n * @sample samples.collections.Arrays.Sorting.sortArray\n */"} {"signature":"@ kotlin . internal . InlineOnly public actual inline fun < T : Comparable < T > > Array < out T > . sort ( ) : Unit","body":"{ @ Suppress ( \"\" ) ( this as Array < Any ? > ) . sort ( ) }","docstring":"/**\n * Sorts the array in-place according to the natural order of its elements.\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.Arrays.Sorting.sortArrayOfComparable\n */"} {"signature":"public fun < T > Array < out T > . sort ( ) : Unit","body":"{ if ( size > ) java . util . Arrays . sort ( this ) }","docstring":"/**\n * Sorts the array in-place according to the natural order of its elements.\n * \n * The sort is _stable_. It means that equal elements preserve their order relative to each other after sorting.\n * \n * @throws ClassCastException if any element of the array is not [Comparable].\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ Suppress ( \"\" ) public actual fun < T : Comparable < T > > Array < out T > . sort ( fromIndex : Int = , toIndex : Int = size ) : Unit","body":"{ java . util . Arrays . sort ( this , fromIndex , toIndex ) }","docstring":"/**\n * Sorts a range in the array in-place.\n * \n * The sort is _stable_. It means that equal elements preserve their order relative to each other after sorting.\n * \n * @param fromIndex the start of the range (inclusive) to sort, 0 by default.\n * @param toIndex the end of the range (exclusive) to sort, size of this array by default.\n * \n * @throws IndexOutOfBoundsException if [fromIndex] is less than zero or [toIndex] is greater than the size of this array.\n * @throws IllegalArgumentException if [fromIndex] is greater than [toIndex].\n * \n * @sample samples.collections.Arrays.Sorting.sortRangeOfArrayOfComparable\n */"} {"signature":"@ Suppress ( \"\" ) public actual fun ByteArray . sort ( fromIndex : Int = , toIndex : Int = size ) : Unit","body":"{ java . util . Arrays . sort ( this , fromIndex , toIndex ) }","docstring":"/**\n * Sorts a range in the array in-place.\n * \n * @param fromIndex the start of the range (inclusive) to sort, 0 by default.\n * @param toIndex the end of the range (exclusive) to sort, size of this array by default.\n * \n * @throws IndexOutOfBoundsException if [fromIndex] is less than zero or [toIndex] is greater than the size of this array.\n * @throws IllegalArgumentException if [fromIndex] is greater than [toIndex].\n * \n * @sample samples.collections.Arrays.Sorting.sortRangeOfArray\n */"} {"signature":"@ Suppress ( \"\" ) public actual fun ShortArray . sort ( fromIndex : Int = , toIndex : Int = size ) : Unit","body":"{ java . util . Arrays . sort ( this , fromIndex , toIndex ) }","docstring":"/**\n * Sorts a range in the array in-place.\n * \n * @param fromIndex the start of the range (inclusive) to sort, 0 by default.\n * @param toIndex the end of the range (exclusive) to sort, size of this array by default.\n * \n * @throws IndexOutOfBoundsException if [fromIndex] is less than zero or [toIndex] is greater than the size of this array.\n * @throws IllegalArgumentException if [fromIndex] is greater than [toIndex].\n * \n * @sample samples.collections.Arrays.Sorting.sortRangeOfArray\n */"} {"signature":"@ Suppress ( \"\" ) public actual fun IntArray . sort ( fromIndex : Int = , toIndex : Int = size ) : Unit","body":"{ java . util . Arrays . sort ( this , fromIndex , toIndex ) }","docstring":"/**\n * Sorts a range in the array in-place.\n * \n * @param fromIndex the start of the range (inclusive) to sort, 0 by default.\n * @param toIndex the end of the range (exclusive) to sort, size of this array by default.\n * \n * @throws IndexOutOfBoundsException if [fromIndex] is less than zero or [toIndex] is greater than the size of this array.\n * @throws IllegalArgumentException if [fromIndex] is greater than [toIndex].\n * \n * @sample samples.collections.Arrays.Sorting.sortRangeOfArray\n */"} {"signature":"@ Suppress ( \"\" ) public actual fun LongArray . sort ( fromIndex : Int = , toIndex : Int = size ) : Unit","body":"{ java . util . Arrays . sort ( this , fromIndex , toIndex ) }","docstring":"/**\n * Sorts a range in the array in-place.\n * \n * @param fromIndex the start of the range (inclusive) to sort, 0 by default.\n * @param toIndex the end of the range (exclusive) to sort, size of this array by default.\n * \n * @throws IndexOutOfBoundsException if [fromIndex] is less than zero or [toIndex] is greater than the size of this array.\n * @throws IllegalArgumentException if [fromIndex] is greater than [toIndex].\n * \n * @sample samples.collections.Arrays.Sorting.sortRangeOfArray\n */"} {"signature":"@ Suppress ( \"\" ) public actual fun FloatArray . sort ( fromIndex : Int = , toIndex : Int = size ) : Unit","body":"{ java . util . Arrays . sort ( this , fromIndex , toIndex ) }","docstring":"/**\n * Sorts a range in the array in-place.\n * \n * @param fromIndex the start of the range (inclusive) to sort, 0 by default.\n * @param toIndex the end of the range (exclusive) to sort, size of this array by default.\n * \n * @throws IndexOutOfBoundsException if [fromIndex] is less than zero or [toIndex] is greater than the size of this array.\n * @throws IllegalArgumentException if [fromIndex] is greater than [toIndex].\n * \n * @sample samples.collections.Arrays.Sorting.sortRangeOfArray\n */"} {"signature":"@ Suppress ( \"\" ) public actual fun DoubleArray . sort ( fromIndex : Int = , toIndex : Int = size ) : Unit","body":"{ java . util . Arrays . sort ( this , fromIndex , toIndex ) }","docstring":"/**\n * Sorts a range in the array in-place.\n * \n * @param fromIndex the start of the range (inclusive) to sort, 0 by default.\n * @param toIndex the end of the range (exclusive) to sort, size of this array by default.\n * \n * @throws IndexOutOfBoundsException if [fromIndex] is less than zero or [toIndex] is greater than the size of this array.\n * @throws IllegalArgumentException if [fromIndex] is greater than [toIndex].\n * \n * @sample samples.collections.Arrays.Sorting.sortRangeOfArray\n */"} {"signature":"@ Suppress ( \"\" ) public actual fun CharArray . sort ( fromIndex : Int = , toIndex : Int = size ) : Unit","body":"{ java . util . Arrays . sort ( this , fromIndex , toIndex ) }","docstring":"/**\n * Sorts a range in the array in-place.\n * \n * @param fromIndex the start of the range (inclusive) to sort, 0 by default.\n * @param toIndex the end of the range (exclusive) to sort, size of this array by default.\n * \n * @throws IndexOutOfBoundsException if [fromIndex] is less than zero or [toIndex] is greater than the size of this array.\n * @throws IllegalArgumentException if [fromIndex] is greater than [toIndex].\n * \n * @sample samples.collections.Arrays.Sorting.sortRangeOfArray\n */"} {"signature":"public fun < T > Array < out T > . sort ( fromIndex : Int = , toIndex : Int = size ) : Unit","body":"{ java . util . Arrays . sort ( this , fromIndex , toIndex ) }","docstring":"/**\n * Sorts a range in the array in-place.\n * \n * The sort is _stable_. It means that equal elements preserve their order relative to each other after sorting.\n * \n * @param fromIndex the start of the range (inclusive) to sort, 0 by default.\n * @param toIndex the end of the range (exclusive) to sort, size of this array by default.\n * \n * @throws IndexOutOfBoundsException if [fromIndex] is less than zero or [toIndex] is greater than the size of this array.\n * @throws IllegalArgumentException if [fromIndex] is greater than [toIndex].\n * \n * @sample samples.collections.Arrays.Sorting.sortRangeOfArrayOfComparable\n */"} {"signature":"public actual fun < T > Array < out T > . sortWith ( comparator : Comparator < in T > ) : Unit","body":"{ if ( size > ) java . util . Arrays . sort ( this , comparator ) }","docstring":"/**\n * Sorts the array in-place according to the order specified by the given [comparator].\n * \n * The sort is _stable_. It means that equal elements preserve their order relative to each other after sorting.\n */"} {"signature":"@ Suppress ( \"\" ) public actual fun < T > Array < out T > . sortWith ( comparator : Comparator < in T > , fromIndex : Int = , toIndex : Int = size ) : Unit","body":"{ java . util . Arrays . sort ( this , fromIndex , toIndex , comparator ) }","docstring":"/**\n * Sorts a range in the array in-place with the given [comparator].\n * \n * The sort is _stable_. It means that equal elements preserve their order relative to each other after sorting.\n * \n * @param fromIndex the start of the range (inclusive) to sort, 0 by default.\n * @param toIndex the end of the range (exclusive) to sort, size of this array by default.\n * \n * @throws IndexOutOfBoundsException if [fromIndex] is less than zero or [toIndex] is greater than the size of this array.\n * @throws IllegalArgumentException if [fromIndex] is greater than [toIndex].\n */"} {"signature":"public actual fun ByteArray . toTypedArray ( ) : Array < Byte >","body":"{ val result = arrayOfNulls < Byte > ( size ) for ( index in indices ) result [ index ] = this [ index ] @ Suppress ( \"\" ) return result as Array < Byte > }","docstring":"/**\n * Returns a *typed* object array containing all of the elements of this primitive array.\n */"} {"signature":"public actual fun ShortArray . toTypedArray ( ) : Array < Short >","body":"{ val result = arrayOfNulls < Short > ( size ) for ( index in indices ) result [ index ] = this [ index ] @ Suppress ( \"\" ) return result as Array < Short > }","docstring":"/**\n * Returns a *typed* object array containing all of the elements of this primitive array.\n */"} {"signature":"public actual fun IntArray . toTypedArray ( ) : Array < Int >","body":"{ val result = arrayOfNulls < Int > ( size ) for ( index in indices ) result [ index ] = this [ index ] @ Suppress ( \"\" ) return result as Array < Int > }","docstring":"/**\n * Returns a *typed* object array containing all of the elements of this primitive array.\n */"} {"signature":"public actual fun LongArray . toTypedArray ( ) : Array < Long >","body":"{ val result = arrayOfNulls < Long > ( size ) for ( index in indices ) result [ index ] = this [ index ] @ Suppress ( \"\" ) return result as Array < Long > }","docstring":"/**\n * Returns a *typed* object array containing all of the elements of this primitive array.\n */"} {"signature":"public actual fun FloatArray . toTypedArray ( ) : Array < Float >","body":"{ val result = arrayOfNulls < Float > ( size ) for ( index in indices ) result [ index ] = this [ index ] @ Suppress ( \"\" ) return result as Array < Float > }","docstring":"/**\n * Returns a *typed* object array containing all of the elements of this primitive array.\n */"} {"signature":"public actual fun DoubleArray . toTypedArray ( ) : Array < Double >","body":"{ val result = arrayOfNulls < Double > ( size ) for ( index in indices ) result [ index ] = this [ index ] @ Suppress ( \"\" ) return result as Array < Double > }","docstring":"/**\n * Returns a *typed* object array containing all of the elements of this primitive array.\n */"} {"signature":"public actual fun BooleanArray . toTypedArray ( ) : Array < Boolean >","body":"{ val result = arrayOfNulls < Boolean > ( size ) for ( index in indices ) result [ index ] = this [ index ] @ Suppress ( \"\" ) return result as Array < Boolean > }","docstring":"/**\n * Returns a *typed* object array containing all of the elements of this primitive array.\n */"} {"signature":"public actual fun CharArray . toTypedArray ( ) : Array < Char >","body":"{ val result = arrayOfNulls < Char > ( size ) for ( index in indices ) result [ index ] = this [ index ] @ Suppress ( \"\" ) return result as Array < Char > }","docstring":"/**\n * Returns a *typed* object array containing all of the elements of this primitive array.\n */"} {"signature":"public fun < T : Comparable < T > > Array < out 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 */"} {"signature":"public fun ByteArray . toSortedSet ( ) : java . util . SortedSet < Byte >","body":"{ return toCollection ( java . util . TreeSet < Byte > ( ) ) }","docstring":"/**\n * Returns a new [SortedSet][java.util.SortedSet] of all elements.\n */"} {"signature":"public fun ShortArray . toSortedSet ( ) : java . util . SortedSet < Short >","body":"{ return toCollection ( java . util . TreeSet < Short > ( ) ) }","docstring":"/**\n * Returns a new [SortedSet][java.util.SortedSet] of all elements.\n */"} {"signature":"public fun IntArray . toSortedSet ( ) : java . util . SortedSet < Int >","body":"{ return toCollection ( java . util . TreeSet < Int > ( ) ) }","docstring":"/**\n * Returns a new [SortedSet][java.util.SortedSet] of all elements.\n */"} {"signature":"public fun LongArray . toSortedSet ( ) : java . util . SortedSet < Long >","body":"{ return toCollection ( java . util . TreeSet < Long > ( ) ) }","docstring":"/**\n * Returns a new [SortedSet][java.util.SortedSet] of all elements.\n */"} {"signature":"public fun FloatArray . toSortedSet ( ) : java . util . SortedSet < Float >","body":"{ return toCollection ( java . util . TreeSet < Float > ( ) ) }","docstring":"/**\n * Returns a new [SortedSet][java.util.SortedSet] of all elements.\n */"} {"signature":"public fun DoubleArray . toSortedSet ( ) : java . util . SortedSet < Double >","body":"{ return toCollection ( java . util . TreeSet < Double > ( ) ) }","docstring":"/**\n * Returns a new [SortedSet][java.util.SortedSet] of all elements.\n */"} {"signature":"public fun BooleanArray . toSortedSet ( ) : java . util . SortedSet < Boolean >","body":"{ return toCollection ( java . util . TreeSet < Boolean > ( ) ) }","docstring":"/**\n * Returns a new [SortedSet][java.util.SortedSet] of all elements.\n */"} {"signature":"public fun CharArray . toSortedSet ( ) : java . util . SortedSet < Char >","body":"{ return toCollection ( java . util . TreeSet < Char > ( ) ) }","docstring":"/**\n * Returns a new [SortedSet][java.util.SortedSet] of all elements.\n */"} {"signature":"public fun < T > Array < out 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 */"} {"signature":"@ SinceKotlin ( \"\" ) @ OptIn ( kotlin . experimental . ExperimentalTypeInference :: class ) @ OverloadResolutionByLambdaReturnType @ kotlin . jvm . JvmName ( \"\" ) @ kotlin . internal . InlineOnly public inline fun < T > Array < out 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 array.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ OptIn ( kotlin . experimental . ExperimentalTypeInference :: class ) @ OverloadResolutionByLambdaReturnType @ kotlin . jvm . JvmName ( \"\" ) @ kotlin . internal . InlineOnly public inline fun ByteArray . sumOf ( selector : ( Byte ) -> 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 array.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ OptIn ( kotlin . experimental . ExperimentalTypeInference :: class ) @ OverloadResolutionByLambdaReturnType @ kotlin . jvm . JvmName ( \"\" ) @ kotlin . internal . InlineOnly public inline fun ShortArray . sumOf ( selector : ( Short ) -> 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 array.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ OptIn ( kotlin . experimental . ExperimentalTypeInference :: class ) @ OverloadResolutionByLambdaReturnType @ kotlin . jvm . JvmName ( \"\" ) @ kotlin . internal . InlineOnly public inline fun IntArray . sumOf ( selector : ( Int ) -> 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 array.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ OptIn ( kotlin . experimental . ExperimentalTypeInference :: class ) @ OverloadResolutionByLambdaReturnType @ kotlin . jvm . JvmName ( \"\" ) @ kotlin . internal . InlineOnly public inline fun LongArray . sumOf ( selector : ( Long ) -> 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 array.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ OptIn ( kotlin . experimental . ExperimentalTypeInference :: class ) @ OverloadResolutionByLambdaReturnType @ kotlin . jvm . JvmName ( \"\" ) @ kotlin . internal . InlineOnly public inline fun FloatArray . sumOf ( selector : ( Float ) -> 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 array.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ OptIn ( kotlin . experimental . ExperimentalTypeInference :: class ) @ OverloadResolutionByLambdaReturnType @ kotlin . jvm . JvmName ( \"\" ) @ kotlin . internal . InlineOnly public inline fun DoubleArray . sumOf ( selector : ( Double ) -> 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 array.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ OptIn ( kotlin . experimental . ExperimentalTypeInference :: class ) @ OverloadResolutionByLambdaReturnType @ kotlin . jvm . JvmName ( \"\" ) @ kotlin . internal . InlineOnly public inline fun BooleanArray . sumOf ( selector : ( Boolean ) -> 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 array.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ OptIn ( kotlin . experimental . ExperimentalTypeInference :: class ) @ OverloadResolutionByLambdaReturnType @ kotlin . jvm . JvmName ( \"\" ) @ kotlin . internal . InlineOnly public inline fun CharArray . 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 element in the array.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ OptIn ( kotlin . experimental . ExperimentalTypeInference :: class ) @ OverloadResolutionByLambdaReturnType @ kotlin . jvm . JvmName ( \"\" ) @ kotlin . internal . InlineOnly public inline fun < T > Array < out 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 array.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ OptIn ( kotlin . experimental . ExperimentalTypeInference :: class ) @ OverloadResolutionByLambdaReturnType @ kotlin . jvm . JvmName ( \"\" ) @ kotlin . internal . InlineOnly public inline fun ByteArray . sumOf ( selector : ( Byte ) -> 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 array.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ OptIn ( kotlin . experimental . ExperimentalTypeInference :: class ) @ OverloadResolutionByLambdaReturnType @ kotlin . jvm . JvmName ( \"\" ) @ kotlin . internal . InlineOnly public inline fun ShortArray . sumOf ( selector : ( Short ) -> 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 array.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ OptIn ( kotlin . experimental . ExperimentalTypeInference :: class ) @ OverloadResolutionByLambdaReturnType @ kotlin . jvm . JvmName ( \"\" ) @ kotlin . internal . InlineOnly public inline fun IntArray . sumOf ( selector : ( Int ) -> 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 array.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ OptIn ( kotlin . experimental . ExperimentalTypeInference :: class ) @ OverloadResolutionByLambdaReturnType @ kotlin . jvm . JvmName ( \"\" ) @ kotlin . internal . InlineOnly public inline fun LongArray . sumOf ( selector : ( Long ) -> 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 array.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ OptIn ( kotlin . experimental . ExperimentalTypeInference :: class ) @ OverloadResolutionByLambdaReturnType @ kotlin . jvm . JvmName ( \"\" ) @ kotlin . internal . InlineOnly public inline fun FloatArray . sumOf ( selector : ( Float ) -> 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 array.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ OptIn ( kotlin . experimental . ExperimentalTypeInference :: class ) @ OverloadResolutionByLambdaReturnType @ kotlin . jvm . JvmName ( \"\" ) @ kotlin . internal . InlineOnly public inline fun DoubleArray . sumOf ( selector : ( Double ) -> 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 array.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ OptIn ( kotlin . experimental . ExperimentalTypeInference :: class ) @ OverloadResolutionByLambdaReturnType @ kotlin . jvm . JvmName ( \"\" ) @ kotlin . internal . InlineOnly public inline fun BooleanArray . sumOf ( selector : ( Boolean ) -> 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 array.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ OptIn ( kotlin . experimental . ExperimentalTypeInference :: class ) @ OverloadResolutionByLambdaReturnType @ kotlin . jvm . JvmName ( \"\" ) @ kotlin . internal . InlineOnly public inline fun CharArray . 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 element in the array.\n */"} {"signature":"fun main ( )","body":"{ val ( train , test ) = fashionMnist ( ) val jsonConfigFile = getJSONConfigFile ( ) val model = Sequential . loadModelConfiguration ( jsonConfigFile ) model . use { it . freeze ( ) it . layers . last ( ) . unfreeze ( ) it . compile ( optimizer = Adam ( ) , loss = Losses . SOFT_MAX_CROSS_ENTROPY_WITH_LOGITS , metric = Metrics . ACCURACY ) it . logSummary ( ) println ( it . kGraph ) val hdfFile = getWeightsFile ( ) it . loadWeights ( hdfFile ) var accuracy = it . evaluate ( dataset = test , batchSize = ) . metrics [ Metrics . ACCURACY ] println ( \"\" ) it . fit ( dataset = train , epochs = , batchSize = ) println ( it . kGraph ) accuracy = it . evaluate ( dataset = test , batchSize = ) . metrics [ Metrics . ACCURACY ] println ( it . kGraph ) println ( \"\" ) } }","docstring":"/**\n * This examples demonstrates the inference concept:\n *\n * - Weights are loaded from .h5 file, configuration is loaded from .json file.\n * - Model is evaluated after loading to obtain accuracy value.\n * - No additional training.\n * - No new layers are added.\n *\n * NOTE: Model and weights are resources in api module.\n *\n * We demonstrate the workflow on the FashionMnist classification dataset.\n */"} {"signature":"fun getJSONConfigFile ( ) : File","body":"{ val pathToConfig = \"\" val realPathToConfig = OnHeapDataset :: class . java . classLoader . getResource ( pathToConfig ) . path . toString ( ) return File ( realPathToConfig ) }","docstring":"/** Returns JSON file with model configuration, saved from Keras 2.x. */"} {"signature":"fun getWeightsFile ( ) : HdfFile","body":"{ val pathToWeights = \"\" val realPathToWeights = OnHeapDataset :: class . java . classLoader . getResource ( pathToWeights ) . path . toString ( ) val file = File ( realPathToWeights ) return HdfFile ( file ) }","docstring":"/** Returns .h5 file with model weights, saved from Keras 2.x. */"} {"signature":"private fun moveCapturedLocalInside ( capturingFunction : JsFunction , capturedName : JsName , localFunAlias : JsExpression ) : CapturedArgsParams","body":"= when ( localFunAlias ) { is JsNameRef -> { declareAliasInsideFunction ( capturingFunction , capturedName , localFunAlias ) CapturedArgsParams ( ) } is JsInvocation -> moveCapturedLocalInside ( capturingFunction , capturedName , localFunAlias ) else -> throw AssertionError ( \"\" ) }","docstring":"/**\n * Moves captured local inline function inside capturing function.\n *\n * For example:\n * var inc = _.foo.inc(closure) // local fun that captures closure\n * capturingFunction(inc)\n *\n * Is transformed to:\n * capturingFunction(closure) // var inc = _.foo.inc(closure) is moved inside capturingFunction\n */"} {"signature":"private fun moveCapturedLocalInside ( capturingFunction : JsFunction , capturedName : JsName , localFunAlias : JsInvocation ) : CapturedArgsParams","body":"{ val capturedArgs = localFunAlias . arguments val freshNames = getTemporaryNamesInScope ( capturedArgs ) val aliasCallArguments = freshNames . map ( JsName :: makeRef ) val alias = JsInvocation ( localFunAlias . qualifier , aliasCallArguments ) declareAliasInsideFunction ( capturingFunction , capturedName , alias ) val capturedParameters = freshNames . map ( :: JsParameter ) return CapturedArgsParams ( capturedArgs , capturedParameters ) }","docstring":"/**\n * Processes case when local inline function with capture\n * is captured by capturingFunction.\n *\n * In this case, capturingFunction should\n * capture arguments captured by localFunAlias,\n * and localFunAlias declaration is moved inside.\n *\n * For example:\n *\n * ```\n * val x = 0\n * inline fun id() = x\n * val lambda = {println(id())}\n * ```\n *\n * `lambda` should capture x in this case\n */"} {"signature":"public fun OutputStream . asSink ( ) : RawSink","body":"= OutputStreamSink ( this )","docstring":"/**\n * Returns [RawSink] that writes to an output stream.\n *\n * Use [RawSink.buffered] to create a buffered sink from it.\n *\n * @sample kotlinx.io.samples.KotlinxIoSamplesJvm.outputStreamAsSink\n */"} {"signature":"public fun InputStream . asSource ( ) : RawSource","body":"= InputStreamSource ( this )","docstring":"/**\n * Returns [RawSource] that reads from an input stream.\n *\n * Use [RawSource.buffered] to create a buffered source from it.\n *\n * @sample kotlinx.io.samples.KotlinxIoSamplesJvm.inputStreamAsSource\n */"} {"signature":"internal fun pick ( generationState : NativeGenerationState , runtimeLlvmModules : List < LLVMModuleRef > ) : RuntimeLinkageStrategy","body":"{ val config = generationState . config val binaryOption = config . configuration . get ( BinaryOptions . linkRuntime ) return when { binaryOption == RuntimeLinkageStrategyBinaryOption . Raw -> Raw ( runtimeLlvmModules ) binaryOption == RuntimeLinkageStrategyBinaryOption . Optimize -> LinkAndOptimize ( generationState , runtimeLlvmModules ) config . debug -> LinkAndOptimize ( generationState , runtimeLlvmModules ) else -> Raw ( runtimeLlvmModules ) } }","docstring":"/**\n * Choose runtime linkage strategy based on current compiler configuration and [BinaryOptions.linkRuntime].\n */"} {"signature":"@ OptIn ( DokkaPluginApiPreview :: class ) protected abstract fun pluginApiPreviewAcknowledgement ( ) : PluginApiPreviewAcknowledgement","body":"@ OptIn ( DokkaPluginApiPreview :: class ) protected abstract fun pluginApiPreviewAcknowledgement ( ) : PluginApiPreviewAcknowledgement","docstring":"/**\n * @see PluginApiPreviewAcknowledgement\n */"} {"signature":"fun fromSources ( sources : List < String > ) : List < KotlinSourceFile >","body":"{ val counters = hashMapOf < String , Int > ( ) return sources . map { fileName -> val id = counters [ fileName ] ? : counters [ fileName ] = id + KotlinSourceFile ( fileName , id ) } }","docstring":"/**\n * Source file paths in one module may clash;\n * for example, common and platform parts of the module could have files with the same root paths.\n * @param sources is a list of the module sources and must be in the same order as they appear in the klib.\n * @return a list of [KotlinSourceFile] containing the file path and the unique id in case of a clash\n */"} {"signature":"public open fun anchorForDCI ( dci : DCI , sourceSets : Set < DisplaySourceSet > ) : String","body":"= ( dci . dri . shortenToUrl ( ) . toString ( ) + \"\" + dci . kind + \"\" + sourceSets . shortenToUrl ( ) ) . urlEncoded ( )","docstring":"/**\n * Anchors should be unique and should contain sourcesets, dri and contentKind.\n * The idea is to make them as short as possible and just use a hashCode from sourcesets in order to match the\n * 2040 characters limit\n */"} {"signature":"override fun copyForChild ( ) : CopyForChildCoroutineElement","body":"{ return CopyForChildCoroutineElement ( myThreadLocal . get ( ) ) }","docstring":"/**\n * At coroutine launch time, the _current value of the ThreadLocal_ is inherited by the new\n * child coroutine, and that value is copied to a new, unique, ThreadContextElement memory\n * reference for the child coroutine to use uniquely.\n *\n * n.b. the value copied to the child must be the __current value of the ThreadLocal__ and not\n * the value initially passed to the ThreadContextElement in order to reflect writes made to the\n * ThreadLocal between coroutine resumption and the child coroutine launch point. Those writes\n * will be reflected in the parent coroutine's [CopyForChildCoroutineElement] when it yields the\n * thread and calls [restoreThreadContext].\n */"} {"signature":"private inline fun < ThreadLocalT , OutputT > ThreadLocal < ThreadLocalT > . setForBlock ( value : ThreadLocalT , crossinline block : ( ) -> OutputT )","body":"{ val priorValue = get ( ) set ( value ) block ( ) set ( priorValue ) }","docstring":"/**\n * Calls [block], setting the value of [this] [ThreadLocal] for the duration of [block].\n *\n * When a [CopyForChildCoroutineElement] for `this` [ThreadLocal] is used within a\n * [CoroutineContext], a ThreadLocal set this way will have the \"correct\" value expected lexically\n * at every statement reached, whether that statement is reached immediately, across suspend and\n * redispatch within one coroutine, or within a child coroutine. Writes made to the `ThreadLocal`\n * by child coroutines will not be visible to the parent coroutine. Writes made to the `ThreadLocal`\n * by the parent coroutine _after_ launching a child coroutine will not be visible to that child\n * coroutine.\n */"} {"signature":"@ kotlin . jvm . JvmName ( \"\" ) @ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalUnsignedTypes :: class ) public fun Sequence < UInt > . sum ( ) : UInt","body":"{ var sum : UInt = for ( element in this ) { sum += element } return sum }","docstring":"/**\n * Returns the sum of all elements in the sequence.\n *\n * The operation is _terminal_.\n */"} {"signature":"@ kotlin . jvm . JvmName ( \"\" ) @ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalUnsignedTypes :: class ) public fun Sequence < ULong > . sum ( ) : ULong","body":"{ var sum : ULong = for ( element in this ) { sum += element } return sum }","docstring":"/**\n * Returns the sum of all elements in the sequence.\n *\n * The operation is _terminal_.\n */"} {"signature":"@ kotlin . jvm . JvmName ( \"\" ) @ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalUnsignedTypes :: class ) public fun Sequence < UByte > . sum ( ) : UInt","body":"{ var sum : UInt = for ( element in this ) { sum += element } return sum }","docstring":"/**\n * Returns the sum of all elements in the sequence.\n *\n * The operation is _terminal_.\n */"} {"signature":"@ kotlin . jvm . JvmName ( \"\" ) @ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalUnsignedTypes :: class ) public fun Sequence < UShort > . sum ( ) : UInt","body":"{ var sum : UInt = for ( element in this ) { sum += element } return sum }","docstring":"/**\n * Returns the sum of all elements in the sequence.\n *\n * The operation is _terminal_.\n */"} {"signature":"internal fun suite ( name : String , ignored : Boolean , suiteFn : ( ) -> Unit )","body":"{ adapter ( ) . suite ( name , ignored , suiteFn ) }","docstring":"/**\n * The functions below are used by the compiler to describe the tests structure, e.g.\n *\n * suite('a suite', false, function() {\n * suite('a subsuite', false, function() {\n * test('a test', false, function() {...});\n * test('an ignored/pending test', true, function() {...});\n * });\n * suite('an ignored/pending test', true, function() {...});\n * });\n */"} {"signature":"open fun validate ( ) : Boolean","body":"= true","docstring":"/**\n * Validates the rule state just before it getting applied.\n * Returning false will skip the rule silently. To terminate the build instead, throw an error.\n */"} {"signature":"open fun dependencies ( versions : NpmVersions ) : Collection < RequiredKotlinJsDependency >","body":"= listOf ( )","docstring":"/**\n * Provides a list of required npm dependencies for the rule to function.\n */"} {"signature":"protected abstract fun loaders ( ) : List < Loader >","body":"protected abstract fun loaders ( ) : List < Loader >","docstring":"/**\n * Provides a loaders sequence to apply to the rule.\n */"} {"signature":"@ Composable expect fun ActualCartItem ( orderLine : OrderLine , removeSnack : ( Long ) -> Unit , increaseItemCount : ( Long ) -> Unit , decreaseItemCount : ( Long ) -> Unit , onSnackClick : ( Long ) -> Unit , modifier : Modifier = Modifier )","body":"@ Composable expect fun ActualCartItem ( orderLine : OrderLine , removeSnack : ( Long ) -> Unit , increaseItemCount : ( Long ) -> Unit , decreaseItemCount : ( Long ) -> Unit , onSnackClick : ( Long ) -> Unit , modifier : Modifier = Modifier )","docstring":"/**\n * Android uses ConstraintLayout which is android-only at the moment.\n * So we provide an alternative implementation of `ActualCartItem` for other platforms.\n */"} {"signature":"fun clearProject ( )","body":"{ _builder . clearProject ( ) }","docstring":"/**\n * optional .org.jetbrains.kotlin.gradle.idea.proto.generated.tcs.IdeaKotlinProjectCoordinatesProto project = 1;\n */"} {"signature":"fun hasProject ( ) : kotlin . Boolean","body":"{ return _builder . hasProject ( ) }","docstring":"/**\n * optional .org.jetbrains.kotlin.gradle.idea.proto.generated.tcs.IdeaKotlinProjectCoordinatesProto project = 1;\n * @return Whether the project field is set.\n */"} {"signature":"fun clearSourceSetName ( )","body":"{ _builder . clearSourceSetName ( ) }","docstring":"/**\n * optional string source_set_name = 2;\n */"} {"signature":"fun hasSourceSetName ( ) : kotlin . Boolean","body":"{ return _builder . hasSourceSetName ( ) }","docstring":"/**\n * optional string source_set_name = 2;\n * @return Whether the sourceSetName field is set.\n */"} {"signature":"private fun buildClangFlags ( configurables : Configurables ) : List < String >","body":"= mutableListOf < String > ( ) . apply { require ( configurables is ClangFlags ) addAll ( configurables . clangFlags ) addAll ( configurables . clangNooptFlags ) val targetTriple = if ( configurables is AppleConfigurables ) { configurables . targetTriple . withOSVersion ( configurables . osVersionMin ) } else { configurables . targetTriple } addAll ( listOf ( \"\" , targetTriple . toString ( ) ) ) } . toList ( )","docstring":"/**\n * Returns a list of Clang -cc1 arguments (including -cc1 itself) that are used for bitcode compilation in Kotlin/Native.\n *\n * See also: [org.jetbrains.kotlin.backend.konan.BitcodeCompiler]\n */"} {"signature":"@ Benchmark fun addAllLast ( ) : PersistentList . Builder < String >","body":"{ val builder = persistentListOf < String > ( ) . builder ( ) builder . addAll ( listToAdd ) return builder }","docstring":"/**\n * Adds [size] elements to an empty persistent list builder using `addAll` operation.\n */"} {"signature":"@ Benchmark fun addAllLast_Half ( ) : PersistentList . Builder < String >","body":"{ val initialSize = size / val subListToAdd = listToAdd . subList ( , size - initialSize ) val builder = persistentListBuilderAdd ( initialSize , immutablePercentage ) builder . addAll ( subListToAdd ) return builder }","docstring":"/**\n * Adds `size / 2` elements to an empty persistent list builder\n * and then adds `size - size / 2` elements using `addAll` operation.\n */"} {"signature":"@ Benchmark fun addAllLast_OneThird ( ) : PersistentList . Builder < String >","body":"{ val initialSize = size - size / val subListToAdd = listToAdd . subList ( , size - initialSize ) val builder = persistentListBuilderAdd ( initialSize , immutablePercentage ) builder . addAll ( subListToAdd ) return builder }","docstring":"/**\n * Adds `size - size / 3` elements to an empty persistent list builder\n * and then adds `size / 3` elements using `addAll` operation.\n */"} {"signature":"@ Benchmark fun addAllFirst_Half ( ) : PersistentList . Builder < String >","body":"{ val initialSize = size / val subListToAdd = listToAdd . subList ( , size - initialSize ) val builder = persistentListBuilderAdd ( initialSize , immutablePercentage ) builder . addAll ( , subListToAdd ) return builder }","docstring":"/**\n * Adds `size / 2` elements to an empty persistent list builder\n * and then inserts `size - size / 2` elements at the beginning using `addAll` operation.\n */"} {"signature":"@ Benchmark fun addAllFirst_OneThird ( ) : PersistentList . Builder < String >","body":"{ val initialSize = size - size / val subListToAdd = listToAdd . subList ( , size - initialSize ) val builder = persistentListBuilderAdd ( initialSize , immutablePercentage ) builder . addAll ( , subListToAdd ) return builder }","docstring":"/**\n * Adds `size - size / 3` elements to an empty persistent list builder\n * and then inserts `size / 3` elements at the beginning using `addAll` operation.\n */"} {"signature":"@ Benchmark fun addAllMiddle_Half ( ) : PersistentList . Builder < String >","body":"{ val initialSize = size / val index = initialSize / val subListToAdd = listToAdd . subList ( , size - initialSize ) val builder = persistentListBuilderAdd ( initialSize , immutablePercentage ) builder . addAll ( index , subListToAdd ) return builder }","docstring":"/**\n * Adds `size / 2` elements to an empty persistent list builder\n * and then inserts `size - size / 2` elements at the middle using `addAll` operation.\n */"} {"signature":"@ Benchmark fun addAllMiddle_OneThird ( ) : PersistentList . Builder < String >","body":"{ val initialSize = size - size / val index = initialSize / val subListToAdd = listToAdd . subList ( , size - initialSize ) val builder = persistentListBuilderAdd ( initialSize , immutablePercentage ) builder . addAll ( index , subListToAdd ) return builder }","docstring":"/**\n * Adds `size - size / 3` elements to an empty persistent list builder\n * and then inserts `size / 3` elements at the middle using `addAll` operation.\n */"} {"signature":"fun documentedVisibilities ( vararg visibilities : VisibilityModifier ) : Unit","body":"= documentedVisibilities . set ( visibilities . asList ( ) )","docstring":"/** Sets [documentedVisibilities] (overrides any previously set values). */"} {"signature":"fun whatever ( a : String )","body":"= a","docstring":"/**\n * Useless function [whatever] // EXPORT_KDOC\n *\n * This kdoc has some additional formatting. // EXPORT_KDOC\n * @param a keep intact and return // EXPORT_KDOC\n * @return value of [a] // EXPORT_KDOC\n * Check for additional comment (note) below // EXPORT_KDOC\n */"} {"signature":"internal fun prepareInstallation ( logger : Logger , nodeJsEnvironment : NodeJsEnvironment , packageManagerEnvironment : PackageManagerEnvironment , npmResolutionManager : KotlinNpmResolutionManager , ) : Installation","body":"{ synchronized ( projects ) { npmResolutionManager . parameters . gradleNodeModulesProvider . get ( ) . close ( ) val projectResolutions : List < PreparedKotlinCompilationNpmResolution > = projects . values . flatMap { it . npmProjects } . map { it . close ( npmResolutionManager , logger ) } nodeJsEnvironment . packageManager . prepareRootProject ( nodeJsEnvironment , packageManagerEnvironment , rootProjectName , rootProjectVersion , projectResolutions , ) return Installation ( projectResolutions ) } }","docstring":"/**\n * Don't use directly, use [KotlinNpmResolutionManager.installIfNeeded] instead.\n */"} {"signature":"private fun PatchBuilder . addObjCPatches ( )","body":"{ addProtocolImport ( \"\" ) addPrivateSelector ( \"\" ) addPrivateSelector ( \"\" ) addPrivateClass ( \"\" , \"\" ) addPrivateClass ( \"\" , \"\" ) addPrivateClass ( \"\" , \"\" ) addPrivateClass ( \"\" , \"\" ) addPrivateClass ( \"\" , \"\" ) addPrivateClass ( \"\" , \"\" ) addPrivateClass ( \"\" , \"\" ) addPrivateCategory ( \"\" ) addPrivateCategory ( \"\" ) addPrivateCategory ( \"\" ) addPrivateCategory ( \"\" ) addPrivateCategory ( \"\" ) addPrivateCategory ( \"\" ) addPrivateCategory ( \"\" ) addPrivateCategory ( \"\" ) addExportedClass ( objCExportNamer . kotlinAnyName , \"\" , \"\" , \"\" ) addExportedClass ( objCExportNamer . mutableSetName , \"\" , \"\" ) addExportedClass ( objCExportNamer . mutableMapName , \"\" , \"\" ) addExportedClass ( objCExportNamer . kotlinNumberName , \"\" ) NSNumberKind . values ( ) . mapNotNull { it . mappedKotlinClassId } . forEach { addExportedClass ( objCExportNamer . numberBoxName ( it ) , \"\" , \"\" ) } }","docstring":"/**\n * Add patches for objc.bc.\n */"} {"signature":"fun File . hasLlFirDivergenceDirective ( ) : Boolean","body":"= useLines { findDirectiveInLines ( it . iterator ( ) ) }","docstring":"/**\n * Checks whether the [File] contains a legal `LL_FIR_DIVERGENCE` directive without reading the whole file.\n */"} {"signature":"private fun findDirectiveInLines ( iterator : Iterator < String > ) : Boolean","body":"{ val firstNonBlankLine = iterator . nextNonBlankLineTrimmed ( ) if ( firstNonBlankLine != LL_FIR_DIVERGENCE_DIRECTIVE_COMMENT ) return false while ( iterator . hasNext ( ) ) { val line = iterator . nextNonBlankLineTrimmed ( ) ? : return false if ( line . startsWith ( \"\" ) ) { if ( line == LL_FIR_DIVERGENCE_DIRECTIVE_COMMENT ) return true } else return false } return false }","docstring":"/**\n * Tries to find the `LL_FIR_DIVERGENCE` directive in the lines given by [iterator] and returns whether this is the case. If the directive\n * was found, [iterator] is guaranteed to be advanced exactly past the `LL_FIR_DIVERGENCE` directive.\n *\n * The format of the directive is as such:\n *\n * ```\n * // LL_FIR_DIVERGENCE\n * // lorem ipsum\n * // dolor sit amet\n * // LL_FIR_DIVERGENCE\n * ```\n *\n * Blank lines before the directive or inside the directive region are ignored.\n */"} {"signature":"fun TestProject . assertSimpleConfigurationCacheScenarioWorks ( vararg buildArguments : String , buildOptions : BuildOptions , executedTaskNames : List < String > ? = null , checkUpToDateOnRebuild : Boolean = true , )","body":"{ val executedTask : List < String > = executedTaskNames ? : buildArguments . toList ( ) build ( * buildArguments , buildOptions = buildOptions ) { assertTasksExecuted ( * executedTask . toTypedArray ( ) ) if ( gradleVersion < GradleVersion . version ( TestVersions . Gradle . G_8_5 ) ) { assertOutputContains ( \"\" ) } else { assertOutputContains ( \"\" ) } assertConfigurationCacheStored ( ) } build ( \"\" , buildOptions = buildOptions ) build ( * buildArguments , buildOptions = buildOptions ) { assertTasksExecuted ( * executedTask . toTypedArray ( ) ) assertConfigurationCacheReused ( ) } if ( checkUpToDateOnRebuild ) { build ( * buildArguments , buildOptions = buildOptions ) { assertTasksUpToDate ( * executedTask . toTypedArray ( ) ) } } }","docstring":"/**\n * Tests whether configuration cache for the tasks specified by [buildArguments] works on simple scenario when project is built twice non-incrementally.\n */"} {"signature":"internal fun constArray ( tf : Ops , vararg data : Int ) : Operand < Int >","body":"{ return tf . constant ( data ) }","docstring":"/**\n * Creates constant array.\n */"} {"signature":"internal fun shapeOperand ( tf : Ops , shape : Shape ) : Operand < Int >","body":"{ return tf . constant ( shape . toIntArray ( ) ) }","docstring":"/** Creates shape [Operand] from [Shape]. */"} {"signature":"internal fun Shape . toIntArray ( ) : IntArray","body":"{ return IntArray ( numDimensions ( ) ) { size ( it ) . toInt ( ) } }","docstring":"/** Extracts dimensions as [IntArray] from [Shape]. */"} {"signature":"internal fun Shape . toLongArray ( ) : LongArray","body":"{ return LongArray ( numDimensions ( ) ) { size ( it ) } }","docstring":"/** Extracts dimensions as [LongArray] from [Shape]. */"} {"signature":"internal fun Shape . contentToString ( ) : String","body":"{ return toLongArray ( ) . contentToString ( ) }","docstring":"/** Extracts dimensions as a [String] from [Shape]. */"} {"signature":"public fun Shape . head ( ) : Long","body":"{ return size ( ) }","docstring":"/** Returns first dimension */"} {"signature":"public fun Shape . tail ( ) : LongArray","body":"{ return LongArray ( numDimensions ( ) - ) { size ( it + ) } }","docstring":"/** Returns last dimensions (except first). */"} {"signature":"internal fun Shape . numElements ( ) : Long","body":"= numElementsInShape ( toLongArray ( ) )","docstring":"/** Returns amount of elements in [Shape]. */"} {"signature":"internal fun shapeFromDims ( vararg dims : Long ) : Shape","body":"{ return Shape . make ( head ( * dims ) , * tail ( * dims ) ) }","docstring":"/** Creates [Shape] object from a few [Long] values in [dims]. */"} {"signature":"public fun TensorShape . toShape ( ) : Shape","body":"{ val d = dims ( ) return Shape . make ( head ( * d ) , * tail ( * d ) ) }","docstring":"/** Converts [TensorShape] to [Shape] object. */"} {"signature":"public fun Shape . toTensorShape ( ) : TensorShape","body":"{ return TensorShape ( toLongArray ( ) ) }","docstring":"/** Converts [Shape] to [TensorShape] object. */"} {"signature":"private fun getShapeOfArray ( data : Array < * > ) : Shape","body":"{ return shapeFromDims ( * getDimsOfArray ( data ) ) }","docstring":"/**\n * Get shape of array of arrays (of arrays...) of Array of elems of any type.\n * If the most inner array does not have any elements its size is missed in result */"} {"signature":"internal fun head ( vararg dims : Long ) : Long","body":"{ return dims [ ] }","docstring":"/** Returns first dimension from all dimensions [dims]. */"} {"signature":"internal fun tail ( vararg dims : Long ) : LongArray","body":"{ return dims . copyOfRange ( , dims . size ) }","docstring":"/** Returns last dimensions (except first) from [dims]. */"} {"signature":"internal fun numElementsInShape ( shape : LongArray ) : Long","body":"{ var prod = for ( i in shape . indices ) { prod *= abs ( shape [ i ] ) } return prod }","docstring":"/** Returns amount of elements in Tensor with [shape]. */"} {"signature":"fun efficientNetB0Prediction ( )","body":"{ val modelHub = ONNXModelHub ( cacheDirectory = File ( \"\" ) ) val modelType = ONNXModels . CV . EfficientNetB0 val model = modelHub . loadModel ( modelType ) model . printSummary ( ) val imageNetClassLabels = Imagenet . V1k . labels ( ) model . use { println ( it ) val fileDataLoader = modelType . createPreprocessing ( it ) . fileLoader ( ) for ( i in .. ) { val inputData = fileDataLoader . load ( getFileFromResource ( \"\" ) ) val res = it . predictLabel ( inputData ) println ( \"\" ) val top5 = it . predictTopNLabels ( inputData , imageNetClassLabels ) println ( top5 . toString ( ) ) } } }","docstring":"/**\n * This examples demonstrates the inference concept on EfficientNetB0 (exported from Keras to ONNX) model:\n * - Model configuration, model weights and labels are obtained from [ONNXModelHub].\n * - Model predicts on a few images located in resources.\n * - Special preprocessing (used in ResNet'50 during training on ImageNet dataset) is applied to each image before prediction.\n */"} {"signature":"fun main ( ) : Unit","body":"= efficientNetB0Prediction ( )","docstring":"/** */"} {"signature":"public open operator fun equals ( other : Any ? ) : Boolean","body":"public open operator fun equals ( other : Any ? ) : Boolean","docstring":"/**\n * Indicates whether some other object is \"equal to\" this one. Implementations must fulfil the following\n * requirements:\n *\n * * Reflexive: for any non-null value `x`, `x.equals(x)` should return true.\n * * Symmetric: for any non-null values `x` and `y`, `x.equals(y)` should return true if and only if `y.equals(x)` returns true.\n * * Transitive: for any non-null values `x`, `y`, and `z`, if `x.equals(y)` returns true and `y.equals(z)` returns true, then `x.equals(z)` should return true.\n * * Consistent: for any non-null values `x` and `y`, multiple invocations of `x.equals(y)` consistently return true or consistently return false, provided no information used in `equals` comparisons on the objects is modified.\n * * Never equal to null: for any non-null value `x`, `x.equals(null)` should return false.\n *\n * Read more about [equality](https://kotlinlang.org/docs/reference/equality.html) in Kotlin.\n */"} {"signature":"public open fun hashCode ( ) : Int","body":"public open fun hashCode ( ) : Int","docstring":"/**\n * Returns a hash code value for the object. The general contract of `hashCode` is:\n *\n * * Whenever it is invoked on the same object more than once, the `hashCode` method must consistently return the same integer, provided no information used in `equals` comparisons on the object is modified.\n * * If two objects are equal according to the `equals()` method, then calling the `hashCode` method on each of the two objects must produce the same integer result.\n */"} {"signature":"public open fun toString ( ) : String","body":"public open fun toString ( ) : String","docstring":"/**\n * Returns a string representation of the object.\n */"} {"signature":"@ Test fun testCreateThrowsOnInvalidArguments ( )","body":"{ for ( ctx in invalidContexts ) { assertFailsWith < IllegalArgumentException > { createTestCoroutineScope ( ctx ) } } }","docstring":"/** Tests failing to create a [TestCoroutineScope] with incorrect contexts. */"} {"signature":"@ Test fun testCreateProvidesScheduler ( )","body":"{ run { val scope = createTestCoroutineScope ( ) assertNotNull ( scope . coroutineContext [ TestCoroutineScheduler ] ) } run { val dispatcher = StandardTestDispatcher ( ) val scope = createTestCoroutineScope ( dispatcher ) assertSame ( dispatcher . scheduler , scope . coroutineContext [ TestCoroutineScheduler ] ) } run { val scheduler = TestCoroutineScheduler ( ) val scope = createTestCoroutineScope ( scheduler ) assertSame ( scheduler , scope . coroutineContext [ TestCoroutineScheduler ] ) assertSame ( scheduler , ( scope . coroutineContext [ ContinuationInterceptor ] as TestDispatcher ) . scheduler ) } run { val scheduler = TestCoroutineScheduler ( ) val dispatcher = StandardTestDispatcher ( scheduler ) val scope = createTestCoroutineScope ( scheduler + dispatcher ) assertSame ( scheduler , scope . coroutineContext [ TestCoroutineScheduler ] ) assertSame ( dispatcher , scope . coroutineContext [ ContinuationInterceptor ] ) } run { val scheduler = TestCoroutineScheduler ( ) val mainDispatcher = StandardTestDispatcher ( scheduler ) Dispatchers . setMain ( mainDispatcher ) try { val scope = createTestCoroutineScope ( ) assertSame ( scheduler , scope . coroutineContext [ TestCoroutineScheduler ] ) assertNotSame ( mainDispatcher , scope . coroutineContext [ ContinuationInterceptor ] ) } finally { Dispatchers . resetMain ( ) } } run { val mainDispatcher = StandardTestDispatcher ( ) Dispatchers . setMain ( mainDispatcher ) try { val scheduler = TestCoroutineScheduler ( ) val scope = createTestCoroutineScope ( scheduler ) assertSame ( scheduler , scope . coroutineContext [ TestCoroutineScheduler ] ) assertNotSame ( mainDispatcher . scheduler , scope . coroutineContext [ TestCoroutineScheduler ] ) assertNotSame ( mainDispatcher , scope . coroutineContext [ ContinuationInterceptor ] ) } finally { Dispatchers . resetMain ( ) } } }","docstring":"/** Tests that a newly-created [TestCoroutineScope] provides the correct scheduler. */"} {"signature":"@ Test fun testPresentDelaysThrowing ( )","body":"{ val scope = createTestCoroutineScope ( ) var result = false scope . launch { delay ( ) result = true } assertFalse ( result ) assertFailsWith < AssertionError > { scope . cleanupTestCoroutines ( ) } assertFalse ( result ) }","docstring":"/** Tests that the cleanup procedure throws if there were uncompleted delays by the end. */"} {"signature":"@ Test fun testActiveJobsThrowing ( )","body":"{ val scope = createTestCoroutineScope ( ) var result = false val deferred = CompletableDeferred < String > ( ) scope . launch { deferred . await ( ) result = true } assertFalse ( result ) assertFailsWith < AssertionError > { scope . cleanupTestCoroutines ( ) } assertFalse ( result ) }","docstring":"/** Tests that the cleanup procedure throws if there were active jobs by the end. */"} {"signature":"@ Test fun testCancelledDelaysNotThrowing ( )","body":"{ val scope = createTestCoroutineScope ( ) var result = false val deferred = CompletableDeferred < String > ( ) val job = scope . launch { deferred . await ( ) result = true } job . cancel ( ) assertFalse ( result ) scope . cleanupTestCoroutines ( ) assertFalse ( result ) }","docstring":"/** Tests that the cleanup procedure doesn't throw if it detects that the job is already cancelled. */"} {"signature":"@ Test fun testThrowsUncaughtExceptionsOnCleanup ( )","body":"{ val scope = createTestCoroutineScope ( ) val exception = TestException ( \"\" ) scope . launch { throw exception } assertFailsWith < TestException > { scope . cleanupTestCoroutines ( ) } }","docstring":"/** Tests that uncaught exceptions are thrown at the cleanup. */"} {"signature":"@ Test fun testUncaughtExceptionsPrioritizedOnCleanup ( )","body":"{ val scope = createTestCoroutineScope ( ) val exception = TestException ( \"\" ) scope . launch { throw exception } scope . launch { delay ( ) } assertFailsWith < TestException > { scope . cleanupTestCoroutines ( ) } }","docstring":"/** Tests that uncaught exceptions take priority over uncompleted jobs when throwing on cleanup. */"} {"signature":"@ Test fun testClosingTwice ( )","body":"{ val scope = createTestCoroutineScope ( ) scope . cleanupTestCoroutines ( ) assertFailsWith < IllegalStateException > { scope . cleanupTestCoroutines ( ) } }","docstring":"/** Tests that cleaning up twice is forbidden. */"} {"signature":"@ Test fun testSuppressedExceptions ( )","body":"{ createTestCoroutineScope ( ) . apply { launch ( SupervisorJob ( ) ) { throw TestException ( \"\" ) } launch ( SupervisorJob ( ) ) { throw TestException ( \"\" ) } launch ( SupervisorJob ( ) ) { throw TestException ( \"\" ) } try { cleanupTestCoroutines ( ) fail ( \"\" ) } catch ( e : TestException ) { assertEquals ( \"\" , e . message ) assertEquals ( , e . suppressedExceptions . size ) assertEquals ( \"\" , e . suppressedExceptions [ ] . message ) assertEquals ( \"\" , e . suppressedExceptions [ ] . message ) } } }","docstring":"/** Tests that, when reporting several exceptions, the first one is thrown, with the rest suppressed. */"} {"signature":"@ Test fun testCopyingContexts ( )","body":"{ val deferred = CompletableDeferred < Unit > ( ) val scope1 = createTestCoroutineScope ( ) scope1 . launch { deferred . await ( ) } val scope2 = createTestCoroutineScope ( scope1 . coroutineContext ) val scope3 = createTestCoroutineScope ( scope1 . coroutineContext ) assertEquals ( scope1 . coroutineContext . minusKey ( CoroutineExceptionHandler ) , scope2 . coroutineContext . minusKey ( CoroutineExceptionHandler ) ) scope2 . launch ( SupervisorJob ( ) ) { throw TestException ( \"\" ) } try { scope2 . cleanupTestCoroutines ( ) fail ( \"\" ) } catch ( e : TestException ) { } scope3 . cleanupTestCoroutines ( ) try { scope1 . cleanupTestCoroutines ( ) fail ( \"\" ) } catch ( e : UncompletedCoroutinesError ) { } }","docstring":"/** Tests that constructing a new [TestCoroutineScope] using another one's scope works and overrides the exception\n * handler. */"} {"signature":"fun foo ( )","body":"{ }","docstring":"/**\n * [A.toName.length]\n */"} {"signature":"@ JvmName ( \"\" ) public fun < T : Number , D : Dimension > Math . sin ( a : MultiArray < T , D > ) : NDArray < Double , D >","body":"= this . mathEx . sin ( a )","docstring":"/**\n * Returns an ndarray of Double from the given ndarray to each element of which a sin function has been applied.\n */"} {"signature":"@ JvmName ( \"\" ) public fun < D : Dimension > Math . sin ( a : MultiArray < Float , D > ) : NDArray < Float , D >","body":"= this . mathEx . sinF ( a )","docstring":"/**\n * Returns an ndarray of Float from the given ndarray to each element of which a sin function has been applied.\n */"} {"signature":"@ JvmName ( \"\" ) public fun < D : Dimension > Math . sin ( a : MultiArray < ComplexFloat , D > ) : NDArray < ComplexFloat , D >","body":"= this . mathEx . sinCF ( a )","docstring":"/**\n * Returns an ndarray of [ComplexFloat] from the given ndarray to each element of which a sin function has been applied.\n */"} {"signature":"@ JvmName ( \"\" ) public fun < D : Dimension > Math . sin ( a : MultiArray < ComplexDouble , D > ) : NDArray < ComplexDouble , D >","body":"= this . mathEx . sinCD ( a )","docstring":"/**\n * Returns an ndarray of [ComplexDouble] from the given ndarray to each element of which a sin function has been applied.\n */"} {"signature":"@ SinceKotlin ( \"\" ) public actual fun String ? . toBoolean ( ) : Boolean","body":"= this != null && this . lowercase ( ) == \"\"","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 actual fun String . toByte ( ) : Byte","body":"= toByteOrNull ( ) ? : numberFormatError ( this )","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 actual fun String . toByte ( radix : Int ) : Byte","body":"= toByteOrNull ( radix ) ? : numberFormatError ( this )","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 actual fun String . toShort ( ) : Short","body":"= toShortOrNull ( ) ? : numberFormatError ( this )","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 actual fun String . toShort ( radix : Int ) : Short","body":"= toShortOrNull ( radix ) ? : numberFormatError ( this )","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 actual fun String . toInt ( ) : Int","body":"= toIntOrNull ( ) ? : numberFormatError ( this )","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 actual fun String . toInt ( radix : Int ) : Int","body":"= toIntOrNull ( radix ) ? : numberFormatError ( this )","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 actual fun String . toLong ( ) : Long","body":"= toLongOrNull ( ) ? : numberFormatError ( this )","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 actual fun String . toLong ( radix : Int ) : Long","body":"= toLongOrNull ( radix ) ? : numberFormatError ( this )","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 actual fun String . toDouble ( ) : Double","body":"= ( + ( this . asDynamic ( ) ) ) . unsafeCast < Double > ( ) . also { if ( it . isNaN ( ) && ! this . isNaN ( ) || it == && this . isBlank ( ) ) numberFormatError ( this ) }","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":"@ kotlin . internal . InlineOnly public actual inline fun String . toFloat ( ) : Float","body":"= toDouble ( ) . unsafeCast < 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 actual fun String . toDoubleOrNull ( ) : Double ?","body":"= ( + ( this . asDynamic ( ) ) ) . unsafeCast < Double > ( ) . takeIf { ! ( it . isNaN ( ) && ! this . isNaN ( ) || it == && this . isBlank ( ) ) }","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":"@ kotlin . internal . InlineOnly public actual inline fun String . toFloatOrNull ( ) : Float ?","body":"= toDoubleOrNull ( ) . unsafeCast < 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 ( \"\" ) @ kotlin . internal . InlineOnly public actual inline fun Byte . toString ( radix : Int ) : String","body":"= this . toInt ( ) . toString ( radix )","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 ( \"\" ) @ kotlin . internal . InlineOnly public actual inline fun Short . toString ( radix : Int ) : String","body":"= this . toInt ( ) . toString ( radix )","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 actual fun Int . toString ( radix : Int ) : String","body":"= asDynamic ( ) . toString ( checkRadix ( radix ) )","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 actual fun Long . toString ( radix : Int ) : String","body":"= this . toStringImpl ( checkRadix ( radix ) )","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":"@ PublishedApi internal actual fun checkRadix ( radix : Int ) : Int","body":"{ if ( radix !in .. ) { throw IllegalArgumentException ( \"\" ) } return radix }","docstring":"/**\n * Checks whether the given [radix] is valid radix for string to number and number to string conversion.\n */"} {"signature":"actual fun < T > CoroutineScope . asyncWithDealy ( delay : Long , block : suspend ( ) -> T ) : Deferred < T >","body":"{ TODO ( \"\" ) }","docstring":"/**\n * Linux actual implementation for `asyncWithDelay`\n */"} {"signature":"fun serializeSingleFileMetadata ( file : SourceFile ) : ProtoBuf . PackageFragment","body":"fun serializeSingleFileMetadata ( file : SourceFile ) : ProtoBuf . PackageFragment","docstring":"/**\n * Serializes the metadata of a single source file to a protobuf message and returns the message.\n */"} {"signature":"fun forEachFile ( block : ( Int , SourceFile , KtSourceFile , FqName ) -> Unit )","body":"fun forEachFile ( block : ( Int , SourceFile , KtSourceFile , FqName ) -> Unit )","docstring":"/**\n * Iterates through each file whose metadata is to be serialized, providing an opportunity to call [serializeSingleFileMetadata]\n * and perform additional processing of the serialized data.\n *\n * @param block A closure that accepts the index of the file in the list of source files, the source file, its corresponding\n * [KtSourceFile], and the fully qualified name of the package containing the file.\n */"} {"signature":"private fun KotlinToolingDiagnosticsCollector . reportForDefaultPlatformCompilations ( compilations : Collection < KotlinCompilation < * > > )","body":"{ val alreadyReportedSourceSet = mutableSetOf < KotlinSourceSet > ( ) for ( compilation in compilations ) { val expectedSourceSetRoot = when { compilation . isMain ( ) -> COMMON_MAIN_SOURCE_SET_NAME compilation . isTest ( ) -> COMMON_TEST_SOURCE_SET_NAME else -> continue } val unexpectedSourceSetRoots = compilation . sourceSetRoots ( ) . filter { it . name != expectedSourceSetRoot } unexpectedSourceSetRoots . forEach { unexpectedSourceSetRoot -> if ( ! alreadyReportedSourceSet . add ( unexpectedSourceSetRoot ) ) return@forEach val includedIntoCompilations = unexpectedSourceSetRoot . internal . compilations . filter { it . platformType != KotlinPlatformType . common } if ( includedIntoCompilations . isEmpty ( ) ) return@forEach val singleCompilation = includedIntoCompilations . singleOrNull ( ) val diagnostic = if ( singleCompilation != null ) { MultipleSourceSetRootsInCompilation ( singleCompilation , unexpectedSourceSetRoot . name , expectedSourceSetRoot ) } else { MultipleSourceSetRootsInCompilation ( targetNames = includedIntoCompilations . map { it . target . name } , unexpectedSourceSetRoot . name , expectedSourceSetRoot ) } report ( compilation . project , diagnostic ) } } }","docstring":"/**\n * Report for 'main' and 'test' compilations.\n * These are special because we know that all source sets should depend on `commonMain` or `commonTest` accordingly.\n */"} {"signature":"private fun KotlinToolingDiagnosticsCollector . reportForNonDefaultCompilations ( compilations : Collection < KotlinCompilation < * > > )","body":"{ for ( compilation in compilations ) { if ( compilation . target . platformType == KotlinPlatformType . androidJvm ) continue val diagnostic = MultipleSourceSetRootsInCompilation ( compilation , compilation . sourceSetRoots ( ) . map { it . name } ) report ( compilation . project , diagnostic ) } }","docstring":"/**\n * For non-default compilations, we don't know which of the multiple source set roots should win so report diagnostic differently\n */"} {"signature":"fun render ( libraryAbi : LibraryAbi , settings : AbiRenderingSettings ) : String","body":"= buildString { render ( libraryAbi , this , settings ) }","docstring":"/**\n * Render the [LibraryAbi] to the string representation.\n *\n * @param libraryAbi The [LibraryAbi] instance previously read by [LibraryAbiReader].\n * @param settings The rendering settings.\n */"} {"signature":"fun render ( libraryAbi : LibraryAbi , output : Appendable , settings : AbiRenderingSettings ) : Unit","body":"= AbiRendererImpl ( libraryAbi , settings , output ) . render ( )","docstring":"/**\n * Render the [LibraryAbi] to the string representation.\n *\n * @param libraryAbi The [LibraryAbi] instance previously read by [LibraryAbiReader].\n * @param output The output to write the rendered text to.\n * @param settings The rendering settings.\n */"} {"signature":"@ Deprecated ( \"\" , level = DeprecationLevel . HIDDEN ) override fun typeParameter ( name : Name , variance : Variance , isReified : Boolean , key : GeneratedDeclarationKey , config : TypeParameterBuildingContext . ( ) -> Unit )","body":"{ shouldNotBeCalled ( ) }","docstring":"/**\n * Type parameters of constructor are inherited from constructed class\n */"} {"signature":"@ Deprecated ( \"\" , level = DeprecationLevel . HIDDEN ) override fun contextReceiver ( type : ConeKotlinType )","body":"{ shouldNotBeCalled ( ) }","docstring":"/**\n * Context receivers of constructor are inherited from constructed class\n */"} {"signature":"@ Deprecated ( \"\" , level = DeprecationLevel . HIDDEN ) override fun contextReceiver ( typeProvider : ( List < FirTypeParameterRef > ) -> ConeKotlinType )","body":"{ shouldNotBeCalled ( ) }","docstring":"/**\n * Context receivers of constructor are inherited from constructed class\n */"} {"signature":"public fun FirExtension . createConstructor ( owner : FirClassSymbol < * > , key : GeneratedDeclarationKey , isPrimary : Boolean = false , generateDelegatedNoArgConstructorCall : Boolean = false , config : ConstructorBuildingContext . ( ) -> Unit = { } ) : FirConstructor","body":"{ return ConstructorBuildingContext ( session , key , owner , isPrimary ) . apply ( config ) . apply { status { isExpect = owner . isExpect } } . build ( ) . also { if ( generateDelegatedNoArgConstructorCall ) { it . generateNoArgDelegatingConstructorCall ( session ) } } }","docstring":"/**\n * Creates constructor for [owner] class.\n * Created constructor is public, unless [config] changes this.\n *\n * [generateDelegatedNoArgConstructorCall] specifies whether default delegating constructor call to superclass should be generated.\n * This generation works only if superclass of the [owner] has constructor without arguments.\n * Custom delegated constructor calls should be generated in IR backend (see `IrGenerationExtension`).\n */"} {"signature":"public fun FirExtension . createDefaultPrivateConstructor ( owner : FirClassSymbol < * > , key : GeneratedDeclarationKey , generateDelegatedNoArgConstructorCall : Boolean = true ) : FirConstructor","body":"{ return createConstructor ( owner , key , isPrimary = true , generateDelegatedNoArgConstructorCall ) { visibility = Visibilities . Private } }","docstring":"/**\n * Creates private primary constructor without parameters for [owner] object.\n *\n * This is a shorthand for [createConstructor] which is useful for creating constructors for companions and other objects, as they should be private.\n *\n * [generateDelegatedNoArgConstructorCall] specifies whether default delegating constructor call to superclass should be generated.\n * This generation works only if superclass of the [owner] has constructor without arguments.\n * Custom delegated constructor calls should be generated in IR backend (see `IrGenerationExtension`).\n */"} {"signature":"public fun Scheduler . asCoroutineDispatcher ( ) : SchedulerCoroutineDispatcher","body":"= SchedulerCoroutineDispatcher ( this )","docstring":"/**\n * Converts an instance of [Scheduler] to an implementation of [CoroutineDispatcher].\n */"} {"signature":"override fun dispatch ( context : CoroutineContext , block : Runnable )","body":"{ scheduler . schedule ( block ) }","docstring":"/** @suppress */"} {"signature":"override fun scheduleResumeAfterDelay ( timeMillis : Long , continuation : CancellableContinuation < Unit > )","body":"{ val disposable = scheduler . schedule ( { with ( continuation ) { resumeUndispatched ( Unit ) } } , timeMillis , TimeUnit . MILLISECONDS ) continuation . disposeOnCancellation ( disposable . asDisposableHandle ( ) ) }","docstring":"/** @suppress */"} {"signature":"override fun invokeOnTimeout ( timeMillis : Long , block : Runnable , context : CoroutineContext ) : DisposableHandle","body":"= scheduler . schedule ( block , timeMillis , TimeUnit . MILLISECONDS ) . asDisposableHandle ( )","docstring":"/** @suppress */"} {"signature":"override fun toString ( ) : String","body":"= scheduler . toString ( )","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":"@ Test fun testImmediate ( )","body":"= runTest { expect ( ) val job = launch { expect ( ) } assertFalse ( Dispatchers . Main . immediate . isDispatchNeeded ( currentCoroutineContext ( ) ) ) withContext ( Dispatchers . Main . immediate ) { expect ( ) } job . join ( ) finish ( ) }","docstring":"/** Tests that [MainCoroutineDispatcher.immediate] doesn't require dispatches from the test context. */"} {"signature":"public fun facet ( variable : ColumnReference < * > , order : OrderDirection = OrderDirection . ASCENDING , format : String ? = null )","body":"{ facets . add ( variable ) orders . add ( order ) formats . add ( format ) }","docstring":"/**\n * Adds a new facet to the plot, defined by the specified variable.\n * This method allows the division of data into different subsets,\n * where each subset is represented as a separate panel in the plot.\n *\n * @param variable a reference to the column that defines the variable for this facet.\n * The values in this column are used to create different subsets of the data, which are then plotted as separate panels.\n * @param order specifies the ordering direction of the values in this facet.\n * It can be either [OrderDirection.ASCENDING] or [OrderDirection.DESCENDING].\n * The default value is [OrderDirection.ASCENDING].\n * @param format a string that specifies the format pattern for displaying the values in this facet in rows.\n * This can either be a simple number format (like \"d\")\n * or a string template where the number format is surrounded by curly braces (for example, \"{d} cylinders\").\n * > That the \"$\" character must be escaped as \"\\$\".\n *\n *\n * Examples of format patterns:\n * - \".2f\" -> \"12.45\"\n * - \"Score: {.2f}\" -> \"Score: 12.45\"\n * - \"'Score: {}'\" -> \"Score: 12.454789\"\n */"} {"signature":"@ OptIn ( UnsafeWasmMemoryApi :: class ) internal fun MemoryAllocator . storeString ( value : String ) : Pair < Pointer , Int >","body":"{ val bytes = value . encodeToByteArray ( ) val ptr = allocate ( bytes . size + ) ptr . storeBytes ( bytes ) ptr . storeByte ( bytes . size , ) return ptr to ( bytes . size + ) }","docstring":"/**\n * Encoding [value] into a NULL-terminated byte sequence using UTF-8 encoding\n * and writes it to a memory region allocated to fit the sequence.\n * Return a pointer to the beginning of the written byte sequence and its length.\n */"} {"signature":"internal fun Pointer . allocateString ( value : String ) : Int","body":"{ val bytes = value . encodeToByteArray ( ) storeBytes ( bytes ) storeByte ( bytes . size , ) return bytes . size + }","docstring":"/**\n * Encodes [value] into a NULL-terminated byte sequence using UTF-8 encoding,\n * stores it in memory starting at the position this pointer points to,\n * and returns the length of the stored bytes sequence.\n */"} {"signature":"@ UnsafeWasmMemoryApi internal fun MemoryAllocator . allocateInt ( ) : Pointer","body":"= allocate ( Int . SIZE_BYTES )","docstring":"/**\n * Allocates memory to hold a single integer value.\n */"} {"signature":"public fun < T > fillColor ( column : ColumnReference < T > , parameters : LetsPlotNonPositionalMappingParametersContinuous < T , Color > . ( ) -> Unit = { } ) : NonPositionalMapping < T , Color >","body":"{ return addNonPositionalMapping < T , Color > ( FILL , column . name ( ) , LetsPlotNonPositionalMappingParametersContinuous < T , Color > ( ) . apply ( parameters ) ) }","docstring":"/**\n * Maps the `fillColor` aesthetic to a data column by [ColumnReference].\n *\n * @param column the data column to map to the color.\n * @param parameters optional lambda to configure additional scale parameters.\n * @return a [NonPositionalMapping] object representing the mapping.\n */"} {"signature":"public fun < T > fillColor ( column : KProperty < T > , parameters : LetsPlotNonPositionalMappingParametersContinuous < T , Color > . ( ) -> Unit = { } ) : NonPositionalMapping < T , Color >","body":"{ return addNonPositionalMapping < T , Color > ( FILL , column . name , LetsPlotNonPositionalMappingParametersContinuous < T , Color > ( ) . apply ( parameters ) ) }","docstring":"/**\n * Maps the `fillColor` aesthetic to a data column by [KProperty].\n *\n * @param column the data column to map to the color.\n * @param parameters optional lambda to configure additional scale parameters.\n * @return a [NonPositionalMapping] object representing the mapping.\n */"} {"signature":"public fun fillColor ( column : String , parameters : LetsPlotNonPositionalMappingParametersContinuous < Any ? , Color > . ( ) -> Unit = { } ) : NonPositionalMapping < Any ? , Color >","body":"{ return addNonPositionalMapping < Any ? , Color > ( FILL , column , LetsPlotNonPositionalMappingParametersContinuous < Any ? , Color > ( ) . apply ( parameters ) ) }","docstring":"/**\n * Maps the `fillColor` aesthetic to a data column by [String].\n *\n * @param column the data column to map to the color.\n * @param parameters optional lambda to configure additional scale parameters.\n * @return a [NonPositionalMapping] object representing the mapping.\n */"} {"signature":"public fun < T > fillColor ( values : Iterable < T > , name : String ? = null , parameters : LetsPlotNonPositionalMappingParametersContinuous < T , Color > . ( ) -> Unit = { } ) : NonPositionalMapping < T , Color >","body":"{ return addNonPositionalMapping < T , Color > ( FILL , values . toList ( ) , name , LetsPlotNonPositionalMappingParametersContinuous < T , Color > ( ) . apply ( parameters ) ) }","docstring":"/**\n * Maps the `fillColor` 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 a [NonPositionalMapping] object representing the mapping.\n */"} {"signature":"public fun < T > fillColor ( values : DataColumn < T > , parameters : LetsPlotNonPositionalMappingParametersContinuous < T , Color > . ( ) -> Unit = { } ) : NonPositionalMapping < T , Color >","body":"{ return addNonPositionalMapping < T , Color > ( FILL , values , LetsPlotNonPositionalMappingParametersContinuous < T , Color > ( ) . apply ( parameters ) ) }","docstring":"/**\n * Maps the `fillColor` aesthetic to a data column.\n *\n * @param values the data column to map to the color.\n * @param parameters optional lambda to configure additional scale parameters.\n * @return a [NonPositionalMapping] object representing the mapping.\n */"} {"signature":"@ ExamplesTest ( \"\" , [ \"\" ] ) fun CheckerContext . testResolveConfigurationInExecuteTime ( )","body":"{ assertFalse ( output . contains ( \"\" ) , \"\" ) assertFalse ( output . contains ( \"\" ) , \"\" ) }","docstring":"/**\n * Check that Kover artifact files are not resolved during the task dependency tree construction process.\n *\n * The task tree is built at the configuration stage, so getting artifacts from dependencies can lead to premature task launches, deadlocks, and performance degradation.\n *\n * If a resolution is detected during configuration, the message \"Configuration 'koverExternalArtifactsRelease' was resolved during configuration time\" is printed.\n * This message may be changed in future versions, so it's worth double-checking for this error.\n */"} {"signature":"public fun useInProcessStrategy ( ) : CompilerExecutionStrategyConfiguration","body":"public fun useInProcessStrategy ( ) : CompilerExecutionStrategyConfiguration","docstring":"/**\n * Marks the compilation to be run inside the same JVM as the caller.\n * The default strategy.\n */"} {"signature":"public fun useDaemonStrategy ( jvmArguments : List < String > , ) : CompilerExecutionStrategyConfiguration","body":"public fun useDaemonStrategy ( jvmArguments : List < String > , ) : CompilerExecutionStrategyConfiguration","docstring":"/**\n * Marks the compilation to be run in Kotlin daemon launched as a separate process and shared across similar compilation requests.\n * See Kotlin daemon documentation here: https://kotlinlang.org/docs/gradle-compilation-and-caches.html#the-kotlin-daemon-and-how-to-use-it-with-gradle\n * @param jvmArguments a list of JVM startup arguments for the daemon\n */"} {"signature":"public fun ImageProxy . toBitmap ( applyRotation : Boolean = false ) : Bitmap","body":"{ val bitmap = when ( format ) { ImageFormat . YUV_420_888 -> yuv4208888ToBitmap ( this ) PixelFormat . RGBA_8888 -> rgba8888ToBitmap ( this ) else -> throw IllegalStateException ( \"\" ) } return if ( applyRotation ) { val rotatedBitmap = Rotate ( imageInfo . rotationDegrees . toFloat ( ) ) . apply ( bitmap ) if ( rotatedBitmap != bitmap ) { bitmap . recycle ( ) } rotatedBitmap } else { bitmap } }","docstring":"/**\n * Converts an [ImageProxy] to a [Bitmap].\n * Currently only supports [ImageFormat.YUV_420_888] and [PixelFormat.RGBA_8888].\n *\n * @param applyRotation if true the resulting bitmap will be rotated to match target orientation of a use case.\n * @throws [IllegalStateException] if the input format is [ImageFormat.YUV_420_888] and jpeg encoding of [YuvImage] fails.\n * @see ImageAnalysis supported output formats\n */"} {"signature":"public fun imageToByteBuffer ( image : ImageProxy , outputBuffer : ByteArray , pixelCount : Int )","body":"{ assert ( image . format == ImageFormat . YUV_420_888 ) val imageCrop = image . cropRect val imagePlanes = image . planes imagePlanes . forEachIndexed { planeIndex , plane -> val outputStride : Int var outputOffset : Int when ( planeIndex ) { -> { outputStride = outputOffset = } -> { outputStride = outputOffset = pixelCount + } -> { outputStride = outputOffset = pixelCount } else -> { return@forEachIndexed } } val planeBuffer = plane . buffer val rowStride = plane . rowStride val pixelStride = plane . pixelStride val planeCrop = if ( planeIndex == ) { imageCrop } else { Rect ( imageCrop . left / , imageCrop . top / , imageCrop . right / , imageCrop . bottom / ) } val planeWidth = planeCrop . width ( ) val planeHeight = planeCrop . height ( ) val rowBuffer = ByteArray ( plane . rowStride ) val rowLength = if ( pixelStride == && outputStride == ) { planeWidth } else { ( planeWidth - ) * pixelStride + } for ( row in until planeHeight ) { planeBuffer . position ( ( row + planeCrop . top ) * rowStride + planeCrop . left * pixelStride ) if ( pixelStride == && outputStride == ) { planeBuffer . get ( outputBuffer , outputOffset , rowLength ) outputOffset += rowLength } else { planeBuffer . get ( rowBuffer , , rowLength ) for ( col in until planeWidth ) { outputBuffer [ outputOffset ] = rowBuffer [ col * pixelStride ] outputOffset += outputStride } } } } }","docstring":"/**\n * Decoding of YUV_420_888 image to NV21 byte representation.\n */"} {"signature":"public fun Plot . save ( filename : String , scale : Number = , dpi : Number ? = null , path : String ? = null ) : String","body":"= ggsave ( toLetsPlot ( ) , filename , scale , dpi , path )","docstring":"/**\n * Exports a plot to a file in one of the supported formats: `SVG`, `HTML`, `PNG`, `JPG`/`JPEG`, or `TIFF`.\n *\n * > In certain configurations, raster formats might not be supported.\n *\n * The exported file will be created in the directory `${user.dir}/lets-plot-images`,\n * unless a different directory is specified using the [path] parameter.\n *\n * @receiver [Plot] - the plot to export.\n * @param filename the name of the output file.\n * The filename must include an extension corresponding to one of the supported formats:\n * **svg**, **html** (or **htm**), **png**, **jpeg** (or **jpg**), or **tiff** (or **tif**).\n * @param scale The scaling is applied to the plot when exporting to raster formats (`PNG`, `JPEG`, `TIFF`).\n * This parameter is ignored for vector formats (`SVG`, `HTML`).\n * The default value is 1.\n * @param dpi the resolution of the exported image in dots per inch (DPI) when exporting to raster formats.\n * This parameter is ignored for vector formats.\n * By default, no DPI metadata is stored in the file.\n * @param path the path to the directory where the image files will be saved.\n * If not specified, the default directory is `${user.dir}/lets-plot-images`.\n *\n * @return The absolute pathname of the created file.\n */"} {"signature":"public fun PlotGrid . save ( filename : String , scale : Number = , dpi : Number ? = null , path : String ? = null ) : String","body":"= ggsave ( wrap ( ) , filename , scale , dpi , path )","docstring":"/**\n * Exports a plot grid to a file in one of the supported formats: `SVG`, `HTML`, `PNG`, `JPG`/`JPEG`, or `TIFF`.\n *\n * > In certain configurations, raster formats might not be supported.\n *\n * The exported file will be created in the directory `${user.dir}/lets-plot-images`,\n * unless a different directory is specified using the [path] parameter.\n *\n * @receiver [Plot] - the plot to export.\n * @param filename the name of the output file.\n * The filename must include an extension corresponding to one of the supported formats:\n * **svg**, **html** (or **htm**), **png**, **jpeg** (or **jpg**), or **tiff** (or **tif**).\n * @param scale The scaling is applied to the plot when exporting to raster formats (`PNG`, `JPEG`, `TIFF`).\n * This parameter is ignored for vector formats (`SVG`, `HTML`).\n * The default value is 1.\n * @param dpi the resolution of the exported image in dots per inch (DPI) when exporting to raster formats.\n * This parameter is ignored for vector formats.\n * By default, no DPI metadata is stored in the file.\n * @param path the path to the directory where the image files will be saved.\n * If not specified, the default directory is `${user.dir}/lets-plot-images`.\n *\n * @return The absolute pathname of the created file.\n */"} {"signature":"public fun PlotBunch . save ( filename : String , scale : Number = , dpi : Number ? = null , path : String ? = null ) : String","body":"= ggsave ( wrap ( ) , filename , scale , dpi , path )","docstring":"/**\n * Exports a plot bunch to a file in one of the supported formats: `SVG`, `HTML`, `PNG`, `JPG`/`JPEG`, or `TIFF`.\n *\n * > In certain configurations, raster formats might not be supported.\n *\n * The exported file will be created in the directory `${user.dir}/lets-plot-images`,\n * unless a different directory is specified using the [path] parameter.\n *\n * @receiver [Plot] - the plot to export.\n * @param filename the name of the output file.\n * The filename must include an extension corresponding to one of the supported formats:\n * **svg**, **html** (or **htm**), **png**, **jpeg** (or **jpg**), or **tiff** (or **tif**).\n * @param scale The scaling is applied to the plot when exporting to raster formats (`PNG`, `JPEG`, `TIFF`).\n * This parameter is ignored for vector formats (`SVG`, `HTML`).\n * The default value is 1.\n * @param dpi the resolution of the exported image in dots per inch (DPI) when exporting to raster formats.\n * This parameter is ignored for vector formats.\n * By default, no DPI metadata is stored in the file.\n * @param path the path to the directory where the image files will be saved.\n * If not specified, the default directory is `${user.dir}/lets-plot-images`.\n *\n * @return The absolute pathname of the created file.\n */"} {"signature":"public fun rewrite ( arguments : List < String > , typeArguments : List < String > ) : String","body":"public fun rewrite ( arguments : List < String > , typeArguments : List < String > ) : String","docstring":"/**\n *\n * A value argument and type arguments represents a string from source code in [arguments] and [typeArguments]\n * E.g., `f(1, \"s\")` will be passed to [rewrite] as `\"1\"` and `\"\\\"s\\\"\"`\n *\n * In the case of a [trailing lambda](https://kotlinlang.org/docs/lambdas.html#passing-trailing-lambdas),\n * it will be passed as it in the last element of [arguments]\n * E.g., the snippet `f(0) { i++ }` will have `\"0\"` and `\"{ i++ }\"` arguments\n *\n * @param arguments a list of arguments represented as a string from source code\n * _Note:_ en empty string is possible, e.g. for `fun f(,,,)`\n * @param typeArguments a list of type parameters represented as a string from source code\n * _Note:_ en empty string is possible\n *\n * @return a string or an empty string to delete the call expression\n */"} {"signature":"public fun rewriteImportDirective ( importPath : String ) : String ?","body":"= importPath","docstring":"/**\n * Allows to rewrite paths of [import directives](https://kotlinlang.org/spec/packages-and-imports.html#importing)\n * E.g., for `import org.example` the path `org.example` will be used as an argument of [rewriteImportDirective]\n *\n * The default implementation is the identity function that return unchanged an import path\n *\n * @param importPath a path of value of import directive\n *\n * @return a string or `null` to delete a whole import directive in [SampleSnippet.imports]\n *\n * @see SampleSnippet.imports\n */"} {"signature":"public fun getFunctionCallRewriter ( name : String ) : FunctionCallRewriter ?","body":"public fun getFunctionCallRewriter ( name : String ) : FunctionCallRewriter ?","docstring":"/**\n * Allows to rewrite a function call expressions\n * It also includes calls of constructors\n *\n * @return [FunctionCallRewriter] or null if a call should be left unchanged\n */"} {"signature":"fun targetDependency ( target : TargetWithSanitizer = TargetWithSanitizer . host ) : Buildable","body":"= nativeDependencies . incoming . artifactView { attributes { attribute ( TargetWithSanitizer . TARGET_ATTRIBUTE , target ) } } . files","docstring":"/**\n * Dependency on [target] platform.\n */"} {"signature":"fun targetDependency ( target : KonanTarget ) : Buildable","body":"= targetDependency ( target . withSanitizer ( ) )","docstring":"/**\n * Dependency on [target] platform.\n */"} {"signature":"private fun handleClassAnnotations ( classSymbol : Symbol . ClassSymbol )","body":"{ elementUtils . getAllAnnotationMirrors ( classSymbol ) . forEach { ( it . annotationType . asElement ( ) as? TypeElement ) ? . let { sourceStructure . addMentionedAnnotations ( it . qualifiedName . toString ( ) ) } } }","docstring":"/** Handle annotations on this class, including the @Inherited ones as those are not visible using Tree APIs. */"} {"signature":"private fun IrStatementsBuilder < * > . addAndGetLastExpression ( blockBuilder : IrBlockBodyBuilder . ( ) -> Unit ) : IrExpression","body":"{ val irBlockBody = irBlockBody ( startOffset , endOffset , blockBuilder ) irBlockBody . statements . dropLast ( ) . forEach { + it } return irBlockBody . statements . last ( ) as? IrExpression ? : error ( \"\" ) }","docstring":"/**\n * Add all statements to the builder, except the last one.\n * The last statement should be an expression, it will return as a result\n */"} {"signature":"fun File . setFileContent ( content : String )","body":"{ check ( ! exists ( ) ) { \"\" + \"\" + readText ( ) + \"\" + \"\" + content + \"\" } parentFile . mkdirs ( ) writeText ( content ) }","docstring":"/**\n * Set required content for [this] [File].\n */"} {"signature":"public abstract fun apply ( tf : Ops , yPred : Operand < Float > , yTrue : Operand < Float > , numberOfLosses : Operand < Float > ? ) : Operand < Float >","body":"public abstract fun apply ( tf : Ops , yPred : Operand < Float > , yTrue : Operand < Float > , numberOfLosses : Operand < Float > ? ) : Operand < Float >","docstring":"/**\n * Applies [LossFunction] to the [yPred] labels predicted by the model and known [yTrue] hidden during training.\n *\n * @param yPred The predicted values. shape = `[batch_size, d0, .. dN]`.\n * @param yTrue Ground truth values. Shape = `[batch_size, d0, .. dN]`, except\n * sparse loss functions such as sparse categorical crossentropy where\n * shape = `[batch_size, d0, .. dN-1]`.\n * @param [tf] TensorFlow graph API for building operations.\n */"} {"signature":"fun register ( @ TestDataFile testDataFilePath : String , sourceTransformer : ExternalSourceTransformer )","body":"{ registeredSourceTransformers . computeIfAbsent ( getAbsoluteFile ( testDataFilePath ) ) { mutableListOf ( ) } += sourceTransformer }","docstring":"/**\n * Called directly from test class constructor.\n */"} {"signature":"@ Test fun `test single native target in hierarchy` ( )","body":"{ val result = commonize { outputTarget ( \"\" , \"\" , \"\" ) simpleSingleSourceTarget ( \"\" , \"\"\"\"\"\" ) } result . assertCommonized ( \"\" , \"\" ) result . assertCommonized ( \"\" , \"\" ) }","docstring":"/**\n * Following the simple design principle:\n * Absent/Unsupported targets shall result in the same output as a request only mentioning supported targets\n */"} {"signature":"private fun tryResolveMarkerInterfaceFQName ( classId : ClassId ) : String ?","body":"{ for ( mapping in JavaToKotlinClassMap . mutabilityMappings ) { if ( mapping . kotlinReadOnly == classId ) { return \"\" } else if ( mapping . kotlinMutable == classId ) { return \"\" + classId . relativeClassName . asString ( ) . replace ( \"\" , \"\" ) . replace ( \"\" , \"\" ) } } return null }","docstring":"/***\n * @see org.jetbrains.kotlin.codegen.ImplementationBodyCodegen\n */"} {"signature":"protected fun initParentJob ( parent : Job ? )","body":"{ assert { parentHandle == null } if ( parent == null ) { parentHandle = NonDisposableHandle return } parent . start ( ) @ Suppress ( \"\" ) val handle = parent . attachChild ( this ) parentHandle = handle if ( isCompleted ) { handle . dispose ( ) parentHandle = NonDisposableHandle } }","docstring":"/**\n * Initializes parent job.\n * It shall be invoked at most once after construction after all other initialization.\n */"} {"signature":"private inline fun loopOnState ( block : ( Any ? ) -> Unit ) : Nothing","body":"{ while ( true ) { block ( state ) } }","docstring":"/**\n * @suppress **This is unstable API and it is subject to change.**\n */"} {"signature":"private fun cancelParent ( cause : Throwable ) : Boolean","body":"{ if ( isScopedCoroutine ) return true val isCancellation = cause is CancellationException val parent = parentHandle if ( parent === null || parent === NonDisposableHandle ) { return isCancellation } return parent . childCancelled ( cause ) || isCancellation }","docstring":"/**\n * The method that is invoked when the job is cancelled to possibly propagate cancellation to the parent.\n * Returns `true` if the parent is responsible for handling the exception, `false` otherwise.\n *\n * Invariant: never returns `false` for instances of [CancellationException], otherwise such exception\n * may leak to the [CoroutineExceptionHandler].\n */"} {"signature":"protected open fun onStart ( )","body":"{ }","docstring":"/**\n * Override to provide the actual [start] action.\n * This function is invoked exactly once when non-active coroutine is [started][start].\n */"} {"signature":"internal fun removeNode ( node : JobNode )","body":"{ loopOnState { state -> when ( state ) { is JobNode -> { if ( state !== node ) return if ( _state . compareAndSet ( state , EMPTY_ACTIVE ) ) return } is Incomplete -> { if ( state . list != null ) node . remove ( ) return } else -> return } } }","docstring":"/**\n * @suppress **This is unstable API and it is subject to change.**\n */"} {"signature":"public open fun childCancelled ( cause : Throwable ) : Boolean","body":"{ if ( cause is CancellationException ) return true return cancelImpl ( cause ) && handlesException }","docstring":"/**\n * Child was cancelled with a cause.\n * In this method parent decides whether it cancels itself (e.g. on a critical failure) and whether it handles the exception of the child.\n * It is overridden in supervisor implementations to completely ignore any child cancellation.\n * Returns `true` if exception is handled, `false` otherwise (then caller is responsible for handling an exception)\n *\n * Invariant: never returns `false` for instances of [CancellationException], otherwise such exception\n * may leak to the [CoroutineExceptionHandler].\n */"} {"signature":"public fun cancelCoroutine ( cause : Throwable ? ) : Boolean","body":"= cancelImpl ( cause )","docstring":"/**\n * Makes this [Job] cancelled with a specified [cause].\n * It is used in [AbstractCoroutine]-derived classes when there is an internal failure.\n */"} {"signature":"internal fun makeCompleting ( proposedUpdate : Any ? ) : Boolean","body":"{ loopOnState { state -> val finalState = tryMakeCompleting ( state , proposedUpdate ) when { finalState === COMPLETING_ALREADY -> return false finalState === COMPLETING_WAITING_CHILDREN -> return true finalState === COMPLETING_RETRY -> return@loopOnState else -> { afterCompletion ( finalState ) return true } } } }","docstring":"/**\n * Completes this job. Used by [CompletableDeferred.complete] (and exceptionally)\n * and by [JobImpl.cancel]. It returns `false` on repeated invocation\n * (when this job is already completing).\n */"} {"signature":"internal fun makeCompletingOnce ( proposedUpdate : Any ? ) : Any ?","body":"{ loopOnState { state -> val finalState = tryMakeCompleting ( state , proposedUpdate ) when { finalState === COMPLETING_ALREADY -> throw IllegalStateException ( \"\" + \"\" , proposedUpdate . exceptionOrNull ) finalState === COMPLETING_RETRY -> return@loopOnState else -> return finalState } } }","docstring":"/**\n * Completes this job. Used by [AbstractCoroutine.resume].\n * It throws [IllegalStateException] on repeated invocation (when this job is already completing).\n * Returns:\n * - [COMPLETING_WAITING_CHILDREN] if started waiting for children.\n * - Final state otherwise (caller should do [afterCompletion])\n */"} {"signature":"internal open fun handleOnCompletionException ( exception : Throwable )","body":"{ throw exception }","docstring":"/**\n * Override to process any exceptions that were encountered while invoking completion handlers\n * installed via [invokeOnCompletion].\n *\n * @suppress **This is unstable API and it is subject to change.**\n */"} {"signature":"protected open fun onCancelling ( cause : Throwable ? )","body":"{ }","docstring":"/**\n * This function is invoked once as soon as this job is being cancelled for any reason or completes,\n * similarly to [invokeOnCompletion] with `onCancelling` set to `true`.\n *\n * The meaning of [cause] parameter:\n * - Cause is `null` when the job has completed normally.\n * - Cause is an instance of [CancellationException] when 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 been cancelled or failed with exception.\n *\n * The specified [cause] is not the final cancellation cause of this job.\n * A job may produce other exceptions while it is failing and the final cause might be different.\n *\n * @suppress **This is unstable API and it is subject to change.*\n */"} {"signature":"protected open fun handleJobException ( exception : Throwable ) : Boolean","body":"= false","docstring":"/**\n * Handles the final job [exception] that was not handled by the parent coroutine.\n * Returns `true` if it handles exception (so handling at later stages is not needed).\n * It is designed to be overridden by launch-like coroutines\n * (`StandaloneCoroutine` and `ActorCoroutine`) that don't have a result type\n * that can represent exceptions.\n *\n * This method is invoked **exactly once** when the final exception of the job is determined\n * and before it becomes complete. At the moment of invocation the job and all its children are complete.\n */"} {"signature":"protected open fun onCompletionInternal ( state : Any ? )","body":"{ }","docstring":"/**\n * Override for completion actions that need to update some external object depending on job's state,\n * right before all the waiters for coroutine's completion are notified.\n *\n * @param state the final state.\n *\n * @suppress **This is unstable API and it is subject to change.**\n */"} {"signature":"protected open fun afterCompletion ( state : Any ? )","body":"{ }","docstring":"/**\n * Override for the very last action on job's completion to resume the rest of the code in\n * scoped coroutines. It is called when this job is externally completed in an unknown\n * context and thus should resume with a default mode.\n *\n * @suppress **This is unstable API and it is subject to change.**\n */"} {"signature":"internal open fun nameString ( ) : String","body":"= classSimpleName","docstring":"/**\n * @suppress **This is unstable API and it is subject to change.**\n */"} {"signature":"internal fun getCompletedInternal ( ) : Any ?","body":"{ val state = this . state check ( state !is Incomplete ) { \"\" } if ( state is CompletedExceptionally ) throw state . cause return state . unboxState ( ) }","docstring":"/**\n * @suppress **This is unstable API and it is subject to change.**\n */"} {"signature":"protected suspend fun awaitInternal ( ) : Any ?","body":"{ while ( true ) { val state = this . state if ( state !is Incomplete ) { if ( state is CompletedExceptionally ) { recoverAndThrow ( state . cause ) } return state . unboxState ( ) } if ( startInternal ( state ) >= ) break } return awaitSuspend ( ) }","docstring":"/**\n * @suppress **This is unstable API and it is subject to change.**\n */"} {"signature":"fun loadActual ( ) : Attrs ?","body":"fun loadActual ( ) : Attrs ?","docstring":"/**\n * Load actual cache attribute values.\n * `null` means that cache is not yet created.\n *\n * This is internal operation that should be implemented by particular implementation of CacheAttributesManager.\n * Consider using `loadDiff().actual` for getting actual values.\n */"} {"signature":"fun writeVersion ( values : Attrs ? = expected )","body":"fun writeVersion ( values : Attrs ? = expected )","docstring":"/**\n * Write [values] as cache attributes for next build execution.\n */"} {"signature":"fun isCompatible ( actual : Attrs , expected : Attrs ) : Boolean","body":"= actual == expected","docstring":"/**\n * Check if cache with [actual] attributes values can be used when [expected] attributes are required.\n */"} {"signature":"fun FirEnumEntry . hasBody ( ) : Boolean ?","body":"fun FirEnumEntry . hasBody ( ) : Boolean ?","docstring":"/**\n * Returns whether this [FirEnumEntry] has a body in source, or `null` if the entry does not have a source.\n *\n * Returns `false` if entry has a constructor call, but doesn't have a body:\n * ```kotlin\n * enum class E(i: Int) { FOO(42) }\n * ```\n *\n * We have to go down to source level, since this cannot be checked only by FIR element. This is because in FIR all enum entries\n * with constructor calls have a fake [FirEnumEntry.initializer] with an anonymous object, regardless of whether the entry had\n * body originally.\n */"} {"signature":"fun FirEnumEntry . hasInitializer ( ) : Boolean ?","body":"fun FirEnumEntry . hasInitializer ( ) : Boolean ?","docstring":"/**\n * Returns whether this [FirEnumEntry] has an initializer in source, or `null` if the entry does not have a source.\n *\n * Reason of implementing this in [SourceNavigator] and not in FIR is same as in [hasBody] method.\n */"} {"signature":"@ Throws ( IOException :: class ) public fun instrument ( originalClass : InputStream , debugName : String ) : ByteArray","body":"@ Throws ( IOException :: class ) public fun instrument ( originalClass : InputStream , debugName : String ) : ByteArray","docstring":"/**\n * Modify byte code of single class-file to measure the coverage of this class.\n *\n * @param originalClass input stream with byte code of original class-file\n * @param debugName name of the class or class-file, which is used in the error message\n * @return instrumented byte code\n * @throws IOException in case of any instrumentation error\n */"} {"signature":"fun vgg ( )","body":"{ val preprocessing = pipeline < BufferedImage > ( ) . 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, starting from Cifar'10 dataset image files, using [vgg11] model.\n *\n * It includes:\n * - dataset loading from S3\n * - dataset splitting\n * - model compilation\n * - model training\n * - model evaluation\n */"} {"signature":"fun main ( ) : Unit","body":"= vgg ( )","docstring":"/** */"} {"signature":"private fun fillLookupStorage ( projectRoot : File , reverseFiles : Boolean , reverseLookups : Boolean , storeFullFqNames : Boolean = false )","body":"{ val storageRoot = projectRoot . storageRoot val fileToPathConverter = RelativeFileToPathConverter ( projectRoot ) val icContext = IncrementalCompilationContext ( pathConverterForSourceFiles = fileToPathConverter , storeFullFqNamesInLookupCache = storeFullFqNames , ) val lookupStorage = LookupStorage ( storageRoot , icContext ) val files = LinkedHashSet < String > ( ) val symbols = LinkedHashSet < LookupSymbol > ( ) val lookups = MultiMap . createOrderedSet < LookupSymbol , String > ( ) for ( i in .. ) { val newSymbol = LookupSymbol ( name = \"\" , scope = \"\" ) val newSourcePath = projectRoot . resolve ( \"\" ) . canonicalFile . invariantSeparatorsPath symbols . add ( newSymbol ) for ( lookedUpSymbol in symbols ) { lookups . putValue ( lookedUpSymbol , newSourcePath ) } files . add ( newSourcePath ) } val filesToAdd = if ( reverseFiles ) files . reversedSet ( ) else files val lookupsToAdd = if ( reverseLookups ) lookups . reversedMultiMap ( ) else lookups lookupStorage . addAll ( lookupsToAdd , filesToAdd ) lookupStorage . flush ( ) }","docstring":"/**\n * Fills lookup storage in [projectRoot] with N fq-names,\n * where i_th fq-name myscope_i.MyClass_i has lookups for previous fq-names (from 0 to i-1)\n */"} {"signature":"fun getter ( container : Object ) : Field ?","body":"fun getter ( container : Object ) : Field ?","docstring":"/**\n * The value of the field in the given object, or `null` if the field is not set.\n */"} {"signature":"fun getterNotNull ( container : Object ) : Field","body":"= getter ( container ) ? : throw IllegalStateException ( \"\" )","docstring":"/**\n * Function that returns the value of the field in the given object,\n * or throws [IllegalStateException] if the field is not set.\n *\n * This function is used to access fields during formatting.\n */"} {"signature":"fun isZero ( obj : Target ) : Boolean","body":"fun isZero ( obj : Target ) : Boolean","docstring":"/**\n * A check for whether the current value of the field is zero.\n */"} {"signature":"fun reifyInstructions ( node : MethodNode ) : ReifiedTypeParametersUsages","body":"{ if ( ! hasReifiedParameters ) return ReifiedTypeParametersUsages ( ) val instructions = node . instructions maxStackSize = val result = ReifiedTypeParametersUsages ( ) for ( insn in instructions . toArray ( ) ) { if ( isOperationReifiedMarker ( insn ) ) { val newNames = processReifyMarker ( insn as MethodInsnNode , instructions ) if ( newNames != null ) { result . mergeAll ( newNames ) } } } node . maxStack = node . maxStack + maxStackSize return result }","docstring":"/**\n * @return set of type parameters' identifiers contained in markers that should be reified further\n * e.g. when we're generating inline function containing reified T\n * and another function containing reifiable parts is inlined into that function\n */"} {"signature":"private fun isPluginNext ( insn : AbstractInsnNode ) : Boolean","body":"{ val magicInsn = insn . next ? . next ? . next ? : return false return magicInsn is MethodInsnNode && magicInsn . opcode == Opcodes . INVOKESTATIC && magicInsn . owner == pluginIntrinsicsMarkerOwner && magicInsn . name == pluginIntrinsicsMarkerMethod && magicInsn . desc == pluginIntrinsicsMarkerSignature && magicInsn . previous is LdcInsnNode }","docstring":"/** insn: INVOKESTATIC reifiedOperationMarker\n * insn.next: operation to be reified\n * insn.next.next: ldc(pluginMarker)\n * insn.next.next.next: INVOKESTATIC voidMagicApiCall\n */"} {"signature":"protected open fun superTypeToSymbols ( typeRef : FirTypeRef ) : Collection < FirClassifierSymbol < * > >","body":"{ return listOfNotNull ( typeRef . coneType . toSymbol ( session ) ) }","docstring":"/**\n * @return symbols which should be resolved to [FirResolvePhase.STATUS] phase\n */"} {"signature":"fun createValidityTracker ( ) : ModificationTracker","body":"= LLFirSessionValidityModificationTracker ( WeakReference ( this ) )","docstring":"/**\n * Creates a [ModificationTracker] which tracks the validity of this session via [isValid].\n */"} {"signature":"fun requestDisposable ( ) : Disposable","body":"= lazyDisposable . value","docstring":"/**\n * Returns an already registered [Disposable] which is alive until the session is invalidated. It can be used as a parent disposable for\n * disposable session components, such as [resolve extensions][org.jetbrains.kotlin.analysis.api.resolve.extensions.KtResolveExtension].\n * When the session is invalidated or garbage-collected, all disposable session components will be disposed with this parent disposable.\n *\n * Because not all sessions have disposable components, this disposable is created and registered on-demand with the first call to\n * [requestDisposable]. This avoids polluting [Disposer] with unneeded disposables.\n *\n * The disposable must only be requested during session creation, before the session is added to [LLFirSessionCache].\n */"} {"signature":"fun < T > Collection < T > . bfs ( getNeighbors : ( T ) -> Iterator < T > ) : Sequence < T >","body":"{ val queue = ArrayDeque ( this ) val visited = mutableSetOf < T > ( ) return sequence { while ( queue . isNotEmpty ( ) ) { val current = queue . removeFirst ( ) if ( current in visited ) continue visited . add ( current ) yield ( current ) getNeighbors ( current ) . forEach ( queue :: add ) } } }","docstring":"/**\n * Perform BFS on the given collection with neighbors created by the given function.\n */"} {"signature":"fun x ( )","body":"{ }","docstring":"/**\n * [kotlin.collections.ArrayList]\n */"} {"signature":"fun TestDokkaConfiguration . toDokkaConfiguration ( projectDir : File ) : DokkaConfiguration","body":"{ require ( projectDir . exists ( ) && projectDir . isDirectory ) { \"\" } val moduleName = this . moduleName val includes = this . includes . mapToSet { it . relativeTo ( projectDir ) } val sourceSets = this . sourceSets . map { it . toDokkaSourceSet ( projectDir ) } return object : DokkaConfiguration { override val moduleName : String get ( ) = moduleName override val includes : Set < File > get ( ) = includes override val sourceSets : List < DokkaConfiguration . DokkaSourceSet > get ( ) = sourceSets override val pluginsClasspath : List < File > get ( ) = emptyList ( ) override val pluginsConfiguration : List < DokkaConfiguration . PluginConfiguration > get ( ) = emptyList ( ) override val moduleVersion : String get ( ) = throw NotImplementedError ( \"\" ) override val outputDir : File get ( ) = throw NotImplementedError ( \"\" ) override val cacheRoot : File get ( ) = throw NotImplementedError ( \"\" ) override val offlineMode : Boolean get ( ) = throw NotImplementedError ( \"\" ) override val failOnWarning : Boolean get ( ) = throw NotImplementedError ( \"\" ) override val modules : List < DokkaConfiguration . DokkaModuleDescription > get ( ) = throw NotImplementedError ( \"\" ) override val delayTemplateSubstitution : Boolean get ( ) = throw NotImplementedError ( \"\" ) override val suppressObviousFunctions : Boolean get ( ) = throw NotImplementedError ( \"\" ) override val suppressInheritedMembers : Boolean get ( ) = throw NotImplementedError ( \"\" ) override val finalizeCoroutines : Boolean get ( ) = throw NotImplementedError ( \"\" ) } }","docstring":"/**\n * Maps [TestDokkaConfiguration] to the actual [DokkaConfiguration] that will\n * be used to run Dokka; The resulting configuration must be valid from Dokka's perspective.\n *\n * @receiver test configuration to map to the real one; all file paths must be relative to the\n * root of the project.\n * @param projectDir the actual project directory that will be used to create test files in;\n * the path must be absolute and must exist.\n */"} {"signature":"@ Test fun createZeroFilledByteArray ( )","body":"{ val dim1 = val dim2 = val dim3 = val dim4 = val dim5 = val a = mk . zeros < Byte > ( dim1 , dim2 , dim3 , dim4 , dim5 ) assertEquals ( dim1 * dim2 * dim3 * dim4 * dim5 , a . size ) assertEquals ( dim1 * dim2 * dim3 * dim4 * dim5 , a . data . size ) assertTrue { a . all { it == . toByte ( ) } } }","docstring":"/**\n * This method checks if a byte array of a given size is correctly created with all elements set to zero.\n */"} {"signature":"@ Test fun createByteArrayFilledWithOnes ( )","body":"{ val dim1 = val dim2 = val dim3 = val dim4 = val dim5 = val a = mk . ones < Byte > ( dim1 , dim2 , dim3 , dim4 , dim5 ) assertEquals ( dim1 * dim2 * dim3 * dim4 * dim5 , a . size ) assertEquals ( dim1 * dim2 * dim3 * dim4 * dim5 , a . data . size ) assertTrue { a . all { it == . toByte ( ) } } }","docstring":"/**\n * Creates a byte array filled with ones of a given size and checks if all elements are set to one.\n */"} {"signature":"@ Test fun createNDimensionalArrayFromByteSet ( )","body":"{ val set = ( .. ) . map { it . toByte ( ) } . toSet ( ) val shape = intArrayOf ( , , , , ) val a = mk . ndarray < Byte , DN > ( set , shape = shape ) assertEquals ( set . size , a . size ) assertEquals ( set , a . toSet ( ) ) }","docstring":"/**\n * Creates an n-dimensional array from a set of bytes\n * and checks if the array's set representation matches the input set.\n */"} {"signature":"@ Test fun createNDimensionalArrayFromPrimitiveByteArray ( )","body":"{ val array = ByteArray ( ) { random . nextInt ( ) . toByte ( ) } val a = mk . ndarray ( array , , , , , ) assertEquals ( array . size , a . size ) a . data . getByteArray ( ) shouldBe array }","docstring":"/**\n * Creates an n-dimensional array from a primitive ByteArray\n * and checks if the array's ByteArray representation matches the input ByteArray.\n */"} {"signature":"@ Test @ Ignore fun createByteNDArrayWithInitializationFunctionWith4D ( )","body":"{ val a = mk . dnarray < Byte > ( , , , ) { ( it + ) . toByte ( ) } val expected = byteArrayOf ( , , , , , , , , , , , ) assertEquals ( expected . size , a . size ) a . data . getByteArray ( ) shouldBe expected }","docstring":"/**\n * Creates an n-dimensional array with a given size using an initialization function\n * and checks if the array's ByteArray representation matches the expected output.\n */"} {"signature":"@ Test fun createByteNDArrayWithInitializationFunctionWith5D ( )","body":"{ val a = mk . dnarray < Byte > ( , , , , ) { ( it + ) . toByte ( ) } val expected = byteArrayOf ( , , , , , , , , , , , , , , , ) assertEquals ( expected . size , a . size ) a . data . getByteArray ( ) shouldBe expected }","docstring":"/**\n * Creates an n-dimensional array with a given size using an initialization function\n * and checks if the array's ByteArray representation matches the expected output.\n */"} {"signature":"@ Test fun createZeroFilledShortArray ( )","body":"{ val dim1 = val dim2 = val dim3 = val dim4 = val dim5 = val a = mk . zeros < Short > ( dim1 , dim2 , dim3 , dim4 , dim5 ) assertEquals ( dim1 * dim2 * dim3 * dim4 * dim5 , a . size ) assertEquals ( dim1 * dim2 * dim3 * dim4 * dim5 , a . data . size ) assertTrue { a . all { it == . toShort ( ) } } }","docstring":"/**\n * This method checks if a short array of a given size is correctly created with all elements set to zero.\n */"} {"signature":"@ Test fun createShortArrayFilledWithOnes ( )","body":"{ val dim1 = val dim2 = val dim3 = val dim4 = val dim5 = val a = mk . ones < Short > ( dim1 , dim2 , dim3 , dim4 , dim5 ) assertEquals ( dim1 * dim2 * dim3 * dim4 * dim5 , a . size ) assertEquals ( dim1 * dim2 * dim3 * dim4 * dim5 , a . data . size ) assertTrue { a . all { it == . toShort ( ) } } }","docstring":"/**\n * Creates a short array filled with ones of a given size and checks if all elements are set to one.\n */"} {"signature":"@ Test @ Ignore fun createNDimensionalArrayFromShortSet ( )","body":"{ val set = ( .. ) . map { it . toShort ( ) } . toSet ( ) val shape = intArrayOf ( , , , , ) val a = mk . ndarray < Short , DN > ( set , shape = shape ) assertEquals ( set . size , a . size ) assertEquals ( set , a . toSet ( ) ) }","docstring":"/**\n * Creates an n-dimensional array from a set of shorts\n * and checks if the array's set representation matches the input set.\n */"} {"signature":"@ Test fun createNDimensionalArrayFromPrimitiveShortArray ( )","body":"{ val array = ShortArray ( ) { random . nextInt ( ) . toShort ( ) } val a = mk . ndarray ( array , , , , , ) assertEquals ( array . size , a . size ) a . data . getShortArray ( ) shouldBe array }","docstring":"/**\n * Creates an n-dimensional array from a primitive ShortArray\n * and checks if the array's ShortArray representation matches the input ShortArray.\n */"} {"signature":"@ Test fun createShortNDArrayWithInitializationFunctionWith4D ( )","body":"{ val a = mk . d4array < Short > ( , , , ) { ( it + ) . toShort ( ) } val expected = shortArrayOf ( , , , , , , , , , , , ) assertEquals ( expected . size , a . size ) a . data . getShortArray ( ) shouldBe expected }","docstring":"/**\n * Creates an n-dimensional array with a given size using an initialization function\n * and checks if the array's ShortArray representation matches the expected output.\n */"} {"signature":"@ Test fun createShortNDArrayWithInitializationFunctionWith5D ( )","body":"{ val a = mk . dnarray < Short > ( , , , , ) { ( it + ) . toShort ( ) } val expected = shortArrayOf ( , , , , , , , , , , , , , , , ) assertEquals ( expected . size , a . size ) a . data . getShortArray ( ) shouldBe expected }","docstring":"/**\n * Creates an n-dimensional array with a given size using an initialization function\n * and checks if the array's ShortArray representation matches the expected output.\n */"} {"signature":"@ Test fun createZeroFilledIntArray ( )","body":"{ val dim1 = val dim2 = val dim3 = val dim4 = val dim5 = val a = mk . zeros < Int > ( dim1 , dim2 , dim3 , dim4 , dim5 ) assertEquals ( dim1 * dim2 * dim3 * dim4 * dim5 , a . size ) assertEquals ( dim1 * dim2 * dim3 * dim4 * dim5 , a . data . size ) assertTrue { a . all { it == } } }","docstring":"/**\n * This method checks if an integer array of a given size is correctly created with all elements set to zero.\n */"} {"signature":"@ Test fun createIntArrayFilledWithOnes ( )","body":"{ val dim1 = val dim2 = val dim3 = val dim4 = val dim5 = val a = mk . ones < Int > ( dim1 , dim2 , dim3 , dim4 , dim5 ) assertEquals ( dim1 * dim2 * dim3 * dim4 * dim5 , a . size ) assertEquals ( dim1 * dim2 * dim3 * dim4 * dim5 , a . data . size ) assertTrue { a . all { it == } } }","docstring":"/**\n * Creates an integer array filled with ones of a given size and checks if all elements are set to one.\n */"} {"signature":"@ Test fun createNDimensionalArrayFromIntSet ( )","body":"{ val set = ( .. ) . toSet ( ) val shape = intArrayOf ( , , , , ) val a = mk . ndarray < Int , DN > ( set , shape = shape ) assertEquals ( set . size , a . size ) assertEquals ( set , a . toSet ( ) ) }","docstring":"/**\n * Creates an n-dimensional array from a set of integers\n * and checks if the array's set representation matches the input set.\n */"} {"signature":"@ Test fun createNDimensionalArrayFromPrimitiveIntArray ( )","body":"{ val array = IntArray ( ) { random . nextInt ( ) } val a = mk . ndarray ( array , , , , , ) assertEquals ( array . size , a . size ) a . data . getIntArray ( ) shouldBe array }","docstring":"/**\n * Creates an n-dimensional array from a primitive IntArray\n * and checks if the array's IntArray representation matches the input IntArray.\n */"} {"signature":"@ Test @ Ignore fun createIntNDArrayWithInitializationFunctionWith4D ( )","body":"{ val a = mk . dnarray < Int > ( , , , ) { ( it + ) } val expected = intArrayOf ( , , , , , , , , , , , ) assertEquals ( expected . size , a . size ) a . data . getIntArray ( ) shouldBe expected }","docstring":"/**\n * Creates an n-dimensional array with a given size using an initialization function\n * and checks if the array's IntArray representation matches the expected output.\n */"} {"signature":"@ Test fun createIntNDArrayWithInitializationFunctionWith5D ( )","body":"{ val a = mk . dnarray < Int > ( , , , , ) { it + } val expected = intArrayOf ( , , , , , , , , , , , , , , , ) assertEquals ( expected . size , a . size ) a . data . getIntArray ( ) shouldBe expected }","docstring":"/**\n * Creates an n-dimensional array with a given size using an initialization function\n * and checks if the array's IntArray representation matches the expected output.\n */"} {"signature":"@ Test fun createZeroFilledLongArray ( )","body":"{ val dim1 = val dim2 = val dim3 = val dim4 = val dim5 = val a = mk . zeros < Long > ( dim1 , dim2 , dim3 , dim4 , dim5 ) assertEquals ( dim1 * dim2 * dim3 * dim4 * dim5 , a . size ) assertEquals ( dim1 * dim2 * dim3 * dim4 * dim5 , a . data . size ) assertTrue { a . all { it == } } }","docstring":"/**\n * This method checks if a long array of a given size is correctly created with all elements set to zero.\n */"} {"signature":"@ Test fun createLongArrayFilledWithOnes ( )","body":"{ val dim1 = val dim2 = val dim3 = val dim4 = val dim5 = val a = mk . ones < Long > ( dim1 , dim2 , dim3 , dim4 , dim5 ) assertEquals ( dim1 * dim2 * dim3 * dim4 * dim5 , a . size ) assertEquals ( dim1 * dim2 * dim3 * dim4 * dim5 , a . data . size ) assertTrue { a . all { it == } } }","docstring":"/**\n * Creates a long array filled with ones of a given size and checks if all elements are set to one.\n */"} {"signature":"@ Test fun createNDimensionalArrayFromLongSet ( )","body":"{ val set = ( .. ) . map { it . toLong ( ) } . toSet ( ) val shape = intArrayOf ( , , , , ) val a = mk . ndarray < Long , DN > ( set , shape = shape ) assertEquals ( set . size , a . size ) assertEquals ( set , a . toSet ( ) ) }","docstring":"/**\n * Creates an n-dimensional array from a set of longs\n * and checks if the array's set representation matches the input set.\n */"} {"signature":"@ Test fun createNDimensionalArrayFromPrimitiveLongArray ( )","body":"{ val array = LongArray ( ) { random . nextLong ( ) } val a = mk . ndarray ( array , , , , , ) assertEquals ( array . size , a . size ) a . data . getLongArray ( ) shouldBe array }","docstring":"/**\n * Creates an n-dimensional array from a primitive LongArray\n * and checks if the array's LongArray representation matches the input LongArray.\n */"} {"signature":"@ Test @ Ignore fun createLongNDArrayWithInitializationFunctionWith4D ( )","body":"{ val a = mk . dnarray < Long > ( , , , ) { it + } val expected = longArrayOf ( , , , , , , , , , , , ) assertEquals ( expected . size , a . size ) a . data . getLongArray ( ) shouldBe expected }","docstring":"/**\n * Creates an n-dimensional array with a given size using an initialization function\n * and checks if the array's LongArray representation matches the expected output.\n */"} {"signature":"@ Test fun createLongNDArrayWithInitializationFunctionWith5D ( )","body":"{ val a = mk . dnarray < Long > ( , , , , ) { it + } val expected = longArrayOf ( , , , , , , , , , , , , , , , ) assertEquals ( expected . size , a . size ) a . data . getLongArray ( ) shouldBe expected }","docstring":"/**\n * Creates an n-dimensional array with a given size using an initialization function\n * and checks if the array's LongArray representation matches the expected output.\n */"} {"signature":"@ Test fun createZeroFilledFloatArray ( )","body":"{ val dim1 = val dim2 = val dim3 = val dim4 = val dim5 = val a = mk . zeros < Float > ( dim1 , dim2 , dim3 , dim4 , dim5 ) assertEquals ( dim1 * dim2 * dim3 * dim4 * dim5 , a . size ) assertEquals ( dim1 * dim2 * dim3 * dim4 * dim5 , a . data . size ) assertTrue { a . all { it == } } }","docstring":"/**\n * This method checks if a float array of a given size is correctly created with all elements set to zero.\n */"} {"signature":"@ Test fun createFloatArrayFilledWithOnes ( )","body":"{ val dim1 = val dim2 = val dim3 = val dim4 = val dim5 = val a = mk . ones < Float > ( dim1 , dim2 , dim3 , dim4 , dim5 ) assertEquals ( dim1 * dim2 * dim3 * dim4 * dim5 , a . size ) assertEquals ( dim1 * dim2 * dim3 * dim4 * dim5 , a . data . size ) assertTrue { a . all { it == } } }","docstring":"/**\n * Creates a float array filled with ones of a given size and checks if all elements are set to one.\n */"} {"signature":"@ Test fun createNDimensionalArrayFromFloatSet ( )","body":"{ val set = ( .. ) . map { it . toFloat ( ) } . toSet ( ) val shape = intArrayOf ( , , , , ) val a = mk . ndarray < Float , DN > ( set , shape = shape ) assertEquals ( set . size , a . size ) assertEquals ( set , a . toSet ( ) ) }","docstring":"/**\n * Creates an n-dimensional array from a set of floats\n * and checks if the array's set representation matches the input set.\n */"} {"signature":"@ Test fun createNDimensionalArrayFromPrimitiveFloatArray ( )","body":"{ val array = FloatArray ( ) { random . nextFloat ( ) } val a = mk . ndarray ( array , , , , , ) assertEquals ( array . size , a . size ) a . data . getFloatArray ( ) shouldBe array }","docstring":"/**\n * Creates an n-dimensional array from a primitive FloatArray\n * and checks if the array's FloatArray representation matches the input FloatArray.\n */"} {"signature":"@ Test @ Ignore fun createFloatNDArrayWithInitializationFunctionWith4D ( )","body":"{ val a = mk . dnarray < Float > ( , , , ) { it + } val expected = floatArrayOf ( , , , , , , , , , , , ) assertEquals ( expected . size , a . size ) a . data . getFloatArray ( ) shouldBe expected }","docstring":"/**\n * Creates an n-dimensional array with a given size using an initialization function\n * and checks if the array's FloatArray representation matches the expected output.\n */"} {"signature":"@ Test fun createFloatNDArrayWithInitializationFunctionWith5D ( )","body":"{ val a = mk . dnarray < Float > ( , , , , ) { it + } val expected = floatArrayOf ( , , , , , , , , , , , , , , , ) assertEquals ( expected . size , a . size ) a . data . getFloatArray ( ) shouldBe expected }","docstring":"/**\n * Creates an n-dimensional array with a given size using an initialization function\n * and checks if the array's FloatArray representation matches the expected output.\n */"} {"signature":"@ Test fun createZeroFilledDoubleArray ( )","body":"{ val dim1 = val dim2 = val dim3 = val dim4 = val dim5 = val a = mk . zeros < Double > ( dim1 , dim2 , dim3 , dim4 , dim5 ) assertEquals ( dim1 * dim2 * dim3 * dim4 * dim5 , a . size ) assertEquals ( dim1 * dim2 * dim3 * dim4 * dim5 , a . data . size ) assertTrue { a . all { it == } } }","docstring":"/**\n * This method checks if a double array of a given size is correctly created with all elements set to zero.\n */"} {"signature":"@ Test fun createDoubleArrayFilledWithOnes ( )","body":"{ val dim1 = val dim2 = val dim3 = val dim4 = val dim5 = val a = mk . ones < Double > ( dim1 , dim2 , dim3 , dim4 , dim5 ) assertEquals ( dim1 * dim2 * dim3 * dim4 * dim5 , a . size ) assertEquals ( dim1 * dim2 * dim3 * dim4 * dim5 , a . data . size ) assertTrue { a . all { it == } } }","docstring":"/**\n * Creates a double array filled with ones of a given size and checks if all elements are set to one.\n */"} {"signature":"@ Test fun createNDimensionalArrayFromDoubleSet ( )","body":"{ val set = ( .. ) . map { it . toDouble ( ) } . toSet ( ) val shape = intArrayOf ( , , , , ) val a = mk . ndarray < Double , DN > ( set , shape = shape ) assertEquals ( set . size , a . size ) assertEquals ( set , a . toSet ( ) ) }","docstring":"/**\n * Creates an n-dimensional array from a set of doubles\n * and checks if the array's set representation matches the input set.\n */"} {"signature":"@ Test fun createNDimensionalArrayFromPrimitiveDoubleArray ( )","body":"{ val array = DoubleArray ( ) { random . nextDouble ( ) } val a = mk . ndarray ( array , , , , , ) assertEquals ( array . size , a . size ) a . data . getDoubleArray ( ) shouldBe array }","docstring":"/**\n * Creates an n-dimensional array from a primitive DoubleArray\n * and checks if the array's DoubleArray representation matches the input DoubleArray.\n */"} {"signature":"@ Test @ Ignore fun createDoubleNDArrayWithInitializationFunctionWith4D ( )","body":"{ val a = mk . dnarray < Double > ( , , , ) { it + } val expected = doubleArrayOf ( , , , , , , , , , , , ) assertEquals ( expected . size , a . size ) a . data . getDoubleArray ( ) shouldBe expected }","docstring":"/**\n * Creates an n-dimensional array with a given size using an initialization function\n * and checks if the array's DoubleArray representation matches the expected output.\n */"} {"signature":"@ Test fun createDoubleNDArrayWithInitializationFunctionWith5D ( )","body":"{ val a = mk . dnarray < Double > ( , , , , ) { it + } val expected = doubleArrayOf ( , , , , , , , , , , , , , , , ) assertEquals ( expected . size , a . size ) a . data . getDoubleArray ( ) shouldBe expected }","docstring":"/**\n * Creates an n-dimensional array with a given size using an initialization function\n * and checks if the array's DoubleArray representation matches the expected output.\n */"} {"signature":"@ Test fun createZeroFilledComplexFloatArray ( )","body":"{ val dim1 = val dim2 = val dim3 = val dim4 = val dim5 = val a = mk . zeros < ComplexFloat > ( dim1 , dim2 , dim3 , dim4 , dim5 ) assertEquals ( dim1 * dim2 * dim3 * dim4 * dim5 , a . size ) assertEquals ( dim1 * dim2 * dim3 * dim4 * dim5 , a . data . size ) assertTrue { a . all { it == ComplexFloat . zero } } }","docstring":"/**\n * This method checks if a ComplexFloat array of a given size is correctly created with all elements set to zero.\n */"} {"signature":"@ Test fun createComplexFloatArrayFilledWithOnes ( )","body":"{ val dim1 = val dim2 = val dim3 = val dim4 = val dim5 = val a = mk . ones < ComplexFloat > ( dim1 , dim2 , dim3 , dim4 , dim5 ) assertEquals ( dim1 * dim2 * dim3 * dim4 * dim5 , a . size ) assertEquals ( dim1 * dim2 * dim3 * dim4 * dim5 , a . data . size ) assertTrue { a . all { it == ComplexFloat . one } } }","docstring":"/**\n * Creates a ComplexFloat array filled with ones of a given size and checks if all elements are set to one.\n */"} {"signature":"@ Test fun createNDimensionalArrayFromComplexFloatSet ( )","body":"{ val set = ( .. ) . map { ComplexFloat ( it , it + ) } . toSet ( ) val shape = intArrayOf ( , , , , ) val a = mk . ndarray < ComplexFloat , DN > ( set , shape = shape ) assertEquals ( set . size , a . size ) assertEquals ( set , a . toSet ( ) ) }","docstring":"/**\n * Creates an n-dimensional array from a set of complex floats\n * and checks if the array's set representation matches the input set.\n */"} {"signature":"@ Test fun createNDimensionalArrayFromPrimitiveComplexFloatArray ( )","body":"{ val array = ComplexFloatArray ( ) { ComplexFloat ( random . nextFloat ( ) , random . nextFloat ( ) ) } val a = mk . ndarray ( array , , , , , ) assertEquals ( array . size , a . size ) a . data . getComplexFloatArray ( ) shouldBe array }","docstring":"/**\n * Creates an n-dimensional array from a primitive ComplexFloatArray\n * and checks if the array's ComplexFloatArray representation matches the input ComplexFloatArray.\n */"} {"signature":"@ Test @ Ignore fun createComplexFloatNDArrayWithInitializationFunctionWith4D ( )","body":"{ val a = mk . dnarray < ComplexFloat > ( , , , ) { ComplexFloat ( it + , round ( ( it - ) * ) / ) } val expected = complexFloatArrayOf ( - . i , + . i , + . i , + . i , + . i , + . i , + . i , + . i , + . i , + . i , + . i , + . i ) assertEquals ( expected . size , a . size ) a . data . getComplexFloatArray ( ) shouldBe expected }","docstring":"/**\n * Creates an n-dimensional array with a given size using an initialization function\n * and checks if the array's ComplexFloatArray representation matches the expected output.\n */"} {"signature":"@ Test fun createComplexFloatNDArrayWithInitializationFunctionWith5D ( )","body":"{ val a = mk . dnarray < ComplexFloat > ( , , , , ) { ComplexFloat ( it + , round ( ( it - ) * ) / ) } val expected = complexFloatArrayOf ( - . i , + . i , + . i , + . i , + . i , + . i , + . i , + . i , + . i , + . i , + . i , + . i , + . i , + . i , + . i , + . i ) assertEquals ( expected . size , a . size ) a . data . getComplexFloatArray ( ) shouldBe expected }","docstring":"/**\n * Creates an n-dimensional array with a given size using an initialization function\n * and checks if the array's ComplexFloatArray representation matches the expected output.\n */"} {"signature":"@ Test fun createZeroFilledComplexDoubleArray ( )","body":"{ val dim1 = val dim2 = val dim3 = val dim4 = val dim5 = val a = mk . zeros < ComplexDouble > ( dim1 , dim2 , dim3 , dim4 , dim5 ) assertEquals ( dim1 * dim2 * dim3 * dim4 * dim5 , a . size ) assertEquals ( dim1 * dim2 * dim3 * dim4 * dim5 , a . data . size ) assertTrue { a . all { it == ComplexDouble . zero } } }","docstring":"/**\n * This method checks if a ComplexDouble array of a given size is correctly created with all elements set to zero.\n */"} {"signature":"@ Test fun createComplexDoubleArrayFilledWithOnes ( )","body":"{ val dim1 = val dim2 = val dim3 = val dim4 = val dim5 = val a = mk . ones < ComplexDouble > ( dim1 , dim2 , dim3 , dim4 , dim5 ) assertEquals ( dim1 * dim2 * dim3 * dim4 * dim5 , a . size ) assertEquals ( dim1 * dim2 * dim3 * dim4 * dim5 , a . data . size ) assertTrue { a . all { it == ComplexDouble . one } } }","docstring":"/**\n * Creates a ComplexDouble array filled with ones of a given size and checks if all elements are set to one.\n */"} {"signature":"@ Test fun createNDimensionalArrayFromComplexDoubleSet ( )","body":"{ val set = ( .. ) . map { ComplexDouble ( it , it + ) } . toSet ( ) val shape = intArrayOf ( , , , , ) val a = mk . ndarray < ComplexDouble , DN > ( set , shape = shape ) assertEquals ( set . size , a . size ) assertEquals ( set , a . toSet ( ) ) }","docstring":"/**\n * Creates an n-dimensional array from a set of complex doubles\n * and checks if the array's set representation matches the input set.\n */"} {"signature":"@ Test fun createNDimensionalArrayFromPrimitiveComplexDoubleArray ( )","body":"{ val array = ComplexDoubleArray ( ) { ComplexDouble ( random . nextDouble ( ) , random . nextDouble ( ) ) } val a = mk . ndarray ( array , , , , , ) assertEquals ( array . size , a . size ) a . data . getComplexDoubleArray ( ) shouldBe array }","docstring":"/**\n * Creates an n-dimensional array from a primitive ComplexDoubleArray\n * and checks if the array's ComplexDoubleArray representation matches the input ComplexDoubleArray.\n */"} {"signature":"@ Test @ Ignore fun createComplexDoubleNDArrayWithInitializationFunctionWith4D ( )","body":"{ val a = mk . dnarray < ComplexDouble > ( , , , ) { ComplexDouble ( it + , round ( ( it - ) * ) / ) } val expected = complexDoubleArrayOf ( - . i , + . i , + . i , + . i , + . i , + . i , + . i , + . i , + . i , + . i , + . i , + . i ) assertEquals ( expected . size , a . size ) a . data . getComplexDoubleArray ( ) shouldBe expected }","docstring":"/**\n * Creates an n-dimensional array with a given size using an initialization function\n * and checks if the array's ComplexDoubleArray representation matches the expected output.\n */"} {"signature":"@ Test fun createComplexDoubleNDArrayWithInitializationFunctionWith5D ( )","body":"{ val a = mk . dnarray < ComplexDouble > ( , , , , ) { ComplexDouble ( it + , round ( ( it - ) * ) / ) } val expected = complexDoubleArrayOf ( - . i , + . i , + . i , + . i , + . i , + . i , + . i , + . i , + . i , + . i , + . i , + . i , + . i , + . i , + . i , + . i ) assertEquals ( expected . size , a . size ) a . data . getComplexDoubleArray ( ) shouldBe expected }","docstring":"/**\n * Creates an n-dimensional array with a given size using an initialization function\n * and checks if the array's ComplexDoubleArray representation matches the expected output.\n */"} {"signature":"public inline fun LayerCollectorContext . boxes ( block : BoxesContext . ( ) -> Unit )","body":"{ addLayer ( BoxesContext ( this ) . apply { position = Position . dodge ( ) } . apply ( block ) ) }","docstring":"/**\n * Adds a new `boxes` layer to the plot.\n *\n * The `boxes` layer is responsible for constructing a boxplot representation,\n * which visualizes the distribution of a dataset by depicting its quartiles\n * and thereby provides insights into the data's spread and potential skewness.\n *\n * This function creates a context where you can set aesthetic mappings (`aes`) or aesthetic constants.\n * - Mappings are specified by calling methods that correspond to aesthetic names (`aes`).\n * - Constants are directly assigned using properties with the names corresponding to aesthetics.\n * For positional aesthetics, you can use the `.constant()` method.\n *\n * ## Boxes Aesthetics\n * * **`x`** - The X-coordinate specifying the categories.\n * * **`yMin`** - The minimum value for the Y-coordinate (the lowest whisker).\n * * **`lower`** - The lower quartile value.\n * * **`middle`** - The median value.\n * * **`upper`** - The upper quartile value.\n * * **`yMax`** - The maximum value for the Y-coordinate (the highest whisker).\n * * **`fillColor`** - The fill color of the boxes.\n * * **`alpha`** - The transparency of the boxes.\n * * **`width`** - The width of the boxes.\n * * **`fatten`** - The factor by which to \"fatten\" the width of the notch relative to the body.\n * * **`borderLine.color`** - Color of the boxes borderline.\n * * **`borderLine.width`** - Width of the boxes borderline.\n * * **`borderLine.type`** - Type of the boxes borderline, such as dashed or dotted.\n *\n * ## Example\n *\n * ```kotlin\n * plot {\n * boxes {\n * // Positional mapping\n * x(listOf(\"A\", \"B\", \"C\", \"D\"))\n * yMin(listOf(10, 20, 5, 12))\n * lower(listOf(20, 30, 12, 22))\n * middle(listOf(30, 40, 20, 35))\n * upper(listOf(40, 50, 35, 45))\n * yMax(listOf(50, 55, 40, 48))\n *\n * // Adjust the Y-axis\n * y.limits = 0.0..60.0\n *\n * // Non-positional settings\n * fatten = 0.8\n * width = 0.5\n *\n * // BorderLine settings\n * borderLine.width = .5\n *\n * // Non-positional mapping\n * fillColor = Color.BLUE\n * }\n * }\n * ```\n */"} {"signature":"private suspend fun Project . setupPreMultiplatformStableDefaultDependsOnEdges ( )","body":"= multiplatformExtension . targets . flatMap { target -> target . compilations } . forEach { compilation -> val sourceSetTree = KotlinSourceSetTree . orNull ( compilation ) ? : return@forEach val commonSourceSetName = lowerCamelCaseName ( \"\" , sourceSetTree . name ) val commonSourceSet = multiplatformExtension . sourceSets . findByName ( commonSourceSetName ) ? : return@forEach compilation . defaultSourceSet . dependsOn ( commonSourceSet ) }","docstring":"/**\n * Before 1.9.20 (and without any targetHierarchy applied), we just added default dependsOn\n * edges from 'main' compilations defaultSourceSets to 'commonMain' and\n * edges from 'test' compilations defaultSourceSets to 'commonTest\n */"} {"signature":"public fun detectFaces ( image : I , topK : Int = , iouThreshold : Float = ) : List < DetectedObject >","body":"{ val detectedObjects = predict ( image ) return suppressNonMaxBoxes ( detectedObjects , topK , iouThreshold ) }","docstring":"/**\n * Detects [topK] faces on the given [image]. If [topK] is negative all detected faces are returned.\n * @param [iouThreshold] threshold IoU value for the non-maximum suppression applied during postprocessing\n */"} {"signature":"public fun suppressNonMaxBoxes ( boxes : List < DetectedObject > , topK : Int = - , threshold : Float = ) : List < DetectedObject >","body":"{ val sortedBoxes = boxes . toMutableList ( ) . apply { sortByDescending { it . probability } } val result = mutableListOf < DetectedObject > ( ) while ( sortedBoxes . isNotEmpty ( ) ) { val box = sortedBoxes . removeFirst ( ) result . add ( box ) if ( topK > && result . size >= topK ) break sortedBoxes . removeIf { iou ( box , it ) >= threshold } } return result }","docstring":"/**\n * Performs non-maximum suppression to filter out boxes with the IoU greater than a threshold.\n *\n * @param [boxes] boxes to filter\n * @param [topK] how many boxes to include in the result. Negative or zero means to include everything.\n * @param [threshold] threshold IoU value\n */"} {"signature":"public fun iou ( box1 : DetectedObject , box2 : DetectedObject ) : Float","body":"{ val xMin = max ( box1 . xMin , box2 . xMin ) val yMin = max ( box1 . yMin , box2 . yMin ) val xMax = min ( box1 . xMax , box2 . xMax ) val yMax = min ( box1 . yMax , box2 . yMax ) val overlap = ( xMax - xMin ) * ( yMax - yMin ) return overlap / ( box1 . area ( ) + box2 . area ( ) - overlap + EPS ) }","docstring":"/**\n * Computes the intersection over union value for the [box1] and [box2].\n */"} {"signature":"internal fun pinCurrentThreadToIsolatedCpu ( )","body":"{ val isolatedList = System . getenv ( \"\" ) val othersList = System . getenv ( \"\" ) println ( \"\" ) if ( othersList != null ) { updateAffinityOfAllProcesses ( othersList ) } if ( isolatedList != null ) { updateCurrentThreadAffinity ( isolatedList ) } if ( othersList == null && isolatedList == null ) { println ( \"\" ) } }","docstring":"/**\n * Pins the current thread to an isolated CPU.\n *\n * This method attempts to pin the current thread to an isolated CPU if the environment variables\n * 'DOCKER_ISOLATED_CPUSET' and 'DOCKER_CPUSET' are set.\n *\n * On benchmark agents, those variables should be assigned to non-overlapping CPUSETs.\n * It allows us to reduce interference of the other processes and threads.\n *\n * Note: CPUSET is in a format compatible with 'taskset' command (e.g., \"0-3,8\")\n */"} {"signature":"private fun updateCurrentThreadAffinity ( cpuList : String )","body":"{ val selfPid = CLibrary . INSTANCE . getpid ( ) val selfTid = CLibrary . INSTANCE . gettid ( ) println ( \"\" ) ProcessBuilder ( ) . command ( \"\" , \"\" , cpuList , \"\" ) . inheritIO ( ) . start ( ) . waitFor ( ) }","docstring":"/**\n * Updates the CPU affinity of the current thread.\n */"} {"signature":"private fun updateAffinityOfAllProcesses ( cpuList : String )","body":"{ println ( \"\" ) val pidRegex = \"\" . toRegex ( ) File ( \"\" ) . listFiles ( ) ? . forEach { if ( it . resolve ( \"\" ) . exists ( ) && it . name . matches ( pidRegex ) ) { ProcessBuilder ( ) . command ( \"\" , \"\" , cpuList , it . name ) . inheritIO ( ) . start ( ) . waitFor ( ) } } }","docstring":"/**\n * Updates the affinity of all processes in the system to the specified CPU list.\n *\n * This method iterates over all processes in the system and modifies their affinity\n * to the CPUs specified in the 'cpuList' parameter.\n */"} {"signature":"fun g ( )","body":"{ }","docstring":"/**\n * [X.YY]\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalPathApi :: class ) @ Throws ( IOException :: class ) @ kotlin . internal . InlineOnly public inline fun Path . reader ( charset : Charset = Charsets . UTF_8 , vararg options : OpenOption ) : InputStreamReader","body":"{ return InputStreamReader ( Files . newInputStream ( this , * options ) , charset ) }","docstring":"/**\n * Returns a new [InputStreamReader] for reading the content of this file.\n *\n * @param charset character set to use for reading text, UTF-8 by default.\n * @param options options to determine how the file is opened.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalPathApi :: class ) @ Throws ( IOException :: class ) @ kotlin . internal . InlineOnly public inline fun Path . bufferedReader ( charset : Charset = Charsets . UTF_8 , bufferSize : Int = DEFAULT_BUFFER_SIZE , vararg options : OpenOption ) : BufferedReader","body":"{ return BufferedReader ( InputStreamReader ( Files . newInputStream ( this , * options ) , charset ) , bufferSize ) }","docstring":"/**\n * Returns a new [BufferedReader] for reading the content of this file.\n *\n * @param charset character set to use for reading text, UTF-8 by default.\n * @param bufferSize necessary size of the buffer.\n * @param options options to determine how the file is opened.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalPathApi :: class ) @ Throws ( IOException :: class ) @ kotlin . internal . InlineOnly public inline fun Path . writer ( charset : Charset = Charsets . UTF_8 , vararg options : OpenOption ) : OutputStreamWriter","body":"{ return OutputStreamWriter ( Files . newOutputStream ( this , * options ) , charset ) }","docstring":"/**\n * Returns a new [OutputStreamWriter] for writing the content of this file.\n *\n * @param charset character set to use for writing text, UTF-8 by default.\n * @param options options to determine how the file is opened.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalPathApi :: class ) @ Throws ( IOException :: class ) @ kotlin . internal . InlineOnly public inline fun Path . bufferedWriter ( charset : Charset = Charsets . UTF_8 , bufferSize : Int = DEFAULT_BUFFER_SIZE , vararg options : OpenOption ) : BufferedWriter","body":"{ return BufferedWriter ( OutputStreamWriter ( Files . newOutputStream ( this , * options ) , charset ) , bufferSize ) }","docstring":"/**\n * Returns a new [BufferedWriter] for writing the content of this file.\n *\n * @param charset character set to use for writing text, UTF-8 by default.\n * @param bufferSize necessary size of the buffer.\n * @param options options to determine how the file is opened.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalPathApi :: class ) @ Throws ( IOException :: class ) @ kotlin . internal . InlineOnly public inline fun Path . readBytes ( ) : ByteArray","body":"{ return Files . readAllBytes ( this ) }","docstring":"/**\n * Gets the entire content of this file as a byte array.\n *\n * It's not recommended to use this function on huge files.\n * It has an internal limitation of approximately 2 GB byte array size.\n * For reading large files or files of unknown size, open an [InputStream][Path.inputStream] and read blocks sequentially.\n *\n * @return the entire content of this file as a byte array.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalPathApi :: class ) @ Throws ( IOException :: class ) @ kotlin . internal . InlineOnly public inline fun Path . writeBytes ( array : ByteArray , vararg options : OpenOption ) : Unit","body":"{ Files . write ( this , array , * options ) }","docstring":"/**\n * Writes an [array] of bytes to this file.\n *\n * By default, the file will be overwritten if it already exists, but you can control this behavior\n * with [options].\n *\n * @param array byte array to write into this file.\n * @param options options to determine how the file is opened.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalPathApi :: class ) @ Throws ( IOException :: class ) @ kotlin . internal . InlineOnly public inline fun Path . appendBytes ( array : ByteArray )","body":"{ Files . write ( this , array , StandardOpenOption . APPEND ) }","docstring":"/**\n * Appends an [array] of bytes to the content of this file.\n *\n * @param array byte array to append to this file.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalPathApi :: class ) @ Throws ( IOException :: class ) public fun Path . readText ( charset : Charset = Charsets . UTF_8 ) : String","body":"= reader ( charset ) . use { it . readText ( ) }","docstring":"/**\n * Gets the entire content of this file as a String using UTF-8 or the specified [charset].\n *\n * It's not recommended to use this function on huge files.\n * For reading large files or files of unknown size, open a [Reader][Path.reader] and read blocks of text sequentially.\n *\n * @param charset character set to use for reading text, UTF-8 by default.\n * @return the entire content of this file as a String.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalPathApi :: class ) @ Throws ( IOException :: class ) public fun Path . writeText ( text : CharSequence , charset : Charset = Charsets . UTF_8 , vararg options : OpenOption )","body":"{ Files . newOutputStream ( this , * options ) . use { out -> if ( text is String ) { out . writeTextImpl ( text , charset ) return@use } val encoder = charset . newReplaceEncoder ( ) val charBuffer = if ( text is CharBuffer ) text . asReadOnlyBuffer ( ) else CharBuffer . wrap ( text ) val byteBuffer = byteBufferForEncoding ( chunkSize = minOf ( text . length , DEFAULT_BUFFER_SIZE ) , encoder ) while ( charBuffer . hasRemaining ( ) ) { encoder . encode ( charBuffer , byteBuffer , true ) . also { check ( ! it . isError ) } out . write ( byteBuffer . array ( ) , , byteBuffer . position ( ) ) byteBuffer . clear ( ) } } }","docstring":"/**\n * Sets the content of this file as [text] encoded using UTF-8 or the specified [charset].\n *\n * By default, the file will be overwritten if it already exists, but you can control this behavior\n * with [options].\n *\n * @param text text to write into file.\n * @param charset character set to use for writing text, UTF-8 by default.\n * @param options options to determine how the file is opened.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalPathApi :: class ) @ Throws ( IOException :: class ) public fun Path . appendText ( text : CharSequence , charset : Charset = Charsets . UTF_8 )","body":"{ writeText ( text , charset , StandardOpenOption . APPEND ) }","docstring":"/**\n * Appends [text] to the content of this file using UTF-8 or the specified [charset].\n *\n * @param text text to append to file.\n * @param charset character set to use for writing text, UTF-8 by default.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalPathApi :: class ) @ Throws ( IOException :: class ) @ kotlin . internal . InlineOnly public inline fun Path . forEachLine ( charset : Charset = Charsets . UTF_8 , action : ( line : String ) -> Unit ) : Unit","body":"{ Files . newBufferedReader ( this , charset ) . useLines { it . forEach ( action ) } }","docstring":"/**\n * Reads this file line by line using the specified [charset] and calls [action] for each line.\n * Default charset is UTF-8.\n *\n * You may use this function on huge files.\n *\n * @param charset character set to use for reading text, UTF-8 by default.\n * @param action function to process file lines.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalPathApi :: class ) @ Throws ( IOException :: class ) @ kotlin . internal . InlineOnly public inline fun Path . inputStream ( vararg options : OpenOption ) : InputStream","body":"{ return Files . newInputStream ( this , * options ) }","docstring":"/**\n * Constructs a new InputStream of this file and returns it as a result.\n *\n * The [options] parameter determines how the file is opened. If no options are present then it is\n * equivalent to opening the file with the [READ][StandardOpenOption.READ] option.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalPathApi :: class ) @ Throws ( IOException :: class ) @ kotlin . internal . InlineOnly public inline fun Path . outputStream ( vararg options : OpenOption ) : OutputStream","body":"{ return Files . newOutputStream ( this , * options ) }","docstring":"/**\n * Constructs a new OutputStream of this file and returns it as a result.\n *\n * The [options] parameter determines how the file is opened. If no options are present then it is\n * equivalent to opening the file with the [CREATE][StandardOpenOption.CREATE],\n * [TRUNCATE_EXISTING][StandardOpenOption.TRUNCATE_EXISTING], and [WRITE][StandardOpenOption.WRITE]\n * options.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalPathApi :: class ) @ Throws ( IOException :: class ) @ kotlin . internal . InlineOnly public inline fun Path . readLines ( charset : Charset = Charsets . UTF_8 ) : List < String >","body":"{ return Files . readAllLines ( this , charset ) }","docstring":"/**\n * Reads the file content as a list of lines.\n *\n * It's not recommended to use this function on huge files.\n * For reading lines of a large file or a file of unknown size, use [Path.forEachLine] or [Path.useLines].\n *\n * @param charset character set to use for reading text, UTF-8 by default.\n * @return list of file lines.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalPathApi :: class ) @ Throws ( IOException :: class ) @ kotlin . internal . InlineOnly public inline fun < T > Path . useLines ( charset : Charset = Charsets . UTF_8 , block : ( Sequence < String > ) -> T ) : T","body":"{ contract { callsInPlace ( block , InvocationKind . EXACTLY_ONCE ) } return Files . newBufferedReader ( this , charset ) . use { block ( it . lineSequence ( ) ) } }","docstring":"/**\n * Calls the [block] callback giving it a sequence of all the lines in this file and closes the reader once\n * the processing is complete.\n\n * @param charset character set to use for reading text, UTF-8 by default.\n * @return the value returned by [block].\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalPathApi :: class ) @ Throws ( IOException :: class ) @ kotlin . internal . InlineOnly public inline fun Path . writeLines ( lines : Iterable < CharSequence > , charset : Charset = Charsets . UTF_8 , vararg options : OpenOption ) : Path","body":"{ return Files . write ( this , lines , charset , * options ) }","docstring":"/**\n * Write the specified collection of char sequences [lines] to a file terminating each one with the platform's line separator.\n *\n * By default, the file will be overwritten if it already exists, but you can control this behavior\n * with [options].\n *\n * @param charset character set to use for writing text, UTF-8 by default.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalPathApi :: class ) @ Throws ( IOException :: class ) @ kotlin . internal . InlineOnly public inline fun Path . writeLines ( lines : Sequence < CharSequence > , charset : Charset = Charsets . UTF_8 , vararg options : OpenOption ) : Path","body":"{ return Files . write ( this , lines . asIterable ( ) , charset , * options ) }","docstring":"/**\n * Write the specified sequence of char sequences [lines] to a file terminating each one with the platform's line separator.\n *\n * By default, the file will be overwritten if it already exists, but you can control this behavior\n * with [options].\n *\n * @param charset character set to use for writing text, UTF-8 by default.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalPathApi :: class ) @ Throws ( IOException :: class ) @ kotlin . internal . InlineOnly public inline fun Path . appendLines ( lines : Iterable < CharSequence > , charset : Charset = Charsets . UTF_8 ) : Path","body":"{ return Files . write ( this , lines , charset , StandardOpenOption . APPEND ) }","docstring":"/**\n * Appends the specified collection of char sequences [lines] to a file terminating each one with the platform's line separator.\n *\n * @param charset character set to use for writing text, UTF-8 by default.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalPathApi :: class ) @ Throws ( IOException :: class ) @ kotlin . internal . InlineOnly public inline fun Path . appendLines ( lines : Sequence < CharSequence > , charset : Charset = Charsets . UTF_8 ) : Path","body":"{ return Files . write ( this , lines . asIterable ( ) , charset , StandardOpenOption . APPEND ) }","docstring":"/**\n * Appends the specified sequence of char sequences [lines] to a file terminating each one with the platform's line separator.\n *\n * @param charset character set to use for writing text, UTF-8 by default.\n */"} {"signature":"fun bar ( )","body":"= foo ( ) . foo ( )","docstring":"/**\n * this will calculate the return type of `foo` on `CLASS_WITH_SAME_NAME`.\n * Return type of CLASS_WITH_SAME_NAME differs, so we can detect which one was used on Swift side.\n * We are expecting it to be the one that does not have a module - so it will be Swift.Int32.\n */"} {"signature":"public abstract fun close ( )","body":"public abstract fun close ( )","docstring":"/**\n * Initiate the closing sequence of the coroutine dispatcher.\n * After a successful call to [close], no new tasks will be accepted to be [dispatched][dispatch].\n * The previously-submitted tasks will still be run, but [close] is not guaranteed to wait for them to finish.\n *\n * Invocations of `close` are idempotent and thread-safe.\n */"} {"signature":"override fun isStrictEnum ( enumDef : EnumDef ) : Boolean","body":"= with ( enumDef ) { if ( this . isAnonymous ) { return false } val name = this . kotlinName if ( name in configuration . strictEnums ) { return true } if ( name in configuration . nonStrictEnums ) { return false } return ! this . constants . any { it . isExplicitlyDefined } }","docstring":"/**\n * Indicates whether this enum should be represented as Kotlin enum.\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 Math . max ( 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 Math . max ( 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 Math . max ( a , 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 Math . max ( a , 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 Math . max ( a , 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 Math . max ( a , 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 Math . max ( a . toInt ( ) , Math . max ( 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 Math . max ( a . toInt ( ) , Math . max ( 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 Math . min ( 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 Math . min ( 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 Math . min ( a , 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 Math . min ( a , 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 Math . min ( a , 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 Math . min ( a , 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 Math . min ( a . toInt ( ) , Math . min ( 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 Math . min ( a . toInt ( ) , Math . min ( 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":"override fun hashCode ( ) : Int","body":"= MapImplementation . hashCode ( this )","docstring":"/**\n * We provide [equals], so as a matter of style, we should also provide [hashCode].\n *\n * Should be `super.hashCode()`, but https://youtrack.jetbrains.com/issue/KT-45673\n */"} {"signature":"internal fun < Data , Context : PhaseContext > getDefaultIrActions ( ) : Set < Action < Data , Context > >","body":"= setOfNotNull ( getIrDumper ( ) , getIrValidator < Context , Data > ( ) )","docstring":"/**\n * IR dump and verify actions.\n */"} {"signature":"fun < T > emptySeq ( ) : Seq < T >","body":"= Seq . empty < T > ( ) as Seq < T >","docstring":"/** Returns a new empty immutable Seq. */"} {"signature":"fun < T > seqOf ( vararg elements : T ) : Seq < T >","body":"= if ( elements . isEmpty ( ) ) emptySeq ( ) else Seq . newBuilder < T > ( ) . apply { for ( it in elements ) `$plus$eq` ( it ) } . result ( ) as Seq < T >","docstring":"/** Returns a new immutable Seq with the given elements. */"} {"signature":"fun < T > emptyMutableSeq ( ) : MutableSeq < T >","body":"= MutableSeq . empty < T > ( ) as MutableSeq < T >","docstring":"/** Returns a new mutable Seq with the given elements. */"} {"signature":"fun < T > mutableSeqOf ( vararg elements : T ) : MutableSeq < T >","body":"= if ( elements . isEmpty ( ) ) emptyMutableSeq ( ) else MutableSeq . newBuilder < T > ( ) . apply { for ( it in elements ) `$plus$eq` ( it ) } . result ( ) as MutableSeq < T >","docstring":"/** Returns a new mutable Seq with the given elements. */"} {"signature":"internal fun < CT > construct ( constructorType : dynamic , resultType : dynamic , vararg args : Any ? ) : Any","body":"{ return js ( \"\" ) . construct ( constructorType , args , resultType ) }","docstring":"/**\n * @param CT is return type of calling constructor (uses in DCE)\n */"} {"signature":"fun isReparseableBlock ( blockText : CharSequence ) : Boolean","body":"{ fun advanceWhitespacesCheckIsEndOrArrow ( lexer : KotlinLexer ) : Boolean { lexer . advance ( ) while ( lexer . tokenType != null && lexer . tokenType != KtTokens . EOF ) { if ( lexer . tokenType == KtTokens . ARROW ) return true if ( lexer . tokenType != KtTokens . WHITE_SPACE ) return false lexer . advance ( ) } return true } val lexer = KotlinLexer ( ) lexer . start ( blockText ) if ( lexer . tokenType != KtTokens . LBRACE ) return false if ( advanceWhitespacesCheckIsEndOrArrow ( lexer ) ) return false if ( lexer . tokenType != KtTokens . COLON && lexer . tokenType != KtTokens . IDENTIFIER && lexer . tokenType != KtTokens . LPAR ) return true val searchForRPAR = lexer . tokenType == KtTokens . LPAR if ( advanceWhitespacesCheckIsEndOrArrow ( lexer ) ) return false val preferParamsToExpressions = lexer . tokenType == KtTokens . COMMA || lexer . tokenType == KtTokens . COLON while ( true ) { if ( lexer . tokenType == KtTokens . LBRACE ) return true if ( lexer . tokenType == KtTokens . RBRACE ) return ! preferParamsToExpressions if ( searchForRPAR && lexer . tokenType == KtTokens . RPAR ) { return ! advanceWhitespacesCheckIsEndOrArrow ( lexer ) } if ( advanceWhitespacesCheckIsEndOrArrow ( lexer ) ) return false } }","docstring":"/**\n * Check if this text is block but not a lambda, please refer to parsing rules!\n @see [org.jetbrains.kotlin.parsing.KotlinExpressionParsing.parseFunctionLiteral]\n */"} {"signature":"public fun onModification ( module : KtModule )","body":"public fun onModification ( module : KtModule )","docstring":"/**\n * [onModification] is invoked in a write action before or after a context change for code fragments depending on the [module].\n *\n * All code fragments depending on [module], both directly or transitively, should be considered modified when this event is received.\n *\n * @see KotlinTopics\n */"} {"signature":"inline fun < KEY , VALUE , reified R > KeyValueGroupedDataset < KEY , VALUE > . mapValues ( noinline func : ( VALUE ) -> R ) : KeyValueGroupedDataset < KEY , R >","body":"= mapValues ( MapFunction ( func ) , encoder < R > ( ) )","docstring":"/**\n * Returns a new [KeyValueGroupedDataset] where the given function [func] has been applied\n * to the data. The grouping key is unchanged by this.\n *\n * ```kotlin\n * // Create values grouped by key from a Dataset>\n * ds.groupByKey { it._1 }.mapValues { it._2 }\n * ```\n */"} {"signature":"inline fun < KEY , VALUE , reified R > KeyValueGroupedDataset < KEY , VALUE > . mapGroups ( noinline func : ( KEY , Iterator < VALUE > ) -> R ) : Dataset < R >","body":"= mapGroups ( MapGroupsFunction ( func ) , encoder < R > ( ) )","docstring":"/**\n * (Kotlin-specific)\n * Applies the given function to each group of data. For each unique group, the function will\n * be passed the group key and an iterator that contains all the elements in the group. The\n * function can return an element of arbitrary type which will be returned as a new [Dataset].\n *\n * This function does not support partial aggregation, and as a result requires shuffling all\n * the data in the [Dataset]. If an application intends to perform an aggregation over each\n * key, it is best to use the reduce function or an\n * [org.apache.spark.sql.expressions.Aggregator].\n *\n * Internally, the implementation will spill to disk if any given group is too large to fit into\n * memory. However, users must take care to avoid materializing the whole iterator for a group\n * (for example, by calling [toList]) unless they are sure that this is possible given the memory\n * constraints of their cluster.\n */"} {"signature":"inline fun < reified KEY , reified VALUE > KeyValueGroupedDataset < KEY , VALUE > . reduceGroupsK ( noinline func : ( VALUE , VALUE ) -> VALUE ) : Dataset < Tuple2 < KEY , VALUE > >","body":"= reduceGroups ( ReduceFunction ( func ) )","docstring":"/**\n * (Kotlin-specific)\n * Reduces the elements of each group of data using the specified binary function.\n * The given function must be commutative and associative or the result may be non-deterministic.\n *\n * Note that you need to use [reduceGroupsK] always instead of the Java- or Scala-specific\n * [KeyValueGroupedDataset.reduceGroups] to make the compiler work.\n */"} {"signature":"inline fun < K , V , reified U > KeyValueGroupedDataset < K , V > . flatMapGroups ( noinline func : ( key : K , values : Iterator < V > ) -> Iterator < U > , ) : Dataset < U >","body":"= flatMapGroups ( FlatMapGroupsFunction ( func ) , encoder < U > ( ) , )","docstring":"/**\n * (Kotlin-specific)\n * Applies the given function to each group of data. For each unique group, the function will\n * be passed the group key and an iterator that contains all the elements in the group. The\n * function can return an iterator containing elements of an arbitrary type which will be returned\n * as a new [Dataset].\n *\n * This function does not support partial aggregation, and as a result requires shuffling all\n * the data in the [Dataset]. If an application intends to perform an aggregation over each\n * key, it is best to use the reduce function or an\n * [org.apache.spark.sql.expressions.Aggregator].\n *\n * Internally, the implementation will spill to disk if any given group is too large to fit into\n * memory. However, users must take care to avoid materializing the whole iterator for a group\n * (for example, by calling [toList]) unless they are sure that this is possible given the memory\n * constraints of their cluster.\n */"} {"signature":"inline fun < K , V , reified S , reified U > KeyValueGroupedDataset < K , V > . mapGroupsWithState ( noinline func : ( key : K , values : Iterator < V > , state : GroupState < S > ) -> U , ) : Dataset < U >","body":"= mapGroupsWithState ( MapGroupsWithStateFunction ( func ) , encoder < S > ( ) , encoder < U > ( ) , )","docstring":"/**\n * (Kotlin-specific)\n * Applies the given function to each group of data, while maintaining a user-defined per-group\n * state. The result Dataset will represent the objects returned by the function.\n * For a static batch Dataset, the function will be invoked once per group. For a streaming\n * Dataset, the function will be invoked for each group repeatedly in every trigger, and\n * updates to each group's state will be saved across invocations.\n * See [org.apache.spark.sql.streaming.GroupState] for more details.\n *\n * @param S The type of the user-defined state. Must be encodable to Spark SQL types.\n * @param U The type of the output objects. Must be encodable to Spark SQL types.\n * @param func Function to be called on every group.\n *\n * See [Encoder] for more details on what types are encodable to Spark SQL.\n */"} {"signature":"inline fun < K , V , reified S , reified U > KeyValueGroupedDataset < K , V > . mapGroupsWithState ( timeoutConf : GroupStateTimeout , noinline func : ( key : K , values : Iterator < V > , state : GroupState < S > ) -> U , ) : Dataset < U >","body":"= mapGroupsWithState ( MapGroupsWithStateFunction ( func ) , encoder < S > ( ) , encoder < U > ( ) , timeoutConf , )","docstring":"/**\n * (Kotlin-specific)\n * Applies the given function to each group of data, while maintaining a user-defined per-group\n * state. The result Dataset will represent the objects returned by the function.\n * For a static batch Dataset, the function will be invoked once per group. For a streaming\n * Dataset, the function will be invoked for each group repeatedly in every trigger, and\n * updates to each group's state will be saved across invocations.\n * See [org.apache.spark.sql.streaming.GroupState] for more details.\n *\n * @param S The type of the user-defined state. Must be encodable to Spark SQL types.\n * @param U The type of the output objects. Must be encodable to Spark SQL types.\n * @param func Function to be called on every group.\n * @param timeoutConf Timeout configuration for groups that do not receive data for a while.\n *\n * See [Encoder] for more details on what types are encodable to Spark SQL.\n */"} {"signature":"inline fun < K , V , reified S , reified U > KeyValueGroupedDataset < K , V > . flatMapGroupsWithState ( outputMode : OutputMode , timeoutConf : GroupStateTimeout , noinline func : ( key : K , values : Iterator < V > , state : GroupState < S > ) -> Iterator < U > , ) : Dataset < U >","body":"= flatMapGroupsWithState ( FlatMapGroupsWithStateFunction ( func ) , outputMode , encoder < S > ( ) , encoder < U > ( ) , timeoutConf , )","docstring":"/**\n * (Kotlin-specific)\n * Applies the given function to each group of data, while maintaining a user-defined per-group\n * state. The result Dataset will represent the objects returned by the function.\n * For a static batch Dataset, the function will be invoked once per group. For a streaming\n * Dataset, the function will be invoked for each group repeatedly in every trigger, and\n * updates to each group's state will be saved across invocations.\n * See [GroupState] for more details.\n *\n * @param S The type of the user-defined state. Must be encodable to Spark SQL types.\n * @param U The type of the output objects. Must be encodable to Spark SQL types.\n * @param func Function to be called on every group.\n * @param outputMode The output mode of the function.\n * @param timeoutConf Timeout configuration for groups that do not receive data for a while.\n *\n * See [Encoder] for more details on what types are encodable to Spark SQL.\n */"} {"signature":"inline fun < K , V , U , reified R > KeyValueGroupedDataset < K , V > . cogroup ( other : KeyValueGroupedDataset < K , U > , noinline func : ( key : K , left : Iterator < V > , right : Iterator < U > ) -> Iterator < R > , ) : Dataset < R >","body":"= cogroup ( other , CoGroupFunction ( func ) , encoder < R > ( ) , )","docstring":"/**\n * (Kotlin-specific)\n * Applies the given function to each cogrouped data. For each unique group, the function will\n * be passed the grouping key and 2 iterators containing all elements in the group from\n * [Dataset] [this] and [other]. The function can return an iterator containing elements of an\n * arbitrary type which will be returned as a new [Dataset].\n */"} {"signature":"internal fun State . checkNullability ( irType : IrType ? , environment : IrInterpreterEnvironment , exceptionToThrow : ( ) -> Throwable = { NullPointerException ( ) } ) : State ?","body":"{ if ( irType !is IrSimpleType ) return this if ( this . isNull ( ) && ! irType . isNullable ( ) ) { exceptionToThrow ( ) . handleUserException ( environment ) return null } return this }","docstring":"/**\n * This method used to check if for not null parameter there was passed null argument.\n */"} {"signature":"public fun < T : Number > pow ( mat : MultiArray < T , D2 > , n : Int ) : NDArray < T , D2 >","body":"public fun < T : Number > pow ( mat : MultiArray < T , D2 > , n : Int ) : NDArray < T , D2 >","docstring":"/**\n * Raise a square matrix to power [n].\n */"} {"signature":"internal fun Project . addIntransitiveMetadataDependencyIfPossible ( sourceSet : DefaultKotlinSourceSet , dependency : FileCollection )","body":"{ val dependencyConfigurationName = if ( project . isIntransitiveMetadataConfigurationEnabled ) { sourceSet . intransitiveMetadataConfigurationName } else { @ Suppress ( \"\" ) sourceSet . implementationMetadataConfigurationName } project . dependencies . add ( dependencyConfigurationName , dependency ) }","docstring":"/**\n * Dependencies here are using a special configuration called 'intransitiveMetadataConfiguration'.\n * This special configuration can tell the IDE that these dependencies shall *not* be transitively visible\n * to dependsOn edges.\n * This is necessary for the way the commonizer handles its \"expect refinement\" approach.\n * In this mode, every source set will receive exactly one commonized library to analyze its source code with.\n */"} {"signature":"private fun setWorkbookTempDirectory ( )","body":"{ val tempDir = try { Files . createTempDirectory ( readExcelTempFolderPrefix ) . toFile ( ) . also { it . deleteOnExit ( ) } } catch ( e : Exception ) { return } TempFile . setTempFileCreationStrategy ( DefaultTempFileCreationStrategy ( tempDir ) ) }","docstring":"/**\n * To prevent [Issue #402](https://github.com/Kotlin/dataframe/issues/402):\n *\n * Creates new temp directory instead of the default `/tmp/poifiles` which would\n * cause permission issues for multiple users.\n */"} {"signature":"private fun repairNameIfRequired ( nameFromCell : String , columnNameCounters : MutableMap < String , Int > , nameRepairStrategy : NameRepairStrategy , ) : String","body":"{ return when ( nameRepairStrategy ) { NameRepairStrategy . DO_NOTHING -> nameFromCell NameRepairStrategy . CHECK_UNIQUE -> if ( columnNameCounters . contains ( nameFromCell ) ) throw DuplicateColumnNamesException ( columnNameCounters . keys . toList ( ) ) else nameFromCell NameRepairStrategy . MAKE_UNIQUE -> if ( nameFromCell . isEmpty ( ) ) { val emptyName = \"\" if ( columnNameCounters . contains ( emptyName ) ) \"\" else emptyName } else { if ( columnNameCounters . contains ( nameFromCell ) ) { \"\" } else { nameFromCell } } } }","docstring":"/**\n * This is a universal function for name repairing\n * and should be moved to the API module later,\n * when the functionality will be enabled for all IO sources.\n *\n * TODO: https://github.com/Kotlin/dataframe/issues/387\n */"} {"signature":"private fun Cell . setTime ( localDateTime : LocalDateTime )","body":"{ this . setCellValue ( DateUtil . getExcelDate ( localDateTime . plusDays ( ) ) - ) }","docstring":"/**\n * Set LocalDateTime value correctly also if date have zero value in Excel.\n * Zero dates are usually used for storing a time component only,\n * are displayed as 00.01.1900 in Excel and as 30.12.1899 in LibreOffice Calc and also in POI.\n * POI can not set 1899 year directly.\n */"} {"signature":"private fun Cell . setDate ( date : Date )","body":"{ val calStart = LocaleUtil . getLocaleCalendar ( ) calStart . time = date this . setTime ( calStart . toInstant ( ) . atZone ( getUserTimeZone ( ) . toZoneId ( ) ) . toLocalDateTime ( ) ) }","docstring":"/**\n * Set Date value correctly also if date has zero value in Excel.\n * Zero dates are usually used for storing a time component only,\n * are displayed as 00.01.1900 in Excel and as 30.12.1899 in LibreOffice Calc and also in POI.\n * POI can not set 1899 year directly.\n */"} {"signature":"private fun hasFlag ( flag : Int ) : Boolean","body":"= flags and flag == flag","docstring":"/** Return true if the pattern has the specified flag */"} {"signature":"private fun processAlternations ( last : AbstractSet ) : AbstractSet","body":"{ val auxRange = CharClass ( hasFlag ( Pattern . CASE_INSENSITIVE ) ) while ( ! lexemes . isEmpty ( ) && lexemes . isLetter ( ) && ( lexemes . lookAhead == || lexemes . lookAhead == Lexer . CHAR_VERTICAL_BAR || lexemes . lookAhead == Lexer . CHAR_RIGHT_PARENTHESIS ) ) { auxRange . add ( lexemes . next ( ) ) if ( lexemes . currentChar == Lexer . CHAR_VERTICAL_BAR ) { lexemes . next ( ) } } val rangeSet = processRangeSet ( auxRange ) rangeSet . next = last return rangeSet }","docstring":"/** A->(a|)+ */"} {"signature":"private fun processExpression ( ch : Int , newFlags : Int , last : AbstractSet ? ) : AbstractSet","body":"{ val children = ArrayList < AbstractSet > ( ) val savedFlags = flags var saveChangedFlags = false if ( newFlags != flags ) { flags = newFlags } val fSet : FSet when ( ch ) { Lexer . CHAR_NONCAP_GROUP -> fSet = NonCapFSet ( consumersCount ++ ) Lexer . CHAR_POS_LOOKAHEAD , Lexer . CHAR_NEG_LOOKAHEAD -> fSet = AheadFSet ( ) Lexer . CHAR_POS_LOOKBEHIND , Lexer . CHAR_NEG_LOOKBEHIND -> fSet = BehindFSet ( consumersCount ++ ) Lexer . CHAR_ATOMIC_GROUP -> fSet = AtomicFSet ( consumersCount ++ ) else -> { if ( last == null ) { fSet = FinalSet ( ) saveChangedFlags = true } else { fSet = FSet ( capturingGroups . size ) } capturingGroups . add ( fSet ) if ( ch == Lexer . CHAR_NAMED_GROUP ) { val name = ( lexemes . curSpecialToken as NamedGroup ) . name if ( groupNameToIndex . containsKey ( name ) ) { throw PatternSyntaxException ( \"\" , pattern , lexemes . curTokenIndex ) } groupNameToIndex [ name ] = fSet . groupIndex } } } if ( last != null ) { lexemes . next ( ) } do { val child : AbstractSet when { lexemes . isLetter ( ) && lexemes . lookAhead == Lexer . CHAR_VERTICAL_BAR -> child = processAlternations ( fSet ) lexemes . currentChar == Lexer . CHAR_VERTICAL_BAR -> { child = EmptySet ( fSet ) lexemes . next ( ) } else -> { child = processSubExpression ( fSet ) if ( lexemes . currentChar == Lexer . CHAR_VERTICAL_BAR ) { lexemes . next ( ) } } } children . add ( child ) } while ( ! ( lexemes . isEmpty ( ) || lexemes . currentChar == Lexer . CHAR_RIGHT_PARENTHESIS ) ) if ( lexemes . lookBack == Lexer . CHAR_VERTICAL_BAR ) { children . add ( EmptySet ( fSet ) ) } if ( flags != savedFlags && ! saveChangedFlags ) { flags = savedFlags lexemes . restoreFlags ( flags ) } when ( ch ) { Lexer . CHAR_NONCAP_GROUP -> return NonCapturingJointSet ( children , fSet ) Lexer . CHAR_POS_LOOKAHEAD -> return PositiveLookAheadSet ( children , fSet ) Lexer . CHAR_NEG_LOOKAHEAD -> return NegativeLookAheadSet ( children , fSet ) Lexer . CHAR_POS_LOOKBEHIND -> return PositiveLookBehindSet ( children , fSet ) Lexer . CHAR_NEG_LOOKBEHIND -> return NegativeLookBehindSet ( children , fSet ) Lexer . CHAR_ATOMIC_GROUP -> return AtomicJointSet ( children , fSet ) else -> when ( children . size ) { -> return EmptySet ( fSet ) -> return SingleSet ( children [ ] , fSet ) else -> return JointSet ( children , fSet ) } } }","docstring":"/** E->AE; E->S|E; E->S; A->(a|)+ E->S(|S)* */"} {"signature":"@ OptIn ( ExperimentalNativeApi :: class ) private fun processSequence ( ) : AbstractSet","body":"{ val substring = StringBuilder ( ) while ( ! lexemes . isEmpty ( ) && lexemes . isLetter ( ) && ! lexemes . isSurrogate ( ) && ( ! lexemes . isNextSpecial && lexemes . lookAhead == || ! lexemes . isNextSpecial && Lexer . isLetter ( lexemes . lookAhead ) || lexemes . lookAhead == Lexer . CHAR_RIGHT_PARENTHESIS || lexemes . lookAhead and . toInt ( ) == Lexer . CHAR_LEFT_PARENTHESIS || lexemes . lookAhead == Lexer . CHAR_VERTICAL_BAR || lexemes . lookAhead == Lexer . CHAR_DOLLAR ) ) { val ch = lexemes . next ( ) if ( Char . isSupplementaryCodePoint ( ch ) ) { substring . append ( Char . toChars ( ch ) ) } else { substring . append ( ch . toChar ( ) ) } } return SequenceSet ( substring , hasFlag ( CASE_INSENSITIVE ) ) }","docstring":"/**\n * T->aaa\n */"} {"signature":"private fun processDecomposedChar ( ) : AbstractSet","body":"{ val codePoints = IntArray ( Lexer . MAX_DECOMPOSITION_LENGTH ) val codePointsHangul : CharArray var readCodePoints = var curSymb = - var curSymbIndex = - if ( ! lexemes . isEmpty ( ) && lexemes . isLetter ( ) ) { curSymb = lexemes . next ( ) codePoints [ readCodePoints ] = curSymb curSymbIndex = curSymb - Lexer . LBase } if ( curSymbIndex >= && curSymbIndex < Lexer . LCount ) { codePointsHangul = CharArray ( Lexer . MAX_HANGUL_DECOMPOSITION_LENGTH ) codePointsHangul [ readCodePoints ++ ] = curSymb . toChar ( ) curSymb = lexemes . currentChar curSymbIndex = curSymb - Lexer . VBase if ( curSymbIndex >= && curSymbIndex < Lexer . VCount ) { codePointsHangul [ readCodePoints ++ ] = curSymb . toChar ( ) lexemes . next ( ) curSymb = lexemes . currentChar curSymbIndex = curSymb - Lexer . TBase if ( curSymbIndex >= && curSymbIndex < Lexer . TCount ) { codePointsHangul [ @ Suppress ( \"\" ) readCodePoints ++ ] = curSymb . toChar ( ) lexemes . next ( ) return HangulDecomposedCharSet ( codePointsHangul , ) } else { return HangulDecomposedCharSet ( codePointsHangul , ) } } else { return CharSet ( codePointsHangul [ ] , hasFlag ( CASE_INSENSITIVE ) ) } } else { readCodePoints ++ while ( readCodePoints < Lexer . MAX_DECOMPOSITION_LENGTH && ! lexemes . isEmpty ( ) && lexemes . isLetter ( ) && ! Lexer . isDecomposedCharBoundary ( lexemes . currentChar ) ) { codePoints [ readCodePoints ++ ] = lexemes . next ( ) } if ( readCodePoints == && ! Lexer . hasSingleCodepointDecomposition ( codePoints [ ] ) ) { return processCharSet ( codePoints [ ] ) } else { return DecomposedCharSet ( codePoints , readCodePoints ) } } }","docstring":"/**\n * D->a\n */"} {"signature":"private fun processSubExpression ( last : AbstractSet ) : AbstractSet","body":"{ var cur : AbstractSet when { lexemes . isLetter ( ) && ! lexemes . isNextSpecial && Lexer . isLetter ( lexemes . lookAhead ) -> { when { hasFlag ( Pattern . CANON_EQ ) -> { cur = processDecomposedChar ( ) if ( ! lexemes . isEmpty ( ) && ( lexemes . currentChar != Lexer . CHAR_RIGHT_PARENTHESIS || last is FinalSet ) && lexemes . currentChar != Lexer . CHAR_VERTICAL_BAR && ! lexemes . isLetter ( ) ) { cur = processQuantifier ( last , cur ) } } lexemes . isHighSurrogate ( ) || lexemes . isLowSurrogate ( ) -> { val term = processTerminal ( last ) cur = processQuantifier ( last , term ) } else -> { cur = processSequence ( ) } } } lexemes . currentChar == Lexer . CHAR_RIGHT_PARENTHESIS -> { if ( last is FinalSet ) { throw PatternSyntaxException ( \"\" , pattern , lexemes . curTokenIndex ) } cur = EmptySet ( last ) } else -> { val term = processTerminal ( last ) cur = processQuantifier ( last , term ) } } if ( ! lexemes . isEmpty ( ) && ( lexemes . currentChar != Lexer . CHAR_RIGHT_PARENTHESIS || last is FinalSet ) && lexemes . currentChar != Lexer . CHAR_VERTICAL_BAR ) { val next = processSubExpression ( last ) if ( cur is LeafQuantifierSet && cur . max == Quantifier . INF && cur . min == && ! next . first ( cur . innerSet ) ) { cur = UnifiedQuantifierSet ( cur ) } cur . next = next } else { cur . next = last } return cur }","docstring":"/**\n * S->BS; S->QS; S->Q; B->a+\n */"} {"signature":"private fun processQuantifier ( last : AbstractSet , term : AbstractSet ) : AbstractSet","body":"{ val quant = lexemes . currentChar if ( term . type == AbstractSet . TYPE_DOTSET && ( quant == Lexer . QUANT_STAR || quant == Lexer . QUANT_PLUS ) ) { lexemes . next ( ) return DotQuantifierSet ( term , last , quant , AbstractLineTerminator . getInstance ( flags ) , hasFlag ( Pattern . DOTALL ) ) } return when ( quant ) { Lexer . QUANT_STAR , Lexer . QUANT_PLUS , Lexer . QUANT_ALT , Lexer . QUANT_COMP -> { val quantifier = quantifierFromLexerToken ( quant ) when { term is LeafSet -> LeafQuantifierSet ( quantifier , term , last , quant ) term . consumesFixedLength -> FixedLengthQuantifierSet ( quantifier , term , last , quant ) else -> GroupQuantifierSet ( quantifier , term , last , quant , groupQuantifierCount ++ ) } } Lexer . QUANT_STAR_R , Lexer . QUANT_PLUS_R , Lexer . QUANT_ALT_R , Lexer . QUANT_COMP_R -> { val quantifier = quantifierFromLexerToken ( quant ) when { term is LeafSet -> ReluctantLeafQuantifierSet ( quantifier , term , last , quant ) term . consumesFixedLength -> ReluctantFixedLengthQuantifierSet ( quantifier , term , last , quant ) else -> ReluctantGroupQuantifierSet ( quantifier , term , last , quant , groupQuantifierCount ++ ) } } Lexer . QUANT_PLUS_P , Lexer . QUANT_STAR_P , Lexer . QUANT_ALT_P , Lexer . QUANT_COMP_P -> { val quantifier = quantifierFromLexerToken ( quant ) when { term is LeafSet -> PossessiveLeafQuantifierSet ( quantifier , term , last , quant ) term . consumesFixedLength -> PossessiveFixedLengthQuantifierSet ( quantifier , term , last , quant ) else -> PossessiveGroupQuantifierSet ( quantifier , term , last , quant , groupQuantifierCount ++ ) } } else -> term } }","docstring":"/**\n * Q->T(*|+|?...) also do some optimizations.\n */"} {"signature":"private fun processTerminal ( last : AbstractSet ) : AbstractSet","body":"{ val term : AbstractSet var char = lexemes . currentChar while ( char and . toInt ( ) == Lexer . CHAR_FLAGS ) { lexemes . next ( ) flags = ( char shr ) and flagsBitMask char = lexemes . currentChar } if ( char and . toInt ( ) == Lexer . CHAR_LEFT_PARENTHESIS ) { var newFlags = flags if ( char and . toInt ( ) == Lexer . CHAR_NONCAP_GROUP ) { newFlags = ( char shr ) and flagsBitMask } term = processExpression ( char and . toInt ( ) , newFlags , last ) if ( lexemes . currentChar != Lexer . CHAR_RIGHT_PARENTHESIS ) { throw PatternSyntaxException ( \"\" , pattern , lexemes . curTokenIndex ) } lexemes . next ( ) } else { when ( char ) { Lexer . CHAR_LEFT_SQUARE_BRACKET -> { lexemes . next ( ) var negative = false if ( lexemes . currentChar == Lexer . CHAR_CARET ) { negative = true lexemes . next ( ) } term = processRange ( negative , last ) if ( lexemes . currentChar != Lexer . CHAR_RIGHT_SQUARE_BRACKET ) { throw PatternSyntaxException ( \"\" , pattern , lexemes . curTokenIndex ) } lexemes . setModeWithReread ( Lexer . Mode . PATTERN ) lexemes . next ( ) } Lexer . CHAR_DOT -> { lexemes . next ( ) term = DotSet ( AbstractLineTerminator . getInstance ( flags ) , hasFlag ( DOTALL ) ) } Lexer . CHAR_CARET -> { lexemes . next ( ) term = SOLSet ( AbstractLineTerminator . getInstance ( flags ) , hasFlag ( MULTILINE ) ) consumersCount ++ } Lexer . CHAR_DOLLAR -> { lexemes . next ( ) term = EOLSet ( consumersCount ++ , AbstractLineTerminator . getInstance ( flags ) , hasFlag ( MULTILINE ) ) } Lexer . CHAR_WORD_BOUND -> { lexemes . next ( ) term = WordBoundarySet ( true ) } Lexer . CHAR_NONWORD_BOUND -> { lexemes . next ( ) term = WordBoundarySet ( false ) } Lexer . CHAR_END_OF_INPUT -> { lexemes . next ( ) term = EOISet ( ) } Lexer . CHAR_END_OF_LINE -> { lexemes . next ( ) term = EOLSet ( consumersCount ++ , AbstractLineTerminator . getInstance ( flags ) ) } Lexer . CHAR_START_OF_INPUT -> { lexemes . next ( ) term = SOLSet ( AbstractLineTerminator . getInstance ( flags ) ) } Lexer . CHAR_LINEBREAK -> { lexemes . next ( ) val fSet = NonCapFSet ( consumersCount ++ ) val lineBreakSequence = SequenceSet ( \"\" ) . apply { next = fSet } val lineBreakChars = RangeSet ( CharClass ( ) . addAll ( listOf ( '' , '' , '' , '' , '' , '' , '' ) ) ) . apply { next = fSet } term = NonCapturingJointSet ( listOf ( lineBreakSequence , lineBreakChars ) , fSet ) } Lexer . CHAR_PREVIOUS_MATCH -> { lexemes . next ( ) term = PreviousMatchSet ( ) } . toInt ( ) or '' . toInt ( ) , . toInt ( ) or '' . toInt ( ) , . toInt ( ) or '' . toInt ( ) , . toInt ( ) or '' . toInt ( ) , . toInt ( ) or '' . toInt ( ) , . toInt ( ) or '' . toInt ( ) , . toInt ( ) or '' . toInt ( ) , . toInt ( ) or '' . toInt ( ) , . toInt ( ) or '' . toInt ( ) -> { var groupIndex = ( char and ) - '' . code while ( lexemes . lookAhead in '' . code .. '' . code ) { val newGroupIndex = ( groupIndex * ) + ( lexemes . lookAhead - '' . code ) if ( newGroupIndex in until capturingGroups . size ) { groupIndex = newGroupIndex lexemes . next ( ) } else { break } } term = createBackReference ( groupIndex ) lexemes . next ( ) } Lexer . CHAR_NAMED_GROUP_REF -> { val name = ( lexemes . curSpecialToken as NamedGroup ) . name val groupIndex = groupNameToIndex [ name ] ? : - term = createBackReference ( groupIndex ) lexemes . next ( ) } -> { val cc : AbstractCharClass ? = lexemes . curSpecialToken as AbstractCharClass ? when { cc != null -> { term = processRangeSet ( cc ) lexemes . next ( ) } ! lexemes . isEmpty ( ) -> { term = CharSet ( char . toChar ( ) ) lexemes . next ( ) } else -> term = EmptySet ( last ) } } else -> { when { char >= && ! lexemes . isSpecial -> { term = processCharSet ( char ) lexemes . next ( ) } char == Lexer . CHAR_VERTICAL_BAR -> { term = EmptySet ( last ) } char == Lexer . CHAR_RIGHT_PARENTHESIS -> { if ( last is FinalSet ) { throw PatternSyntaxException ( \"\" , pattern , lexemes . curTokenIndex ) } term = EmptySet ( last ) } else -> { val current = if ( lexemes . isSpecial ) lexemes . curSpecialToken . toString ( ) else char . toString ( ) throw PatternSyntaxException ( \"\" , pattern , lexemes . curTokenIndex ) } } } } } return term }","docstring":"/**\n * T-> letter|[range]|{char-class}|(E)\n */"} {"signature":"private fun createBackReference ( groupIndex : Int ) : BackReferenceSet","body":"{ if ( groupIndex >= && groupIndex < capturingGroups . size ) { capturingGroups [ groupIndex ] . isBackReferenced = true needsBackRefReplacement = true return BackReferenceSet ( groupIndex , consumersCount ++ , hasFlag ( CASE_INSENSITIVE ) ) } else { throw PatternSyntaxException ( \"\" , pattern , lexemes . curTokenIndex ) } }","docstring":"/** Creates a back reference to the group with specified [groupIndex], or throws if the group doesn't exist yet. */"} {"signature":"private fun processRange ( negative : Boolean , last : AbstractSet ) : AbstractSet","body":"{ val res = processRangeExpression ( negative ) val rangeSet = processRangeSet ( res ) rangeSet . next = last return rangeSet }","docstring":"/**\n * Process [...] ranges\n */"} {"signature":"fun quote ( s : String ) : String","body":"{ return StringBuilder ( ) . append ( \"\" ) . append ( s . replace ( \"\" , \"\" ) ) . append ( \"\" ) . toString ( ) }","docstring":"/**\n * Quotes a given string using \"\\Q\" and \"\\E\", so that all other meta-characters lose their special meaning.\n * If the string is used for a `Pattern` afterwards, it can only be matched literally.\n */"} {"signature":"@ Test fun testBasicNoSuspend ( )","body":"= runTest { expect ( ) val result = withTimeoutOrNull ( ) { expect ( ) \"\" } assertEquals ( \"\" , result ) finish ( ) }","docstring":"/**\n * Tests a case of no timeout and no suspension inside.\n */"} {"signature":"@ Test fun testBasicSuspend ( )","body":"= runTest { expect ( ) val result = withTimeoutOrNull ( ) { expect ( ) yield ( ) expect ( ) \"\" } assertEquals ( \"\" , result ) finish ( ) }","docstring":"/**\n * Tests a case of no timeout and one suspension inside.\n */"} {"signature":"@ Test fun testDispatch ( )","body":"= runTest { expect ( ) launch { expect ( ) yield ( ) expect ( ) } expect ( ) val result = withTimeoutOrNull ( ) { expect ( ) yield ( ) expect ( ) \"\" } assertEquals ( \"\" , result ) expect ( ) yield ( ) finish ( ) }","docstring":"/**\n * Tests property dispatching of `withTimeoutOrNull` blocks\n */"} {"signature":"@ Test fun testYieldBlockingWithTimeout ( )","body":"= runTest { expect ( ) val result = withTimeoutOrNull ( ) { while ( true ) { yield ( ) } } assertNull ( result ) finish ( ) }","docstring":"/**\n * Tests that a 100% CPU-consuming loop will react on timeout if it has yields.\n */"} {"signature":"override fun dispatch ( context : CoroutineContext , block : Runnable )","body":"{ checkSchedulerInContext ( scheduler , context ) if ( dispatchImmediately ) { scheduler . sendDispatchEvent ( context ) block . run ( ) } else { post ( block , context ) } }","docstring":"/** @suppress */"} {"signature":"override fun dispatchYield ( context : CoroutineContext , block : Runnable )","body":"{ checkSchedulerInContext ( scheduler , context ) post ( block , context ) }","docstring":"/** @suppress */"} {"signature":"override fun toString ( ) : String","body":"= \"\"","docstring":"/** @suppress */"} {"signature":"@ Deprecated ( \"\" , level = DeprecationLevel . ERROR ) override suspend fun pauseDispatcher ( block : suspend ( ) -> Unit )","body":"{ val previous = dispatchImmediately dispatchImmediately = false try { block ( ) } finally { dispatchImmediately = previous } }","docstring":"/** @suppress */"} {"signature":"@ Deprecated ( \"\" , level = DeprecationLevel . ERROR ) override fun pauseDispatcher ( )","body":"{ dispatchImmediately = false }","docstring":"/** @suppress */"} {"signature":"@ Deprecated ( \"\" , level = DeprecationLevel . ERROR ) override fun resumeDispatcher ( )","body":"{ dispatchImmediately = true }","docstring":"/** @suppress */"} {"signature":"@ ExternalKotlinTargetApi fun IdeDependencyResolver . withTransformer ( transformer : IdeDependencyTransformer )","body":"= IdeDependencyResolver { sourceSet -> transformer . transform ( sourceSet , this @ withTransformer . resolve ( sourceSet ) ) }","docstring":"/**\n * Creates a [IdeDependencyResolver] which will invoke the given [transformer] right after resolving the dependencies from the\n * receiver.\n */"} {"signature":"@ ExternalKotlinTargetApi fun IdeDependencyTransformer ( transformers : List < IdeDependencyTransformer ? > ) : IdeDependencyTransformer","body":"= IdeCompositeDependencyTransformer ( transformers . filterNotNull ( ) )","docstring":"/**\n * Create a composite [IdeDependencyTransformer]\n * `null` instances will just be ignored.\n * The transformers will be invoked in the same order as specified to this function.\n */"} {"signature":"@ ExternalKotlinTargetApi fun IdeDependencyTransformer ( vararg transformers : IdeDependencyTransformer ? ) : IdeDependencyTransformer","body":"= IdeDependencyTransformer ( transformers . toList ( ) )","docstring":"/**\n * Create a composite [IdeDependencyTransformer]\n * `null` instances will just be ignored.\n * The transformers will be invoked in the same order as specified to this function.\n */"} {"signature":"fun collectAllCandidates ( qualifiedAccess : FirQualifiedAccessExpression , name : Name , containingDeclarations : List < FirDeclaration > = transformer . components . containingDeclarations , resolutionContext : ResolutionContext = transformer . resolutionContext , resolutionMode : ResolutionMode , ) : List < OverloadCandidate >","body":"{ val collector = AllCandidatesCollector ( components , components . resolutionStageRunner ) val origin = ( qualifiedAccess as? FirFunctionCall ) ? . origin ? : FirFunctionCallOrigin . Regular val result = collectCandidates ( qualifiedAccess , name , forceCallKind = null , isUsedAsGetClassReceiver = false , origin , containingDeclarations , resolutionContext , collector , resolutionMode = resolutionMode ) return collector . allCandidates . map { OverloadCandidate ( it , isInBestCandidates = it in result . candidates ) } }","docstring":"/** WARNING: This function is public for the analysis API and should only be used there. */"} {"signature":"private fun reduceCandidates ( collector : CandidateCollector , explicitReceiver : FirExpression ? = null , resolutionContext : ResolutionContext = transformer . resolutionContext , ) : Pair < Set < Candidate > , CandidateApplicability ? >","body":"{ fun chooseMostSpecific ( list : List < Candidate > ) : Set < Candidate > { val onSuperReference = ( explicitReceiver as? FirQualifiedAccessExpression ) ? . calleeReference is FirSuperReference return conflictResolver . chooseMaximallySpecificCandidates ( list , discriminateAbstracts = onSuperReference ) } val candidates = collector . bestCandidates ( ) if ( collector . isSuccess ) { return chooseMostSpecific ( candidates ) to null } if ( candidates . size > ) { val groupedByDiagnosticCount = candidates . groupBy { components . resolutionStageRunner . fullyProcessCandidate ( it , resolutionContext ) it . diagnostics . minOf ( ResolutionDiagnostic :: applicability ) } groupedByDiagnosticCount . maxBy { it . key } . let { return chooseMostSpecific ( it . value ) to it . key } } return candidates . toSet ( ) to null }","docstring":"/**\n * Returns a [Pair] consisting of the reduced candidates and the new applicability if it has changed and `null` otherwise.\n */"} {"signature":"public fun < K , V > PairSerializer ( keySerializer : KSerializer < K > , valueSerializer : KSerializer < V > ) : KSerializer < Pair < K , V > >","body":"= kotlinx . serialization . internal . PairSerializer ( keySerializer , valueSerializer )","docstring":"/**\n * Returns built-in serializer for Kotlin [Pair].\n * Resulting serializer represents pair as a structure of two key-value pairs.\n */"} {"signature":"public fun < K , V > MapEntrySerializer ( keySerializer : KSerializer < K > , valueSerializer : KSerializer < V > ) : KSerializer < Map . Entry < K , V > >","body":"= kotlinx . serialization . internal . MapEntrySerializer ( keySerializer , valueSerializer )","docstring":"/**\n * Returns built-in serializer for [Map.Entry].\n * Resulting serializer represents entry as a structure with a single key-value pair.\n * E.g. `Pair(1, 2)` and `Map.Entry(1, 2)` will be serialized to JSON as\n * `{\"first\": 1, \"second\": 2}` and `{\"1\": 2}` respectively.\n */"} {"signature":"public fun < A , B , C > TripleSerializer ( aSerializer : KSerializer < A > , bSerializer : KSerializer < B > , cSerializer : KSerializer < C > ) : KSerializer < Triple < A , B , C > >","body":"= kotlinx . serialization . internal . TripleSerializer ( aSerializer , bSerializer , cSerializer )","docstring":"/**\n * Returns built-in serializer for Kotlin [Triple].\n * Resulting serializer represents triple as a structure of three key-value pairs.\n */"} {"signature":"public fun Char . Companion . serializer ( ) : KSerializer < Char >","body":"= CharSerializer","docstring":"/**\n * Returns serializer for [Char] with [descriptor][SerialDescriptor] of [PrimitiveKind.CHAR] kind.\n */"} {"signature":"@ Suppress ( \"\" ) public fun CharArraySerializer ( ) : KSerializer < CharArray >","body":"= CharArraySerializer","docstring":"/**\n * Returns serializer for [CharArray] with [descriptor][SerialDescriptor] of [StructureKind.LIST] kind.\n * Each element of the array is serialized one by one with [Char.Companion.serializer].\n */"} {"signature":"public fun Byte . Companion . serializer ( ) : KSerializer < Byte >","body":"= ByteSerializer","docstring":"/**\n * Returns serializer for [Byte] with [descriptor][SerialDescriptor] of [PrimitiveKind.BYTE] kind.\n */"} {"signature":"public fun ByteArraySerializer ( ) : KSerializer < ByteArray >","body":"= ByteArraySerializer","docstring":"/**\n * Returns serializer for [ByteArray] with [descriptor][SerialDescriptor] of [StructureKind.LIST] kind.\n * Each element of the array is serialized one by one with [Byte.Companion.serializer].\n */"} {"signature":"@ ExperimentalSerializationApi @ ExperimentalUnsignedTypes public fun UByteArraySerializer ( ) : KSerializer < UByteArray >","body":"= UByteArraySerializer","docstring":"/**\n * Returns serializer for [UByteArray] with [descriptor][SerialDescriptor] of [StructureKind.LIST] kind.\n * Each element of the array is serialized one by one with [UByte.Companion.serializer].\n */"} {"signature":"public fun Short . Companion . serializer ( ) : KSerializer < Short >","body":"= ShortSerializer","docstring":"/**\n * Returns serializer for [Short] with [descriptor][SerialDescriptor] of [PrimitiveKind.SHORT] kind.\n */"} {"signature":"public fun ShortArraySerializer ( ) : KSerializer < ShortArray >","body":"= ShortArraySerializer","docstring":"/**\n * Returns serializer for [ShortArray] with [descriptor][SerialDescriptor] of [StructureKind.LIST] kind.\n * Each element of the array is serialized one by one with [Short.Companion.serializer].\n */"} {"signature":"@ ExperimentalSerializationApi @ ExperimentalUnsignedTypes public fun UShortArraySerializer ( ) : KSerializer < UShortArray >","body":"= UShortArraySerializer","docstring":"/**\n * Returns serializer for [UShortArray] with [descriptor][SerialDescriptor] of [StructureKind.LIST] kind.\n * Each element of the array is serialized one by one with [UShort.Companion.serializer].\n */"} {"signature":"public fun Int . Companion . serializer ( ) : KSerializer < Int >","body":"= IntSerializer","docstring":"/**\n * Returns serializer for [Int] with [descriptor][SerialDescriptor] of [PrimitiveKind.INT] kind.\n */"} {"signature":"public fun IntArraySerializer ( ) : KSerializer < IntArray >","body":"= IntArraySerializer","docstring":"/**\n * Returns serializer for [IntArray] with [descriptor][SerialDescriptor] of [StructureKind.LIST] kind.\n * Each element of the array is serialized one by one with [Int.Companion.serializer].\n */"} {"signature":"@ ExperimentalSerializationApi @ ExperimentalUnsignedTypes public fun UIntArraySerializer ( ) : KSerializer < UIntArray >","body":"= UIntArraySerializer","docstring":"/**\n * Returns serializer for [UIntArray] with [descriptor][SerialDescriptor] of [StructureKind.LIST] kind.\n * Each element of the array is serialized one by one with [UInt.Companion.serializer].\n */"} {"signature":"public fun Long . Companion . serializer ( ) : KSerializer < Long >","body":"= LongSerializer","docstring":"/**\n * Returns serializer for [Long] with [descriptor][SerialDescriptor] of [PrimitiveKind.LONG] kind.\n */"} {"signature":"public fun LongArraySerializer ( ) : KSerializer < LongArray >","body":"= LongArraySerializer","docstring":"/**\n * Returns serializer for [LongArray] with [descriptor][SerialDescriptor] of [StructureKind.LIST] kind.\n * Each element of the array is serialized one by one with [Long.Companion.serializer].\n */"} {"signature":"@ ExperimentalSerializationApi @ ExperimentalUnsignedTypes public fun ULongArraySerializer ( ) : KSerializer < ULongArray >","body":"= ULongArraySerializer","docstring":"/**\n * Returns serializer for [ULongArray] with [descriptor][SerialDescriptor] of [StructureKind.LIST] kind.\n * Each element of the array is serialized one by one with [ULong.Companion.serializer].\n */"} {"signature":"public fun Float . Companion . serializer ( ) : KSerializer < Float >","body":"= FloatSerializer","docstring":"/**\n * Returns serializer for [Float] with [descriptor][SerialDescriptor] of [PrimitiveKind.FLOAT] kind.\n */"} {"signature":"public fun FloatArraySerializer ( ) : KSerializer < FloatArray >","body":"= FloatArraySerializer","docstring":"/**\n * Returns serializer for [FloatArray] with [descriptor][SerialDescriptor] of [StructureKind.LIST] kind.\n * Each element of the array is serialized one by one with [Float.Companion.serializer].\n */"} {"signature":"public fun Double . Companion . serializer ( ) : KSerializer < Double >","body":"= DoubleSerializer","docstring":"/**\n * Returns serializer for [Double] with [descriptor][SerialDescriptor] of [PrimitiveKind.DOUBLE] kind.\n */"} {"signature":"public fun DoubleArraySerializer ( ) : KSerializer < DoubleArray >","body":"= DoubleArraySerializer","docstring":"/**\n * Returns serializer for [DoubleArray] with [descriptor][SerialDescriptor] of [StructureKind.LIST] kind.\n * Each element of the array is serialized one by one with [Double.Companion.serializer].\n */"} {"signature":"public fun Boolean . Companion . serializer ( ) : KSerializer < Boolean >","body":"= BooleanSerializer","docstring":"/**\n * Returns serializer for [Boolean] with [descriptor][SerialDescriptor] of [PrimitiveKind.BOOLEAN] kind.\n */"} {"signature":"public fun BooleanArraySerializer ( ) : KSerializer < BooleanArray >","body":"= BooleanArraySerializer","docstring":"/**\n * Returns serializer for [BooleanArray] with [descriptor][SerialDescriptor] of [StructureKind.LIST] kind.\n * Each element of the array is serialized one by one with [Boolean.Companion.serializer].\n */"} {"signature":"@ Suppress ( \"\" ) public fun Unit . serializer ( ) : KSerializer < Unit >","body":"= UnitSerializer","docstring":"/**\n * Returns serializer for [Unit] with [descriptor][SerialDescriptor] of [StructureKind.OBJECT] kind.\n */"} {"signature":"public fun String . Companion . serializer ( ) : KSerializer < String >","body":"= StringSerializer","docstring":"/**\n * Returns serializer for [String] with [descriptor][SerialDescriptor] of [PrimitiveKind.STRING] kind.\n */"} {"signature":"@ Suppress ( \"\" ) @ ExperimentalSerializationApi public inline fun < reified T : Any , reified E : T ? > ArraySerializer ( elementSerializer : KSerializer < E > ) : KSerializer < Array < E > >","body":"= ArraySerializer < T , E > ( T :: class , elementSerializer )","docstring":"/**\n * Returns serializer for reference [Array] of type [E] with [descriptor][SerialDescriptor] of [StructureKind.LIST] kind.\n * Each element of the array is serialized with the given [elementSerializer].\n */"} {"signature":"@ ExperimentalSerializationApi public fun < T : Any , E : T ? > ArraySerializer ( kClass : KClass < T > , elementSerializer : KSerializer < E > ) : KSerializer < Array < E > >","body":"= ReferenceArraySerializer < T , E > ( kClass , elementSerializer )","docstring":"/**\n * Returns serializer for reference [Array] of type [E] with [descriptor][SerialDescriptor] of [StructureKind.LIST] kind.\n * Each element of the array is serialized with the given [elementSerializer].\n */"} {"signature":"public fun < T > ListSerializer ( elementSerializer : KSerializer < T > ) : KSerializer < List < T > >","body":"= ArrayListSerializer ( elementSerializer )","docstring":"/**\n * Creates a serializer for [`List`][List] for the given serializer of type [T].\n */"} {"signature":"public fun < T > SetSerializer ( elementSerializer : KSerializer < T > ) : KSerializer < Set < T > >","body":"= LinkedHashSetSerializer ( elementSerializer )","docstring":"/**\n * Creates a serializer for [`Set`][Set] for the given serializer of type [T].\n */"} {"signature":"public fun < K , V > MapSerializer ( keySerializer : KSerializer < K > , valueSerializer : KSerializer < V > ) : KSerializer < Map < K , V > >","body":"= LinkedHashMapSerializer ( keySerializer , valueSerializer )","docstring":"/**\n * Creates a serializer for [`Map`][Map] for the given serializers for\n * its ket type [K] and value type [V].\n */"} {"signature":"public fun UInt . Companion . serializer ( ) : KSerializer < UInt >","body":"= UIntSerializer","docstring":"/**\n * Returns serializer for [UInt].\n */"} {"signature":"public fun ULong . Companion . serializer ( ) : KSerializer < ULong >","body":"= ULongSerializer","docstring":"/**\n * Returns serializer for [ULong].\n */"} {"signature":"public fun UByte . Companion . serializer ( ) : KSerializer < UByte >","body":"= UByteSerializer","docstring":"/**\n * Returns serializer for [UByte].\n */"} {"signature":"public fun UShort . Companion . serializer ( ) : KSerializer < UShort >","body":"= UShortSerializer","docstring":"/**\n * Returns serializer for [UShort].\n */"} {"signature":"public fun Duration . Companion . serializer ( ) : KSerializer < Duration >","body":"= DurationSerializer","docstring":"/**\n * Returns serializer for [Duration].\n * It is serialized as a string that represents a duration in the ISO-8601-2 format.\n *\n * The result of serialization is similar to calling [Duration.toIsoString], for deserialization is [Duration.parseIsoString].\n */"} {"signature":"@ ExperimentalSerializationApi public fun NothingSerializer ( ) : KSerializer < Nothing >","body":"= NothingSerializer","docstring":"/**\n * Returns serializer for [Nothing].\n * Throws an exception when trying to encode or decode.\n *\n * It is used as a dummy in case it is necessary to pass a type to a parameterized class. At the same time, it is expected that this generic type will not participate in serialization.\n */"} {"signature":"@ Deprecated ( \"\" , level = DeprecationLevel . ERROR ) public fun Any . asDynamic ( ) : JsAny","body":"= this . toJsReference ( )","docstring":"/**\n * Reinterprets this value as a value of the Dynamic type.\n */"} {"signature":"@ Deprecated ( \"\" , level = DeprecationLevel . ERROR , replaceWith = ReplaceWith ( \"\" ) ) @ kotlin . internal . InlineOnly public fun String . asDynamic ( ) : JsString","body":"= this . toJsString ( )","docstring":"/**\n * Reinterprets this value as a value of the Dynamic type.\n */"} {"signature":"public fun JsAny . toThrowableOrNull ( ) : Throwable ?","body":"{ val thisAny : Any = this if ( thisAny is Throwable ) return thisAny var result : Throwable ? = null jsCatch { try { jsThrow ( this ) } catch ( e : Throwable ) { result = e } } return result }","docstring":"/**\n * For a Dynamic value caught in JS, returns the corresponding [Throwable]\n * if it was thrown from Kotlin, or null otherwise.\n */"} {"signature":"fun orthographicProjectionMatrix ( left : Float , right : Float , bottom : Float , top : Float , near : Float , far : Float ) : Matrix4","body":"{ val m3 = diagonalMatrix ( / ( right - left ) , / ( top - bottom ) , - / ( far - near ) ) val tx = - ( right + left ) / ( right - left ) val ty = - ( top + bottom ) / ( top - bottom ) val tz = - ( far + near ) / ( far - near ) return Matrix4 ( m3 , col4 = Vector4 ( tx , ty , tz , ) ) }","docstring":"/**\n * The matrix to perform the orthographic projection from the world coordinate system to the clip space,\n * as described in [glOrtho documentation](https://www.khronos.org/registry/OpenGL-Refpages/es1.1/xhtml/glOrtho.xml)\n */"} {"signature":"private fun IrType . exploreType ( visitedSymbols : MutableSet < IrClassifierSymbol > ) : ExploredClassifier","body":"{ return when ( this ) { is IrSimpleType -> classifier . exploreSymbol ( visitedSymbols ) . asUnusable ( ) ? : arguments . firstUnusable { it . typeOrNull ? . exploreType ( visitedSymbols ) } ? : Usable is IrDynamicType -> Usable else -> { if ( this is IrErrorType && allowErrorTypes ) Usable else throw IllegalArgumentException ( \"\" ) } } }","docstring":"/** Explore the IR type to find the first cause why this type should be considered as unusable. */"} {"signature":"private fun IrClassifierSymbol . exploreSymbol ( visitedSymbols : MutableSet < IrClassifierSymbol > ) : ExploredClassifier","body":"{ exploredSymbols [ this ] ? . let { result -> return result } if ( ! isBound ) { stubGenerator . getDeclaration ( this ) return exploredSymbols . registerUnusable ( this , MissingClassifier ( this ) ) } ( owner as? IrLazyClass ) ? . let { lazyIrClass -> val isEffectivelyMissingClassifier = lazyIrClass . descriptor is NotFoundClasses . MockClassDescriptor || lazyIrClass . isEffectivelyMissingLazyIrDeclaration ( ) if ( isEffectivelyMissingClassifier ) return exploredSymbols . registerUnusable ( this , MissingClassifier ( this ) ) } if ( ! visitedSymbols . add ( this ) ) { return Usable } val cause : Unusable ? = when ( val classifier = owner ) { is IrClass -> when ( PLModule . determineModuleFor ( owner as IrClass ) ) { is PLModule . MissingDeclarations -> return exploredSymbols . registerUnusable ( this , MissingClassifier ( this ) ) stdlibModule , PLModule . SyntheticBuiltInFunctions -> { null } else -> { val directSuperTypeSymbols = hashSetOf < IrClassSymbol > ( ) classifier . annotationConstructorsIfApplicable ? . firstUnusable { it . exploreAnnotationConstructor ( visitedSymbols ) } ? : classifier . outerClassSymbolIfApplicable ? . exploreSymbol ( visitedSymbols ) . asUnusable ( ) ? : classifier . typeParameters . firstUnusable { it . symbol . exploreSymbol ( visitedSymbols ) } ? : classifier . superTypes . firstUnusable { superType -> directSuperTypeSymbols . addIfNotNull ( superType . asSimpleType ( ) ? . classifier as? IrClassSymbol ) superType . exploreType ( visitedSymbols ) } ? : classifier . exploreSuperClasses ( directSuperTypeSymbols ) } } is IrTypeParameter -> classifier . superTypes . firstUnusable { it . exploreType ( visitedSymbols ) } else -> null } val rootCause = when { cause == null -> return exploredSymbols . registerUsable ( this ) cause . symbol == this -> return exploredSymbols . registerUnusable ( this , cause ) else -> when ( cause ) { is DueToOtherClassifier -> cause . rootCause is CanBeRootCause -> cause } } return exploredSymbols . registerUnusable ( this , DueToOtherClassifier ( this , rootCause ) ) }","docstring":"/** Explore the IR classifier symbol to find the first cause why this symbol should be considered as unusable. */"} {"signature":"private fun IrValueParameter . exploreAnnotationConstructorParameter ( visitedSymbols : MutableSet < IrClassifierSymbol > , annotationClass : IrClass ) : Unusable ?","body":"{ val parameterType = type . asSimpleType ( ) ? : return null val parameterClassSymbol = parameterType . classifier as IrClassSymbol val parameterClass = parameterClassSymbol . owner when { parameterClass . isAnnotationClass -> { parameterClassSymbol . exploreSymbol ( visitedSymbols ) . asUnusable ( ) ? . let { return it } } parameterClass . isEnumClass || parameterClassSymbol in permittedAnnotationParameterSymbols -> return null parameterClassSymbol == builtIns . arrayClass -> { for ( argument in parameterType . arguments ) { val argumentClassSymbol = ( argument . typeOrNull ? . asSimpleType ( ) ? : continue ) . classifier as IrClassSymbol val argumentClass = argumentClassSymbol . owner when { argumentClass . isAnnotationClass -> { argumentClassSymbol . exploreSymbol ( visitedSymbols ) . asUnusable ( ) ? . let { return it } } argumentClass . isEnumClass || argumentClassSymbol in permittedAnnotationArrayParameterSymbols -> continue else -> return AnnotationWithUnacceptableParameter ( annotationClass . symbol , argumentClassSymbol ) } } } else -> return AnnotationWithUnacceptableParameter ( annotationClass . symbol , parameterClassSymbol ) } return null }","docstring":"/** See also [org.jetbrains.kotlin.resolve.CompileTimeConstantUtils.isAcceptableTypeForAnnotationParameter] */"} {"signature":"private inline fun < T > Iterable < T > . firstUnusable ( transform : ( T ) -> ExploredClassifier ? ) : Unusable ?","body":"= firstNotNullOfOrNull { transform ( it ) . asUnusable ( ) }","docstring":"/** Iterate the collection and find the first unusable classifier. */"} {"signature":"public expect fun < T > runBlocking ( context : CoroutineContext = EmptyCoroutineContext , block : suspend CoroutineScope . ( ) -> T ) : T","body":"public expect fun < T > runBlocking ( context : CoroutineContext = EmptyCoroutineContext , block : suspend CoroutineScope . ( ) -> T ) : T","docstring":"/**\n * Runs a new coroutine and **blocks** the current thread until its completion.\n *\n * It is designed to bridge regular blocking code to libraries that are written in suspending style, to be used in\n * `main` functions and in tests.\n *\n * Calling [runBlocking] from a suspend function is redundant.\n * For example, the following code is incorrect:\n * ```\n * suspend fun loadConfiguration() {\n * // DO NOT DO THIS:\n * val data = runBlocking { // <- redundant and blocks the thread, do not do that\n * fetchConfigurationData() // suspending function\n * }\n * ```\n *\n * Here, instead of releasing the thread on which `loadConfiguration` runs if `fetchConfigurationData` suspends, it will\n * block, potentially leading to thread starvation issues.\n */"} {"signature":"@ ExperimentalMultikApi @ JvmName ( \"\" ) public fun LinAlg . svd ( mat : MultiArray < Float , D2 > ) : Triple < D2Array < Float > , D1Array < Float > , D2Array < Float > >","body":"= this . linAlgEx . svdF ( mat )","docstring":"/**\n * Returns SVD decomposition of the float matrix\n */"} {"signature":"@ ExperimentalMultikApi @ JvmName ( \"\" ) public fun < T : Number > LinAlg . svd ( mat : MultiArray < T , D2 > ) : Triple < D2Array < Double > , D1Array < Double > , D2Array < Double > >","body":"= this . linAlgEx . svd ( mat )","docstring":"/**\n * Returns SVD decomposition of the numeric matrix\n */"} {"signature":"@ ExperimentalMultikApi @ JvmName ( \"\" ) public fun < T : Complex > LinAlg . svd ( mat : MultiArray < T , D2 > ) : Triple < D2Array < T > , D1Array < T > , D2Array < T > >","body":"= this . linAlgEx . svdC ( mat )","docstring":"/**\n * Returns SVD decomposition of the complex matrix\n */"} {"signature":"@ Suppress ( \"\" ) inline fun < reified T : Number > JavaRDD < T > . toJavaDoubleRDD ( ) : JavaDoubleRDD","body":"= JavaDoubleRDD . fromRDD ( when ( T :: class ) { Double :: class -> this else -> map ( Number :: toDouble ) } . rdd ( ) as RDD < Any > )","docstring":"/** Utility method to convert [JavaRDD]<[Number]> to [JavaDoubleRDD]. */"} {"signature":"@ Suppress ( \"\" ) fun JavaDoubleRDD . toDoubleRDD ( ) : JavaRDD < Double >","body":"= JavaDoubleRDD . toRDD ( this ) . toJavaRDD ( ) as JavaRDD < Double >","docstring":"/** Utility method to convert [JavaDoubleRDD] to [JavaRDD]<[Double]>. */"} {"signature":"inline fun < reified T : Number > JavaRDD < T > . sum ( ) : Double","body":"= toJavaDoubleRDD ( ) . sum ( )","docstring":"/** Add up the elements in this RDD. */"} {"signature":"inline fun < reified T : Number > JavaRDD < T > . stats ( ) : StatCounter","body":"= toJavaDoubleRDD ( ) . stats ( )","docstring":"/**\n * Return a [org.apache.spark.util.StatCounter] object that captures the mean, variance and\n * count of the RDD's elements in one operation.\n */"} {"signature":"inline fun < reified T : Number > JavaRDD < T > . mean ( ) : Double","body":"= toJavaDoubleRDD ( ) . mean ( )","docstring":"/** Compute the mean of this RDD's elements. */"} {"signature":"inline fun < reified T : Number > JavaRDD < T > . variance ( ) : Double","body":"= toJavaDoubleRDD ( ) . variance ( )","docstring":"/** Compute the population variance of this RDD's elements. */"} {"signature":"inline fun < reified T : Number > JavaRDD < T > . stdev ( ) : Double","body":"= toJavaDoubleRDD ( ) . stdev ( )","docstring":"/** Compute the population standard deviation of this RDD's elements. */"} {"signature":"inline fun < reified T : Number > JavaRDD < T > . sampleStdev ( ) : Double","body":"= toJavaDoubleRDD ( ) . sampleStdev ( )","docstring":"/**\n * Compute the sample standard deviation of this RDD's elements (which corrects for bias in\n * estimating the standard deviation by dividing by N-1 instead of N).\n */"} {"signature":"inline fun < reified T : Number > JavaRDD < T > . sampleVariance ( ) : Double","body":"= toJavaDoubleRDD ( ) . sampleVariance ( )","docstring":"/**\n * Compute the sample variance of this RDD's elements (which corrects for bias in\n * estimating the variance by dividing by N-1 instead of N).\n */"} {"signature":"inline fun < reified T : Number > JavaRDD < T > . popStdev ( ) : Double","body":"= toJavaDoubleRDD ( ) . popStdev ( )","docstring":"/** Compute the population standard deviation of this RDD's elements. */"} {"signature":"inline fun < reified T : Number > JavaRDD < T > . popVariance ( ) : Double","body":"= toJavaDoubleRDD ( ) . popVariance ( )","docstring":"/** Compute the population variance of this RDD's elements. */"} {"signature":"inline fun < reified T : Number > JavaRDD < T > . meanApprox ( timeout : Long , confidence : Double = , ) : PartialResult < BoundedDouble >","body":"= toJavaDoubleRDD ( ) . meanApprox ( timeout , confidence )","docstring":"/** Approximate operation to return the mean within a timeout. */"} {"signature":"inline fun < reified T : Number > JavaRDD < T > . sumApprox ( timeout : Long , confidence : Double = , ) : PartialResult < BoundedDouble >","body":"= toJavaDoubleRDD ( ) . sumApprox ( timeout , confidence )","docstring":"/** Approximate operation to return the sum within a timeout. */"} {"signature":"inline fun < reified T : Number > JavaRDD < T > . histogram ( bucketCount : Int ) : Tuple2 < DoubleArray , LongArray >","body":"= toJavaDoubleRDD ( ) . histogram ( bucketCount )","docstring":"/**\n * Compute a histogram of the data using bucketCount number of buckets evenly\n * spaced between the minimum and maximum of the RDD. For example if the min\n * value is 0 and the max is 100 and there are two buckets the resulting\n * buckets will be `[0, 50)` `[50, 100]`. bucketCount must be at least 1\n * If the RDD contains infinity, NaN throws an exception\n * If the elements in RDD do not vary (max == min) always returns a single bucket.\n */"} {"signature":"inline fun < reified T : Number > JavaRDD < T > . histogram ( buckets : Array < Double > , evenBuckets : Boolean = false , ) : LongArray","body":"= toJavaDoubleRDD ( ) . histogram ( buckets , evenBuckets )","docstring":"/**\n * Compute a histogram using the provided buckets. The buckets are all open\n * to the right except for the last which is closed.\n * e.g. for the array\n * `[1, 10, 20, 50]` the buckets are `[1, 10) [10, 20) [20, 50]`\n * e.g. ` <=x<10, 10<=x<20, 20<=x<=50`\n * And on the input of 1 and 50 we would have a histogram of 1, 0, 1\n *\n * Note: If your histogram is evenly spaced (e.g. `[0, 10, 20, 30]`) this can be switched\n * from an O(log n) insertion to O(1) per element. (where n = # buckets) if you set evenBuckets\n * to true.\n * buckets must be sorted and not contain any duplicates.\n * buckets array must be at least two elements\n * All NaN entries are treated the same. If you have a NaN bucket it must be\n * the maximum value of the last position and all NaN entries will be counted\n * in that bucket.\n */"} {"signature":"fun DependencyHandler . module ( dependency : ProjectDependency , moduleName : String ) : ProjectDependency","body":"= dependency . copy ( ) . apply { capabilities { requireCapability ( CppConsumerPlugin . moduleCapability ( dependencyProject , moduleName ) ) } }","docstring":"/**\n * Depend on [CompileToBitcodePlugin]'s module named [moduleName] defined in [dependency].\n */"} {"signature":"fun DependencyHandler . moduleTestFixtures ( dependency : ProjectDependency , moduleName : String ) : ProjectDependency","body":"= dependency . copy ( ) . apply { capabilities { requireCapability ( CppConsumerPlugin . moduleTestFixturesCapability ( dependencyProject , moduleName ) ) } }","docstring":"/**\n * Depend on [CompileToBitcodePlugin]'s module (testFixtures part) named [moduleName] defined in [dependency].\n */"} {"signature":"fun DependencyHandler . moduleTest ( dependency : ProjectDependency , moduleName : String ) : ProjectDependency","body":"= dependency . copy ( ) . apply { capabilities { requireCapability ( CppConsumerPlugin . moduleTestCapability ( dependencyProject , moduleName ) ) } }","docstring":"/**\n * Depend on [CompileToBitcodePlugin]'s module (test part) named [moduleName] defined in [dependency].\n */"} {"signature":"fun annotationInfos ( ) : List < KtAnnotationApplicationInfo >","body":"fun annotationInfos ( ) : List < KtAnnotationApplicationInfo >","docstring":"/**\n * @return a list of [KtAnnotationApplicationInfo] applicable for this provider\n */"} {"signature":"fun ownerClassId ( ) : ClassId ?","body":"fun ownerClassId ( ) : ClassId ?","docstring":"/**\n * Example:\n * ```\n * package one\n *\n * @Ann1 @Ann2\n * class Foo\n * ```\n * If this provider provides annotations from `Foo` class then the result of the function will be [ClassId] for `one.Foo`\n *\n * @return [ClassId] of an owner of annotations from this provider\n */"} {"signature":"public fun ColumnSet < * > . valueCols ( filter : Predicate < ValueColumn < * > > = { true } ) : TransformableColumnSet < * >","body":"= valueColumnsInternal ( filter )","docstring":"/**\n * @include [CommonValueColsDocs]\n * @set [CommonValueColsDocs.ExampleArg]\n *\n * `df.`[select][DataFrame.select]` { `[cols][ColumnsSelectionDsl.cols]` { it.`[name][ColumnReference.name]`.`[startsWith][String.startsWith]`(\"my\") }.`[valueCols][ColumnSet.valueCols]`() }`\n *\n * `// NOTE: This can be shortened to just:`\n *\n * `df.`[select][DataFrame.select]` { `[valueCols][ColumnsSelectionDsl.valueCols]` { it.`[name][ColumnReference.name]`.`[startsWith][String.startsWith]`(\"my\") } }`\n */"} {"signature":"public fun ColumnsSelectionDsl < * > . valueCols ( filter : Predicate < ValueColumn < * > > = { true } ) : TransformableColumnSet < * >","body":"= asSingleColumn ( ) . valueColumnsInternal ( filter )","docstring":"/**\n * @include [CommonValueColsDocs]\n * @set [CommonValueColsDocs.ExampleArg]\n *\n * `df.`[select][DataFrame.select]` { `[valueCols][ColumnsSelectionDsl.valueCols]`() }`\n *\n * `df.`[select][DataFrame.select]` { `[valueCols][ColumnsSelectionDsl.valueCols]` { it.`[any][ColumnWithPath.any]` { it == \"Alice\" } } }`\n */"} {"signature":"public fun SingleColumn < DataRow < * > > . valueCols ( filter : Predicate < ValueColumn < * > > = { true } ) : TransformableColumnSet < * >","body":"= this . ensureIsColumnGroup ( ) . valueColumnsInternal ( filter )","docstring":"/**\n * @include [CommonValueColsDocs]\n * @set [CommonValueColsDocs.ExampleArg]\n *\n * `df.`[select][DataFrame.select]` { myColGroup.`[valueCols][SingleColumn.valueCols]`() }`\n *\n * `df.`[select][DataFrame.select]` { myColGroup.`[valueCols][SingleColumn.valueCols]` { it.`[any][ColumnWithPath.any]` { it == \"Alice\" } } }`\n */"} {"signature":"public fun String . valueCols ( filter : Predicate < ValueColumn < * > > = { true } ) : TransformableColumnSet < * >","body":"= columnGroup ( this ) . valueCols ( filter )","docstring":"/**\n * @include [CommonValueColsDocs]\n * @set [CommonValueColsDocs.ExampleArg]\n *\n * `df.`[select][DataFrame.select]` { \"myColGroup\".`[valueCols][String.valueCols]` { it.`[any][ColumnWithPath.any]` { it == \"Alice\" } } }`\n *\n * `df.`[select][DataFrame.select]` { \"myColGroup\".`[valueCols][String.valueCols]`() }`\n */"} {"signature":"public fun KProperty < * > . valueCols ( filter : Predicate < ValueColumn < * > > = { true } ) : TransformableColumnSet < * >","body":"= columnGroup ( this ) . valueCols ( filter )","docstring":"/**\n * @include [CommonValueColsDocs]\n * @set [CommonValueColsDocs.ExampleArg]\n *\n * `df.`[select][DataFrame.select]` { Type::myColumnGroup.`[valueCols][KProperty.valueCols]` { it.`[any][ColumnWithPath.any]` { it == \"Alice\" } } }`\n *\n * `df.`[select][DataFrame.select]` { Type::myColumnGroup.`[valueCols][KProperty.valueCols]`() }`\n *\n * `df.`[select][DataFrame.select]` { DataSchemaType::myColumnGroup.`[valueCols][KProperty.valueCols]`() }`\n */"} {"signature":"public fun ColumnPath . valueCols ( filter : Predicate < ValueColumn < * > > = { true } ) : TransformableColumnSet < * >","body":"= columnGroup ( this ) . valueCols ( filter )","docstring":"/**\n * @include [CommonValueColsDocs]\n * @set [CommonValueColsDocs.ExampleArg]\n *\n * `df.`[select][DataFrame.select]` { \"pathTo\"[\"myGroupCol\"].`[valueCols][ColumnPath.valueCols]`() }`\n */"} {"signature":"internal fun ColumnsResolver < * > . valueColumnsInternal ( filter : ( ValueColumn < * > ) -> Boolean ) : TransformableColumnSet < * >","body":"= colsInternal { it . isValueColumn ( ) && filter ( it . asValueColumn ( ) ) }","docstring":"/**\n * Returns a TransformableColumnSet containing the value columns that satisfy the given filter.\n *\n * @param filter The filter function to apply on each value column. Must accept a ValueColumn object and return a Boolean.\n * @return A [TransformableColumnSet] containing the value columns that satisfy the filter.\n */"} {"signature":"@ OptIn ( SessionConfiguration :: class ) fun FirSession . registerDefaultComponents ( )","body":"{ register ( FirVisibilityChecker :: class , FirVisibilityChecker . Default ) register ( ConeCallConflictResolverFactory :: class , DefaultCallConflictResolverFactory ) register ( FirPlatformClassMapper :: class , FirPlatformClassMapper . Default ) register ( FirOverridesBackwardCompatibilityHelper :: class , FirDefaultOverridesBackwardCompatibilityHelper ) register ( FirDelegatedMembersFilter :: class , FirDelegatedMembersFilter . Default ) register ( FirPlatformSpecificCastChecker :: class , FirPlatformSpecificCastChecker . Default ) register ( FirDefaultImportProviderHolder :: class , FirDefaultImportProviderHolder ( CommonPlatformAnalyzerServices ) ) }","docstring":"/**\n * Registers default components for [FirSession]\n * They could be overridden by calling a function that registers specific platform components\n */"} {"signature":"fun fromSystemProperty ( key : String ) : DebugMode","body":"= when ( System . getProperty ( key ) ) { \"\" , \"\" -> SUPER_DEBUG \"\" , \"\" , \"\" -> DEBUG \"\" , \"\" , \"\" , null -> NONE else -> NONE }","docstring":"/**\n * Obtains a [DebugMode] from the system property with the given [key].\n * If the property is not defined, returns [NONE].\n */"} {"signature":"public external fun eval ( expr : String ) : dynamic","body":"public external fun eval ( expr : String ) : dynamic","docstring":"/**\n * Exposes the JavaScript [eval function](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/eval) to Kotlin.\n */"} {"signature":"@ Deprecated ( \"\" , ReplaceWith ( \"\" ) ) fun display ( value : Any )","body":"= display ( value , null )","docstring":"/**\n * Try to display the given value. It is only displayed if it's an instance of [Renderable]\n * or may be converted to it\n *\n * Left for binary compatibility\n */"} {"signature":"fun display ( value : Any , id : String ? = null , )","body":"fun display ( value : Any , id : String ? = null , )","docstring":"/**\n * Try to display the given value. It is only displayed if it's an instance of [Renderable]\n * or may be converted to it\n */"} {"signature":"fun updateDisplay ( value : Any , id : String ? = null , )","body":"fun updateDisplay ( value : Any , id : String ? = null , )","docstring":"/**\n * Updates display data with given [id] with the new [value]\n */"} {"signature":"fun scheduleExecution ( execution : ExecutionCallback < * > )","body":"fun scheduleExecution ( execution : ExecutionCallback < * > )","docstring":"/**\n * Schedules execution of the given [execution] after the completing of execution of the current cell\n */"} {"signature":"fun execute ( code : Code ) : FieldValue","body":"fun execute ( code : Code ) : FieldValue","docstring":"/**\n * Executes code immediately. Note that it may lead to breaking the kernel state in some cases\n */"} {"signature":"fun addLibraries ( libraries : Collection < LibraryDefinition > )","body":"fun addLibraries ( libraries : Collection < LibraryDefinition > )","docstring":"/**\n * Adds new libraries via their definition. Fully interchangeable with `%use` approach\n */"} {"signature":"fun acceptsIntegrationTypeName ( typeName : String ) : Boolean ?","body":"fun acceptsIntegrationTypeName ( typeName : String ) : Boolean ?","docstring":"/**\n * Says whether this [typeName] should be loaded as integration based on loaded libraries.\n * `null` means that loaded libraries don't care about this [typeName].\n */"} {"signature":"fun loadKotlinArtifacts ( artifacts : Collection < String > , version : String ? = null , )","body":"fun loadKotlinArtifacts ( artifacts : Collection < String > , version : String ? = null , )","docstring":"/**\n * Loads Kotlin standard artifacts (org.jetbrains.kotlin:kotlin-$name:$version)\n *\n * @param artifacts Names of the artifacts substituted to the above line\n * @param version Version of the artifacts to load. Current Kotlin version will be used by default\n */"} {"signature":"fun loadStdlibJdkExtensions ( version : String ? = null )","body":"fun loadStdlibJdkExtensions ( version : String ? = null )","docstring":"/**\n * Loads Kotlin standard library extensions for a current JDK\n *\n * @param version Version of the artifact to load. Current Kotlin version will be used by default\n */"} {"signature":"fun declare ( variables : Iterable < VariableDeclaration > )","body":"fun declare ( variables : Iterable < VariableDeclaration > )","docstring":"/**\n * Declares global variables for notebook\n */"} {"signature":"private fun hackExceptions ( constructor : IrConstructor )","body":"{ val setPropertiesSymbol = context . setPropertiesToThrowableInstanceSymbol val statements = ( constructor . body as? IrBlockBody ) ? . statements ? : return var callIndex = - var superCallIndex = - for ( i in statements . indices ) { val s = statements [ i ] if ( s is IrCall && s . symbol === setPropertiesSymbol ) { callIndex = i } if ( s is IrDelegatingConstructorCall && s . symbol . owner . origin === PrimaryConstructorLowering . SYNTHETIC_PRIMARY_CONSTRUCTOR ) { superCallIndex = i } } if ( callIndex != - && superCallIndex != - ) { val tmp = statements [ callIndex ] statements [ callIndex ] = statements [ superCallIndex ] statements [ superCallIndex ] = tmp } }","docstring":"/**\n * Swap call synthetic primary ctor and call extendThrowable\n */"} {"signature":"fun < T1 , T2 > Pair < T1 , T2 > . toTuple ( ) : Tuple2 < T1 , T2 >","body":"= Tuple2 < T1 , T2 > ( first , second )","docstring":"/**\n * Returns a new [Tuple2] based on the arguments in the current [Pair].\n */"} {"signature":"fun < T1 , T2 > Tuple2 < T1 , T2 > . toPair ( ) : Pair < T1 , T2 >","body":"= Pair < T1 , T2 > ( _1 ( ) , _2 ( ) )","docstring":"/**\n * Returns a new [Pair] based on the arguments in the current [Tuple2].\n */"} {"signature":"fun < T1 , T2 , T3 > Triple < T1 , T2 , T3 > . toTuple ( ) : Tuple3 < T1 , T2 , T3 >","body":"= Tuple3 < T1 , T2 , T3 > ( first , second , third )","docstring":"/**\n * Returns a new [Tuple3] based on the arguments in the current [Triple].\n */"} {"signature":"fun < T1 , T2 , T3 > Tuple3 < T1 , T2 , T3 > . toTriple ( ) : Triple < T1 , T2 , T3 >","body":"= Triple < T1 , T2 , T3 > ( _1 ( ) , _2 ( ) , _3 ( ) )","docstring":"/**\n * Returns a new [Triple] based on the arguments in the current [Tuple3].\n */"} {"signature":"@ InternalCoroutinesApi public fun Job . cancelFutureOnCompletion ( future : Future < * > ) : DisposableHandle","body":"= invokeOnCompletion ( handler = CancelFutureOnCompletion ( future ) )","docstring":"/**\n * Cancels a specified [future] when this job is cancelled.\n * This is a shortcut for the following code with slightly more efficient implementation (one fewer object created).\n * ```\n * invokeOnCompletion { if (it != null) future.cancel(false) }\n * ```\n *\n * @suppress **This an internal API and should not be used from general code.**\n */"} {"signature":"public fun CancellableContinuation < * > . cancelFutureOnCancellation ( future : Future < * > ) : Unit","body":"= invokeOnCancellation ( handler = CancelFutureOnCancel ( future ) )","docstring":"/**\n * Cancels a specified [future] when this job is cancelled.\n * This is a shortcut for the following code with slightly more efficient implementation (one fewer object created).\n * ```\n * invokeOnCancellation { if (it != null) future.cancel(false) }\n * ```\n */"} {"signature":"fun setPythonConfig ( pythonPath : String )","body":"{ val pyHome = File ( pythonPath ) if ( ! pyHome . exists ( ) ) throw FileNotFoundException ( \"\" ) val os = getOS ( ) val pythonExePath = when ( os ) { OSType . WINDOWS -> Pair ( File ( \"\" ) , File ( \"\" ) ) OSType . LINUX , OSType . MACOS -> Pair ( File ( \"\" ) , File ( \"\" ) ) OSType . UNKNOWN -> throw Exception ( \"\" ) } val python = when { pythonExePath . first . exists ( ) -> pythonExePath . first . absolutePath pythonExePath . second . exists ( ) -> pythonExePath . second . absolutePath else -> throw FileNotFoundException ( \"\" ) } val pythonLibPath = getPythonEnv ( pythonScriptName , \"\" , python ) pythonConf = PythonConf ( os , pyHome . absolutePath , pythonLibPath , python ) }","docstring":"/**\n * Sets paths to python executable and python std lib.\n *\n * NOTE: by default, directory specified in `PYTHONHOME` is used or directory returned from\n * `sysconfig.get_config_var('prefix')` command.\n *\n * @param pythonPath PYTHONHOME, directory where python is installed\n * @exception FileNotFoundException\n */"} {"signature":"fun loadLibraries ( )","body":"{ if ( pythonConf == null ) { val osType = getOS ( ) val pythonHome = System . getenv ( \"\" ) ? : getPythonEnv ( pythonScriptName , \"\" ) pythonConf = PythonConf ( osType = osType , pythonHome = pythonHome , pythonLibPath = getPythonEnv ( pythonScriptName , \"\" ) , \"\" ) } val locationLib : String val exceptionMessage = StringBuilder ( ) try { System . loadLibrary ( baseNameNativeLib ) return } catch ( e : UnsatisfiedLinkError ) { exceptionMessage . append ( e . message ) . append ( \"\" ) } val pypiURL = if ( version != null && version ! ! . contains ( \"\" ) ) \"\" else \"\" var pipOut = execCommand ( pythonConf ! ! . python , \"\" , \"\" , \"\" , \"\" ) if ( pipOut . isEmpty ( ) || \"\" in pipOut ) { execCommand ( pythonConf ! ! . python , \"\" , \"\" , \"\" , \"\" , pypiURL , \"\" ) pipOut = execCommand ( pythonConf ! ! . python , \"\" , \"\" , \"\" , \"\" ) } if ( version != null && pipOut . substringAfter ( \"\" ) . substringBefore ( \"\" ) != version ) { execCommand ( pythonConf ! ! . python , \"\" , \"\" , \"\" , \"\" , pypiURL , \"\" , \"\" ) } locationLib = if ( pythonConf ! ! . osType == OSType . WINDOWS ) { buildString { append ( pythonConf ! ! . pythonHome ) append ( \"\" ) } } else { buildString { append ( pipOut . substringAfter ( \"\" ) . substringBefore ( \"\" ) ) append ( \"\" ) } } try { System . load ( locationLib ) } catch ( e : UnsatisfiedLinkError ) { exceptionMessage . append ( e . message ) . append ( \"\" ) throw UnsatisfiedLinkError ( exceptionMessage . toString ( ) ) } }","docstring":"/**\n * Load *ktnumpy* and *pythonlib*.\n *\n * Pip is used to search for *ktnumpy*, if *ktnumpy* is not installed, pip installs the appropriate version.\n */"} {"signature":"fun main ( )","body":"{ val jsonConfigFile = getVGG16JSONConfigFile ( ) val model = Sequential . loadModelConfiguration ( jsonConfigFile ) val imageNetClassLabels = Imagenet . V1k . labels ( ) model . use { it . compile ( optimizer = Adam ( ) , loss = Losses . MAE , metric = Metrics . ACCURACY ) println ( it . kGraph ) it . logSummary ( ) it . loadWeights ( getVGG16WeightsFile ( ) ) val fileLoader = pipeline < BufferedImage > ( ) . convert { colorMode = ColorMode . BGR } . toFloatArray { } . call ( InputType . CAFFE . preprocessing ( ) ) . fileLoader ( ) for ( i in .. ) { val inputData = fileLoader . load ( getFileFromResource ( \"\" ) ) val res = it . predict ( inputData , \"\" ) println ( \"\" ) val top5 = it . predictTop5Labels ( inputData , imageNetClassLabels ) println ( top5 . toString ( ) ) } } }","docstring":"/**\n * This example demonstrates the inference concept on VGG'16 model and weights loading from KotlinDL txt format:\n * - Weights are loaded from txt files, configuration is loaded from .json file.\n * - Model predicts on a few images located in resources.\n * - Special preprocessing (used in VGG'16 during training on ImageNet dataset) is applied to each image before prediction.\n * - No additional training.\n * - No new layers are added.\n *\n * @see \n * Very Deep Convolutional Networks for Large-Scale Image Recognition (ICLR 2015).\n * @see \n * Detailed description of VGG'16 model and an approach to build it in Keras.\n */"} {"signature":"private fun getVGG16JSONConfigFile ( ) : File","body":"{ val properties = Properties ( ) val reader = FileReader ( \"\" ) properties . load ( reader ) val vgg16JSONModelPath = properties [ \"\" ] as String return File ( vgg16JSONModelPath ) }","docstring":"/** Returns JSON file with model configuration, saved from Keras 2.x. */"} {"signature":"private fun getVGG16WeightsFile ( ) : File","body":"{ val properties = Properties ( ) val reader = FileReader ( \"\" ) properties . load ( reader ) val vgg16h5TxtWeightsPath = properties [ \"\" ] as String return File ( vgg16h5TxtWeightsPath ) }","docstring":"/** Returns .h5 file with model weights, saved from Keras 2.x. */"} {"signature":"fun toolOptions ( configure : TO . ( ) -> Unit )","body":"{ configure ( toolOptions ) }","docstring":"/**\n * Configures the [toolOptions] with the provided configuration.\n */"} {"signature":"fun toolOptions ( configure : Action < in TO > )","body":"{ configure . execute ( toolOptions ) }","docstring":"/**\n * Configures the [toolOptions] with the provided configuration.\n */"} {"signature":"fun < F > prepareJvmSessions ( files : List < F > , configuration : CompilerConfiguration , projectEnvironment : AbstractProjectEnvironment , rootModuleName : Name , extensionRegistrars : List < FirExtensionRegistrar > , librariesScope : AbstractProjectFileSearchScope , libraryList : DependencyListForCliModule , isCommonSource : ( F ) -> Boolean , isScript : ( F ) -> Boolean , fileBelongsToModule : ( F , String ) -> Boolean , createProviderAndScopeForIncrementalCompilation : ( List < F > ) -> IncrementalCompilationContext ? , ) : List < SessionWithSources < F > >","body":"{ val javaSourcesScope = projectEnvironment . getSearchScopeForProjectJavaSources ( ) val predefinedJavaComponents = FirSharableJavaComponents ( firCachesFactoryForCliMode ) var firJvmIncrementalCompilationSymbolProviders : FirJvmIncrementalCompilationSymbolProviders ? = null var firJvmIncrementalCompilationSymbolProvidersIsInitialized = false return prepareSessions ( files , configuration , rootModuleName , JvmPlatforms . unspecifiedJvmPlatform , metadataCompilationMode = false , libraryList , isCommonSource , isScript , fileBelongsToModule , createLibrarySession = { sessionProvider -> FirJvmSessionFactory . createLibrarySession ( rootModuleName , sessionProvider , libraryList . moduleDataProvider , projectEnvironment , extensionRegistrars , librariesScope , projectEnvironment . getPackagePartProvider ( librariesScope ) , configuration . languageVersionSettings , predefinedJavaComponents = predefinedJavaComponents , registerExtraComponents = { } , ) } , ) { moduleFiles , moduleData , sessionProvider , sessionConfigurator -> FirJvmSessionFactory . createModuleBasedSession ( moduleData , sessionProvider , javaSourcesScope , projectEnvironment , createIncrementalCompilationSymbolProviders = { session -> if ( firJvmIncrementalCompilationSymbolProvidersIsInitialized ) firJvmIncrementalCompilationSymbolProviders else { firJvmIncrementalCompilationSymbolProvidersIsInitialized = true createProviderAndScopeForIncrementalCompilation ( moduleFiles ) ? . createSymbolProviders ( session , moduleData , projectEnvironment ) ? . also { firJvmIncrementalCompilationSymbolProviders = it } } } , extensionRegistrars , configuration . languageVersionSettings , configuration . get ( JVMConfigurationKeys . JVM_TARGET , JvmTarget . DEFAULT ) , configuration . get ( CommonConfigurationKeys . LOOKUP_TRACKER ) , configuration . get ( CommonConfigurationKeys . ENUM_WHEN_TRACKER ) , configuration . get ( CommonConfigurationKeys . IMPORT_TRACKER ) , predefinedJavaComponents = predefinedJavaComponents , needRegisterJavaElementFinder = true , registerExtraComponents = { } , sessionConfigurator , ) } }","docstring":"/**\n * Creates library session and sources session for JVM platform\n * Number of created session depends on mode of MPP:\n * - disabled\n * - legacy (one platform and one common module)\n * - HMPP (multiple number of modules)\n */"} {"signature":"fun < F > prepareJsSessions ( files : List < F > , configuration : CompilerConfiguration , rootModuleName : Name , resolvedLibraries : List < KotlinLibrary > , libraryList : DependencyListForCliModule , extensionRegistrars : List < FirExtensionRegistrar > , isCommonSource : ( F ) -> Boolean , fileBelongsToModule : ( F , String ) -> Boolean , lookupTracker : LookupTracker ? , icData : KlibIcData ? , ) : List < SessionWithSources < F > >","body":"{ return prepareSessions ( files , configuration , rootModuleName , JsPlatforms . defaultJsPlatform , metadataCompilationMode = false , libraryList , isCommonSource , isScript = { false } , fileBelongsToModule , createLibrarySession = { sessionProvider -> FirJsSessionFactory . createLibrarySession ( rootModuleName , resolvedLibraries , sessionProvider , libraryList . moduleDataProvider , extensionRegistrars , configuration , registerExtraComponents = { } , ) } ) { _ , moduleData , sessionProvider , sessionConfigurator -> FirJsSessionFactory . createModuleBasedSession ( moduleData , sessionProvider , extensionRegistrars , configuration , lookupTracker , icData = icData , registerExtraComponents = { } , init = sessionConfigurator , ) } }","docstring":"/**\n * Creates library session and sources session for JS platform\n * Number of created session depends on mode of MPP:\n * - disabled\n * - legacy (one platform and one common module)\n * - HMPP (multiple number of modules)\n */"} {"signature":"fun < F > prepareNativeSessions ( files : List < F > , configuration : CompilerConfiguration , rootModuleName : Name , resolvedLibraries : List < KotlinResolvedLibrary > , libraryList : DependencyListForCliModule , extensionRegistrars : List < FirExtensionRegistrar > , metadataCompilationMode : Boolean , isCommonSource : ( F ) -> Boolean , fileBelongsToModule : ( F , String ) -> Boolean , registerExtraComponents : ( ( FirSession ) -> Unit ) = { } , ) : List < SessionWithSources < F > >","body":"{ return prepareSessions ( files , configuration , rootModuleName , NativePlatforms . unspecifiedNativePlatform , metadataCompilationMode , libraryList , isCommonSource , isScript = { false } , fileBelongsToModule , createLibrarySession = { sessionProvider -> FirNativeSessionFactory . createLibrarySession ( rootModuleName , resolvedLibraries , sessionProvider , libraryList . moduleDataProvider , extensionRegistrars , configuration . languageVersionSettings , registerExtraComponents , ) } ) { _ , moduleData , sessionProvider , sessionConfigurator -> FirNativeSessionFactory . createModuleBasedSession ( moduleData , sessionProvider , extensionRegistrars , configuration . languageVersionSettings , sessionConfigurator , registerExtraComponents , ) } }","docstring":"/**\n * Creates library session and sources session for Native platform\n * Number of created session depends on mode of MPP:\n * - disabled\n * - legacy (one platform and one common module)\n * - HMPP (multiple number of modules)\n */"} {"signature":"fun < F > prepareWasmSessions ( files : List < F > , configuration : CompilerConfiguration , rootModuleName : Name , resolvedLibraries : List < KotlinLibrary > , libraryList : DependencyListForCliModule , extensionRegistrars : List < FirExtensionRegistrar > , isCommonSource : ( F ) -> Boolean , fileBelongsToModule : ( F , String ) -> Boolean , lookupTracker : LookupTracker ? , icData : KlibIcData ? , ) : List < SessionWithSources < F > >","body":"{ return prepareSessions ( files , configuration , rootModuleName , WasmPlatforms . Default , metadataCompilationMode = false , libraryList , isCommonSource , isScript = { false } , fileBelongsToModule , createLibrarySession = { sessionProvider -> FirWasmSessionFactory . createLibrarySession ( rootModuleName , resolvedLibraries , sessionProvider , libraryList . moduleDataProvider , extensionRegistrars , configuration . languageVersionSettings , registerExtraComponents = { } , ) } ) { _ , moduleData , sessionProvider , sessionConfigurator -> FirWasmSessionFactory . createModuleBasedSession ( moduleData , sessionProvider , extensionRegistrars , configuration . languageVersionSettings , configuration . wasmTarget , lookupTracker , icData = icData , registerExtraComponents = { } , init = sessionConfigurator , ) } }","docstring":"/**\n * Creates library session and sources session for Wasm platform\n * Number of created session depends on mode of MPP:\n * - disabled\n * - legacy (one platform and one common module)\n * - HMPP (multiple number of modules)\n */"} {"signature":"fun < F > prepareCommonSessions ( files : List < F > , configuration : CompilerConfiguration , projectEnvironment : AbstractProjectEnvironment , rootModuleName : Name , extensionRegistrars : List < FirExtensionRegistrar > , librariesScope : AbstractProjectFileSearchScope , libraryList : DependencyListForCliModule , resolvedLibraries : List < KotlinResolvedLibrary > , isCommonSource : ( F ) -> Boolean , fileBelongsToModule : ( F , String ) -> Boolean , createProviderAndScopeForIncrementalCompilation : ( List < F > ) -> IncrementalCompilationContext ? , ) : List < SessionWithSources < F > >","body":"{ return prepareSessions ( files , configuration , rootModuleName , CommonPlatforms . defaultCommonPlatform , metadataCompilationMode = true , libraryList , isCommonSource , isScript = { false } , fileBelongsToModule , createLibrarySession = { sessionProvider -> FirCommonSessionFactory . createLibrarySession ( rootModuleName , sessionProvider , libraryList . moduleDataProvider , projectEnvironment , extensionRegistrars , librariesScope , resolvedLibraries , projectEnvironment . getPackagePartProvider ( librariesScope ) as PackageAndMetadataPartProvider , configuration . languageVersionSettings , registerExtraComponents = { } , ) } ) { moduleFiles , moduleData , sessionProvider , sessionConfigurator -> FirCommonSessionFactory . createModuleBasedSession ( moduleData , sessionProvider , projectEnvironment , incrementalCompilationContext = createProviderAndScopeForIncrementalCompilation ( moduleFiles ) , extensionRegistrars , configuration . languageVersionSettings , lookupTracker = configuration . get ( CommonConfigurationKeys . LOOKUP_TRACKER ) , enumWhenTracker = configuration . get ( CommonConfigurationKeys . ENUM_WHEN_TRACKER ) , importTracker = configuration . get ( CommonConfigurationKeys . IMPORT_TRACKER ) , registerExtraComponents = { } , init = sessionConfigurator ) } }","docstring":"/**\n * Creates library session and sources session for Common platform (for metadata compilation)\n * Number of created sessions is always one, in this mode modules are compiled against compiled\n * metadata of dependent modules\n */"} {"signature":"internal fun createLTOPipelineConfigForRuntime ( generationState : NativeGenerationState ) : LlvmPipelineConfig","body":"{ val config = generationState . config val configurables : Configurables = config . platform . configurables return LlvmPipelineConfig ( generationState . llvm . targetTriple , getCpuModel ( generationState ) , getCpuFeatures ( generationState ) , LlvmOptimizationLevel . AGGRESSIVE , LlvmSizeLevel . NONE , LLVMCodeGenOptLevel . LLVMCodeGenLevelAggressive , configurables . currentRelocationMode ( generationState ) . translateToLlvmRelocMode ( ) , LLVMCodeModel . LLVMCodeModelDefault , globalDce = false , internalize = false , objCPasses = configurables is AppleConfigurables , makeDeclarationsHidden = false , inlineThreshold = tryGetInlineThreshold ( generationState ) , ) }","docstring":"/**\n * Creates [LlvmPipelineConfig] that is used for [RuntimeLinkageStrategy.LinkAndOptimize].\n * There is no DCE or internalization here because optimized module will be linked later.\n * Still, runtime is not intended to be debugged by user, and we can optimize it pretty aggressively\n * even in debug compilation.\n */"} {"signature":"internal fun createLTOFinalPipelineConfig ( context : PhaseContext , targetTriple : String , closedWorld : Boolean , timePasses : Boolean = false , ) : LlvmPipelineConfig","body":"{ val config = context . config val target = config . target val configurables : Configurables = config . platform . configurables val cpuModel = getCpuModel ( context ) val cpuFeatures = getCpuFeatures ( context ) val optimizationLevel : LlvmOptimizationLevel = when { context . shouldOptimize ( ) -> LlvmOptimizationLevel . AGGRESSIVE context . shouldContainDebugInfo ( ) -> LlvmOptimizationLevel . NONE else -> LlvmOptimizationLevel . DEFAULT } val sizeLevel : LlvmSizeLevel = when { context . shouldOptimize ( ) -> LlvmSizeLevel . NONE context . shouldContainDebugInfo ( ) -> LlvmSizeLevel . NONE else -> LlvmSizeLevel . NONE } val codegenOptimizationLevel : LLVMCodeGenOptLevel = when { context . shouldOptimize ( ) -> LLVMCodeGenOptLevel . LLVMCodeGenLevelAggressive context . shouldContainDebugInfo ( ) -> LLVMCodeGenOptLevel . LLVMCodeGenLevelNone else -> LLVMCodeGenOptLevel . LLVMCodeGenLevelDefault } val relocMode : LLVMRelocMode = configurables . currentRelocationMode ( context ) . translateToLlvmRelocMode ( ) val codeModel : LLVMCodeModel = LLVMCodeModel . LLVMCodeModelDefault val globalDce = true val internalize = closedWorld val makeDeclarationsHidden = config . produce == CompilerOutputKind . STATIC_CACHE val objcPasses = configurables is AppleConfigurables val inlineThreshold : Int ? = when { context . shouldOptimize ( ) -> tryGetInlineThreshold ( context ) context . shouldContainDebugInfo ( ) -> null else -> null } return LlvmPipelineConfig ( targetTriple , cpuModel , cpuFeatures , optimizationLevel , sizeLevel , codegenOptimizationLevel , relocMode , codeModel , globalDce , internalize , makeDeclarationsHidden , objcPasses , inlineThreshold , timePasses = timePasses , ) }","docstring":"/**\n * In the end, Kotlin/Native generates a single LLVM module during compilation.\n * It won't be linked with any other LLVM module, so we can hide and DCE unused symbols.\n *\n * The set of optimizations relies on current compiler configuration.\n * In case of debug we do almost nothing (that's why we need [createLTOPipelineConfigForRuntime]),\n * but for release binaries we rely on \"closed\" world and enable a lot of optimizations.\n */"} {"signature":"@ GCUnsafeCall ( \"\" ) internal external fun < T > undefined ( ) : T","body":"@ GCUnsafeCall ( \"\" ) internal external fun < T > undefined ( ) : T","docstring":"/**\n * Returns undefined value of type `T`.\n * This method is unsafe and should be used with care.\n */"} {"signature":"internal fun LLFirResolveTarget . resolve ( phase : FirResolvePhase )","body":"{ val session = target . llFirResolvableSession ? : errorWithAttachment ( \"\" ) { withEntry ( \"\" , target . llFirSession ) { it . toString ( ) } } val lazyDeclarationResolver = session . moduleComponents . firModuleLazyDeclarationResolver lazyDeclarationResolver . lazyResolveTarget ( this , phase ) }","docstring":"/**\n * Resolves the target to the specified [phase].\n * The owning session must be a resolvable one.\n */"} {"signature":"private fun ensureCapacity ( index : Int )","body":"{ if ( index < ) { throw IndexOutOfBoundsException ( ) } if ( index >= size ) { size = index + if ( index . elementIndex >= bits . size ) { bits = bits . copyOf ( bitToElementSize ( index + ) ) } clearUnusedTail ( ) } }","docstring":"/**\n * Checks if index is valid and extends the `bits` array if the index exceeds its size.\n * @throws [IndexOutOfBoundsException] if [index] < 0.\n */"} {"signature":"fun set ( index : Int , value : Boolean = true )","body":"{ ensureCapacity ( index ) val ( elementIndex , offset ) = index . asBitCoordinates setBitsWithMask ( elementIndex , offset . asMask , value ) }","docstring":"/** Set the bit specified to the specified value. */"} {"signature":"fun set ( from : Int , to : Int , value : Boolean = true )","body":"= set ( from until to , value )","docstring":"/** Sets the bits with indices between [from] (inclusive) and [to] (exclusive) to the specified value. */"} {"signature":"fun set ( range : IntRange , value : Boolean = true )","body":"{ if ( range . start < || range . endInclusive < ) { throw IndexOutOfBoundsException ( ) } if ( range . start > range . endInclusive ) { return } ensureCapacity ( range . endInclusive ) val ( fromIndex , fromOffset ) = range . start . asBitCoordinates val ( toIndex , toOffset ) = range . endInclusive . asBitCoordinates if ( toIndex == fromIndex ) { val mask = getMaskBetween ( fromOffset , toOffset ) setBitsWithMask ( fromIndex , mask , value ) } else { setBitsWithMask ( fromIndex , fromOffset . asMaskAfter , value ) for ( index in fromIndex + until toIndex ) { bits [ index ] = if ( value ) ALL_TRUE else ALL_FALSE } setBitsWithMask ( toIndex , toOffset . asMaskBefore , value ) } }","docstring":"/** Sets the bits from the range specified to the specified value. */"} {"signature":"private fun nextBit ( startIndex : Int , lookFor : Boolean ) : Int","body":"{ if ( startIndex < ) { throw IndexOutOfBoundsException ( ) } if ( startIndex >= size ) { return if ( lookFor ) - else startIndex } val ( startElementIndex , startOffset ) = startIndex . asBitCoordinates var element = bits [ startElementIndex ] for ( offset in startOffset .. MAX_BIT_OFFSET ) { val bit = element and ( shl offset ) != if ( bit == lookFor ) { return bitIndex ( startElementIndex , offset ) } } for ( index in startElementIndex + .. bits . lastIndex ) { element = bits [ index ] for ( offset in .. MAX_BIT_OFFSET ) { val bit = element and ( shl offset ) != if ( bit == lookFor ) { return bitIndex ( index , offset ) } } } return if ( lookFor ) - else size }","docstring":"/**\n * Returns an index of a next set (if [lookFor] == true) or clear\n * (if [lookFor] == false) bit after [startIndex] (inclusive).\n * Returns -1 (for [lookFor] == true) or [size] (for lookFor == false)\n * if there is no such bits between [startIndex] and [size] - 1.\n * @throws IndexOutOfBoundException if [startIndex] < 0.\n */"} {"signature":"fun nextSetBit ( startIndex : Int = ) : Int","body":"= nextBit ( startIndex , true )","docstring":"/**\n * Returns an index of a next bit which value is `true` after [startIndex] (inclusive).\n * Returns -1 if there is no such bits after [startIndex].\n * @throws IndexOutOfBoundException if [startIndex] < 0.\n */"} {"signature":"fun nextClearBit ( startIndex : Int = ) : Int","body":"= nextBit ( startIndex , false )","docstring":"/**\n * Returns an index of a next bit which value is `false` after [startIndex] (inclusive).\n * Returns [size] if there is no such bits between [startIndex] and [size] - 1 assuming that the set has an infinite\n * sequence of `false` bits after (size - 1)-th.\n * @throws IndexOutOfBoundException if [startIndex] < 0.\n */"} {"signature":"operator fun get ( index : Int ) : Boolean","body":"{ if ( index < ) { throw IndexOutOfBoundsException ( ) } if ( index >= size ) { return false } val ( elementIndex , offset ) = index . asBitCoordinates return bits [ elementIndex ] and offset . asMask != }","docstring":"/** Returns a value of a bit with the [index] specified. */"} {"signature":"fun and ( another : BitSet )","body":"= doOperation ( another , Long :: and )","docstring":"/** Performs a logical and operation over corresponding bits of this and [another] BitSets. The result is saved in this BitSet. */"} {"signature":"fun or ( another : BitSet )","body":"= doOperation ( another , Long :: or )","docstring":"/** Performs a logical or operation over corresponding bits of this and [another] BitSets. The result is saved in this BitSet. */"} {"signature":"fun xor ( another : BitSet )","body":"= doOperation ( another , Long :: xor )","docstring":"/** Performs a logical xor operation over corresponding bits of this and [another] BitSets. The result is saved in this BitSet. */"} {"signature":"fun andNot ( another : BitSet )","body":"{ ensureCapacity ( another . lastIndex ) var index = while ( index < another . bits . size ) { bits [ index ] = bits [ index ] and another . bits [ index ] . inv ( ) index ++ } while ( index < bits . size ) { bits [ index ] = bits [ index ] and ALL_TRUE index ++ } }","docstring":"/** Performs a logical and + not operations over corresponding bits of this and [another] BitSets. The result is saved in this BitSet. */"} {"signature":"fun intersects ( another : BitSet ) : Boolean","body":"= ( until minOf ( bits . size , another . bits . size ) ) . any { bits [ it ] and another . bits [ it ] != }","docstring":"/** Returns true if the specified BitSet has any bits set to true that are also set to true in this BitSet. */"} {"signature":"fun evalUnaryOp ( name : String , type : CompileTimeType , value : Any ) : Any ?","body":"{ when ( type ) { BOOLEAN -> when ( name ) { \"\" -> return ( value as Boolean ) . not ( ) \"\" -> return ( value as Boolean ) . toString ( ) } BYTE -> when ( name ) { \"\" -> return ( value as Byte ) . toByte ( ) \"\" -> return ( value as Byte ) . toChar ( ) \"\" -> return ( value as Byte ) . toDouble ( ) \"\" -> return ( value as Byte ) . toFloat ( ) \"\" -> return ( value as Byte ) . toInt ( ) \"\" -> return ( value as Byte ) . toLong ( ) \"\" -> return ( value as Byte ) . toShort ( ) \"\" -> return ( value as Byte ) . toString ( ) \"\" -> return ( value as Byte ) . unaryMinus ( ) \"\" -> return ( value as Byte ) . unaryPlus ( ) } CHAR -> when ( name ) { \"\" -> return ( value as Char ) . toByte ( ) \"\" -> return ( value as Char ) . toChar ( ) \"\" -> return ( value as Char ) . toDouble ( ) \"\" -> return ( value as Char ) . toFloat ( ) \"\" -> return ( value as Char ) . toInt ( ) \"\" -> return ( value as Char ) . toLong ( ) \"\" -> return ( value as Char ) . toShort ( ) \"\" -> return ( value as Char ) . toString ( ) \"\" -> return ( value as Char ) . code } DOUBLE -> when ( name ) { \"\" -> return ( value as Double ) . toByte ( ) \"\" -> return ( value as Double ) . toChar ( ) \"\" -> return ( value as Double ) . toDouble ( ) \"\" -> return ( value as Double ) . toFloat ( ) \"\" -> return ( value as Double ) . toInt ( ) \"\" -> return ( value as Double ) . toLong ( ) \"\" -> return ( value as Double ) . toShort ( ) \"\" -> return ( value as Double ) . toString ( ) \"\" -> return ( value as Double ) . unaryMinus ( ) \"\" -> return ( value as Double ) . unaryPlus ( ) } FLOAT -> when ( name ) { \"\" -> return ( value as Float ) . toByte ( ) \"\" -> return ( value as Float ) . toChar ( ) \"\" -> return ( value as Float ) . toDouble ( ) \"\" -> return ( value as Float ) . toFloat ( ) \"\" -> return ( value as Float ) . toInt ( ) \"\" -> return ( value as Float ) . toLong ( ) \"\" -> return ( value as Float ) . toShort ( ) \"\" -> return ( value as Float ) . toString ( ) \"\" -> return ( value as Float ) . unaryMinus ( ) \"\" -> return ( value as Float ) . unaryPlus ( ) } INT -> when ( name ) { \"\" -> return ( value as Int ) . inv ( ) \"\" -> return ( value as Int ) . toByte ( ) \"\" -> return ( value as Int ) . toChar ( ) \"\" -> return ( value as Int ) . toDouble ( ) \"\" -> return ( value as Int ) . toFloat ( ) \"\" -> return ( value as Int ) . toInt ( ) \"\" -> return ( value as Int ) . toLong ( ) \"\" -> return ( value as Int ) . toShort ( ) \"\" -> return ( value as Int ) . toString ( ) \"\" -> return ( value as Int ) . unaryMinus ( ) \"\" -> return ( value as Int ) . unaryPlus ( ) } LONG -> when ( name ) { \"\" -> return ( value as Long ) . inv ( ) \"\" -> return ( value as Long ) . toByte ( ) \"\" -> return ( value as Long ) . toChar ( ) \"\" -> return ( value as Long ) . toDouble ( ) \"\" -> return ( value as Long ) . toFloat ( ) \"\" -> return ( value as Long ) . toInt ( ) \"\" -> return ( value as Long ) . toLong ( ) \"\" -> return ( value as Long ) . toShort ( ) \"\" -> return ( value as Long ) . toString ( ) \"\" -> return ( value as Long ) . unaryMinus ( ) \"\" -> return ( value as Long ) . unaryPlus ( ) } SHORT -> when ( name ) { \"\" -> return ( value as Short ) . toByte ( ) \"\" -> return ( value as Short ) . toChar ( ) \"\" -> return ( value as Short ) . toDouble ( ) \"\" -> return ( value as Short ) . toFloat ( ) \"\" -> return ( value as Short ) . toInt ( ) \"\" -> return ( value as Short ) . toLong ( ) \"\" -> return ( value as Short ) . toShort ( ) \"\" -> return ( value as Short ) . toString ( ) \"\" -> return ( value as Short ) . unaryMinus ( ) \"\" -> return ( value as Short ) . unaryPlus ( ) } STRING -> when ( name ) { \"\" -> return ( value as String ) . length \"\" -> return ( value as String ) . toString ( ) } else -> { } } return null }","docstring":"/** This file is generated by `./gradlew generateOperationsMap`. DO NOT MODIFY MANUALLY */"} {"signature":"public fun < E > SendChannel < E > . trySendBlocking ( element : E ) : ChannelResult < Unit >","body":"{ trySend ( element ) . onSuccess { return ChannelResult . success ( Unit ) } return runBlocking { val r = runCatching { send ( element ) } if ( r . isSuccess ) ChannelResult . success ( Unit ) else ChannelResult . closed ( r . exceptionOrNull ( ) ) } }","docstring":"/**\n * Adds [element] to this channel, **blocking** the caller while this channel is full,\n * and returning either [successful][ChannelResult.isSuccess] result when the element was added, or\n * failed result representing closed channel with a corresponding exception.\n *\n * This is a way to call [Channel.send] method in a safe manner inside a blocking code using [runBlocking] and catching,\n * so this function should not be used from coroutine.\n *\n * Example of usage:\n *\n * ```\n * // From callback API\n * channel.trySendBlocking(element)\n * .onSuccess { /* request next element or debug log */ }\n * .onFailure { t: Throwable? -> /* throw or log */ }\n * ```\n *\n * For this operation it is guaranteed that [failure][ChannelResult.failed] always contains an exception in it.\n *\n * @throws `InterruptedException` on JVM if the current thread is interrupted during the blocking send operation.\n */"} {"signature":"@ Deprecated ( level = DeprecationLevel . HIDDEN , message = \"\" + \"\" , replaceWith = ReplaceWith ( \"\" ) ) public fun < E > SendChannel < E > . sendBlocking ( element : E )","body":"{ if ( trySend ( element ) . isSuccess ) return runBlocking { send ( element ) } }","docstring":"/** @suppress */"} {"signature":"internal fun Path . findInPath ( name : String ) : Path ?","body":"= Files . walk ( this ) . use { stream -> stream . asSequence ( ) . find { it . fileName . toString ( ) == name } }","docstring":"/**\n * Find the file with given [name] in current [Path].\n *\n * @return `null` if file is absent in current [Path]\n */"} {"signature":"internal fun createTempDirDeleteOnExit ( prefix : String ) : Path","body":"= Files . createTempDirectory ( prefix ) . apply { toFile ( ) . deleteOnExit ( ) }","docstring":"/**\n * Create a temporary directory that will be cleaned up on normal JVM termination, but will be left on non-zero exit status.\n *\n * Prefer using JUnit5 `@TempDir` over this method when possible.\n */"} {"signature":"internal fun Path . allFilesWithExtension ( ext : String ) : List < Path >","body":"= Files . walk ( this ) . use { stream -> stream . filter { it . extension . equals ( ext , ignoreCase = true ) } . toList ( ) }","docstring":"/**\n * Returns list of all files whose name ends with [ext] extension. The comparison is case-insensitive.\n */"} {"signature":"fun TestProject . sourceFilesRelativeToProject ( expectedSourceFiles : List < String > , sourcesDir : GradleProject . ( ) -> Path = { javaSourcesDir ( ) } , subProjectName : String ? = null ) : Iterable < Path >","body":"{ return expectedSourceFiles . map { if ( subProjectName != null ) { subProject ( subProjectName ) . sourcesDir ( ) . resolve ( it ) } else { sourcesDir ( ) . resolve ( it ) } } . map { it . relativeTo ( projectPath ) } }","docstring":"/**\n * Convert list of [expectedSourceFiles] to relate to [TestProject] paths.\n */"} {"signature":"fun Path . getSingleFileInDir ( relativePath : String ) : Path","body":"{ val path = resolve ( relativePath ) return Files . list ( path ) . use { val files = it . asSequence ( ) . toList ( ) files . singleOrNull ( ) ? : fail ( \"\" ) } }","docstring":"/**\n * Returns a single file located in the [relativePath] subdirectory. If no file or more than one file is found an assertion error will be thrown.\n */"} {"signature":"override suspend fun collect ( collector : FlowCollector < T > ) : Nothing","body":"override suspend fun collect ( collector : FlowCollector < T > ) : Nothing","docstring":"/**\n * Accepts the given [collector] and [emits][FlowCollector.emit] values into it.\n * To emit values from a shared flow into a specific collector, either `collector.emitAll(flow)` or `collect { ... }`\n * SAM-conversion can be used.\n *\n * **A shared flow never completes**. A call to [Flow.collect] or any other terminal operator\n * on a shared flow never completes normally.\n *\n * It is guaranteed that, by the time the first suspension happens, [collect] has already subscribed to the\n * [SharedFlow] and is eligible for receiving emissions. In particular, the following code will always print `1`:\n * ```\n * val flow = MutableSharedFlow()\n * launch(start = CoroutineStart.UNDISPATCHED) {\n * flow.collect { println(1) }\n * }\n * flow.emit(1)\n * ```\n *\n * @see [Flow.collect] for implementation and inheritance details.\n */"} {"signature":"override suspend fun emit ( value : T )","body":"override suspend fun emit ( value : T )","docstring":"/**\n * Emits a [value] to this shared flow, suspending on buffer overflow.\n *\n * This call can suspend only when the [BufferOverflow] strategy is\n * [SUSPEND][BufferOverflow.SUSPEND] **and** there are subscribers collecting this shared flow.\n *\n * If there are no subscribers, the buffer is not used.\n * Instead, the most recently emitted value is simply stored into\n * the replay cache if one was configured, displacing the older elements there,\n * or dropped if no replay cache was configured.\n *\n * See [tryEmit] for a non-suspending variant of this function.\n *\n * This method is **thread-safe** and can be safely invoked from concurrent coroutines without\n * external synchronization.\n */"} {"signature":"public fun tryEmit ( value : T ) : Boolean","body":"public fun tryEmit ( value : T ) : Boolean","docstring":"/**\n * Tries to emit a [value] to this shared flow without suspending. It returns `true` if the value was\n * emitted successfully (see below). When this function returns `false`, it means that a call to a plain [emit]\n * function would suspend until there is buffer space available.\n *\n * This call can return `false` only when the [BufferOverflow] strategy is\n * [SUSPEND][BufferOverflow.SUSPEND] **and** there are subscribers collecting this shared flow.\n *\n * If there are no subscribers, the buffer is not used.\n * Instead, the most recently emitted value is simply stored into\n * the replay cache if one was configured, displacing the older elements there,\n * or dropped if no replay cache was configured. In any case, `tryEmit` returns `true`.\n *\n * This method is **thread-safe** and can be safely invoked from concurrent coroutines without\n * external synchronization.\n */"} {"signature":"@ ExperimentalCoroutinesApi public fun resetReplayCache ( )","body":"@ ExperimentalCoroutinesApi public fun resetReplayCache ( )","docstring":"/**\n * Resets the [replayCache] of this shared flow to an empty state.\n * New subscribers will be receiving only the values that were emitted after this call,\n * while old subscribers will still be receiving previously buffered values.\n * To reset a shared flow to an initial value, emit the value after this call.\n *\n * On a [MutableStateFlow], which always contains a single value, this function is not\n * supported, and throws an [UnsupportedOperationException]. To reset a [MutableStateFlow]\n * to an initial value, just update its [value][MutableStateFlow.value].\n *\n * This method is **thread-safe** and can be safely invoked from concurrent coroutines without\n * external synchronization.\n *\n * **Note: This is an experimental api.** This function may be removed or renamed in the future.\n */"} {"signature":"@ Suppress ( \"\" , \"\" ) public fun < T > MutableSharedFlow ( replay : Int = , extraBufferCapacity : Int = , onBufferOverflow : BufferOverflow = BufferOverflow . SUSPEND ) : MutableSharedFlow < T >","body":"{ require ( replay >= ) { \"\" } require ( extraBufferCapacity >= ) { \"\" } require ( replay > || extraBufferCapacity > || onBufferOverflow == BufferOverflow . SUSPEND ) { \"\" } val bufferCapacity0 = replay + extraBufferCapacity val bufferCapacity = if ( bufferCapacity0 < ) Int . MAX_VALUE else bufferCapacity0 return SharedFlowImpl ( replay , bufferCapacity , onBufferOverflow ) }","docstring":"/**\n * Creates a [MutableSharedFlow] with the given configuration parameters.\n *\n * This function throws [IllegalArgumentException] on unsupported values of parameters or combinations thereof.\n *\n * @param replay the number of values replayed to new subscribers (cannot be negative, defaults to zero).\n * @param extraBufferCapacity the number of values buffered in addition to `replay`.\n * [emit][MutableSharedFlow.emit] does not suspend while there is a buffer space remaining (optional, cannot be negative, defaults to zero).\n * @param onBufferOverflow configures an [emit][MutableSharedFlow.emit] action on buffer overflow. Optional, defaults to\n * [suspending][BufferOverflow.SUSPEND] attempts to emit a value.\n * Values other than [BufferOverflow.SUSPEND] are supported only when `replay > 0` or `extraBufferCapacity > 0`.\n * **Buffer overflow can happen only when there is at least one subscriber that is not ready to accept\n * the new value.** In the absence of subscribers only the most recent [replay] values are stored and\n * the buffer overflow behavior is never triggered and has no effect.\n */"} {"signature":"override suspend fun emit ( value : T )","body":"{ if ( tryEmit ( value ) ) return emitSuspend ( value ) }","docstring":"/**\n * Emits a [value] to this shared flow, suspending on buffer overflow.\n *\n * This call can suspend only when the [BufferOverflow] strategy is\n * [SUSPEND][BufferOverflow.SUSPEND] **and** there are subscribers collecting this shared flow.\n *\n * If there are no subscribers, the buffer is not used.\n * Instead, the most recently emitted value is simply stored into\n * the replay cache if one was configured, displacing the older elements there,\n * or dropped if no replay cache was configured.\n *\n * See [tryEmit] for a non-suspending variant of this function.\n *\n * This method is **thread-safe** and can be safely invoked from concurrent coroutines without\n * external synchronization.\n */"} {"signature":"@ Suppress ( \"\" ) inline fun getOrElse ( key : K , orElse : ( ) -> V ) : V","body":"= when ( val value = map [ key ] ) { null -> orElse ( ) NullValue -> null else -> value } as V","docstring":"/**\n * Get value if it is present in map\n * Execute [orElse] otherwise and return it result,\n * [orElse] can modify the map inside\n */"} {"signature":"fun LexicalScope . getImplicitReceiversHierarchy ( ) : List < ReceiverParameterDescriptor >","body":"= collectFromMeAndParent { if ( it is LexicalScope ) listOfNotNull ( it . implicitReceiver ) + it . contextReceiversGroup else null } . flatten ( )","docstring":"/**\n * Adds receivers to the list in order of locality, so that the closest (the most local) receiver goes first\n */"} {"signature":"public fun < T > publish ( context : CoroutineContext = EmptyCoroutineContext , @ BuilderInference block : suspend ProducerScope < T > . ( ) -> Unit ) : Publisher < T >","body":"{ require ( context [ Job ] === null ) { \"\" + \"\" } return publishInternal ( GlobalScope , context , DEFAULT_HANDLER , block ) }","docstring":"/**\n * Creates a cold reactive [Publisher] that runs a given [block] in a coroutine.\n *\n * Every time the returned flux is subscribed, it starts a new coroutine in the specified [context].\n * The coroutine emits (via [Subscriber.onNext]) values with [send][ProducerScope.send],\n * completes (via [Subscriber.onComplete]) when the coroutine completes or channel is explicitly closed, and emits\n * errors (via [Subscriber.onError]) if the coroutine throws an exception or closes channel with a cause.\n * Unsubscribing cancels the running coroutine.\n *\n * Invocations of [send][ProducerScope.send] are suspended appropriately when subscribers apply back-pressure and to\n * ensure that [onNext][Subscriber.onNext] is not invoked concurrently.\n *\n * Coroutine context can be specified with [context] argument.\n * If the context does not have any dispatcher nor any other [ContinuationInterceptor], then [Dispatchers.Default] is\n * used.\n *\n * **Note: This is an experimental api.** Behaviour of publishers that work as children in a parent scope with respect\n * to cancellation and error handling may change in the future.\n *\n * @throws IllegalArgumentException if the provided [context] contains a [Job] instance.\n */"} {"signature":"@ InternalCoroutinesApi public fun < T > publishInternal ( scope : CoroutineScope , context : CoroutineContext , exceptionOnCancelHandler : ( Throwable , CoroutineContext ) -> Unit , block : suspend ProducerScope < T > . ( ) -> Unit ) : Publisher < T >","body":"= Publisher { subscriber -> if ( subscriber == null ) throw NullPointerException ( \"\" ) val newContext = scope . newCoroutineContext ( context ) val coroutine = PublisherCoroutine ( newContext , subscriber , exceptionOnCancelHandler ) subscriber . onSubscribe ( coroutine ) coroutine . start ( CoroutineStart . DEFAULT , coroutine , block ) }","docstring":"/** @suppress For internal use from other reactive integration modules only */"} {"signature":"private fun doLockedNext ( elem : T ) : Throwable ?","body":"{ if ( elem == null ) { unlockAndCheckCompleted ( ) throw NullPointerException ( \"\" ) } if ( ! isActive ) { unlockAndCheckCompleted ( ) return getCancellationException ( ) } try { subscriber . onNext ( elem ) } catch ( cause : Throwable ) { cancelled = true val causeDelivered = close ( cause ) unlockAndCheckCompleted ( ) return if ( causeDelivered ) { cause } else { exceptionOnCancelHandler ( cause , context ) getCancellationException ( ) } } while ( true ) { val current = _nRequested . value if ( current < ) break if ( current == Long . MAX_VALUE ) break val updated = current - if ( _nRequested . compareAndSet ( current , updated ) ) { if ( updated == ) { return null } break } } unlockAndCheckCompleted ( ) return null }","docstring":"/**\n * Attempts to emit a value to the subscriber and, if back-pressure permits this, unlock the mutex.\n *\n * Requires that the caller has locked the mutex before this invocation.\n *\n * If the channel is closed, returns the corresponding [Throwable]; otherwise, returns `null` to denote success.\n *\n * @throws NullPointerException if the passed element is `null`\n */"} {"signature":"fun < T : Number > exp ( x : KtNDArray < T > ) : KtNDArray < Double >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( x ) )","docstring":"/**\n * Calculate the exponential of all elements in the input array.\n */"} {"signature":"fun < T : Number > expm1 ( x : KtNDArray < T > ) : KtNDArray < Double >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( x ) )","docstring":"/**\n * Calculate exp(x) - 1 for all elements in the array.\n */"} {"signature":"fun < T : Number > exp2 ( x : KtNDArray < T > ) : KtNDArray < Double >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( x ) )","docstring":"/**\n * Calculate 2**p for all p in the input array.\n */"} {"signature":"fun < T : Number > log ( x : KtNDArray < T > ) : KtNDArray < Double >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( x ) )","docstring":"/**\n * Natural logarithm, element-wise.\n */"} {"signature":"fun < T : Number > log10 ( x : KtNDArray < T > ) : KtNDArray < Double >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( x ) )","docstring":"/**\n * Return the base 10 logarithm of the input array, element-wise.\n */"} {"signature":"fun < T : Number > log2 ( x : KtNDArray < T > ) : KtNDArray < Double >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( x ) )","docstring":"/**\n * Base-2 logarithm of x.\n */"} {"signature":"fun < T : Number > log1p ( x : KtNDArray < T > ) : KtNDArray < Double >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( x ) )","docstring":"/**\n * Return the natural logarithm of one plus the input array, element-wise.\n */"} {"signature":"fun < T : Number , E : Number > logaddexp ( x1 : KtNDArray < T > , x2 : KtNDArray < E > ) : KtNDArray < Double >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( x1 , x2 ) )","docstring":"/**\n * Logarithm of the sum of exponentiations of the inputs.\n */"} {"signature":"fun < T : Number , E : Number > logaddexp2 ( x1 : KtNDArray < T > , x2 : KtNDArray < E > ) : KtNDArray < Double >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( x1 , x2 ) )","docstring":"/**\n * Logarithm of the sum of exponentiations of the inputs in base-2.\n */"} {"signature":"@ JvmStatic @ Synchronized internal fun initStatsService ( project : Project )","body":"{ runMetricMethodSafely ( logger , \"\" ) { val gradle = project . gradle val configurationTimePropertiesAccessor = project . configurationTimePropertiesAccessor val statisticsIsEnabled = checkStatisticsEnabled ( gradle , project . providers , configurationTimePropertiesAccessor ) if ( ! statisticsIsEnabled ) { null } else { val registry = kotlinBuildStatsServicesRegistry ? : KotlinBuildStatsServicesRegistry ( ) . also { kotlinBuildStatsServicesRegistry = it } registry . registerServices ( project ) } } }","docstring":"/**\n * Method for creating new instance of [StatisticsValuesConsumer]\n * It could be invoked only when applying Kotlin gradle plugin.\n * When executed, this method checks, whether it is already executed in the current build (whether it was already executed\n * in the same classpath (i.e., with the same version of Kotlin plugin)).\n * If it was not executed, the new instance of StatisticsValuesConsumer is created\n *\n * [closeServices] must be called at the end of the build in order to release resources.\n */"} {"signature":"public fun readOpenApi ( uri : String , name : String , auth : List < AuthorizationValue > ? = null , options : ParseOptions ? = null , extensionProperties : Boolean , generateHelperCompanionObject : Boolean , visibility : MarkerVisibility = MarkerVisibility . IMPLICIT_PUBLIC , ) : Code","body":"{ require ( isOpenApi ( uri ) ) { \"\" } return readOpenApi ( swaggerParseResult = OpenAPIParser ( ) . readLocation ( uri , auth , options ) , name = name , extensionProperties = extensionProperties , visibility = visibility , generateHelperCompanionObject = generateHelperCompanionObject , ) }","docstring":"/** Parse and read OpenApi specification to [DataSchema] interfaces. */"} {"signature":"public fun readOpenApiAsString ( openApiAsString : String , name : String , auth : List < AuthorizationValue > ? = null , options : ParseOptions ? = null , extensionProperties : Boolean , generateHelperCompanionObject : Boolean , visibility : MarkerVisibility = MarkerVisibility . IMPLICIT_PUBLIC , ) : Code","body":"{ require ( isOpenApiStr ( openApiAsString ) ) { \"\" } return readOpenApi ( swaggerParseResult = OpenAPIParser ( ) . readContents ( openApiAsString , auth , options ) , name = name , extensionProperties = extensionProperties , visibility = visibility , generateHelperCompanionObject = generateHelperCompanionObject , ) }","docstring":"/** Parse and read OpenApi specification to [DataSchema] interfaces. */"} {"signature":"private fun readOpenApi ( swaggerParseResult : SwaggerParseResult , name : String , extensionProperties : Boolean , generateHelperCompanionObject : Boolean , visibility : MarkerVisibility = MarkerVisibility . IMPLICIT_PUBLIC , ) : Code","body":"{ val openApi = swaggerParseResult . openAPI ? : error ( \"\" ) val topInterfaceName = ValidFieldName . of ( name ) val result = openApi . components ? . schemas ? . toMap ( ) ? . toMarkers ( topInterfaceName ) ? . toList ( ) ? : emptyList ( ) val codeGenerator = CodeGenerator . create ( useFqNames = true ) fun toCode ( marker : OpenApiMarker ) : Code = codeGenerator . generate ( marker = marker . withVisibility ( visibility ) . withName ( name = marker . name . withoutTopInterfaceName ( topInterfaceName ) , prependTopInterfaceName = false , ) , interfaceMode = when ( marker ) { is OpenApiMarker . Enum -> InterfaceGenerationMode . Enum is OpenApiMarker . Interface -> InterfaceGenerationMode . WithFields is OpenApiMarker . TypeAlias , is OpenApiMarker . MarkerAlias -> InterfaceGenerationMode . TypeAlias } , extensionProperties = false , readDfMethod = if ( marker is OpenApiMarker . Interface ) DefaultReadOpenApiMethod else null , ) . declarations fun Code . merge ( other : Code ) : Code = \"\" fun toExtensionProperties ( marker : OpenApiMarker ) : Code = if ( marker !is OpenApiMarker . Interface ) \"\" else codeGenerator . generate ( marker = marker . withVisibility ( visibility ) , interfaceMode = InterfaceGenerationMode . None , extensionProperties = true , readDfMethod = null , ) . declarations val ( typeAliases , markers ) = result . partition { it is OpenApiMarker . TypeAlias || it is OpenApiMarker . MarkerAlias } val generatedMarkers = markers . map ( :: toCode ) . reduceOrNull ( Code :: merge ) ? : \"\" val generatedTypeAliases = typeAliases . map ( :: toCode ) . reduceOrNull ( Code :: merge ) ? : \"\" val generatedExtensionProperties = if ( ! extensionProperties ) \"\" else result . map ( :: toExtensionProperties ) . reduceOrNull ( Code :: merge ) ? : \"\" val helperCompanionObject = if ( ! generateHelperCompanionObject ) \"\" else { val accessors = markers . filterIsInstance < OpenApiMarker . Interface > ( ) . joinToString ( \"\" ) { \"\" } \"\"\"\"\"\" } return \"\"\"\"\"\" . trimMargin ( ) }","docstring":"/**\n * Converts a parsed OpenAPI specification into [Code] consisting of [DataSchema] interfaces.\n *\n * @param swaggerParseResult the result of parsing an OpenAPI specification, created using [readOpenApi] or [readOpenApiAsString].\n * @param extensionProperties whether to add extension properties to the generated interfaces. This is usually not\n * necessary, since both the KSP- and the Gradle plugin, will add extension properties to the generated code.\n * @param visibility the visibility of the generated marker classes.\n *\n * @return a [Code] object, representing the generated code.\n */"} {"signature":"private fun Map < String , Schema < * > > . toMarkers ( topInterfaceName : ValidFieldName ) : List < OpenApiMarker >","body":"{ val retrievableMarkers = mapValues { ( typeName , value ) -> RetrievableMarker { getRefMarker , produceAdditionalMarker -> value . toMarker ( typeName = typeName , getRefMarker = getRefMarker , produceAdditionalMarker = produceAdditionalMarker , topInterfaceName = topInterfaceName , ) } } . toMutableMap ( ) val markers = mutableMapOf < String , OpenApiMarker > ( ) val getRefMarker = GetRefMarker { MarkerResult . fromNullable ( markers [ it ] ) } while ( retrievableMarkers . isNotEmpty ( ) ) try { retrievableMarkers . entries . first { ( name , retrieveMarker ) -> val additionalMarkers = mutableMapOf < String , OpenApiMarker > ( ) val produceAdditionalMarker = ProduceAdditionalMarker { validName , marker , _ -> var result = ValidFieldName . of ( validName . unquoted ) val baseName = result var attempt = while ( result . quotedIfNeeded in markers || result . quotedIfNeeded in additionalMarkers ) { result = ValidFieldName . of ( baseName . unquoted + ( if ( result . needsQuote ) \"\" else \"\" ) ) attempt ++ } additionalMarkers [ result . quotedIfNeeded ] = marker . withName ( result . quotedIfNeeded ) result . quotedIfNeeded } val res = retrieveMarker ( getRefMarker = getRefMarker , produceAdditionalMarker = produceAdditionalMarker , ) when ( res ) { is MarkerResult . OpenApiMarker -> { markers [ name ] = res . marker markers += additionalMarkers retrievableMarkers -= name true } is MarkerResult . CannotFindRefMarker -> false } } } catch ( e : NoSuchElementException ) { throw IllegalStateException ( \"\" , e , ) } return markers . values . toList ( ) }","docstring":"/**\n * Converts named OpenApi schemas to a list of [OpenApiMarker]s.\n * Will cause an exception for circular references, however they shouldn't occur in OpenApi specs.\n *\n * Some explanation:\n * OpenApi provides schemas for all the types used. For each type, we want to generate a [Marker]\n * (Which can be an interface, enum or typealias). However, the OpenApi schema is not ordered per se,\n * so when we are reading the schema it might be that we have a reference to a (super)type\n * (which are queried using `getRefMarker`) for which we have not yet created a [Marker].\n * In that case, we \"pause\" that one (by returning `CannotFindRefMarker`) and try to read another type schema first.\n * Circular references cannot exist since it's encoded in JSON, so we never get stuck in an infinite loop.\n * When all markers are \"retrieved\" (so turned from a [RetrievableMarker] to a [MarkerResult.OpenApiMarker]),\n * we're done and have converted everything!\n * As for `produceAdditionalMarker`: In OpenAPI not all enums/objects have to be defined as a separate schema.\n * Although recommended, you can still define an object anonymously directly as a type. For this, we have\n * `produceAdditionalMarker` since during the conversion of a schema -> [Marker] we get an additional new [Marker].\n */"} {"signature":"private fun Schema < * > . toMarker ( typeName : String , getRefMarker : GetRefMarker , produceAdditionalMarker : ProduceAdditionalMarker , topInterfaceName : ValidFieldName , required : List < String > = emptyList ( ) , ) : MarkerResult","body":"{ @ Suppress ( \"\" ) val required = ( this . required ? : emptyList ( ) ) + required val nullable = nullable ? : false return when { allOf != null -> { val allOfSchemas = allOf ! ! . associateWith { it . toOpenApiType ( getRefMarker = getRefMarker ) } val requiredFields = ( allOfSchemas . keys . flatMap { it . required ? : emptyList ( ) } + required ) . distinct ( ) val superMarkers = mutableListOf < Marker > ( ) val fields = mutableListOf < GeneratedField > ( ) val additionalPropertyPaths = mutableListOf < JsonPath > ( ) for ( ( schema , openApiTypeResult ) in allOfSchemas ) when ( openApiTypeResult ) { is OpenApiTypeResult . CannotFindRefMarker -> return MarkerResult . CannotFindRefMarker is OpenApiTypeResult . UsingRef -> { val superMarker = openApiTypeResult . marker superMarkers += superMarker additionalPropertyPaths += superMarker . additionalPropertyPaths val allSuperFields = ( superMarker . fields + superMarker . allSuperMarkers . values . flatMap { it . fields } ) . distinctBy { it . fieldName . unquoted } fields += allSuperFields . filter { it . fieldName . unquoted in requiredFields && it . fieldType . isNullable ( ) } . map { generatedFieldOf ( fieldName = it . fieldName , columnName = it . columnName , fieldType = it . fieldType . toNotNullable ( ) , overrides = true , ) } } is OpenApiTypeResult . Enum -> error ( \"\" ) is OpenApiTypeResult . OpenApiType -> { val ( openApiType , nullable ) = openApiTypeResult openApiType as OpenApiType . Object var tempMarker : OpenApiMarker ? = null val fieldTypeResult = openApiType . toFieldType ( schema = schema , schemaName = typeName , nullable = nullable , getRefMarker = getRefMarker , produceAdditionalMarker = { name , marker , isTopLevelObject -> if ( isTopLevelObject ) { tempMarker = marker name . quotedIfNeeded } else { produceAdditionalMarker ( name , marker , false ) } } , required = required , topInterfaceName = topInterfaceName , ) when ( fieldTypeResult ) { is FieldTypeResult . CannotFindRefMarker -> { return MarkerResult . CannotFindRefMarker } is FieldTypeResult . FieldType -> { fields += tempMarker ! ! . fields additionalPropertyPaths += fieldTypeResult . additionalPropertyPaths } } } } MarkerResult . OpenApiMarker ( OpenApiMarker . Interface ( nullable = nullable , name = typeName , fields = fields , superMarkers = superMarkers , additionalPropertyPaths = additionalPropertyPaths , topInterfaceName = topInterfaceName , ) ) } enum != null -> { val openApiTypeResult = toOpenApiType ( getRefMarker = getRefMarker , ) as OpenApiTypeResult . Enum val enumMarker = produceNewEnum ( name = typeName , topInterfaceName = topInterfaceName , values = openApiTypeResult . values , nullable = openApiTypeResult . nullable , produceAdditionalMarker = ProduceAdditionalMarker . NOOP , ) MarkerResult . OpenApiMarker ( enumMarker ) } type == \"\" -> when { properties != null -> { if ( additionalProperties != null && additionalProperties != false ) { println ( \"\" ) } val keyValuePaths = mutableListOf < JsonPath > ( ) val fields = buildList { for ( ( name , property ) in ( properties ? : emptyMap ( ) ) ) { val isRequired = name in required val openApiTypeResult = property . toOpenApiType ( getRefMarker = getRefMarker , ) when ( openApiTypeResult ) { is OpenApiTypeResult . CannotFindRefMarker -> return MarkerResult . CannotFindRefMarker is OpenApiTypeResult . UsingRef -> { keyValuePaths += openApiTypeResult . marker . additionalPropertyPaths . map { it . prepend ( name ) } val validName = ValidFieldName . of ( name . snakeToLowerCamelCase ( ) ) val fieldType = openApiTypeResult . marker . toFieldType ( ) . let { if ( ! isRequired ) it . toNullable ( ) else it } this += generatedFieldOf ( overrides = false , fieldName = validName , columnName = name , fieldType = fieldType , ) } is OpenApiTypeResult . Enum -> { val enumMarker = produceNewEnum ( name = name , topInterfaceName = topInterfaceName , values = openApiTypeResult . values , produceAdditionalMarker = produceAdditionalMarker , nullable = openApiTypeResult . nullable , ) this += generatedFieldOf ( overrides = false , fieldName = ValidFieldName . of ( name . snakeToLowerCamelCase ( ) ) , columnName = name , fieldType = FieldType . ValueFieldType ( typeFqName = enumMarker . name + if ( enumMarker . nullable || ! isRequired ) \"\" else \"\" , ) , ) } is OpenApiTypeResult . OpenApiType -> { val ( openApiType , nullable ) = openApiTypeResult val fieldTypeResult = openApiType . toFieldType ( schema = property , schemaName = name , nullable = nullable , getRefMarker = getRefMarker , produceAdditionalMarker = produceAdditionalMarker , required = required , topInterfaceName = topInterfaceName , ) when ( fieldTypeResult ) { is FieldTypeResult . CannotFindRefMarker -> return MarkerResult . CannotFindRefMarker is FieldTypeResult . FieldType -> { val validName = ValidFieldName . of ( name . snakeToLowerCamelCase ( ) ) keyValuePaths += fieldTypeResult . additionalPropertyPaths . map { it . prepend ( name ) } this += generatedFieldOf ( overrides = false , fieldName = validName , columnName = name , fieldType = fieldTypeResult . fieldType . let { if ( ! isRequired ) it . toNullable ( ) else it } , ) } } } } } } MarkerResult . OpenApiMarker ( OpenApiMarker . Interface ( nullable = nullable , name = typeName , fields = fields , superMarkers = emptyList ( ) , additionalPropertyPaths = keyValuePaths , topInterfaceName = topInterfaceName , ) ) } properties == null && additionalProperties != null && additionalProperties != false -> { val openApiTypeResult = ( additionalProperties as? Schema < * > ) ? . toOpenApiType ( getRefMarker = getRefMarker ) val additionalPropertyPaths = mutableListOf < JsonPath > ( ) val valueType = when ( openApiTypeResult ) { is OpenApiTypeResult . CannotFindRefMarker -> return MarkerResult . CannotFindRefMarker is OpenApiTypeResult . UsingRef -> { val marker = openApiTypeResult . marker additionalPropertyPaths += marker . additionalPropertyPaths . map { it . prependWildcard ( ) } marker . toFieldType ( ) } is OpenApiTypeResult . OpenApiType -> { val fieldTypeResult = openApiTypeResult . openApiType . toFieldType ( schema = this , schemaName = typeName , nullable = openApiTypeResult . nullable , getRefMarker = getRefMarker , produceAdditionalMarker = produceAdditionalMarker , required = required , topInterfaceName = topInterfaceName , ) when ( fieldTypeResult ) { FieldTypeResult . CannotFindRefMarker -> return MarkerResult . CannotFindRefMarker is FieldTypeResult . FieldType -> { additionalPropertyPaths += fieldTypeResult . additionalPropertyPaths . map { it . prependWildcard ( ) } fieldTypeResult . fieldType } } } is OpenApiTypeResult . Enum -> { val enumMarker = produceNewEnum ( name = name , topInterfaceName = topInterfaceName , values = openApiTypeResult . values , produceAdditionalMarker = produceAdditionalMarker , nullable = openApiTypeResult . nullable , ) FieldType . ValueFieldType ( typeFqName = enumMarker . name + if ( enumMarker . nullable ) \"\" else \"\" , ) } null -> FieldType . ValueFieldType ( typeFqName = typeOf < Any ? > ( ) . toString ( ) , ) } MarkerResult . OpenApiMarker ( OpenApiMarker . AdditionalPropertyInterface ( nullable = nullable , valueType = valueType , name = ValidFieldName . of ( typeName ) . quotedIfNeeded , additionalPropertyPaths = additionalPropertyPaths , topInterfaceName = topInterfaceName , ) ) } else -> MarkerResult . OpenApiMarker ( OpenApiMarker . Interface ( nullable = nullable , name = typeName , fields = emptyList ( ) , superMarkers = emptyList ( ) , additionalPropertyPaths = emptyList ( ) , topInterfaceName = topInterfaceName , ) ) } else -> { val openApiTypeResult = toOpenApiType ( getRefMarker = getRefMarker , ) val typeAliasMarker = when ( openApiTypeResult ) { is OpenApiTypeResult . CannotFindRefMarker -> return MarkerResult . CannotFindRefMarker is OpenApiTypeResult . UsingRef -> OpenApiMarker . MarkerAlias ( name = ValidFieldName . of ( typeName ) . quotedIfNeeded , superMarker = openApiTypeResult . marker , topInterfaceName = topInterfaceName , nullable = nullable , ) is OpenApiTypeResult . OpenApiType -> { val typeResult = openApiTypeResult . openApiType . toFieldType ( schema = this , schemaName = typeName , nullable = false , getRefMarker = getRefMarker , produceAdditionalMarker = produceAdditionalMarker , required = required , topInterfaceName = topInterfaceName , ) val superMarkerName = when ( typeResult ) { is FieldTypeResult . CannotFindRefMarker -> return MarkerResult . CannotFindRefMarker is FieldTypeResult . FieldType -> when ( typeResult . fieldType ) { is FieldType . ValueFieldType , is FieldType . GroupFieldType -> typeResult . fieldType . name is FieldType . FrameFieldType -> \"\" } } OpenApiMarker . TypeAlias ( nullable = nullable , name = ValidFieldName . of ( typeName ) . quotedIfNeeded , superMarkerName = superMarkerName , additionalPropertyPaths = typeResult . additionalPropertyPaths , topInterfaceName = topInterfaceName , ) } is OpenApiTypeResult . Enum -> error ( \"\" ) } MarkerResult . OpenApiMarker ( typeAliasMarker ) } } }","docstring":"/**\n * Converts a single OpenApi object type schema to an [OpenApiMarker] if successful.\n *\n * Can handle the following cases:\n * - `allOf:` combining multiple objects into one with inheritance.\n * - `enum:` creating an enum of any type.\n * - `type: object`\n * - `properties:` (`additionalProperties` are ignored) creating an [OpenApiMarker.Interface] using the fields in the properties.\n * - `additionalProperties:` (if `properties` is not present) creating an [OpenApiMarker.AdditionalPropertiesInterface] using the additionalProperties schema as type of `value`.\n * - `type:` if type is something else, generating a type alias for it. This can be a [OpenApiMarker.TypeAlias] or a [OpenApiMarker.MarkerAlias].\n *\n * @param typeName The name of the schema / type to convert.\n * @param getRefMarker Function to retrieve a [Marker] for a given reference name.\n * @param produceAdditionalMarker Function to produce an additional [Marker] on the fly, such as for\n * inline enums/classes in arrays.\n * @param required Optional list of required properties for this schema.\n *\n * @return A [MarkerResult.OpenApiMarker] if successful, otherwise [MarkerResult.CannotFindRefMarker].\n */"} {"signature":"private fun Schema < * > . toOpenApiType ( getRefMarker : GetRefMarker , ) : OpenApiTypeResult","body":"{ val nullable = nullable ? : false if ( `$ref` != null ) { val typeName = `$ref` . takeLastWhile { it != '' } return when ( val it = getRefMarker ( typeName ) ) { is MarkerResult . CannotFindRefMarker -> OpenApiTypeResult . CannotFindRefMarker is MarkerResult . OpenApiMarker -> OpenApiTypeResult . UsingRef ( it . marker ) } } if ( enum != null ) { @ Suppress ( \"\" ) val nullable = enum . any { it == null } return OpenApiTypeResult . Enum ( values = enum . filterNotNull ( ) . map { it . toString ( ) } , nullable = nullable , ) } var openApiType = OpenApiType . fromStringOrNull ( type ) if ( openApiType == null || openApiType is OpenApiType . Any ) { val anyOf = ( ( anyOf ? : emptyList ( ) ) + ( oneOf ? : emptyList ( ) ) ) val anyOfRefs = anyOf . mapNotNull { it . `$ref` } . map { ref -> val typeName = ref . takeLastWhile { it != '' } when ( val it = getRefMarker ( typeName ) ) { is MarkerResult . CannotFindRefMarker -> return OpenApiTypeResult . CannotFindRefMarker is MarkerResult . OpenApiMarker -> it . marker } } val anyOfTypes = anyOf . mapNotNull { it . type } . mapNotNull ( OpenApiType . Companion :: fromStringOrNull ) . distinct ( ) val allTypes = anyOfTypes + anyOfRefs openApiType = when { anyOfTypes . size == && anyOfRefs . isEmpty ( ) -> anyOfTypes . first ( ) anyOfTypes . size == && anyOfRefs . isEmpty ( ) && anyOfTypes . containsAll ( listOf ( OpenApiType . Number , OpenApiType . Integer ) ) -> OpenApiType . Number ! anyOfTypes . any { it . isObject } && anyOfRefs . isEmpty ( ) -> OpenApiType . Any anyOfTypes . isEmpty ( ) && anyOfRefs . size == -> return OpenApiTypeResult . UsingRef ( anyOfRefs . first ( ) ) anyOfTypes . isEmpty ( ) && anyOfRefs . isNotEmpty ( ) -> { val commonSuperMarker = anyOfRefs . map { it . allSuperMarkers . values . toSet ( ) } . reduce ( Set < Marker > :: intersect ) . firstOrNull ( ) as? OpenApiMarker ? if ( commonSuperMarker != null ) { return OpenApiTypeResult . UsingRef ( commonSuperMarker ) } else { OpenApiType . AnyObject } } allTypes . isNotEmpty ( ) && allTypes . all { it . isObject } -> OpenApiType . AnyObject not != null -> OpenApiType . Any else -> OpenApiType . Any } } return OpenApiTypeResult . OpenApiType ( openApiType , nullable ) }","docstring":"/**\n * Converts a single property of an OpenApi type schema to [OpenApiTypeResult] representing a single type for DataFrame.\n * It must either have `$ref`, `type`, `enum`, `oneOf`, `anyOf`, or `not` defined.\n * It can become an [OpenApiType], [OpenApiMarker] reference or unresolved reference (if `$ref:` is set), enum (if `enum:` is set).\n * `anyOf` and `oneOf` types are merged.\n *\n * These results still have to be converted to [FieldType]s to be able to generate [OpenApiMarker]s from it\n * (unless it's a [OpenApiTypeResult.UsingRef] of course).\n *\n * @receiver Single property of an OpenApi type schema to convert.\n * @param getRefMarker function to attempt to resolve a reference.\n * @return [OpenApiTypeResult]\n */"} {"signature":"private fun OpenApiType . toFieldType ( schema : Schema < * > , schemaName : String , nullable : Boolean , getRefMarker : GetRefMarker , produceAdditionalMarker : ProduceAdditionalMarker , required : List < String > , topInterfaceName : ValidFieldName , ) : FieldTypeResult","body":"= when ( this ) { is OpenApiType . Any -> FieldTypeResult . FieldType ( getType ( nullable ) ) is OpenApiType . Boolean -> FieldTypeResult . FieldType ( getType ( nullable ) ) is OpenApiType . Integer -> FieldTypeResult . FieldType ( getType ( nullable = nullable , format = OpenApiIntegerFormat . fromStringOrNull ( schema . format ) , ) ) is OpenApiType . Number -> FieldTypeResult . FieldType ( getType ( nullable = nullable , format = OpenApiNumberFormat . fromStringOrNull ( schema . format ) , ) ) is OpenApiType . String -> FieldTypeResult . FieldType ( getType ( nullable = nullable , format = OpenApiStringFormat . fromStringOrNull ( schema . format ) , ) ) is OpenApiType . AnyObject -> FieldTypeResult . FieldType ( getType ( nullable = nullable , ) ) is OpenApiType . Array -> { schema as ArraySchema if ( schema . items == null ) { FieldTypeResult . FieldType ( getTypeAsList ( nullableArray = nullable , typeFqName = OpenApiType . Any . getType ( nullable = true ) . typeFqName ) ) } else { val arrayTypeResult = schema . items ! ! . toOpenApiType ( getRefMarker = getRefMarker ) when ( arrayTypeResult ) { is OpenApiTypeResult . CannotFindRefMarker -> FieldTypeResult . CannotFindRefMarker is OpenApiTypeResult . UsingRef -> when { arrayTypeResult . marker is OpenApiMarker . AdditionalPropertyInterface -> FieldTypeResult . FieldType ( fieldType = getTypeAsFrameList ( nullable = arrayTypeResult . marker . nullable , nullableArray = nullable , markerName = arrayTypeResult . marker . name , ) , additionalPropertyPaths = arrayTypeResult . marker . additionalPropertyPaths . map { it . prependArrayWithWildcard ( ) } , ) arrayTypeResult . marker . isObject -> FieldTypeResult . FieldType ( fieldType = getTypeAsFrame ( nullable = nullable || arrayTypeResult . marker . nullable , markerName = arrayTypeResult . marker . name , ) , additionalPropertyPaths = arrayTypeResult . marker . additionalPropertyPaths . map { it . prependArrayWithWildcard ( ) } , ) else -> FieldTypeResult . FieldType ( fieldType = getTypeAsList ( nullableArray = nullable || arrayTypeResult . marker . nullable , typeFqName = arrayTypeResult . marker . name , ) , additionalPropertyPaths = arrayTypeResult . marker . additionalPropertyPaths . map { it . prependArrayWithWildcard ( ) } , ) } is OpenApiTypeResult . OpenApiType -> { val arrayTypeSchemaResult = arrayTypeResult . openApiType . toFieldType ( schema = schema . items ! ! , schemaName = schemaName + \"\" , nullable = arrayTypeResult . nullable , getRefMarker = getRefMarker , produceAdditionalMarker = produceAdditionalMarker , required = emptyList ( ) , topInterfaceName = topInterfaceName , ) when ( arrayTypeSchemaResult ) { is FieldTypeResult . CannotFindRefMarker -> FieldTypeResult . CannotFindRefMarker is FieldTypeResult . FieldType -> { val fieldType = arrayTypeSchemaResult . fieldType val additionalPropertyPaths = arrayTypeSchemaResult . additionalPropertyPaths . map { it . prependArrayWithWildcard ( ) } FieldTypeResult . FieldType ( fieldType = when { fieldType is FieldType . GroupFieldType && fieldType . name == typeOf < DataRow < Any > > ( ) . toString ( ) -> getTypeAsFrame ( nullable = nullable , markerName = typeOf < Any > ( ) . toString ( ) , ) fieldType is FieldType . GroupFieldType && fieldType . name == typeOf < DataRow < Any ? > > ( ) . toString ( ) -> getTypeAsFrame ( nullable = nullable , markerName = typeOf < Any ? > ( ) . toString ( ) , ) fieldType is FieldType . GroupFieldType -> getTypeAsFrame ( nullable = nullable , markerName = fieldType . name , ) fieldType is FieldType . FrameFieldType -> getTypeAsList ( nullableArray = nullable , typeFqName = \"\" , ) fieldType is FieldType . ValueFieldType -> getTypeAsList ( nullableArray = nullable , typeFqName = fieldType . name , ) else -> error ( \"\" ) } , additionalPropertyPaths = additionalPropertyPaths , ) } } } is OpenApiTypeResult . Enum -> { val enumMarker = produceNewEnum ( name = schemaName , topInterfaceName = topInterfaceName , values = arrayTypeResult . values , produceAdditionalMarker = produceAdditionalMarker , nullable = arrayTypeResult . nullable , ) FieldTypeResult . FieldType ( getTypeAsList ( nullableArray = nullable , typeFqName = enumMarker . name + if ( enumMarker . nullable ) \"\" else \"\" , ) ) } } } } is OpenApiType . Object -> { val dataFrameSchemaResult = schema . toMarker ( typeName = schemaName . snakeToUpperCamelCase ( ) , getRefMarker = getRefMarker , produceAdditionalMarker = { validName , marker , _ -> produceAdditionalMarker ( validName , marker , isTopLevelObject = false ) } , required = required , topInterfaceName = topInterfaceName , ) when ( dataFrameSchemaResult ) { is MarkerResult . CannotFindRefMarker -> FieldTypeResult . CannotFindRefMarker is MarkerResult . OpenApiMarker -> { val newName = produceAdditionalMarker ( validName = ValidFieldName . of ( schemaName . snakeToUpperCamelCase ( ) ) , marker = dataFrameSchemaResult . marker , isTopLevelObject = true , ) when ( val marker = dataFrameSchemaResult . marker . withName ( newName ) ) { is OpenApiMarker . AdditionalPropertyInterface -> FieldTypeResult . FieldType ( fieldType = OpenApiType . Array . getTypeAsFrame ( nullable = nullable , markerName = marker . name , ) , additionalPropertyPaths = marker . additionalPropertyPaths , ) else -> FieldTypeResult . FieldType ( fieldType = getType ( nullable = nullable , marker = marker , ) , additionalPropertyPaths = marker . additionalPropertyPaths , ) } } } } }","docstring":"/**\n * Converts an [OpenApiType] with [schema] to a [FieldType] if successful.\n *\n * @receiver OpenApiType to convert.\n * @param schema Schema of the property that the [OpenApiType] belongs to.\n * Used to get extra information if needed (for arrays / objects / format etc.).\n * @param schemaName Name of the schema that the property belongs to. Used in the name generation of the\n * additionally produced [Marker]s.\n * @param nullable Whether the [FieldType] is supposed to be nullable.\n * @param getRefMarker Function to attempt to resolve a reference.\n * @param produceAdditionalMarker Function to produce additional [Marker]s if needed.\n * @param required List of required properties. Passed down into child objects.\n * @return [FieldTypeResult]\n */"} {"signature":"fun DokkaPluginParametersContainer . pluginParameters ( pluginFqn : String , configure : DokkaPluginParametersBuilder . ( ) -> Unit )","body":"{ containerWithType ( DokkaPluginParametersBuilder :: class ) . maybeCreate ( pluginFqn ) . configure ( ) }","docstring":"/**\n * Dynamically create some configuration to control the behaviour of a Dokka Plugin.\n *\n * @param[pluginFqn] The fully-qualified name of a Dokka Plugin. For example, the FQN of the\n * [Dokka Base plugin](https://github.com/Kotlin/dokka/tree/master/plugins/base#readme)\n * is `org.jetbrains.dokka.base.DokkaBase`\n */"} {"signature":"private fun File ? . convertToJson ( ) : JsonPrimitive","body":"= JsonPrimitive ( this ? . canonicalFile ? . invariantSeparatorsPath )","docstring":"/** Creates a [JsonPrimitive] from the given [File]. */"} {"signature":"fun createModule ( testModule : TestModule , contextModule : KtTestModule ? , dependencyBinaryRoots : Collection < Path > , testServices : TestServices , project : Project , ) : KtTestModule","body":"fun createModule ( testModule : TestModule , contextModule : KtTestModule ? , dependencyBinaryRoots : Collection < Path > , testServices : TestServices , project : Project , ) : KtTestModule","docstring":"/**\n * Creates a [KtTestModule] for the given [testModule].\n *\n * @param contextModule a module to use as a context module. Some kinds of modules (such as dangling file modules) require a\n * context module. Modules representing code fragments also require a context element. That is why the [KtTestModule] is passed\n * instead of a plain [KtModule][org.jetbrains.kotlin.analysis.project.structure.KtModule].\n * @param dependencyBinaryRoots The binary roots of [testModule]'s binary library dependencies. This allows avoiding unresolved symbol\n * issues when compiling test binary libraries that depend on other test binary libraries.\n */"} {"signature":"fun TestServices . getKtModuleFactoryForTestModule ( testModule : TestModule ) : KtTestModuleFactory","body":"= when ( testModule . explicitTestModuleKind ) { TestModuleKind . Source -> KtSourceTestModuleFactory TestModuleKind . LibraryBinary -> KtLibraryBinaryTestModuleFactory TestModuleKind . LibraryBinaryDecompiled -> KtLibraryBinaryDecompiledTestModuleFactory TestModuleKind . LibrarySource -> KtLibrarySourceTestModuleFactory TestModuleKind . ScriptSource -> KtScriptTestModuleFactory TestModuleKind . CodeFragment -> KtCodeFragmentTestModuleFactory TestModuleKind . NotUnderContentRoot -> error ( \"\" ) else -> ktTestModuleFactory }","docstring":"/**\n * Returns the appropriate [KtTestModuleFactory] to build a [KtModule][org.jetbrains.kotlin.analysis.project.structure.KtModule] for the given\n * [testModule].\n *\n * By default, the [KtTestModuleFactory] registered with these [TestServices] is returned. It may be overruled by the\n * [MODULE_KIND][org.jetbrains.kotlin.analysis.test.framework.AnalysisApiTestDirectives.MODULE_KIND] directive for a specific test module.\n *\n * [DependencyKindModuleStructureTransformer][org.jetbrains.kotlin.analysis.test.framework.services.DependencyKindModuleStructureTransformer]\n * should be used to properly set up the [DependencyKind][org.jetbrains.kotlin.test.model.DependencyKind] for module dependencies.\n *\n * @see org.jetbrains.kotlin.analysis.test.framework.services.DependencyKindModuleStructureTransformer\n */"} {"signature":"private fun ResolveSession . resolveNearestPackageDescriptor ( fqLink : String ) : LazyPackageDescriptor ?","body":"{ val isRootPackage = ! fqLink . contains ( '' ) val supposedPackageName = if ( isRootPackage ) \"\" else fqLink . substringBeforeLast ( \"\" ) val packageDescriptor = this . getPackageFragment ( FqName ( supposedPackageName ) ) if ( packageDescriptor != null ) { return packageDescriptor } dokkaLogger . debug ( \"\" ) if ( isRootPackage ) { return null } return resolveNearestPackageDescriptor ( supposedPackageName . substringBeforeLast ( \"\" ) ) }","docstring":"/**\n * Tries to resolve [fqLink]'s package.\n *\n * Since [fqLink] can be both a link to a top-level function and a link to a function within a class,\n * we cannot tell for sure if [fqLink] contains a class name or not (relying on case letters is error-prone,\n * there are exceptions). But we know for sure that the last element in the link is the function.\n *\n * So we start with what we think is the deepest package path, and if we cannot find a package descriptor\n * for it - we drop one level and try again, until we find something or reach root.\n *\n * This function should also account for links to declarations within the root package (`\"\"`).\n *\n * Here are some examples:\n *\n * Given [fqLink] = `com.example.ClassName.functionName`:\n * 1) First pass, trying to resolve package `com.example.ClassName`. Failure.\n * 2) Second pass, trying to resolve package `com.example`. Success.\n *\n * Given [fqLink] = `com.example.functionName`:\n * 1) First pass, trying to resolve package `com.example`. Success.\n *\n * Given [fqLink] = `ClassName.functionName` (root package):\n * 1) First pass, trying to resolve package `ClassName`. Failure.\n * 2) Second pass, trying to resolve package `\"\"`. Success.\n */"} {"signature":"public inline fun LayerCollectorContext . points ( block : PointsContext . ( ) -> Unit )","body":"{ addLayer ( PointsContext ( this ) . apply ( block ) ) }","docstring":"/**\n * Adds a new `points` layer to the plot.\n *\n * The `points` layer represents observations in your data through individual points in a Cartesian coordinate system.\n *\n * This function provides a context where you can define aesthetic mappings (`aes`) and aesthetic constants for the layer.\n * - Mappings are specified by calling methods that have names corresponding to aesthetic names (`aes`).\n * - Constants are set directly using properties with names that correspond to aesthetics.\n * For positional aesthetics, you can use the `.constant()` method.\n *\n * ## Points Aesthetics\n * * **`x`** - The x-coordinate of the point.\n * * **`y`** - The y-coordinate of the point.\n * * **`color`** - The color of the point.\n * * **`symbol`** - The symbol used to represent the point.\n * * **`size`** - The size of the point.\n * * **`alpha`** - The transparency of the point.\n * * **`fillColor`** - The fill color for symbols that have a fill.\n * * **`stroke`** - width of the shape border. Applied only to the shapes having border.\n *\n * ## Example\n *\n * ```kotlin\n * val months = listOf(\"Jan\", \"Feb\", \"Mar\", \"Apr\", \"May\", \"Jun\")\n * val sales = listOf(10000, 15000, 18000, 25000, 22000, 20000)\n * val customerCounts = listOf(80, 120, 150, 200, 180, 160)\n *\n * plot {\n * points {\n * // Positional mapping\n * x(months) // Categories on the x-axis\n * y(sales) // Numerical values on the y-axis\n *\n * // Non-positional settings\n * color = Color.BLUE // Set a constant color for the points\n * alpha = 0.7 // Set a constant transparency for the points\n * fillColor = Color.GREEN // Set a fill color for the points (for filled symbols)\n * stroke = 3\n *\n * // Map 'customerCounts' to 'size' to represent the number of customers as the size of the point\n * size(customerCounts) {\n * // Additional mapping parameters if necessary\n * // For example, you might want to normalize or scale the sizes\n * }\n * }\n * }\n * ```\n */"} {"signature":"internal fun mean ( tf : Ops , x : Operand < Float > ) : Operand < Float >","body":"{ return mean ( tf , x , null , false ) }","docstring":"/** */"} {"signature":"internal fun mean ( tf : Ops , x : Operand < Float > , axis : Operand < Int > ) : Operand < Float >","body":"{ return mean ( tf , x , axis , false ) }","docstring":"/** */"} {"signature":"internal fun mean ( tf : Ops , x : Operand < Float > , keepDims : Boolean ) : Operand < Float >","body":"{ return mean ( tf , x , null , keepDims ) }","docstring":"/** */"} {"signature":"internal fun mean ( tf : Ops , x : Operand < Float > , axis : Operand < Int > ? , keepDims : Boolean ) : Operand < Float >","body":"{ var localAxis = axis if ( localAxis == null ) { val rank : Int = x . asOutput ( ) . shape ( ) . numDimensions ( ) val ranks = IntArray ( rank ) for ( i in until rank ) { ranks [ i ] = i } localAxis = tf . constant ( ranks ) } return tf . math . mean ( x , localAxis , Mean . keepDims ( keepDims ) ) }","docstring":"/** */"} {"signature":"public fun appendBatch ( batch : Int , lossValue : Double , metricValues : List < Double > )","body":"{ val newEvent = BatchEvent ( batch , lossValue , metricValues ) addNewBatchEvent ( newEvent , batch ) }","docstring":"/**\n * Appends tracked data from one batch event.\n */"} {"signature":"public fun appendBatch ( batchEvent : BatchEvent )","body":"{ addNewBatchEvent ( batchEvent , batchEvent . batchIndex ) }","docstring":"/**\n * Appends one [BatchEvent].\n */"} {"signature":"public fun lastBatchEvent ( ) : BatchEvent","body":"{ return historyByBatch . lastEntry ( ) . value }","docstring":"/**\n * Returns last [BatchEvent]\n */"} {"signature":"fun lenetOnMnistDatasetExportImportToTxt ( )","body":"{ val ( train , test ) = mnist ( ) val ( newTrain , validation ) = train . split ( ) val imageId1 = val imageId2 = val imageId3 = val lenet5 = lenet5 ( ) lenet5 . use { it . compile ( optimizer = Adam ( ) , loss = Losses . SOFT_MAX_CROSS_ENTROPY_WITH_LOGITS , metric = Metrics . ACCURACY ) it . fit ( trainingDataset = newTrain , validationDataset = validation , epochs = EPOCHS , trainBatchSize = TRAINING_BATCH_SIZE , validationBatchSize = TEST_BATCH_SIZE ) println ( it . kGraph ) it . save ( File ( PATH_TO_MODEL ) , writingMode = WritingMode . OVERRIDE ) val prediction = it . predictLabel ( train . getX ( imageId1 ) ) println ( \"\" ) val prediction2 = it . predictLabel ( train . getX ( imageId2 ) ) println ( \"\" ) val prediction3 = it . predictLabel ( train . getX ( imageId3 ) ) println ( \"\" ) val accuracy = it . evaluate ( dataset = test , batchSize = TEST_BATCH_SIZE ) . metrics [ Metrics . ACCURACY ] println ( \"\" ) } val inferenceModel = TensorFlowInferenceModel . load ( File ( PATH_TO_MODEL ) , loadOptimizerState = true ) inferenceModel . use { val prediction = it . predict ( train . getX ( imageId1 ) ) println ( \"\" ) val prediction2 = it . predict ( train . getX ( imageId2 ) ) println ( \"\" ) val prediction3 = it . predict ( train . getX ( imageId3 ) ) println ( \"\" ) var accuracy = val amountOfTestSet = for ( imageId in .. amountOfTestSet ) { val pred = it . predict ( train . getX ( imageId ) ) if ( pred == train . getY ( imageId ) . toInt ( ) ) accuracy += ( / amountOfTestSet ) } println ( \"\" ) } }","docstring":"/**\n * This examples demonstrates model and model weights export and import back:\n * - Model is exported as graph in .pb format, weights are exported in custom (txt) format.\n * - Model is trained on Mnist dataset.\n * - It saves all the data to the project root directory.\n * - [TensorFlowInferenceModel] is created via graph and weights loading.\n * - [TensorFlowInferenceModel] is reshaped and evaluated on first 10'000 images.\n */"} {"signature":"fun main ( ) : Unit","body":"= lenetOnMnistDatasetExportImportToTxt ( )","docstring":"/** */"} {"signature":"public inline fun LayerCollectorContext . area ( block : AreaContext . ( ) -> Unit )","body":"{ addLayer ( AreaContext ( this ) . apply ( block ) ) }","docstring":"/**\n * Adds a new `area` layer to the plot.\n *\n * The `area` layer is designed to visualize an area under a curve in a Cartesian coordinate system.\n * The layer fills the area between the X-axis and the curve defined by the mapped values of X and Y.\n *\n * This function creates a context where you can set aesthetic mappings (`aes`) or aesthetic constants.\n *\n * - Mappings are specified by calling methods that correspond to aesthetic names (`aes`).\n * - Constants are directly assigned using properties with the names corresponding to aesthetics.\n * For positional aesthetics, you can use the `.constant()` method.\n *\n * ## Area Aesthetics\n * * `x` - The X-coordinate of the area.\n * * `y` - The Y-coordinate of the area.\n * * `fillColor` - The fill color of the area.\n * * `alpha` - The transparency of the area.\n * * `borderLine.color` - Color of the area's borderline.\n * * `borderLine.width` - Width of the area's borderline.\n * * `borderLine.type` - Type of the area's borderline.\n *\n * ## Example\n *\n * ```kotlin\n * plot {\n * area {\n * // Positional mapping\n * x(listOf(\"January\", \"February\", \"March\", \"April\", \"May\")) {\n * axis.name = \"months\"\n * }\n * y(listOf(200, 150, 300, 250, 420)) {\n * axis.name = \"sales\"\n * scale = continuous(min = 100, max = 500)\n * }\n *\n * // Non-positional settings\n * alpha = 0.5\n *\n * // Non-positional mapping with constant fillColor\n * fillColor = Color.BLUE\n *\n * // BorderLine settings\n * borderLine {\n * color = Color.BLACK\n * width = 1.5\n * }\n * }\n * }\n * ```\n */"} {"signature":"fun printNewline ( )","body":"= print ( \"\" )","docstring":"/**\n * printNewLine description\n */"} {"signature":"internal fun AttributeContainer . toMap ( ) : Map < Attribute < * > , Any ? >","body":"{ val result = mutableMapOf < Attribute < * > , Any ? > ( ) for ( key in keySet ( ) ) { result [ key ] = getAttribute ( key ) } return result }","docstring":"/**\n * KGP's internal analog of [org.gradle.api.internal.attributes.AttributeContainerInternal.asMap]\n * Can be used to compare attributes\n */"} {"signature":"internal fun < T : Any > HasAttributes . setAttribute ( key : Attribute < T > , value : T )","body":"{ attributes . attribute ( key , value ) }","docstring":"/**\n * Should only be used to configure simple attributes values!\n *\n * When in doubt, prefer lazy method overload.\n */"} {"signature":"internal fun LazyResolvedConfiguration . dependencyArtifactsOrNull ( dependency : ResolvedDependencyResult ) : List < ResolvedArtifactResult > ?","body":"= try { getArtifacts ( dependency ) } catch ( _ : ResolveException ) { null }","docstring":"/**\n * Same as [LazyResolvedConfiguration.getArtifacts] except it returns null for cases when dependency is resolved\n * but artifact is not available. For example when host-specific part of the library is not yet published\n */"} {"signature":"fun < T > Collection < T > . atMostOne ( ) : T ?","body":"{ return when ( size ) { -> null -> this . iterator ( ) . next ( ) else -> throw IllegalArgumentException ( \"\" ) } }","docstring":"/**\n * Returns the single element of the collection if it contains at most one element.\n *\n * If the collection is empty, returns `null`.\n *\n * If the collection contains exactly one element, returns that element.\n *\n * If the collection contains more than one element, throws an exception.\n */"} {"signature":"inline fun < T > Iterable < T > . atMostOne ( predicate : ( T ) -> Boolean ) : T ?","body":"= this . filter ( predicate ) . atMostOne ( )","docstring":"/**\n * Returns at most one element from the iterable that satisfies the given predicate.\n *\n * If there are no elements that satisfy [predicate], returns `null`.\n *\n * If there is exactly one element that satisfies [predicate], returns that element.\n *\n * If there are more such elements, throws an exception.\n */"} {"signature":"protected open fun shouldSkipValidityCheck ( session : SESSION ) : Boolean","body":"= false","docstring":"/**\n * In some cases, it might be legal for a session cache to evict sessions which are still valid. Such sessions would fail the validity\n * check (see [checkSessionsMarkedInvalid]) and should be skipped.\n */"} {"signature":"private inline fun < reified T : FirCallableDeclaration > T . unwrapSubstitutionOverrideIfNeeded ( ) : T ?","body":"{ unwrapUseSiteSubstitutionOverride ( ) ? . let { return it } unwrapInheritanceSubstitutionOverrideIfNeeded ( ) ? . let { return it } return null }","docstring":"/**\n * N.B. This functions lifts only a single layer of SUBSTITUTION_OVERRIDE at a time.\n */"} {"signature":"private inline fun < reified T : FirCallableDeclaration > T . unwrapUseSiteSubstitutionOverride ( ) : T ?","body":"{ val originalDeclaration = originalForSubstitutionOverride ? : return null return originalDeclaration . takeIf { this . origin is FirDeclarationOrigin . SubstitutionOverride . CallSite } }","docstring":"/**\n * Use-site substitution override happens in situations like this:\n *\n * ```\n * interface List { fun get(i: Int): A }\n *\n * fun take(list: List) {\n * list.get(10) // this call\n * }\n * ```\n *\n * In FIR, `List::get` symbol in the example will be a substitution override with a `String` instead of `A`.\n * We want to lift such substitution overrides.\n *\n * @receiver A declaration that needs to be unwrapped.\n * @return An unsubstituted declaration ([originalForSubstitutionOverride]]) if [this] is a use-site substitution override.\n */"} {"signature":"private inline fun < reified T : FirCallableDeclaration > T . unwrapInheritanceSubstitutionOverrideIfNeeded ( ) : T ?","body":"{ val containingClass = getContainingClass ( rootSession ) ? : return null val originalDeclaration = originalForSubstitutionOverride ? : return null val allowedTypeParameters = buildSet { originalDeclaration . typeParameters . mapTo ( this ) { it . symbol . toLookupTag ( ) } containingClass . typeParameters . mapNotNullTo ( this ) { ( it as? FirOuterClassTypeParameterRef ) ? . symbol ? . toLookupTag ( ) } } val usedTypeParameters = collectReferencedTypeParameters ( originalDeclaration ) return if ( allowedTypeParameters . containsAll ( usedTypeParameters ) ) { originalDeclaration } else { null } }","docstring":"/**\n * We want to unwrap a SUBSTITUTION_OVERRIDE wrapper if it doesn't affect the declaration's signature in any way. If the signature\n * is somehow changed, then we want to keep the wrapper.\n *\n * Such substitute overrides happen because of inheritance.\n *\n * If the declaration references only its own type parameters, or parameters from the outer declarations, then\n * we consider that it's signature will not be changed by the SUBSTITUTION_OVERRIDE, so the wrapper can be unwrapped.\n *\n * This have a few caveats when it comes to the inner classes. TODO Provide a reference to some more in-detail description of that.\n *\n * @receiver A declaration that needs to be unwrapped.\n * @return An unsubstituted declaration ([originalForSubstitutionOverride]]) if it exists and if it does not have any change\n * in signature; `null` otherwise.\n */"} {"signature":"fun setupTransform ( project : Project )","body":"{ project . dependencies . artifactTypes . maybeCreate ( KLIB_COLLECTION_DIR ) . also { artifactType -> artifactType . attributes . setAttribute ( attribute , KLIB_COLLECTION_DIR ) } project . dependencies . artifactTypes . maybeCreate ( KLIB ) . also { artifactType -> artifactType . attributes . setAttribute ( attribute , KLIB ) } project . dependencies . registerTransform ( KlibCollectionDirTransform :: class . java ) { transform -> transform . from . setAttribute ( attribute , KLIB_COLLECTION_DIR ) transform . to . setAttribute ( attribute , KLIB ) } }","docstring":"/**\n * Set up a transformation from artifacts of type 'collection dir' to a set of klibs.\n */"} {"signature":"public operator fun plus ( other : Int ) : Pointer","body":"= Pointer ( address + other . toUInt ( ) )","docstring":"/** Adds an [Int] to the address of this [Pointer] */"} {"signature":"public operator fun minus ( other : Int ) : Pointer","body":"= Pointer ( address - other . toUInt ( ) )","docstring":"/** Subtracts an [Int] from the address of this [Pointer] */"} {"signature":"public operator fun plus ( other : UInt ) : Pointer","body":"= Pointer ( address + other )","docstring":"/** Adds an [UInt] to the address of this [Pointer] */"} {"signature":"public operator fun minus ( other : UInt ) : Pointer","body":"= Pointer ( address - other )","docstring":"/** Subtracts an [UInt] from the address of this [Pointer] */"} {"signature":"@ WasmOp ( WasmOp . I32_LOAD8_S ) public fun loadByte ( ) : Byte","body":"= implementedAsIntrinsic","docstring":"/** Load a Byte (8 bit) value */"} {"signature":"@ WasmOp ( WasmOp . I32_LOAD16_S ) public fun loadShort ( ) : Short","body":"= implementedAsIntrinsic","docstring":"/** Load a Short (16 bit) value */"} {"signature":"@ WasmOp ( WasmOp . I32_LOAD ) public fun loadInt ( ) : Int","body":"= implementedAsIntrinsic","docstring":"/** Load an Int (32 bit) value */"} {"signature":"@ WasmOp ( WasmOp . I64_LOAD ) public fun loadLong ( ) : Long","body":"= implementedAsIntrinsic","docstring":"/** Load a Long (64 bit) value */"} {"signature":"@ Suppress ( \"\" ) @ WasmOp ( WasmOp . I32_STORE8 ) public fun storeByte ( value : Byte ) : Unit","body":"= implementedAsIntrinsic","docstring":"/** Store a Byte (8 bit) [value] */"} {"signature":"@ Suppress ( \"\" ) @ WasmOp ( WasmOp . I32_STORE16 ) public fun storeShort ( value : Short ) : Unit","body":"= implementedAsIntrinsic","docstring":"/** Store a Short (16 bit) [value] */"} {"signature":"@ Suppress ( \"\" ) @ WasmOp ( WasmOp . I32_STORE ) public fun storeInt ( value : Int ) : Unit","body":"= implementedAsIntrinsic","docstring":"/** Store an Int (32 bit) [value] */"} {"signature":"@ Suppress ( \"\" ) @ WasmOp ( WasmOp . I64_STORE ) public fun storeLong ( value : Long ) : Unit","body":"= implementedAsIntrinsic","docstring":"/** Store a Long (64 bit) [value] */"} {"signature":"protected abstract fun getSize ( v : InstructionAdapter )","body":"protected abstract fun getSize ( v : InstructionAdapter )","docstring":"/**\n * Stack before: collection\n * Stack after: size\n */"} {"signature":"protected abstract fun getIterator ( v : InstructionAdapter )","body":"protected abstract fun getIterator ( v : InstructionAdapter )","docstring":"/**\n * Stack before: collection\n * Stack after: iterator\n */"} {"signature":"protected abstract fun doWriteValue ( v : InstructionAdapter )","body":"protected abstract fun doWriteValue ( v : InstructionAdapter )","docstring":"/**\n * Stack before: parcel, obj\n * Stack after: \n */"} {"signature":"protected abstract fun doReadValue ( v : InstructionAdapter )","body":"protected abstract fun doReadValue ( v : InstructionAdapter )","docstring":"/**\n * Stack before: collection, parcel\n * Stack after: \n */"} {"signature":"internal fun fromInt ( value : Int )","body":"= Long ( value , if ( value < ) - else )","docstring":"/**\n * Returns a Long representing the given (32-bit) integer value.\n * @param {number} value The 32-bit integer in question.\n * @return {!Kotlin.Long} The corresponding Long value.\n */"} {"signature":"internal fun fromNumber ( value : Double ) : Long","body":"{ if ( value . isNaN ( ) ) { return ZERO ; } else if ( value <= - TWO_PWR_63_DBL_ ) { return MIN_VALUE ; } else if ( value + >= TWO_PWR_63_DBL_ ) { return MAX_VALUE ; } else if ( value < ) { return fromNumber ( - value ) . negate ( ) ; } else { val twoPwr32 = TWO_PWR_32_DBL_ return Long ( jsBitwiseOr ( value . rem ( twoPwr32 ) , ) , jsBitwiseOr ( value / twoPwr32 , ) ) } }","docstring":"/**\n * Converts this [Double] value to [Long].\n * The fractional part, if any, is rounded down towards zero.\n * Returns zero if this `Double` value is `NaN`, [Long.MIN_VALUE] if it's less than `Long.MIN_VALUE`,\n * [Long.MAX_VALUE] if it's bigger than `Long.MAX_VALUE`.\n */"} {"signature":"@ ExperimentalSerializationApi public fun < T > Json . encodeToBufferedSink ( serializer : SerializationStrategy < T > , value : T , sink : BufferedSink )","body":"{ val writer = JsonToOkioStreamWriter ( sink ) try { encodeByWriter ( this , writer , serializer , value ) } finally { writer . release ( ) } }","docstring":"/**\n * Serializes the [value] with [serializer] into a [sink] using JSON format and UTF-8 encoding.\n *\n * @throws [SerializationException] if the given value cannot be serialized to JSON.\n * @throws [okio.IOException] If an I/O error occurs and sink can't be written to.\n */"} {"signature":"@ ExperimentalSerializationApi public inline fun < reified T > Json . encodeToBufferedSink ( value : T , sink : BufferedSink ) : Unit","body":"= encodeToBufferedSink ( serializersModule . serializer ( ) , value , sink )","docstring":"/**\n * Serializes given [value] to a [sink] 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 [okio.IOException] If an I/O error occurs and sink can't be written to.\n */"} {"signature":"@ ExperimentalSerializationApi public fun < T > Json . decodeFromBufferedSource ( deserializer : DeserializationStrategy < T > , source : BufferedSource ) : T","body":"{ return decodeByReader ( this , deserializer , OkioSerialReader ( source ) ) }","docstring":"/**\n * Deserializes JSON from [source] 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 source\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 [okio.IOException] If an I/O error occurs and source can't be read from.\n */"} {"signature":"@ ExperimentalSerializationApi public inline fun < reified T > Json . decodeFromBufferedSource ( source : BufferedSource ) : T","body":"= decodeFromBufferedSource ( serializersModule . serializer ( ) , source )","docstring":"/**\n * Deserializes the contents of given [source] 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 [okio.IOException] If an I/O error occurs and source can't be read from.\n */"} {"signature":"@ ExperimentalSerializationApi public fun < T > Json . decodeBufferedSourceToSequence ( source : BufferedSource , deserializer : DeserializationStrategy < T > , format : DecodeSequenceMode = DecodeSequenceMode . AUTO_DETECT ) : Sequence < T >","body":"{ return decodeToSequenceByReader ( this , OkioSerialReader ( source ) , deserializer , format ) }","docstring":"/**\n * Transforms the given [source] into lazily deserialized sequence of elements of type [T] using UTF-8 encoding and [deserializer].\n * Unlike [decodeFromBufferedSource], [source] 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 [source] 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 source and close it. Moreover, because source is parsed lazily,\n * closing it before returned sequence is evaluated completely will result in [Exception] from decoder.\n *\n * @throws [SerializationException] if the given JSON input cannot be deserialized to the value of type [T].\n * @throws [okio.IOException] If an I/O error occurs and source can't be read from.\n */"} {"signature":"@ ExperimentalSerializationApi public inline fun < reified T > Json . decodeBufferedSourceToSequence ( source : BufferedSource , format : DecodeSequenceMode = DecodeSequenceMode . AUTO_DETECT ) : Sequence < T >","body":"= decodeBufferedSourceToSequence ( source , serializersModule . serializer ( ) , format )","docstring":"/**\n * Transforms the given [source] into lazily deserialized sequence of elements of type [T] using UTF-8 encoding and deserializer retrieved from the reified type parameter.\n * Unlike [decodeFromBufferedSource], [source] 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 [source] when the parsing is finished neither provides method to close it manually.\n * It is a caller responsibility to hold a reference to a source and close it. Moreover, because source is parsed lazily,\n * closing it before returned sequence is evaluated fully would result in [Exception] from decoder.\n *\n * @throws [SerializationException] if the given JSON input cannot be deserialized to the value of type [T].\n * @throws [okio.IOException] If an I/O error occurs and source can't be read from.\n */"} {"signature":"public fun suite ( name : String , ignored : Boolean , suiteFn : ( ) -> Unit )","body":"public fun suite ( name : String , ignored : Boolean , suiteFn : ( ) -> Unit )","docstring":"/**\n * Declares a test suite.\n *\n * @param name the name of the test suite, e.g. a class name\n * @param ignored whether the test suite is ignored, e.g. marked with [Ignore] annotation\n * @param suiteFn defines nested suites by calling [kotlin.test.suite] and tests by calling [kotlin.test.test]\n */"} {"signature":"public fun test ( name : String , ignored : Boolean , testFn : ( ) -> Any ? )","body":"public fun test ( name : String , ignored : Boolean , testFn : ( ) -> Any ? )","docstring":"/**\n * Declares a test.\n *\n * @param name the test name.\n * @param ignored whether the test is ignored\n * @param testFn contains test body invocation\n */"} {"signature":"private fun IrExpressionBody . transformDefaultValue ( originalFunction : IrFunction , newFunction : IrFunction )","body":"{ transformChildrenVoid ( object : IrElementTransformerVoid ( ) { override fun visitGetValue ( expression : IrGetValue ) : IrExpression { val original = super . visitGetValue ( expression ) val valueParameter = ( expression . symbol . owner as? IrValueParameter ) ? : return original val parameterIndex = valueParameter . index if ( parameterIndex < || valueParameter . parent != originalFunction ) { return super . visitGetValue ( expression ) } return irGet ( newFunction . valueParameters [ parameterIndex ] ) } } ) }","docstring":"/**\n * Expressions for default values can use other parameters.\n * In such cases we need to ensure that default values expressions use parameters of the new\n * function (new/copied value parameters).\n *\n * Example:\n * fun Foo(a: String, b: String = a) {...}\n */"} {"signature":"fun additionalTrainingAndNewTopDenseLayers ( )","body":"{ val ( train , test ) = fashionMnist ( ) val jsonConfigFile = getJSONConfigFile ( ) val ( input , otherLayers ) = Sequential . loadModelLayersFromConfiguration ( jsonConfigFile ) val layers = mutableListOf < Layer > ( ) layers . add ( input ) for ( layer in otherLayers ) { if ( layer is Conv2D || layer is MaxPool2D ) { layer . freeze ( ) layers . add ( layer ) } } layers . add ( Flatten ( \"\" ) ) layers . add ( Dense ( name = \"\" , kernelInitializer = HeNormal ( SEED ) , biasInitializer = HeNormal ( SEED ) , outputSize = , activation = Activations . Relu ) ) layers . add ( Dense ( name = \"\" , kernelInitializer = HeNormal ( SEED ) , biasInitializer = HeNormal ( SEED ) , outputSize = , activation = Activations . Relu ) ) layers . add ( Dense ( name = \"\" , kernelInitializer = HeNormal ( SEED ) , biasInitializer = HeNormal ( SEED ) , outputSize = , activation = Activations . Relu ) ) layers . add ( Dense ( name = \"\" , kernelInitializer = HeNormal ( SEED ) , biasInitializer = HeNormal ( SEED ) , outputSize = , activation = Activations . Linear ) ) val model = Sequential . of ( layers ) model . use { it . compile ( optimizer = Adam ( ) , loss = Losses . SOFT_MAX_CROSS_ENTROPY_WITH_LOGITS , metric = Metrics . ACCURACY ) it . logSummary ( ) val hdfFile = getWeightsFile ( ) it . loadWeightsForFrozenLayers ( 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.\n * - Flatten and new Dense layers are added and initialized via defined initializers.\n *\n * NOTE: Model and weights are resources in `examples` module.\n */"} {"signature":"fun main ( ) : Unit","body":"= additionalTrainingAndNewTopDenseLayers ( )","docstring":"/** */"} {"signature":"private fun IrModuleFragment . cleanUpFromExpectDeclarations ( )","body":"{ val languageVersionSettings = myEnvironment . configuration . languageVersionSettings val multiPlatformProjects = languageVersionSettings . getFeatureSupport ( LanguageFeature . MultiPlatformProjects ) if ( multiPlatformProjects != LanguageFeature . State . ENABLED ) return acceptVoid ( object : IrElementVisitorVoid { override fun visitElement ( element : IrElement ) = element . acceptChildrenVoid ( this ) override fun visitPackageFragment ( declaration : IrPackageFragment ) = visitDeclarationContainer ( declaration ) override fun visitClass ( declaration : IrClass ) = visitDeclarationContainer ( declaration ) private fun visitDeclarationContainer ( container : IrDeclarationContainer ) { container . declarations . removeIf ( IrDeclaration :: isExpect ) visitElement ( container ) } } ) }","docstring":"/**\n * In multiplatform projects there may be `expect` declarations. Such declarations do not survive during KLIB serialization.\n * So, it's necessary to explicitly filter them out from the [IrModuleFragment] in order for tests that compare dumped IR\n * before and after serialization to pass successfully.\n */"} {"signature":"private fun Project . applyTransformationToLegacyDependenciesMetadataConfiguration ( configuration : Configuration , transformation : GranularMetadataTransformation )","body":"{ configuration . withDependencies { val ( unrequested , requested ) = transformation . metadataDependencyResolutions . partition { it is MetadataDependencyResolution . Exclude } unrequested . forEach { val ( group , name ) = it . projectDependency ( project ) ? . run { ModuleDependencyIdentifier ( group . toString ( ) , name ) } ? : ModuleIds . fromComponent ( project , it . dependency ) configuration . exclude ( mapOf ( \"\" to group , \"\" to name ) ) } requested . filter { it . dependency !in currentBuild } . forEach { val ( group , name ) = ModuleIds . fromComponent ( project , it . dependency ) val notation = listOfNotNull ( group . orEmpty ( ) , name , it . dependency . moduleVersion ? . version ) . joinToString ( \"\" ) configuration . resolutionStrategy . force ( notation ) } } }","docstring":"/**\n *\n * This method is only intended to be called on deprecated DependenciesMetadata configurations to ensure\n * correct behaviour in import.\n *\n * KGP based dependency resolution is therefore unaffected.\n *\n * Ensure that the [configuration] excludes the dependencies that are classified by this [GranularMetadataTransformation] as\n * [MetadataDependencyResolution.Exclude], and uses exactly the same versions as were resolved for the requested\n * dependencies during the transformation.\n */"} {"signature":"fun aa ( )","body":"{ }","docstring":"/**\n * [aa]\n */"} {"signature":"public fun ModelSummary . print ( out : PrintStream = System . out ) : Unit","body":"= format ( ) . forEach ( out :: println )","docstring":"/**\n * Formats and prints model summary to output stream\n * By defaults prints to console\n */"} {"signature":"public fun ModelWithSummary . printSummary ( out : PrintStream = System . out ) : Unit","body":"= summary ( ) . print ( out )","docstring":"/**\n * Formats and prints model summary to output stream\n * By defaults prints to console\n */"} {"signature":"fun next ( field : Field ) : Field","body":"{ return Field ( field . width , field . height ) { i , j -> val n = field . liveNeighbors ( i , j ) if ( field [ i , j ] ) n in .. else n == } }","docstring":"/**\n * This function takes the present state of the field\n * and return a new field representing the next moment of time\n */"} {"signature":"fun main ( args : Array < String > )","body":"{ printField ( \"\" , ) printField ( \"\"\"\"\"\" , ) printField ( \"\"\"\"\"\" , ) printField ( \"\"\"\"\"\" , ) printField ( \"\"\"\"\"\" , ) printField ( \"\"\"\"\"\" , ) }","docstring":"/** A few colony examples here */"} {"signature":"fun findLongestExistingPackage ( symbolProvider : FirSymbolProvider , fqName : FqName ) : PackageAndClass","body":"{ var currentPackage = fqName val pathSegments = fqName . pathSegments ( ) var prefixSize = pathSegments . size while ( ! currentPackage . isRoot && prefixSize > ) { if ( symbolProvider . getPackage ( currentPackage ) != null ) { break } currentPackage = currentPackage . parent ( ) prefixSize -- } if ( currentPackage == fqName ) return PackageAndClass ( currentPackage , relativeClassFqName = null ) val relativeClassFqName = FqName . fromSegments ( ( prefixSize until pathSegments . size ) . map { pathSegments [ it ] . asString ( ) } ) return PackageAndClass ( currentPackage , relativeClassFqName ) }","docstring":"/**\n * Compared to [resolveToPackageOrClass], does not perform the actual resolve.\n *\n * Instead of it, it just looks for the longest existing package name prefix in the [fqName],\n * and assumes that the rest of the name (if present) is a relative class name.\n *\n * Given that [FqName.ROOT] package is always present in any [FirSymbolProvider],\n * this function **can never fail**.\n */"} {"signature":"private fun String . parseWithNormalisedSpaces ( renderWhiteCharactersAsSpaces : Boolean ) : List < DocTag >","body":"{ if ( ! requiresHtmlEncoding ( ) ) { return parseHtmlEncodedWithNormalisedSpaces ( renderWhiteCharactersAsSpaces ) } return Jsoup . parseBodyFragment ( this ) . body ( ) . wholeText ( ) . parseHtmlEncodedWithNormalisedSpaces ( renderWhiteCharactersAsSpaces ) }","docstring":"/**\n * Parses string into [Text] doc tags that can have either value of the string or html-encoded value with content-type=html parameter.\n * Content type is added when dealing with html entries like ` `\n */"} {"signature":"@ K2Only abstract fun < R > withTypeVariablesThatAreCountedAsProperTypes ( typeVariables : Set < TypeConstructorMarker > , block : ( ) -> R ) : R","body":"@ K2Only abstract fun < R > withTypeVariablesThatAreCountedAsProperTypes ( typeVariables : Set < TypeConstructorMarker > , block : ( ) -> R ) : R","docstring":"/**\n * @see [org.jetbrains.kotlin.resolve.calls.inference.components.VariableFixationFinder.Context.typeVariablesThatAreNotCountedAsProperTypes]\n * @see [org.jetbrains.kotlin.fir.resolve.transformers.body.resolve.FirDeclarationsResolveTransformer.fixInnerVariablesForProvideDelegateIfNeeded]\n */"} {"signature":"fun AppleConfigurables . platformName ( ) : String","body":"= when ( target . family ) { Family . OSX -> \"\" Family . IOS -> if ( targetTriple . isSimulator ) { \"\" } else { \"\" } Family . TVOS -> if ( targetTriple . isSimulator ) { \"\" } else { \"\" } Family . WATCHOS -> if ( targetTriple . isSimulator ) { \"\" } else { \"\" } else -> error ( \"\" ) }","docstring":"/**\n * Name of an Apple platform as in Xcode.app/Contents/Developer/Platforms.\n */"} {"signature":"fun fakeOverrideMember ( superType : IrType , member : IrOverridableMember , clazz : IrClass ) : IrOverridableMember ?","body":"{ return if ( isVisibleForOverrideInClass ( member , clazz ) ) buildFakeOverrideMember ( superType , member , clazz , unimplementedOverridesStrategy ) else null }","docstring":"/**\n * Creates a fake override for [member] from [superType] to be added to the class [clazz] or returns null,\n * if no fake override should be created for this member\n */"} {"signature":"fun postProcessGeneratedFakeOverride ( fakeOverride : IrOverridableMember , clazz : IrClass )","body":"{ unimplementedOverridesStrategy . postProcessGeneratedFakeOverride ( fakeOverride as IrOverridableDeclaration < * > , clazz ) }","docstring":"/**\n * This function is a callback for fake override creation finish.\n *\n * It can modify the created fake override, if needed.\n */"} {"signature":"fun linkFakeOverride ( fakeOverride : IrOverridableMember , compatibilityMode : Boolean )","body":"{ when ( fakeOverride ) { is IrFunctionWithLateBinding -> linkFunctionFakeOverride ( fakeOverride , compatibilityMode ) is IrPropertyWithLateBinding -> linkPropertyFakeOverride ( fakeOverride , compatibilityMode ) else -> error ( \"\" ) } }","docstring":"/**\n * Create a symbol for the fake override.\n */"} {"signature":"abstract fun < R > inFile ( file : IrFile ? , block : ( ) -> R ) : R","body":"abstract fun < R > inFile ( file : IrFile ? , block : ( ) -> R ) : R","docstring":"/**\n * Most implementations need [file] in which they are working now.\n *\n * It should be avoided in the future, but for now it's like this.\n * For now, it's called with class file when class processing is started.\n *\n * Contract:\n * * must call [block] exactly once.\n */"} {"signature":"protected abstract fun linkFunctionFakeOverride ( function : IrFunctionWithLateBinding , manglerCompatibleMode : Boolean )","body":"protected abstract fun linkFunctionFakeOverride ( function : IrFunctionWithLateBinding , manglerCompatibleMode : Boolean )","docstring":"/**\n * Callback for creating a symbol for fake override function.\n *\n * Contract:\n * * [IrFunctionWithLateBinding.acquireSymbol] must be called inside on [function] argument\n */"} {"signature":"protected abstract fun linkPropertyFakeOverride ( property : IrPropertyWithLateBinding , manglerCompatibleMode : Boolean )","body":"protected abstract fun linkPropertyFakeOverride ( property : IrPropertyWithLateBinding , manglerCompatibleMode : Boolean )","docstring":"/**\n * Callback for creating a symbol for fake override property.\n *\n * Also, must create symbols for property's getter and setter.\n *\n * Contract:\n * * [IrPropertyWithLateBinding.acquireSymbol] must be called inside on [property] argument\n * * [IrFunctionWithLateBinding.acquireSymbol] must be called inside on getter and setter of [property] argument, if they exist\n */"} {"signature":"@ Test fun testRunBlockingInTerminatedWorker ( )","body":"{ val workerInRunBlocking = Channel < Unit > ( ) val workerTerminated = Channel < Unit > ( ) val checkResumption = Channel < Unit > ( ) val finished = Channel < Unit > ( ) val worker = Worker . start ( ) worker . executeAfter ( ) { runBlocking { workerInRunBlocking . send ( Unit ) workerTerminated . receive ( ) checkResumption . receive ( ) finished . send ( Unit ) } } runBlocking { workerInRunBlocking . receive ( ) worker . requestTermination ( ) workerTerminated . send ( Unit ) checkResumption . send ( Unit ) finished . receive ( ) } }","docstring":"/**\n * Test that [runBlocking] does not crash after [Worker.requestTermination] is called on the worker that runs it.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalUnsignedTypes :: class ) public fun Random . nextUInt ( ) : UInt","body":"= nextInt ( ) . toUInt ( )","docstring":"/**\n * Gets the next random [UInt] from the random number generator.\n *\n * Generates a [UInt] random value uniformly distributed between [UInt.MIN_VALUE] and [UInt.MAX_VALUE] (inclusive).\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalUnsignedTypes :: class ) public fun Random . nextUInt ( until : UInt ) : UInt","body":"= nextUInt ( , until )","docstring":"/**\n * Gets the next random [UInt] from the random number generator less than the specified [until] bound.\n *\n * Generates a [UInt] random value uniformly distributed between `0` (inclusive) and the specified [until] bound (exclusive).\n *\n * @throws IllegalArgumentException if [until] is zero.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalUnsignedTypes :: class ) public fun Random . nextUInt ( from : UInt , until : UInt ) : UInt","body":"{ checkUIntRangeBounds ( from , until ) val signedFrom = from . toInt ( ) xor Int . MIN_VALUE val signedUntil = until . toInt ( ) xor Int . MIN_VALUE val signedResult = nextInt ( signedFrom , signedUntil ) xor Int . MIN_VALUE return signedResult . toUInt ( ) }","docstring":"/**\n * Gets the next random [UInt] from the random number generator in the specified range.\n *\n * Generates a [UInt] random value uniformly distributed between the specified [from] (inclusive) and [until] (exclusive) bounds.\n *\n * @throws IllegalArgumentException if [from] is greater than or equal to [until].\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalUnsignedTypes :: class ) public fun Random . nextUInt ( range : UIntRange ) : UInt","body":"= when { range . isEmpty ( ) -> throw IllegalArgumentException ( \"\" ) range . last < UInt . MAX_VALUE -> nextUInt ( range . first , range . last + ) range . first > UInt . MIN_VALUE -> nextUInt ( range . first - , range . last ) + else -> nextUInt ( ) }","docstring":"/**\n * Gets the next random [UInt] from the random number generator in the specified [range].\n *\n * Generates a [UInt] random value uniformly distributed in the specified [range]:\n * from `range.start` inclusive to `range.endInclusive` inclusive.\n *\n * @throws IllegalArgumentException if [range] is empty.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalUnsignedTypes :: class ) public fun Random . nextULong ( ) : ULong","body":"= nextLong ( ) . toULong ( )","docstring":"/**\n * Gets the next random [ULong] from the random number generator.\n *\n * Generates a [ULong] random value uniformly distributed between [ULong.MIN_VALUE] and [ULong.MAX_VALUE] (inclusive).\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalUnsignedTypes :: class ) public fun Random . nextULong ( until : ULong ) : ULong","body":"= nextULong ( , until )","docstring":"/**\n * Gets the next random [ULong] from the random number generator less than the specified [until] bound.\n *\n * Generates a [ULong] random value uniformly distributed between `0` (inclusive) and the specified [until] bound (exclusive).\n *\n * @throws IllegalArgumentException if [until] is zero.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalUnsignedTypes :: class ) public fun Random . nextULong ( from : ULong , until : ULong ) : ULong","body":"{ checkULongRangeBounds ( from , until ) val signedFrom = from . toLong ( ) xor Long . MIN_VALUE val signedUntil = until . toLong ( ) xor Long . MIN_VALUE val signedResult = nextLong ( signedFrom , signedUntil ) xor Long . MIN_VALUE return signedResult . toULong ( ) }","docstring":"/**\n * Gets the next random [ULong] from the random number generator in the specified range.\n *\n * Generates a [ULong] random value uniformly distributed between the specified [from] (inclusive) and [until] (exclusive) bounds.\n *\n * @throws IllegalArgumentException if [from] is greater than or equal to [until].\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalUnsignedTypes :: class ) public fun Random . nextULong ( range : ULongRange ) : ULong","body":"= when { range . isEmpty ( ) -> throw IllegalArgumentException ( \"\" ) range . last < ULong . MAX_VALUE -> nextULong ( range . first , range . last + ) range . first > ULong . MIN_VALUE -> nextULong ( range . first - , range . last ) + else -> nextULong ( ) }","docstring":"/**\n * Gets the next random [ULong] from the random number generator in the specified [range].\n *\n * Generates a [ULong] random value uniformly distributed in the specified [range]:\n * from `range.start` inclusive to `range.endInclusive` inclusive.\n *\n * @throws IllegalArgumentException if [range] is empty.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ ExperimentalUnsignedTypes public fun Random . nextUBytes ( array : UByteArray ) : UByteArray","body":"{ nextBytes ( array . asByteArray ( ) ) return array }","docstring":"/**\n * Fills the specified unsigned byte [array] with random bytes and returns it.\n *\n * @return [array] filled with random bytes.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ ExperimentalUnsignedTypes public fun Random . nextUBytes ( size : Int ) : UByteArray","body":"= nextBytes ( size ) . asUByteArray ( )","docstring":"/**\n * Creates an unsigned byte array of the specified [size], filled with random bytes.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ ExperimentalUnsignedTypes public fun Random . nextUBytes ( array : UByteArray , fromIndex : Int = , toIndex : Int = array . size ) : UByteArray","body":"{ nextBytes ( array . asByteArray ( ) , fromIndex , toIndex ) return array }","docstring":"/**\n * Fills a subrange of the specified `UByte` [array] starting from [fromIndex] inclusive and ending [toIndex] exclusive with random UBytes.\n *\n * @return [array] with the subrange filled with random bytes.\n */"} {"signature":"fun sineRegression ( )","body":"{ val ( train , test ) = prepareDataset ( ) . split ( ) model . use { it . compile ( optimizer = Adam ( ) , loss = Losses . MAE , metric = Metrics . MAE ) it . logSummary ( ) it . fit ( dataset = train , epochs = EPOCHS , batchSize = TRAINING_BATCH_SIZE ) val evaluationResult = it . evaluate ( dataset = test , batchSize = TEST_BATCH_SIZE ) println ( \"\" ) println ( \"\" + it . getLayer ( \"\" ) . weights [ \"\" ] . contentDeepToString ( ) ) println ( \"\" + it . getLayer ( \"\" ) . weights [ \"\" ] . contentDeepToString ( ) ) repeat ( ) { id -> val xReal = test . getX ( id ) val yReal = test . getY ( id ) val yPred = it . predictSoftly ( xReal ) println ( \"\" ) } } }","docstring":"/**\n * This example shows how to do regression from scratch, starting from generated dataset, using simple Dense-based [model] with 1 neuron.\n *\n * It includes:\n * - dataset creation\n * - dataset splitting\n * - model compilation\n * - model training\n * - model evaluation\n * - model weights printing\n */"} {"signature":"fun main ( ) : Unit","body":"= sineRegression ( )","docstring":"/** */"} {"signature":"private fun copySourcesToBatch ( src : Array < D > , start : Int , length : Int ) : Pair < Array < FloatArray > , TensorShape >","body":"{ return dataLoader . prepareX ( src , start , length ) }","docstring":"/** Converts [src] to [FloatBuffer] from [start] position for the next [length] positions. */"} {"signature":"private fun copyLabelsToBatch ( src : FloatArray , start : Int , length : Int ) : FloatArray","body":"{ return FloatArray ( length ) { src [ start + it ] } }","docstring":"/** Converts [src] to [FloatBuffer] from [start] position for the next [length] positions. */"} {"signature":"override fun split ( splitRatio : Double ) : Pair < OnFlyImageDataset < D > , OnFlyImageDataset < D > >","body":"{ require ( splitRatio in .. ) { \"\" } val trainDatasetLastIndex = truncate ( x . size * splitRatio ) . toInt ( ) val train = OnFlyImageDataset ( x . copyOfRange ( , trainDatasetLastIndex ) , y . copyOfRange ( , trainDatasetLastIndex ) , dataLoader ) val test = OnFlyImageDataset ( x . copyOfRange ( trainDatasetLastIndex , x . size ) , y . copyOfRange ( trainDatasetLastIndex , y . size ) , dataLoader ) return Pair ( train , test ) }","docstring":"/** Splits datasets on two sub-datasets according [splitRatio].*/"} {"signature":"override fun xSize ( ) : Int","body":"{ return x . size }","docstring":"/** Returns number of data rows. */"} {"signature":"override fun getX ( idx : Int ) : FloatData","body":"{ return dataLoader . load ( x [ idx ] ) }","docstring":"/** Returns row by index [idx]. */"} {"signature":"override fun getY ( idx : Int ) : Float","body":"{ return y [ idx ] }","docstring":"/** Returns label as [FloatArray] by index [idx]. */"} {"signature":"@ JvmStatic public fun toOneHotVector ( numClasses : Int , label : Byte ) : FloatArray","body":"{ val ret = FloatArray ( numClasses ) ret [ label . toInt ( ) and SHIFT_NUMBER ] = return ret }","docstring":"/** Creates binary vector with size [numClasses] from [label]. */"} {"signature":"@ JvmStatic public fun toNormalizedVector ( bytes : ByteArray ) : FloatArray","body":"{ return FloatArray ( bytes . size ) { ( ( bytes [ it ] . toInt ( ) and SHIFT_NUMBER ) ) / } }","docstring":"/** Normalizes [bytes] via division on 255 to get values in range '[0; 1)'.*/"} {"signature":"@ JvmStatic public fun toRawVector ( bytes : ByteArray ) : FloatArray","body":"{ return FloatArray ( bytes . size ) { ( ( bytes [ it ] . toInt ( ) and SHIFT_NUMBER ) . toFloat ( ) ) } }","docstring":"/** Converts [bytes] to [FloatArray]. */"} {"signature":"@ JvmStatic @ Throws ( IOException :: class ) public fun create ( pathToData : File , labels : FloatArray , preprocessing : Operation < BufferedImage , FloatData > = ConvertToFloatArray ( ) ) : OnFlyImageDataset < File >","body":"{ return OnFlyImageDataset ( OnHeapDataset . prepareFileNames ( pathToData ) , labels , preprocessing . fileLoader ( ) ) }","docstring":"/**\n * Create dataset [OnFlyImageDataset] from [pathToData] and [labels] using [preprocessing] to prepare images.\n */"} {"signature":"@ JvmStatic @ Throws ( IOException :: class ) public fun create ( pathToData : File , labelGenerator : LabelGenerator < File > , preprocessing : Operation < BufferedImage , FloatData > = ConvertToFloatArray ( ) ) : OnFlyImageDataset < File >","body":"{ val xFiles = OnHeapDataset . prepareFileNames ( pathToData ) val y = labelGenerator . prepareY ( xFiles ) return OnFlyImageDataset ( xFiles , y , preprocessing . fileLoader ( ) ) }","docstring":"/**\n * Create dataset [OnFlyImageDataset] from [pathToData] and [labelGenerator]\n * using [preprocessing] to prepare images.\n */"} {"signature":"fun BuildResult . assertTasksAreNotInTaskGraph ( vararg taskPaths : String )","body":"{ val presentTasks = taskPaths . filter { task ( it ) != null } assert ( presentTasks . isEmpty ( ) ) { printBuildOutput ( ) val allTaskPaths = taskPaths . joinToString ( prefix = \"\" , postfix = \"\" ) \"\" } }","docstring":"/**\n * Asserts given tasks are not present in the build task graph.\n *\n * (Note: 'not in task graph' has a different meaning to 'not executed'.\n * Tasks with outcomes [TaskOutcome.SKIPPED] and [TaskOutcome.UP_TO_DATE] will be in the task graph, but\n * are not considered 'executed').\n */"} {"signature":"fun BuildResult . findTasksByPattern ( pattern : Regex ) : Set < String >","body":"{ return tasks . map { it . path } . filter { taskPath -> pattern . matches ( taskPath ) } . toSet ( ) }","docstring":"/**\n * Returns all the affected during the build tasks, whose [org.gradle.api.Task.getPath] satisfies the [pattern]\n */"} {"signature":"fun BuildResult . assertTasksExecuted ( vararg taskPaths : String )","body":"{ assertTasksHaveOutcome ( TaskOutcome . SUCCESS , taskPaths . asList ( ) ) }","docstring":"/**\n * Asserts given [taskPaths] have [TaskOutcome.SUCCESS] execution state.\n */"} {"signature":"fun BuildResult . assertAnyTaskHasBeenExecuted ( taskPaths : Set < String > )","body":"{ val taskOutcomes = taskPaths . associateWith { taskPath -> task ( taskPath ) ? . outcome } assert ( taskOutcomes . values . any { it == TaskOutcome . SUCCESS } ) { printBuildOutput ( ) \"\" } }","docstring":"/**\n * Asserts any of [taskPaths] has [TaskOutcome.SUCCESS] execution state.\n */"} {"signature":"fun BuildResult . assertTasksExecuted ( taskPaths : Collection < String > )","body":"{ assertTasksExecuted ( * taskPaths . toTypedArray ( ) ) }","docstring":"/**\n * Asserts given [taskPaths] have [TaskOutcome.SUCCESS] execution state.\n */"} {"signature":"fun BuildResult . assertTasksFailed ( vararg taskPaths : String )","body":"{ assertTasksHaveOutcome ( TaskOutcome . FAILED , taskPaths . asList ( ) ) }","docstring":"/**\n * Asserts given [taskPaths] have [TaskOutcome.FAILED] execution state.\n */"} {"signature":"fun BuildResult . assertTasksUpToDate ( vararg taskPaths : String )","body":"{ assertTasksHaveOutcome ( TaskOutcome . UP_TO_DATE , taskPaths . asList ( ) ) }","docstring":"/**\n * Asserts given [taskPaths] have [TaskOutcome.UP_TO_DATE] execution state.\n */"} {"signature":"fun BuildResult . assertTasksUpToDate ( taskPaths : Collection < String > )","body":"{ assertTasksUpToDate ( * taskPaths . toTypedArray ( ) ) }","docstring":"/**\n * Asserts given [taskPaths] have [TaskOutcome.UP_TO_DATE] execution state.\n */"} {"signature":"fun BuildResult . assertTasksSkipped ( vararg taskPaths : String )","body":"{ assertTasksHaveOutcome ( TaskOutcome . SKIPPED , taskPaths . asList ( ) ) }","docstring":"/**\n * Asserts given [taskPaths] have [TaskOutcome.SKIPPED] execution state.\n */"} {"signature":"fun BuildResult . assertTasksFromCache ( vararg taskPaths : String )","body":"{ assertTasksHaveOutcome ( TaskOutcome . FROM_CACHE , taskPaths . asList ( ) ) }","docstring":"/**\n * Asserts given [taskPaths] have [TaskOutcome.FROM_CACHE] execution state.\n */"} {"signature":"fun BuildResult . assertTasksNoSource ( vararg taskPaths : String )","body":"{ assertTasksHaveOutcome ( TaskOutcome . NO_SOURCE , taskPaths . asList ( ) ) }","docstring":"/**\n * Asserts given [taskPaths] have [TaskOutcome.NO_SOURCE] execution state.\n */"} {"signature":"private fun BuildResult . assertTasksHaveOutcome ( expected : TaskOutcome , taskPaths : Collection < String > )","body":"{ taskPaths . forEach { taskPath -> val task = task ( taskPath ) assertNotNull ( task , \"\" ) assert ( task . outcome == expected ) { printBuildOutput ( ) \"\"\"\"\"\" . trimMargin ( ) } } }","docstring":"/**\n * Asserts given [taskPaths] have [expected] execution state.\n */"} {"signature":"fun BuildResult . assertTasksPackedToCache ( vararg taskPaths : String )","body":"{ taskPaths . forEach { assertOutputContains ( \"\" ) } }","docstring":"/**\n * Assert new cache entry was created for given [taskPaths].\n */"} {"signature":"@ OptIn ( EnvironmentalVariablesOverride :: class ) fun TestProject . buildAndAssertAllTasks ( registeredTasks : List < String > = emptyList ( ) , notRegisteredTasks : List < String > = emptyList ( ) , buildOptions : BuildOptions = this . buildOptions , environmentVariables : EnvironmentalVariables = EnvironmentalVariables ( ) , )","body":"{ build ( \"\" , \"\" , buildOptions = buildOptions , environmentVariables = environmentVariables ) { assertTasksInBuildOutput ( registeredTasks , notRegisteredTasks ) } }","docstring":"/**\n * Builds test project with 'tasks --all' arguments and then\n * asserts that [registeredTasks] of the given tasks have been registered\n * and tasks from the [notRegisteredTasks] list have not been registered.\n *\n * @param registeredTasks The names of the tasks that should have been registered,\n * it could contain task paths as well, but without the first semicolon.\n * @param notRegisteredTasks An optional list of task names that should not have been registered,\n * it could contain task paths as well, but without the first semicolon.\n * @param environmentVariables environmental variables for build process\n * @throws AssertionError if any of the registered tasks do not match the expected task names,\n * or if any of the not-registered tasks were actually registered.\n */"} {"signature":"fun BuildResult . assertTasksInBuildOutput ( expectedPresentTasks : List < String > = emptyList ( ) , expectedAbsentTasks : List < String > = emptyList ( ) , )","body":"{ val registeredTasks = getAllTasksFromTheOutput ( ) expectedPresentTasks . forEach { assert ( registeredTasks . contains ( it ) ) { printBuildOutput ( ) \"\" } } expectedAbsentTasks . forEach { assert ( ! registeredTasks . contains ( it ) ) { printBuildOutput ( ) \"\" } } }","docstring":"/**\n * Inspects the output of the 'tasks' command and asserts that the specified\n * tasks are either present or absent in the output.\n *\n * @param expectedPresentTasks The names of the tasks that should be present in the output,\n * it could contain task paths as well, but without the first semicolon.\n * @param expectedAbsentTasks The names of the tasks that should be absent from the output,\n * it could contain task paths as well, but without the first semicolon.\n * @throws AssertionError if any of the expected present tasks are not present in the output,\n * or if any of the expected absent tasks are present in the output.\n */"} {"signature":"private fun BuildResult . getActualTasksAsString ( ) : String","body":"{ return tasks . joinToString ( \"\" ) { \"\" } }","docstring":"/**\n * Returns printable list of task paths that are in the task graph.\n */"} {"signature":"private fun BuildResult . getAllTasksFromTheOutput ( ) : List < String >","body":"{ val taskPattern = Regex ( \"\" ) val tasks = mutableListOf < String > ( ) output . lines ( ) . forEach { line -> if ( line . matches ( taskPattern ) ) { tasks . add ( taskPattern . find ( line ) ! ! . groupValues [ ] ) } } return tasks }","docstring":"/**\n * Method parses the output of a 'tasks --all' build\n * and returns a list of all the tasks mentioned in it.\n *\n * @return A list of all the tasks mentioned in the build 'tasks -all' output\n * @throws IllegalStateException if the build output could not be parsed.\n */"} {"signature":"override fun equals ( other : Any ? ) : Boolean","body":"{ if ( this === other ) return true if ( javaClass != other ? . javaClass ) return false other as CInteropGist if ( identifier != other . identifier ) return false if ( konanTarget != other . konanTarget ) return false if ( libraryFile != other . libraryFile ) return false if ( dependencies != other . dependencies ) return false if ( allSourceSetNames != other . allSourceSetNames ) return false return true }","docstring":"/** Autogenerated with IDEA */"} {"signature":"override fun hashCode ( ) : Int","body":"{ var result = identifier . hashCode ( ) result = * result + konanTarget . hashCode ( ) result = * result + libraryFile . hashCode ( ) result = * result + dependencies . hashCode ( ) result = * result + allSourceSetNames . hashCode ( ) return result }","docstring":"/** Autogenerated with IDEA */"} {"signature":"fun args ( vararg args : Any )","body":"fun args ( vararg args : Any )","docstring":"/**\n * ## See [JavaExec.args]\n */"} {"signature":"fun args ( args : Iterable < * > )","body":"fun args ( args : Iterable < * > )","docstring":"/**\n * ## See [JavaExec.args]\n */"} {"signature":"fun setArgs ( args : Iterable < * > )","body":"fun setArgs ( args : Iterable < * > )","docstring":"/**\n * ## See [JavaExec.setArgs]\n */"} {"signature":"fun classpath ( vararg paths : Any )","body":"fun classpath ( vararg paths : Any )","docstring":"/**\n * ## See [JavaExec.classpath]\n */"} {"signature":"fun setClasspath ( classpath : FileCollection )","body":"fun setClasspath ( classpath : FileCollection )","docstring":"/**\n * ## See [JavaExec.setClasspath]\n */"} {"signature":"fun classpath ( compilation : KotlinCompilation < * > )","body":"fun classpath ( compilation : KotlinCompilation < * > )","docstring":"/**\n * Adds the runtime classpath of the given [compilation] to this run task\n */"} {"signature":"fun myJvm ( )","body":"= println ( \"\" )","docstring":"/**\n * This function can only be used by JVM consumers\n */"} {"signature":"public fun predict ( inputData : FloatData , inputTensorName : String = input , outputTensorName : String = output ) : Int","body":"{ return predict ( inputData , inputTensorName , outputTensorName ) { result -> result . getLongArray ( ) [ ] . toInt ( ) } }","docstring":"/**\n * Predicts the class of [inputData].\n *\n * @param [inputData] The single example with unknown label.\n * @param [inputTensorName] The name of input tensor.\n * @param [outputTensorName] The name of output tensor.\n * @return Predicted class index.\n */"} {"signature":"public fun input ( inputName : String )","body":"{ input = inputName }","docstring":"/**\n * Setter for the input name.\n */"} {"signature":"public fun output ( outputName : String )","body":"{ output = outputName }","docstring":"/**\n * Setter for the output name.\n */"} {"signature":"public fun graphToString ( ) : String","body":"{ return tfGraph . convertToString ( ) }","docstring":"/** Forms the graph description in string format. */"} {"signature":"public fun copy ( copiedModelName : String ? = null ) : TensorFlowInferenceModel","body":"{ val model = TensorFlowInferenceModel ( tfGraph . copy ( ) ) model . input = input model . output = output if ( copiedModelName != null ) model . name = name copyVariablesToModel ( model , tfGraph . variableNames ( ) ) model . isModelInitialized = true return model }","docstring":"/** Returns a copy of this model. */"} {"signature":"public fun load ( modelDirectory : File , loadOptimizerState : Boolean = false ) : TensorFlowInferenceModel","body":"{ val pathToModelDirectory = modelDirectory . absolutePath if ( ! modelDirectory . exists ( ) ) { throw NotDirectoryException ( pathToModelDirectory ) } val file = File ( \"\" ) if ( ! file . exists ( ) ) throw FileNotFoundException ( \"\" + \"\" ) logger . debug { \"\" } val model = TensorFlowInferenceModel ( deserializeGraph ( file . readBytes ( ) ) ) model . loadVariablesFromTxt ( pathToModelDirectory , loadOptimizerState ) model . isModelInitialized = true logger . debug { \"\" } return model }","docstring":"/**\n * Loads tensorflow graphs and variable data (if required).\n * It loads graph from .pb file format and variable data from .txt files\n *\n * @param [modelDirectory] Path to directory with TensorFlow graph and variable data.\n * @param [loadOptimizerState] Loads optimizer internal variables data, if true.\n */"} {"signature":"@ Test fun testCase ( )","body":"{ var regex : Regex var result : MatchResult ? regex = Regex ( \"\" ) result = regex . find ( \"\" ) assertNotNull ( result ) assertEquals ( \"\" , result ! ! . groupValues [ ] ) assertNull ( result . next ( ) ) regex = Regex ( \"\" , RegexOption . IGNORE_CASE ) result = regex . find ( \"\" ) assertNotNull ( result ) assertEquals ( \"\" , result ! ! . groupValues [ ] ) result = result . next ( ) assertNotNull ( result ) assertEquals ( \"\" , result ! ! . groupValues [ ] ) assertNull ( result . next ( ) ) regex = Regex ( \"\" ) result = regex . find ( \"\" ) assertNotNull ( result ) assertEquals ( \"\" , result ! ! . groupValues [ ] ) result = result . next ( ) assertNotNull ( result ) assertEquals ( \"\" , result ! ! . groupValues [ ] ) assertNull ( result . next ( ) ) }","docstring":"/**\n * Tests Pattern compilation modes and modes triggered in pattern strings\n */"} {"signature":"fun getIntrinsic ( symbol : IrFunctionSymbol ) : IntrinsicMethod ?","body":"fun getIntrinsic ( symbol : IrFunctionSymbol ) : IntrinsicMethod ?","docstring":"/**\n * Returns [IntrinsicMethod] that should emit specific bytecode instead of a regular bytecode for calling [symbol],\n * or `null` if [symbol]'s call should not be replaced.\n */"} {"signature":"fun rewritePluginDefinedOperationMarker ( v : InstructionAdapter , reifiedInsn : AbstractInsnNode , instructions : InsnList , type : IrType ) : Boolean","body":"fun rewritePluginDefinedOperationMarker ( v : InstructionAdapter , reifiedInsn : AbstractInsnNode , instructions : InsnList , type : IrType ) : Boolean","docstring":"/**\n * Allows to process plugin-defined reified operation marker.\n * Reified operation marker is an INVOKESTATIC call to IntrinsicsSupport.reifiedOperationMarker(operationType, typeVariableName) followed\n * by actual operation to be reified.\n * For marker to be determined as plugin-defined, another special call should be inserted directly afterwards the operation.\n * This call is MagicApiIntrinsics.voidMagicApiCall(object). Object should be a string loaded by LDC instruction. Contents of the string is plugin-defined\n * and recommended way to pass data to a plugin.\n *\n * This function must return `true` if marker was processed.\n * If this method returns `false`, other plugins would be queried, and if others also return `false`, a regular intrinsic determined by operationType would be inserted.\n *\n * If marker was processed, this is plugin's responsibility to remove any calls to MagicApiIntrinsics.voidMagicApiCall and its arguments.\n *\n * Example of plugin-defined reified operation marker:\n *\n * ```\n * iconst(6) // operationType=6\n * aconst(T) // typeParamName=T\n * invokestatic(kotlin/jvm/internal/Intrinsics.reifiedOperationMarker)\n * aconst(null) // This is operation to be reified. In case of operationType=6, this is typeOf().\n * // A KType instance would normally be generated on stack instead of null.\n * aconst(\"pluginDataString\") // arbitrary constant string\n * invokestatic(kotlin/jvm/internal/MagicApiIntrinsics.voidMagicApiCall(Ljava/lang/Object;)V) // plugin marker call\n * ```\n *\n * Such approach with two markers was chosen mainly for compatibility reasons:\n * Call to voidMagicApiCall should be inserted directly after operationType-specific instruction (aconst(null) in the example with typeOf).\n * If we form bytecode this way, old compilers would be able to correctly inline normal reified operation here, even if they do not know anything about plugin reifications.\n * They won't remove invokestatic(voidMagicApiCall), but it is not a problem, since kotlin-stdlib has this function, and it is a no-op.\n */"} {"signature":"fun get ( irType : IrType , scope : IrParcelerScope ? , parcelizeType : IrType , strict : Boolean = false , toplevel : Boolean = false ) : IrParcelSerializer","body":"{ fun strict ( ) = strict && ! irType . hasAnnotation ( RAWVALUE_ANNOTATION_FQNAME ) scope . getCustomSerializer ( irType ) ? . let { parceler -> return IrCustomParcelSerializer ( parceler ) } val classifier = irType . erasedUpperBound val classifierFqName = classifier . fqNameWhenAvailable ? . asString ( ) when ( classifierFqName ) { \"\" , \"\" -> return stringSerializer \"\" , \"\" -> return charSequenceSerializer \"\" -> return bundleSerializer \"\" -> return persistableBundleSerializer \"\" , \"\" -> return wrapNullableSerializerIfNeeded ( irType , byteSerializer ) \"\" , \"\" -> return wrapNullableSerializerIfNeeded ( irType , booleanSerializer ) \"\" , \"\" -> return wrapNullableSerializerIfNeeded ( irType , charSerializer ) \"\" , \"\" -> return wrapNullableSerializerIfNeeded ( irType , shortSerializer ) \"\" , \"\" -> return wrapNullableSerializerIfNeeded ( irType , intSerializer ) \"\" , \"\" -> return wrapNullableSerializerIfNeeded ( irType , longSerializer ) \"\" , \"\" -> return wrapNullableSerializerIfNeeded ( irType , floatSerializer ) \"\" , \"\" -> return wrapNullableSerializerIfNeeded ( irType , doubleSerializer ) \"\" -> return wrapNullableSerializerIfNeeded ( irType , fileDescriptorSerializer ) \"\" -> return wrapNullableSerializerIfNeeded ( irType , sizeSerializer ) \"\" -> return wrapNullableSerializerIfNeeded ( irType , sizeFSerializer ) \"\" -> if ( ! scope . hasCustomSerializer ( irBuiltIns . intType ) ) return intArraySerializer \"\" -> if ( ! scope . hasCustomSerializer ( irBuiltIns . booleanType ) ) return booleanArraySerializer \"\" -> if ( ! scope . hasCustomSerializer ( irBuiltIns . byteType ) ) return byteArraySerializer \"\" -> if ( ! scope . hasCustomSerializer ( irBuiltIns . charType ) ) return charArraySerializer \"\" -> if ( ! scope . hasCustomSerializer ( irBuiltIns . floatType ) ) return floatArraySerializer \"\" -> if ( ! scope . hasCustomSerializer ( irBuiltIns . doubleType ) ) return doubleArraySerializer \"\" -> if ( ! scope . hasCustomSerializer ( irBuiltIns . longType ) ) return longArraySerializer \"\" -> if ( ! scope . hasCustomSerializer ( irBuiltIns . booleanType ) ) return sparseBooleanArraySerializer } when ( classifierFqName ) { \"\" , \"\" , \"\" , \"\" , \"\" , \"\" , \"\" , \"\" , \"\" -> { val elementType = irType . getArrayElementType ( irBuiltIns ) if ( ! scope . hasCustomSerializer ( elementType ) ) { when ( elementType . erasedUpperBound . fqNameWhenAvailable ? . asString ( ) ) { \"\" , \"\" -> return stringArraySerializer \"\" -> return iBinderArraySerializer } } val arrayType = if ( classifier . defaultType . isPrimitiveArray ( ) ) classifier . defaultType else irBuiltIns . arrayClass . typeWith ( elementType ) return wrapNullableSerializerIfNeeded ( irType , IrArrayParcelSerializer ( arrayType , elementType , get ( elementType , scope , parcelizeType , strict ( ) ) ) ) } \"\" -> return IrSparseArrayParcelSerializer ( classifier , irBuiltIns . booleanType , get ( irBuiltIns . booleanType , scope , parcelizeType , strict ( ) ) ) \"\" -> return IrSparseArrayParcelSerializer ( classifier , irBuiltIns . intType , get ( irBuiltIns . intType , scope , parcelizeType , strict ( ) ) ) \"\" -> return IrSparseArrayParcelSerializer ( classifier , irBuiltIns . longType , get ( irBuiltIns . longType , scope , parcelizeType , strict ( ) ) ) \"\" -> { val elementType = ( irType as IrSimpleType ) . arguments . single ( ) . upperBound ( irBuiltIns ) return IrSparseArrayParcelSerializer ( classifier , elementType , get ( elementType , scope , parcelizeType , strict ( ) ) ) } \"\" , \"\" , \"\" , \"\" , \"\" , \"\" , \"\" , \"\" , \"\" , \"\" , \"\" , \"\" , \"\" , \"\" , \"\" , \"\" -> { val elementType = ( irType as IrSimpleType ) . arguments . single ( ) . upperBound ( irBuiltIns ) if ( ! scope . hasCustomSerializer ( elementType ) && classifierFqName in setOf ( \"\" , \"\" , \"\" , \"\" , \"\" ) ) { when ( elementType . erasedUpperBound . fqNameWhenAvailable ? . asString ( ) ) { \"\" -> return iBinderListSerializer \"\" , \"\" -> return stringListSerializer } } return wrapNullableSerializerIfNeeded ( irType , IrListParcelSerializer ( classifier , elementType , get ( elementType , scope , parcelizeType , strict ( ) ) ) ) } \"\" , \"\" , \"\" , \"\" , \"\" , \"\" , \"\" , \"\" , \"\" , \"\" , \"\" -> { val keyType = ( irType as IrSimpleType ) . arguments [ ] . upperBound ( irBuiltIns ) val valueType = irType . arguments [ ] . upperBound ( irBuiltIns ) val parceler = IrMapParcelSerializer ( classifier , keyType , valueType , get ( keyType , scope , parcelizeType , strict ( ) ) , get ( valueType , scope , parcelizeType , strict ( ) ) ) return wrapNullableSerializerIfNeeded ( irType , parceler ) } } when { classifier . isSubclassOfFqName ( \"\" ) && ! ( toplevel && ( classifier . isObject || classifier . isEnumClass ) ) -> { return if ( classifier . modality == Modality . FINAL && classifier . psiElement != null && ( classifier . isParcelize || classifier . hasCreatorField ) ) { wrapNullableSerializerIfNeeded ( irType , IrEfficientParcelableParcelSerializer ( classifier ) ) } else { IrGenericParcelableParcelSerializer ( parcelizeType ) } } classifier . isSubclassOfFqName ( \"\" ) -> return iBinderSerializer classifier . isObject -> return IrObjectParcelSerializer ( classifier ) classifier . isEnumClass -> return wrapNullableSerializerIfNeeded ( irType , IrEnumParcelSerializer ( classifier ) ) classifier . isSubclassOfFqName ( \"\" ) || irType . isFunctionTypeOrSubtype ( ) || irType . isSuspendFunctionTypeOrSubtype ( ) -> return serializableSerializer strict ( ) -> throw IllegalArgumentException ( \"\" ) else -> return IrGenericValueParcelSerializer ( parcelizeType ) } }","docstring":"/**\n * Resolve the given [irType] to a corresponding [IrParcelSerializer]. This depends on the TypeParcelers which\n * are currently in [scope], as well as the type of the enclosing Parceleable class [parcelizeType], which is needed\n * to get a class loader for reflection based serialization. Beyond this, we need to know whether to allow\n * using read/writeValue for serialization (if [strict] is false). Beyond this, we need to know whether we are\n * producing parcelers for properties of a Parcelable (if [toplevel] is true), or for a complete Parcelable.\n */"} {"signature":"public fun compareAndSet ( expect : T , update : T ) : Boolean","body":"public fun compareAndSet ( expect : T , update : T ) : Boolean","docstring":"/**\n * Atomically compares the current [value] with [expect] and sets it to [update] if it is equal to [expect].\n * The result is `true` if the [value] was set to [update] and `false` otherwise.\n *\n * This function use a regular comparison using [Any.equals]. If both [expect] and [update] are equal to the\n * current [value], this function returns `true`, but it does not actually change the reference that is\n * stored in the [value].\n *\n * This method is **thread-safe** and can be safely invoked from concurrent coroutines without\n * external synchronization.\n */"} {"signature":"@ Suppress ( \"\" ) public fun < T > MutableStateFlow ( value : T ) : MutableStateFlow < T >","body":"= StateFlowImpl ( value ? : NULL )","docstring":"/**\n * Creates a [MutableStateFlow] with the given initial [value].\n */"} {"signature":"public inline fun < T > MutableStateFlow < T > . updateAndGet ( function : ( T ) -> T ) : T","body":"{ while ( true ) { val prevValue = value val nextValue = function ( prevValue ) if ( compareAndSet ( prevValue , nextValue ) ) { return nextValue } } }","docstring":"/**\n * Updates the [MutableStateFlow.value] atomically using the specified [function] of its value, and returns the new\n * value.\n *\n * [function] may be evaluated multiple times, if [value] is being concurrently updated.\n */"} {"signature":"public inline fun < T > MutableStateFlow < T > . getAndUpdate ( function : ( T ) -> T ) : T","body":"{ while ( true ) { val prevValue = value val nextValue = function ( prevValue ) if ( compareAndSet ( prevValue , nextValue ) ) { return prevValue } } }","docstring":"/**\n * Updates the [MutableStateFlow.value] atomically using the specified [function] of its value, and returns its\n * prior value.\n *\n * [function] may be evaluated multiple times, if [value] is being concurrently updated.\n */"} {"signature":"public inline fun < T > MutableStateFlow < T > . update ( function : ( T ) -> T )","body":"{ while ( true ) { val prevValue = value val nextValue = function ( prevValue ) if ( compareAndSet ( prevValue , nextValue ) ) { return } } }","docstring":"/**\n * Updates the [MutableStateFlow.value] atomically using the specified [function] of its value.\n *\n * [function] may be evaluated multiple times, if [value] is being concurrently updated.\n */"} {"signature":"@ Test fun createZeroFilledByteArray ( )","body":"{ val dim1 = val dim2 = val dim3 = val dim4 = val a = mk . zeros < Byte > ( dim1 , dim2 , dim3 , dim4 ) assertEquals ( dim1 * dim2 * dim3 * dim4 , a . size ) assertEquals ( dim1 * dim2 * dim3 * dim4 , a . data . size ) assertTrue { a . all { it == . toByte ( ) } } }","docstring":"/**\n * This method checks if a byte array of a given size is correctly created with all elements set to zero.\n */"} {"signature":"@ Test fun createByteArrayFilledWithOnes ( )","body":"{ val dim1 = val dim2 = val dim3 = val dim4 = val a = mk . ones < Byte > ( dim1 , dim2 , dim3 , dim4 ) assertEquals ( dim1 * dim2 * dim3 * dim4 , a . size ) assertEquals ( dim1 * dim2 * dim3 * dim4 , a . data . size ) assertTrue { a . all { it == . toByte ( ) } } }","docstring":"/**\n * Creates a byte array filled with ones of a given size and checks if all elements are set to one.\n */"} {"signature":"@ Test fun createFourDimensionalArrayFromByteList ( )","body":"{ val list = listOf ( listOf ( listOf ( listOf < Byte > ( , ) , listOf < Byte > ( , ) ) , listOf ( listOf < Byte > ( , ) , listOf < Byte > ( , ) ) ) ) val a : D4Array < Byte > = mk . ndarray ( list ) assertEquals ( list , a . toListD4 ( ) ) }","docstring":"/**\n * Creates a four-dimensional array from a list of byte lists\n * and checks if the array's list representation matches the input list.\n */"} {"signature":"@ Test fun createFourDimensionalArrayFromByteSet ( )","body":"{ val set = setOf < Byte > ( , , , , , , , , , , - , - ) val shape = intArrayOf ( , , , ) val a : D4Array < Byte > = mk . ndarray ( set , shape = shape ) assertEquals ( set . size , a . size ) assertEquals ( set , a . toSet ( ) ) }","docstring":"/**\n * Creates a four-dimensional array from a set of bytes\n * and checks if the array's set representation matches the input set.\n */"} {"signature":"@ Test fun createFourDimensionalArrayFromPrimitiveByteArray ( )","body":"{ val array = byteArrayOf ( , , , , , , , , , , , ) val a = mk . ndarray ( array , , , , ) assertEquals ( array . size , a . size ) a . data . getByteArray ( ) shouldBe array }","docstring":"/**\n * Creates a four-dimensional array from a primitive ByteArray\n * and checks if the array's ByteArray representation matches the input ByteArray.\n */"} {"signature":"@ Test fun createByte4DArrayWithInitializationFunction ( )","body":"{ val a = mk . d4array < Byte > ( , , , ) { ( it + ) . toByte ( ) } val expected = byteArrayOf ( , , , , , , , , , , , ) assertEquals ( expected . size , a . size ) a . data . getByteArray ( ) shouldBe expected }","docstring":"/**\n * Creates a four-dimensional array with a given size using an initialization function\n * and checks if the array's ByteArray representation matches the expected output.\n */"} {"signature":"@ Test fun createByte4DArrayWithInitAndIndices ( )","body":"{ val a = mk . d4arrayIndices ( , , , ) { i , j , k , l -> ( i * j + k - l ) . toByte ( ) } val expected = byteArrayOf ( , - , , - , , - , , - , , , , ) assertEquals ( expected . size , a . size ) a . data . getByteArray ( ) shouldBe expected }","docstring":"/**\n * Creates a four-dimensional array with a given size using an initialization function and indices.\n * Checks if the array's ByteArray representation matches the expected output.\n */"} {"signature":"@ OptIn ( ExperimentalMultikApi :: class ) @ Test fun createAlignedByte4DArray ( )","body":"{ val list = listOf ( listOf ( listOf ( listOf < Byte > ( , ) , listOf < Byte > ( ) ) , listOf ( listOf < Byte > ( , ) ) ) ) val expected = listOf ( listOf ( listOf ( listOf < Byte > ( , ) , listOf < Byte > ( , ) ) , listOf ( listOf < Byte > ( , ) , listOf < Byte > ( , ) ) ) ) val a : D4Array < Byte > = mk . createAlignedNDArray ( list , filling = ) assertEquals ( expected , a . toListD4 ( ) ) }","docstring":"/**\n * Tests the function 'createAlignedNDArray' that creates a four-dimensional array from a list of number lists.\n * The test asserts that:\n * - The output array's size matches the size of the longest list in the input\n * and all lists are filled to match this length.\n * - The lists shorter than the longest one are filled with the specified filling value.\n */"} {"signature":"@ Test fun createZeroFilledShortArray ( )","body":"{ val dim1 = val dim2 = val dim3 = val dim4 = val a = mk . zeros < Short > ( dim1 , dim2 , dim3 , dim4 ) assertEquals ( dim1 * dim2 * dim3 * dim4 , a . size ) assertEquals ( dim1 * dim2 * dim3 * dim4 , a . data . size ) assertTrue { a . all { it == . toShort ( ) } } }","docstring":"/**\n * This method checks if a short array of a given size is correctly created with all elements set to zero.\n */"} {"signature":"@ Test fun createShortArrayFilledWithOnes ( )","body":"{ val dim1 = val dim2 = val dim3 = val dim4 = val a = mk . ones < Short > ( dim1 , dim2 , dim3 , dim4 ) assertEquals ( dim1 * dim2 * dim3 * dim4 , a . size ) assertEquals ( dim1 * dim2 * dim3 * dim4 , a . data . size ) assertTrue { a . all { it == . toShort ( ) } } }","docstring":"/**\n * Creates a short array filled with ones of a given size and checks if all elements are set to one.\n */"} {"signature":"@ Test fun createFourDimensionalArrayFromShortList ( )","body":"{ val list = listOf ( listOf ( listOf ( listOf < Short > ( , ) , listOf < Short > ( , ) ) , listOf ( listOf < Short > ( , ) , listOf < Short > ( , ) ) ) ) val a : D4Array < Short > = mk . ndarray ( list ) assertEquals ( list , a . toListD4 ( ) ) }","docstring":"/**\n * Creates a four-dimensional array from a list of short lists\n * and checks if the array's list representation matches the input list.\n */"} {"signature":"@ Test @ Ignore fun createFourDimensionalArrayFromShortSet ( )","body":"{ val set = setOf < Short > ( , , , , , , , , , , - , - ) val shape = intArrayOf ( , , , ) val a : D4Array < Short > = mk . ndarray ( set , shape = shape ) assertEquals ( set . size , a . size ) assertEquals ( set , a . toSet ( ) ) }","docstring":"/**\n * Creates a four-dimensional array from a set of shorts\n * and checks if the array's set representation matches the input set.\n */"} {"signature":"@ Test fun createFourDimensionalArrayFromPrimitiveShortArray ( )","body":"{ val array = shortArrayOf ( , , , , , , , , , , , ) val a = mk . ndarray ( array , , , , ) assertEquals ( array . size , a . size ) a . data . getShortArray ( ) shouldBe array }","docstring":"/**\n * Creates a four-dimensional array from a primitive ShortArray\n * and checks if the array's ShortArray representation matches the input ShortArray.\n */"} {"signature":"@ Test fun createShort4DArrayWithInitializationFunction ( )","body":"{ val a = mk . d4array < Short > ( , , , ) { ( it + ) . toShort ( ) } val expected = shortArrayOf ( , , , , , , , , , , , ) assertEquals ( expected . size , a . size ) a . data . getShortArray ( ) shouldBe expected }","docstring":"/**\n * Creates a four-dimensional array with a given size using an initialization function\n * and checks if the array's ShortArray representation matches the expected output.\n */"} {"signature":"@ Test fun createShort4DArrayWithInitAndIndices ( )","body":"{ val a = mk . d4arrayIndices ( , , , ) { i , j , k , l -> ( i * j + k - l ) . toShort ( ) } val expected = shortArrayOf ( , - , , - , , - , , - , , , , ) assertEquals ( expected . size , a . size ) a . data . getShortArray ( ) shouldBe expected }","docstring":"/**\n * Creates a four-dimensional array with a given size using an initialization function and indices.\n * Checks if the array's ShortArray representation matches the expected output.\n */"} {"signature":"@ OptIn ( ExperimentalMultikApi :: class ) @ Test fun createAlignedShort4DArray ( )","body":"{ val list = listOf ( listOf ( listOf ( listOf < Short > ( , ) , listOf < Short > ( ) ) , listOf ( listOf < Short > ( , ) ) ) ) val expected = listOf ( listOf ( listOf ( listOf < Short > ( , ) , listOf < Short > ( , ) ) , listOf ( listOf < Short > ( , ) , listOf < Short > ( , ) ) ) ) val a : D4Array < Short > = mk . createAlignedNDArray ( list , filling = ) assertEquals ( expected , a . toListD4 ( ) ) }","docstring":"/**\n * Tests the function 'createAlignedNDArray' that creates a four-dimensional array from a list of number lists.\n * The test asserts that:\n * - The output array's size matches the size of the longest list in the input\n * and all lists are filled to match this length.\n * - The lists shorter than the longest one are filled with the specified filling value.\n */"} {"signature":"@ Test fun createZeroFilledIntArray ( )","body":"{ val dim1 = val dim2 = val dim3 = val dim4 = val a = mk . zeros < Int > ( dim1 , dim2 , dim3 , dim4 ) assertEquals ( dim1 * dim2 * dim3 * dim4 , a . size ) assertEquals ( dim1 * dim2 * dim3 * dim4 , a . data . size ) assertTrue { a . all { it == } } }","docstring":"/**\n * This method checks if an integer array of a given size is correctly created with all elements set to zero.\n */"} {"signature":"@ Test fun createIntArrayFilledWithOnes ( )","body":"{ val dim1 = val dim2 = val dim3 = val dim4 = val a = mk . ones < Int > ( dim1 , dim2 , dim3 , dim4 ) assertEquals ( dim1 * dim2 * dim3 * dim4 , a . size ) assertEquals ( dim1 * dim2 * dim3 * dim4 , a . data . size ) assertTrue { a . all { it == } } }","docstring":"/**\n * Creates an integer array filled with ones of a given size and checks if all elements are set to one.\n */"} {"signature":"@ Test fun createFourDimensionalArrayFromIntList ( )","body":"{ val list = listOf ( listOf ( listOf ( listOf ( , ) , listOf ( , ) ) , listOf ( listOf ( , ) , listOf ( , ) ) ) ) val a : D4Array < Int > = mk . ndarray ( list ) assertEquals ( list , a . toListD4 ( ) ) }","docstring":"/**\n * Creates a four-dimensional array from a list of integer lists\n * and checks if the array's list representation matches the input list.\n */"} {"signature":"@ Test fun createFourDimensionalArrayFromIntSet ( )","body":"{ val set = setOf ( , , , , , , , , , , - , - ) val shape = intArrayOf ( , , , ) val a : D4Array < Int > = mk . ndarray ( set , shape = shape ) assertEquals ( set . size , a . size ) assertEquals ( set , a . toSet ( ) ) }","docstring":"/**\n * Creates a four-dimensional array from a set of integers\n * and checks if the array's set representation matches the input set.\n */"} {"signature":"@ Test fun createFourDimensionalArrayFromPrimitiveIntArray ( )","body":"{ val array = intArrayOf ( , , , , , , , , , , , ) val a = mk . ndarray ( array , , , , ) assertEquals ( array . size , a . size ) a . data . getIntArray ( ) shouldBe array }","docstring":"/**\n * Creates a four-dimensional array from a primitive IntArray\n * and checks if the array's IntArray representation matches the input IntArray.\n */"} {"signature":"@ Test fun createInt4DArrayWithInitializationFunction ( )","body":"{ val a = mk . d4array < Int > ( , , , ) { ( it + ) } val expected = intArrayOf ( , , , , , , , , , , , ) assertEquals ( expected . size , a . size ) a . data . getIntArray ( ) shouldBe expected }","docstring":"/**\n * Creates a four-dimensional array with a given size using an initialization function\n * and checks if the array's IntArray representation matches the expected output.\n */"} {"signature":"@ Test fun createInt4DArrayWithInitAndIndices ( )","body":"{ val a = mk . d4arrayIndices ( , , , ) { i , j , k , l -> i * j + k - l } val expected = intArrayOf ( , - , , - , , - , , - , , , , ) assertEquals ( expected . size , a . size ) a . data . getIntArray ( ) shouldBe expected }","docstring":"/**\n * Creates a four-dimensional array with a given size using an initialization function and indices.\n * Checks if the array's IntArray representation matches the expected output.\n */"} {"signature":"@ OptIn ( ExperimentalMultikApi :: class ) @ Test fun createAlignedInt4DArray ( )","body":"{ val list = listOf ( listOf ( listOf ( listOf ( , ) , listOf ( ) ) , listOf ( listOf ( , ) ) ) ) val expected = listOf ( listOf ( listOf ( listOf ( , ) , listOf ( , ) ) , listOf ( listOf ( , ) , listOf ( , ) ) ) ) val a : D4Array < Int > = mk . createAlignedNDArray ( list , filling = ) assertEquals ( expected , a . toListD4 ( ) ) }","docstring":"/**\n * Tests the function 'createAlignedNDArray' that creates a four-dimensional array from a list of number lists.\n * The test asserts that:\n * - The output array's size matches the size of the longest list in the input\n * and all lists are filled to match this length.\n * - The lists shorter than the longest one are filled with the specified filling value.\n */"} {"signature":"@ Test fun createZeroFilledLongArray ( )","body":"{ val dim1 = val dim2 = val dim3 = val dim4 = val a = mk . zeros < Long > ( dim1 , dim2 , dim3 , dim4 ) assertEquals ( dim1 * dim2 * dim3 * dim4 , a . size ) assertEquals ( dim1 * dim2 * dim3 * dim4 , a . data . size ) assertTrue { a . all { it == } } }","docstring":"/**\n * This method checks if a long array of a given size is correctly created with all elements set to zero.\n */"} {"signature":"@ Test fun createLongArrayFilledWithOnes ( )","body":"{ val dim1 = val dim2 = val dim3 = val dim4 = val a = mk . ones < Long > ( dim1 , dim2 , dim3 , dim4 ) assertEquals ( dim1 * dim2 * dim3 * dim4 , a . size ) assertEquals ( dim1 * dim2 * dim3 * dim4 , a . data . size ) assertTrue { a . all { it == } } }","docstring":"/**\n * Creates a long array filled with ones of a given size and checks if all elements are set to one.\n */"} {"signature":"@ Test fun createFourDimensionalArrayFromLongList ( )","body":"{ val list = listOf ( listOf ( listOf ( listOf ( , ) , listOf ( , ) ) , listOf ( listOf ( , ) , listOf ( , ) ) ) ) val a : D4Array < Long > = mk . ndarray ( list ) assertEquals ( list , a . toListD4 ( ) ) }","docstring":"/**\n * Creates a four-dimensional array from a list of long lists\n * and checks if the array's list representation matches the input list.\n */"} {"signature":"@ Test fun createFourDimensionalArrayFromLongSet ( )","body":"{ val set = setOf ( , , , , , , , , , , - , - ) val shape = intArrayOf ( , , , ) val a : D4Array < Long > = mk . ndarray ( set , shape = shape ) assertEquals ( set . size , a . size ) assertEquals ( set , a . toSet ( ) ) }","docstring":"/**\n * Creates a four-dimensional array from a set of longs\n * and checks if the array's set representation matches the input set.\n */"} {"signature":"@ Test fun createFourDimensionalArrayFromPrimitiveLongArray ( )","body":"{ val array = longArrayOf ( , , , , , , , , , , , ) val a = mk . ndarray ( array , , , , ) assertEquals ( array . size , a . size ) a . data . getLongArray ( ) shouldBe array }","docstring":"/**\n * Creates a four-dimensional array from a primitive LongArray\n * and checks if the array's LongArray representation matches the input LongArray.\n */"} {"signature":"@ Test fun createLong4DArrayWithInitializationFunction ( )","body":"{ val a = mk . d4array < Long > ( , , , ) { it + } val expected = longArrayOf ( , , , , , , , , , , , ) assertEquals ( expected . size , a . size ) a . data . getLongArray ( ) shouldBe expected }","docstring":"/**\n * Creates a four-dimensional array with a given size using an initialization function\n * and checks if the array's LongArray representation matches the expected output.\n */"} {"signature":"@ Test fun createLong4DArrayWithInitAndIndices ( )","body":"{ val a = mk . d4arrayIndices < Long > ( , , , ) { i , j , k , l -> i * j + k . toLong ( ) - l } val expected = longArrayOf ( , - , , - , , - , , - , , , , ) assertEquals ( expected . size , a . size ) a . data . getLongArray ( ) shouldBe expected }","docstring":"/**\n * Creates a four-dimensional array with a given size using an initialization function and indices.\n * Checks if the array's LongArray representation matches the expected output.\n */"} {"signature":"@ OptIn ( ExperimentalMultikApi :: class ) @ Test fun createAlignedLong4DArray ( )","body":"{ val list = listOf ( listOf ( listOf ( listOf ( , ) , listOf ( ) ) , listOf ( listOf ( , ) ) ) ) val expected = listOf ( listOf ( listOf ( listOf ( , ) , listOf ( , ) ) , listOf ( listOf ( , ) , listOf ( , ) ) ) ) val a : D4Array < Long > = mk . createAlignedNDArray ( list , filling = ) assertEquals ( expected , a . toListD4 ( ) ) }","docstring":"/**\n * Tests the function 'createAlignedNDArray' that creates a four-dimensional array from a list of number lists.\n * The test asserts that:\n * - The output array's size matches the size of the longest list in the input\n * and all lists are filled to match this length.\n * - The lists shorter than the longest one are filled with the specified filling value.\n */"} {"signature":"@ Test fun createZeroFilledFloatArray ( )","body":"{ val dim1 = val dim2 = val dim3 = val dim4 = val a = mk . zeros < Float > ( dim1 , dim2 , dim3 , dim4 ) assertEquals ( dim1 * dim2 * dim3 * dim4 , a . size ) assertEquals ( dim1 * dim2 * dim3 * dim4 , a . data . size ) assertTrue { a . all { it == } } }","docstring":"/**\n * This method checks if a float array of a given size is correctly created with all elements set to zero.\n */"} {"signature":"@ Test fun createFloatArrayFilledWithOnes ( )","body":"{ val dim1 = val dim2 = val dim3 = val dim4 = val a = mk . ones < Float > ( dim1 , dim2 , dim3 , dim4 ) assertEquals ( dim1 * dim2 * dim3 * dim4 , a . size ) assertEquals ( dim1 * dim2 * dim3 * dim4 , a . data . size ) assertTrue { a . all { it == } } }","docstring":"/**\n * Creates a float array filled with ones of a given size and checks if all elements are set to one.\n */"} {"signature":"@ Test fun createFourDimensionalArrayFromFloatList ( )","body":"{ val list = listOf ( listOf ( listOf ( listOf ( , ) , listOf ( , ) ) , listOf ( listOf ( , ) , listOf ( , ) ) ) ) val a : D4Array < Float > = mk . ndarray ( list ) assertEquals ( list , a . toListD4 ( ) ) }","docstring":"/**\n * Creates a four-dimensional array from a list of float lists\n * and checks if the array's list representation matches the input list.\n */"} {"signature":"@ Test fun createFourDimensionalArrayFromFloatSet ( )","body":"{ val set = setOf ( , , , , , , , , , , - , - ) val shape = intArrayOf ( , , , ) val a : D4Array < Float > = mk . ndarray ( set , shape = shape ) assertEquals ( set . size , a . size ) assertEquals ( set , a . toSet ( ) ) }","docstring":"/**\n * Creates a four-dimensional array from a set of floats\n * and checks if the array's set representation matches the input set.\n */"} {"signature":"@ Test fun createFourDimensionalArrayFromPrimitiveFloatArray ( )","body":"{ val array = floatArrayOf ( , , , , , , , , , , , ) val a = mk . ndarray ( array , , , , ) assertEquals ( array . size , a . size ) a . data . getFloatArray ( ) shouldBe array }","docstring":"/**\n * Creates a four-dimensional array from a primitive FloatArray\n * and checks if the array's FloatArray representation matches the input FloatArray.\n */"} {"signature":"@ Test fun createFloat4DArrayWithInitializationFunction ( )","body":"{ val a = mk . d4array < Float > ( , , , ) { it + } val expected = floatArrayOf ( , , , , , , , , , , , ) assertEquals ( expected . size , a . size ) a . data . getFloatArray ( ) shouldBe expected }","docstring":"/**\n * Creates a four-dimensional array with a given size using an initialization function\n * and checks if the array's FloatArray representation matches the expected output.\n */"} {"signature":"@ Test fun createFloat4DArrayWithInitAndIndices ( )","body":"{ val a = mk . d4arrayIndices < Float > ( , , , ) { i , j , k , l -> i * j + k . toFloat ( ) - l } val expected = floatArrayOf ( , - , , - , , - , , - , , , , ) assertEquals ( expected . size , a . size ) a . data . getFloatArray ( ) shouldBe expected }","docstring":"/**\n * Creates a four-dimensional array with a given size using an initialization function and indices.\n * Checks if the array's FloatArray representation matches the expected output.\n */"} {"signature":"@ OptIn ( ExperimentalMultikApi :: class ) @ Test fun createAlignedFloat4DArray ( )","body":"{ val list = listOf ( listOf ( listOf ( listOf ( , ) , listOf ( ) ) , listOf ( listOf ( , ) , ) ) ) val expected = listOf ( listOf ( listOf ( listOf ( , ) , listOf ( , ) ) , listOf ( listOf ( , ) , listOf ( , ) ) ) ) val a : D4Array < Float > = mk . createAlignedNDArray ( list , filling = ) assertEquals ( expected , a . toListD4 ( ) ) }","docstring":"/**\n * Tests the function 'createAlignedNDArray' that creates a four-dimensional array from a list of number lists.\n * The test asserts that:\n * - The output array's size matches the size of the longest list in the input\n * and all lists are filled to match this length.\n * - The lists shorter than the longest one are filled with the specified filling value.\n */"} {"signature":"@ Test fun createZeroFilledDoubleArray ( )","body":"{ val dim1 = val dim2 = val dim3 = val dim4 = val a = mk . zeros < Double > ( dim1 , dim2 , dim3 , dim4 ) assertEquals ( dim1 * dim2 * dim3 * dim4 , a . size ) assertEquals ( dim1 * dim2 * dim3 * dim4 , a . data . size ) assertTrue { a . all { it == } } }","docstring":"/**\n * This method checks if a double array of a given size is correctly created with all elements set to zero.\n */"} {"signature":"@ Test fun createDoubleArrayFilledWithOnes ( )","body":"{ val dim1 = val dim2 = val dim3 = val dim4 = val a = mk . ones < Double > ( dim1 , dim2 , dim3 , dim4 ) assertEquals ( dim1 * dim2 * dim3 * dim4 , a . size ) assertEquals ( dim1 * dim2 * dim3 * dim4 , a . data . size ) assertTrue { a . all { it == } } }","docstring":"/**\n * Creates a double array filled with ones of a given size and checks if all elements are set to one.\n */"} {"signature":"@ Test fun createFourDimensionalArrayFromDoubleList ( )","body":"{ val list = listOf ( listOf ( listOf ( listOf ( , ) , listOf ( , ) ) , listOf ( listOf ( , ) , listOf ( , ) ) ) ) val a : D4Array < Double > = mk . ndarray ( list ) assertEquals ( list , a . toListD4 ( ) ) }","docstring":"/**\n * Creates a four-dimensional array from a list of double lists\n * and checks if the array's list representation matches the input list.\n */"} {"signature":"@ Test fun createFourDimensionalArrayFromDoubleSet ( )","body":"{ val set = setOf ( , , , , , , , , , , - , - ) val shape = intArrayOf ( , , , ) val a : D4Array < Double > = mk . ndarray ( set , shape = shape ) assertEquals ( set . size , a . size ) assertEquals ( set , a . toSet ( ) ) }","docstring":"/**\n * Creates a four-dimensional array from a set of doubles\n * and checks if the array's set representation matches the input set.\n */"} {"signature":"@ Test fun createFourDimensionalArrayFromPrimitiveDoubleArray ( )","body":"{ val array = doubleArrayOf ( , , , , , , , , , , , ) val a = mk . ndarray ( array , , , , ) assertEquals ( array . size , a . size ) a . data . getDoubleArray ( ) shouldBe array }","docstring":"/**\n * Creates a four-dimensional array from a primitive DoubleArray\n * and checks if the array's DoubleArray representation matches the input DoubleArray.\n */"} {"signature":"@ Test fun createDouble4DArrayWithInitializationFunction ( )","body":"{ val a = mk . d4array < Double > ( , , , ) { it + } val expected = doubleArrayOf ( , , , , , , , , , , , ) assertEquals ( expected . size , a . size ) a . data . getDoubleArray ( ) shouldBe expected }","docstring":"/**\n * Creates a four-dimensional array with a given size using an initialization function\n * and checks if the array's DoubleArray representation matches the expected output.\n */"} {"signature":"@ Test fun createDouble4DArrayWithInitAndIndices ( )","body":"{ val a = mk . d4arrayIndices < Double > ( , , , ) { i , j , k , l -> i * j + k . toDouble ( ) - l } val expected = doubleArrayOf ( , - , , - , , - , , - , , , , ) assertEquals ( expected . size , a . size ) a . data . getDoubleArray ( ) shouldBe expected }","docstring":"/**\n * Creates a four-dimensional array with a given size using an initialization function and indices.\n * Checks if the array's DoubleArray representation matches the expected output.\n */"} {"signature":"@ OptIn ( ExperimentalMultikApi :: class ) @ Test fun createAlignedDouble4DArray ( )","body":"{ val list = listOf ( listOf ( listOf ( listOf ( , ) , listOf ( ) ) , listOf ( listOf ( , ) , ) ) ) val expected = listOf ( listOf ( listOf ( listOf ( , ) , listOf ( , ) ) , listOf ( listOf ( , ) , listOf ( , ) ) ) ) val a : D4Array < Double > = mk . createAlignedNDArray ( list , filling = ) assertEquals ( expected , a . toListD4 ( ) ) }","docstring":"/**\n * Tests the function 'createAlignedNDArray' that creates a four-dimensional array from a list of number lists.\n * The test asserts that:\n * - The output array's size matches the size of the longest list in the input\n * and all lists are filled to match this length.\n * - The lists shorter than the longest one are filled with the specified filling value.\n */"} {"signature":"@ Test fun createZeroFilledComplexFloatArray ( )","body":"{ val dim1 = val dim2 = val dim3 = val dim4 = val a = mk . zeros < ComplexFloat > ( dim1 , dim2 , dim3 , dim4 ) assertEquals ( dim1 * dim2 * dim3 * dim4 , a . size ) assertEquals ( dim1 * dim2 * dim3 * dim4 , a . data . size ) assertTrue { a . all { it == ComplexFloat . zero } } }","docstring":"/**\n * This method checks if a ComplexFloat array of a given size is correctly created with all elements set to zero.\n */"} {"signature":"@ Test fun createComplexFloatArrayFilledWithOnes ( )","body":"{ val dim1 = val dim2 = val dim3 = val dim4 = val a = mk . ones < ComplexFloat > ( dim1 , dim2 , dim3 , dim4 ) assertEquals ( dim1 * dim2 * dim3 * dim4 , a . size ) assertEquals ( dim1 * dim2 * dim3 * dim4 , a . data . size ) assertTrue { a . all { it == ComplexFloat . one } } }","docstring":"/**\n * Creates a ComplexFloat array filled with ones of a given size and checks if all elements are set to one.\n */"} {"signature":"@ Test fun createFourDimensionalArrayFromComplexFloatList ( )","body":"{ val list = listOf ( listOf ( listOf ( listOf ( + . i , + . i ) , listOf ( + . i , + . i ) ) , listOf ( listOf ( + . i , + . i ) , listOf ( + . i , + . i ) ) ) ) val a : D4Array < ComplexFloat > = mk . ndarray ( list ) assertEquals ( list , a . toListD4 ( ) ) }","docstring":"/**\n * Creates a four-dimensional array from a list of complex float lists\n * and checks if the array's list representation matches the input list.\n */"} {"signature":"@ Test fun createFourDimensionalArrayFromComplexFloatSet ( )","body":"{ val set = setOf ( + . i , + . i , + . i , + . i , + . i , + . i , + . i , + . i , + . i , + . i , - + . i , - + . i ) val shape = intArrayOf ( , , , ) val a : D4Array < ComplexFloat > = mk . ndarray ( set , shape = shape ) assertEquals ( set . size , a . size ) assertEquals ( set , a . toSet ( ) ) }","docstring":"/**\n * Creates a four-dimensional array from a set of complex floats\n * and checks if the array's set representation matches the input set.\n */"} {"signature":"@ Test fun createFourDimensionalArrayFromPrimitiveComplexFloatArray ( )","body":"{ val array = complexFloatArrayOf ( + . i , + . i , + . i , + . i , + . i , + . i , + . i , + . i , + . i , + . i , + . i , + . i ) val a = mk . ndarray ( array , , , , ) assertEquals ( array . size , a . size ) a . data . getComplexFloatArray ( ) shouldBe array }","docstring":"/**\n * Creates a four-dimensional array from a primitive ComplexFloatArray\n * and checks if the array's ComplexFloatArray representation matches the input ComplexFloatArray.\n */"} {"signature":"@ Test fun createComplexFloat4DArrayWithInitializationFunction ( )","body":"{ val a = mk . d4array < ComplexFloat > ( , , , ) { ComplexFloat ( it + , round ( ( it - ) * ) / ) } val expected = complexFloatArrayOf ( - . i , + . i , + . i , + . i , + . i , + . i , + . i , + . i , + . i , + . i , + . i , + . i ) assertEquals ( expected . size , a . size ) a . data . getComplexFloatArray ( ) shouldBe expected }","docstring":"/**\n * Creates a four-dimensional array with a given size using an initialization function\n * and checks if the array's ComplexFloatArray representation matches the expected output.\n */"} {"signature":"@ Test fun createComplexFloat4DArrayWithInitAndIndices ( )","body":"{ val a = mk . d4arrayIndices < ComplexFloat > ( , , , ) { i , j , k , l -> i * j + k - l + ComplexFloat ( ) } val expected = complexFloatArrayOf ( + . i , + . i , + . i , + . i , + . i , + . i , + . i , + . i , + . i , + . i , + . i , + . i ) assertEquals ( expected . size , a . size ) a . data . getComplexFloatArray ( ) shouldBe expected }","docstring":"/**\n * Creates a four-dimensional array with a given size using an initialization function and indices.\n * Checks if the array's ComplexFloatArray representation matches the expected output.\n */"} {"signature":"@ Test fun createZeroFilledComplexDoubleArray ( )","body":"{ val dim1 = val dim2 = val dim3 = val dim4 = val a = mk . zeros < ComplexDouble > ( dim1 , dim2 , dim3 , dim4 ) assertEquals ( dim1 * dim2 * dim3 * dim4 , a . size ) assertEquals ( dim1 * dim2 * dim3 * dim4 , a . data . size ) assertTrue { a . all { it == ComplexDouble . zero } } }","docstring":"/**\n * This method checks if a ComplexDouble array of a given size is correctly created with all elements set to zero.\n */"} {"signature":"@ Test fun createComplexDoubleArrayFilledWithOnes ( )","body":"{ val dim1 = val dim2 = val dim3 = val dim4 = val a = mk . ones < ComplexDouble > ( dim1 , dim2 , dim3 , dim4 ) assertEquals ( dim1 * dim2 * dim3 * dim4 , a . size ) assertEquals ( dim1 * dim2 * dim3 * dim4 , a . data . size ) assertTrue { a . all { it == ComplexDouble . one } } }","docstring":"/**\n * Creates a ComplexDouble array filled with ones of a given size and checks if all elements are set to one.\n */"} {"signature":"@ Test fun createFourDimensionalArrayFromComplexDoubleList ( )","body":"{ val list = listOf ( listOf ( listOf ( listOf ( + . i , + . i ) , listOf ( + . i , + . i ) ) , listOf ( listOf ( + . i , + . i ) , listOf ( + . i , + . i ) ) ) ) val a : D4Array < ComplexDouble > = mk . ndarray ( list ) assertEquals ( list , a . toListD4 ( ) ) }","docstring":"/**\n * Creates a four-dimensional array from a list of byte lists\n * and checks if the array's list representation matches the input list.\n */"} {"signature":"@ Test fun createFourDimensionalArrayFromComplexDoubleSet ( )","body":"{ val set = setOf ( + . i , + . i , + . i , + . i , + . i , + . i , + . i , + . i , + . i , + . i , - + . i , - + . i ) val shape = intArrayOf ( , , , ) val a : D4Array < ComplexDouble > = mk . ndarray ( set , shape = shape ) assertEquals ( set . size , a . size ) assertEquals ( set , a . toSet ( ) ) }","docstring":"/**\n * Creates a four-dimensional array from a set of complex doubles\n * and checks if the array's set representation matches the input set.\n */"} {"signature":"@ Test fun createFourDimensionalArrayFromPrimitiveComplexDoubleArray ( )","body":"{ val array = complexDoubleArrayOf ( + . i , + . i , + . i , + . i , + . i , + . i , + . i , + . i , + . i , + . i , + . i , + . i ) val a = mk . ndarray ( array , , , , ) assertEquals ( array . size , a . size ) a . data . getComplexDoubleArray ( ) shouldBe array }","docstring":"/**\n * Creates a four-dimensional array from a primitive ComplexDoubleArray\n * and checks if the array's ComplexDoubleArray representation matches the input ComplexDoubleArray.\n */"} {"signature":"@ Test fun createComplexDouble4DArrayWithInitializationFunction ( )","body":"{ val a = mk . d4array < ComplexDouble > ( , , , ) { ComplexDouble ( it + , round ( ( it - ) * ) / ) } val expected = complexDoubleArrayOf ( - . i , + . i , + . i , + . i , + . i , + . i , + . i , + . i , + . i , + . i , + . i , + . i ) assertEquals ( expected . size , a . size ) a . data . getComplexDoubleArray ( ) shouldBe expected }","docstring":"/**\n * Creates a four-dimensional array with a given size using an initialization function\n * and checks if the array's ComplexDoubleArray representation matches the expected output.\n */"} {"signature":"@ Test fun createComplexDouble4DArrayWithInitAndIndices ( )","body":"{ val a = mk . d4arrayIndices < ComplexDouble > ( , , , ) { i , j , k , l -> i * j + k - l + ComplexDouble ( ) } val expected = complexDoubleArrayOf ( + . i , + . i , + . i , + . i , + . i , + . i , + . i , + . i , + . i , + . i , + . i , + . i ) assertEquals ( expected . size , a . size ) a . data . getComplexDoubleArray ( ) shouldBe expected }","docstring":"/**\n * Creates a four-dimensional array with a given size using an initialization function and indices.\n * Checks if the array's ComplexDoubleArray representation matches the expected output.\n */"} {"signature":"private fun FirCallableSymbol < * > . isEnhanceableIntersection ( ) : Boolean","body":"{ return this is FirIntersectionCallableSymbol && dispatchReceiverClassLookupTagOrNull ( ) == owner . symbol . toLookupTag ( ) && unwrapFakeOverrides < FirCallableSymbol < * > > ( ) . origin is FirDeclarationOrigin . Enhancement }","docstring":"/**\n * Intersection overrides with Java and Kotlin overridden symbols need to be enhanced so that we get non-flexible types\n * in the signature.\n * This is required for @PurelyImplements to work properly.\n *\n * We only enhance intersection overrides if their dispatch receiver is equal to [owner], i.e. we don't enhance inherited\n * intersection overrides.\n *\n * See compiler/testData/codegen/box/fakeOverride/javaInheritsKotlinIntersectionOverride.kt.\n */"} {"signature":"private fun enhanceMethod ( firMethod : FirFunction , methodId : CallableId , name : Name ? , enhancedTypeParameters : List < FirTypeParameterRef > ? , isIntersectionOverride : Boolean , precomputedOverridden : List < FirCallableDeclaration > ? , ) : FirFunctionSymbol < * >","body":"{ val fakeSource = firMethod . source ? . fakeElement ( KtFakeSourceElementKind . Enhancement ) val predefinedEnhancementInfo = SignatureBuildingComponents . signature ( owner . symbol . classId , firMethod . computeJvmDescriptor { it . toConeKotlinTypeProbablyFlexible ( session , javaTypeParameterStack , fakeSource ) } ) . let { signature -> PREDEFINED_FUNCTION_ENHANCEMENT_INFO_BY_SIGNATURE [ signature ] } predefinedEnhancementInfo ? . let { assert ( it . parametersInfo . size == firMethod . valueParameters . size ) { \"\" } } val defaultQualifiers = firMethod . computeDefaultQualifiers ( ) val overriddenMembers = precomputedOverridden ? : ( firMethod as? FirSimpleFunction ) ? . overridden ( ) . orEmpty ( ) val hasReceiver = overriddenMembers . any { it . receiverParameter != null } val newReceiverTypeRef = if ( firMethod is FirSimpleFunction && hasReceiver ) { enhanceReceiverType ( firMethod , overriddenMembers , defaultQualifiers ) } else null val ( newReturnTypeRef , deferredCalc ) = if ( firMethod is FirSimpleFunction ) { enhanceReturnType ( firMethod , overriddenMembers , defaultQualifiers , predefinedEnhancementInfo ) } else { firMethod . returnTypeRef to null } val enhancedValueParameterTypes = mutableListOf < FirResolvedTypeRef > ( ) for ( ( index , valueParameter ) in firMethod . valueParameters . withIndex ( ) ) { if ( hasReceiver && index == ) continue enhancedValueParameterTypes += enhanceValueParameterType ( firMethod , overriddenMembers , hasReceiver , defaultQualifiers , predefinedEnhancementInfo , valueParameter , if ( hasReceiver ) index - else index ) } val functionSymbol : FirFunctionSymbol < * > var isJavaRecordComponent = false val typeParameterSubstitutionMap = mutableMapOf < FirTypeParameterSymbol , ConeKotlinType > ( ) var typeParameterSubstitutor : ConeSubstitutor ? = null val declarationOrigin = if ( isIntersectionOverride ) FirDeclarationOrigin . IntersectionOverride else FirDeclarationOrigin . Enhancement val function = when ( firMethod ) { is FirConstructor -> { val symbol = FirConstructorSymbol ( methodId ) . also { functionSymbol = it } if ( firMethod . isPrimary ) { FirPrimaryConstructorBuilder ( ) . apply { returnTypeRef = newReturnTypeRef ! ! val resolvedStatus = firMethod . status as? FirResolvedDeclarationStatus status = if ( resolvedStatus != null ) { FirResolvedDeclarationStatusImpl ( resolvedStatus . visibility , Modality . FINAL , resolvedStatus . effectiveVisibility ) } else { FirDeclarationStatusImpl ( firMethod . visibility , Modality . FINAL ) } . apply { isInner = firMethod . isInner hasStableParameterNames = firMethod . hasStableParameterNames } this . symbol = symbol dispatchReceiverType = firMethod . dispatchReceiverType attributes = firMethod . attributes . copy ( ) } } else { FirConstructorBuilder ( ) . apply { returnTypeRef = newReturnTypeRef ! ! status = firMethod . status this . symbol = symbol dispatchReceiverType = firMethod . dispatchReceiverType attributes = firMethod . attributes . copy ( ) } } . apply { source = firMethod . source moduleData = this@FirSignatureEnhancement . moduleData resolvePhase = FirResolvePhase . ANALYZED_DEPENDENCIES origin = declarationOrigin this . typeParameters += ( enhancedTypeParameters ? : firMethod . typeParameters ) } } is FirSimpleFunction -> { isJavaRecordComponent = firMethod . isJavaRecordComponent == true FirSimpleFunctionBuilder ( ) . apply { source = firMethod . source moduleData = this@FirSignatureEnhancement . moduleData origin = declarationOrigin this . name = name ! ! status = firMethod . status symbol = if ( isIntersectionOverride ) { FirIntersectionOverrideFunctionSymbol ( methodId , overriddenMembers . map { it . symbol } , containsMultipleNonSubsumed = ( firMethod . symbol as? FirIntersectionCallableSymbol ) ? . containsMultipleNonSubsumed == true , ) } else { FirNamedFunctionSymbol ( methodId ) } . also { functionSymbol = it } resolvePhase = FirResolvePhase . ANALYZED_DEPENDENCIES typeParameters += ( enhancedTypeParameters ? : firMethod . typeParameters ) . map { typeParameter -> require ( typeParameter is FirTypeParameter ) { \"\" } val newTypeParameter = buildTypeParameterCopy ( typeParameter ) { origin = declarationOrigin symbol = FirTypeParameterSymbol ( ) containingDeclarationSymbol = functionSymbol } typeParameterSubstitutionMap [ typeParameter . symbol ] = ConeTypeParameterTypeImpl ( newTypeParameter . symbol . toLookupTag ( ) , isNullable = false ) newTypeParameter } if ( typeParameterSubstitutionMap . isNotEmpty ( ) ) { typeParameterSubstitutor = ConeSubstitutorByMap . create ( typeParameterSubstitutionMap , session ) } returnTypeRef = if ( typeParameterSubstitutor != null && newReturnTypeRef is FirResolvedTypeRef ) { newReturnTypeRef . withReplacedConeType ( typeParameterSubstitutor ? . substituteOrNull ( newReturnTypeRef . coneType ) ) } else { newReturnTypeRef ? : FirImplicitTypeRefImplWithoutSource } val substitutedReceiverTypeRef = newReceiverTypeRef ? . withReplacedConeType ( typeParameterSubstitutor ? . substituteOrNull ( newReceiverTypeRef . coneType ) ) receiverParameter = substitutedReceiverTypeRef ? . let { receiverType -> buildReceiverParameter { typeRef = receiverType annotations += firMethod . valueParameters . first ( ) . annotations source = receiverType . source ? . fakeElement ( KtFakeSourceElementKind . ReceiverFromType ) } } typeParameters . forEach { typeParameter -> typeParameter . replaceBounds ( typeParameter . bounds . map { boundTypeRef -> boundTypeRef . withReplacedConeType ( typeParameterSubstitutor ? . substituteOrNull ( boundTypeRef . coneType ) ) } ) } dispatchReceiverType = firMethod . dispatchReceiverType attributes = firMethod . attributes . copy ( ) . apply { if ( deferredCalc != null ) { deferredCallableCopyReturnType = if ( typeParameterSubstitutor != null ) { DelegatingDeferredReturnTypeWithSubstitution ( deferredCalc , typeParameterSubstitutor ! ! ) } else { deferredCalc } } } } } else -> errorWithAttachment ( \"\" ) { withFirEntry ( \"\" , firMethod ) } } . apply { val newValueParameters = firMethod . valueParameters . zip ( enhancedValueParameterTypes ) { valueParameter , enhancedReturnType -> valueParameter . defaultValue ? . replaceConeTypeOrNull ( enhancedReturnType . coneType ) buildValueParameter { source = valueParameter . source containingFunctionSymbol = functionSymbol moduleData = this@FirSignatureEnhancement . moduleData origin = declarationOrigin returnTypeRef = enhancedReturnType . withReplacedConeType ( typeParameterSubstitutor ? . substituteOrNull ( enhancedReturnType . coneType ) ) this . name = valueParameter . name symbol = FirValueParameterSymbol ( this . name ) defaultValue = valueParameter . defaultValue isCrossinline = valueParameter . isCrossinline isNoinline = valueParameter . isNoinline isVararg = valueParameter . isVararg resolvePhase = FirResolvePhase . ANALYZED_DEPENDENCIES annotations += valueParameter . annotations } } this . valueParameters += newValueParameters annotations += firMethod . annotations deprecationsProvider = annotations . getDeprecationsProviderFromAnnotations ( session , fromJava = true ) } . build ( ) . apply { if ( isJavaRecordComponent ) { this . isJavaRecordComponent = true } updateIsOperatorFlagIfNeeded ( this ) } return function . symbol }","docstring":"/**\n * @param enhancedTypeParameters pass enhanced type parameters that will be used instead of original ones.\n * **null** means that [enhanceMethod] will use the original type parameters to create an enhanced function\n */"} {"signature":"fun performFirstRoundOfBoundsResolution ( typeParameters : List < FirTypeParameterRef > , source : KtSourceElement ? , ) : Pair < List < List < FirTypeRef > > , List < FirTypeParameterRef > >","body":"{ val initialBounds : MutableList < List < FirTypeRef > > = mutableListOf ( ) val typeParametersCopy = ArrayList < FirTypeParameterRef > ( typeParameters . size ) for ( typeParameter in typeParameters ) { typeParametersCopy += if ( typeParameter is FirTypeParameter ) { initialBounds . add ( typeParameter . bounds . toList ( ) ) buildTypeParameterCopy ( typeParameter ) { bounds . clear ( ) typeParameter . bounds . mapTo ( bounds ) { it . resolveIfJavaType ( session , javaTypeParameterStack , source , FirJavaTypeConversionMode . TYPE_PARAMETER_BOUND_FIRST_ROUND ) } } } else { typeParameter } } return initialBounds to typeParametersCopy }","docstring":"/**\n * Perform first time initialization of bounds with FirResolvedTypeRef instances\n * But after that bounds are still not enhanced and more over might have not totally correct raw types bounds\n * (see the next step in the method performSecondRoundOfBoundsResolution)\n *\n * In case of A, or similar cases, the bound is converted to the flexible version A<*>..A<*>?,\n * while in the end it's assumed to be A>..A<*>?\n *\n * That's necessary because at this stage it's not quite easy to come just to the final version since for that\n * we would the need upper bounds of all the type parameters that might not yet be initialized at the moment\n *\n * See the usages of FirJavaTypeConversionMode.TYPE_PARAMETER_BOUND_FIRST_ROUND\n */"} {"signature":"private fun performSecondRoundOfBoundsResolution ( typeParameters : List < FirTypeParameterRef > , initialBounds : List < List < FirTypeRef > > , source : KtSourceElement ? , )","body":"{ var currentIndex = for ( typeParameter in typeParameters ) { if ( typeParameter is FirTypeParameter ) { typeParameter . replaceBounds ( initialBounds [ currentIndex ] . map { it . resolveIfJavaType ( session , javaTypeParameterStack , source , FirJavaTypeConversionMode . TYPE_PARAMETER_BOUND_AFTER_FIRST_ROUND ) } ) currentIndex ++ } } }","docstring":"/**\n * In most cases that method doesn't change anything\n *\n * But the cases like A\n * After the first step we've got all bounds are initialized to potentially approximated version of raw types\n * And here, we compute the final version using previously initialized bounds\n *\n * So, mostly it works just as the first step, but assumes that bounds already contain FirResolvedTypeRef\n */"} {"signature":"fun enhanceTypeParameterBoundsAfterFirstRound ( typeParameters : List < FirTypeParameterRef > , initialBounds : List < List < FirTypeRef > > , source : KtSourceElement ? , )","body":"{ performSecondRoundOfBoundsResolution ( typeParameters , initialBounds , source ) typeParameters . replaceBounds { typeParameter , bound -> enhanceTypeParameterBound ( typeParameter , bound , forceOnlyHeadTypeConstructor = true ) } typeParameters . replaceBounds { typeParameter , bound -> enhanceTypeParameterBound ( typeParameter , bound , forceOnlyHeadTypeConstructor = false ) } }","docstring":"/**\n * There are four rounds of bounds resolution for Java type parameters\n * 1. Plain conversion of Java types without any enhancement (with approximated raw types)\n * 2. The same conversion, but raw types are not computed precisely\n * 3. Enhancement for top-level types (no enhancement for arguments)\n * 4. Enhancement for the whole types (with arguments)\n *\n * This method requires type parameters that have already been run through the first round\n */"} {"signature":"private fun enhanceReturnType ( owner : FirCallableDeclaration , overriddenMembers : List < FirCallableDeclaration > , defaultQualifiers : JavaTypeQualifiersByElementType ? , predefinedEnhancementInfo : PredefinedFunctionEnhancementInfo ? , ) : Pair < FirResolvedTypeRef ? , DeferredCallableCopyReturnType ? >","body":"{ val containerApplicabilityType = if ( owner is FirJavaField ) { AnnotationQualifierApplicabilityType . FIELD } else { AnnotationQualifierApplicabilityType . METHOD_RETURN_TYPE } val forAnnotationMember = if ( owner is FirJavaField ) { false } else { this . owner . classKind == ClassKind . ANNOTATION_CLASS } if ( overriddenMembers . any { it . returnTypeRef is FirImplicitTypeRef } ) { val deferredReturnTypeCalculation = object : DeferredCallableCopyReturnType ( ) { override fun computeReturnType ( calc : CallableCopyTypeCalculator ) : ConeKotlinType { return owner . enhance ( overriddenMembers , owner , isCovariant = true , defaultQualifiers , containerApplicabilityType , typeInSignature = TypeInSignature . ReturnPossiblyDeferred ( calc ) , predefinedEnhancementInfo ? . returnTypeInfo , forAnnotationMember = forAnnotationMember ) . type } override fun toString ( ) : String = \"\" } return null to deferredReturnTypeCalculation } return owner . enhance ( overriddenMembers , owner , isCovariant = true , defaultQualifiers , containerApplicabilityType , TypeInSignature . Return , predefinedEnhancementInfo ? . returnTypeInfo , forAnnotationMember = forAnnotationMember ) to null }","docstring":"/**\n * Either returns a not-null [FirResolvedTypeRef] or a not-null [DeferredCallableCopyReturnType], never both.\n *\n * [DeferredCallableCopyReturnType] can only (but doesn't need to) be not-null when [overriddenMembers] is non-empty.\n */"} {"signature":"abstract fun getClassesByClassId ( classId : ClassId ) : Collection < PsiClass >","body":"abstract fun getClassesByClassId ( classId : ClassId ) : Collection < PsiClass >","docstring":"/**\n * Gets a collection of [PsiClass] by [ClassId]\n *\n * In standalone mode, this is simply [PsiClassStub]-based [PsiClass]\n */"} {"signature":"abstract fun createPermittedTypeSource ( psiTypeParameterSource : JavaElementPsiSource < out PsiClass > , permittedTypeIndex : Int , ) : JavaElementTypeSource < PsiClassType >","body":"abstract fun createPermittedTypeSource ( psiTypeParameterSource : JavaElementPsiSource < out PsiClass > , permittedTypeIndex : Int , ) : JavaElementTypeSource < PsiClassType >","docstring":"/**\n * @see com.intellij.psi.PsiClass.getPermitsListTypes\n */"} {"signature":"protected fun assertActivationFunction ( act : Activation , inp : FloatArray , exp : FloatArray )","body":"{ EagerSession . create ( ) . use { session -> val tf = Ops . create ( session ) Assertions . assertArrayEquals ( exp , act . apply ( tf , tf . constant ( inp ) ) . asOutput ( ) . tensor ( ) . copyTo ( inp ) , EPS ) } }","docstring":"/**\n * Checks if an Activation-function object with input [inp] gives valid result of [exp].\n *\n * For example, if you want to test [ReluActivation] with [inp] and [exp]\n * ```\n * val act = ReluActivation()\n * val inp = floatArrayOf(-1f, 0f, 1f)\n * val exp = floatArrayOf( 0f, 0f, 1f)\n *\n * assertActivationFunction(act, inp, exp) // Test passes\n * ```\n *\n * @param act activation function object\n * @param inp FloatArray applied to the activation function\n * @param exp FloatArray expected output for an activation function object [act] with input [inp]\n */"} {"signature":"protected fun assertActivationFunction ( act : Activation , inp : Array < FloatArray > , exp : Array < FloatArray > )","body":"{ EagerSession . create ( ) . use { session -> val tf = Ops . create ( session ) val actual = act . apply ( tf , tf . constant ( inp ) ) . asOutput ( ) . tensor ( ) . copyTo ( inp ) for ( i in .. exp . lastIndex ) { Assertions . assertArrayEquals ( exp [ i ] , actual [ i ] , EPS ) } } }","docstring":"/**\n * Checks if an Activation-function object with input [inp] gives a valid result of [exp].\n *\n * For example, if you want to test [ReluActivation] with [inp] and [exp]\n * ```\n * val act = ReluActivation()\n * val inp = arrayOf(floatArrayOf(-1f, -1f, -1f),\n * floatArrayOf(0f, 0f, 0f),\n * floatArrayOf(1f, 1f, 1f)\n * )\n * val exp = arrayOf(floatArrayOf( 0f, 0f, 0f),\n * floatArrayOf(0f, 0f, 0f),\n * floatArrayOf(1f, 1f, 1f)\n * )\n *\n * assertActivationFunction(act, inp, exp) // Test passes\n * ```\n *\n * @param act activation function object\n * @param inp Array` applied to the activation function\n * @param exp Array` expected output for an activation function object [act] with input [inp]\n */"} {"signature":"protected fun assertActivationFunction ( act : Activation , inp : Array < Array < FloatArray > > , exp : Array < Array < FloatArray > > )","body":"{ EagerSession . create ( ) . use { session -> val tf = Ops . create ( session ) val actual = act . apply ( tf , tf . constant ( inp ) ) . asOutput ( ) . tensor ( ) . copyTo ( inp ) for ( i in .. exp . lastIndex ) { for ( j in .. exp [ i ] . lastIndex ) { Assertions . assertArrayEquals ( exp [ i ] [ j ] , actual [ i ] [ j ] , EPS ) } } } }","docstring":"/**\n * Accepts 3D float input values\n *\n * @see assertActivationFunction\n */"} {"signature":"fun changedParamCount ( realValueParams : Int , thisParams : Int ) : Int","body":"{ val totalParams = realValueParams + thisParams if ( totalParams == ) return return ceil ( totalParams . toDouble ( ) / SLOTS_PER_INT . toDouble ( ) ) . toInt ( ) }","docstring":"/**\n * Calculates the number of 'changed' params needed based on the function's parameters.\n *\n * @param realValueParams The number of params defined by the user, those that are not implicit\n * (no extension or context receivers) or synthetic (no %composer, %changed or %defaults).\n * @param thisParams The number of implicit params, i.e. [IrFunction.thisParamCount]\n */"} {"signature":"fun changedParamCountFromTotal ( totalParamsIncludingThisParams : Int ) : Int","body":"{ var realParams = totalParamsIncludingThisParams realParams -- realParams -- var changedParams = do { realParams -= SLOTS_PER_INT changedParams ++ } while ( realParams > ) return changedParams }","docstring":"/**\n * Calculates the number of 'changed' params needed based on the function's total amount of\n * parameters.\n *\n * @param totalParamsIncludingThisParams The total number of parameter including implicit and\n * synthetic ones.\n */"} {"signature":"fun defaultParamCount ( valueParams : Int ) : Int","body":"{ return ceil ( valueParams . toDouble ( ) / BITS_PER_INT . toDouble ( ) ) . toInt ( ) }","docstring":"/**\n * Calculates the number of 'defaults' params needed based on the function's parameters.\n *\n * @param valueParams The numbers of params, usually the size of [IrFunction.valueParameters].\n * Which includes context receivers params, but not extension param nor synthetic params.\n */"} {"signature":"fun translateJsCodeIntoStatementList ( code : IrExpression , context : JsIrBackendContext ? , container : IrDeclaration )","body":"= translateJsCodeIntoStatementList ( code , context , code . getStartSourceLocation ( container ) ? : container . fileOrNull ? . fileEntry ? . let { JsLocation ( it . name , , ) } )","docstring":"/**\n * Returns null if constant expression could not be parsed.\n */"} {"signature":"fun translateJsCodeIntoStatementList ( code : IrExpression , context : JsIrBackendContext ? , fileEntry : IrFileEntry )","body":"= translateJsCodeIntoStatementList ( code , context , code . getStartSourceLocation ( fileEntry ) ? : JsLocation ( fileEntry . name , , ) )","docstring":"/**\n * Returns null if constant expression could not be parsed.\n */"} {"signature":"@ ObsoleteCoroutinesApi public fun ticker ( delayMillis : Long , initialDelayMillis : Long = delayMillis , context : CoroutineContext = EmptyCoroutineContext , mode : TickerMode = TickerMode . FIXED_PERIOD ) : ReceiveChannel < Unit >","body":"{ require ( delayMillis >= ) { \"\" } require ( initialDelayMillis >= ) { \"\" } return GlobalScope . produce ( Dispatchers . Unconfined + context , capacity = ) { when ( mode ) { TickerMode . FIXED_PERIOD -> fixedPeriodTicker ( delayMillis , initialDelayMillis , channel ) TickerMode . FIXED_DELAY -> fixedDelayTicker ( delayMillis , initialDelayMillis , channel ) } } }","docstring":"/**\n * Creates a channel that produces the first item after the given initial delay and subsequent items with the\n * given delay between them.\n *\n * The resulting channel is a _rendezvous channel_. When receiver from this channel does not keep\n * up with receiving the elements from this channel, they are not being sent due to backpressure. The actual\n * timing behavior of ticker in this case is controlled by [mode] parameter which\n * is set to [TickerMode.FIXED_PERIOD] by default. See [TickerMode] for other details.\n *\n * This channel stops producing elements immediately after [ReceiveChannel.cancel] invocation.\n *\n * **Note** producer to this channel is dispatched via [Dispatchers.Unconfined] by default and started eagerly.\n *\n * **Note: Ticker channels are not currently integrated with structured concurrency and their api will change in the future.**\n * \n * @param delayMillis delay between each element in milliseconds.\n * @param initialDelayMillis delay after which the first element will be produced (it is equal to [delayMillis] by default) in milliseconds.\n * @param context context of the producing coroutine.\n * @param mode specifies behavior when elements are not received ([FIXED_PERIOD][TickerMode.FIXED_PERIOD] by default).\n */"} {"signature":"@ Suppress ( \"\" ) public fun < C > ColumnSet < C > . cols ( predicate : ColumnFilter < C > = { true } , ) : TransformableColumnSet < C >","body":"= colsInternal ( predicate as ColumnFilter < * > ) as TransformableColumnSet < C >","docstring":"/** @include [ColumnSetColsPredicateDocs] */"} {"signature":"public operator fun < C > ColumnSet < C > . get ( predicate : ColumnFilter < C > = { true } , ) : TransformableColumnSet < C >","body":"= cols ( predicate )","docstring":"/** @include [ColumnSetColsPredicateDocs] */"} {"signature":"public fun ColumnsSelectionDsl < * > . cols ( predicate : ColumnFilter < * > = { true } , ) : TransformableColumnSet < * >","body":"= this . asSingleColumn ( ) . colsInternal ( predicate )","docstring":"/** @include [ColumnsSelectionDslColsPredicateDocs] */"} {"signature":"public operator fun ColumnsSelectionDsl < * > . get ( predicate : ColumnFilter < * > = { true } , ) : TransformableColumnSet < * >","body":"= cols ( predicate )","docstring":"/** @include [ColumnsSelectionDslColsPredicateDocs] */"} {"signature":"public fun SingleColumn < DataRow < * > > . cols ( predicate : ColumnFilter < * > = { true } , ) : TransformableColumnSet < * >","body":"= this . ensureIsColumnGroup ( ) . colsInternal ( predicate )","docstring":"/** @include [SingleColumnAnyRowColsPredicateDocs] */"} {"signature":"public operator fun SingleColumn < DataRow < * > > . get ( predicate : ColumnFilter < * > = { true } , ) : TransformableColumnSet < * >","body":"= cols ( predicate )","docstring":"/**\n * @include [SingleColumnAnyRowColsPredicateDocs]\n */"} {"signature":"public fun String . cols ( predicate : ColumnFilter < * > = { true } , ) : TransformableColumnSet < * >","body":"= columnGroup ( this ) . cols ( predicate )","docstring":"/** @include [StringColsPredicateDocs] */"} {"signature":"public operator fun String . get ( predicate : ColumnFilter < * > = { true } , ) : TransformableColumnSet < * >","body":"= cols ( predicate )","docstring":"/** @include [StringColsPredicateDocs] */"} {"signature":"public fun KProperty < * > . cols ( predicate : ColumnFilter < * > = { true } , ) : TransformableColumnSet < * >","body":"= columnGroup ( this ) . cols ( predicate )","docstring":"/** @include [KPropertyColsPredicateDocs] */"} {"signature":"public operator fun KProperty < * > . get ( predicate : ColumnFilter < * > = { true } , ) : TransformableColumnSet < * >","body":"= cols ( predicate )","docstring":"/** @include [KPropertyColsPredicateDocs] */"} {"signature":"public fun ColumnPath . cols ( predicate : ColumnFilter < * > = { true } , ) : TransformableColumnSet < * >","body":"= columnGroup ( this ) . cols ( predicate )","docstring":"/** @include [ColumnPathPredicateDocs] */"} {"signature":"public operator fun ColumnPath . get ( predicate : ColumnFilter < * > = { true } , ) : TransformableColumnSet < * >","body":"= cols ( predicate )","docstring":"/** @include [ColumnPathPredicateDocs] */"} {"signature":"public fun < C > ColumnsSelectionDsl < * > . cols ( firstCol : ColumnReference < C > , vararg otherCols : ColumnReference < C > , ) : ColumnSet < C >","body":"= asSingleColumn ( ) . cols ( firstCol , * otherCols )","docstring":"/** @include [ColumnsSelectionDslColsVarargColumnReferenceDocs] */"} {"signature":"public operator fun < C > ColumnsSelectionDsl < * > . get ( firstCol : ColumnReference < C > , vararg otherCols : ColumnReference < C > , ) : ColumnSet < C >","body":"= cols ( firstCol , * otherCols )","docstring":"/** @include [ColumnsSelectionDslColsVarargColumnReferenceDocs] */"} {"signature":"public fun < C > SingleColumn < DataRow < * > > . cols ( firstCol : ColumnReference < C > , vararg otherCols : ColumnReference < C > , ) : ColumnSet < C >","body":"= colsInternal ( listOf ( firstCol , * otherCols ) ) . cast ( )","docstring":"/** @include [SingleColumnColsVarargColumnReferenceDocs] */"} {"signature":"public operator fun < C > SingleColumn < DataRow < * > > . get ( firstCol : ColumnReference < C > , vararg otherCols : ColumnReference < C > , ) : ColumnSet < C >","body":"= cols ( firstCol , * otherCols )","docstring":"/**\n * @include [SingleColumnColsVarargColumnReferenceDocs]\n */"} {"signature":"public fun < C > String . cols ( firstCol : ColumnReference < C > , vararg otherCols : ColumnReference < C > , ) : ColumnSet < C >","body":"= columnGroup ( this ) . cols ( firstCol , * otherCols )","docstring":"/** @include [StringColsVarargColumnReferenceDocs] */"} {"signature":"public operator fun < C > String . get ( firstCol : ColumnReference < C > , vararg otherCols : ColumnReference < C > , ) : ColumnSet < C >","body":"= cols ( firstCol , * otherCols )","docstring":"/** @include [StringColsVarargColumnReferenceDocs] */"} {"signature":"public fun < C > KProperty < * > . cols ( firstCol : ColumnReference < C > , vararg otherCols : ColumnReference < C > , ) : ColumnSet < C >","body":"= columnGroup ( this ) . cols ( firstCol , * otherCols )","docstring":"/** @include [KPropertyColsVarargColumnReferenceDocs] */"} {"signature":"public operator fun < C > KProperty < * > . get ( firstCol : ColumnReference < C > , vararg otherCols : ColumnReference < C > , ) : ColumnSet < C >","body":"= cols ( firstCol , * otherCols )","docstring":"/** @include [KPropertyColsVarargColumnReferenceDocs] */"} {"signature":"public fun < C > ColumnPath . cols ( firstCol : ColumnReference < C > , vararg otherCols : ColumnReference < C > , ) : ColumnSet < C >","body":"= columnGroup ( this ) . cols ( firstCol , * otherCols )","docstring":"/** @include [ColumnPathColsVarargColumnReferenceDocs] */"} {"signature":"public operator fun < C > ColumnPath . get ( firstCol : ColumnReference < C > , vararg otherCols : ColumnReference < C > , ) : ColumnSet < C >","body":"= cols ( firstCol , * otherCols )","docstring":"/** @include [ColumnPathColsVarargColumnReferenceDocs] */"} {"signature":"@ Suppress ( \"\" ) @ JvmName ( \"\" ) public fun ColumnsSelectionDsl < * > . cols ( firstCol : String , vararg otherCols : String , ) : ColumnSet < * >","body":"= cols < Any ? > ( firstCol , * otherCols )","docstring":"/** @include [ColumnsSelectionDslVarargStringDocs] */"} {"signature":"public fun < T > ColumnsSelectionDsl < * > . cols ( firstCol : String , vararg otherCols : String , ) : ColumnSet < T >","body":"= this . asSingleColumn ( ) . cols ( firstCol , * otherCols ) . cast ( )","docstring":"/** @include [ColumnsSelectionDslVarargStringDocs] */"} {"signature":"public operator fun ColumnsSelectionDsl < * > . get ( firstCol : String , vararg otherCols : String , ) : ColumnSet < * >","body":"= cols < Any ? > ( firstCol , * otherCols )","docstring":"/** @include [ColumnsSelectionDslVarargStringDocs] */"} {"signature":"@ Suppress ( \"\" ) @ JvmName ( \"\" ) public fun SingleColumn < DataRow < * > > . cols ( firstCol : String , vararg otherCols : String , ) : ColumnSet < * >","body":"= cols < Any ? > ( firstCol , * otherCols )","docstring":"/** @include [SingleColumnColsVarargStringDocs] */"} {"signature":"public fun < T > SingleColumn < DataRow < * > > . cols ( firstCol : String , vararg otherCols : String , ) : ColumnSet < T >","body":"= colsInternal ( listOf ( firstCol , * otherCols ) . map { pathOf ( it ) } ) . cast ( )","docstring":"/** @include [SingleColumnColsVarargStringDocs] */"} {"signature":"public operator fun SingleColumn < DataRow < * > > . get ( firstCol : String , vararg otherCols : String , ) : ColumnSet < * >","body":"= cols < Any ? > ( firstCol , * otherCols )","docstring":"/**\n * @include [SingleColumnColsVarargStringDocs]\n */"} {"signature":"@ Suppress ( \"\" ) @ JvmName ( \"\" ) public fun String . cols ( firstCol : String , vararg otherCols : String , ) : ColumnSet < * >","body":"= cols < Any ? > ( firstCol , * otherCols )","docstring":"/** @include [StringColsVarargStringDocs] */"} {"signature":"public fun < T > String . cols ( firstCol : String , vararg otherCols : String , ) : ColumnSet < T >","body":"= columnGroup ( this ) . cols ( firstCol , * otherCols ) . cast ( )","docstring":"/** @include [StringColsVarargStringDocs] */"} {"signature":"public operator fun String . get ( firstCol : String , vararg otherCols : String , ) : ColumnSet < * >","body":"= cols < Any ? > ( firstCol , * otherCols )","docstring":"/** @include [StringColsVarargStringDocs] */"} {"signature":"@ Suppress ( \"\" ) @ JvmName ( \"\" ) public fun KProperty < * > . cols ( firstCol : String , vararg otherCols : String , ) : ColumnSet < * >","body":"= cols < Any ? > ( firstCol , * otherCols )","docstring":"/** @include [KPropertiesColsVarargStringDocs] */"} {"signature":"public fun < T > KProperty < * > . cols ( firstCol : String , vararg otherCols : String , ) : ColumnSet < T >","body":"= columnGroup ( this ) . cols ( firstCol , * otherCols ) . cast ( )","docstring":"/** @include [KPropertiesColsVarargStringDocs] */"} {"signature":"public operator fun KProperty < * > . get ( firstCol : String , vararg otherCols : String , ) : ColumnSet < * >","body":"= cols < Any ? > ( firstCol , * otherCols )","docstring":"/** @include [KPropertiesColsVarargStringDocs] */"} {"signature":"@ Suppress ( \"\" ) @ JvmName ( \"\" ) public fun ColumnPath . cols ( firstCol : String , vararg otherCols : String , ) : ColumnSet < * >","body":"= cols < Any ? > ( firstCol , * otherCols )","docstring":"/** @include [ColumnPathColsVarargStringDocs] */"} {"signature":"public fun < T > ColumnPath . cols ( firstCol : String , vararg otherCols : String , ) : ColumnSet < T >","body":"= columnGroup ( this ) . cols ( firstCol , * otherCols ) . cast ( )","docstring":"/** @include [ColumnPathColsVarargStringDocs] */"} {"signature":"public operator fun ColumnPath . get ( firstCol : String , vararg otherCols : String , ) : ColumnSet < * >","body":"= cols < Any ? > ( firstCol , * otherCols )","docstring":"/** @include [ColumnPathColsVarargStringDocs] */"} {"signature":"@ Suppress ( \"\" ) @ JvmName ( \"\" ) public fun ColumnsSelectionDsl < * > . cols ( firstCol : ColumnPath , vararg otherCols : ColumnPath , ) : ColumnSet < * >","body":"= cols < Any ? > ( firstCol , * otherCols )","docstring":"/** @include [ColumnsSelectionDslVarargColumnPathDocs] */"} {"signature":"public fun < T > ColumnsSelectionDsl < * > . cols ( firstCol : ColumnPath , vararg otherCols : ColumnPath , ) : ColumnSet < T >","body":"= asSingleColumn ( ) . cols < T > ( firstCol , * otherCols )","docstring":"/** @include [ColumnsSelectionDslVarargColumnPathDocs] */"} {"signature":"public operator fun ColumnsSelectionDsl < * > . get ( firstCol : ColumnPath , vararg otherCols : ColumnPath , ) : ColumnSet < * >","body":"= cols < Any ? > ( firstCol , * otherCols )","docstring":"/** @include [ColumnsSelectionDslVarargColumnPathDocs] */"} {"signature":"@ Suppress ( \"\" ) @ JvmName ( \"\" ) public fun SingleColumn < DataRow < * > > . cols ( firstCol : ColumnPath , vararg otherCols : ColumnPath , ) : ColumnSet < * >","body":"= cols < Any ? > ( firstCol , * otherCols )","docstring":"/** @include [SingleColumnColsVarargColumnPathDocs] */"} {"signature":"public fun < T > SingleColumn < DataRow < * > > . cols ( firstCol : ColumnPath , vararg otherCols : ColumnPath , ) : ColumnSet < T >","body":"= colsInternal ( listOf ( firstCol , * otherCols ) ) . cast ( )","docstring":"/** @include [SingleColumnColsVarargColumnPathDocs] */"} {"signature":"public operator fun SingleColumn < DataRow < * > > . get ( firstCol : ColumnPath , vararg otherCols : ColumnPath , ) : ColumnSet < * >","body":"= cols < Any ? > ( firstCol , * otherCols )","docstring":"/**\n * @include [SingleColumnColsVarargColumnPathDocs]\n */"} {"signature":"@ Suppress ( \"\" ) @ JvmName ( \"\" ) public fun String . cols ( firstCol : ColumnPath , vararg otherCols : ColumnPath , ) : ColumnSet < * >","body":"= cols < Any ? > ( firstCol , * otherCols )","docstring":"/** @include [StringColsVarargColumnPathDocs] */"} {"signature":"public fun < T > String . cols ( firstCol : ColumnPath , vararg otherCols : ColumnPath , ) : ColumnSet < T >","body":"= columnGroup ( this ) . cols ( firstCol , * otherCols ) . cast ( )","docstring":"/** @include [StringColsVarargColumnPathDocs] */"} {"signature":"public operator fun String . get ( firstCol : ColumnPath , vararg otherCols : ColumnPath , ) : ColumnSet < * >","body":"= cols < Any ? > ( firstCol , * otherCols )","docstring":"/** @include [StringColsVarargColumnPathDocs] */"} {"signature":"@ Suppress ( \"\" ) @ JvmName ( \"\" ) public fun KProperty < * > . cols ( firstCol : ColumnPath , vararg otherCols : ColumnPath , ) : ColumnSet < * >","body":"= cols < Any ? > ( firstCol , * otherCols )","docstring":"/** @include [KPropertiesColsVarargColumnPathDocs] */"} {"signature":"public fun < T > KProperty < * > . cols ( firstCol : ColumnPath , vararg otherCols : ColumnPath , ) : ColumnSet < T >","body":"= columnGroup ( this ) . cols ( firstCol , * otherCols ) . cast ( )","docstring":"/** @include [KPropertiesColsVarargColumnPathDocs] */"} {"signature":"public operator fun KProperty < * > . get ( firstCol : ColumnPath , vararg otherCols : ColumnPath , ) : ColumnSet < * >","body":"= cols < Any ? > ( firstCol , * otherCols )","docstring":"/** @include [KPropertiesColsVarargColumnPathDocs] */"} {"signature":"@ Suppress ( \"\" ) @ JvmName ( \"\" ) public fun ColumnPath . cols ( firstCol : ColumnPath , vararg otherCols : ColumnPath , ) : ColumnSet < * >","body":"= cols < Any ? > ( firstCol , * otherCols )","docstring":"/** @include [ColumnPathColsVarargColumnPathDocs] */"} {"signature":"public fun < T > ColumnPath . cols ( firstCol : ColumnPath , vararg otherCols : ColumnPath , ) : ColumnSet < T >","body":"= columnGroup ( this ) . cols ( firstCol , * otherCols ) . cast ( )","docstring":"/** @include [ColumnPathColsVarargColumnPathDocs] */"} {"signature":"public operator fun ColumnPath . get ( firstCol : ColumnPath , vararg otherCols : ColumnPath , ) : ColumnSet < * >","body":"= cols < Any ? > ( firstCol , * otherCols )","docstring":"/** @include [ColumnPathColsVarargColumnPathDocs] */"} {"signature":"public fun < C > ColumnsSelectionDsl < * > . cols ( firstCol : KProperty < C > , vararg otherCols : KProperty < C > , ) : ColumnSet < C >","body":"= this . asSingleColumn ( ) . cols ( firstCol , * otherCols )","docstring":"/** @include [ColumnsSelectionDslColsVarargKPropertyDocs] */"} {"signature":"public operator fun < C > ColumnsSelectionDsl < * > . get ( firstCol : KProperty < C > , vararg otherCols : KProperty < C > , ) : ColumnSet < C >","body":"= cols ( firstCol , * otherCols )","docstring":"/** @include [ColumnsSelectionDslColsVarargKPropertyDocs] */"} {"signature":"public fun < C > SingleColumn < DataRow < * > > . cols ( firstCol : KProperty < C > , vararg otherCols : KProperty < C > , ) : ColumnSet < C >","body":"= colsInternal ( listOf ( firstCol , * otherCols ) . map { pathOf ( it . name ) } ) . cast ( )","docstring":"/** @include [SingleColumnColsVarargKPropertyDocs] */"} {"signature":"public operator fun < C > SingleColumn < DataRow < * > > . get ( firstCol : KProperty < C > , vararg otherCols : KProperty < C > , ) : ColumnSet < C >","body":"= cols ( firstCol , * otherCols )","docstring":"/** @include [SingleColumnColsVarargKPropertyDocs] */"} {"signature":"public fun < C > String . cols ( firstCol : KProperty < C > , vararg otherCols : KProperty < C > , ) : ColumnSet < C >","body":"= columnGroup ( this ) . cols ( firstCol , * otherCols )","docstring":"/** @include [StringColsVarargKPropertyDocs] */"} {"signature":"public operator fun < C > String . get ( firstCol : KProperty < C > , vararg otherCols : KProperty < C > , ) : ColumnSet < C >","body":"= cols ( firstCol , * otherCols )","docstring":"/** @include [StringColsVarargKPropertyDocs] */"} {"signature":"public fun < C > KProperty < * > . cols ( firstCol : KProperty < C > , vararg otherCols : KProperty < C > , ) : ColumnSet < C >","body":"= columnGroup ( this ) . cols ( firstCol , * otherCols )","docstring":"/** @include [KPropertyColsVarargKPropertyDocs] */"} {"signature":"public operator fun < C > KProperty < * > . get ( firstCol : KProperty < C > , vararg otherCols : KProperty < C > , ) : ColumnSet < C >","body":"= cols ( firstCol , * otherCols )","docstring":"/** @include [KPropertyColsVarargKPropertyDocs] */"} {"signature":"public fun < C > ColumnPath . cols ( firstCol : KProperty < C > , vararg otherCols : KProperty < C > , ) : ColumnSet < C >","body":"= columnGroup ( this ) . cols ( firstCol , * otherCols )","docstring":"/** @include [ColumnPathColsVarargKPropertyDocs] */"} {"signature":"public operator fun < C > ColumnPath . get ( firstCol : KProperty < C > , vararg otherCols : KProperty < C > , ) : ColumnSet < C >","body":"= cols ( firstCol , * otherCols )","docstring":"/** @include [ColumnPathColsVarargKPropertyDocs] */"} {"signature":"@ Suppress ( \"\" ) public fun < C > ColumnSet < C > . cols ( firstIndex : Int , vararg otherIndices : Int , ) : ColumnSet < C >","body":"= colsInternal ( headPlusArray ( firstIndex , otherIndices ) ) as ColumnSet < C >","docstring":"/** @include [ColumnSetColsIndicesDocs] */"} {"signature":"public operator fun < C > ColumnSet < C > . get ( firstIndex : Int , vararg otherIndices : Int , ) : ColumnSet < C >","body":"= cols ( firstIndex , * otherIndices )","docstring":"/** @include [ColumnSetColsIndicesDocs] */"} {"signature":"@ Suppress ( \"\" ) @ JvmName ( \"\" ) public fun ColumnsSelectionDsl < * > . cols ( firstIndex : Int , vararg otherIndices : Int , ) : ColumnSet < * >","body":"= cols < Any ? > ( firstIndex , * otherIndices )","docstring":"/** @include [ColumnsSelectionDslColsIndicesDocs] */"} {"signature":"public fun < T > ColumnsSelectionDsl < * > . cols ( firstIndex : Int , vararg otherIndices : Int , ) : ColumnSet < T >","body":"= this . asSingleColumn ( ) . colsInternal ( headPlusArray ( firstIndex , otherIndices ) ) . cast ( )","docstring":"/** @include [ColumnsSelectionDslColsIndicesDocs] */"} {"signature":"@ Suppress ( \"\" ) @ JvmName ( \"\" ) public fun SingleColumn < DataRow < * > > . cols ( firstIndex : Int , vararg otherIndices : Int , ) : ColumnSet < * >","body":"= cols < Any ? > ( firstIndex , * otherIndices )","docstring":"/** @include [SingleColumnColsIndicesDocs] */"} {"signature":"public fun < T > SingleColumn < DataRow < * > > . cols ( firstIndex : Int , vararg otherIndices : Int , ) : ColumnSet < T >","body":"= this . ensureIsColumnGroup ( ) . colsInternal ( headPlusArray ( firstIndex , otherIndices ) ) . cast ( )","docstring":"/** @include [SingleColumnColsIndicesDocs] */"} {"signature":"@ Suppress ( \"\" ) @ JvmName ( \"\" ) public fun String . cols ( firstIndex : Int , vararg otherIndices : Int , ) : ColumnSet < * >","body":"= cols < Any ? > ( firstIndex , * otherIndices )","docstring":"/** @include [StringColsIndicesDocs] */"} {"signature":"public fun < T > String . cols ( firstIndex : Int , vararg otherIndices : Int , ) : ColumnSet < T >","body":"= columnGroup ( this ) . cols ( firstIndex , * otherIndices ) . cast ( )","docstring":"/** @include [StringColsIndicesDocs] */"} {"signature":"@ Suppress ( \"\" ) @ JvmName ( \"\" ) public fun KProperty < * > . cols ( firstIndex : Int , vararg otherIndices : Int , ) : ColumnSet < * >","body":"= cols < Any ? > ( firstIndex , * otherIndices )","docstring":"/** @include [KPropertyColsIndicesDocs] */"} {"signature":"public fun < T > KProperty < * > . cols ( firstIndex : Int , vararg otherIndices : Int , ) : ColumnSet < T >","body":"= columnGroup ( this ) . cols ( firstIndex , * otherIndices ) . cast ( )","docstring":"/** @include [KPropertyColsIndicesDocs] */"} {"signature":"@ Suppress ( \"\" ) @ JvmName ( \"\" ) public fun ColumnPath . cols ( firstIndex : Int , vararg otherIndices : Int , ) : ColumnSet < * >","body":"= cols < Any ? > ( firstIndex , * otherIndices )","docstring":"/** @include [ColumnPathColsIndicesDocs] */"} {"signature":"public fun < T > ColumnPath . cols ( firstIndex : Int , vararg otherIndices : Int , ) : ColumnSet < T >","body":"= columnGroup ( this ) . cols ( firstIndex , * otherIndices ) . cast ( )","docstring":"/** @include [ColumnPathColsIndicesDocs] */"} {"signature":"@ Suppress ( \"\" ) public fun < C > ColumnSet < C > . cols ( range : IntRange ) : ColumnSet < C >","body":"= colsInternal ( range ) as ColumnSet < C >","docstring":"/** @include [ColumnSetColsRangeDocs] */"} {"signature":"public operator fun < C > ColumnSet < C > . get ( range : IntRange ) : ColumnSet < C >","body":"= cols ( range )","docstring":"/** @include [ColumnSetColsRangeDocs] */"} {"signature":"@ Suppress ( \"\" ) @ JvmName ( \"\" ) public fun ColumnsSelectionDsl < * > . cols ( range : IntRange ) : ColumnSet < * >","body":"= cols < Any ? > ( range )","docstring":"/** @include [ColumnsSelectionDslColsRangeDocs] */"} {"signature":"public fun < T > ColumnsSelectionDsl < * > . cols ( range : IntRange ) : ColumnSet < T >","body":"= this . asSingleColumn ( ) . colsInternal ( range ) . cast ( )","docstring":"/** @include [ColumnsSelectionDslColsRangeDocs] */"} {"signature":"@ Suppress ( \"\" ) @ JvmName ( \"\" ) public fun SingleColumn < DataRow < * > > . cols ( range : IntRange ) : ColumnSet < * >","body":"= cols < Any ? > ( range )","docstring":"/** @include [SingleColumnColsRangeDocs] */"} {"signature":"public fun < T > SingleColumn < DataRow < * > > . cols ( range : IntRange ) : ColumnSet < T >","body":"= this . ensureIsColumnGroup ( ) . colsInternal ( range ) . cast ( )","docstring":"/** @include [SingleColumnColsRangeDocs] */"} {"signature":"@ Suppress ( \"\" ) @ JvmName ( \"\" ) public fun String . cols ( range : IntRange ) : ColumnSet < * >","body":"= cols < Any ? > ( range )","docstring":"/** @include [StringColsRangeDocs] */"} {"signature":"public fun < T > String . cols ( range : IntRange ) : ColumnSet < T >","body":"= columnGroup ( this ) . cols ( range ) . cast ( )","docstring":"/** @include [StringColsRangeDocs] */"} {"signature":"@ Suppress ( \"\" ) @ JvmName ( \"\" ) public fun KProperty < * > . cols ( range : IntRange ) : ColumnSet < * >","body":"= cols < Any ? > ( range )","docstring":"/** @include [KPropertyColsRangeDocs] */"} {"signature":"public fun < T > KProperty < * > . cols ( range : IntRange ) : ColumnSet < T >","body":"= columnGroup ( this ) . cols ( range ) . cast ( )","docstring":"/** @include [KPropertyColsRangeDocs] */"} {"signature":"@ Suppress ( \"\" ) @ JvmName ( \"\" ) public fun ColumnPath . cols ( range : IntRange ) : ColumnSet < * >","body":"= cols < Any ? > ( range )","docstring":"/** @include [ColumnPathColsRangeDocs] */"} {"signature":"public fun < T > ColumnPath . cols ( range : IntRange ) : ColumnSet < T >","body":"= columnGroup ( this ) . cols ( range ) . cast ( )","docstring":"/** @include [ColumnPathColsRangeDocs] */"} {"signature":"internal fun ColumnsResolver < * > . colsInternal ( predicate : ColumnFilter < * > ) : TransformableColumnSet < * >","body":"= allColumnsInternal ( ) . transform { it . filter ( predicate ) }","docstring":"/**\n * If this [ColumnsResolver] is a [SingleColumn], it\n * returns a new [ColumnSet] containing the columns inside of this [SingleColumn] that\n * match the given [predicate].\n *\n * Else, it returns a new [ColumnSet] containing all columns in this [ColumnsResolver] that\n * match the given [predicate].\n */"} {"signature":"public fun parse ( value : String ) : KlibTarget","body":"{ require ( value . isNotBlank ( ) ) { \"\" } if ( ! value . contains ( '' ) ) { return KlibTarget ( value ) } val parts = value . split ( '' ) if ( parts . size != || parts . any { it . isBlank ( ) } ) { throw IllegalArgumentException ( \"\" ) } return KlibTarget ( parts [ ] , parts [ ] ) }","docstring":"/**\n * Parses a [KlibTarget] from a [value] string in a long (`.`)\n * or a short (``) format.\n *\n * @throws IllegalArgumentException if [value] does not conform the format.\n */"} {"signature":"override fun hashCode ( ) : Int","body":"= super < AbstractMutableSet > . hashCode ( )","docstring":"/**\n * We provide [equals], so as a matter of style, we should also provide [hashCode].\n * However, the implementation from [AbstractMutableSet] is enough.\n */"} {"signature":"fun translateAccessors ( descriptor : VariableDescriptorWithAccessors , declaration : KtProperty ? , result : MutableList < JsPropertyInitializer > , context : TranslationContext )","body":"{ if ( descriptor is PropertyDescriptor && ( descriptor . modality == Modality . ABSTRACT || JsDescriptorUtils . isSimpleFinalProperty ( descriptor ) ) ) return PropertyTranslator ( descriptor , declaration , context ) . translate ( result ) }","docstring":"/**\n * Translates single property /w accessors.\n */"} {"signature":"fun foo ( )","body":"{ }","docstring":"/**\n * Doc comment\n */"} {"signature":"@ JsName ( \"\" ) @ OptIn ( ExperimentalSerializationApi :: class ) internal fun < T > Json . encodeDynamic ( serializer : SerializationStrategy < T > , value : T ) : dynamic","body":"{ if ( serializer . descriptor . kind is PrimitiveKind || serializer . descriptor . kind is SerialKind . ENUM ) { val encoder = DynamicPrimitiveEncoder ( this ) encoder . encodeSerializableValue ( serializer , value ) return encoder . result } val encoder = DynamicObjectEncoder ( this , false ) encoder . encodeSerializableValue ( serializer , value ) return encoder . result }","docstring":"/**\n * Converts Kotlin data structures to plain Javascript objects\n *\n *\n * Limitations:\n * * Map keys must be of primitive or enum type\n * * Enums are serialized as the value of `@SerialName` if present or their name, in that order.\n * * Currently does not support polymorphism\n *\n * Example of usage:\n * ```\n * @Serializable\n * open class DataWrapper(open val s: String, val d: String?)\n *\n * val wrapper = DataWrapper(\"foo\", \"bar\")\n * val plainJS: dynamic = DynamicObjectSerializer().serialize(DataWrapper.serializer(), wrapper)\n * ```\n */"} {"signature":"public operator fun < T : SelfInvocationContext > T . invoke ( block : T . ( ) -> Unit ) : T","body":"= apply ( block )","docstring":"/**\n * Creates a context with this [SelfInvocationContext] as a receiver and applies to this.\n */"} {"signature":"fun put ( key : K , value : D , oldValue : D ? ) : S","body":"{ @ Suppress ( \"\" ) if ( value == oldValue ) return this as S return copy ( map . put ( key , value ) ) }","docstring":"/**\n * This overload exists just for sake of optimizations: in some cases we've just retrieved the old value,\n * so we don't need to scan through the persistent hashmap again\n */"} {"signature":"fun mobilenetWithAdditionalTraining ( )","body":"{ val modelHub = TFModelHub ( cacheDirectory = File ( \"\" ) ) val modelType = TFModels . CV . MobileNet ( ) val model = modelHub . loadModel ( modelType ) val hdfFile = modelHub . loadWeights ( modelType ) model . use { it . compile ( optimizer = Adam ( ) , loss = Losses . MAE , metric = Metrics . ACCURACY ) it . logSummary ( ) } val layers = model . layers . toMutableList ( ) layers . forEach ( Layer :: freeze ) val lastLayer = layers . last ( ) for ( outboundLayer in lastLayer . inboundLayers ) outboundLayer . outboundLayers . remove ( lastLayer ) layers . removeLast ( ) var x = Dense ( name = \"\" , kernelInitializer = GlorotUniform ( ) , biasInitializer = GlorotUniform ( ) , outputSize = , activation = Activations . Relu ) ( layers . last ( ) ) x = Dense ( name = \"\" , kernelInitializer = GlorotUniform ( ) , biasInitializer = GlorotUniform ( ) , outputSize = NUM_CLASSES , activation = Activations . Linear ) ( x ) val model2 = Functional . fromOutput ( x ) val dogsCatsImages = dogsCatsSmallDatasetPath ( ) val dataset = OnHeapDataset . create ( File ( dogsCatsImages ) , FromFolders ( mapping = mapOf ( \"\" to , \"\" to ) ) , modelType . createPreprocessing ( model2 ) ) . shuffle ( ) val ( train , test ) = dataset . split ( TRAIN_TEST_SPLIT_RATIO ) model2 . use { it . compile ( optimizer = Adam ( ) , loss = Losses . SOFT_MAX_CROSS_ENTROPY_WITH_LOGITS , metric = Metrics . ACCURACY ) it . logSummary ( ) it . loadWeightsForFrozenLayers ( hdfFile ) val accuracyBeforeTraining = it . evaluate ( dataset = test , batchSize = TEST_BATCH_SIZE ) . metrics [ Metrics . ACCURACY ] println ( \"\" ) it . fit ( dataset = train , batchSize = TRAINING_BATCH_SIZE , epochs = EPOCHS ) val accuracyAfterTraining = it . evaluate ( dataset = test , batchSize = TEST_BATCH_SIZE ) . metrics [ Metrics . ACCURACY ] println ( \"\" ) } }","docstring":"/**\n * This example demonstrates the transfer learning 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 * - All layers, excluding the last [Dense], are added to the new Neural Network, its weights are frozen.\n * - New Dense layers are added and initialized via defined initializers.\n * - Model is re-trained on [dogsCatsSmallDatasetPath] dataset.\n * - Special preprocessing (used in MobileNet during training on ImageNet dataset) is applied to each image before prediction via [call] stage.\n *\n * We use the preprocessing DSL to describe the dataset generation pipeline.\n * We demonstrate the workflow on the subset of Kaggle Cats vs Dogs binary classification dataset.\n */"} {"signature":"fun main ( ) : Unit","body":"= mobilenetWithAdditionalTraining ( )","docstring":"/** */"} {"signature":"public suspend fun collect ( collector : FlowCollector < T > )","body":"public suspend fun collect ( collector : FlowCollector < T > )","docstring":"/**\n * Accepts the given [collector] and [emits][FlowCollector.emit] values into it.\n *\n * This method can be used along with SAM-conversion of [FlowCollector]:\n * ```\n * myFlow.collect { value -> println(\"Collected $value\") }\n * ```\n *\n * ### Method inheritance\n *\n * To ensure the context preservation property, it is not recommended implementing this method directly.\n * Instead, [AbstractFlow] can be used as the base type to properly ensure flow's properties.\n *\n * All default flow implementations ensure context preservation and exception transparency properties on a best-effort basis\n * and throw [IllegalStateException] if a violation was detected.\n */"} {"signature":"public abstract suspend fun collectSafely ( collector : FlowCollector < T > )","body":"public abstract suspend fun collectSafely ( collector : FlowCollector < T > )","docstring":"/**\n * Accepts the given [collector] and [emits][FlowCollector.emit] values into it.\n *\n * A valid implementation of this method has the following constraints:\n * 1) It should not change the coroutine context (e.g. with `withContext(Dispatchers.IO)`) when emitting values.\n * The emission should happen in the context of the [collect] call.\n * Please refer to the top-level [Flow] documentation for more details.\n * 2) It should serialize calls to [emit][FlowCollector.emit] as [FlowCollector] implementations are not\n * thread-safe by default.\n * To automatically serialize emissions [channelFlow] builder can be used instead of [flow]\n *\n * @throws IllegalStateException if any of the invariants are violated.\n */"} {"signature":"public fun status ( statusConfig : FirResolvedDeclarationStatusImpl . ( ) -> Unit )","body":"{ statusConfigs += statusConfig }","docstring":"/**\n * Allows to configure flags in status of declaration\n * For full list of possible flags refer to [FirDeclarationStatus] class\n * Note that not all flags are meaningful for each declaration\n * E.g. there is no point to mark function as inner\n */"} {"signature":"public open fun typeParameter ( name : Name , variance : Variance = Variance . INVARIANT , isReified : Boolean = false , key : GeneratedDeclarationKey = this @ DeclarationBuildingContext . key , config : TypeParameterBuildingContext . ( ) -> Unit = { } )","body":"{ typeParameters += TypeParameterData ( name , variance , isReified , TypeParameterBuildingContext ( ) . apply ( config ) . boundProviders , key ) }","docstring":"/**\n * Adds type parameter with specified [name] and [variance] to declaration\n *\n * Upper bounds of type parameters can be configured in [config] lambda\n *\n * If no bounds passed then `kotlin.Any?` bound will be added automatically\n */"} {"signature":"public fun bound ( type : ConeKotlinType )","body":"{ bound { type } }","docstring":"/**\n * Declares [type] as upper bound of type parameter\n */"} {"signature":"public fun bound ( typeProvider : ( List < FirTypeParameterRef > ) -> ConeKotlinType )","body":"{ boundProviders += typeProvider }","docstring":"/**\n * Type produced by [typeProvider] will be an upper bound of the type parameter\n *\n * Use this method when bounds of your type parameters depend on each other\n * For example, in this case:\n * ```\n * interface Out\n *\n * fun foo() where T : R, R : Out {}\n * ```\n */"} {"signature":"public open fun contextReceiver ( type : ConeKotlinType )","body":"{ contextReceiver { type } }","docstring":"/**\n * Adds context receiver with [type] type to declaration\n */"} {"signature":"public open fun contextReceiver ( typeProvider : ( List < FirTypeParameterRef > ) -> ConeKotlinType )","body":"{ contextReceiverTypeProviders += typeProvider }","docstring":"/**\n * Adds context receiver with type provided by [typeProvider] to declaration\n * Use this overload when context receiver type uses type parameters of constructed declaration\n */"} {"signature":"actual fun getCurrentDate ( ) : String","body":"{ return \"\" }","docstring":"/**\n * JS actual implementation for `getCurrentDate`\n */"} {"signature":"fun main ( )","body":"{ val ( train , test ) = fashionMnist ( ) val jsonConfigFile = getJSONConfigFileToyResNet ( ) val model = Functional . loadModelConfiguration ( jsonConfigFile ) model . use { it . compile ( optimizer = Adam ( ) , loss = Losses . SOFT_MAX_CROSS_ENTROPY_WITH_LOGITS , metric = Metrics . ACCURACY ) it . logSummary ( ) val hdfFile = getWeightsFileToyResNet ( ) it . loadWeights ( hdfFile ) var accuracy = it . evaluate ( dataset = test , batchSize = ) . metrics [ Metrics . ACCURACY ] println ( \"\" ) it . freeze ( ) it . layers . last ( ) . unfreeze ( ) it . fit ( dataset = train , epochs = , batchSize = ) accuracy = it . evaluate ( dataset = test , batchSize = ) . metrics [ Metrics . ACCURACY ] println ( \"\" ) } }","docstring":"/**\n * So, let's update the weights of last layer of the pretrained model from Keras.\n *\n * All layers except last should be frozen.\n *\n * As a result the training will be fast.\n */"} {"signature":"@ Test fun testUnconfinedDispatcher ( )","body":"= runTest { val values = mutableListOf < Int > ( ) val stateFlow = MutableStateFlow ( ) val job = launch ( UnconfinedTestDispatcher ( testScheduler ) ) { stateFlow . collect { values . add ( it ) } } stateFlow . value = stateFlow . value = stateFlow . value = job . cancel ( ) assertEquals ( listOf ( , , , ) , values ) }","docstring":"/** An example from the [UnconfinedTestDispatcher] documentation. */"} {"signature":"@ Test fun testEagerlyEnteringChildCoroutines ( )","body":"= runTest ( UnconfinedTestDispatcher ( ) ) { var entered = false val deferred = CompletableDeferred < Unit > ( ) var completed = false launch { entered = true deferred . await ( ) completed = true } assertTrue ( entered ) assertFalse ( completed ) deferred . complete ( Unit ) assertTrue ( completed ) }","docstring":"/** Tests that child coroutines are eagerly entered. */"} {"signature":"@ Test fun testSchedulerReuse ( )","body":"{ val dispatcher1 = StandardTestDispatcher ( ) Dispatchers . setMain ( dispatcher1 ) try { val dispatcher2 = UnconfinedTestDispatcher ( ) assertSame ( dispatcher1 . scheduler , dispatcher2 . scheduler ) } finally { Dispatchers . resetMain ( ) } }","docstring":"/** Tests that the [TestCoroutineScheduler] used for [Dispatchers.Main] gets used by default. */"} {"signature":"@ kotlin . internal . InlineOnly public inline fun String . toRegex ( ) : Regex","body":"= Regex ( this )","docstring":"/**\n * Converts the string into a regular expression [Regex] with the default options.\n */"} {"signature":"@ kotlin . internal . InlineOnly public inline fun String . toRegex ( option : RegexOption ) : Regex","body":"= Regex ( this , option )","docstring":"/**\n * Converts the string into a regular expression [Regex] with the specified single [option].\n */"} {"signature":"@ kotlin . internal . InlineOnly public inline fun String . toRegex ( options : Set < RegexOption > ) : Regex","body":"= Regex ( this , options )","docstring":"/**\n * Converts the string into a regular expression [Regex] with the specified set of [options].\n */"} {"signature":"@ SinceKotlin ( \"\" ) public expect operator fun MatchGroupCollection . get ( name : String ) : MatchGroup ?","body":"@ SinceKotlin ( \"\" ) public expect operator fun MatchGroupCollection . get ( name : String ) : MatchGroup ?","docstring":"/**\n * Returns a named group with the specified [name].\n *\n * @return An instance of [MatchGroup] if the group with the specified [name] was matched or `null` otherwise.\n * @throws IllegalArgumentException if there is no group with the specified [name] defined in the regex pattern.\n * @throws UnsupportedOperationException if this match group collection doesn't support getting match groups by name,\n * for example, when it's not supported by the current platform.\n */"} {"signature":"public fun declarationsByAnnotation ( queriedAnnotation : ClassId ) : Set < KtAnnotated >","body":"public fun declarationsByAnnotation ( queriedAnnotation : ClassId ) : Set < KtAnnotated >","docstring":"/**\n * @param queriedAnnotation A qualified name of the annotation in question.\n * @return A set of PSI declarations which have [queriedAnnotation] declared directly on them.\n * Might contain both false positives and false negatives.\n */"} {"signature":"public fun annotationsOnDeclaration ( declaration : KtAnnotated ) : Set < ClassId >","body":"public fun annotationsOnDeclaration ( declaration : KtAnnotated ) : Set < ClassId >","docstring":"/**\n * @param declaration A [org.jetbrains.kotlin.psi.KtDeclaration] or [org.jetbrains.kotlin.psi.KtFile] to resolve annotations on. Other\n * [KtElement]s are not supported.\n * @return A set of annotations declared directly on the [declaration]. Might contain both false positives and false negatives.\n */"} {"signature":"public fun createAnnotationResolver ( searchScope : GlobalSearchScope ) : KotlinAnnotationsResolver","body":"public fun createAnnotationResolver ( searchScope : GlobalSearchScope ) : KotlinAnnotationsResolver","docstring":"/**\n * @param searchScope A scope in which the created [KotlinAnnotationsResolver] will operate. Make sure that this scope contains all\n * the annotations that you might want to resolve.\n */"} {"signature":"fun identicalArguments ( a : SimpleTypeMarker , b : SimpleTypeMarker )","body":"= false","docstring":"/**\n * @return true is a.arguments == b.arguments, or false if not supported\n */"} {"signature":"fun CapturedTypeMarker . hasRawSuperType ( ) : Boolean","body":"fun CapturedTypeMarker . hasRawSuperType ( ) : Boolean","docstring":"/**\n * Only for K2.\n */"} {"signature":"fun useRefinedBoundsForTypeVariableInFlexiblePosition ( ) : Boolean","body":"fun useRefinedBoundsForTypeVariableInFlexiblePosition ( ) : Boolean","docstring":"/**\n * For case Foo <: (T..T?) return LowerConstraint for new constraint LowerConstraint <: T\n * In K1, in case nullable it was just Foo?, so constraint was Foo? <: T\n * But it's not 100% correct because prevent having not-nullable upper constraint on T while initial (Foo? <: (T..T?)) is not violated\n *\n * In FIR, we try to have a correct one: (Foo & Any..Foo?) <: T\n *\n * The same logic applies for T! <: UpperConstraint, as well\n * In K1, it was reduced to T <: UpperConstraint..UpperConstraint?\n * In FIR, we use UpperConstraint & Any..UpperConstraint?\n *\n * In future once we have only FIR (or FE 1.0 behavior is fixed) this method should be inlined to the use-site\n */"} {"signature":"fun KotlinTypeMarker . convertToNonRaw ( ) : KotlinTypeMarker","body":"fun KotlinTypeMarker . convertToNonRaw ( ) : KotlinTypeMarker","docstring":"/**\n * It's only relevant for K2 (and is not expected to be implemented properly in other contexts)\n */"} {"signature":"fun SimpleTypeMarker . isSingleClassifierType ( ) : Boolean","body":"fun SimpleTypeMarker . isSingleClassifierType ( ) : Boolean","docstring":"/**\n *\n * SingleClassifierType is one of the following types:\n * - classType\n * - type for type parameter\n * - captured type\n *\n * Such types can contains error types in our arguments, but type constructor isn't errorTypeConstructor\n */"} {"signature":"fun TypeSubstitutorMarker . safeSubstitute ( type : KotlinTypeMarker ) : KotlinTypeMarker","body":"fun TypeSubstitutorMarker . safeSubstitute ( type : KotlinTypeMarker ) : KotlinTypeMarker","docstring":"/**\n * @returns substituted type or [type] if there were no substitution\n */"} {"signature":"fun check ( resolvedCall : ResolvedCall < * > , reportOn : PsiElement , context : CallCheckerContext )","body":"fun check ( resolvedCall : ResolvedCall < * > , reportOn : PsiElement , context : CallCheckerContext )","docstring":"/**\n * Note that [reportOn] should only be used as a target element for diagnostics reported by checkers.\n * Logic of the checker should not depend on what element is the target of the diagnostic!\n */"} {"signature":"@ JvmName ( \"\" ) public infix fun < T : Number > MultiArray < T , D2 > . dot ( b : MultiArray < T , D2 > ) : NDArray < T , D2 >","body":"= mk . linalg . linAlgEx . dotMM ( this , b )","docstring":"/**\n * Returns the matrix product of two numeric matrices.\n *\n * same as [LinAlg.dot]\n */"} {"signature":"@ JvmName ( \"\" ) public infix fun < T : Complex > MultiArray < T , D2 > . dot ( b : MultiArray < T , D2 > ) : NDArray < T , D2 >","body":"= mk . linalg . linAlgEx . dotMMComplex ( this , b )","docstring":"/**\n * Returns the matrix product of two complex matrices.\n *\n * same as [LinAlg.dot]\n */"} {"signature":"@ JvmName ( \"\" ) public infix fun < T : Number > MultiArray < T , D2 > . dot ( b : MultiArray < T , D1 > ) : NDArray < T , D1 >","body":"= mk . linalg . linAlgEx . dotMV ( this , b )","docstring":"/**\n * Returns the matrix product of a numeric matrix and a numeric vector.\n *\n * same as [LinAlg.dot]\n */"} {"signature":"@ JvmName ( \"\" ) public infix fun < T : Complex > MultiArray < T , D2 > . dot ( b : MultiArray < T , D1 > ) : NDArray < T , D1 >","body":"= mk . linalg . linAlgEx . dotMVComplex ( this , b )","docstring":"/**\n * Returns the matrix product of a complex matrix and a complex vector.\n *\n * same as [LinAlg.dot]\n */"} {"signature":"@ JvmName ( \"\" ) public infix fun < T : Number > MultiArray < T , D1 > . dot ( b : MultiArray < T , D1 > ) : T","body":"= mk . linalg . linAlgEx . dotVV ( this , b )","docstring":"/**\n * Returns the product of two numeric vectors.\n *\n * same as [LinAlg.dot]\n */"} {"signature":"@ JvmName ( \"\" ) public infix fun < T : Complex > MultiArray < T , D1 > . dot ( b : MultiArray < T , D1 > ) : T","body":"= mk . linalg . linAlgEx . dotVVComplex ( this , b )","docstring":"/**\n * Returns the product of two complex vectors.\n *\n * same as [LinAlg.dot]\n */"} {"signature":"private fun pageId ( dri : DRI , sourceSets : Set < DisplaySourceSet > ) : String","body":"= \"\"","docstring":"/**\n * Page Id is required to have a sourceSet in order to distinguish between different pages that has same DRI but different sourceSet\n * like main functions that are not expect/actual\n */"} {"signature":"protected open fun transformDeserialize ( element : JsonElement ) : JsonElement","body":"= element","docstring":"/**\n * Transformation that happens during [deserialize] call.\n * Does nothing by default.\n *\n * During deserialization, a value from JSON is firstly decoded to a [JsonElement],\n * user transformation in [transformDeserialize] is applied,\n * and then resulting [JsonElement] is deserialized to [T] with [tSerializer].\n */"} {"signature":"protected open fun transformSerialize ( element : JsonElement ) : JsonElement","body":"= element","docstring":"/**\n * Transformation that happens during [serialize] call.\n * Does nothing by default.\n *\n * During serialization, a value of type [T] is serialized with [tSerializer] to a [JsonElement],\n * user transformation in [transformSerialize] is applied, and then resulting [JsonElement] is encoded to a JSON string.\n */"} {"signature":"fun getOverriddenKotlinApiVersion ( project : Project ) : KotlinVersion ?","body":"{ val apiVersion = project . rootProject . properties [ \"\" ] as? String return if ( apiVersion != null ) { LOGGER . info ( \"\"\"\"\"\" ) KotlinVersion . fromVersion ( apiVersion ) } else { null } }","docstring":"/**\n * Should be used for running against of non-released Kotlin compiler on a system test level.\n *\n * @return a Kotlin API version parametrized from command line nor gradle.properties, null otherwise\n */"} {"signature":"fun getOverriddenKotlinLanguageVersion ( project : Project ) : KotlinVersion ?","body":"{ val languageVersion = project . rootProject . properties [ \"\" ] as? String return if ( languageVersion != null ) { LOGGER . info ( \"\"\"\"\"\" ) KotlinVersion . fromVersion ( languageVersion ) } else { null } }","docstring":"/**\n * Should be used for running against of non-released Kotlin compiler on a system test level\n *\n * @return a Kotlin Language version parametrized from command line nor gradle.properties, null otherwise\n */"} {"signature":"fun getKotlinDevRepositoryUrl ( project : Project ) : URI ?","body":"{ val url : String ? = project . rootProject . properties [ \"\" ] as? String if ( url != null ) { LOGGER . info ( \"\"\"\"\"\" ) return URI . create ( url ) } return null }","docstring":"/**\n * Should be used for running against of non-released Kotlin compiler on a system test level\n * Kotlin compiler artifacts are expected to be downloaded from maven central by default.\n * In case of compiling with not-published into the MC kotlin compiler artifacts, a kotlin_repo_url gradle parameter should be specified.\n * To reproduce a build locally, a kotlin/dev repo should be passed\n *\n * @return an url for a kotlin compiler repository parametrized from command line nor gradle.properties, empty string otherwise\n */"} {"signature":"fun addDevRepositoryIfEnabled ( rh : RepositoryHandler , project : Project )","body":"{ val devRepoUrl = getKotlinDevRepositoryUrl ( project ) ? : return rh . maven { url = devRepoUrl } }","docstring":"/**\n * Adds a kotlin-dev space repository with dev versions of Kotlin if Kotlin aggregate build is enabled\n */"} {"signature":"fun Project . configureCommunityBuildTweaks ( )","body":"{ if ( ! isSnapshotTrainEnabled ( this ) ) return allprojects { tasks . withType < Test > ( ) . configureEach { exclude ( \"\" ) exclude ( \"\" ) exclude ( \"\" ) exclude ( \"\" ) exclude ( \"\" ) exclude ( \"\" ) exclude ( \"\" ) } } println ( \"\" ) val coreProject = subprojects . single { it . name == coreModule } configure ( listOf ( coreProject ) ) { configurations . matching { it . name == \"\" } . configureEach { val config = resolvedConfiguration . files . single { it . name . contains ( \"\" ) } val manifest = zipTree ( config ) . matching { include ( \"\" ) } . files . single ( ) manifest . readLines ( ) . forEach { println ( it ) } } } }","docstring":"/**\n * Changes the build config when 'build_snapshot_train' is enabled:\n * Disables flaky and Kotlin-specific tests, prints the real version of Kotlin applied (to be sure overridden version of Kotlin is properly picked).\n */"} {"signature":"fun getOverriddenKotlinVersion ( project : Project ) : String ?","body":"= if ( isSnapshotTrainEnabled ( project ) ) { val snapshotVersion = project . rootProject . properties [ \"\" ] ? : error ( \"\" ) snapshotVersion . toString ( ) } else { null }","docstring":"/**\n * Ensures that, if [isSnapshotTrainEnabled] is true, the project is built with a snapshot version of Kotlin compiler.\n */"} {"signature":"fun isSnapshotTrainEnabled ( project : Project ) : Boolean","body":"= when ( project . rootProject . properties [ \"\" ] ) { null -> false \"\" -> false else -> true }","docstring":"/**\n * Checks if the project is built with a snapshot version of Kotlin compiler.\n */"} {"signature":"fun defaultSourceFolder ( project : Project , sourceSetName : String , type : String ) : File","body":"{ return project . file ( \"\" ) }","docstring":"/**\n * @return default location of source folders for a kotlin source set\n * e.g. src/jvmMain/kotlin (sourceSetName=\"jvmMain\", type=\"kotlin\")\n */"} {"signature":"fun Path . addPrivateVal ( ) : Path","body":"{ appendText ( \"\" ) return this }","docstring":"/**\n * Appends top-level `private val` to the content of the file.\n * Throws SecurityException or IOException, if append failed.\n * Every call to [addPrivateVal] or [addPublicVal] generates a new value name.\n */"} {"signature":"fun Path . addPublicVal ( ) : Path","body":"{ appendText ( \"\" ) return this }","docstring":"/**\n * Appends top-level `public val` to the content of the file.\n * Throws SecurityException or IOException, if append failed.\n * Every call to [addPrivateVal] or [addPublicVal] generates a new value name.\n */"} {"signature":"@ Test fun testSynchronizedObjectBytecode ( )","body":"= checkBytecode ( SynchronizedObjectTest :: class . java , listOf ( KOTLINX_ATOMICFU ) )","docstring":"/**\n * Test [SynchronizedObjectTest].\n */"} {"signature":"@ Test fun testAtomicFieldBytecode ( )","body":"= checkBytecode ( AtomicFieldTest :: class . java , listOf ( KOTLINX_ATOMICFU ) )","docstring":"/**\n * Test [AtomicFieldTest].\n */"} {"signature":"@ Test fun testReentrantLockBytecode ( )","body":"= checkBytecode ( ReentrantLockTest :: class . java , listOf ( KOTLINX_ATOMICFU ) )","docstring":"/**\n * Test [ReentrantLockTest].\n */"} {"signature":"@ Test fun testTraceUseBytecode ( )","body":"= checkBytecode ( TraceUseTest :: class . java , listOf ( KOTLINX_ATOMICFU ) )","docstring":"/**\n * Test [TraceUseTest].\n */"} {"signature":"fun foo ( ) : Boolean","body":"= TODO ( )","docstring":"/**\n * this is a sample comment for func on class with package\n */"} {"signature":"fun < PARAM > usage ( )","body":"{ }","docstring":"/**\n * [PARAM.anyExt]\n * [PARAM.genericExt]\n */"} {"signature":"fun nestedUsage ( )","body":"{ }","docstring":"/**\n * [CLASS_PARAM.anyExt]\n * [CLASS_PARAM.genericExt]\n */"} {"signature":"public fun line ( string : String )","body":"{ lineBuffer . add ( string ) }","docstring":"/**\n * Adds solid line to tooltips with given string value.\n *\n * @param string text of the line.\n */"} {"signature":"public fun KProperty < * > . tooltipValue ( format : String ? = null ) : String","body":"{ @ Suppress ( \"\" ) val colID = layerContextInterface . datasetHandler . takeColumn ( this . name ) addFormat ( colID , format ) return \"\" }","docstring":"/**\n * Inserts value of given column into formatted string.\n *\n * @receiver property with a name of column whose value will be inserted into the tooltip.\n * @param format value format.\n * @return formatted string.\n */"} {"signature":"public fun String . tooltipValue ( format : String ? = null ) : String","body":"{ @ Suppress ( \"\" ) val colID = layerContextInterface . datasetHandler . takeColumn ( this ) addFormat ( colID , format ) return \"\" }","docstring":"/**\n * Inserts value of given column into formatted string.\n *\n * @receiver name of column whose value will be inserted into the tooltip.\n * @param format value format.\n * @return formatted string.\n */"} {"signature":"public fun ColumnReference < * > . tooltipValue ( format : String ? = null ) : String","body":"{ @ Suppress ( \"\" ) val colID = layerContextInterface . datasetHandler . addColumn ( this ) addFormat ( colID , format ) return \"\" }","docstring":"/**\n * Inserts value of given column into formatted string.\n *\n * @receiver column whose value will be inserted into the tooltip.\n * @param format value format.\n * @return formatted string.\n */"} {"signature":"public fun line ( leftSide : String ? = null , rightSide : String ? = null )","body":"{ lineBuffer . add ( \"\" ) }","docstring":"/**\n * Adds two-sided line to tooltips with given string values.\n *\n * @param leftSide text of the left side of line\n * @param rightSide text of the right side of line\n */"} {"signature":"public fun line ( column : ColumnReference < * > , format : String ? = null )","body":"{ @ Suppress ( \"\" ) addVarLine ( layerContextInterface . datasetHandler . addColumn ( column ) . also { addFormat ( it , format ) } ) }","docstring":"/**\n * Adds standard line for the given column\n * (name of the column on the left side and the corresponding value on the right side).\n *\n * @param column column whose value will be displayed.\n */"} {"signature":"public fun line ( property : KProperty < * > , format : String ? = null )","body":"{ @ Suppress ( \"\" ) addVarLine ( layerContextInterface . datasetHandler . takeColumn ( property . name ) . also { addFormat ( it , format ) } ) }","docstring":"/**\n * Adds standard line for given column.\n * (Name of the column on the left side and the corresponding value on the right side).\n *\n * @param property property with the name of column whose value will be displayed.\n */"} {"signature":"public fun varLine ( columnName : String , format : String ? = null )","body":"{ @ Suppress ( \"\" ) addVarLine ( layerContextInterface . datasetHandler . takeColumn ( columnName ) . also { addFormat ( it , format ) } ) }","docstring":"/**\n * Adds standard line for the given column\n * (name of the column on the left side and the corresponding value on the right side).\n *\n * @param columnName name of column whose value will be displayed.\n */"} {"signature":"public fun varLine ( property : KProperty < * > , format : String ? = null )","body":"{ line ( property , format ) }","docstring":"/**\n * Adds standard line for the given column\n * (name of the column on the left side and the corresponding value on the right side).\n *\n * @param property property with the name of column whose value will be displayed.\n */"} {"signature":"public fun varLine ( column : ColumnReference < * > , format : String ? = null )","body":"{ line ( column , format ) }","docstring":"/**\n * Adds standard line for the given column\n * (name of the column on the left side and the corresponding value on the right side).\n *\n * @param column column whose value will be displayed.\n */"} {"signature":"@ OptIn ( ExperimentalForeignApi :: class ) fun < T : CPointed > printPointerRawValue ( pointer : CPointer < T > )","body":"{ println ( pointer . rawValue ) }","docstring":"/**\n * Low-level Linux function\n */"} {"signature":"fun resolveByVersionNumber ( versionNumber : Int ) : AbiSignatureVersion","body":"= AbiSignatureVersions . resolveByVersionNumber ( versionNumber )","docstring":"/**\n * A function to get an instance of [AbiSignatureVersion] by the unique [versionNumber].\n */"} {"signature":"operator fun get ( signatureVersion : AbiSignatureVersion ) : String ?","body":"operator fun get ( signatureVersion : AbiSignatureVersion ) : String ?","docstring":"/**\n * Returns the signature of the specified [AbiSignatureVersion].\n *\n * - If the signature version is not supported by the ABI reader (according to [AbiSignatureVersion.isSupportedByAbiReader])\n * then throw an exception.\n * - If the signature version is supported by the ABI reader, but the signature is unavailable for some other reason\n * (e.g. a particular type of declaration misses a signature of a particular version), then return `null`.\n **/"} {"signature":"infix fun isContainerOf ( member : AbiCompoundName ) : Boolean","body":"{ val containerName = value return when ( val containerNameLength = containerName . length ) { -> true else -> { val memberName = member . value val memberNameLength = memberName . length memberNameLength > containerNameLength + && memberName . startsWith ( containerName ) && memberName [ containerNameLength ] == SEPARATOR } } }","docstring":"/**\n * Whether a declaration with `this` instance of [AbiCompoundName] is a container of a declaration with `member` [AbiCompoundName].\n *\n * Examples:\n * ```\n * AbiCompoundName(\"\") isContainerOf AbiCompoundName() == true\n * AbiCompoundName(\"foo.bar\") isContainerOf AbiCompoundName(\"foo.bar.baz.qux\") == true\n * AbiCompoundName(\"foo.bar\") isContainerOf AbiCompoundName(\"foo.bar.baz\") == true\n * AbiCompoundName(\"foo.bar\") isContainerOf AbiCompoundName(\"foo.barbaz\") == false\n * AbiCompoundName(\"foo.bar\") isContainerOf AbiCompoundName(\"foo.bar\") == false\n * AbiCompoundName(\"foo.bar\") isContainerOf AbiCompoundName(\"foo\") == false\n * ```\n */"} {"signature":"fun hasAnnotation ( annotationClassName : AbiQualifiedName ) : Boolean","body":"fun hasAnnotation ( annotationClassName : AbiQualifiedName ) : Boolean","docstring":"/**\n * Annotations are not a part of ABI. But sometimes it is useful to have the ability to check if some declaration\n * has a specific annotation. See [AbiReadingFilter.NonPublicMarkerAnnotations] as an example.\n */"} {"signature":"fun setInlineCallMetadata ( expression : JsExpression , psiElement : KtElement , descriptor : CallableDescriptor , context : TranslationContext )","body":"{ assert ( CallExpressionTranslator . shouldBeInlined ( descriptor ) ) { \"\" } val candidateNames = setOf ( context . aliasedName ( descriptor ) , context . getInnerNameForDescriptor ( descriptor ) ) val visitor = object : RecursiveJsVisitor ( ) { override fun visitInvocation ( invocation : JsInvocation ) { super . visitInvocation ( invocation ) if ( invocation . name in candidateNames || invocation . name ? . descriptor ? . original == descriptor . original ) { invocation . descriptor = descriptor invocation . isInline = true invocation . psiElement = psiElement } } } visitor . accept ( expression ) context . addInlineCall ( descriptor ) }","docstring":"/**\n * Recursively walks expression and sets metadata for all invocations of descriptor.\n *\n * When JetExpression is compiled, the resulting JsExpression\n * might not be JsInvocation.\n *\n * For example, extension call with nullable receiver:\n * x?.fn(y)\n * will compile to:\n * (x != null) ? fn.call(x, y) : null\n */"} {"signature":"private fun findDeprecatedSinceKotlinAnnotation ( annotations : List < Annotations . Annotation > ) : Annotations . Annotation ?","body":"{ return annotations . firstOrNull { it . dri . packageName == \"\" && it . dri . classNames == \"\" } }","docstring":"/**\n * @see [DeprecatedSinceKotlin]\n */"} {"signature":"private fun DocumentableContentBuilder . createKotlinDeprecatedSectionContent ( deprecatedAnnotation : Annotations . Annotation , allAnnotations : List < Annotations . Annotation > )","body":"{ val deprecatedSinceKotlinAnnotation = findDeprecatedSinceKotlinAnnotation ( allAnnotations ) header ( level = DEPRECATED_HEADER_LEVEL , text = createKotlinDeprecatedHeaderText ( deprecatedAnnotation , deprecatedSinceKotlinAnnotation ) ) deprecatedSinceKotlinAnnotation ? . let { createDeprecatedSinceKotlinFootnoteContent ( it ) } deprecatedAnnotation . takeStringParam ( \"\" ) ? . let { group ( styles = setOf ( TextStyle . Paragraph ) ) { text ( it ) } } createReplaceWithSectionContent ( deprecatedAnnotation ) }","docstring":"/**\n * Section with details for Kotlin's [kotlin.Deprecated] annotation\n */"} {"signature":"private fun DocumentableContentBuilder . createDeprecatedSinceKotlinFootnoteContent ( deprecatedSinceKotlinAnnotation : Annotations . Annotation )","body":"{ group ( styles = setOf ( ContentStyle . Footnote ) ) { deprecatedSinceKotlinAnnotation . takeStringParam ( \"\" ) ? . let { group ( styles = setOf ( TextStyle . Paragraph ) ) { text ( \"\" ) } } deprecatedSinceKotlinAnnotation . takeStringParam ( \"\" ) ? . let { group ( styles = setOf ( TextStyle . Paragraph ) ) { text ( \"\" ) } } deprecatedSinceKotlinAnnotation . takeStringParam ( \"\" ) ? . let { group ( styles = setOf ( TextStyle . Paragraph ) ) { text ( \"\" ) } } } }","docstring":"/**\n * Footnote for [DeprecatedSinceKotlin] annotation used in stdlib\n *\n * Notice that values are empty by default, so it's not guaranteed that all three will be set\n */"} {"signature":"private fun DocumentableContentBuilder . createReplaceWithSectionContent ( kotlinDeprecatedAnnotation : Annotations . Annotation )","body":"{ val replaceWithAnnotation = ( kotlinDeprecatedAnnotation . params [ \"\" ] as? AnnotationValue ) ? . annotation ? : return header ( level = DIRECT_PARAM_HEADER_LEVEL , text = \"\" ) val imports = ( replaceWithAnnotation . params [ \"\" ] as? ArrayValue ) ? . value ? . mapNotNull { ( it as? StringValue ) ? . value } ? : emptyList ( ) if ( imports . isNotEmpty ( ) ) { codeBlock ( language = \"\" , styles = setOf ( TextStyle . Monospace ) ) { imports . forEach { text ( \"\" ) breakLine ( ) } } } replaceWithAnnotation . takeStringParam ( \"\" ) ? . removeSurrounding ( \"\" ) ? . let { codeBlock ( language = \"\" , styles = setOf ( TextStyle . Monospace ) ) { text ( it ) } } }","docstring":"/**\n * Section for [ReplaceWith] parameter of [kotlin.Deprecated] annotation\n */"} {"signature":"private fun DocumentableContentBuilder . createJavaDeprecatedSectionContent ( deprecatedAnnotation : Annotations . Annotation , )","body":"{ val isForRemoval = deprecatedAnnotation . takeBooleanParam ( \"\" , default = false ) header ( level = DEPRECATED_HEADER_LEVEL , text = if ( isForRemoval ) \"\" else \"\" ) deprecatedAnnotation . takeStringParam ( \"\" ) ? . let { group ( styles = setOf ( ContentStyle . Footnote ) ) { text ( \"\" ) } } }","docstring":"/**\n * Section with details for Java's [java.lang.Deprecated] annotation\n */"} {"signature":"fun allModulesProvidingActualsFor ( commonModule : ModuleDescriptor , platformModule : ModuleDescriptor ) : ModuleFilter","body":"= { module -> when { module == commonModule -> true commonModule in module . allExpectedByModules -> true module == platformModule -> true else -> false } }","docstring":"/**\n * @param commonModule: The module for which the allowed modules can provide actuals for.\n * Meaning that all allowed modules will have declared a dependsOn edge to said [commonModule]\n *\n * @param platformModule: This parameter is only required to support pre-hmpp IDE\n * consumers. In this mode, leaf/platform modules will get wrapped using PlatformModuleInfo which\n * will be one [ModuleDescriptor] which wrap all dependsOn sources as well.\n * This module will not declare 'proper' [ModuleDescriptor.allExpectedByModules] to the common module\n * and therefore has to be passed into this filter as well to manually check if an actual was provided by this module.\n * This parameter can be dropped and removed once 'non-hmpp' mode shall not be supported anymore.\n */"} {"signature":"@ OptIn ( InternalIoApi :: class ) public fun Source . readString ( charset : Charset ) : String","body":"{ var req = while ( request ( req ) ) { req *= } return buffer . readStringImpl ( buffer . size , charset ) }","docstring":"/**\n * Decodes whole content of this stream into a string using [charset]. Returns empty string if the source is exhausted.\n *\n * @param charset the [Charset] to use for string decoding.\n *\n * @throws IllegalStateException when the source is closed.\n *\n * @sample kotlinx.io.samples.KotlinxIoSamplesJvm.readWriteStrings\n */"} {"signature":"@ OptIn ( InternalIoApi :: class ) public fun Source . readString ( byteCount : Long , charset : Charset ) : String","body":"{ require ( byteCount ) return buffer . readStringImpl ( byteCount , charset ) }","docstring":"/**\n * Decodes [byteCount] bytes of this stream into a string using [charset].\n *\n * @param byteCount the number of bytes to read from the source for decoding.\n * @param charset the [Charset] to use for string decoding.\n *\n * @throws EOFException when the source exhausted before [byteCount] bytes could be read from it.\n * @throws IllegalStateException when the source is closed.\n * @throws IllegalArgumentException if [byteCount] is negative or its value is greater than [Int.MAX_VALUE].\n *\n * @sample kotlinx.io.samples.KotlinxIoSamplesJvm.readStringBounded\n */"} {"signature":"@ OptIn ( InternalIoApi :: class ) public fun Source . asInputStream ( ) : InputStream","body":"{ val isClosed : ( ) -> Boolean = when ( this ) { is RealSource -> this :: closed is Buffer -> { { false } } } return object : InputStream ( ) { override fun read ( ) : Int { if ( isClosed ( ) ) throw IOException ( \"\" ) if ( exhausted ( ) ) { return - } return readByte ( ) and } override fun read ( data : ByteArray , offset : Int , byteCount : Int ) : Int { if ( isClosed ( ) ) throw IOException ( \"\" ) checkOffsetAndCount ( data . size . toLong ( ) , offset . toLong ( ) , byteCount . toLong ( ) ) return this@asInputStream . readAtMostTo ( data , offset , offset + byteCount ) } override fun available ( ) : Int { if ( isClosed ( ) ) throw IOException ( \"\" ) return minOf ( buffer . size , Integer . MAX_VALUE ) . toInt ( ) } override fun close ( ) = this@asInputStream . close ( ) override fun toString ( ) = \"\" } }","docstring":"/**\n * Returns an input stream that reads from this source. Closing the stream will also close this source.\n *\n * @sample kotlinx.io.samples.KotlinxIoSamplesJvm.asStream\n */"} {"signature":"@ OptIn ( InternalIoApi :: class ) public fun Source . readAtMostTo ( sink : ByteBuffer ) : Int","body":"{ if ( buffer . size == ) { request ( Segment . SIZE . toLong ( ) ) if ( buffer . size == ) return - } return buffer . readAtMostTo ( sink ) }","docstring":"/**\n * Reads at most [ByteBuffer.remaining] bytes from this source into [sink] and returns the number of bytes read.\n *\n * @param sink the sink to write the data to.\n *\n * @throws IllegalStateException when the source is closed.\n *\n * @sample kotlinx.io.samples.KotlinxIoSamplesJvm.readWriteByteBuffer\n */"} {"signature":"public fun Source . asByteChannel ( ) : ReadableByteChannel","body":"{ val isClosed : ( ) -> Boolean = when ( this ) { is RealSource -> this :: closed is Buffer -> { { false } } } return object : ReadableByteChannel { override fun close ( ) { this@asByteChannel . close ( ) } override fun isOpen ( ) : Boolean = ! isClosed ( ) override fun read ( sink : ByteBuffer ) : Int = this@asByteChannel . readAtMostTo ( sink ) } }","docstring":"/**\n * Returns [ReadableByteChannel] backed by this source. Closing the source will close the source.\n */"} {"signature":"private fun TypeSystemContext . strictEqualTypesInternal ( a : KotlinTypeMarker , b : KotlinTypeMarker ) : Boolean","body":"{ if ( a === b ) return true val simpleA = a . asSimpleType ( ) val simpleB = b . asSimpleType ( ) if ( simpleA != null && simpleB != null ) return strictEqualSimpleTypes ( simpleA , simpleB ) val flexibleA = a . asFlexibleType ( ) val flexibleB = b . asFlexibleType ( ) if ( flexibleA != null && flexibleB != null ) { return strictEqualSimpleTypes ( flexibleA . lowerBound ( ) , flexibleB . lowerBound ( ) ) && strictEqualSimpleTypes ( flexibleA . upperBound ( ) , flexibleB . upperBound ( ) ) } return false }","docstring":"/**\n * Note that:\n * - `String!` != `String`\n * - `A` != `A`\n * - `A` != `A`\n * - `A<*>` != `A`\n *\n * Also different error types are not equal even if errorTypeEqualToAnything is true\n */"} {"signature":"fun getInlinedClass ( type : IrType ) : IrClass ?","body":"fun getInlinedClass ( type : IrType ) : IrClass ?","docstring":"/**\n * Returns the inlined class for the given type, or `null` if the type is not inlined.\n */"} {"signature":"fun IrSymbol . isAccessible ( context : JvmBackendContext , currentScope : ScopeWithIr ? , inlineScopeResolver : IrInlineScopeResolver , withSuper : Boolean , thisObjReference : IrClassSymbol ? , fromOtherClassLoader : Boolean = false ) : Boolean","body":"{ val declarationRaw = owner as IrDeclarationWithVisibility if ( declarationRaw is IrConstructor && declarationRaw . constructedClass . isEnumEntry ) return true val jvmVisibility = AsmUtil . getVisibilityAccessFlag ( declarationRaw . visibility . delegate ) if ( jvmVisibility == Opcodes . ACC_PUBLIC && ! withSuper ) return true if ( declarationRaw is IrSimpleFunction && ( declarationRaw . isNonGenericToArray ( ) || declarationRaw . isGenericToArray ( context ) ) && declarationRaw . parentAsClass . isCollectionSubClass ) return true if ( declarationRaw is IrField && declarationRaw . isAssertionsDisabledField ( context ) ) return true if ( declarationRaw is IrFunction && ( declarationRaw . isInline || context . getIntrinsic ( declarationRaw . symbol ) != null ) ) return true val declaration = when ( declarationRaw ) { is IrSimpleFunction -> declarationRaw . resolveFakeOverrideMaybeAbstractOrFail ( ) is IrField -> declarationRaw . resolveFieldFakeOverride ( ) else -> declarationRaw } val ownerClass = declaration . parent as? IrClass ? : return true val scopeClassOrPackage = inlineScopeResolver . findContainer ( currentScope ! ! . irElement ) ? : return false val samePackage = ownerClass . getPackageFragment ( ) . packageFqName == scopeClassOrPackage . getPackageFragment ( ) ? . packageFqName return when { jvmVisibility == Opcodes . ACC_PRIVATE -> ownerClass == scopeClassOrPackage ! withSuper && samePackage && jvmVisibility == -> true ! withSuper && samePackage && ! fromOtherClassLoader -> true else -> ( scopeClassOrPackage is IrClass && scopeClassOrPackage . isSubclassOf ( ownerClass ) ) && ( thisObjReference == null || thisObjReference . owner . isSubclassOf ( scopeClassOrPackage ) ) } }","docstring":"/**\n * Whether `this` is accessible in [currentScope], according to the platform rules, and with respect to function inlining.\n *\n * @param context The backend context.\n * @param currentScope The scope in which `this` is to be accessed.\n * @param inlineScopeResolver The helper that allows to find the places from which private inline functions are called (useful if\n * `this` is accessed from a private inline function).\n * @param withSuper If an access to this symbol (like [IrCall]) has a `super` qualifier, the access rules will be stricter.\n * @param thisObjReference If this is a member access, the class symbol of the receiver.\n * @param fromOtherClassLoader If `this` is a protected declaration being accessed from the same package but not from a subclass,\n * setting this parameter to `true` marks this declaration as inaccessible, since JVM `protected`, unlike Kotlin `protected`,\n * permits accesses from the same package, _provided the call is not across class loader boundaries_.\n */"} {"signature":"private fun modifyFunctionAccessExpression ( oldExpression : IrFunctionAccessExpression , accessorSymbol : IrFunctionSymbol ) : IrFunctionAccessExpression","body":"{ val newExpression = when ( oldExpression ) { is IrCall -> IrCallImpl . fromSymbolOwner ( oldExpression . startOffset , oldExpression . endOffset , oldExpression . type , accessorSymbol as IrSimpleFunctionSymbol , oldExpression . typeArgumentsCount , origin = oldExpression . origin ) is IrDelegatingConstructorCall -> IrDelegatingConstructorCallImpl . fromSymbolOwner ( oldExpression . startOffset , oldExpression . endOffset , context . irBuiltIns . unitType , accessorSymbol as IrConstructorSymbol , oldExpression . typeArgumentsCount ) is IrConstructorCall -> IrConstructorCallImpl . fromSymbolOwner ( oldExpression . startOffset , oldExpression . endOffset , oldExpression . type , accessorSymbol as IrConstructorSymbol ) else -> error ( \"\" ) } newExpression . copyTypeArgumentsFrom ( oldExpression ) val receiverAndArgs = oldExpression . receiverAndArgs ( ) receiverAndArgs . forEachIndexed { i , irExpression -> newExpression . putValueArgument ( i , irExpression ) } if ( accessorSymbol is IrConstructorSymbol ) { newExpression . putValueArgument ( receiverAndArgs . size , createAccessorMarkerArgument ( ) ) } return newExpression }","docstring":"/**\n * Produces a call to the synthetic accessor [accessorSymbol] to replace the call expression [oldExpression].\n *\n * Before:\n * ```kotlin\n * class C protected constructor(val value: Int) {\n *\n * protected fun protectedFun(a: Int): String = a.toString()\n *\n * internal inline fun foo(x: Int) {\n * println(protectedFun(x))\n * }\n *\n * internal inline fun copy(): C = C(value)\n * }\n * ```\n *\n * After:\n * ```kotlin\n * class C protected constructor(val value: Int) {\n *\n * public constructor(\n * value: Int,\n * constructor_marker: kotlin.jvm.internal.DefaultConstructorMarker?\n * ) : this(value)\n *\n * protected fun protectedFun(a: Int): String = a.toString()\n *\n * public static fun access$protectedFun($this: C, a: Int): String =\n * $this.protectedFun(a)\n *\n * internal inline fun foo(x: Int) {\n * println(C.access$protectedFun(this, x))\n * }\n *\n * internal inline fun copy(): C = C(value, null)\n * }\n * ```\n */"} {"signature":"private fun modifyGetterExpression ( oldExpression : IrGetField , accessorSymbol : IrSimpleFunctionSymbol ) : IrCall","body":"{ val call = IrCallImpl ( oldExpression . startOffset , oldExpression . endOffset , oldExpression . type , accessorSymbol , , accessorSymbol . owner . valueParameters . size , oldExpression . origin ) oldExpression . receiver ? . let { call . putValueArgument ( , oldExpression . receiver ) } return call }","docstring":"/**\n * Produces a call to the synthetic accessor [accessorSymbol] to replace the field _read_ expression [oldExpression].\n *\n * Before:\n * ```kotlin\n * class C {\n * protected /*field*/ val myField: Int\n *\n * internal inline fun foo(): Int = myField + 1\n * }\n * ```\n *\n * After:\n * ```kotlin\n * class C {\n * protected /*field*/ val myField: Int\n *\n * public static fun access$getMyField$p($this: C): Int =\n * $this.myField\n *\n * internal inline fun foo(): Int =\n * C.access$getMyField$p(this) + 1\n * }\n * ```\n */"} {"signature":"private fun modifySetterExpression ( oldExpression : IrSetField , accessorSymbol : IrSimpleFunctionSymbol ) : IrCall","body":"{ val call = IrCallImpl ( oldExpression . startOffset , oldExpression . endOffset , oldExpression . type , accessorSymbol , , accessorSymbol . owner . valueParameters . size , oldExpression . origin ) oldExpression . receiver ? . let { call . putValueArgument ( , oldExpression . receiver ) } call . putValueArgument ( call . valueArgumentsCount - , oldExpression . value ) return call }","docstring":"/**\n * Produces a call to the synthetic accessor [accessorSymbol] to replace the field _write_ expression [oldExpression].\n *\n * Before:\n * ```kotlin\n * class C {\n * protected var myField: Int = 0\n *\n * internal inline fun foo(x: Int) {\n * myField = x\n * }\n * }\n * ```\n *\n * After:\n * ```kotlin\n * class C {\n * protected var myField: Int = 0\n *\n * public static fun access$setMyField$p($this: C, : Int) {\n * $this.myField = \n * }\n *\n * internal inline fun foo(x: Int) {\n * access$setMyField$p(this, x)\n * }\n * }\n * ```\n */"} {"signature":"fun createCallableReferenceProcessor ( factory : CallableReferencesCandidateFactory ) : ScopeTowerProcessor < CallableReferenceResolutionCandidate >","body":"{ when ( val lhsResult = factory . kotlinCall . lhsResult ) { LHSResult . Empty , LHSResult . Error , is LHSResult . Expression -> { val explicitReceiver = ( lhsResult as? LHSResult . Expression ) ? . lshCallArgument ? . receiver return factory . createCallableProcessor ( explicitReceiver ) } is LHSResult . Type -> { val static = lhsResult . qualifier ? . let ( factory :: createCallableProcessor ) val unbound = factory . createCallableProcessor ( lhsResult . unboundDetailedReceiver ) val staticOrUnbound = if ( static != null ) SamePriorityCompositeScopeTowerProcessor ( static , unbound ) else unbound val asValue = lhsResult . qualifier ? . classValueReceiverWithSmartCastInfo ? : return staticOrUnbound return PrioritizedCompositeScopeTowerProcessor ( staticOrUnbound , factory . createCallableProcessor ( asValue ) ) } is LHSResult . Object -> { val static = factory . createCallableProcessor ( lhsResult . qualifier ) val boundObjectReference = factory . createCallableProcessor ( lhsResult . objectValueReceiver ) return SamePriorityCompositeScopeTowerProcessor ( static , boundObjectReference ) } } }","docstring":"/**\n * cases: class A {}, class B { companion object }, object C, enum class D { E }\n * A::foo <-> Type\n * a::foo <-> Expression\n * B::foo <-> Type\n * C::foo <-> Object\n * D.E::foo <-> Expression\n */"} {"signature":"fun Tuple1 < * > . dropFirst ( ) : EmptyTuple","body":"= EmptyTuple","docstring":"/**\n * This file contains functions to lower the amount of dimensions of tuples.\n * This can be done using [dropFirst] and [dropLast].\n *\n * For example:\n * ```kotlin\n * val yourTuple: Tuple2 = tupleOf(1, \"test\", a).dropLast()\n * ```\n *\n */"} {"signature":"public fun < T > yMax ( column : ColumnReference < T > ) : PositionalMapping < T >","body":"{ return addPositionalMapping < T > ( Y_MAX , column . name ( ) , null ) }","docstring":"/**\n * Maps the `yMax` aesthetic to a data column specified by a [ColumnReference].\n *\n * @param column the data column to be mapped.\n * @return a [PositionalMapping] object representing the mapping.\n */"} {"signature":"public fun < T > yMax ( column : KProperty < T > ) : PositionalMapping < T >","body":"{ return addPositionalMapping < T > ( Y_MAX , column . name , null ) }","docstring":"/**\n * Maps the `yMax` aesthetic to a data column specified by a [KProperty].\n *\n * @param column the data column to be mapped.\n * @return a [PositionalMapping] object representing the mapping.\n */"} {"signature":"public fun yMax ( column : String ) : PositionalMapping < Any ? >","body":"{ return addPositionalMapping ( Y_MAX , column , null ) }","docstring":"/**\n * Maps the `yMax` aesthetic to a data column specified by a [String].\n *\n * @param column the data column to be mapped.\n * @return a [PositionalMapping] object representing the mapping.\n */"} {"signature":"public fun < T > yMax ( values : Iterable < T > ) : PositionalMapping < T >","body":"{ return addPositionalMapping < T > ( Y_MAX , values . toList ( ) , null , null ) }","docstring":"/**\n * Maps the `yMax` 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 > yMax ( values : DataColumn < T > ) : PositionalMapping < T >","body":"{ return addPositionalMapping < T > ( Y_MAX , values , null ) }","docstring":"/**\n * Maps the `yMax` 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":"fun target ( target : TargetWithSanitizer , action : Action < in T > ) : T","body":"{ val element = targets . getOrPut ( target ) { factory ( target ) } action . execute ( element ) return element }","docstring":"/**\n * Create or update configuration [T] for [target] and apply [action] to it.\n *\n * @param target target of the configuration\n * @param action action to apply to the configuration\n * @return resulting configuration\n */"} {"signature":"fun target ( target : TargetWithSanitizer ) : T","body":"{ return targets [ target ] ? : throw UnknownDomainObjectException ( \"\" ) }","docstring":"/**\n * Get configuration [T] for [target].\n *\n * @param target target of the configuration\n * @return resulting configuration\n * @throws UnknownDomainObjectException if configuration for [target] does not exist\n */"} {"signature":"fun allTargets ( action : Action < in T > ) : List < T >","body":"= platformManager . allTargetsWithSanitizers . map { this . target ( it , action ) }","docstring":"/**\n * Create or update configurations [T] for all known targets with their sanitizers and apply [action] to each of it.\n *\n * @param action action to apply to the configuration\n * @return list of configurations\n */"} {"signature":"fun hostTarget ( action : Action < in T > ) : T","body":"{ return target ( HostManager . host . withSanitizer ( ) , action ) }","docstring":"/**\n * Create or update configuration [T] for [host target][HostManager.host] and apply [action] to it.\n *\n * @param action action to apply to the configuration\n * @return resulting configuration\n */"} {"signature":"public infix fun < C > ColumnsResolver < C > . and ( other : ColumnsResolver < C > ) : ColumnSet < C >","body":"= ColumnsList ( this , other )","docstring":"/** @include [ColumnsResolverAndDocs] {@set [ColumnsResolverAndDocs.Argument] [`colsOf`][SingleColumn.colsOf]`<`[`Int`][Int]`>()`} */"} {"signature":"public infix fun < C > ColumnsResolver < C > . and ( other : ( ) -> ColumnsResolver < C > ) : ColumnSet < C >","body":"= this and other ( )","docstring":"/** @include [ColumnsResolverAndDocs] {@set [ColumnsResolverAndDocs.Argument] `{ colA `[`/`][DataColumn.div]` 2.0 `[`named`][ColumnReference.named]` \"half colA\" \\}`} */"} {"signature":"public infix fun < C > ColumnsResolver < C > . and ( other : String ) : ColumnSet < * >","body":"= this and other . toColumnAccessor ( )","docstring":"/** @include [ColumnsResolverAndDocs] {@set [ColumnsResolverAndDocs.Argument] `\"colB\"`} */"} {"signature":"public infix fun < C > ColumnsResolver < C > . and ( other : KProperty < C > ) : ColumnSet < C >","body":"= this and other . toColumnAccessor ( )","docstring":"/** @include [ColumnsResolverAndDocs] {@set [ColumnsResolverAndDocs.Argument] `Type::colB`} */"} {"signature":"public infix fun < C > String . and ( other : ColumnsResolver < C > ) : ColumnSet < * >","body":"= toColumnAccessor ( ) and other","docstring":"/** @include [StringAndDocs] {@set [StringAndDocs.Argument] [`colsOf`][SingleColumn.colsOf]`<`[`Int`][Int]`>()`} */"} {"signature":"public infix fun < C > String . and ( other : ( ) -> ColumnsResolver < C > ) : ColumnSet < * >","body":"= toColumnAccessor ( ) and other ( )","docstring":"/** @include [StringAndDocs] {@set [StringAndDocs.Argument] `{ colA `[`/`][DataColumn.div]` 2.0 `[`named`][ColumnReference.named]` \"half colA\" \\}`} */"} {"signature":"public infix fun String . and ( other : String ) : ColumnSet < * >","body":"= toColumnAccessor ( ) and other . toColumnAccessor ( )","docstring":"/** @include [StringAndDocs] {@set [StringAndDocs.Argument] `\"colB\"`} */"} {"signature":"public infix fun < C > String . and ( other : KProperty < C > ) : ColumnSet < * >","body":"= toColumnAccessor ( ) and other","docstring":"/** @include [StringAndDocs] {@set [StringAndDocs.Argument] `Type::colB`} */"} {"signature":"public infix fun < C > KProperty < C > . and ( other : ColumnsResolver < C > ) : ColumnSet < C >","body":"= toColumnAccessor ( ) and other","docstring":"/** @include [KPropertyAndDocs] {@set [KPropertyAndDocs.Argument] [`colsOf`][SingleColumn.colsOf]`<`[`Int`][Int]`>()`} */"} {"signature":"public infix fun < C > KProperty < C > . and ( other : ( ) -> ColumnsResolver < C > ) : ColumnSet < C >","body":"= toColumnAccessor ( ) and other ( )","docstring":"/** @include [KPropertyAndDocs] {@set [KPropertyAndDocs.Argument] `{ colA `[/][DataColumn.div]` 2.0 `[`named`][ColumnReference.named]` \"half colA\" \\}`} */"} {"signature":"public infix fun < C > KProperty < C > . and ( other : String ) : ColumnSet < * >","body":"= toColumnAccessor ( ) and other","docstring":"/** @include [KPropertyAndDocs] {@set [KPropertyAndDocs.Argument] `\"colB\"`} */"} {"signature":"public infix fun < C > KProperty < C > . and ( other : KProperty < C > ) : ColumnSet < C >","body":"= toColumnAccessor ( ) and other . toColumnAccessor ( )","docstring":"/** @include [KPropertyAndDocs] {@set [KPropertyAndDocs.Argument] `Type::colB`} */"} {"signature":"private fun rewriteIndyLambdaMetafactoryCall ( call : IrCall ) : IrCall","body":"{ fun fail ( message : String ) : Nothing = throw AssertionError ( \"\" ) val startOffset = call . startOffset val endOffset = call . endOffset val samType = call . getTypeArgument ( ) as? IrSimpleType ? : fail ( \"\" ) val samMethodRef = call . getValueArgument ( ) as? IrRawFunctionReference ? : fail ( \"\" ) val implFunRef = call . getValueArgument ( ) as? IrFunctionReference ? : fail ( \"\" ) val implFunSymbol = implFunRef . symbol val instanceMethodRef = call . getValueArgument ( ) as? IrRawFunctionReference ? : fail ( \"\" ) val extraOverriddenMethods = run { val extraOverriddenMethodVararg = call . getValueArgument ( ) as? IrVararg ? : fail ( \"\" ) extraOverriddenMethodVararg . elements . map { val ref = it as? IrRawFunctionReference ? : fail ( \"\" ) ref . symbol . owner as? IrSimpleFunction ? : fail ( \"\" ) } } val shouldBeSerializable = call . getBooleanConstArgument ( ) val samMethod = samMethodRef . symbol . owner as? IrSimpleFunction ? : fail ( \"\" ) val instanceMethod = instanceMethodRef . symbol . owner as? IrSimpleFunction ? : fail ( \"\" ) val dynamicCall = wrapClosureInDynamicCall ( samType , samMethod , implFunRef ) val requiredBridges = getOverriddenMethodsRequiringBridges ( instanceMethod , samMethod , extraOverriddenMethods ) if ( shouldBeSerializable ) { getClassContext ( ) . serializableMethodRefInfos . add ( SerializableMethodRefInfo ( samType , samMethod . symbol , implFunSymbol , instanceMethodRef . symbol , requiredBridges , dynamicCall . symbol ) ) } return backendContext . createJvmIrBuilder ( implFunSymbol , startOffset , endOffset ) . createLambdaMetafactoryCall ( samMethod . symbol , implFunSymbol , instanceMethodRef . symbol , shouldBeSerializable , requiredBridges , dynamicCall ) }","docstring":"/**\n * @see FunctionReferenceLowering.wrapWithIndySamConversion\n */"} {"signature":"public operator fun not ( ) : Boolean","body":"public operator fun not ( ) : Boolean","docstring":"/**\n * Returns the inverse of this boolean.\n */"} {"signature":"infix fun and ( other : Boolean ) : Boolean","body":"infix fun and ( other : Boolean ) : Boolean","docstring":"/**\n * Performs a logical `and` operation between this Boolean and the [other] one.\n */"} {"signature":"infix fun or ( other : Boolean ) : Boolean","body":"infix fun or ( other : Boolean ) : Boolean","docstring":"/**\n * Performs a logical `or` operation between this Boolean and the [other] one.\n */"} {"signature":"infix fun xor ( other : Boolean ) : Boolean","body":"infix fun xor ( other : Boolean ) : Boolean","docstring":"/**\n * Performs a logical `xor` operation between this Boolean and the [other] one.\n */"} {"signature":"@ Test fun testRunTestActivityNotificationsRace ( )","body":"{ val n = * stressTestMultiplier for ( i in until n ) { runTest { suspendCancellableCoroutine < Unit > { cont -> thread { cont . resume ( Unit ) } } } } }","docstring":"/** Tests that notifications about asynchronous resumptions aren't lost. */"} {"signature":"fun ensureServerHostnameIsSetUp ( )","body":"{ if ( CompilerSystemProperties . JAVA_RMI_SERVER_HOSTNAME . value == null ) { CompilerSystemProperties . JAVA_RMI_SERVER_HOSTNAME . value = LoopbackNetworkInterface . loopbackInetAddressName } }","docstring":"/**\n * Needs to be set up on both client and server to prevent localhost resolution,\n * which may be slow and can cause a timeout when there is a network problem/misconfiguration.\n */"} {"signature":"@ ExperimentalCoroutinesApi public fun TestScope . advanceUntilIdle ( ) : Unit","body":"= testScheduler . advanceUntilIdle ( )","docstring":"/**\n * Advances the [testScheduler][TestScope.testScheduler] to the point where there are no tasks remaining.\n * @see TestCoroutineScheduler.advanceUntilIdle\n */"} {"signature":"@ ExperimentalCoroutinesApi public fun TestScope . runCurrent ( ) : Unit","body":"= testScheduler . runCurrent ( )","docstring":"/**\n * Run any tasks that are pending at the current virtual time, according to\n * the [testScheduler][TestScope.testScheduler].\n *\n * @see TestCoroutineScheduler.runCurrent\n */"} {"signature":"@ ExperimentalCoroutinesApi public fun TestScope . advanceTimeBy ( delayTimeMillis : Long ) : Unit","body":"= testScheduler . advanceTimeBy ( delayTimeMillis )","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 * In contrast with `TestCoroutineScope.advanceTimeBy`, this function does not run the tasks scheduled at the moment\n * [currentTime] + [delayTimeMillis].\n *\n * @throws IllegalStateException if passed a negative [delay][delayTimeMillis].\n * @see TestCoroutineScheduler.advanceTimeBy\n */"} {"signature":"@ ExperimentalCoroutinesApi public fun TestScope . advanceTimeBy ( delayTime : Duration ) : Unit","body":"= testScheduler . advanceTimeBy ( delayTime )","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 IllegalStateException if passed a negative [delay][delayTime].\n * @see TestCoroutineScheduler.advanceTimeBy\n */"} {"signature":"@ Suppress ( \"\" ) public fun TestScope ( context : CoroutineContext = EmptyCoroutineContext ) : TestScope","body":"{ val ctxWithDispatcher = context . withDelaySkipping ( ) var scope : TestScopeImpl ? = null val exceptionHandler = when ( ctxWithDispatcher [ CoroutineExceptionHandler ] ) { null -> CoroutineExceptionHandler { _ , exception -> scope ! ! . reportException ( exception ) } else -> throw IllegalArgumentException ( \"\" + \"\" + \"\" ) } return TestScopeImpl ( ctxWithDispatcher + exceptionHandler ) . also { scope = it } }","docstring":"/**\n * Creates a [TestScope].\n *\n * It ensures that all the test module machinery is properly initialized.\n * - If [context] doesn't provide a [TestCoroutineScheduler] for orchestrating the virtual time used for delay-skipping,\n * a new one is created, unless either\n * - a [TestDispatcher] is provided, in which case [TestDispatcher.scheduler] is used;\n * - at the moment of the creation of the scope, [Dispatchers.Main] is delegated to a [TestDispatcher], in which case\n * its [TestCoroutineScheduler] is used.\n * - If [context] doesn't have a [TestDispatcher], a [StandardTestDispatcher] is created.\n * - A [CoroutineExceptionHandler] is created that makes [TestCoroutineScope.cleanupTestCoroutines] throw if there were\n * any uncaught exceptions, or forwards the exceptions further in a platform-specific manner if the cleanup was\n * already performed when an exception happened. Passing a [CoroutineExceptionHandler] is illegal, unless it's an\n * [UncaughtExceptionCaptor], in which case the behavior is preserved for the time being for backward compatibility.\n * If you need to have a specific [CoroutineExceptionHandler], please pass it to [launch] on an already-created\n * [TestCoroutineScope] and share your use case at\n * [our issue tracker](https://github.com/Kotlin/kotlinx.coroutines/issues).\n * - If [context] provides a [Job], that job is used as a parent for the new scope.\n *\n * @throws IllegalArgumentException if [context] has both [TestCoroutineScheduler] and a [TestDispatcher] linked to a\n * different scheduler.\n * @throws IllegalArgumentException if [context] has a [ContinuationInterceptor] that is not a [TestDispatcher].\n * @throws IllegalArgumentException if [context] has an [CoroutineExceptionHandler] that is not an\n * [UncaughtExceptionCaptor].\n */"} {"signature":"internal fun CoroutineContext . withDelaySkipping ( ) : CoroutineContext","body":"{ val dispatcher : TestDispatcher = when ( val dispatcher = get ( ContinuationInterceptor ) ) { is TestDispatcher -> { val ctxScheduler = get ( TestCoroutineScheduler ) if ( ctxScheduler != null ) { require ( dispatcher . scheduler === ctxScheduler ) { \"\" + \"\" } } dispatcher } null -> StandardTestDispatcher ( get ( TestCoroutineScheduler ) ) else -> throw IllegalArgumentException ( \"\" ) } return this + dispatcher + dispatcher . scheduler }","docstring":"/**\n * Adds a [TestDispatcher] and a [TestCoroutineScheduler] to the context if there aren't any already.\n *\n * @throws IllegalArgumentException if both a [TestCoroutineScheduler] and a [TestDispatcher] are passed.\n * @throws IllegalArgumentException if a [ContinuationInterceptor] is passed that is not a [TestDispatcher].\n */"} {"signature":"fun enter ( )","body":"{ val exceptions = synchronized ( lock ) { if ( entered ) throw IllegalStateException ( \"\" ) entered = true check ( ! finished ) @ Suppress ( \"\" , \"\" ) run { ensurePlatformExceptionHandlerLoaded ( ExceptionCollector ) } if ( catchNonTestRelatedExceptions ) { ExceptionCollector . addOnExceptionCallback ( lock , this :: reportException ) } uncaughtExceptions } if ( exceptions . isNotEmpty ( ) ) { ExceptionCollector . removeOnExceptionCallback ( lock ) throw UncaughtExceptionsBeforeTest ( ) . apply { for ( e in exceptions ) addSuppressed ( e ) } } }","docstring":"/** Called upon entry to [runTest]. Will throw if called more than once. */"} {"signature":"fun leave ( ) : List < Throwable >","body":"= synchronized ( lock ) { check ( entered && ! finished ) ExceptionCollector . removeOnExceptionCallback ( lock ) finished = true uncaughtExceptions }","docstring":"/** Called at the end of the test. May only be called once. Returns the list of caught unhandled exceptions. */"} {"signature":"fun legacyLeave ( ) : List < Throwable >","body":"{ val exceptions = synchronized ( lock ) { check ( entered && ! finished ) ExceptionCollector . removeOnExceptionCallback ( lock ) finished = true uncaughtExceptions } val activeJobs = children . filter { it . isActive } . toList ( ) if ( exceptions . isEmpty ( ) ) { if ( activeJobs . isNotEmpty ( ) ) throw UncompletedCoroutinesError ( \"\" + \"\" + \"\" ) if ( ! testScheduler . isIdle ( ) ) throw UncompletedCoroutinesError ( \"\" + \"\" ) } return exceptions }","docstring":"/** Called at the end of the test. May only be called once. */"} {"signature":"fun reportException ( throwable : Throwable )","body":"{ synchronized ( lock ) { if ( finished ) { throw throwable } else { @ Suppress ( \"\" , \"\" ) for ( existingThrowable in uncaughtExceptions ) { if ( unwrap ( throwable ) == unwrap ( existingThrowable ) ) return } uncaughtExceptions . add ( throwable ) if ( ! entered ) throw UncaughtExceptionsBeforeTest ( ) . apply { addSuppressed ( throwable ) } } } }","docstring":"/** Stores an exception to report after [runTest], or rethrows it if not inside [runTest]. */"} {"signature":"fun tryGetCompletionCause ( ) : Throwable ?","body":"= completionCause","docstring":"/** Throws an exception if the coroutine is not completing. */"} {"signature":"@ Suppress ( \"\" ) internal fun TestScope . asSpecificImplementation ( ) : TestScopeImpl","body":"= when ( this ) { is TestScopeImpl -> this }","docstring":"/** Use the knowledge that any [TestScope] that we receive is necessarily a [TestScopeImpl]. */"} {"signature":"fun DataType . unWrap ( ) : DataType","body":"= when ( this ) { is DataTypeWithClass -> DataType . fromJson ( dt ( ) . json ( ) ) else -> this }","docstring":"/** Unwraps [DataTypeWithClass]. */"} {"signature":"@ PublishedApi internal fun KClass < * > . checkForValidType ( parameterName : String )","body":"{ if ( this == String :: class || isSubclassOf ( Seq :: class ) ) return if ( isSubclassOf ( Iterable :: class ) || java . isArray || isSubclassOf ( Char :: class ) || isSubclassOf ( Map :: class ) || isSubclassOf ( Array :: class ) || isSubclassOf ( ByteArray :: class ) || isSubclassOf ( CharArray :: class ) || isSubclassOf ( ShortArray :: class ) || isSubclassOf ( IntArray :: class ) || isSubclassOf ( LongArray :: class ) || isSubclassOf ( FloatArray :: class ) || isSubclassOf ( DoubleArray :: class ) || isSubclassOf ( BooleanArray :: class ) ) throw TypeOfUDFParameterNotSupportedException ( this , parameterName ) }","docstring":"/**\n * Checks if [this] is of a valid type for a UDF, otherwise it throws a [TypeOfUDFParameterNotSupportedException]\n */"} {"signature":"inline fun < Return , reified NamedUdf : NamedUserDefinedFunction < Return , * > > UDFRegistration . register ( namedUdf : NamedUdf , ) : NamedUdf","body":"= namedUdf . copy ( udf = register ( namedUdf . name , namedUdf . udf ) )","docstring":"/**\n * Registers a user-defined function (UDF) with name, for a UDF that's already defined using the Dataset\n * API (i.e. of type [NamedUserDefinedFunction]).\n * @see UDFRegistration.register\n */"} {"signature":"fun withName ( name : String ) : NamedUdf","body":"fun withName ( name : String ) : NamedUdf","docstring":"/** Converts this [UserDefinedFunction] to a [NamedUserDefinedFunction]. */"} {"signature":"operator fun getValue ( thisRef : Any ? , property : KProperty < * > ) : NamedUdf","body":"operator fun getValue ( thisRef : Any ? , property : KProperty < * > ) : NamedUdf","docstring":"/**\n * Converts this [UserDefinedFunction] to a [NamedUserDefinedFunction].\n * @see withName\n */"} {"signature":"inline fun < R , reified T : NamedUserDefinedFunction < R , * > > T . copy ( name : String = this . name , udf : SparkUserDefinedFunction = this . udf , encoder : Encoder < R > = this . encoder , ) : T","body":"= T :: class . primaryConstructor ! ! . run { callBy ( parameters . associateWith { when ( it . name ) { NamedUserDefinedFunction < * , * > :: name . name -> name NamedUserDefinedFunction < * , * > :: udf . name -> udf NamedUserDefinedFunction < * , * > :: encoder . name -> encoder else -> error ( \"\" ) } } ) }","docstring":"/** Copy method for all [NamedUserDefinedFunction] functions. */"} {"signature":"private fun KDoc . findSectionsContainingTag ( tag : KDocKnownTag ) : List < KDocSection >","body":"{ return getChildrenOfType < KDocSection > ( ) . filter { it . findTagByName ( tag . name . toLowerCaseAsciiOnly ( ) ) != null } }","docstring":"/**\n * Looks for sections that have a deeply nested [tag],\n * as opposed to [KDoc.findSectionByTag], which only looks among the top level\n */"} {"signature":"fun render ( x : Float , y : Float , w : Float , h : Float , color : Vector3 )","body":"{ this . program . let { it . activate ( ) it . color . assign ( color ) val positions = listOf ( Vector2 ( x , y ) , Vector2 ( x + w , y ) , Vector2 ( x , y + h ) , Vector2 ( x + w , y ) , Vector2 ( x + w , y + h ) , Vector2 ( x , y + h ) ) it . position . assign ( positions ) glDrawArrays ( GL_TRIANGLES , , positions . size ) } }","docstring":"/**\n * Draws a 2D rectangle specified in a normalized device coordinates,\n * i.e. the bottom-left corner of the screen is `(-1, -1)` and the top-right is `(1, 1)`.\n */"} {"signature":"fun render ( x : Float , y : Float , w : Float , h : Float , texture : Int , texBottomLeft : Vector2 = Vector2 ( , ) , texUpperRight : Vector2 = Vector2 ( , ) )","body":"{ glBindTexture ( GL_TEXTURE_2D , textures [ texture ] ) this . program . let { it . activate ( ) val positions = listOf ( Vector2 ( x , y ) , Vector2 ( x + w , y ) , Vector2 ( x , y + h ) , Vector2 ( x + w , y ) , Vector2 ( x + w , y + h ) , Vector2 ( x , y + h ) ) val texCoords = listOf ( texBottomLeft , Vector2 ( texUpperRight . x , texBottomLeft . y ) , Vector2 ( texBottomLeft . x , texUpperRight . y ) , Vector2 ( texUpperRight . x , texBottomLeft . y ) , texUpperRight , Vector2 ( texBottomLeft . x , texUpperRight . y ) ) it . position . assign ( positions ) it . texcoord . assign ( texCoords ) it . tex . assign ( ) glDrawArrays ( GL_TRIANGLES , , positions . size ) } }","docstring":"/**\n * Draws a 2D rectangle specified in a normalized device coordinates,\n * i.e. the bottom-left corner of the screen is `(-1, -1)` and the top-right is `(1, 1)`.\n */"} {"signature":"fun render ( x : Float , y : Float , w : Float , h : Float , myTeam : Team ? , counts : List < Int > , digitAspect : Float , screenAspect : Float )","body":"{ val barsCount = Team . count val allMarginsCount = barsCount - val highlightedMarginsCount = when { myTeam == null -> myTeam . ordinal == || myTeam . ordinal == Team . count - -> else -> } val marginsCount = allMarginsCount - highlightedMarginsCount val marginToBar = / val highlightedMarginToBar = / val barWidth = w / ( barsCount + marginToBar * marginsCount + highlightedMarginToBar * highlightedMarginsCount ) val marginWidth = barWidth * marginToBar val highlightedMarginWidth = barWidth * highlightedMarginToBar var maxCount = counts . max ( ) ? : if ( maxCount == ) maxCount = val maxBarH = ( h - barWidth / screenAspect - * marginWidth / screenAspect ) val zh = barWidth / screenAspect + * marginWidth / screenAspect var barX = x for ( team in Team . values ( ) ) { val barH = + ( counts [ team . ordinal ] . toFloat ( ) / maxCount * maxBarH ) rectRenderer . render ( barX , y + zh , barWidth , barH , team . colorVector ) val teamSquareSize = if ( team == myTeam ) barWidth * else barWidth val centerY = ( zh - barWidth / screenAspect ) * / + ( barWidth / screenAspect ) / val dist = zh - ( centerY + ( teamSquareSize / screenAspect ) * ) texturedRectRenderer . renderScore ( barX , y + zh + barH + dist * , barWidth , counts [ team . ordinal ] , if ( team == myTeam ) * / else , digitAspect , , , - , , , , ) rectRenderer . render ( barX + ( barWidth - teamSquareSize ) / , y + centerY - ( teamSquareSize / screenAspect / ) , teamSquareSize , teamSquareSize / screenAspect , teamNumberColor ) val digitSize = if ( team == myTeam ) else val digitW = digitSize val digitH = digitW / digitAspect texturedRectRenderer . render ( barX + ( barWidth - teamSquareSize ) / + teamSquareSize * ( - digitW ) / , y + centerY - ( teamSquareSize / screenAspect / ) + ( ( teamSquareSize / screenAspect - teamSquareSize * digitH ) / ) , teamSquareSize * digitW , teamSquareSize * digitH , team . ordinal + ) val curMarginWidth = if ( team == myTeam || team . ordinal + == myTeam ? . ordinal ) highlightedMarginWidth else marginWidth barX += barWidth + curMarginWidth } }","docstring":"/**\n * Renders a stats bar chart inside the specified rectangle.\n * The coordinate system are the same as in [RectRenderer.render].\n *\n * It makes a padding around the chart.\n */"} {"signature":"fun render ( sceneState : SceneState , screenWidth : Float , screenHeight : Float )","body":"{ glClearColor ( backgroundColor . x , backgroundColor . y , backgroundColor . z , ) glClear ( ( GL_COLOR_BUFFER_BIT or GL_DEPTH_BUFFER_BIT ) . convert ( ) ) val screenAspect = screenHeight / screenWidth val stats = sceneState . stats val gameOver = sceneState . initialized && stats ? . status == val showCopyright = stats ? . status == val squareSize = minOf ( screenWidth , screenHeight ) val digitAspect = / * screenAspect val projectionMatrix = translationMatrix ( squareSize / screenWidth - , - ( - + / * ) , ) * orthographicProjectionMatrix ( - screenWidth / squareSize , screenWidth / squareSize , - screenHeight / squareSize , screenHeight / squareSize , , ) if ( ! gameOver ) { kotlinLogoRenderer . render ( translationMatrix ( , , - ) * Matrix4 ( sceneState . rotationMatrix ) , projectionMatrix ) } val myContribution = if ( sceneState . initialized && stats != null ) stats . myContribution else val myTeam = if ( sceneState . initialized && stats != null ) stats . myTeam else null val counts = if ( sceneState . initialized && stats != null ) Team . values ( ) . map { stats . getCount ( it ) } else IntArray ( Team . count , { } ) . asList ( ) fun renderCenteredTexture ( y : Float , w : Float , aspectRatio : Float , textureId : Int ) { statsBarChartRenderer . texturedRectRenderer . render ( - + ( - w ) / , y , w , w * aspectRatio / screenAspect , textureId ) } val margin = / * if ( ! gameOver ) { if ( sceneState . initialized ) { val scoreH = val spinsAspect = ( / ) * screenAspect val scoreW = scoreH * digitAspect * statsBarChartRenderer . texturedRectRenderer . renderScore ( - + ( - scoreW ) / , - ( / * ) , scoreW , myContribution , * / , digitAspect , , , spinsTextureId , spinsAspect , , , ) } } else { if ( stats ! ! . winner ) { renderCenteredTexture ( - ( / * ) , - margin * , / , winnerTextureId ) } else { renderCenteredTexture ( - ( / * ) , * , / , gameOverTextureId ) } renderCenteredTexture ( - ( / * ) , * , / , teamPlaceTextureId ) val myCount = counts [ myTeam ! ! . ordinal ] val place = counts . count { it > myCount } + val placeH = val placeW = placeH * digitAspect placeRenderer . renderScore ( , - ( / * ) , placeW , place , , digitAspect , , , - , , , , ) val totalH = val totalW = totalH * digitAspect * statsBarChartRenderer . texturedRectRenderer . renderScore ( - + ( - totalW ) / , - ( / * ) , totalW , myCount , * / , digitAspect , , , - , , , , ) renderCenteredTexture ( - ( / * ) , * , / , totalSpinsTextureId ) val scoreH = val youContributedAspect = ( / ) * screenAspect val scoreW = scoreH * digitAspect * statsBarChartRenderer . texturedRectRenderer . renderScore ( - + ( - scoreW ) / , - ( / * ) , scoreW , myContribution , * / , digitAspect , , - , youContributedTextureId , youContributedAspect , , , ) } statsBarChartRenderer . rectRenderer . render ( ( - + margin ) , ( - / * ) , ( - margin * ) , , Vector3 ( , , ) ) if ( sceneState . initialized ) { if ( screenWidth <= screenHeight ) { statsBarChartRenderer . render ( - + margin , - , - margin * , ( - / * ) , myTeam , counts , digitAspect , screenAspect ) } else { val width = * ( screenWidth - squareSize ) / screenWidth statsBarChartRenderer . render ( - width , - , width , , myTeam , counts , digitAspect , screenAspect ) } } if ( ! sceneState . initialized ) { val startMessageRatio = / if ( screenWidth <= screenHeight ) { renderCenteredTexture ( - / * , - margin * , startMessageRatio , startScreenTextureId ) if ( showCopyright ) { renderCenteredTexture ( - / * , , / , konanTextureId ) renderCenteredTexture ( - / * , - margin * , / , spinnerRepoTextureId ) } } } }","docstring":"/**\n * Renders the entire game scene.\n *\n * @param screenWidth physical width of the screen in any units\n * @param screenHeight physical height of the screen in the same units as [screenWidth]\n */"} {"signature":"fun getCollectedNullability ( key : DataFlowValue ) : Nullability","body":"fun getCollectedNullability ( key : DataFlowValue ) : Nullability","docstring":"/**\n * Returns collected nullability for the given value, NOT taking its stability into account.\n */"} {"signature":"fun getStableNullability ( key : DataFlowValue ) : Nullability","body":"fun getStableNullability ( key : DataFlowValue ) : Nullability","docstring":"/**\n * Returns collected nullability for the given value if it's stable.\n * Otherwise basic value nullability is returned\n */"} {"signature":"fun getCollectedTypes ( key : DataFlowValue , languageVersionSettings : LanguageVersionSettings ) : Set < KotlinType >","body":"fun getCollectedTypes ( key : DataFlowValue , languageVersionSettings : LanguageVersionSettings ) : Set < KotlinType >","docstring":"/**\n * Returns possible types for the given value, NOT taking its stability into account.\n *\n * IMPORTANT: by default, the original (native) type for this value\n * are NOT included. So it's quite possible to get an empty set here.\n * Also, type order in the result set MAKES SENSE so keep it stable and do not change without reason\n */"} {"signature":"fun getStableTypes ( key : DataFlowValue , languageVersionSettings : LanguageVersionSettings ) : Set < KotlinType >","body":"fun getStableTypes ( key : DataFlowValue , languageVersionSettings : LanguageVersionSettings ) : Set < KotlinType >","docstring":"/**\n * Returns possible types for the given value if it's stable.\n * Otherwise, basic value type is returned.\n *\n * IMPORTANT: by default, the original (native) type for this value\n * are NOT included. So it's quite possible to get an empty set here.\n * Also, type order in the result set MAKES SENSE so keep it stable and do not change without reason\n */"} {"signature":"fun clearValueInfo ( value : DataFlowValue , languageVersionSettings : LanguageVersionSettings ) : DataFlowInfo","body":"fun clearValueInfo ( value : DataFlowValue , languageVersionSettings : LanguageVersionSettings ) : DataFlowInfo","docstring":"/**\n * Call this function to clear all data flow information about\n * the given data flow value. Useful when we are not sure how this value can be changed, e.g. in a loop.\n */"} {"signature":"fun assign ( a : DataFlowValue , b : DataFlowValue , languageVersionSettings : LanguageVersionSettings ) : DataFlowInfo","body":"fun assign ( a : DataFlowValue , b : DataFlowValue , languageVersionSettings : LanguageVersionSettings ) : DataFlowInfo","docstring":"/**\n * Call this function when b is assigned to a\n */"} {"signature":"fun equate ( a : DataFlowValue , b : DataFlowValue , identityEquals : Boolean , languageVersionSettings : LanguageVersionSettings ) : DataFlowInfo","body":"fun equate ( a : DataFlowValue , b : DataFlowValue , identityEquals : Boolean , languageVersionSettings : LanguageVersionSettings ) : DataFlowInfo","docstring":"/**\n * Call this function when it's known than a == b.\n */"} {"signature":"fun disequate ( a : DataFlowValue , b : DataFlowValue , languageVersionSettings : LanguageVersionSettings ) : DataFlowInfo","body":"fun disequate ( a : DataFlowValue , b : DataFlowValue , languageVersionSettings : LanguageVersionSettings ) : DataFlowInfo","docstring":"/**\n * Call this function when it's known than a != b\n */"} {"signature":"fun and ( other : DataFlowInfo ) : DataFlowInfo","body":"fun and ( other : DataFlowInfo ) : DataFlowInfo","docstring":"/**\n * Call this function to add data flow information from other to this and return sum as the result\n */"} {"signature":"fun or ( other : DataFlowInfo ) : DataFlowInfo","body":"fun or ( other : DataFlowInfo ) : DataFlowInfo","docstring":"/**\n * Call this function to choose data flow information common for this and other and return it as the result\n */"} {"signature":"@ OptIn ( ExperimentalSerializationApi :: class ) override fun toString ( ) : String","body":"{ return \"\" + \"\" + \"\" + \"\" + \"\" + \"\" }","docstring":"/** @suppress Dokka **/"} {"signature":"fun lenetOnMnistInference ( )","body":"{ val ( train , test ) = mnist ( ) SavedModel . load ( PATH_TO_MODEL ) . use { println ( it . graphToString ( ) ) val prediction = it . predict ( train . getX ( ) , \"\" , \"\" ) println ( \"\" ) println ( \"\" + train . getY ( ) ) val predictions = it . predict ( test , SavedModel :: predict ) println ( predictions . toString ( ) ) println ( \"\" ) } }","docstring":"/**\n * This examples demonstrates running [SavedModel] for prediction on [mnist] dataset.\n *\n * It uses enum-based tensor names to get access to input/output tensors in TensorFlow static graph.\n */"} {"signature":"fun main ( ) : Unit","body":"= lenetOnMnistInference ( )","docstring":"/** */"} {"signature":"fun makeObjectFile ( bitcodeFile : File , objectFile : File )","body":"= when ( val configurables = platform . configurables ) { is ClangFlags -> clang ( configurables , bitcodeFile , objectFile ) else -> error ( \"\" ) }","docstring":"/**\n * Compile [bitcodeFile] to [objectFile].\n */"} {"signature":"@ kotlin . internal . InlineOnly public inline fun Timer . schedule ( delay : Long , crossinline action : TimerTask . ( ) -> Unit ) : TimerTask","body":"{ val task = timerTask ( action ) schedule ( task , delay ) return task }","docstring":"/**\n * Schedules an [action] to be executed after the specified [delay] (expressed in milliseconds).\n */"} {"signature":"@ kotlin . internal . InlineOnly public inline fun Timer . schedule ( time : Date , crossinline action : TimerTask . ( ) -> Unit ) : TimerTask","body":"{ val task = timerTask ( action ) schedule ( task , time ) return task }","docstring":"/**\n * Schedules an [action] to be executed at the specified [time].\n */"} {"signature":"@ kotlin . internal . InlineOnly public inline fun Timer . schedule ( delay : Long , period : Long , crossinline action : TimerTask . ( ) -> Unit ) : TimerTask","body":"{ val task = timerTask ( action ) schedule ( task , delay , period ) return task }","docstring":"/**\n * Schedules an [action] to be executed periodically, starting after the specified [delay] (expressed\n * in milliseconds) and with the interval of [period] milliseconds between the end of the previous task\n * and the start of the next one.\n */"} {"signature":"@ kotlin . internal . InlineOnly public inline fun Timer . schedule ( time : Date , period : Long , crossinline action : TimerTask . ( ) -> Unit ) : TimerTask","body":"{ val task = timerTask ( action ) schedule ( task , time , period ) return task }","docstring":"/**\n * Schedules an [action] to be executed periodically, starting at the specified [time] and with the\n * interval of [period] milliseconds between the end of the previous task and the start of the next one.\n */"} {"signature":"@ kotlin . internal . InlineOnly public inline fun Timer . scheduleAtFixedRate ( delay : Long , period : Long , crossinline action : TimerTask . ( ) -> Unit ) : TimerTask","body":"{ val task = timerTask ( action ) scheduleAtFixedRate ( task , delay , period ) return task }","docstring":"/**\n * Schedules an [action] to be executed periodically, starting after the specified [delay] (expressed\n * in milliseconds) and with the interval of [period] milliseconds between the start of the previous task\n * and the start of the next one.\n */"} {"signature":"@ kotlin . internal . InlineOnly public inline fun Timer . scheduleAtFixedRate ( time : Date , period : Long , crossinline action : TimerTask . ( ) -> Unit ) : TimerTask","body":"{ val task = timerTask ( action ) scheduleAtFixedRate ( task , time , period ) return task }","docstring":"/**\n * Schedules an [action] to be executed periodically, starting at the specified [time] and with the\n * interval of [period] milliseconds between the start of the previous task and the start of the next one.\n */"} {"signature":"@ kotlin . internal . InlineOnly public inline fun timer ( name : String ? = null , daemon : Boolean = false , initialDelay : Long = . toLong ( ) , period : Long , crossinline action : TimerTask . ( ) -> Unit ) : Timer","body":"{ val timer = timer ( name , daemon ) timer . schedule ( initialDelay , period , action ) return timer }","docstring":"/**\n * Creates a timer that executes the specified [action] periodically, starting after the specified [initialDelay]\n * (expressed in milliseconds) and with the interval of [period] milliseconds between the end of the previous task\n * and the start of the next one.\n *\n * @param name the name to use for the thread which is running the timer.\n * @param daemon if `true`, the thread is started as a daemon thread (the VM will exit when only daemon threads are running).\n */"} {"signature":"@ kotlin . internal . InlineOnly public inline fun timer ( name : String ? = null , daemon : Boolean = false , startAt : Date , period : Long , crossinline action : TimerTask . ( ) -> Unit ) : Timer","body":"{ val timer = timer ( name , daemon ) timer . schedule ( startAt , period , action ) return timer }","docstring":"/**\n * Creates a timer that executes the specified [action] periodically, starting at the specified [startAt] date\n * and with the interval of [period] milliseconds between the end of the previous task and the start of the next one.\n *\n * @param name the name to use for the thread which is running the timer.\n * @param daemon if `true`, the thread is started as a daemon thread (the VM will exit when only daemon threads are running).\n */"} {"signature":"@ kotlin . internal . InlineOnly public inline fun fixedRateTimer ( name : String ? = null , daemon : Boolean = false , initialDelay : Long = . toLong ( ) , period : Long , crossinline action : TimerTask . ( ) -> Unit ) : Timer","body":"{ val timer = timer ( name , daemon ) timer . scheduleAtFixedRate ( initialDelay , period , action ) return timer }","docstring":"/**\n * Creates a timer that executes the specified [action] periodically, starting after the specified [initialDelay]\n * (expressed in milliseconds) and with the interval of [period] milliseconds between the start of the previous task\n * and the start of the next one.\n *\n * @param name the name to use for the thread which is running the timer.\n * @param daemon if `true`, the thread is started as a daemon thread (the VM will exit when only daemon threads are running).\n */"} {"signature":"@ kotlin . internal . InlineOnly public inline fun fixedRateTimer ( name : String ? = null , daemon : Boolean = false , startAt : Date , period : Long , crossinline action : TimerTask . ( ) -> Unit ) : Timer","body":"{ val timer = timer ( name , daemon ) timer . scheduleAtFixedRate ( startAt , period , action ) return timer }","docstring":"/**\n * Creates a timer that executes the specified [action] periodically, starting at the specified [startAt] date\n * and with the interval of [period] milliseconds between the start of the previous task and the start of the next one.\n *\n * @param name the name to use for the thread which is running the timer.\n * @param daemon if `true`, the thread is started as a daemon thread (the VM will exit when only daemon threads are running).\n */"} {"signature":"@ kotlin . internal . InlineOnly public inline fun timerTask ( crossinline action : TimerTask . ( ) -> Unit ) : TimerTask","body":"= object : TimerTask ( ) { override fun run ( ) = action ( ) }","docstring":"/**\n * Wraps the specified [action] in a [TimerTask].\n */"} {"signature":"fun toScheme ( ) : Scheme","body":"{ val context : MutableMap < Value , Int > = mutableMapOf ( ) var uniqueNumber = fun mapValues ( scheme : LazyScheme ) { val target = scheme . target if ( target . token == null ) { val value = target . value val index = context [ value ] if ( index == - ) { context [ value ] = uniqueNumber ++ } else if ( index == null ) { context [ value ] = - } } scheme . parameters . forEach { mapValues ( it ) } scheme . result ? . let { mapValues ( it ) } } fun itemOf ( binding : Binding ) = binding . token ? . let { Token ( it ) } ? : context [ binding . value ] ? . let { Open ( it ) } ? : Open ( - ) fun schemeOf ( lazyScheme : LazyScheme ) : Scheme = Scheme ( itemOf ( lazyScheme . target ) , lazyScheme . parameters . map { schemeOf ( it ) } , lazyScheme . result ? . let { schemeOf ( it ) } , lazyScheme . anyParameters ) mapValues ( this ) return schemeOf ( this ) }","docstring":"/**\n * Create a [Scheme] from the current state of this.\n */"} {"signature":"fun toCallBindings ( ) : CallBindings","body":"= CallBindings ( target , parameters . map { it . toCallBindings ( ) } , result = result ? . toCallBindings ( ) , anyParameters )","docstring":"/**\n * Create a call binding for use when validating a call to the function this lazy scheme is for.\n */"} {"signature":"fun onChange ( callback : ( ) -> Unit ) : ( ) -> Unit","body":"{ var previousScheme = toScheme ( ) return bindings . onChange { val newScheme = toScheme ( ) if ( newScheme != previousScheme ) { callback ( ) previousScheme = newScheme } } }","docstring":"/**\n * Call [callback] whenever the lazy changes.\n */"} {"signature":"fun isExternal ( declaration : IrDeclaration ) : Boolean","body":"{ return ! generationState . llvmModuleSpecification . containsDeclaration ( declaration ) }","docstring":"/**\n * TODO: maybe it'd be better to replace with [IrDeclaration::isEffectivelyExternal()],\n * or just drop all [else] branches of corresponding conditionals.\n */"} {"signature":"internal fun stringAsBytes ( str : String )","body":"= str . toByteArray ( Charsets . UTF_8 )","docstring":"/**\n * Converts this string to the sequence of bytes to be used for hashing/storing to binary/etc.\n */"} {"signature":"private fun parseValueWithFlags ( str : String ) : ValueWithFlags","body":"{ val parts = str . split ( \"\" , limit = ) return if ( parts . size > ) { val ( value , flags ) = parts ValueWithFlags ( value = value . trim ( ) , flags = flags . trim ( ) . removeSuffix ( \"\" ) . split ( \"\" ) . map { it . trim ( ) } . filter { it . isNotEmpty ( ) } . toSet ( ) ) } else ValueWithFlags ( str ) }","docstring":"/**\n * `value [flag1, flag2, ...]`\n */"} {"signature":"internal fun splitFunctionsAndInheritedAccessors ( properties : List < PropertyDescriptor > , functions : List < FunctionDescriptor > ) : DescriptorFunctionsHolder","body":"{ val ( javaMethods , kotlinFunctions ) = functions . partition { it is JavaMethodDescriptor } if ( javaMethods . isEmpty ( ) ) { return DescriptorFunctionsHolder ( regularFunctions = kotlinFunctions , emptyMap ( ) ) } val propertiesByName = properties . associateBy { it . name . asString ( ) } val regularFunctions = ArrayList < FunctionDescriptor > ( kotlinFunctions ) val accessors = mutableMapOf < PropertyDescriptor , DescriptorAccessorHolder > ( ) javaMethods . forEach { function -> val possiblePropertyNamesForFunction = function . toPossiblePropertyNames ( ) val property = possiblePropertyNamesForFunction . firstNotNullOfOrNull { propertiesByName [ it ] } if ( property != null && function . isAccessorFor ( property ) ) { accessors . compute ( property ) { prop , accessorHolder -> if ( function . isGetterFor ( prop ) ) accessorHolder ? . copy ( getter = function ) ? : DescriptorAccessorHolder ( getter = function ) else accessorHolder ? . copy ( setter = function ) ? : DescriptorAccessorHolder ( setter = function ) } } else { regularFunctions . add ( function ) } } val accessorLookalikes = removeNonAccessorsReturning ( accessors ) regularFunctions . addAll ( accessorLookalikes ) return DescriptorFunctionsHolder ( regularFunctions , accessors ) }","docstring":"/**\n * Separate regular Kotlin/Java functions and inherited Java accessors\n * to properly display properties inherited from Java.\n *\n * Take this example:\n * ```\n * // java\n * public class JavaClass {\n * private int a = 1;\n * public int getA() { return a; }\n * public void setA(int a) { this.a = a; }\n * }\n *\n * // kotlin\n * class Bar : JavaClass() {\n * fun foo() {}\n * }\n * ```\n *\n * It should result in:\n * - 1 regular function `foo`\n * - Map a=[`getA`, `setA`]\n */"} {"signature":"private fun removeNonAccessorsReturning ( propertyAccessors : MutableMap < PropertyDescriptor , DescriptorAccessorHolder > ) : List < FunctionDescriptor >","body":"{ val nonAccessors = mutableListOf < FunctionDescriptor > ( ) propertyAccessors . entries . removeIf { ( _ , accessors ) -> if ( accessors . getter == null && accessors . setter != null ) { nonAccessors . add ( accessors . setter ) true } else { false } } return nonAccessors }","docstring":"/**\n * If a field has no getter, it's not accessible as a property from Kotlin's perspective,\n * but it still might have a setter lookalike. In this case, this \"setter\" should be just a regular function\n *\n * @return removed elements\n */"} {"signature":"@ kotlin . internal . InlineOnly public actual inline fun Double . isNaN ( ) : Boolean","body":"= java . lang . Double . isNaN ( this )","docstring":"/**\n * Returns `true` if the specified number is a\n * Not-a-Number (NaN) value, `false` otherwise.\n */"} {"signature":"@ kotlin . internal . InlineOnly public actual inline fun Float . isNaN ( ) : Boolean","body":"= java . lang . Float . isNaN ( this )","docstring":"/**\n * Returns `true` if the specified number is a\n * Not-a-Number (NaN) value, `false` otherwise.\n */"} {"signature":"@ kotlin . internal . InlineOnly public actual inline fun Double . isInfinite ( ) : Boolean","body":"= java . lang . Double . isInfinite ( this )","docstring":"/**\n * Returns `true` if this value is infinitely large in magnitude.\n */"} {"signature":"@ kotlin . internal . InlineOnly public actual inline fun Float . isInfinite ( ) : Boolean","body":"= java . lang . Float . isInfinite ( this )","docstring":"/**\n * Returns `true` if this value is infinitely large in magnitude.\n */"} {"signature":"@ kotlin . internal . InlineOnly public actual inline fun Double . isFinite ( ) : Boolean","body":"= ! isInfinite ( ) && ! isNaN ( )","docstring":"/**\n * Returns `true` if the argument is a finite floating-point value; returns `false` otherwise (for `NaN` and infinity arguments).\n */"} {"signature":"@ kotlin . internal . InlineOnly public actual inline fun Float . isFinite ( ) : Boolean","body":"= ! isInfinite ( ) && ! isNaN ( )","docstring":"/**\n * Returns `true` if the argument is a finite floating-point value; returns `false` otherwise (for `NaN` and infinity arguments).\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . internal . InlineOnly public actual inline fun Double . toBits ( ) : Long","body":"= java . lang . Double . doubleToLongBits ( this )","docstring":"/**\n * Returns a bit representation of the specified floating-point value as [Long]\n * according to the IEEE 754 floating-point \"double format\" bit layout.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . internal . InlineOnly public actual inline fun Double . toRawBits ( ) : Long","body":"= java . lang . Double . doubleToRawLongBits ( this )","docstring":"/**\n * Returns a bit representation of the specified floating-point value as [Long]\n * according to the IEEE 754 floating-point \"double format\" bit layout,\n * preserving `NaN` values exact layout.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . internal . InlineOnly public actual inline fun Double . Companion . fromBits ( bits : Long ) : Double","body":"= java . lang . Double . longBitsToDouble ( bits )","docstring":"/**\n * Returns the [Double] value corresponding to a given bit representation.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . internal . InlineOnly public actual inline fun Float . toBits ( ) : Int","body":"= java . lang . Float . floatToIntBits ( this )","docstring":"/**\n * Returns a bit representation of the specified floating-point value as [Int]\n * according to the IEEE 754 floating-point \"single format\" bit layout.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . internal . InlineOnly public actual inline fun Float . toRawBits ( ) : Int","body":"= java . lang . Float . floatToRawIntBits ( this )","docstring":"/**\n * Returns a bit representation of the specified floating-point value as [Int]\n * according to the IEEE 754 floating-point \"single format\" bit layout,\n * preserving `NaN` values exact layout.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . internal . InlineOnly public actual inline fun Float . Companion . fromBits ( bits : Int ) : Float","body":"= java . lang . Float . intBitsToFloat ( bits )","docstring":"/**\n * Returns the [Float] value corresponding to a given bit representation.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . internal . InlineOnly public actual inline fun Int . countOneBits ( ) : Int","body":"= Integer . bitCount ( this )","docstring":"/**\n * Counts the number of set bits in the binary representation of this [Int] number.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . internal . InlineOnly public actual inline fun Int . countLeadingZeroBits ( ) : Int","body":"= Integer . numberOfLeadingZeros ( this )","docstring":"/**\n * Counts the number of consecutive most significant bits that are zero in the binary representation of this [Int] number.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . internal . InlineOnly public actual inline fun Int . countTrailingZeroBits ( ) : Int","body":"= Integer . numberOfTrailingZeros ( this )","docstring":"/**\n * Counts the number of consecutive least significant bits that are zero in the binary representation of this [Int] number.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . internal . InlineOnly public actual inline fun Int . takeHighestOneBit ( ) : Int","body":"= Integer . highestOneBit ( this )","docstring":"/**\n * Returns a number having a single bit set in the position of the most significant set bit of this [Int] number,\n * or zero, if this number is zero.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . internal . InlineOnly public actual inline fun Int . takeLowestOneBit ( ) : Int","body":"= Integer . lowestOneBit ( this )","docstring":"/**\n * Returns a number having a single bit set in the position of the least significant set bit of this [Int] number,\n * or zero, if this number is zero.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalStdlibApi :: class ) @ kotlin . internal . InlineOnly public actual inline fun Int . rotateLeft ( bitCount : Int ) : Int","body":"= Integer . rotateLeft ( this , bitCount )","docstring":"/**\n * Rotates the binary representation of this [Int] number left by the specified [bitCount] number of bits.\n * The most significant bits pushed out from the left side reenter the number as the least significant bits on the right side.\n *\n * Rotating the number left by a negative bit count is the same as rotating it right by the negated bit count:\n * `number.rotateLeft(-n) == number.rotateRight(n)`\n *\n * Rotating by a multiple of [Int.SIZE_BITS] (32) returns the same number, or more generally\n * `number.rotateLeft(n) == number.rotateLeft(n % 32)`\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalStdlibApi :: class ) @ kotlin . internal . InlineOnly public actual inline fun Int . rotateRight ( bitCount : Int ) : Int","body":"= Integer . rotateRight ( this , bitCount )","docstring":"/**\n * Rotates the binary representation of this [Int] number right by the specified [bitCount] number of bits.\n * The least significant bits pushed out from the right side reenter the number as the most significant bits on the left side.\n *\n * Rotating the number right by a negative bit count is the same as rotating it left by the negated bit count:\n * `number.rotateRight(-n) == number.rotateLeft(n)`\n *\n * Rotating by a multiple of [Int.SIZE_BITS] (32) returns the same number, or more generally\n * `number.rotateRight(n) == number.rotateRight(n % 32)`\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . internal . InlineOnly public actual inline fun Long . countOneBits ( ) : Int","body":"= java . lang . Long . bitCount ( this )","docstring":"/**\n * Counts the number of set bits in the binary representation of this [Long] number.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . internal . InlineOnly public actual inline fun Long . countLeadingZeroBits ( ) : Int","body":"= java . lang . Long . numberOfLeadingZeros ( this )","docstring":"/**\n * Counts the number of consecutive most significant bits that are zero in the binary representation of this [Long] number.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . internal . InlineOnly public actual inline fun Long . countTrailingZeroBits ( ) : Int","body":"= java . lang . Long . numberOfTrailingZeros ( this )","docstring":"/**\n * Counts the number of consecutive least significant bits that are zero in the binary representation of this [Long] number.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . internal . InlineOnly public actual inline fun Long . takeHighestOneBit ( ) : Long","body":"= java . lang . Long . highestOneBit ( this )","docstring":"/**\n * Returns a number having a single bit set in the position of the most significant set bit of this [Long] number,\n * or zero, if this number is zero.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . internal . InlineOnly public actual inline fun Long . takeLowestOneBit ( ) : Long","body":"= java . lang . Long . lowestOneBit ( this )","docstring":"/**\n * Returns a number having a single bit set in the position of the least significant set bit of this [Long] number,\n * or zero, if this number is zero.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalStdlibApi :: class ) @ kotlin . internal . InlineOnly public actual inline fun Long . rotateLeft ( bitCount : Int ) : Long","body":"= java . lang . Long . rotateLeft ( this , bitCount )","docstring":"/**\n * Rotates the binary representation of this [Long] number left by the specified [bitCount] number of bits.\n * The most significant bits pushed out from the left side reenter the number as the least significant bits on the right side.\n *\n * Rotating the number left by a negative bit count is the same as rotating it right by the negated bit count:\n * `number.rotateLeft(-n) == number.rotateRight(n)`\n *\n * Rotating by a multiple of [Long.SIZE_BITS] (64) returns the same number, or more generally\n * `number.rotateLeft(n) == number.rotateLeft(n % 64)`\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalStdlibApi :: class ) @ kotlin . internal . InlineOnly public actual inline fun Long . rotateRight ( bitCount : Int ) : Long","body":"= java . lang . Long . rotateRight ( this , bitCount )","docstring":"/**\n * Rotates the binary representation of this [Long] number right by the specified [bitCount] number of bits.\n * The least significant bits pushed out from the right side reenter the number as the most significant bits on the left side.\n *\n * Rotating the number right by a negative bit count is the same as rotating it left by the negated bit count:\n * `number.rotateRight(-n) == number.rotateLeft(n)`\n *\n * Rotating by a multiple of [Long.SIZE_BITS] (64) returns the same number, or more generally\n * `number.rotateRight(n) == number.rotateRight(n % 64)`\n */"} {"signature":"protected abstract fun read ( ) : Double","body":"protected abstract fun read ( ) : Double","docstring":"/**\n * This protected method should be overridden to return the current reading of the time source expressed as a [Double] number\n * in the unit specified by the [unit] property.\n */"} {"signature":"public operator fun plusAssign ( duration : Duration )","body":"{ val longDelta = duration . toLong ( unit ) if ( ! longDelta . isSaturated ( ) ) { val newReading = reading + longDelta if ( reading xor longDelta >= && reading xor newReading < ) overflow ( duration ) reading = newReading } else { val half = duration / if ( ! half . toLong ( unit ) . isSaturated ( ) ) { val readingBefore = reading try { plusAssign ( half ) plusAssign ( duration - half ) } catch ( e : IllegalStateException ) { reading = readingBefore throw e } } else { overflow ( duration ) } } }","docstring":"/**\n * Advances the current reading value of this time source by the specified [duration].\n *\n * [duration] value is rounded down towards zero when converting it to a [Long] number of nanoseconds.\n * For example, if the duration being added is `0.6.nanoseconds`, the reading doesn't advance because\n * the duration value is rounded to zero nanoseconds.\n *\n * @throws IllegalStateException when the reading value overflows as the result of this operation.\n */"} {"signature":"public fun readAtMostTo ( sink : Buffer , byteCount : Long ) : Long","body":"public fun readAtMostTo ( sink : Buffer , byteCount : Long ) : Long","docstring":"/**\n * Removes at least 1, and up to [byteCount] bytes from this source and appends them to [sink].\n * Returns the number of bytes read, or -1 if this source is exhausted.\n *\n * @param sink the destination to write the data from this source.\n * @param byteCount the number of bytes to read.\n *\n * @throws IllegalArgumentException when [byteCount] is negative.\n * @throws IllegalStateException when the source is closed.\n *\n * @sample kotlinx.io.samples.KotlinxIoCoreCommonSamples.readAtMostToSink\n */"} {"signature":"override fun close ( )","body":"override fun close ( )","docstring":"/**\n * Closes this source and releases the resources held by this source. It is an error to read a\n * closed source. It is safe to close a source more than once.\n */"} {"signature":"@ ExperimentalCoroutinesApi @ Suppress ( \"\" ) public fun UnconfinedTestDispatcher ( scheduler : TestCoroutineScheduler ? = null , name : String ? = null ) : TestDispatcher","body":"= UnconfinedTestDispatcherImpl ( scheduler ? : TestMainDispatcher . currentTestScheduler ? : TestCoroutineScheduler ( ) , name )","docstring":"/**\n * Creates an instance of an unconfined [TestDispatcher].\n *\n * This dispatcher is similar to [Dispatchers.Unconfined]: the tasks that it executes are not confined to any particular\n * thread and form an event loop; it's different in that it skips delays, as all [TestDispatcher]s do.\n *\n * Like [Dispatchers.Unconfined], this one does not provide guarantees about the execution order when several coroutines\n * are queued in this dispatcher. However, we ensure that the [launch] and [async] blocks at the top level of [runTest]\n * are entered eagerly. This allows launching child coroutines and not calling [runCurrent] for them to start executing.\n *\n * ```\n * @Test\n * fun testEagerlyEnteringChildCoroutines() = runTest(UnconfinedTestDispatcher()) {\n * var entered = false\n * val deferred = CompletableDeferred()\n * var completed = false\n * launch {\n * entered = true\n * deferred.await()\n * completed = true\n * }\n * assertTrue(entered) // `entered = true` already executed.\n * assertFalse(completed) // however, the child coroutine then suspended, so it is enqueued.\n * deferred.complete(Unit) // resume the coroutine.\n * assertTrue(completed) // now the child coroutine is immediately completed.\n * }\n * ```\n *\n * Using this [TestDispatcher] can greatly simplify writing tests where it's not important which thread is used when and\n * in which order the queued coroutines are executed.\n * Another typical use case for this dispatcher is launching child coroutines that are resumed immediately, without\n * going through a dispatch; this can be helpful for testing [Channel] and [StateFlow] usages.\n *\n * ```\n * @Test\n * fun testUnconfinedDispatcher() = runTest {\n * val values = mutableListOf()\n * val stateFlow = MutableStateFlow(0)\n * val job = launch(UnconfinedTestDispatcher(testScheduler)) {\n * stateFlow.collect {\n * values.add(it)\n * }\n * }\n * stateFlow.value = 1\n * stateFlow.value = 2\n * stateFlow.value = 3\n * job.cancel()\n * // each assignment will immediately resume the collecting child coroutine,\n * // so no values will be skipped.\n * assertEquals(listOf(0, 1, 2, 3), values)\n * }\n * ```\n *\n * Please be aware that, like [Dispatchers.Unconfined], this is a specific dispatcher with execution order\n * guarantees that are unusual and not shared by most other dispatchers, so it can only be used reliably for testing\n * functionality, not the specific order of actions.\n * See [Dispatchers.Unconfined] for a discussion of the execution order guarantees.\n *\n * In order to support delay skipping, this dispatcher is linked to a [TestCoroutineScheduler], which is used to control\n * the virtual time and can be shared among many test dispatchers.\n * If no [scheduler] is passed as an argument, [Dispatchers.Main] is checked, and if it was mocked with a\n * [TestDispatcher] via [Dispatchers.setMain], the [TestDispatcher.scheduler] of the mock dispatcher is used; if\n * [Dispatchers.Main] is not mocked with a [TestDispatcher], a new [TestCoroutineScheduler] is created.\n *\n * Additionally, [name] can be set to distinguish each dispatcher instance when debugging.\n *\n * @see StandardTestDispatcher for a more predictable [TestDispatcher].\n */"} {"signature":"@ Suppress ( \"\" ) public fun StandardTestDispatcher ( scheduler : TestCoroutineScheduler ? = null , name : String ? = null ) : TestDispatcher","body":"= StandardTestDispatcherImpl ( scheduler ? : TestMainDispatcher . currentTestScheduler ? : TestCoroutineScheduler ( ) , name )","docstring":"/**\n * Creates an instance of a [TestDispatcher] whose tasks are run inside calls to the [scheduler].\n *\n * This [TestDispatcher] instance does not itself execute any of the tasks. Instead, it always sends them to its\n * [scheduler], which can then be accessed via [TestCoroutineScheduler.runCurrent],\n * [TestCoroutineScheduler.advanceUntilIdle], or [TestCoroutineScheduler.advanceTimeBy], which will then execute these\n * tasks in a blocking manner.\n *\n * In practice, this means that [launch] or [async] blocks will not be entered immediately (unless they are\n * parameterized with [CoroutineStart.UNDISPATCHED]), and one should either call [TestCoroutineScheduler.runCurrent] to\n * run these pending tasks, which will block until there are no more tasks scheduled at this point in time, or, when\n * inside [runTest], call [yield] to yield the (only) thread used by [runTest] to the newly-launched coroutines.\n *\n * If no [scheduler] is passed as an argument, [Dispatchers.Main] is checked, and if it was mocked with a\n * [TestDispatcher] via [Dispatchers.setMain], the [TestDispatcher.scheduler] of the mock dispatcher is used; if\n * [Dispatchers.Main] is not mocked with a [TestDispatcher], a new [TestCoroutineScheduler] is created.\n *\n * One can additionally pass a [name] in order to more easily distinguish this dispatcher during debugging.\n *\n * @see UnconfinedTestDispatcher for a dispatcher that is not confined to any particular thread.\n */"} {"signature":"fun main ( ) : Unit","body":"= resnet50Prediction ( )","docstring":"/** */"} {"signature":"@ OptionalJsName ( TRACE_FORMAT_FORMAT_FUNCTION ) public open fun format ( index : Int , event : Any ) : String","body":"= \"\"","docstring":"/**\n * Formats trace at the given [index] with the given [event] of Any type.\n */"} {"signature":"@ InlineOnly public inline fun TraceFormat ( crossinline format : ( index : Int , event : Any ) -> String ) : TraceFormat","body":"= object : TraceFormat ( ) { override fun format ( index : Int , event : Any ) : String = format ( index , event ) }","docstring":"/**\n * Creates trace string formatter with the given [format] code block.\n */"} {"signature":"internal fun assertEstimations ( exampleFrame : AnyFrame , expectedNullable : Boolean , hasNulls : Boolean )","body":"{ fun iBatch ( iFrame : Int ) : Int { val firstBatchSize = return if ( iFrame < firstBatchSize ) iFrame else iFrame - firstBatchSize } fun expectedNull ( rowNumber : Int ) : Boolean { return ( rowNumber + ) % == } fun assertValueOrNull ( rowNumber : Int , actual : Any ? , expected : Any ) { if ( hasNulls && expectedNull ( rowNumber ) ) { actual shouldBe null } else { actual shouldBe expected } } val asciiStringCol = exampleFrame [ \"\" ] as DataColumn < String ? > asciiStringCol . type ( ) shouldBe typeOf < String > ( ) . withNullability ( expectedNullable ) asciiStringCol . forEachIndexed { i , element -> assertValueOrNull ( iBatch ( i ) , element , \"\" ) } val utf8StringCol = exampleFrame [ \"\" ] as DataColumn < String ? > utf8StringCol . type ( ) shouldBe typeOf < String > ( ) . withNullability ( expectedNullable ) utf8StringCol . forEachIndexed { i , element -> assertValueOrNull ( iBatch ( i ) , element , \"\" ) } val largeStringCol = exampleFrame [ \"\" ] as DataColumn < String ? > largeStringCol . type ( ) shouldBe typeOf < String > ( ) . withNullability ( expectedNullable ) largeStringCol . forEachIndexed { i , element -> assertValueOrNull ( iBatch ( i ) , element , \"\" ) } val booleanCol = exampleFrame [ \"\" ] as DataColumn < Boolean ? > booleanCol . type ( ) shouldBe typeOf < Boolean > ( ) . withNullability ( expectedNullable ) booleanCol . forEachIndexed { i , element -> assertValueOrNull ( iBatch ( i ) , element , iBatch ( i ) % == ) } val byteCol = exampleFrame [ \"\" ] as DataColumn < Byte ? > byteCol . type ( ) shouldBe typeOf < Byte > ( ) . withNullability ( expectedNullable ) byteCol . forEachIndexed { i , element -> assertValueOrNull ( iBatch ( i ) , element , ( iBatch ( i ) * ) . toByte ( ) ) } val shortCol = exampleFrame [ \"\" ] as DataColumn < Short ? > shortCol . type ( ) shouldBe typeOf < Short > ( ) . withNullability ( expectedNullable ) shortCol . forEachIndexed { i , element -> assertValueOrNull ( iBatch ( i ) , element , ( iBatch ( i ) * ) . toShort ( ) ) } val intCol = exampleFrame [ \"\" ] as DataColumn < Int ? > intCol . type ( ) shouldBe typeOf < Int > ( ) . withNullability ( expectedNullable ) intCol . forEachIndexed { i , element -> assertValueOrNull ( iBatch ( i ) , element , iBatch ( i ) * ) } val longCol = exampleFrame [ \"\" ] as DataColumn < Long ? > longCol . type ( ) shouldBe typeOf < Long > ( ) . withNullability ( expectedNullable ) longCol . forEachIndexed { i , element -> assertValueOrNull ( iBatch ( i ) , element , iBatch ( i ) * ) } val unsignedByteCol = exampleFrame [ \"\" ] as DataColumn < Short ? > unsignedByteCol . type ( ) shouldBe typeOf < Short > ( ) . withNullability ( expectedNullable ) unsignedByteCol . forEachIndexed { i , element -> assertValueOrNull ( iBatch ( i ) , element , ( iBatch ( i ) * % ( Byte . MIN_VALUE . toShort ( ) * ) . absoluteValue ) . toShort ( ) ) } val unsignedShortCol = exampleFrame [ \"\" ] as DataColumn < Int ? > unsignedShortCol . type ( ) shouldBe typeOf < Int > ( ) . withNullability ( expectedNullable ) unsignedShortCol . forEachIndexed { i , element -> assertValueOrNull ( iBatch ( i ) , element , iBatch ( i ) * % ( Short . MIN_VALUE . toInt ( ) * ) . absoluteValue ) } val unsignedIntCol = exampleFrame [ \"\" ] as DataColumn < Long ? > unsignedIntCol . type ( ) shouldBe typeOf < Long > ( ) . withNullability ( expectedNullable ) unsignedIntCol . forEachIndexed { i , element -> assertValueOrNull ( iBatch ( i ) , element , iBatch ( i ) . toLong ( ) * % ( Int . MIN_VALUE . toLong ( ) * ) . absoluteValue ) } val unsignedLongIntCol = exampleFrame [ \"\" ] as DataColumn < BigInteger ? > unsignedLongIntCol . type ( ) shouldBe typeOf < BigInteger > ( ) . withNullability ( expectedNullable ) unsignedLongIntCol . forEachIndexed { i , element -> assertValueOrNull ( iBatch ( i ) , element , iBatch ( i ) . toBigInteger ( ) * . toBigInteger ( ) % ( Long . MIN_VALUE . toBigInteger ( ) * . toBigInteger ( ) ) . abs ( ) ) } val floatCol = exampleFrame [ \"\" ] as DataColumn < Float ? > floatCol . type ( ) shouldBe typeOf < Float > ( ) . withNullability ( expectedNullable ) floatCol . forEachIndexed { i , element -> assertValueOrNull ( iBatch ( i ) , element , . pow ( iBatch ( i ) . toFloat ( ) ) ) } val doubleCol = exampleFrame [ \"\" ] as DataColumn < Double ? > doubleCol . type ( ) shouldBe typeOf < Double > ( ) . withNullability ( expectedNullable ) doubleCol . forEachIndexed { i , element -> assertValueOrNull ( iBatch ( i ) , element , . pow ( iBatch ( i ) ) ) } val dateCol = exampleFrame [ \"\" ] as DataColumn < LocalDate ? > dateCol . type ( ) shouldBe typeOf < LocalDate > ( ) . withNullability ( expectedNullable ) dateCol . forEachIndexed { i , element -> assertValueOrNull ( iBatch ( i ) , element , LocalDate . ofEpochDay ( iBatch ( i ) . toLong ( ) * ) ) } val datetimeCol = exampleFrame [ \"\" ] as DataColumn < LocalDateTime ? > datetimeCol . type ( ) shouldBe typeOf < LocalDateTime > ( ) . withNullability ( expectedNullable ) datetimeCol . forEachIndexed { i , element -> assertValueOrNull ( iBatch ( i ) , element , LocalDateTime . ofEpochSecond ( iBatch ( i ) . toLong ( ) * * * * , , ZoneOffset . UTC ) ) } val timeSecCol = exampleFrame [ \"\" ] as DataColumn < LocalTime ? > timeSecCol . type ( ) shouldBe typeOf < LocalTime > ( ) . withNullability ( expectedNullable ) timeSecCol . forEachIndexed { i , element -> assertValueOrNull ( iBatch ( i ) , element , LocalTime . ofSecondOfDay ( iBatch ( i ) . toLong ( ) ) ) } val timeMilliCol = exampleFrame [ \"\" ] as DataColumn < LocalTime ? > timeMilliCol . type ( ) shouldBe typeOf < LocalTime > ( ) . withNullability ( expectedNullable ) timeMilliCol . forEachIndexed { i , element -> assertValueOrNull ( iBatch ( i ) , element , LocalTime . ofNanoOfDay ( iBatch ( i ) . toLong ( ) * ) ) } val timeMicroCol = exampleFrame [ \"\" ] as DataColumn < LocalTime ? > timeMicroCol . type ( ) shouldBe typeOf < LocalTime > ( ) . withNullability ( expectedNullable ) timeMicroCol . forEachIndexed { i , element -> assertValueOrNull ( iBatch ( i ) , element , LocalTime . ofNanoOfDay ( iBatch ( i ) . toLong ( ) * ) ) } val timeNanoCol = exampleFrame [ \"\" ] as DataColumn < LocalTime ? > timeNanoCol . type ( ) shouldBe typeOf < LocalTime > ( ) . withNullability ( expectedNullable ) timeNanoCol . forEachIndexed { i , element -> assertValueOrNull ( iBatch ( i ) , element , LocalTime . ofNanoOfDay ( iBatch ( i ) . toLong ( ) ) ) } exampleFrame . getColumnOrNull ( \"\" ) ? . let { nullCol -> nullCol . type ( ) shouldBe nothingType ( hasNulls ) assert ( hasNulls ) nullCol . values ( ) . forEach { assert ( it == null ) } } }","docstring":"/**\n * Assert that we have got the same data that was originally saved on example creation.\n * Example generation project is currently located at https://github.com/Kopilov/arrow_example\n */"} {"signature":"public inline fun < T > PersistentSet < T > . mutate ( mutator : ( MutableSet < T > ) -> Unit ) : PersistentSet < T >","body":"= builder ( ) . apply ( mutator ) . build ( )","docstring":"/**\n * Returns the result of applying the provided modifications on this set.\n *\n * The mutable set passed to the [mutator] closure has the same contents as this persistent set.\n *\n * @return a new persistent set with the provided modifications applied;\n * or this instance if no modifications were made in the result of this operation.\n */"} {"signature":"public inline fun < T > PersistentList < T > . mutate ( mutator : ( MutableList < T > ) -> Unit ) : PersistentList < T >","body":"= builder ( ) . apply ( mutator ) . build ( )","docstring":"/**\n * Returns the result of applying the provided modifications on this list.\n *\n * The mutable list passed to the [mutator] closure has the same contents as this persistent list.\n *\n * @return a new persistent list with the provided modifications applied;\n * or this instance if no modifications were made in the result of this operation.\n */"} {"signature":"@ Suppress ( \"\" ) public inline fun < K , V > PersistentMap < out K , V > . mutate ( mutator : ( MutableMap < K , V > ) -> Unit ) : PersistentMap < K , V >","body":"= ( this as PersistentMap < K , V > ) . builder ( ) . apply ( mutator ) . build ( )","docstring":"/**\n * Returns the result of applying the provided modifications on this map.\n *\n * The mutable map passed to the [mutator] closure has the same contents as this persistent map.\n *\n * @return a new persistent map with the provided modifications applied;\n * or this instance if no modifications were made in the result of this operation.\n */"} {"signature":"public inline operator fun < E > PersistentCollection < E > . plus ( element : E ) : PersistentCollection < E >","body":"= add ( element )","docstring":"/**\n * Returns the result of adding the specified [element] to this collection.\n *\n * @returns a new persistent collection with the specified [element] added;\n * or this instance if this collection does not support duplicates and it already contains the element.\n */"} {"signature":"public inline operator fun < E > PersistentCollection < E > . minus ( element : E ) : PersistentCollection < E >","body":"= remove ( element )","docstring":"/**\n * Returns the result of removing a single appearance of the specified [element] from this collection.\n *\n * @return a new persistent collection with a single appearance of the specified [element] removed;\n * or this instance if there is no such element in this collection.\n */"} {"signature":"public operator fun < E > PersistentCollection < E > . plus ( elements : Iterable < E > ) : PersistentCollection < E > ","body":"= if ( elements is Collection ) addAll ( elements ) else builder ( ) . also { it . addAll ( elements ) } . build ( )","docstring":"/**\n * Returns the result of adding all elements of the specified [elements] collection to this collection.\n *\n * @return a new persistent collection with elements of the specified [elements] collection added;\n * or this instance if no modifications were made in the result of this operation.\n */"} {"signature":"public operator fun < E > PersistentCollection < E > . plus ( elements : Array < out E > ) : PersistentCollection < E > ","body":"= builder ( ) . also { it . addAll ( elements ) } . build ( )","docstring":"/**\n * Returns the result of adding all elements of the specified [elements] array to this collection.\n *\n * @return a new persistent collection with elements of the specified [elements] array added;\n * or this instance if no modifications were made in the result of this operation.\n */"} {"signature":"public operator fun < E > PersistentCollection < E > . plus ( elements : Sequence < E > ) : PersistentCollection < E > ","body":"= builder ( ) . also { it . addAll ( elements ) } . build ( )","docstring":"/**\n * Returns the result of adding all elements of the specified [elements] sequence to this collection.\n *\n * @return a new persistent collection with elements of the specified [elements] sequence added;\n * or this instance if no modifications were made in the result of this operation.\n */"} {"signature":"public operator fun < E > PersistentCollection < E > . minus ( elements : Iterable < E > ) : PersistentCollection < E > ","body":"= if ( elements is Collection ) removeAll ( elements ) else builder ( ) . also { it . removeAll ( elements ) } . build ( )","docstring":"/**\n * Returns the result of removing all elements in this collection that are also\n * contained in the specified [elements] collection.\n *\n * @return a new persistent collection with elements in this collection 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":"public operator fun < E > PersistentCollection < E > . minus ( elements : Array < out E > ) : PersistentCollection < E > ","body":"= builder ( ) . also { it . removeAll ( elements ) } . build ( )","docstring":"/**\n * Returns the result of removing all elements in this collection that are also\n * contained in the specified [elements] array.\n *\n * @return a new persistent collection with elements in this collection that are also\n * contained in the specified [elements] array removed;\n * or this instance if no modifications were made in the result of this operation.\n */"} {"signature":"public operator fun < E > PersistentCollection < E > . minus ( elements : Sequence < E > ) : PersistentCollection < E > ","body":"= builder ( ) . also { it . removeAll ( elements ) } . build ( )","docstring":"/**\n * Returns the result of removing all elements in this collection that are also\n * contained in the specified [elements] sequence.\n *\n * @return a new persistent collection with elements in this collection that are also\n * contained in the specified [elements] sequence removed;\n * or this instance if no modifications were made in the result of this operation.\n */"} {"signature":"public inline operator fun < E > PersistentList < E > . plus ( element : E ) : PersistentList < E >","body":"= add ( element )","docstring":"/**\n * Returns a new persistent list with the specified [element] appended.\n */"} {"signature":"public inline operator fun < E > PersistentList < E > . minus ( element : E ) : PersistentList < E >","body":"= remove ( element )","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":"public operator fun < E > PersistentList < E > . plus ( elements : Iterable < E > ) : PersistentList < E > ","body":"= if ( elements is Collection ) addAll ( elements ) else mutate { it . addAll ( elements ) }","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":"public operator fun < E > PersistentList < E > . plus ( elements : Array < out E > ) : PersistentList < E > ","body":"= mutate { it . addAll ( elements ) }","docstring":"/**\n * Returns the result of appending all elements of the specified [elements] array to this list.\n *\n * The elements are appended in the order they appear in the specified array.\n *\n * @return a new persistent list with elements of the specified [elements] array appended;\n * or this instance if the specified array is empty.\n */"} {"signature":"public operator fun < E > PersistentList < E > . plus ( elements : Sequence < E > ) : PersistentList < E > ","body":"= mutate { it . addAll ( elements ) }","docstring":"/**\n * Returns the result of appending all elements of the specified [elements] sequence to this list.\n *\n * The elements are appended in the order they appear in the specified sequence.\n *\n * @return a new persistent list with elements of the specified [elements] sequence appended;\n * or this instance if the specified sequence is empty.\n */"} {"signature":"public operator fun < E > PersistentList < E > . minus ( elements : Iterable < E > ) : PersistentList < E > ","body":"= if ( elements is Collection ) removeAll ( elements ) else mutate { it . removeAll ( elements ) }","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":"public operator fun < E > PersistentList < E > . minus ( elements : Array < out E > ) : PersistentList < E > ","body":"= mutate { it . removeAll ( elements ) }","docstring":"/**\n * Returns the result of removing all elements in this list that are also\n * contained in the specified [elements] array.\n *\n * @return a new persistent list with elements in this list that are also\n * contained in the specified [elements] array removed;\n * or this instance if no modifications were made in the result of this operation.\n */"} {"signature":"public operator fun < E > PersistentList < E > . minus ( elements : Sequence < E > ) : PersistentList < E > ","body":"= mutate { it . removeAll ( elements ) }","docstring":"/**\n * Returns the result of removing all elements in this list that are also\n * contained in the specified [elements] sequence.\n *\n * @return a new persistent list with elements in this list that are also\n * contained in the specified [elements] sequence removed;\n * or this instance if no modifications were made in the result of this operation.\n */"} {"signature":"public inline operator fun < E > PersistentSet < E > . plus ( element : E ) : PersistentSet < E >","body":"= add ( element )","docstring":"/**\n * Returns the result of adding the specified [element] to this set.\n *\n * @return a new persistent set with the specified [element] added;\n * or this instance if it already contains the element.\n */"} {"signature":"public inline operator fun < E > PersistentSet < E > . minus ( element : E ) : PersistentSet < E >","body":"= remove ( element )","docstring":"/**\n * Returns the result of removing the specified [element] from this set.\n *\n * @return a new persistent set with the specified [element] removed;\n * or this instance if there is no such element in this set.\n */"} {"signature":"public operator fun < E > PersistentSet < E > . plus ( elements : Iterable < E > ) : PersistentSet < E > ","body":"= if ( elements is Collection ) addAll ( elements ) else mutate { it . addAll ( elements ) }","docstring":"/**\n * Returns the result of adding all elements of the specified [elements] collection to this set.\n *\n * @return a new persistent set with elements of the specified [elements] collection added;\n * or this instance if it already contains every element of the specified collection.\n */"} {"signature":"public operator fun < E > PersistentSet < E > . plus ( elements : Array < out E > ) : PersistentSet < E > ","body":"= mutate { it . addAll ( elements ) }","docstring":"/**\n * Returns the result of adding all elements of the specified [elements] array to this set.\n *\n * @return a new persistent set with elements of the specified [elements] array added;\n * or this instance if it already contains every element of the specified array.\n */"} {"signature":"public operator fun < E > PersistentSet < E > . plus ( elements : Sequence < E > ) : PersistentSet < E > ","body":"= mutate { it . addAll ( elements ) }","docstring":"/**\n * Returns the result of adding all elements of the specified [elements] sequence to this set.\n *\n * @return a new persistent set with elements of the specified [elements] sequence added;\n * or this instance if it already contains every element of the specified sequence.\n */"} {"signature":"public operator fun < E > PersistentSet < E > . minus ( elements : Iterable < E > ) : PersistentSet < E > ","body":"= if ( elements is Collection ) removeAll ( elements ) else mutate { it . removeAll ( elements ) }","docstring":"/**\n * Returns the result of removing all elements in this set that are also\n * contained in the specified [elements] collection.\n *\n * @return a new persistent set with elements in this set 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":"public operator fun < E > PersistentSet < E > . minus ( elements : Array < out E > ) : PersistentSet < E > ","body":"= mutate { it . removeAll ( elements ) }","docstring":"/**\n * Returns the result of removing all elements in this set that are also\n * contained in the specified [elements] array.\n *\n * @return a new persistent set with elements in this set that are also\n * contained in the specified [elements] array removed;\n * or this instance if no modifications were made in the result of this operation.\n */"} {"signature":"public operator fun < E > PersistentSet < E > . minus ( elements : Sequence < E > ) : PersistentSet < E > ","body":"= mutate { it . removeAll ( elements ) }","docstring":"/**\n * Returns the result of removing all elements in this set that are also\n * contained in the specified [elements] sequence.\n *\n * @return a new persistent set with elements in this set that are also\n * contained in the specified [elements] sequence removed;\n * or this instance if no modifications were made in the result of this operation.\n */"} {"signature":"public infix fun < E > PersistentSet < E > . intersect ( elements : Iterable < E > ) : PersistentSet < E > ","body":"= if ( elements is Collection ) retainAll ( elements ) else mutate { it . retainAll ( elements ) }","docstring":"/**\n * Returns all elements in this set that are also\n * contained in the specified [elements] collection.\n *\n * @return a new persistent set with elements in this set 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":"public infix fun < E > PersistentCollection < E > . intersect ( elements : Iterable < E > ) : PersistentSet < E > ","body":"= this . toPersistentSet ( ) . intersect ( elements )","docstring":"/**\n * Returns all elements in this collection that are also\n * contained in the specified [elements] collection.\n *\n * @return a new persistent set with elements in this collection that are also\n * contained in the specified [elements] collection\n */"} {"signature":"@ Suppress ( \"\" ) public inline operator fun < K , V > PersistentMap < out K , V > . plus ( pair : Pair < K , V > ) : PersistentMap < K , V > ","body":"= ( this as PersistentMap < K , V > ) . put ( pair . first , pair . second )","docstring":"/**\n * Returns the result of adding an entry to this map from the specified key-value [pair].\n *\n * If this map already contains a mapping for the key,\n * the old value is replaced by the value from the specified [pair].\n *\n * @return a new persistent map with an entry from the specified key-value [pair] added;\n * or this instance if no modifications were made in the result of this operation.\n */"} {"signature":"public inline operator fun < K , V > PersistentMap < out K , V > . plus ( pairs : Iterable < Pair < K , V > > ) : PersistentMap < K , V >","body":"= putAll ( pairs )","docstring":"/**\n * Returns the result of replacing or adding entries to this map from the specified key-value pairs.\n *\n * @return a new persistent map with entries from the specified key-value pairs added;\n * or this instance if no modifications were made in the result of this operation.\n */"} {"signature":"public inline operator fun < K , V > PersistentMap < out K , V > . plus ( pairs : Array < out Pair < K , V > > ) : PersistentMap < K , V >","body":"= putAll ( pairs )","docstring":"/**\n * Returns the result of replacing or adding entries to this map from the specified key-value pairs.\n *\n * @return a new persistent map with entries from the specified key-value pairs added;\n * or this instance if no modifications were made in the result of this operation.\n */"} {"signature":"public inline operator fun < K , V > PersistentMap < out K , V > . plus ( pairs : Sequence < Pair < K , V > > ) : PersistentMap < K , V >","body":"= putAll ( pairs )","docstring":"/**\n * Returns the result of replacing or adding entries to this map from the specified key-value pairs.\n *\n * @return a new persistent map with entries from the specified key-value pairs added;\n * or this instance if no modifications were made in the result of this operation.\n */"} {"signature":"public inline operator fun < K , V > PersistentMap < out K , V > . plus ( map : Map < out K , V > ) : PersistentMap < K , V >","body":"= putAll ( map )","docstring":"/**\n * Returns the result of merging the specified [map] with this map.\n *\n * The effect of this call is equivalent to that of calling `put(k, v)` once for each\n * mapping from key `k` to value `v` in the specified map.\n *\n * @return a new persistent map with keys and values from the specified [map] associated;\n * or this instance if no modifications were made in the result of this operation.\n */"} {"signature":"@ Suppress ( \"\" ) public fun < K , V > PersistentMap < out K , V > . putAll ( map : Map < out K , V > ) : PersistentMap < K , V >","body":"= ( this as PersistentMap < K , V > ) . putAll ( map )","docstring":"/**\n * Returns the result of merging the specified [map] with this map.\n *\n * The effect of this call is equivalent to that of calling `put(k, v)` once for each\n * mapping from key `k` to value `v` in the specified map.\n *\n * @return a new persistent map with keys and values from the specified [map] associated;\n * or this instance if no modifications were made in the result of this operation.\n */"} {"signature":"public fun < K , V > PersistentMap < out K , V > . putAll ( pairs : Iterable < Pair < K , V > > ) : PersistentMap < K , V > ","body":"= mutate { it . putAll ( pairs ) }","docstring":"/**\n * Returns the result of replacing or adding entries to this map from the specified key-value pairs.\n *\n * @return a new persistent map with entries from the specified key-value pairs added;\n * or this instance if no modifications were made in the result of this operation.\n */"} {"signature":"public fun < K , V > PersistentMap < out K , V > . putAll ( pairs : Array < out Pair < K , V > > ) : PersistentMap < K , V > ","body":"= mutate { it . putAll ( pairs ) }","docstring":"/**\n * Returns the result of replacing or adding entries to this map from the specified key-value pairs.\n *\n * @return a new persistent map with entries from the specified key-value pairs added;\n * or this instance if no modifications were made in the result of this operation.\n */"} {"signature":"public fun < K , V > PersistentMap < out K , V > . putAll ( pairs : Sequence < Pair < K , V > > ) : PersistentMap < K , V > ","body":"= mutate { it . putAll ( pairs ) }","docstring":"/**\n * Returns the result of replacing or adding entries to this map from the specified key-value pairs.\n *\n * @return a new persistent map with entries from the specified key-value pairs added;\n * or this instance if no modifications were made in the result of this operation.\n */"} {"signature":"@ Suppress ( \"\" ) public operator fun < K , V > PersistentMap < out K , V > . minus ( key : K ) : PersistentMap < K , V > ","body":"= ( this as PersistentMap < K , V > ) . remove ( key )","docstring":"/**\n * Returns the result of removing the specified [key] and its corresponding value from this map.\n *\n * @return a new persistent map with the specified [key] and its corresponding value removed;\n * or this instance if it contains no mapping for the key.\n */"} {"signature":"public operator fun < K , V > PersistentMap < out K , V > . minus ( keys : Iterable < K > ) : PersistentMap < K , V > ","body":"= mutate { it . minusAssign ( keys ) }","docstring":"/**\n * Returns the result of removing the specified [keys] and their corresponding values from this map.\n *\n * @return a new persistent map with the specified [keys] and their corresponding values removed;\n * or this instance if no modifications were made in the result of this operation.\n */"} {"signature":"public operator fun < K , V > PersistentMap < out K , V > . minus ( keys : Array < out K > ) : PersistentMap < K , V > ","body":"= mutate { it . minusAssign ( keys ) }","docstring":"/**\n * Returns the result of removing the specified [keys] and their corresponding values from this map.\n *\n * @return a new persistent map with the specified [keys] and their corresponding values removed;\n * or this instance if no modifications were made in the result of this operation.\n */"} {"signature":"public operator fun < K , V > PersistentMap < out K , V > . minus ( keys : Sequence < K > ) : PersistentMap < K , V > ","body":"= mutate { it . minusAssign ( keys ) }","docstring":"/**\n * Returns the result of removing the specified [keys] and their corresponding values from this map.\n *\n * @return a new persistent map with the specified [keys] and their corresponding values removed;\n * or this instance if no modifications were made in the result of this operation.\n */"} {"signature":"public fun < E > persistentListOf ( vararg elements : E ) : PersistentList < E >","body":"= persistentVectorOf < E > ( ) . addAll ( elements . asList ( ) )","docstring":"/**\n * Returns a new persistent list of the specified elements.\n */"} {"signature":"public fun < E > persistentListOf ( ) : PersistentList < E >","body":"= persistentVectorOf ( )","docstring":"/**\n * Returns an empty persistent list.\n */"} {"signature":"public fun < E > persistentSetOf ( vararg elements : E ) : PersistentSet < E >","body":"= PersistentOrderedSet . emptyOf < E > ( ) . addAll ( elements . asList ( ) )","docstring":"/**\n * Returns a new persistent set with the given elements.\n *\n * Elements of the returned set are iterated in the order they were specified.\n */"} {"signature":"public fun < E > persistentSetOf ( ) : PersistentSet < E >","body":"= PersistentOrderedSet . emptyOf < E > ( )","docstring":"/**\n * Returns an empty persistent set.\n */"} {"signature":"public fun < E > persistentHashSetOf ( vararg elements : E ) : PersistentSet < E >","body":"= PersistentHashSet . emptyOf < E > ( ) . addAll ( elements . asList ( ) )","docstring":"/**\n * Returns a new persistent set with the given elements.\n *\n * Order of the elements in the returned set is unspecified.\n */"} {"signature":"public fun < E > persistentHashSetOf ( ) : PersistentSet < E >","body":"= PersistentHashSet . emptyOf ( )","docstring":"/**\n * Returns an empty persistent set.\n */"} {"signature":"public fun < K , V > persistentMapOf ( vararg pairs : Pair < K , V > ) : PersistentMap < K , V >","body":"= PersistentOrderedMap . emptyOf < K , V > ( ) . mutate { it += pairs }","docstring":"/**\n * Returns a new persistent map with the specified contents, given as a list of pairs\n * where the first component is the key and the second is the value.\n *\n * If multiple pairs have the same key, the resulting map will contain the value from the last of those pairs.\n *\n * Entries of the map are iterated in the order they were specified.\n */"} {"signature":"public fun < K , V > persistentMapOf ( ) : PersistentMap < K , V >","body":"= PersistentOrderedMap . emptyOf ( )","docstring":"/**\n * Returns an empty persistent map.\n */"} {"signature":"public fun < K , V > persistentHashMapOf ( vararg pairs : Pair < K , V > ) : PersistentMap < K , V >","body":"= PersistentHashMap . emptyOf < K , V > ( ) . mutate { it += pairs }","docstring":"/**\n * Returns a new persistent map with the specified contents, given as a list of pairs\n * where the first component is the key and the second is the value.\n *\n * If multiple pairs have the same key, the resulting map will contain the value from the last of those pairs.\n *\n * Order of the entries in the returned map is unspecified.\n */"} {"signature":"public fun < K , V > persistentHashMapOf ( ) : PersistentMap < K , V >","body":"= PersistentHashMap . emptyOf ( )","docstring":"/**\n * Returns an empty persistent map.\n */"} {"signature":"@ Deprecated ( \"\" , ReplaceWith ( \"\" ) ) public fun < E > immutableListOf ( vararg elements : E ) : PersistentList < E >","body":"= persistentListOf ( * elements )","docstring":"/**\n * Returns a new persistent list of the specified elements.\n */"} {"signature":"@ Deprecated ( \"\" , ReplaceWith ( \"\" ) ) public fun < E > immutableListOf ( ) : PersistentList < E >","body":"= persistentListOf ( )","docstring":"/**\n * Returns an empty persistent list.\n */"} {"signature":"@ Deprecated ( \"\" , ReplaceWith ( \"\" ) ) public fun < E > immutableSetOf ( vararg elements : E ) : PersistentSet < E >","body":"= persistentSetOf ( * elements )","docstring":"/**\n * Returns a new persistent set with the given elements.\n *\n * Elements of the returned set are iterated in the order they were specified.\n */"} {"signature":"@ Deprecated ( \"\" , ReplaceWith ( \"\" ) ) public fun < E > immutableSetOf ( ) : PersistentSet < E >","body":"= persistentSetOf ( )","docstring":"/**\n * Returns an empty persistent set.\n */"} {"signature":"@ Deprecated ( \"\" , ReplaceWith ( \"\" ) ) public fun < E > immutableHashSetOf ( vararg elements : E ) : PersistentSet < E >","body":"= persistentHashSetOf ( * elements )","docstring":"/**\n * Returns a new persistent set with the given elements.\n *\n * Order of the elements in the returned set is unspecified.\n */"} {"signature":"@ Deprecated ( \"\" , ReplaceWith ( \"\" ) ) public fun < K , V > immutableMapOf ( vararg pairs : Pair < K , V > ) : PersistentMap < K , V >","body":"= persistentMapOf ( * pairs )","docstring":"/**\n * Returns a new persistent map with the specified contents, given as a list of pairs\n * where the first component is the key and the second is the value.\n *\n * If multiple pairs have the same key, the resulting map will contain the value from the last of those pairs.\n *\n * Entries of the map are iterated in the order they were specified.\n */"} {"signature":"@ Deprecated ( \"\" , ReplaceWith ( \"\" ) ) public fun < K , V > immutableHashMapOf ( vararg pairs : Pair < K , V > ) : PersistentMap < K , V >","body":"= persistentHashMapOf ( * pairs )","docstring":"/**\n * Returns a new persistent map with the specified contents, given as a list of pairs\n * where the first component is the key and the second is the value.\n *\n * If multiple pairs have the same key, the resulting map will contain the value from the last of those pairs.\n *\n * Order of the entries in the returned map is unspecified.\n */"} {"signature":"public fun < T > Iterable < T > . toImmutableList ( ) : ImmutableList < T >","body":"= this as? ImmutableList ? : this . toPersistentList ( )","docstring":"/**\n * Returns an immutable list containing all elements of this collection.\n *\n * If the receiver is already an immutable list, returns it as is.\n */"} {"signature":"public fun < T > Array < out T > . toImmutableList ( ) : ImmutableList < T >","body":"= toPersistentList ( )","docstring":"/**\n * Returns an immutable list containing all elements of this array.\n */"} {"signature":"public fun < T > Sequence < T > . toImmutableList ( ) : ImmutableList < T >","body":"= toPersistentList ( )","docstring":"/**\n * Returns an immutable list containing all elements of this sequence.\n */"} {"signature":"public fun CharSequence . toImmutableList ( ) : ImmutableList < Char >","body":"= toPersistentList ( )","docstring":"/**\n * Returns an immutable list containing all characters.\n */"} {"signature":"public fun < T > Iterable < T > . toPersistentList ( ) : PersistentList < T >","body":"= this as? PersistentList ? : ( this as? PersistentList . Builder ) ? . build ( ) ? : persistentListOf < T > ( ) + this","docstring":"/**\n * Returns a persistent list containing all elements of this collection.\n *\n * If the receiver is already a persistent list, returns it as is.\n * If the receiver is a persistent list builder, calls `build` on it and returns the result.\n */"} {"signature":"public fun < T > Array < out T > . toPersistentList ( ) : PersistentList < T >","body":"= persistentListOf < T > ( ) + this","docstring":"/**\n * Returns a persistent list containing all elements of this array.\n */"} {"signature":"public fun < T > Sequence < T > . toPersistentList ( ) : PersistentList < T >","body":"= persistentListOf < T > ( ) + this","docstring":"/**\n * Returns a persistent list containing all elements of this sequence.\n */"} {"signature":"public fun CharSequence . toPersistentList ( ) : PersistentList < Char >","body":"= persistentListOf < Char > ( ) . mutate { this . toCollection ( it ) }","docstring":"/**\n * Returns a persistent list containing all characters.\n */"} {"signature":"public fun < T > Iterable < T > . toImmutableSet ( ) : ImmutableSet < T >","body":"= this as? ImmutableSet < T > ? : ( this as? PersistentSet . Builder ) ? . build ( ) ? : persistentSetOf < T > ( ) + this","docstring":"/**\n * Returns an immutable set of all elements of this collection.\n *\n * If the receiver is already an immutable set, returns it as is.\n *\n * Elements of the returned set are iterated in the same order as in this collection.\n */"} {"signature":"public fun < T > Array < out T > . toImmutableSet ( ) : ImmutableSet < T >","body":"= toPersistentSet ( )","docstring":"/**\n * Returns an immutable set of all elements of this array.\n *\n * Elements of the returned set are iterated in the same order as in this array.\n */"} {"signature":"public fun < T > Sequence < T > . toImmutableSet ( ) : ImmutableSet < T >","body":"= toPersistentSet ( )","docstring":"/**\n * Returns an immutable set of all elements of this sequence.\n *\n * Elements of the returned set are iterated in the same order as in this sequence.\n */"} {"signature":"public fun CharSequence . toImmutableSet ( ) : PersistentSet < Char >","body":"= toPersistentSet ( )","docstring":"/**\n * Returns an immutable set of all characters.\n *\n * Elements of the returned set are iterated in the same order as in this char sequence.\n */"} {"signature":"public fun < T > Iterable < T > . toPersistentSet ( ) : PersistentSet < T >","body":"= this as? PersistentOrderedSet < T > ? : ( this as? PersistentOrderedSetBuilder ) ? . build ( ) ? : PersistentOrderedSet . emptyOf < T > ( ) + this","docstring":"/**\n * Returns a persistent set of all elements of this collection.\n *\n * If the receiver is already a persistent set, returns it as is.\n * If the receiver is a persistent set builder, calls `build` on it and returns the result.\n *\n * Elements of the returned set are iterated in the same order as in this collection.\n */"} {"signature":"public fun < T > Array < out T > . toPersistentSet ( ) : PersistentSet < T >","body":"= persistentSetOf < T > ( ) + this","docstring":"/**\n * Returns a persistent set of all elements of this array.\n *\n * Elements of the returned set are iterated in the same order as in this array.\n */"} {"signature":"public fun < T > Sequence < T > . toPersistentSet ( ) : PersistentSet < T >","body":"= persistentSetOf < T > ( ) + this","docstring":"/**\n * Returns a persistent set of all elements of this sequence.\n *\n * Elements of the returned set are iterated in the same order as in this sequence.\n */"} {"signature":"public fun CharSequence . toPersistentSet ( ) : PersistentSet < Char >","body":"= persistentSetOf < Char > ( ) . mutate { this . toCollection ( it ) }","docstring":"/**\n * Returns a persistent set of all characters.\n *\n * Elements of the returned set are iterated in the same order as in this char sequence.\n */"} {"signature":"public fun < T > Iterable < T > . toPersistentHashSet ( ) : PersistentSet < T > ","body":"= this as? PersistentHashSet ? : ( this as? PersistentHashSetBuilder < T > ) ? . build ( ) ? : PersistentHashSet . emptyOf < T > ( ) + this","docstring":"/**\n * Returns a persistent set containing all elements from this set.\n *\n * If the receiver is already a persistent hash set, returns it as is.\n * If the receiver is a persistent hash set builder, calls `build` on it and returns the result.\n *\n * Order of the elements in the returned set is unspecified.\n */"} {"signature":"public fun < T > Array < out T > . toPersistentHashSet ( ) : PersistentSet < T >","body":"= persistentHashSetOf < T > ( ) + this","docstring":"/**\n * Returns a persistent set of all elements of this array.\n *\n * Order of the elements in the returned set is unspecified.\n */"} {"signature":"public fun < T > Sequence < T > . toPersistentHashSet ( ) : PersistentSet < T >","body":"= persistentHashSetOf < T > ( ) + this","docstring":"/**\n * Returns a persistent set of all elements of this sequence.\n *\n * Order of the elements in the returned set is unspecified.\n */"} {"signature":"public fun CharSequence . toPersistentHashSet ( ) : PersistentSet < Char >","body":"= persistentHashSetOf < Char > ( ) . mutate { this . toCollection ( it ) }","docstring":"/**\n * Returns a persistent set of all characters.\n *\n * Order of the elements in the returned set is unspecified.\n */"} {"signature":"public fun < K , V > Map < K , V > . toImmutableMap ( ) : ImmutableMap < K , V > ","body":"= this as? ImmutableMap ? : ( this as? PersistentMap . Builder ) ? . build ( ) ? : persistentMapOf < K , V > ( ) . putAll ( this )","docstring":"/**\n * Returns an immutable map containing all entries from this map.\n *\n * If the receiver is already an immutable map, returns it as is.\n *\n * Entries of the returned map are iterated in the same order as in this map.\n */"} {"signature":"public fun < K , V > Map < K , V > . toPersistentMap ( ) : PersistentMap < K , V > ","body":"= this as? PersistentOrderedMap < K , V > ? : ( this as? PersistentOrderedMapBuilder < K , V > ) ? . build ( ) ? : PersistentOrderedMap . emptyOf < K , V > ( ) . putAll ( this )","docstring":"/**\n * Returns a persistent map containing all entries from this map.\n *\n * If the receiver is already a persistent map, returns it as is.\n * If the receiver is a persistent map builder, calls `build` on it and returns the result.\n *\n * Entries of the returned map are iterated in the same order as in this map.\n */"} {"signature":"public fun < K , V > Map < K , V > . toPersistentHashMap ( ) : PersistentMap < K , V > ","body":"= this as? PersistentHashMap ? : ( this as? PersistentHashMapBuilder < K , V > ) ? . build ( ) ? : PersistentHashMap . emptyOf < K , V > ( ) . putAll ( this )","docstring":"/**\n * Returns an immutable map containing all entries from this map.\n *\n * If the receiver is already a persistent hash map, returns it as is.\n * If the receiver is a persistent hash map builder, calls `build` on it and returns the result.\n *\n * Order of the entries in the returned map is unspecified.\n */"} {"signature":"@ FormatStringsInDatetimeFormats public fun DateTimeFormatBuilder . byUnicodePattern ( pattern : String )","body":"{ val directives = UnicodeFormat . parse ( pattern ) fun rec ( builder : DateTimeFormatBuilder , format : UnicodeFormat ) { when ( format ) { is UnicodeFormat . StringLiteral -> builder . chars ( format . literal ) is UnicodeFormat . Sequence -> format . formats . forEach { rec ( builder , it ) } is UnicodeFormat . OptionalGroup -> builder . alternativeParsing ( { } ) { rec ( this , format . format ) } is UnicodeFormat . Directive -> { when ( format ) { is UnicodeFormat . Directive . TimeBased -> { require ( builder is DateTimeFormatBuilder . WithTime ) { \"\" } format . addToFormat ( builder ) } is UnicodeFormat . Directive . DateBased -> { require ( builder is DateTimeFormatBuilder . WithDate ) { \"\" } format . addToFormat ( builder ) } is UnicodeFormat . Directive . ZoneBased -> { require ( builder is DateTimeFormatBuilder . WithDateTimeComponents ) { \"\" } format . addToFormat ( builder ) } is UnicodeFormat . Directive . OffsetBased -> { require ( builder is DateTimeFormatBuilder . WithUtcOffset ) { \"\" } format . addToFormat ( builder ) } is UnknownUnicodeDirective -> { throw IllegalArgumentException ( \"\" ) } } } } } rec ( this , directives ) }","docstring":"/**\n * Appends a Unicode date/time format string to the [DateTimeFormatBuilder].\n *\n * This is the format string syntax used by the Java Time's `DateTimeFormatter` class, Swift's and Objective-C's\n * `NSDateFormatter` class, and the ICU library.\n * The syntax is specified at\n * .\n *\n * Currently, locale-aware directives are not supported, due to no locale support in Kotlin.\n *\n * In addition to the standard syntax, this function also supports the following extensions:\n * * `[]` denote optional sections. For example, `hh:mm[:ss]` will allow parsing seconds optionally.\n * This is similar to what is supported by the Java Time's `DateTimeFormatter` class.\n *\n * Usage example:\n * ```\n * DateTimeComponents.Format {\n * // 2023-01-20T23:53:16.312+03:30[Asia/Tehran]\n * byUnicodePattern(\"uuuu-MM-dd'T'HH:mm[:ss[.SSS]]xxxxx'['VV']'\")\n * }\n * ```\n *\n * The list of supported directives is as follows:\n *\n * | **Directive** | **Meaning** |\n * | `'string'` | literal `string`, without quotes |\n * | `'''` | literal char `'` |\n * | `[fmt]` | equivalent to `fmt` during formatting, but during parsing also accepts the empty string |\n * | `u` | ISO year without padding |\n * | `uu` | last two digits of the ISO year, with the base year 2000 |\n * | `uuuu` | ISO year, zero-padded to four digits |\n * | `M`, `L` | month number (1-12), without padding |\n * | `MM`, `LL` | month number (01-12), zero-padded to two digits |\n * | `d` | day-of-month (1-31), without padding |\n * | `H` | hour-of-day (0-23), without padding |\n * | `HH` | hour-of-day (00-23), zero-padded to two digits |\n * | `m` | minute-of-hour (0-59), without padding |\n * | `mm` | minute-of-hour (00-59), zero-padded to two digits |\n * | `s` | second-of-hour (0-59), without padding |\n * | `ss` | second-of-hour (00-59), zero-padded to two digits |\n * | `S`, `SS`, `SSS`... | fraction-of-second without a leading dot, with as many digits as the format length |\n * | `VV` | timezone name (for example, `Europe/Berlin`) |\n *\n * The UTC offset is formatted using one of the following directives. In every one of these formats, hours, minutes,\n * and seconds are zero-padded to two digits. Also, hours are unconditionally present.\n * \n * | **Directive** | **Minutes** | **Seconds** | **Separator** | **Representation of zero** |\n * | `X` | unless zero | never | none | `Z` |\n * | `XX` | always | never | none | `Z` |\n * | `XXX` | always | never | colon | `Z` |\n * | `XXXX` | always | unless zero | none | `Z` |\n * | `XXXXX`, `ZZZZZ` | always | unless zero | colon | `Z` |\n * | `x` | unless zero | never | none | `+00` |\n * | `xx`, `Z`, `ZZ`, `ZZZ` | always | never | none | `+0000` |\n * | `xxx` | always | never | colon | `+00:00` |\n * | `xxxx` | always | unless zero | none | `+0000` |\n * | `xxxxx` | always | unless zero | colon | `+00:00` |\n *\n * Additionally, because the `y` directive is very often used instead of `u`, they are taken to mean the same.\n * This may lead to unexpected results if the year is negative: `y` would always produce a positive number, whereas\n * `u` may sometimes produce a negative one. For example:\n * ```\n * LocalDate(-10, 1, 5).format { byUnicodeFormat(\"yyyy-MM-dd\") } // -0010-01-05\n * LocalDate(-10, 1, 5).toJavaLocalDate().format(java.time.format.DateTimeFormatter.ofPattern(\"yyyy-MM-dd\")) // 0011-01-05\n * ```\n *\n * Note that, when the format includes the era directive, [byUnicodePattern] will fail with an exception, so almost all\n * of the intentional usages of `y` will correctly report an error instead of behaving slightly differently.\n *\n * @throws IllegalArgumentException if the pattern is invalid or contains unsupported directives.\n * @throws IllegalArgumentException if the builder is incompatible with the specified directives.\n * @throws UnsupportedOperationException if the kotlinx-datetime library does not support the specified directives.\n */"} {"signature":"abstract fun accepts ( startIndex : Int , testString : CharSequence ) : Int","body":"abstract fun accepts ( startIndex : Int , testString : CharSequence ) : Int","docstring":"/** Returns \"shift\", the number of accepted chars. Commonly internal function, but called by quantifiers. */"} {"signature":"override fun matches ( startIndex : Int , testString : CharSequence , matchResult : MatchResultImpl ) : Int","body":"{ if ( startIndex + charCount > testString . length ) { return - } val shift = accepts ( startIndex , testString ) if ( shift < ) { return - } return next . matches ( startIndex + shift , testString , matchResult ) }","docstring":"/**\n * Checks if we can enter this state and pass the control to the next one.\n * Return positive value if match succeeds, negative otherwise.\n */"} {"signature":"public fun < A : AutoCloseable , R > List < A > . use ( block : ( List < A > ) -> R ) : R","body":"{ if ( isEmpty ( ) ) return block ( this ) var exception : Throwable ? = null try { return block ( this ) } catch ( e : Throwable ) { exception = e throw e } finally { closeSafely ( exception ) } }","docstring":"/**\n * Executes the given [block] function on this resource list and closes the resources correctly\n * even when exception is thrown from the block. Similar to [kotlin.use] extension.\n */"} {"signature":"public fun < K , A : AutoCloseable , R > Map < K , A > . use ( block : ( Map < K , A > ) -> R ) : R","body":"{ if ( isEmpty ( ) ) return block ( this ) var exception : Throwable ? = null try { return block ( this ) } catch ( e : Throwable ) { exception = e throw e } finally { values . closeSafely ( exception ) } }","docstring":"/**\n * Executes the given [block] function on this resources map and closes the resources correctly\n * even when exception is thrown from the block. Similar to [kotlin.use] extension.\n */"} {"signature":"private fun ConeInferenceContext . getCompatibility ( upperBounds : Set < ConeClassLikeType > , lowerBounds : Set < ConeClassLikeType > , compatibilityUpperBound : Compatibility , checkedTypeParameters : MutableSet < FirTypeParameterSymbol > = mutableSetOf ( ) , ) : Compatibility","body":"{ val upperBoundClasses : Set < FirClassWithSuperClasses > = upperBounds . mapNotNull { it . toFirClassWithSuperClasses ( this ) } . toSet ( ) if ( lowerBounds . isEmpty ( ) && ( upperBounds . size < || this . areClassesOrInterfacesCompatible ( upperBoundClasses , compatibilityUpperBound ) == Compatibility . COMPATIBLE ) ) { return Compatibility . COMPATIBLE } if ( upperBounds . any { it . classId == javaClassClassId || it . classId == kotlinClassClassId } ) return Compatibility . COMPATIBLE val leafClassesOrInterfaces = computeLeafClassesOrInterfaces ( upperBoundClasses ) this . areClassesOrInterfacesCompatible ( leafClassesOrInterfaces , compatibilityUpperBound ) ? . let { return it } if ( ! lowerBounds . all { lowerBoundType -> val classesSatisfyingLowerBounds = lowerBoundType . toFirClassWithSuperClasses ( this ) ? . thisAndAllSuperClasses ? : emptySet ( ) leafClassesOrInterfaces . all { it in classesSatisfyingLowerBounds } } ) { return compatibilityUpperBound } if ( upperBounds . size < ) return Compatibility . COMPATIBLE val typeArgumentMapping = mutableMapOf < FirTypeParameterSymbol , BoundTypeArguments > ( ) . apply { for ( type in upperBounds ) { collectTypeArgumentMapping ( type , this @ getCompatibility , compatibilityUpperBound ) } } var result = Compatibility . COMPATIBLE val typeArgsCompatibility = typeArgumentMapping . asSequence ( ) . map { ( paramRef , boundTypeArguments ) -> val ( upper , lower , compatibility ) = boundTypeArguments if ( paramRef in checkedTypeParameters ) { Compatibility . COMPATIBLE } else { checkedTypeParameters . add ( paramRef ) getCompatibility ( upper , lower , compatibility , checkedTypeParameters ) } } for ( compatibility in typeArgsCompatibility ) { if ( compatibility == compatibilityUpperBound ) return compatibility if ( compatibility > result ) { result = compatibility } } return result }","docstring":"/**\n * @param compatibilityUpperBound the max compatibility result that can be returned by this method. For example, if this is set to\n * [Compatibility.SOFT_INCOMPATIBLE], then even if the given bounds don't match the hard way (for example, incompatible primitives) the\n * method should still return [Compatibility.SOFT_INCOMPATIBLE]. This is useful for checking type parameters since we don't want to\n * dictate what semantics a type parameter may have in user code. In other words, if user wants to compare `MyCustom` with\n * `MyCustom`, we let them do so since we do not know what class `MyCustom` uses the type parameter for. Empty containers are\n * another example: `emptyList() == emptyList()`.\n */"} {"signature":"private fun computeLeafClassesOrInterfaces ( upperBoundClasses : Set < FirClassWithSuperClasses > ) : Set < FirClassWithSuperClasses >","body":"{ val isLeaf = mutableMapOf < FirClassWithSuperClasses , Boolean > ( ) upperBoundClasses . associateWithTo ( isLeaf ) { true } val queue = ArrayDeque ( upperBoundClasses ) while ( queue . isNotEmpty ( ) ) { for ( superClass in queue . removeFirst ( ) . superClasses ) { when ( isLeaf [ superClass ] ) { true -> isLeaf [ superClass ] = false false -> { } else -> { isLeaf [ superClass ] = false queue . addLast ( superClass ) } } } } return isLeaf . filterValues { it } . keys }","docstring":"/**\n * Puts the upper bound classes into the class hierarchy and count hows many subclasses are there for each encountered class. Then\n * output a list of leaf classes or interfaces in the class hierarchy.\n */"} {"signature":"private fun ConeInferenceContext . areClassesOrInterfacesCompatible ( classesOrInterfaces : Collection < FirClassWithSuperClasses > , compatibilityUpperBound : Compatibility ) : Compatibility ?","body":"{ val classes = classesOrInterfaces . filter { ! it . isInterface } if ( classes . size >= ) { return if ( classes . any { it . getHasPredefinedEqualityContract ( this ) } ) { compatibilityUpperBound } else { Compatibility . SOFT_INCOMPATIBLE } } val finalClass = classes . firstOrNull { it . isFinal } ? : return null if ( classesOrInterfaces . size > classes . size ) { return if ( finalClass . getHasPredefinedEqualityContract ( this ) ) { compatibilityUpperBound } else { Compatibility . SOFT_INCOMPATIBLE } } return null }","docstring":"/**\n * Checks whether the given classes are compatible. In other words, check if it's possible for objects of the given classes to be\n * considered equal by [Any.equals].\n *\n * @return null if this check is inconclusive\n */"} {"signature":"private fun MutableMap < FirTypeParameterSymbol , BoundTypeArguments > . collectTypeArgumentMapping ( coneType : ConeClassLikeType , ctx : ConeInferenceContext , compatibilityUpperBound : Compatibility )","body":"{ val queue = ArrayDeque < TypeArgumentMapping > ( ) queue . addLast ( coneType . toTypeArgumentMapping ( ctx ) ? : return ) while ( queue . isNotEmpty ( ) ) { val ( typeParameterOwner , mapping ) = queue . removeFirst ( ) val superTypes = typeParameterOwner . getSuperTypes ( ) for ( superType in superTypes ) { queue . addLast ( superType . toTypeArgumentMapping ( ctx , mapping ) ? : continue ) } for ( ( firTypeParameterRef , boundTypeArgument ) in mapping ) { this . collect ( ctx , typeParameterOwner , firTypeParameterRef , boundTypeArgument , compatibilityUpperBound ) } } }","docstring":"/**\n * For each type parameters appeared in the class hierarchy, collect all type arguments that eventually mapped to it. For example,\n * given type `List`, the returned map contains\n *\n * - type parameter of `List` -> upper:[`String`], lower:[]\n * - type parameter of `Collection` -> upper:[`String`], lower:[]\n * - type parameter of `Iterable` -> upper:[`String`], lower:[]\n *\n * If later `Collection` is passed to this method with the same receiver map, the receiver map would become:\n *\n * - type parameter of `List` -> upper:[`String`], lower:[]\n * - type parameter of `Collection` -> upper:[`String`, `Int`], lower:[]\n * - type parameter of `Iterable` -> upper:[`String`, `Int`], lower:[]\n */"} {"signature":"private fun ConeClassLikeType . toTypeArgumentMapping ( ctx : ConeInferenceContext , envMapping : Map < FirTypeParameterSymbol , BoundTypeArgument > = emptyMap ( ) , ) : TypeArgumentMapping ?","body":"{ val typeParameterOwner = getClassLikeElement ( ctx ) ? : return null val mapping = buildMap < FirTypeParameterSymbol , BoundTypeArgument > { typeArguments . forEachIndexed { index , coneTypeProjection -> val typeParameter = typeParameterOwner . getTypeParameter ( index ) ? : return@forEachIndexed var boundTypeArgument : BoundTypeArgument = when ( coneTypeProjection ) { ConeStarProjection -> return@forEachIndexed is ConeKotlinTypeProjectionIn -> BoundTypeArgument ( coneTypeProjection . type , Variance . IN_VARIANCE ) is ConeKotlinTypeProjectionOut -> BoundTypeArgument ( coneTypeProjection . type , Variance . OUT_VARIANCE ) is ConeKotlinTypeConflictingProjection -> BoundTypeArgument ( coneTypeProjection . type , Variance . INVARIANT ) is ConeKotlinType -> when ( typeParameter . variance ) { Variance . IN_VARIANCE -> BoundTypeArgument ( coneTypeProjection . type , Variance . IN_VARIANCE ) Variance . OUT_VARIANCE -> BoundTypeArgument ( coneTypeProjection . type , Variance . OUT_VARIANCE ) else -> BoundTypeArgument ( coneTypeProjection . type , Variance . INVARIANT ) } } val coneKotlinType = boundTypeArgument . type if ( coneKotlinType is ConeTypeParameterType ) { val envTypeParameter = coneKotlinType . lookupTag . typeParameterSymbol val envTypeArgument = envMapping [ envTypeParameter ] if ( envTypeArgument != null ) { boundTypeArgument = envTypeArgument } } put ( typeParameter , boundTypeArgument ) } } return TypeArgumentMapping ( typeParameterOwner , mapping ) }","docstring":"/** Converts type arguments in a [ConeClassLikeType] to a [TypeArgumentMapping]. */"} {"signature":"fun getHasPredefinedEqualityContract ( ctx : ConeInferenceContext ) : Boolean","body":"{ return ( ctx . prohibitComparisonOfIncompatibleEnums && ( firClass . isEnumClass || firClass . classId == StandardClassIds . Enum ) ) || firClass . isPrimitiveType ( ) || ( ctx . prohibitComparisonOfIncompatibleClasses && firClass . classId == StandardClassIds . KClass ) || firClass . classId == StandardClassIds . String || firClass . classId == StandardClassIds . Unit || ( firClass is FirRegularClassSymbol && ( firClass . isData || firClass . isInline ) ) }","docstring":"/**\n * The following are considered to have a predefined equality contract:\n * - enums\n * - primitives (including unsigned integer types)\n * - classes\n * - strings\n * - objects of data classes\n * - objects of inline classes\n * - kotlin.Unit\n */"} {"signature":"public open fun onEpochBegin ( epoch : Int , logs : TrainingHistory )","body":"{ }","docstring":"/**\n * Called at the start of an epoch during training phase.\n *\n * @param [epoch] index of epoch.\n * @param [logs] training history, containing full information about previous epochs.\n */"} {"signature":"public open fun onEpochEnd ( epoch : Int , event : EpochTrainingEvent , logs : TrainingHistory )","body":"{ }","docstring":"/**\n * Called at the end of an epoch during training phase.\n *\n * @param [epoch] index of epoch.\n * @param [event] metric results for this training epoch, and for the\n * validation epoch if validation is performed.\n * @param [logs] training history, containing full information about previous epochs.\n */"} {"signature":"public open fun onTrainBatchBegin ( batch : Int , batchSize : Int , logs : TrainingHistory )","body":"{ }","docstring":"/**\n * Called at the beginning of a batch during training phase.\n *\n * @param [batch] the batch index.\n * @param [batchSize] Number of samples in the current batch.\n * @param [logs] training history, containing full information about previous epochs.\n */"} {"signature":"public open fun onTrainBatchEnd ( batch : Int , batchSize : Int , event : BatchTrainingEvent , logs : TrainingHistory )","body":"{ }","docstring":"/**\n * Called at the end of a batch during training phase.\n *\n * @param [batch] index of batch within the current epoch.\n * @param [batchSize] Number of samples in the current batch.\n * @param [event] Metric and loss values for this batch.\n * @param [logs] training history, containing full information about previous epochs.\n */"} {"signature":"public open fun onTrainBegin ( )","body":"{ }","docstring":"/**\n * Called at the beginning of training.\n */"} {"signature":"public open fun onTrainEnd ( logs : TrainingHistory )","body":"{ }","docstring":"/**\n * Called at the end of training. This method is empty. Extend this class to\n * handle this event.\n *\n * @param [logs] training history, containing full information about previous epochs.\n */"} {"signature":"public open fun onTestBatchBegin ( batch : Int , batchSize : Int , logs : History )","body":"{ }","docstring":"/**\n * Called at the beginning of a batch during evaluation phase. Also called at\n * the beginning of a validation batch during validation phase, if validation\n * data is provided.\n *\n * @param [batch] the batch number\n * @param [batchSize] Number of samples in the current batch.\n * @param [logs] training history, containing full information about previous epochs.\n */"} {"signature":"public open fun onTestBatchEnd ( batch : Int , batchSize : Int , event : BatchEvent ? , logs : History )","body":"{ }","docstring":"/**\n * Called at the end of a batch during evaluation phase. Also called at the\n * end of a validation batch during validation phase, if validation data is\n * provided.\n *\n * @param [batch] the batch number\n * @param [batchSize] Number of samples in the current batch.\n * @param [event] Metric and loss values for this batch.\n * @param [logs] training history, containing full information about previous epochs.\n */"} {"signature":"public open fun onTestBegin ( )","body":"{ }","docstring":"/**\n * Called at the beginning of evaluation or validation.\n */"} {"signature":"public open fun onTestEnd ( logs : History )","body":"{ }","docstring":"/**\n * Called at the end of evaluation or validation.\n *\n * @param [logs] evaluation history, containing full information about previous batches.\n */"} {"signature":"public open fun onPredictBatchBegin ( batch : Int , batchSize : Int )","body":"{ }","docstring":"/**\n * Called at the beginning of a batch during prediction phase.\n *\n * @param [batch] index of batch.\n * @param [batchSize] Number of samples in the current batch.\n */"} {"signature":"public open fun onPredictBatchEnd ( batch : Int , batchSize : Int )","body":"{ }","docstring":"/**\n * Called at the end of a batch during prediction phase.\n *\n * @param [batch] index of batch within the current epoch.\n * @param [batchSize] Number of samples in the current batch.\n */"} {"signature":"public open fun onPredictBegin ( )","body":"{ }","docstring":"/**\n * Called at the beginning of prediction.\n */"} {"signature":"public open fun onPredictEnd ( )","body":"{ }","docstring":"/**\n * Called at the end of prediction.\n */"} {"signature":"suspend fun eval ( snippet : LinkedSnippet < out CompiledSnippetT > , configuration : ScriptEvaluationConfiguration ) : ResultWithDiagnostics < LinkedSnippet < EvaluatedSnippetT > >","body":"suspend fun eval ( snippet : LinkedSnippet < out CompiledSnippetT > , configuration : ScriptEvaluationConfiguration ) : ResultWithDiagnostics < LinkedSnippet < EvaluatedSnippetT > >","docstring":"/**\n * Evaluates compiled snippet and returns result for it.\n * Should assert that snippet sequence is valid.\n * @param snippet Snippet to evaluate.\n * @param configuration Evaluation configuration used.\n * @return Evaluation result\n */"} {"signature":"protected fun declarationsWithSignature ( signature : Signature ) : Set < Declaration >","body":"= declarationsBySignature [ signature ] ? : emptySet ( )","docstring":"/**\n * Returns all the declarations that have [signature] previously recorded by [trackDeclaration].\n */"} {"signature":"fun trackDeclaration ( declaration : Declaration , rawSignature : Signature )","body":"{ declarationsBySignature . computeIfAbsent ( rawSignature ) { SmartSet . create ( ) } . add ( declaration ) }","docstring":"/**\n * Records the declaration, so it could later participate in signature clash detection.\n */"} {"signature":"protected abstract fun reportSignatureConflict ( signature : Signature , declarations : Collection < Declaration > , diagnosticReporter : IrDiagnosticReporter , )","body":"protected abstract fun reportSignatureConflict ( signature : Signature , declarations : Collection < Declaration > , diagnosticReporter : IrDiagnosticReporter , )","docstring":"/**\n * Invoked by [reportErrorsTo] whenever at least two declarations with the same [signature] are detected.\n *\n * Use [reportSignatureClashTo] in the implementation to report a diagnostic.\n */"} {"signature":"open fun reportErrorsTo ( diagnosticReporter : IrDiagnosticReporter )","body":"{ for ( ( signature , declarations ) in declarationsBySignature ) { if ( declarations . size <= ) continue reportSignatureConflict ( signature , declarations , diagnosticReporter ) } }","docstring":"/**\n * Reports all detected signature clashes.\n */"} {"signature":"public fun ColumnSet < * > . colsInGroups ( predicate : ColumnFilter < * > = { true } ) : TransformableColumnSet < * >","body":"= transform { it . flatMap { it . cols ( ) . filter { predicate ( it ) } } }","docstring":"/**\n * @include [ColsInGroupsDocs]\n * @set [ColsInGroupsDocs.ExampleArg]\n *\n * `df.`[select][DataFrame.select]` { `[cols][ColumnsSelectionDsl.cols]` { .. }.`[colsInGroups][ColumnSet.colsInGroups]` { \"my\" `[in][String.contains]` it.`[name][DataColumn.name]` } }`\n *\n * `df.`[select][DataFrame.select]` { `[colsOf][ColumnsSelectionDsl.colsOf]`<`[DataRow][DataRow]`>().`[colsInGroups][ColumnSet.colsInGroups]`() }`\n */"} {"signature":"public fun ColumnsSelectionDsl < * > . colsInGroups ( predicate : ColumnFilter < * > = { true } ) : TransformableColumnSet < * >","body":"= asSingleColumn ( ) . colsInGroups ( predicate )","docstring":"/**\n * @include [ColsInGroupsDocs]\n * @set [ColsInGroupsDocs.ExampleArg]\n *\n * `df.`[select][DataFrame.select]` { `[colsInGroups][ColumnSet.colsInGroups]` { \"my\" `[in][String.contains]` it.`[name][DataColumn.name]` } }`\n *\n * `df.`[select][DataFrame.select]` { `[colsInGroups][ColumnSet.colsInGroups]`() }`\n */"} {"signature":"public fun SingleColumn < DataRow < * > > . colsInGroups ( predicate : ColumnFilter < * > = { true } ) : TransformableColumnSet < * >","body":"= ensureIsColumnGroup ( ) . allColumnsInternal ( ) . colsInGroups ( predicate )","docstring":"/**\n * @include [ColsInGroupsDocs]\n * @set [ColsInGroupsDocs.ExampleArg]\n *\n * `df.`[select][DataFrame.select]` { myColumnGroup.`[colsInGroups][SingleColumn.colsInGroups]`() }`\n *\n * `df.`[select][DataFrame.select]` { myColumnGroup.`[colsInGroups][SingleColumn.colsInGroups]` { it.`[any][ColumnWithPath.any]` { it == \"Alice\" } } }`\n */"} {"signature":"public fun String . colsInGroups ( predicate : ColumnFilter < * > = { true } ) : TransformableColumnSet < * >","body":"= columnGroup ( this ) . colsInGroups ( predicate )","docstring":"/**\n * @include [ColsInGroupsDocs]\n * @set [ColsInGroupsDocs.ExampleArg]\n *\n * `df.`[select][DataFrame.select]` { \"myColumnGroup\".`[colsInGroups][String.colsInGroups]`() }`\n */"} {"signature":"public fun KProperty < * > . colsInGroups ( predicate : ColumnFilter < * > = { true } ) : TransformableColumnSet < * >","body":"= columnGroup ( this ) . colsInGroups ( predicate )","docstring":"/**\n * @include [ColsInGroupsDocs]\n * @set [ColsInGroupsDocs.ExampleArg]\n *\n * `df.`[select][DataFrame.select]` { Type::myColumnGroup.`[colsInGroups][KProperty.colsInGroups]`() }`\n *\n * `df.`[select][DataFrame.select]` { DataSchemaType::myColumnGroup.`[colsInGroups][KProperty.colsInGroups]`() }`\n */"} {"signature":"public fun ColumnPath . colsInGroups ( predicate : ColumnFilter < * > = { true } ) : TransformableColumnSet < * >","body":"= columnGroup ( this ) . colsInGroups ( predicate )","docstring":"/**\n * @include [ColsInGroupsDocs]\n * @set [ColsInGroupsDocs.ExampleArg]\n *\n * `df.`[select][DataFrame.select]` { \"pathTo\"[\"myColumnGroup\"].`[colsInGroups][ColumnPath.colsInGroups]`() }`\n */"} {"signature":"fun loadModelWithoutWeightsInitAndEvaluate ( )","body":"{ val ( _ , test ) = fashionMnist ( ) val jsonConfigFile = getJSONConfigFile ( ) val model = Sequential . loadModelConfiguration ( jsonConfigFile ) model . use { it . compile ( optimizer = Adam ( ) , loss = Losses . SOFT_MAX_CROSS_ENTROPY_WITH_LOGITS , metric = Metrics . ACCURACY ) it . init ( ) it . logSummary ( ) val accuracy = it . evaluate ( dataset = test , batchSize = ) . metrics [ Metrics . ACCURACY ] println ( \"\" ) } }","docstring":"/**\n * This example demonstrates the weird inference case:\n * - Weights are not loaded, but initialized via initialized defined in configuration, configuration is loaded from .json file.\n * - Model is evaluated after loading to obtain accuracy value.\n * - No additional training.\n * - No new layers are added.\n *\n * NOTE: Model and weights are resources in `examples` module.\n */"} {"signature":"fun main ( ) : Unit","body":"= loadModelWithoutWeightsInitAndEvaluate ( )","docstring":"/** */"} {"signature":"public fun format ( value : T ) : String","body":"public fun format ( value : T ) : String","docstring":"/**\n * Formats the given [value] into a string, using this format.\n */"} {"signature":"public fun < A : Appendable > formatTo ( appendable : A , value : T ) : A","body":"public fun < A : Appendable > formatTo ( appendable : A , value : T ) : A","docstring":"/**\n * Formats the given [value] into the given [appendable] using this format.\n */"} {"signature":"public fun parse ( input : CharSequence ) : T","body":"public fun parse ( input : CharSequence ) : T","docstring":"/**\n * Parses the given [input] string as [T] using this format.\n *\n * @throws IllegalArgumentException if the input string is not in the expected format or the value is invalid.\n */"} {"signature":"public fun parseOrNull ( input : CharSequence ) : T ?","body":"public fun parseOrNull ( input : CharSequence ) : T ?","docstring":"/**\n * Parses the given [input] string as [T] using this format.\n *\n * @return the parsed value, or `null` if the input string is not in the expected format or the value is invalid.\n */"} {"signature":"public fun formatAsKotlinBuilderDsl ( format : DateTimeFormat < * > ) : String","body":"= when ( format ) { is AbstractDateTimeFormat < * , * > -> format . actualFormat . builderString ( allFormatConstants ) }","docstring":"/**\n * Produces Kotlin code that, when pasted into a Kotlin source file, creates a [DateTimeFormat] instance that\n * behaves identically to [format].\n *\n * The typical use case for this is to create a [DateTimeFormat] instance using a non-idiomatic approach and\n * then convert it to a builder DSL.\n */"} {"signature":"public fun updateThreadContext ( context : CoroutineContext ) : S","body":"public fun updateThreadContext ( context : CoroutineContext ) : S","docstring":"/**\n * Updates context of the current thread.\n * This function is invoked before the coroutine in the specified [context] is resumed in the current thread\n * when the context of the coroutine this element.\n * The result of this function is the old value of the thread-local state that will be passed to [restoreThreadContext].\n * This method should handle its own exceptions and do not rethrow it. Thrown exceptions will leave coroutine which\n * context is updated in an undefined state and may crash an application.\n *\n * @param context the coroutine context.\n */"} {"signature":"public fun restoreThreadContext ( context : CoroutineContext , oldState : S )","body":"public fun restoreThreadContext ( context : CoroutineContext , oldState : S )","docstring":"/**\n * Restores context of the current thread.\n * This function is invoked after the coroutine in the specified [context] is suspended in the current thread\n * if [updateThreadContext] was previously invoked on resume of this coroutine.\n * The value of [oldState] is the result of the previous invocation of [updateThreadContext] and it should\n * be restored in the thread-local state by this function.\n * This method should handle its own exceptions and do not rethrow it. Thrown exceptions will leave coroutine which\n * context is updated in an undefined state and may crash an application.\n *\n * @param context the coroutine context.\n * @param oldState the value returned by the previous invocation of [updateThreadContext].\n */"} {"signature":"public fun copyForChild ( ) : CopyableThreadContextElement < S >","body":"public fun copyForChild ( ) : CopyableThreadContextElement < S >","docstring":"/**\n * Returns a [CopyableThreadContextElement] to replace `this` `CopyableThreadContextElement` in the child\n * coroutine's context that is under construction if the added context does not contain an element with the same [key].\n *\n * This function is called on the element each time a new coroutine inherits a context containing it,\n * and the returned value is folded into the context given to the child.\n *\n * Since this method is called whenever a new coroutine is launched in a context containing this\n * [CopyableThreadContextElement], implementations are performance-sensitive.\n */"} {"signature":"public fun mergeForChild ( overwritingElement : CoroutineContext . Element ) : CoroutineContext","body":"public fun mergeForChild ( overwritingElement : CoroutineContext . Element ) : CoroutineContext","docstring":"/**\n * Returns a [CopyableThreadContextElement] to replace `this` `CopyableThreadContextElement` in the child\n * coroutine's context that is under construction if the added context does contain an element with the same [key].\n *\n * This method is invoked on the original element, accepting as the parameter\n * the element that is supposed to overwrite it.\n */"} {"signature":"public fun < T > ThreadLocal < T > . asContextElement ( value : T = get ( ) ) : ThreadContextElement < T >","body":"= ThreadLocalElement ( value , this )","docstring":"/**\n * Wraps [ThreadLocal] into [ThreadContextElement]. The resulting [ThreadContextElement]\n * maintains the given [value] of the given [ThreadLocal] for coroutine regardless of the actual thread its is resumed on.\n * By default [ThreadLocal.get] is used as a value for the thread-local variable, but it can be overridden with [value] parameter.\n * Beware that context element **does not track** modifications of the thread-local and accessing thread-local from coroutine\n * without the corresponding context element returns **undefined** value. See the examples for a detailed description.\n *\n *\n * Example usage:\n * ```\n * val myThreadLocal = ThreadLocal()\n * ...\n * println(myThreadLocal.get()) // Prints \"null\"\n * launch(Dispatchers.Default + myThreadLocal.asContextElement(value = \"foo\")) {\n * println(myThreadLocal.get()) // Prints \"foo\"\n * withContext(Dispatchers.Main) {\n * println(myThreadLocal.get()) // Prints \"foo\", but it's on UI thread\n * }\n * }\n * println(myThreadLocal.get()) // Prints \"null\"\n * ```\n *\n * The context element does not track modifications of the thread-local variable, for example:\n *\n * ```\n * myThreadLocal.set(\"main\")\n * withContext(Dispatchers.Main) {\n * println(myThreadLocal.get()) // Prints \"main\"\n * myThreadLocal.set(\"UI\")\n * }\n * println(myThreadLocal.get()) // Prints \"main\", not \"UI\"\n * ```\n *\n * Use `withContext` to update the corresponding thread-local variable to a different value, for example:\n * ```\n * withContext(myThreadLocal.asContextElement(\"foo\")) {\n * println(myThreadLocal.get()) // Prints \"foo\"\n * }\n * ```\n *\n * Accessing the thread-local without corresponding context element leads to undefined value:\n * ```\n * val tl = ThreadLocal.withInitial { \"initial\" }\n *\n * runBlocking {\n * println(tl.get()) // Will print \"initial\"\n * // Change context\n * withContext(tl.asContextElement(\"modified\")) {\n * println(tl.get()) // Will print \"modified\"\n * }\n * // Context is changed again\n * println(tl.get()) // <- WARN: can print either \"modified\" or \"initial\"\n * }\n * ```\n * to fix this behaviour use `runBlocking(tl.asContextElement())`\n */"} {"signature":"public suspend inline fun ThreadLocal < * > . isPresent ( ) : Boolean","body":"= coroutineContext [ ThreadLocalKey ( this ) ] !== null","docstring":"/**\n * Return `true` when current thread local is present in the coroutine context, `false` otherwise.\n * Thread local can be present in the context only if it was added via [asContextElement] to the context.\n *\n * Example of usage:\n * ```\n * suspend fun processRequest() {\n * if (traceCurrentRequestThreadLocal.isPresent()) { // Probabilistic tracing\n * // Do some heavy-weight tracing\n * }\n * // Process request regularly\n * }\n * ```\n */"} {"signature":"public suspend inline fun ThreadLocal < * > . ensurePresent ( ) : Unit","body":"= check ( isPresent ( ) ) { \"\" }","docstring":"/**\n * Checks whether current thread local is present in the coroutine context and throws [IllegalStateException] if it is not.\n * It is a good practice to validate that thread local is present in the context, especially in large code-bases,\n * to avoid stale thread-local values and to have a strict invariants.\n *\n * E.g. one may use the following method to enforce proper use of the thread locals with coroutines:\n * ```\n * public suspend inline fun ThreadLocal.getSafely(): T {\n * ensurePresent()\n * return get()\n * }\n *\n * // Usage\n * withContext(...) {\n * val value = threadLocal.getSafely() // Fail-fast in case of improper context\n * }\n * ```\n */"} {"signature":"@ Test fun testBasicNoSuspend ( )","body":"= runTest { expect ( ) val result = withTimeout ( . seconds ) { expect ( ) \"\" } assertEquals ( \"\" , result ) finish ( ) }","docstring":"/**\n * Tests a case of no timeout and no suspension inside.\n */"} {"signature":"@ Test fun testBasicSuspend ( )","body":"= runTest { expect ( ) val result = withTimeout ( . seconds ) { expect ( ) yield ( ) expect ( ) \"\" } assertEquals ( \"\" , result ) finish ( ) }","docstring":"/**\n * Tests a case of no timeout and one suspension inside.\n */"} {"signature":"@ Test fun testDispatch ( )","body":"= runTest { expect ( ) launch { expect ( ) yield ( ) expect ( ) } expect ( ) val result = withTimeout ( . seconds ) { expect ( ) yield ( ) expect ( ) \"\" } assertEquals ( \"\" , result ) expect ( ) yield ( ) finish ( ) }","docstring":"/**\n * Tests proper dispatching of `withTimeout` blocks\n */"} {"signature":"@ Test fun testYieldBlockingWithTimeout ( )","body":"= runTest ( expected = { it is CancellationException } ) { withTimeout ( . milliseconds ) { while ( true ) { yield ( ) } } }","docstring":"/**\n * Tests that a 100% CPU-consuming loop will react on timeout if it has yields.\n */"} {"signature":"@ Test fun testWithTimeoutChildWait ( )","body":"= runTest { expect ( ) withTimeout ( . milliseconds ) { expect ( ) launch { expect ( ) } expect ( ) } finish ( ) }","docstring":"/**\n * Tests that [withTimeout] waits for children coroutines to complete.\n */"} {"signature":"open fun getAndSemiFixCurrentResultIfTypeVariable ( type : ConeKotlinType ) : ConeKotlinType ?","body":"= null","docstring":"/**\n * For non-trivial inference session (currently PCLA-only), if the type is a type variable that might be fixed,\n * fix it and return a fixation result.\n *\n * Type variable might be fixed if it doesn't belong to an outer CS and have proper constraints.\n *\n * By semi-fixation we mean that only the relevant EQUALITY constraint is added,\n * [org.jetbrains.kotlin.resolve.calls.inference.components.ConstraintSystemCompletionContext.fixVariable] is not expected to be called.\n *\n * See `getAndSemiFixCurrentResultIfTypeVariable` chapter at [docs/fir/pcla.md]\n *\n * NB: The callee must pay attention that exactly current common CS will be modified.\n */"} {"signature":"inline fun outerType ( classLikeType : ConeClassLikeType , session : FirSession , outerClass : ( FirClassLikeSymbol < * > ) -> FirClassLikeSymbol < * > ? , ) : ConeClassLikeType ?","body":"{ val fullyExpandedType = classLikeType . fullyExpandedType ( session ) val symbol = fullyExpandedType . lookupTag . toSymbol ( session ) ? : return null if ( symbol is FirRegularClassSymbol && ! symbol . fir . isInner ) return null val containingSymbol = outerClass ( symbol ) ? : return null val currentTypeArgumentsNumber = ( symbol as? FirRegularClassSymbol ) ? . fir ? . typeParameters ? . count { it is FirTypeParameter } ? : return containingSymbol . constructType ( fullyExpandedType . typeArguments . drop ( currentTypeArgumentsNumber ) . toTypedArray ( ) , isNullable = false ) }","docstring":"/**\n * If `classLikeType` is an inner class,\n * then this function returns a type representing\n * only the \"outer\" part of `classLikeType`:\n * the part with the outer classes and their\n * type arguments. Returns `null` otherwise.\n */"} {"signature":"public fun substitute ( type : KtType ) : KtType","body":"= withValidityAssertion { substituteOrNull ( type ) ? : type }","docstring":"/**\n * substitutes type parameters in a given type corresponding to internal mapping rules.\n *\n * @return substituted type if there was at least one substitution, [type] itself if there was no type parameter to substitute\n */"} {"signature":"public fun substituteOrNull ( type : KtType ) : KtType ?","body":"public fun substituteOrNull ( type : KtType ) : KtType ?","docstring":"/**\n * substitutes type parameters in a given type corresponding to internal mapping rules.\n *\n * @return substituted type if there was at least one substitution, `null` if there was no type parameter to substitute\n */"} {"signature":"fun IrElement . dumpKotlinLike ( options : KotlinLikeDumpOptions = KotlinLikeDumpOptions ( ) ) : String","body":"= dumpKotlinLike ( this , KotlinLikeDumper :: printElement , options )","docstring":"/**\n * Conventions:\n * * For unsupported cases (node, type) it prints a block comment which starts with \"/* ERROR:\" (*/<- hack for parser)\n * * Conventions for some operators:\n * * IMPLICIT_CAST -- expr /*as Type */\n * * IMPLICIT_NOTNULL -- expr /*!! Type */\n * * IMPLICIT_COERCION_TO_UNIT -- expr /*~> Unit */\n * * IMPLICIT_INTEGER_COERCION -- expr /*~> IntType */\n * * SAM_CONVERSION -- expr /*-> SamType */\n * * IMPLICIT_DYNAMIC_CAST -- expr /*~> dynamic */\n * * REINTERPRET_CAST -- expr /*=> Type */\n */"} {"signature":"internal expect fun < E : Throwable > recoverStackTrace ( exception : E , continuation : Continuation < * > ) : E","body":"internal expect fun < E : Throwable > recoverStackTrace ( exception : E , continuation : Continuation < * > ) : E","docstring":"/**\n * Tries to recover stacktrace for given [exception] and [continuation].\n * Stacktrace recovery tries to restore [continuation] stack frames using its debug metadata with [CoroutineStackFrame] API\n * and then reflectively instantiate exception of given type with original exception as a cause and\n * sets new stacktrace for wrapping exception.\n * Some frames may be missing due to tail-call elimination.\n *\n * Works only on JVM with enabled debug-mode.\n */"} {"signature":"@ Suppress ( \"\" ) internal expect fun Throwable . initCause ( cause : Throwable )","body":"@ Suppress ( \"\" ) internal expect fun Throwable . initCause ( cause : Throwable )","docstring":"/**\n * initCause on JVM, nop on other platforms\n */"} {"signature":"internal expect fun < E : Throwable > recoverStackTrace ( exception : E ) : E","body":"internal expect fun < E : Throwable > recoverStackTrace ( exception : E ) : E","docstring":"/**\n * Tries to recover stacktrace for given [exception]. Used in non-suspendable points of awaiting.\n * Stacktrace recovery tries to instantiate exception of given type with original exception as a cause.\n * Wrapping exception will have proper stacktrace as it's instantiated in the right context.\n *\n * Works only on JVM with enabled debug-mode.\n */"} {"signature":"@ PublishedApi internal expect fun < E : Throwable > unwrap ( exception : E ) : E","body":"@ PublishedApi internal expect fun < E : Throwable > unwrap ( exception : E ) : E","docstring":"/**\n * The opposite of [recoverStackTrace].\n * It is guaranteed that `unwrap(recoverStackTrace(e)) === e`\n */"} {"signature":"internal fun findCachedSerializer ( clazz : KClass < Any > , isNullable : Boolean ) : KSerializer < Any ? > ?","body":"{ return if ( ! isNullable ) { SERIALIZERS_CACHE . get ( clazz ) ? . cast ( ) } else { SERIALIZERS_CACHE_NULLABLE . get ( clazz ) } }","docstring":"/**\n * Find cacheable serializer in the cache.\n * If serializer is cacheable but missed in cache - it will be created, placed into the cache and returned.\n */"} {"signature":"internal fun findParametrizedCachedSerializer ( clazz : KClass < Any > , types : List < KType > , isNullable : Boolean ) : Result < KSerializer < Any ? > ? >","body":"{ return if ( ! isNullable ) { @ Suppress ( \"\" ) PARAMETRIZED_SERIALIZERS_CACHE . get ( clazz , types ) as Result < KSerializer < Any ? > ? > } else { PARAMETRIZED_SERIALIZERS_CACHE_NULLABLE . get ( clazz , types ) } }","docstring":"/**\n * Find cacheable parametrized serializer in the cache.\n * If serializer is cacheable but missed in cache - it will be created, placed into the cache and returned.\n */"} {"signature":"fun ringBell ( times : Int )","body":"{ }","docstring":"/**\n * Rings bell [times]\n */"} {"signature":"fun useGreeter ( greeter : Greeter )","body":"{ }","docstring":"/**\n * Uses provider [greeter]\n */"} {"signature":"override fun getDayOfTheWeek ( )","body":"= clockDay . name","docstring":"/**\n * Day of the week\n */"} {"signature":"fun Clock . extensionFun ( )","body":"{ }","docstring":"/**\n * A sample extension function\n * When $a \\ne 0$, there are two solutions to \\(ax^2 + bx + c = 0\\) and they are $$x = {-b \\pm \\sqrt{b^2-4ac} \\over 2a}.$$\n * @usesMathJax\n */"} {"signature":"fun linearRegressionWithTwoMetrics ( )","body":"{ val rnd = Random ( SEED ) val data = Array ( ) { doubleArrayOf ( , , , , ) } for ( i in data . indices ) { data [ i ] [ ] = * ( rnd . nextDouble ( ) - ) data [ i ] [ ] = * ( rnd . nextDouble ( ) - ) data [ i ] [ ] = * ( rnd . nextDouble ( ) - ) data [ i ] [ ] = * ( rnd . nextDouble ( ) - ) data [ i ] [ ] = data [ i ] [ ] - * data [ i ] [ ] + * data [ i ] [ ] - * data [ i ] [ ] + rnd . nextDouble ( ) } data . shuffle ( ) fun extractX ( ) : Array < FloatArray > { val init : ( index : Int ) -> FloatArray = { index -> floatArrayOf ( data [ index ] [ ] . toFloat ( ) , data [ index ] [ ] . toFloat ( ) , data [ index ] [ ] . toFloat ( ) , data [ index ] [ ] . toFloat ( ) ) } return Array ( data . size , init = init ) } fun extractY ( ) : FloatArray { val labels = FloatArray ( data . size ) { } for ( i in labels . indices ) { labels [ i ] = data [ i ] [ ] . toFloat ( ) } return labels } val dataset = OnHeapDataset . create ( extractX ( ) , extractY ( ) ) val ( train , test ) = dataset . split ( ) model . use { it . compile ( optimizer = Adam ( ) , loss = org . jetbrains . kotlinx . dl . api . core . loss . MSE ( ) , metrics = listOf ( MAE ( ) , MSE ( ) ) ) it . logSummary ( ) it . fit ( dataset = train , epochs = EPOCHS , batchSize = TRAINING_BATCH_SIZE ) repeat ( ) { id -> val xReal = test . getX ( id ) val yReal = test . getY ( id ) val yPred = it . predictSoftly ( xReal ) println ( \"\" ) } val mae = it . evaluate ( dataset = test , batchSize = TEST_BATCH_SIZE ) . metrics [ Metrics . MAE ] val mse = it . evaluate ( dataset = test , batchSize = TEST_BATCH_SIZE ) . metrics [ Metrics . MSE ] println ( \"\" + it . getLayer ( \"\" ) . weights [ \"\" ] . contentDeepToString ( ) ) println ( \"\" + it . getLayer ( \"\" ) . weights [ \"\" ] . contentDeepToString ( ) ) println ( \"\" ) println ( \"\" ) repeat ( ) { id -> val xReal = test . getX ( id ) val yReal = test . getY ( id ) val yPred = it . predictSoftly ( xReal ) println ( \"\" ) } } }","docstring":"/**\n * This example shows how to do regression from scratch, starting from generated dataset, using simple Dense-based [model] with 1 neuron.\n *\n * It includes:\n * - dataset creation\n * - dataset splitting\n * - model compilation\n * - model training\n * - model evaluation\n * - model weights printing\n */"} {"signature":"fun main ( ) : Unit","body":"= linearRegressionWithTwoMetrics ( )","docstring":"/** */"} {"signature":"public fun createFunctionBodyFromRequest ( request : BridgeRequest ) : SirFunctionBody","body":"{ val callee = request . cDeclarationName ( ) val calleeArguments = request . callable . allParameters . map { it . name } val callSite = \"\" val callStatement = if ( request . callable . returnType . isVoid ) callSite else \"\" return SirFunctionBody ( listOf ( callStatement ) ) }","docstring":"/**\n * Generates the body of a function from a given request.\n *\n * @param request the BridgeRequest object that contains information about the function and the bridge\n * @return the generated SirFunctionBody object representing the body of the function\n */"} {"signature":"public fun add ( bridge : FunctionBridge )","body":"public fun add ( bridge : FunctionBridge )","docstring":"/**\n * Populate printer with an additional [bridge].\n */"} {"signature":"public fun print ( ) : Sequence < String >","body":"public fun print ( ) : Sequence < String >","docstring":"/**\n * Outputs the aggregated result.\n */"} {"signature":"public fun < T : Number , D : Dimension > MultiArray < T , D > . argMax ( ) : Int","body":"= mk . math . argMax ( this )","docstring":"/**\n * Returns flat index of maximum element in an ndarray.\n *\n * same as [Math.argMax]\n */"} {"signature":"public fun < T : Number , D : Dimension > MultiArray < T , D > . argMin ( ) : Int","body":"= mk . math . argMin ( this )","docstring":"/**\n * Returns flat index of minimum element in an ndarray.\n *\n * same as [Math.argMin]\n */"} {"signature":"@ JvmName ( \"\" ) public fun < T : Number , D : Dimension > MultiArray < T , D > . exp ( ) : NDArray < Double , D >","body":"= mk . math . exp ( this )","docstring":"/**\n * Returns an ndarray of Double from the given ndarray to each element of which an exp function has been applied.\n *\n * same as [Math.exp]\n */"} {"signature":"@ JvmName ( \"\" ) public fun < D : Dimension > MultiArray < Float , D > . exp ( ) : NDArray < Float , D >","body":"= mk . math . mathEx . expF ( this )","docstring":"/**\n * Returns an ndarray of Float from the given ndarray to each element of which an exp function has been applied.\n *\n * same as [Math.exp]\n */"} {"signature":"@ JvmName ( \"\" ) public fun < D : Dimension > MultiArray < ComplexFloat , D > . exp ( ) : NDArray < ComplexFloat , D >","body":"= mk . math . mathEx . expCF ( this )","docstring":"/**\n * Returns an ndarray of [ComplexFloat] from the given ndarray to each element of which an exp function has been applied.\n *\n * same as [Math.exp]\n */"} {"signature":"@ JvmName ( \"\" ) public fun < D : Dimension > MultiArray < ComplexDouble , D > . exp ( ) : NDArray < ComplexDouble , D >","body":"= mk . math . mathEx . expCD ( this )","docstring":"/**\n * Returns an ndarray of [ComplexDouble] from the given ndarray to each element of which an exp function has been applied.\n *\n * same as [Math.exp]\n */"} {"signature":"@ JvmName ( \"\" ) public fun < T : Number , D : Dimension > MultiArray < T , D > . log ( ) : NDArray < Double , D >","body":"= mk . math . mathEx . log ( this )","docstring":"/**\n * Returns an ndarray of Double from the given ndarray to each element of which a log function has been applied.\n *\n * same as [Math.log]\n */"} {"signature":"@ JvmName ( \"\" ) public fun < D : Dimension > MultiArray < Float , D > . log ( ) : NDArray < Float , D >","body":"= mk . math . mathEx . logF ( this )","docstring":"/**\n * Returns an ndarray of Float from the given ndarray to each element of which a log function has been applied.\n *\n * same as [Math.log]\n */"} {"signature":"@ JvmName ( \"\" ) public fun < D : Dimension > MultiArray < ComplexFloat , D > . log ( ) : NDArray < ComplexFloat , D >","body":"= mk . math . mathEx . logCF ( this )","docstring":"/**\n * Returns an ndarray of [ComplexFloat] from the given ndarray to each element of which a log function has been applied.\n *\n * same as [Math.log]\n */"} {"signature":"@ JvmName ( \"\" ) public fun < D : Dimension > MultiArray < ComplexDouble , D > . log ( ) : NDArray < ComplexDouble , D >","body":"= mk . math . mathEx . logCD ( this )","docstring":"/**\n * Returns an ndarray of [ComplexDouble] from the given ndarray to each element of which a log function has been applied.\n *\n * same as [Math.log]\n */"} {"signature":"@ JvmName ( \"\" ) public fun < T : Number , D : Dimension > MultiArray < T , D > . sin ( ) : NDArray < Double , D >","body":"= mk . math . mathEx . sin ( this )","docstring":"/**\n * Returns an ndarray of Double from the given ndarray to each element of which a sin function has been applied.\n *\n * same as [Math.sin]\n */"} {"signature":"@ JvmName ( \"\" ) public fun < D : Dimension > MultiArray < Float , D > . sin ( ) : NDArray < Float , D >","body":"= mk . math . mathEx . sinF ( this )","docstring":"/**\n * Returns an ndarray of Float from the given ndarray to each element of which a sin function has been applied.\n *\n * same as [Math.sin]\n */"} {"signature":"@ JvmName ( \"\" ) public fun < D : Dimension > MultiArray < ComplexFloat , D > . sin ( ) : NDArray < ComplexFloat , D >","body":"= mk . math . mathEx . sinCF ( this )","docstring":"/**\n * Returns an ndarray of [ComplexFloat] from the given ndarray to each element of which a sin function has been applied.\n *\n * same as [Math.sin]\n */"} {"signature":"@ JvmName ( \"\" ) public fun < D : Dimension > MultiArray < ComplexDouble , D > . sin ( ) : NDArray < ComplexDouble , D >","body":"= mk . math . mathEx . sinCD ( this )","docstring":"/**\n * Returns an ndarray of [ComplexDouble] from the given ndarray to each element of which a sin function has been applied.\n *\n * same as [Math.sin]\n */"} {"signature":"@ JvmName ( \"\" ) public fun < T : Number , D : Dimension > MultiArray < T , D > . cos ( ) : NDArray < Double , D >","body":"= mk . math . mathEx . cos ( this )","docstring":"/**\n * Returns an ndarray of Double from the given ndarray to each element of which a cos function has been applied.\n *\n * same as [Math.cos]\n */"} {"signature":"@ JvmName ( \"\" ) public fun < D : Dimension > MultiArray < Float , D > . cos ( ) : NDArray < Float , D >","body":"= mk . math . mathEx . cosF ( this )","docstring":"/**\n * Returns an ndarray of Float from the given ndarray to each element of which a cos function has been applied.\n *\n * same as [Math.cos]\n */"} {"signature":"@ JvmName ( \"\" ) public fun < D : Dimension > MultiArray < ComplexFloat , D > . cos ( ) : NDArray < ComplexFloat , D >","body":"= mk . math . mathEx . cosCF ( this )","docstring":"/**\n * Returns an ndarray of [ComplexFloat] from the given ndarray to each element of which a cos function has been applied.\n *\n * same as [Math.cos]\n */"} {"signature":"@ JvmName ( \"\" ) public fun < D : Dimension > MultiArray < ComplexDouble , D > . cos ( ) : NDArray < ComplexDouble , D >","body":"= mk . math . mathEx . cosCD ( this )","docstring":"/**\n * Returns an ndarray of [ComplexFloat] from the given ndarray to each element of which a cos function has been applied.\n *\n * same as [Math.cos]\n */"} {"signature":"public fun < T : Number , D : Dimension > MultiArray < T , D > . cumSum ( ) : D1Array < T >","body":"= mk . math . cumSum ( this )","docstring":"/**\n * Returns cumulative sum of all elements in the given ndarray.\n */"} {"signature":"fun foo ( )","body":"{ fun localFoo ( ) { } class LocalClass }","docstring":"/**\n * Doc comment for function\n */"} {"signature":"@ Deprecated ( SHORTCUTS_DEPRECATION_MESSAGE ) fun ios ( )","body":"= ios ( \"\" ) { }","docstring":"/**\n * Deprecated:\n * Declare targets explicitly like\n * ```kotlin\n * kotlin {\n * applyDefaultHierarchyTemplate() /* <- optional; is applied by default, when compatible */\n *\n * iosX64()\n * iosArm64()\n * iosSimulatorArm64() // <- Note: This target was previously not registered by the ios() shortcut!\n *\n * /* ... more targets! */\n * }\n * ```\n */"} {"signature":"@ Deprecated ( SHORTCUTS_DEPRECATION_MESSAGE ) fun tvos ( )","body":"= tvos ( \"\" ) { }","docstring":"/**\n * Deprecated:\n * Declare targets explicitly like\n * ```kotlin\n * kotlin {\n * applyDefaultHierarchyTemplate() /* <- optional; is applied by default, when compatible */\n *\n * tvosArm64()\n * tvosX64()\n * tvosSimulatorArm64() // <- Note: This target was previously not registered by the tvos() shortcut!\n *\n * /* ... more targets! */\n * }\n * ```\n */"} {"signature":"@ Deprecated ( SHORTCUTS_DEPRECATION_MESSAGE ) fun watchos ( )","body":"= watchos ( \"\" ) { }","docstring":"/**\n * Deprecated:\n * Declare targets explicitly like\n * ```kotlin\n * kotlin {\n * applyDefaultHierarchyTemplate() /* <- optional; is applied by default, when compatible */\n *\n * watchosArm64()\n * watchosX64()\n * watchosSimulatorArm64() // <- Note: This target was previously not registered by the watchos() shortcut!\n * watchosArm32() //<- Note: This target was previously applied, but is likely not needed anymore\n *\n *\n * /* ... more targets! */\n * }\n * ```\n */"} {"signature":"fun resnet50onDogsVsCatsDataset ( )","body":"{ val modelBuilderFunction = :: resnet50Light runResNetTraining ( modelBuilderFunction ) }","docstring":"/**\n * This example shows how to do image classification from scratch using pre-made [resnet50Light] model, without leveraging pre-trained weights.\n * We demonstrate the workflow on the Kaggle Cats vs Dogs binary 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 * - usage of pre-made model from [org.jetbrains.kotlinx.dl.api.core.model] package\n * - model compilation\n * - model training\n * - model evaluation\n */"} {"signature":"fun main ( ) : Unit","body":"= resnet50onDogsVsCatsDataset ( )","docstring":"/** */"} {"signature":"infix fun < T1 > EmptyTuple . concat ( other : Tuple1 < T1 > ) : Tuple1 < T1 >","body":"= other . copy ( )","docstring":"/**\n * This file provides functions to easily merge two separate tuples into one.\n *\n * For example (using tupleOf() to create a new tuple):\n * ```tupleOf(a, b) concat tupleOf(c, d) == tupleOf(a, b, c, d)```\n * or using the shorthand:\n * ```tupleOf(a, b) + tupleOf(c, d) == tupleOf(a, b, c, d)```\n *\n * If you mean to create ```tupleOf(a, b, tupleOf(c, d))``` or ```tupleOf(tupleOf(a, b), c, d)```,\n * use [appendedBy] and [prependedBy] explicitly:\n * ```t(a, b).appendedBy(t(c, d)) == t(a, b, t(c, d))```\n * or wrap it in another [Tuple1]:\n * ```t(a, b) + t(t(c, d)) == t(a, b, t(c, d))```\n *\n */"} {"signature":"fun substituteArgumentProjection ( argument : TypeProjection ) : TypeProjection ?","body":"{ return null }","docstring":"/**\n * Returns not null when substitutor manages specific type projection substitution by itself.\n * Intended for corner cases involving interactions with legacy type substitutor,\n * please consider using substituteNotNullTypeWithConstructor instead of making manual projection substitutions.\n */"} {"signature":"@ PublishedApi @ SinceKotlin ( \"\" ) internal fun apiVersionIsAtLeast ( major : Int , minor : Int , patch : Int ) : Boolean","body":"= KotlinVersion . CURRENT . isAtLeast ( major , minor , patch )","docstring":"/**\n * Constant check of api version used during compilation\n *\n * This function is evaluated at compile time to a constant value,\n * so there should be no references to it in other modules.\n *\n * The function usages are validated to have literal argument values.\n */"} {"signature":"fun strictEqualTypes ( a : UnwrappedType , b : UnwrappedType ) : Boolean","body":"{ return AbstractStrictEqualityTypeChecker . strictEqualTypes ( SimpleClassicTypeSystemContext , a , b ) }","docstring":"/**\n * String! != String & A != A, also A != A\n * also A<*> != A\n * different error types non-equals even errorTypeEqualToAnything\n */"} {"signature":"fun dependsOn ( sourceSet : SourceSet )","body":"{ dependsOn ( DokkaSourceSetID ( sourceSet . name ) ) }","docstring":"/**\n * Convenient override to **append** source sets to [dependentSourceSets]\n */"} {"signature":"fun dependsOn ( sourceSet : GradleDokkaSourceSetBuilder )","body":"{ dependsOn ( sourceSet . sourceSetID ) }","docstring":"/**\n * Convenient override to **append** source sets to [dependentSourceSets]\n */"} {"signature":"fun dependsOn ( sourceSet : DokkaConfiguration . DokkaSourceSet )","body":"{ dependsOn ( sourceSet . sourceSetID ) }","docstring":"/**\n * Convenient override to **append** source sets to [dependentSourceSets]\n */"} {"signature":"fun dependsOn ( sourceSetName : String )","body":"{ dependsOn ( DokkaSourceSetID ( sourceSetName ) ) }","docstring":"/**\n * Convenient override to **append** source sets to [dependentSourceSets]\n */"} {"signature":"fun dependsOn ( sourceSetID : DokkaSourceSetID )","body":"{ dependentSourceSets . add ( sourceSetID ) }","docstring":"/**\n * Convenient override to **append** source sets to [dependentSourceSets]\n */"} {"signature":"fun sourceRoot ( file : File )","body":"{ sourceRoots . from ( file ) }","docstring":"/**\n * Convenient override to **append** source roots to [sourceRoots]\n */"} {"signature":"fun sourceRoot ( path : String )","body":"{ sourceRoot ( project . file ( path ) ) }","docstring":"/**\n * Convenient override to **append** source roots to [sourceRoots]\n */"} {"signature":"@ Suppress ( \"\" ) fun sourceLink ( c : Closure < in GradleSourceLinkBuilder > )","body":"{ val configured = org . gradle . util . ConfigureUtil . configure ( c , GradleSourceLinkBuilder ( project ) ) sourceLinks . add ( configured ) }","docstring":"/**\n * Closure for configuring source links, appending to [sourceLinks].\n *\n * @see [GradleSourceLinkBuilder] for details.\n */"} {"signature":"fun sourceLink ( action : Action < in GradleSourceLinkBuilder > )","body":"{ val sourceLink = GradleSourceLinkBuilder ( project ) action . execute ( sourceLink ) sourceLinks . add ( sourceLink ) }","docstring":"/**\n * Action for configuring source links, appending to [sourceLinks].\n *\n * @see [GradleSourceLinkBuilder] for details.\n */"} {"signature":"@ Suppress ( \"\" ) fun perPackageOption ( c : Closure < in GradlePackageOptionsBuilder > )","body":"{ val configured = org . gradle . util . ConfigureUtil . configure ( c , GradlePackageOptionsBuilder ( project ) ) perPackageOptions . add ( configured ) }","docstring":"/**\n * Closure for configuring package options, appending to [perPackageOptions].\n *\n * @see [GradlePackageOptionsBuilder] for details.\n */"} {"signature":"fun perPackageOption ( action : Action < in GradlePackageOptionsBuilder > )","body":"{ val option = GradlePackageOptionsBuilder ( project ) action . execute ( option ) perPackageOptions . add ( option ) }","docstring":"/**\n * Action for configuring package options, appending to [perPackageOptions].\n *\n * @see [GradlePackageOptionsBuilder] for details.\n */"} {"signature":"@ Suppress ( \"\" ) fun externalDocumentationLink ( c : Closure < in GradleExternalDocumentationLinkBuilder > )","body":"{ val link = org . gradle . util . ConfigureUtil . configure ( c , GradleExternalDocumentationLinkBuilder ( project ) ) externalDocumentationLinks . add ( link ) }","docstring":"/**\n * Closure for configuring external documentation links, appending to [externalDocumentationLinks].\n *\n * @see [GradleExternalDocumentationLinkBuilder] for details.\n */"} {"signature":"fun externalDocumentationLink ( action : Action < in GradleExternalDocumentationLinkBuilder > )","body":"{ val link = GradleExternalDocumentationLinkBuilder ( project ) action . execute ( link ) externalDocumentationLinks . add ( link ) }","docstring":"/**\n * Action for configuring external documentation links, appending to [externalDocumentationLinks].\n *\n * See [GradleExternalDocumentationLinkBuilder] for details.\n */"} {"signature":"fun externalDocumentationLink ( url : String , packageListUrl : String ? = null )","body":"{ externalDocumentationLink ( URI ( url ) . toURL ( ) , packageListUrl = packageListUrl ? . let ( :: URI ) ? . toURL ( ) ) }","docstring":"/**\n * Convenient override to **append** external documentation links to [externalDocumentationLinks].\n */"} {"signature":"fun externalDocumentationLink ( url : URL , packageListUrl : URL ? = null )","body":"{ externalDocumentationLinks . add ( GradleExternalDocumentationLinkBuilder ( project ) . apply { this . url . convention ( url ) if ( packageListUrl != null ) { this . packageListUrl . convention ( packageListUrl ) } } ) }","docstring":"/**\n * Convenient override to **append** external documentation links to [externalDocumentationLinks].\n */"} {"signature":"private fun recordMappingsForNestedClassesActualizedViaTypealias ( typealiasClassId : ClassId , actualClassSymbol : IrClassSymbol )","body":"{ fun recordRecursively ( expectClass : IrClass , actualClass : IrClass ) { val actualNestedClassesByName = actualClass . nestedClasses . associateBy { it . name } for ( expectNestedClass in expectClass . nestedClasses ) { val actualNestedClass = actualNestedClassesByName [ expectNestedClass . name ] ? : continue actualClasses [ expectNestedClass . classIdOrFail ] = actualNestedClass . symbol recordRecursively ( expectNestedClass , actualNestedClass ) } } val expectClassSymbol = expectTopLevelClasses [ typealiasClassId ] ? : return recordRecursively ( expectClassSymbol . owner , actualClassSymbol . owner ) }","docstring":"/**\n * For given actual typealias goes through all nested classes in expect class to record their mappings in [actualClasses].\n *\n * This is needed because in case of `expect` nested classes actualized via typealias we can't simply find actual symbol by\n * `expect` `ClassId` (like we do for top-level classes), because `ClassId` is different.\n * For example, `expect` class `com/example/ExpectClass.Nested` may have actual with id `real/package/ActualTypeliasTarget.Nested`.\n */"} {"signature":"private fun String . withSystemLineSeparator ( ) : String","body":"= this . replace ( \"\" , System . lineSeparator ( ) )","docstring":"/**\n * If the expected output was generated on Linux, but the tests are run under Windows,\n * the test might fail when comparing the strings due to different separators.\n */"} {"signature":"private fun IrType . checkObjectLeak ( ) : Boolean","body":"{ return if ( this is IrSimpleType ) { val signature = classifier . signature val possibleLeakedClassifier = ( signature == null || signature . isLocal ) && classifier !is IrTypeParameterSymbol possibleLeakedClassifier || arguments . any { it . typeOrNull ? . checkObjectLeak ( ) == true } } else false }","docstring":"/**\n * In `declarations-only` mode in case of private property/function with inferred anonymous private type like this\n * class C {\n * private val p = object {\n * fun foo() = 42\n * }\n *\n * private fun f() = object {\n * fun bar() = \"42\"\n * }\n *\n * private val pp = p.foo()\n * private fun ff() = f().bar()\n * }\n * object's classifier is leaked outside p/f scopes and accessible on C's level so\n * if their initializer/body weren't read we have unbound `foo/bar` symbol and unbound `object` symbols.\n * To fix this make sure that such declaration forced to be deserialized completely.\n *\n * For more information see `anonymousClassLeak.kt` test and issue KT-40216\n */"} {"signature":"internal inline fun < reified S : IrSymbol > IrSymbol . checkSymbolType ( fallbackSymbolKind : SymbolKind ? ) : S","body":"{ if ( this is S ) return this if ( ! partialLinkageEnabled ) throw IrSymbolTypeMismatchException ( S :: class . java , this ) return referenceDeserializedSymbol ( symbolTable = symbolDeserializer . symbolTable , fileSymbol = null , symbolKind = fallbackSymbolKind ? : error ( \"\" ) , idSig = signature ? . takeIf { it . isPubliclyVisible } ? : error ( \"\" ) ) as S }","docstring":"/**\n * This function allows to check deserialized symbols. If the deserialized symbol mismatches the symbol kind\n * at the call site in the deserializer then generate and reference another symbol with\n * the same signature. In case PL is off, just throw [IrSymbolTypeMismatchException].\n *\n * Note: [fallbackSymbolKind] must not completely match [S], but it should represent a subclass of [S].\n *\n * Example: [S] is [IrClassifierSymbol] and [fallbackSymbolKind] is [CLASS_SYMBOL],\n * which is only one possible option along with [TYPE_PARAMETER_SYMBOL].\n *\n * Note, that for local IR declarations such as [IrValueDeclaration] [fallbackSymbolKind] can be left null.\n */"} {"signature":"public fun getBinaryRoots ( ) : Collection < Path >","body":"public fun getBinaryRoots ( ) : Collection < Path >","docstring":"/**\n * A list of binary files which forms a binary module. It can be a list of JARs, KLIBs, folders with .class files.\n *\n * It should be consistent with [contentScope], so (pseudo-Kotlin):\n * ```\n * library.contentScope.contains(file) <=> library.getBinaryRoots().listRecursively().contains(file)\n * ```\n */"} {"signature":"fun createDescriptor ( name : Name , storageManager : StorageManager , builtIns : KotlinBuiltIns , origin : KlibModuleOrigin , customCapabilities : Map < ModuleCapability < * > , Any ? > = emptyMap ( ) ) : ModuleDescriptorImpl","body":"fun createDescriptor ( name : Name , storageManager : StorageManager , builtIns : KotlinBuiltIns , origin : KlibModuleOrigin , customCapabilities : Map < ModuleCapability < * > , Any ? > = emptyMap ( ) ) : ModuleDescriptorImpl","docstring":"/**\n * Base method for creation of any Kotlin/Native [ModuleDescriptor].\n */"} {"signature":"fun createDescriptorAndNewBuiltIns ( name : Name , storageManager : StorageManager , origin : KlibModuleOrigin , customCapabilities : Map < ModuleCapability < * > , Any ? > = emptyMap ( ) ) : ModuleDescriptorImpl","body":"fun createDescriptorAndNewBuiltIns ( name : Name , storageManager : StorageManager , origin : KlibModuleOrigin , customCapabilities : Map < ModuleCapability < * > , Any ? > = emptyMap ( ) ) : ModuleDescriptorImpl","docstring":"/**\n * Please use this method with care: As far as it creates an instance of [KotlinBuiltIns] it should be\n * normally used for creation of the very first (e.g. \"stdlib\") module in the set of created modules.\n */"} {"signature":"public fun r ( re : Float ) : ComplexFloat","body":"= ComplexFloat ( re , )","docstring":"/**\n * Returns a [ComplexFloat] with the given real part.\n *\n * @param re the real part of the complex number\n * @return a [ComplexFloat] number with the given real part and 0f imaginary part\n */"} {"signature":"public fun r ( re : Double ) : ComplexDouble","body":"= ComplexDouble ( re , )","docstring":"/**\n * Returns a [ComplexDouble] with the given real part.\n *\n * @param re the real part of the complex number\n * @return a [ComplexDouble] number with the given real part and 0.0 imaginary part\n */"} {"signature":"public fun i ( im : Float ) : ComplexFloat","body":"= ComplexFloat ( , im )","docstring":"/**\n * Returns the [ComplexFloat] number representation of the given imaginary part.\n *\n * @param im the imaginary part of the complex number\n * @return a [ComplexFloat] number with the 0f real part and given imaginary part\n */"} {"signature":"public fun i ( im : Double ) : ComplexDouble","body":"= ComplexDouble ( , im )","docstring":"/**\n * Returns the [ComplexDouble] number representation of the given imaginary part.\n *\n * @param im the imaginary part of the complex number.\n * @return a [ComplexDouble] number with the 0.0 real part and given imaginary part\n */"} {"signature":"internal fun convertComplexFloatToLong ( re : Float , im : Float ) : Long","body":"= ( re . toRawBits ( ) . toLong ( ) shl ) or ( im . toRawBits ( ) . toLong ( ) and )","docstring":"/**\n * Converts a complex float to a long value.\n *\n * This method takes in a real and imaginary float value and returns a long equivalent. The real\n * value is converted to raw bits and left shifted by 32 bits. The imaginary value is also\n * converted to raw bits and ANDed with the hexadecimal value 0xFFFFFFFFL to get the last 32 bits\n * of the long. The two 32-bit values are then ORed to get the final long value.\n *\n * @param re the real value of the complex number as a float\n * @param im the imaginary value of the complex number as a float\n *\n * @return the long equivalent of the complex number given by the real and imaginary values\n */"} {"signature":"fun getAvailableScopes ( processTypeScope : FirTypeScope . ( ConeKotlinType ) -> FirTypeScope = { this } , ) : List < FirScope >","body":"= when { scope != null -> listOf ( scope ) implicitReceiver != null -> listOf ( implicitReceiver . getImplicitScope ( processTypeScope ) ) contextReceiverGroup != null -> contextReceiverGroup . map { it . getImplicitScope ( processTypeScope ) } else -> error ( \"\" ) }","docstring":"/**\n * Returns [scope] if it is not null. Otherwise, returns scopes of implicit receivers (including context receivers).\n *\n * Note that a scope for a companion object is an implicit scope.\n */"} {"signature":"protected fun libraryInCurrentDir ( name : String ) : KotlinLibrary","body":"= resolverByName ( emptyList ( ) , logger = KlibToolLogger ( output ) ) . resolve ( name )","docstring":"/** TODO: unify with [libraryInDefaultRepoOrCurrentDir] */"} {"signature":"protected fun libraryInDefaultRepoOrCurrentDir ( name : String ) : KotlinLibrary","body":"= resolverByName ( listOf ( DependencyDirectories . localKonanDir . resolve ( \"\" ) . absolutePath ) , logger = KlibToolLogger ( output ) ) . resolve ( name )","docstring":"/** TODO: unify with [libraryInCurrentDir] */"} {"signature":"@ Test fun `test - KT58280 - jvmWithJava Target does not add main classes to test compile classpath` ( )","body":"{ val project = buildProject ( ) project . plugins . apply ( \"\" ) project . applyKotlinJvmPlugin ( ) project . repositories . mavenLocal ( ) project . repositories . mavenCentralCacheRedirector ( ) val kotlin = project . kotlinJvmExtension kotlin . target . compilations . test . internal . configurations . compileDependencyConfiguration . resolvedConfiguration . files . forEach { file -> if ( file in kotlin . target . compilations . main . output . allOutputs ) { fail ( \"\" ) } } }","docstring":"/**\n * Context:\n * https://youtrack.jetbrains.com/issue/KT-58280/org.jetbrains.kotlin.jvm-Gradle-plugin-contributes-build-directories-to-the-test-compile-classpath\n *\n * This is not necessarily a 'regression' as IntelliJ and CLI compilations work fine.\n * Tools like eclipse did not expect this output.\n *\n * The commit the initially (and accidentally) changed the behavior was:\n * [Gradle] Implement KotlinWithJavaCompilation with underlying KotlinCompilationImpl Sebastian Sellmair* 04.10.22, 17:16\n * af198825899df9943814e2cb54d39868fff399fb\n *\n * This test 'fixates' the old behaviour.\n */"} {"signature":"public actual fun todo ( block : ( ) -> Unit )","body":"{ println ( \"\" + block ) }","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 ( \"\" ) internal actual inline fun AssertionErrorWithCause ( message : String ? , cause : Throwable ? ) : AssertionError","body":"= AssertionError ( message , cause )","docstring":"/** Platform-specific construction of AssertionError with cause */"} {"signature":"internal actual fun lookupAsserter ( ) : Asserter","body":"= DefaultJsAsserter","docstring":"/**\n * Provides the JS implementation of asserter\n */"} {"signature":"private fun createTabs ( pageContext : ContentPage ) : List < ContentTab >","body":"{ return when ( pageContext ) { is ClasslikePage -> createTabsForClasslikes ( pageContext ) is PackagePage -> createTabsForPackage ( pageContext ) else -> throw IllegalArgumentException ( \"\" ) } }","docstring":"/**\n * Tabs themselves are created in HTML plugin since, currently, only HTML format supports them.\n * [TabbedContentType] is used to mark content that should be inside tab content.\n * A tab can display multiple [TabbedContentType].\n * The content style [ContentStyle.TabbedContent] is used to determine where tabs will be generated.\n *\n * @see TabbedContentType\n * @see ContentStyle.TabbedContent\n */"} {"signature":"private fun FlowContent . buildRowForPlatformTaggedBrief ( contextNode : ContentGroup , toRender : List < ContentNode > , pageContext : ContentPage , sourceSetRestriction : Set < DisplaySourceSet > ? )","body":"{ buildAnchor ( contextNode ) div ( classes = \"\" ) { addSourceSetFilteringAttributes ( contextNode ) div { div ( \"\" + contextNode . style . joinToString ( separator = \"\" ) ) { buildRowHeaderLink ( toRender , pageContext , sourceSetRestriction , contextNode . anchor ) div ( \"\" ) { if ( ContentKind . shouldBePlatformTagged ( contextNode . dci . kind ) ) { createPlatformTags ( contextNode , cssClasses = \"\" ) } } } div { buildRowBriefSectionForDocs ( toRender , pageContext , sourceSetRestriction ) } } } }","docstring":"/**\n * Builds a row with support for filtering and showing platform bubble and brief content.\n *\n * Used for rendering packages in [ModulePage] and types in [AllTypesPageNode]\n */"} {"signature":"public open fun FlowContent . clickableLogo ( page : PageNode , pathToRoot : String )","body":"{ if ( context . configuration . delayTemplateSubstitution && page is ContentPage ) { templateCommand ( PathToRootSubstitutionCommand ( pattern = \"\" , default = pathToRoot ) ) { a { href = \"\" templateCommand ( ProjectNameSubstitutionCommand ( pattern = \"\" , default = context . configuration . moduleName ) ) { span { text ( \"\" ) } } } } } else { a { href = pathToRoot + \"\" text ( context . configuration . moduleName ) } } }","docstring":"/**\n * This is deliberately left open for plugins that have some other pages above ours and would like to link to them\n * instead of ours when clicking the logo\n */"} {"signature":"fun TestProject . preparePodfile ( iosAppLocation : String , mode : ImportMode )","body":"{ val iosAppDir = projectPath . resolve ( iosAppLocation ) iosAppDir . resolve ( \"\" ) . takeIf { it . exists ( ) } ? . replaceText ( podfileImportDirectivePlaceholder , mode . directive ) }","docstring":"/**\n * Prepares the Podfile for an iOS app in the [TestProject]\n *\n * @param iosAppLocation The relative location of the iOS app directory within the [TestProject]\n * @param mode The [ImportMode] to be set for the Podfile.\n *\n */"} {"signature":"fun Path . addSpecRepo ( specRepo : String )","body":"= addCocoapodsBlock ( \"\" . wrapIntoBlock ( \"\" ) )","docstring":"/**\n * Wraps the given string into a specRepos block and adds this block to the end of the [this] path.\n *\n * @param specRepo The code to be wrapped with the Cocoapods block.\n */"} {"signature":"fun Path . addCocoapodsBlock ( str : String )","body":"= addKotlinBlock ( str . wrapIntoBlock ( \"\" ) )","docstring":"/**\n * Wraps the given string into a Cocoapods block and adds this block to the end of the [this] path.\n *\n * @param str The code to be wrapped with the Cocoapods block.\n */"} {"signature":"fun Path . addKotlinBlock ( str : String )","body":"= appendLine ( str . wrapIntoBlock ( \"\" ) )","docstring":"/**\n * Wraps the given string into a Kotlin block and adds this block to the end of the [this] path.\n *\n * @param str The code to be wrapped with the Cocoapods block.\n */"} {"signature":"fun Path . addFrameworkBlock ( str : String )","body":"= addCocoapodsBlock ( str . wrapIntoBlock ( \"\" ) )","docstring":"/**\n * Wraps the given string into a Framework block and adds this block to the end of the [this] path.\n *\n * @param str The code to be wrapped with the Cocoapods block.\n */"} {"signature":"fun Path . addPod ( podName : String , configuration : String ? = null )","body":"{ val pod = \"\" val podBlock = configuration ? . wrapIntoBlock ( pod ) ? : pod addCocoapodsBlock ( podBlock ) }","docstring":"/**\n * Adds a Cocoapods dependency to [this] build script.\n *\n * @param podName The name of the Cocoapods dependency to be added.\n * @param configuration The optional configuration string for the Cocoapods dependency.\n */"} {"signature":"fun Path . removePod ( podName : String )","body":"{ val text = readText ( ) val begin = text . indexOf ( \"\"\"\"\"\" ) require ( begin != - ) { \"\"\"\"\"\" . trimIndent ( ) } var index = begin + \"\"\"\"\"\" . length - if ( text . indexOf ( \"\"\"\"\"\" , startIndex = begin ) != - ) { index += var bracket = while ( bracket != ) { if ( text [ ++ index ] == '' ) { bracket ++ } else if ( text [ index ] == '' ) { bracket -- } } } writeText ( text . removeRange ( begin .. index ) ) }","docstring":"/**\n * Removes a Cocoapods dependency from [this] build script.\n *\n * @param podName The name of the Cocoapods dependency to be removes.\n */"} {"signature":"fun cocoaPodsEnvironmentVariables ( ) : Map < String , String >","body":"{ if ( ! shouldInstallLocalCocoapods ) { return emptyMap ( ) } val path = cocoapodsBinPath . absolutePathString ( ) + File . pathSeparator + System . getenv ( \"\" ) val gemPath = System . getenv ( \"\" ) ? . let { cocoapodsInstallationRoot . absolutePathString ( ) + File . pathSeparator + it } ? : cocoapodsInstallationRoot . absolutePathString ( ) return mapOf ( \"\" to path , \"\" to gemPath , ) }","docstring":"/**\n * Method returns required environment variables for cocoapods tests with execution of [POD_INSTALL_TASK_NAME]\n */"} {"signature":"@ Synchronized fun ensureCocoapodsInstalled ( )","body":"{ if ( shouldInstallLocalCocoapods ) { val installDir = cocoapodsInstallationRoot . absolutePathString ( ) println ( \"\" ) try { gem ( \"\" , \"\" , installDir , \"\" , \"\" , \"\" , \"\" , \"\" ) } catch ( e : AssertionError ) { System . err . println ( \"\" ) System . err . println ( e . toString ( ) ) } gem ( \"\" , \"\" , installDir , \"\" , \"\" , TestVersions . COCOAPODS . VERSION ) } else if ( ! isCocoapodsInstalled ( ) ) { fail ( \"\"\"\"\"\" . trimIndent ( ) ) } }","docstring":"/**\n * This method checks if Cocoapods should be installed and verifies its installation status.\n * If [shouldInstallLocalCocoapods] is true, it tries to install Cocoapods into the specified [cocoapodsInstallationRoot]\n * if it is not already installed.\n *\n * @throws AssertionError if [shouldInstallLocalCocoapods] is false and cocoapods has not been installed\n */"} {"signature":"public fun loadModelConfiguration ( jsonFile : File ) : T","body":"public fun loadModelConfiguration ( jsonFile : File ) : T","docstring":"/**\n * Loads model configuration from the provided [jsonFile].\n */"} {"signature":"fun canSynthesizeEnumEntries ( ) : Boolean ?","body":"fun canSynthesizeEnumEntries ( ) : Boolean ?","docstring":"/**\n * Determines whether `Enum.entries` property can be synthesized for enums in this module,\n * when this property is not present in compiled code.\n * Returns `null` if it's not known.\n */"} {"signature":"override fun compareTo ( other : SinceKotlinVersion ) : Int","body":"{ val i1 = parts . listIterator ( ) val i2 = other . parts . listIterator ( ) while ( i1 . hasNext ( ) || i2 . hasNext ( ) ) { val diff = ( if ( i1 . hasNext ( ) ) i1 . next ( ) else ) - ( if ( i2 . hasNext ( ) ) i2 . next ( ) else ) if ( diff != ) return diff } return }","docstring":"/**\n * Corner case: 1.0 == 1.0.0\n */"} {"signature":"fun createCustomTagFromSinceKotlinVersion ( version : SinceKotlinVersion ? , platform : Platform ) : CustomTagWrapper","body":"{ val sinceKotlinVersion = version ? : minVersionOfPlatform ( platform ) return CustomTagWrapper ( CustomDocTag ( children = listOf ( Text ( sinceKotlinVersion . toString ( ) ) ) , name = MARKDOWN_ELEMENT_FILE_NAME ) , SINCE_KOTLIN_TAG_NAME ) }","docstring":"/**\n * Should be in sync with [extractSinceKotlinVersionFromCustomTag]\n */"} {"signature":"fun extractSinceKotlinVersionFromCustomTag ( tagWrapper : CustomTagWrapper , platform : Platform ) : SinceKotlinVersion","body":"{ val customTag = tagWrapper . root as? CustomDocTag val sinceKotlinVersionText = customTag ? . children ? . firstOrNull ( ) as? Text val sinceKotlinVersion = sinceKotlinVersionText ? . body ? . let ( :: SinceKotlinVersion ) return sinceKotlinVersion ? : minVersionOfPlatform ( platform ) }","docstring":"/**\n * Should be in sync with [createCustomTagFromSinceKotlinVersion]\n */"} {"signature":"fun isKotlinJvmCompiledFile ( file : VirtualFile , fileContent : ByteArray ? = null ) : Boolean","body":"{ if ( file . extension != JavaClassFileType . INSTANCE ! ! . defaultExtension ) { return false } val binaryFromCache = getKotlinBinaryFromCache ( file ) binaryFromCache ? . let { return it . isKotlinBinary } return kotlinJvmBinaryClass ( file , fileContent , JvmMetadataVersion . INSTANCE , binaryFromCache ? . isKotlinBinary ) != null }","docstring":"/**\n * Checks if this file is a compiled Kotlin class file (not necessarily ABI-compatible with the current plugin)\n */"} {"signature":"@ Test fun testThreadLocalBeingThreadLocal ( )","body":"= runTest { val threadLocal = commonThreadLocal < Int > ( Symbol ( \"\" ) ) newSingleThreadContext ( \"\" ) . use { threadLocal . set ( ) assertEquals ( , threadLocal . get ( ) ) val job1 = launch ( it ) { threadLocal . set ( ) assertEquals ( , threadLocal . get ( ) ) } assertEquals ( , threadLocal . get ( ) ) job1 . join ( ) val job2 = launch ( it ) { assertEquals ( , threadLocal . get ( ) ) } job2 . join ( ) } }","docstring":"/**\n * Tests the basic functionality of [commonThreadLocal]: storing a separate value for each thread.\n */"} {"signature":"@ Test fun testThreadLocalWithNullableType ( )","body":"= runTest { val threadLocal = commonThreadLocal < Int ? > ( Symbol ( \"\" ) ) newSingleThreadContext ( \"\" ) . use { assertNull ( threadLocal . get ( ) ) threadLocal . set ( ) assertEquals ( , threadLocal . get ( ) ) val job1 = launch ( it ) { assertNull ( threadLocal . get ( ) ) threadLocal . set ( ) assertEquals ( , threadLocal . get ( ) ) } assertEquals ( , threadLocal . get ( ) ) job1 . join ( ) threadLocal . set ( null ) assertNull ( threadLocal . get ( ) ) val job2 = launch ( it ) { assertEquals ( , threadLocal . get ( ) ) threadLocal . set ( null ) assertNull ( threadLocal . get ( ) ) } job2 . join ( ) } }","docstring":"/**\n * Tests using [commonThreadLocal] with a nullable type.\n */"} {"signature":"@ Test fun testThreadLocalsWithDifferentNamesNotInterfering ( )","body":"{ val value1 = commonThreadLocal < Int > ( Symbol ( \"\" ) ) val value2 = commonThreadLocal < Int > ( Symbol ( \"\" ) ) value1 . set ( ) value2 . set ( ) assertEquals ( , value1 . get ( ) ) assertEquals ( , value2 . get ( ) ) }","docstring":"/**\n * Tests that several instances of [commonThreadLocal] with different names don't affect each other.\n */"} {"signature":"public fun resolveSample ( sourceSet : DokkaConfiguration . DokkaSourceSet , fullyQualifiedLink : String ) : SampleSnippet ?","body":"public fun resolveSample ( sourceSet : DokkaConfiguration . DokkaSourceSet , fullyQualifiedLink : String ) : SampleSnippet ?","docstring":"/**\n * Resolves a Kotlin sample function by its fully qualified name, and returns its import statements and body.\n *\n * @param sourceSet must be either the source set in which this sample function resides, or the source set\n * for which [DokkaConfiguration#samples] or [DokkaConfiguration#sourceRoots]\n * have been configured with the sample's sources.\n * @param fullyQualifiedLink fully qualified path to the sample function, including all middle packages\n * and the name of the function. Only links to Kotlin functions are valid,\n * which can reside within a class. The package must be the same as the package\n * declared in the sample file. The function must be resolvable by Dokka,\n * meaning it must reside either in the main sources of the project or its\n * sources must be included in [DokkaConfiguration#samples] or\n * [DokkaConfiguration#sourceRoots]. Example: `com.example.pckg.topLevelKotlinFunction`\n *\n * @return a sample code snippet which includes import statements and the function body,\n * or null if the link could not be resolved (examine the logs to find out the reason).\n */"} {"signature":"public fun < T , C > DataFrame < T > . update ( columns : ColumnsSelector < T , C > ) : Update < T , C >","body":"= Update ( this , null , columns )","docstring":"/**\n * @include [CommonUpdateFunctionDoc]\n * @include [SelectingColumns.Dsl.WithExample] {@include [SetSelectingColumnsOperationArg]}\n * @include [Update.DslParam]\n */"} {"signature":"public fun < T > DataFrame < T > . update ( vararg columns : String ) : Update < T , Any ? >","body":"= update { columns . toColumnSet ( ) }","docstring":"/**\n * @include [CommonUpdateFunctionDoc]\n * @include [SelectingColumns.ColumnNames.WithExample] {@include [SetSelectingColumnsOperationArg]}\n * @include [UpdateWithNote]\n * @include [Update.ColumnNamesParam]\n */"} {"signature":"public fun < T , C > DataFrame < T > . update ( vararg columns : KProperty < C > ) : Update < T , C >","body":"= update { columns . toColumnSet ( ) }","docstring":"/**\n * @include [CommonUpdateFunctionDoc]\n * @include [SelectingColumns.KProperties.WithExample] {@include [SetSelectingColumnsOperationArg]}\n * @include [UpdateWithNote]\n * @include [Update.KPropertiesParam]\n */"} {"signature":"public fun < T , C > DataFrame < T > . update ( vararg columns : ColumnReference < C > ) : Update < T , C >","body":"= update { columns . toColumnSet ( ) }","docstring":"/**\n * @include [CommonUpdateFunctionDoc]\n * @include [SelectingColumns.ColumnAccessors.WithExample] {@include [SetSelectingColumnsOperationArg]}\n * @include [UpdateWithNote]\n * @include [Update.ColumnAccessorsParam]\n */"} {"signature":"public fun < T , C > Update < T , C > . where ( predicate : RowValueFilter < T , C > ) : Update < T , C >","body":"= copy ( filter = filter and predicate )","docstring":"/** ## Where\n * @include [SelectingRows.RowValueCondition.WithExample]\n * {@set [SelectingRows.FirstOperationArg] [update][update]}\n * {@set [SelectingRows.SecondOperationArg] [where][where]}\n *\n * @param [predicate] The [row value filter][RowValueFilter] to select the rows to update.\n */"} {"signature":"public fun < T , C > Update < T , C > . at ( rowIndices : Collection < Int > ) : Update < T , C >","body":"= where { index in rowIndices }","docstring":"/**\n * @include [CommonUpdateAtFunctionDoc]\n *\n * Provide a [Collection]<[Int]> of row indices to update.\n *\n * @param [rowIndices] {@include [CommonUpdateAtFunctionDoc.RowIndicesParam]}\n */"} {"signature":"public fun < T , C > Update < T , C > . at ( vararg rowIndices : Int ) : Update < T , C >","body":"= at ( rowIndices . toSet ( ) )","docstring":"/**\n * @include [CommonUpdateAtFunctionDoc]\n *\n * Provide a `vararg` of [Ints][Int] of row indices to update.\n *\n * @param [rowIndices] {@include [CommonUpdateAtFunctionDoc.RowIndicesParam]}\n */"} {"signature":"public fun < T , C > Update < T , C > . at ( rowRange : IntRange ) : Update < T , C >","body":"= where { index in rowRange }","docstring":"/**\n * @include [CommonUpdateAtFunctionDoc]\n *\n * Provide an [IntRange] of row indices to update.\n *\n * @param [rowRange] {@include [CommonUpdateAtFunctionDoc.RowIndicesParam]}\n */"} {"signature":"public fun < T , C > Update < T , C > . perRowCol ( expression : RowColumnExpression < T , C , C > ) : DataFrame < T >","body":"= updateImpl { row , column , _ -> expression ( row , column ) }","docstring":"/** ## Per Row Col\n * @include [ExpressionsGivenRowAndColumn.RowColumnExpression.WithExample]\n * {@set [ExpressionsGivenRowAndColumn.OperationArg] [update][update]` { age \\}.`[perRowCol][perRowCol]}\n *\n * ## See Also\n * - {@include [SeeAlsoWith]}\n * - {@include [SeeAlsoPerCol]}\n * @param [expression] The {@include [ExpressionsGivenRowAndColumn.RowColumnExpressionLink]} to provide a new value for every selected cell giving its row and column.\n */"} {"signature":"public fun < T , C > Update < T , C > . with ( expression : UpdateExpression < T , C , C ? > ) : DataFrame < T >","body":"= updateImpl { row , _ , value -> expression ( row , value ) }","docstring":"/** ## With\n * {@include [ExpressionsGivenRow.RowValueExpression.WithExample]}\n * {@set [ExpressionsGivenRow.OperationArg] [update][update]` { city \\}.`[with][with]}\n *\n * ## Note\n * @include [ExpressionsGivenRow.AddDataRowNote]\n * ## See Also\n * - {@include [SeeAlsoPerCol]}\n * - {@include [SeeAlsoPerRowCol]}\n * @param [expression] The {@include [ExpressionsGivenRow.RowValueExpressionLink]} to update the rows with.\n */"} {"signature":"public fun < T , C , R > Update < T , DataRow < C > > . asFrame ( expression : DataFrameExpression < C , DataFrame < R > > ) : DataFrame < T >","body":"= asFrameImpl ( expression )","docstring":"/** ## As Frame\n *\n * Updates selected [column group][ColumnGroup] as a [DataFrame] with the given [expression].\n *\n * {@include [ExpressionsGivenDataFrame.DataFrameExpression.WithExample]}\n * {@set [ExpressionsGivenDataFrame.OperationArg] `df.`[update][update]` { name \\}.`[asFrame][asFrame]}\n * @param [expression] The {@include [ExpressionsGivenDataFrame.DataFrameExpressionLink]} to replace the selected column group with.\n */"} {"signature":"public fun < T , C > Update < T , C > . perCol ( values : Map < String , C > ) : DataFrame < T >","body":"= updateWithValuePerColumnImpl { values [ it . name ( ) ] ? : throw IllegalArgumentException ( \"\" ) }","docstring":"/**\n * @include [CommonUpdatePerColMapDoc]\n * {@set [CommonUpdatePerColMapDoc] `[mapOf][mapOf]`(\"name\" to \"Empty\", \"age\" to 0)}\n *\n * @param [values] The [Map]<[String], Value> to provide a new value for every selected cell.\n * For each selected column, there must be a value in the map with the same name.\n */"} {"signature":"public fun < T , C > Update < T , C > . perCol ( values : AnyRow ) : DataFrame < T >","body":"= perCol ( values . toMap ( ) as Map < String , C > )","docstring":"/**\n * {@include [CommonUpdatePerColMapDoc]}\n * {@set [CommonUpdatePerColMapDoc] df.`[getRows][DataFrame.getRows]`(`[listOf][listOf]`(0))`\n *\n * {@include [Indent]}`.`[update][update]` { name \\}.`[with][Update.with]` { \"Empty\" \\}`\n *\n * {@include [Indent]}`.`[update][update]` { age \\}.`[with][Update.with]` { 0 \\}`\n *\n * {@include [Indent]}`.first()}\n *\n * @param [values] The [DataRow] to provide a new value for every selected cell.\n */"} {"signature":"public fun < T , C > Update < T , C > . perCol ( valueSelector : ColumnExpression < C , C > ) : DataFrame < T >","body":"= updateWithValuePerColumnImpl ( valueSelector )","docstring":"/**\n * @include [CommonUpdatePerColDoc]\n * @include [ExpressionsGivenColumn.ColumnExpression.WithExample]\n * {@set [ExpressionsGivenColumn.OperationArg] [update][update]` { age \\}.`[perCol][perCol]}\n *\n * @param [valueSelector] The {@include [ExpressionsGivenColumn.ColumnExpressionLink]} to provide a new value for every selected cell giving its column.\n */"} {"signature":"internal infix fun < T , C > RowValueFilter < T , C > ? . and ( other : RowValueFilter < T , C > ) : RowValueFilter < T , C >","body":"{ if ( this == null ) return other val thisExp = this return { thisExp ( this , it ) && other ( this , it ) } }","docstring":"/** Chains up two row value filters together. */"} {"signature":"public fun < T , C > Update < T , C ? > . notNull ( ) : Update < T , C >","body":"= where { it != null } as Update < T , C >","docstring":"/** @include [Update.notNull] */"} {"signature":"public fun < T , C > Update < T , C ? > . notNull ( expression : UpdateExpression < T , C , C > ) : DataFrame < T >","body":"= notNull ( ) . with ( expression )","docstring":"/**\n * ## Not Null\n *\n * Selects only the rows where the values in the selected columns are not null.\n *\n * Shorthand for: [update][update]` { ... }.`[where][Update.where]` { it != null }`\n *\n * For example:\n *\n * `df.`[update][update]` { `[colsOf][colsOf]`<`[Number][Number]`?>() }.`[notNull][notNull]`().`[perCol][Update.perCol]` { `[mean][mean]`() }`\n *\n * ### Optional\n * Provide an [expression] to update the rows with.\n * This combines [with][Update.with] with [notNull].\n *\n * For example:\n *\n * `df.`[update][update]` { city }.`[notNull][Update.notNull]` { it.`[toUpperCase][String.toUpperCase]`() }`\n * {@comment No brackets around `expression` because this doc is copied to [Update.notNull]}\n * @param expression Optional {@include [ExpressionsGivenRow.RowExpressionLink]} to update the rows with.\n */"} {"signature":"public fun < T , C > DataFrame < T > . update ( firstCol : ColumnReference < C > , vararg cols : ColumnReference < C > , expression : UpdateExpression < T , C , C > , ) : DataFrame < T >","body":"= update ( * headPlusArray ( firstCol , cols ) ) . with ( expression )","docstring":"/**\n * @include [CommonUpdateFunctionDoc]\n * This overload is a combination of [update] and [with][Update.with].\n *\n * @include [SelectingColumns.ColumnAccessors]\n *\n * {@include [ExpressionsGivenRow.RowValueExpression.WithExample]}\n * {@set [ExpressionsGivenRow.OperationArg] [update][update]`(\"city\")`}\n *\n * @include [Update.ColumnAccessorsParam]\n * @param [expression] The {@include [ExpressionsGivenRow.RowValueExpressionLink]} to update the rows with.\n */"} {"signature":"public fun < T , C > DataFrame < T > . update ( firstCol : KProperty < C > , vararg cols : KProperty < C > , expression : UpdateExpression < T , C , C > , ) : DataFrame < T >","body":"= update ( * headPlusArray ( firstCol , cols ) ) . with ( expression )","docstring":"/**\n * @include [CommonUpdateFunctionDoc]\n * This overload is a combination of [update] and [with][Update.with].\n *\n * @include [SelectingColumns.KProperties]\n *\n * {@include [ExpressionsGivenRow.RowValueExpression.WithExample]}\n * {@set [ExpressionsGivenRow.OperationArg] [update][update]`(\"city\")`}\n *\n * @include [Update.KPropertiesParam]\n * @param [expression] The {@include [ExpressionsGivenRow.RowValueExpressionLink]} to update the rows with.\n */"} {"signature":"public fun < T > DataFrame < T > . update ( firstCol : String , vararg cols : String , expression : UpdateExpression < T , Any ? , Any ? > , ) : DataFrame < T >","body":"= update ( * headPlusArray ( firstCol , cols ) ) . with ( expression )","docstring":"/**\n * @include [CommonUpdateFunctionDoc]\n * This overload is a combination of [update] and [with][Update.with].\n *\n * @include [SelectingColumns.ColumnNames]\n *\n * {@include [ExpressionsGivenRow.RowValueExpression.WithExample]}\n * {@set [ExpressionsGivenRow.OperationArg] [update][update]`(\"city\")`}\n *\n * @include [Update.ColumnNamesParam]\n * @param [expression] The {@include [ExpressionsGivenRow.RowValueExpressionLink]} to update the rows with.\n */"} {"signature":"public fun < T , C > Update < T , C > . withNull ( ) : DataFrame < T >","body":"= with { null }","docstring":"/**\n * ## With Null\n * @include [CommonSpecificWithDoc]\n * {@set [CommonSpecificWithDoc.FirstArg] `null`}\n * {@set [CommonSpecificWithDoc.SecondArg] [withNull][withNull]`()}\n */"} {"signature":"public fun < T , C > Update < T , C > . withZero ( ) : DataFrame < T >","body":"= updateWithValuePerColumnImpl { as C }","docstring":"/**\n * ## With Zero\n * @include [CommonSpecificWithDoc]\n * {@set [CommonSpecificWithDoc.FirstArg] `0`}\n * {@set [CommonSpecificWithDoc.SecondArg] [withZero][withZero]`()}\n */"} {"signature":"@ Test fun testMaybeAwaitCancellation ( )","body":"= runTest { expect ( ) val maybe = MaybeSource < Int > { s -> s . onSubscribe ( object : Disposable { override fun dispose ( ) { expect ( ) } override fun isDisposed ( ) : Boolean { expectUnreached ( ) ; return false } } ) } val job = launch ( start = CoroutineStart . UNDISPATCHED ) { try { expect ( ) maybe . awaitSingleOrNull ( ) } catch ( e : CancellationException ) { expect ( ) throw e } } expect ( ) job . cancelAndJoin ( ) finish ( ) }","docstring":"/** Tests that calls to [awaitSingleOrNull] throw [CancellationException] and dispose of the subscription when their\n * [Job] is cancelled. */"} {"signature":"@ Test fun testMaybeCollectEmpty ( )","body":"= runTest { expect ( ) Maybe . empty < Int > ( ) . collect { expectUnreached ( ) } finish ( ) }","docstring":"/** Tests the simple scenario where the Maybe doesn't output a value. */"} {"signature":"@ Test fun testMaybeCollectSingle ( )","body":"= runTest { expect ( ) Maybe . just ( \"\" ) . collect { assertEquals ( \"\" , it ) expect ( ) } finish ( ) }","docstring":"/** Tests the simple scenario where the Maybe doesn't output a value. */"} {"signature":"@ Test fun testMaybeCollectThrowingMaybe ( )","body":"= runTest { expect ( ) try { Maybe . error < Int > ( TestException ( ) ) . collect { expectUnreached ( ) } } catch ( e : TestException ) { expect ( ) } finish ( ) }","docstring":"/** Tests the behavior of [collect] when the Maybe raises an error. */"} {"signature":"@ Test fun testMaybeCollectThrowingAction ( )","body":"= runTest { expect ( ) try { Maybe . just ( \"\" ) . collect { expect ( ) throw TestException ( ) } } catch ( e : TestException ) { expect ( ) } finish ( ) }","docstring":"/** Tests the behavior of [collect] when the action throws. */"} {"signature":"public actual fun ComplexDouble ( re : Double , im : Double ) : ComplexDouble","body":"{ val reBits = re . toBits ( ) val reHigherBits = ( reBits shr ) . toInt ( ) val reLowerBits = ( reBits and ) . toInt ( ) val imBits = im . toBits ( ) val imHigherBits = ( imBits shr ) . toInt ( ) val imLowerBits = ( imBits and ) . toInt ( ) return NativeComplexDouble ( vectorOf ( reLowerBits , reHigherBits , imLowerBits , imHigherBits ) ) }","docstring":"/**\n * Creates a [ComplexDouble] with the given real and imaginary values in floating-point format.\n *\n * @param re the real value of the complex number in double format.\n * @param im the imaginary value of the complex number in double format.\n */"} {"signature":"public actual fun ComplexDouble ( re : Number , im : Number ) : ComplexDouble","body":"= ComplexDouble ( re . toDouble ( ) , im . toDouble ( ) )","docstring":"/**\n * Creates a [ComplexDouble] with the given real and imaginary values in number format.\n *\n * @param re the real value of the complex number in number format.\n * @param im the imaginary value of the complex number in number format.\n */"} {"signature":"fun x ( aa : Int )","body":"{ }","docstring":"/**\n * [aa]\n */"} {"signature":"@ ExperimentalUnsignedTypes internal fun sortArray ( array : UByteArray , fromIndex : Int , toIndex : Int )","body":"= quickSort ( array , fromIndex , toIndex - )","docstring":"/**\n * Sorts the given array using qsort algorithm.\n */"} {"signature":"fun printOutGraphOps ( )","body":"{ val model = SavedModel . load ( PATH_TO_MODEL ) println ( model . graphToString ( ) ) }","docstring":"/**\n * Prints the TensorFlow graph as a sequence of TensorFlow operands.\n */"} {"signature":"fun main ( ) : Unit","body":"= printOutGraphOps ( )","docstring":"/** */"} {"signature":"public fun < DomainType : Comparable < DomainType > > continuousColorGradientN ( gradientColors : List < Color > , domain : ClosedRange < DomainType > , nullValue : Color ? = null , transform : Transformation ? = null ) : ScaleContinuousColorGradientN < DomainType >","body":"= ScaleContinuousColorGradientN ( domain . let { it . start to it . endInclusive } , gradientColors , nullValue , transform )","docstring":"/**\n * Creates smooth color gradient between multiple colors.\n *\n * @param DomainType type of domain\n * @param gradientColors gradient color [List].\n * @param domain [ClosedRange] defining the scale domain.\n * @param nullValue value which null is mapped to.\n * @param transform scale transformation.\n *\n * @return new continuous color scale.\n */"} {"signature":"public fun < DomainType > continuousColorGradientN ( gradientColors : List < Color > , domainMin : DomainType ? = null , domainMax : DomainType ? = null , nullValue : Color ? = null , transform : Transformation ? = null ) : ScaleContinuousColorGradientN < DomainType >","body":"= ScaleContinuousColorGradientN ( domainMin to domainMax , gradientColors , nullValue , transform )","docstring":"/**\n * Creates smooth color gradient between multiple colors.\n *\n * @param DomainType type of domain\n * @param gradientColors gradient color [List].\n * @param domainMin scale domain minimum.\n * @param domainMax scale domain maximum.\n * @param nullValue value which null is mapped to.\n * @param transform scale transformation.\n *\n * @return new continuous color scale.\n */"} {"signature":"public fun < DomainType : Comparable < DomainType > > continuousColorGradient2 ( low : Color , mid : Color , high : Color , midpoint : Double , domain : ClosedRange < DomainType > , nullValue : Color ? = null , transform : Transformation ? = null ) : ScaleContinuousColorGradient2 < DomainType >","body":"= ScaleContinuousColorGradient2 ( domain . let { it . start to it . endInclusive } , low , mid , high , midpoint , nullValue , transform )","docstring":"/**\n * Creates diverging color gradient (low-mid-high) for color aesthetic.\n *\n * @param DomainType type of domain\n * @param low color, scale range minimum.\n * @param mid color, corresponding to the midpoint.\n * @param high color, scale range maximum.\n * @param midpoint point on scale domain which is mapped to [mid] color.\n * @param domain segment defining the domain\n * @param transform the transformation of scale\n * @return new continuous color scale.\n */"} {"signature":"public fun < DomainType > continuousColorGradient2 ( low : Color , mid : Color , high : Color , midpoint : Double , domainMin : DomainType ? = null , domainMax : DomainType ? = null , nullValue : Color ? = null , transform : Transformation ? = null ) : ScaleContinuousColorGradient2 < DomainType >","body":"= ScaleContinuousColorGradient2 ( domainMin to domainMax , low , mid , high , midpoint , nullValue , transform )","docstring":"/**\n * Creates diverging color gradient (low-mid-high) for color aesthetic.\n *\n * @param DomainType type of domain\n * @param low color, scale range minimum.\n * @param mid color, corresponding to the midpoint.\n * @param high color, scale range maximum.\n * @param midpoint point on scale domain which is mapped to [mid] color.\n * @param domainMin scale domain minimum.\n * @param domainMax scale domain maximum.\n * @param transform the transformation of scale\n * @return new continuous color scale.\n */"} {"signature":"public fun toByteString ( ) : ByteString","body":"{ if ( size == ) { return ByteString ( ) } if ( buffer . size == size ) { return ByteString . wrap ( buffer ) } return ByteString ( buffer , , size ) }","docstring":"/**\n * Returns a new [ByteString] wrapping all bytes written to this builder.\n *\n * There will be no additional allocations or copying of data when `size == capacity`.\n */"} {"signature":"public fun append ( byte : Byte )","body":"{ ensureCapacity ( size + ) buffer [ offset ++ ] = byte }","docstring":"/**\n * Append a single byte to this builder.\n *\n * @param byte the byte to append.\n */"} {"signature":"public fun append ( array : ByteArray , startIndex : Int = , endIndex : Int = array . size )","body":"{ require ( startIndex <= endIndex ) { \"\" } if ( startIndex < || endIndex > array . size ) { throw IndexOutOfBoundsException ( \"\" + \"\" ) } ensureCapacity ( offset + endIndex - startIndex ) array . copyInto ( buffer , offset , startIndex , endIndex ) offset += endIndex - startIndex }","docstring":"/**\n * Appends a subarray of [array] starting at [startIndex] and ending at [endIndex] to this builder.\n *\n * @param array the array whose subarray should be appended.\n * @param startIndex the first index (inclusive) to copy data from the [array].\n * @param endIndex the last index (exclusive) to copy data from the [array]\n *\n * @throws IndexOutOfBoundsException when [startIndex] or [endIndex] is out of range of [array] array indices.\n * @throws IllegalArgumentException when `startIndex > endIndex`.\n */"} {"signature":"public fun ByteStringBuilder . append ( byte : UByte ) : Unit","body":"= append ( byte . toByte ( ) )","docstring":"/**\n * Appends unsigned byte to this builder.\n */"} {"signature":"public fun ByteStringBuilder . append ( byteString : ByteString )","body":"{ append ( byteString . getBackingArrayReference ( ) ) }","docstring":"/**\n * Appends a byte string to this builder.\n */"} {"signature":"public fun ByteStringBuilder . append ( vararg bytes : Byte ) : Unit","body":"= append ( bytes )","docstring":"/**\n * Appends bytes to this builder.\n */"} {"signature":"public inline fun buildByteString ( capacity : Int = , builderAction : ByteStringBuilder . ( ) -> Unit ) : ByteString","body":"{ return ByteStringBuilder ( capacity ) . apply ( builderAction ) . toByteString ( ) }","docstring":"/**\n * Builds new byte string by populating newly created [ByteStringBuilder] initialized with the given [capacity]\n * using provided [builderAction] and then converting it to [ByteString].\n */"} {"signature":"fun KtTestModule . publishModificationEventByDirective ( isOptional : Boolean = false )","body":"{ val modificationEventKinds = testModule . directives [ ModificationEventDirectives . MODIFICATION_EVENT ] val modificationEventKind = when ( modificationEventKinds . size ) { -> { if ( isOptional ) return error ( \"\" ) } -> modificationEventKinds . single ( ) else -> error ( \"\" ) } publishModificationEvent ( modificationEventKind , ktModule ) }","docstring":"/**\n * Publishes a modification event as defined in [KotlinTopics][org.jetbrains.kotlin.analysis.providers.topics.KotlinTopics] based on the\n * [ModificationEventDirectives.MODIFICATION_EVENT] directive present in the test module in a write action.\n *\n * Module-level modification events will be published for the [KtTestModule]'s [KtModule].\n *\n * The function expects exactly one `MODIFICATION_EVENT` directive to be present, unless [isOptional] is `true`.\n */"} {"signature":"fun KtTestModule . publishWildcardModificationEventByDirectiveIfPresent ( modificationEventKind : ModificationEventKind )","body":"{ if ( ModificationEventDirectives . WILDCARD_MODIFICATION_EVENT !in testModule . directives ) { return } publishModificationEvent ( modificationEventKind , ktModule ) }","docstring":"/**\n * If the given test module contains a [ModificationEventDirectives.WILDCARD_MODIFICATION_EVENT] directive, publishes a modification event\n * as defined in [KotlinTopics][org.jetbrains.kotlin.analysis.providers.topics.KotlinTopics] based on the given [modificationEventKind] in\n * a write action.\n *\n * Module-level modification events will be published for the [KtTestModule]'s [KtModule].\n */"} {"signature":"fun KtTestModuleStructure . publishWildcardModificationEventsByDirective ( modificationEventKind : ModificationEventKind )","body":"{ if ( modificationEventKind . isModuleLevel ) { mainModules . forEach { ktTestModule -> ktTestModule . publishWildcardModificationEventByDirectiveIfPresent ( modificationEventKind ) } } else { if ( ! testModuleStructure . allDirectives . contains ( ModificationEventDirectives . WILDCARD_MODIFICATION_EVENT ) ) { return } publishGlobalModificationEvent ( modificationEventKind , project ) } }","docstring":"/**\n * For each test module that contains a [ModificationEventDirectives.WILDCARD_MODIFICATION_EVENT] directive, publishes a modification event\n * as defined in [KotlinTopics][org.jetbrains.kotlin.analysis.providers.topics.KotlinTopics] based on the given [modificationEventKind] in\n * a write action.\n *\n * Global-level modification events will only be published *once*, regardless of how many `WILDCARD_MODIFICATION_EVENT` directives the test\n * modules contain, as long as at least one test module contains it (to support test cases which don't want to publish any modification\n * events).\n */"} {"signature":"public fun NotebookHttpClient . request ( builder : HttpRequestBuilder = HttpRequestBuilder ( ) ) : NotebookHttpResponse","body":"= NotebookHttpResponse ( runBlocking { ktorClient . request ( builder ) } )","docstring":"/**\n * Executes an [HttpClient]'s request with the parameters specified using [builder].\n *\n * Learn more from [Making requests](https://ktor.io/docs/request.html).\n */"} {"signature":"public inline fun NotebookHttpClient . request ( crossinline block : HttpRequestBuilder . ( ) -> Unit ) : NotebookHttpResponse","body":"= NotebookHttpResponse ( runBlocking { ktorClient . request ( block ) } )","docstring":"/**\n * Executes an [HttpClient]'s request with the parameters specified in [block].\n *\n * Learn more from [Making requests](https://ktor.io/docs/request.html).\n */"} {"signature":"public suspend inline fun NotebookHttpClient . request ( urlString : String , crossinline block : HttpRequestBuilder . ( ) -> Unit = { } ) : NotebookHttpResponse","body":"= NotebookHttpResponse ( runBlocking { ktorClient . request ( urlString , block ) } )","docstring":"/**\n * Executes an [HttpClient]'s request with the [urlString] and the parameters configured in [block].\n *\n * Learn more from [Making requests](https://ktor.io/docs/request.html).\n */"} {"signature":"public suspend inline fun NotebookHttpClient . request ( url : Url , crossinline block : HttpRequestBuilder . ( ) -> Unit = { } ) : NotebookHttpResponse","body":"= NotebookHttpResponse ( runBlocking { ktorClient . request ( url , block ) } )","docstring":"/**\n * Executes an [HttpClient]'s request with the [url] and the parameters configured in [block].\n *\n * Learn more from [Making requests](https://ktor.io/docs/request.html).\n */"} {"signature":"public fun NotebookHttpClient . get ( builder : HttpRequestBuilder ) : NotebookHttpResponse","body":"= NotebookHttpResponse ( runBlocking { ktorClient . get ( builder ) } )","docstring":"/**\n * Executes an [HttpClient]'s GET request with the parameters configured in [builder].\n *\n * Learn more from [Making requests](https://ktor.io/docs/request.html).\n */"} {"signature":"public fun NotebookHttpClient . post ( builder : HttpRequestBuilder ) : NotebookHttpResponse","body":"= NotebookHttpResponse ( runBlocking { ktorClient . post ( builder ) } )","docstring":"/**\n * Executes an [HttpClient]'s POST request with the parameters configured in [builder].\n *\n * Learn more from [Making requests](https://ktor.io/docs/request.html).\n */"} {"signature":"public fun NotebookHttpClient . put ( builder : HttpRequestBuilder ) : HttpResponse","body":"= runBlocking { ktorClient . put ( builder ) }","docstring":"/**\n * Executes a [HttpClient] PUT request with the parameters configured in [builder].\n *\n * Learn more from [Making requests](https://ktor.io/docs/request.html).\n */"} {"signature":"public fun NotebookHttpClient . delete ( builder : HttpRequestBuilder ) : NotebookHttpResponse","body":"= NotebookHttpResponse ( runBlocking { ktorClient . delete ( builder ) } )","docstring":"/**\n * Executes a [HttpClient] DELETE request with the parameters configured in [builder].\n *\n * Learn more from [Making requests](https://ktor.io/docs/request.html).\n */"} {"signature":"public fun NotebookHttpClient . options ( builder : HttpRequestBuilder ) : NotebookHttpResponse","body":"= NotebookHttpResponse ( runBlocking { ktorClient . options ( builder ) } )","docstring":"/**\n * Executes a [HttpClient] OPTIONS request with the parameters configured in [builder].\n *\n * Learn more from [Making requests](https://ktor.io/docs/request.html).\n */"} {"signature":"public fun NotebookHttpClient . patch ( builder : HttpRequestBuilder ) : NotebookHttpResponse","body":"= NotebookHttpResponse ( runBlocking { ktorClient . patch ( builder ) } )","docstring":"/**\n * Executes a [HttpClient] PATCH request with the parameters configured in [builder].\n *\n * Learn more from [Making requests](https://ktor.io/docs/request.html).\n */"} {"signature":"public fun NotebookHttpClient . head ( builder : HttpRequestBuilder ) : HttpResponse","body":"= runBlocking { ktorClient . head ( builder ) }","docstring":"/**\n * Executes a [HttpClient] HEAD request with the parameters configured in [builder].\n *\n * Learn more from [Making requests](https://ktor.io/docs/request.html).\n */"} {"signature":"public inline fun NotebookHttpClient . get ( crossinline block : HttpRequestBuilder . ( ) -> Unit ) : NotebookHttpResponse","body":"= NotebookHttpResponse ( runBlocking { ktorClient . get ( block ) } )","docstring":"/**\n * Executes an [HttpClient]'s GET request with the parameters configured in [block].\n *\n * Learn more from [Making requests](https://ktor.io/docs/request.html).\n */"} {"signature":"public inline fun NotebookHttpClient . post ( crossinline block : HttpRequestBuilder . ( ) -> Unit ) : NotebookHttpResponse","body":"= NotebookHttpResponse ( runBlocking { ktorClient . post ( block ) } )","docstring":"/**\n * Executes an [HttpClient]'s POST request with the parameters configured in [block].\n *\n * Learn more from [Making requests](https://ktor.io/docs/request.html).\n */"} {"signature":"public inline fun NotebookHttpClient . put ( crossinline block : HttpRequestBuilder . ( ) -> Unit ) : NotebookHttpResponse","body":"= NotebookHttpResponse ( runBlocking { ktorClient . put ( block ) } )","docstring":"/**\n * Executes an [HttpClient]'s PUT request with the parameters configured in [block].\n *\n * Learn more from [Making requests](https://ktor.io/docs/request.html).\n */"} {"signature":"public inline fun NotebookHttpClient . delete ( crossinline block : HttpRequestBuilder . ( ) -> Unit ) : NotebookHttpResponse","body":"= NotebookHttpResponse ( runBlocking { ktorClient . delete ( block ) } )","docstring":"/**\n * Executes an [HttpClient]'s DELETE request with the parameters configured in [block].\n *\n * Learn more from [Making requests](https://ktor.io/docs/request.html).\n */"} {"signature":"public inline fun NotebookHttpClient . options ( crossinline block : HttpRequestBuilder . ( ) -> Unit ) : NotebookHttpResponse","body":"= NotebookHttpResponse ( runBlocking { ktorClient . options ( block ) } )","docstring":"/**\n * Executes an [HttpClient]'s OPTIONS request with the parameters configured in [block].\n *\n * Learn more from [Making requests](https://ktor.io/docs/request.html).\n */"} {"signature":"public inline fun NotebookHttpClient . patch ( crossinline block : HttpRequestBuilder . ( ) -> Unit ) : NotebookHttpResponse","body":"= NotebookHttpResponse ( runBlocking { ktorClient . patch ( block ) } )","docstring":"/**\n * Executes an [HttpClient]'s PATCH request with the parameters configured in [block].\n *\n * Learn more from [Making requests](https://ktor.io/docs/request.html).\n */"} {"signature":"public inline fun NotebookHttpClient . head ( crossinline block : HttpRequestBuilder . ( ) -> Unit ) : NotebookHttpResponse","body":"= NotebookHttpResponse ( runBlocking { ktorClient . head ( block ) } )","docstring":"/**\n * Executes an [HttpClient]'s HEAD request with the parameters configured in [block].\n *\n * Learn more from [Making requests](https://ktor.io/docs/request.html).\n */"} {"signature":"public inline fun NotebookHttpClient . get ( urlString : String , crossinline block : HttpRequestBuilder . ( ) -> Unit = { } ) : NotebookHttpResponse","body":"= NotebookHttpResponse ( runBlocking { ktorClient . get ( urlString , block ) } )","docstring":"/**\n * Executes an [HttpClient]'s GET request with the specified [url] and\n * an optional [block] receiving an [HttpRequestBuilder] for configuring the request.\n *\n * Learn more from [Making requests](https://ktor.io/docs/request.html).\n */"} {"signature":"public inline fun NotebookHttpClient . post ( urlString : String , crossinline block : HttpRequestBuilder . ( ) -> Unit = { } ) : NotebookHttpResponse","body":"= NotebookHttpResponse ( runBlocking { ktorClient . post ( urlString , block ) } )","docstring":"/**\n * Executes an [HttpClient]'s POST request with the specified [url] and\n * an optional [block] receiving an [HttpRequestBuilder] for configuring the request.\n *\n * Learn more from [Making requests](https://ktor.io/docs/request.html).\n */"} {"signature":"public inline fun NotebookHttpClient . put ( urlString : String , crossinline block : HttpRequestBuilder . ( ) -> Unit = { } ) : NotebookHttpResponse","body":"= NotebookHttpResponse ( runBlocking { ktorClient . put ( urlString , block ) } )","docstring":"/**\n * Executes an [HttpClient]'s PUT request with the specified [url] and\n * an optional [block] receiving an [HttpRequestBuilder] for configuring the request.\n *\n * Learn more from [Making requests](https://ktor.io/docs/request.html).\n */"} {"signature":"public inline fun NotebookHttpClient . delete ( urlString : String , crossinline block : HttpRequestBuilder . ( ) -> Unit = { } ) : NotebookHttpResponse","body":"= NotebookHttpResponse ( runBlocking { ktorClient . delete ( urlString , block ) } )","docstring":"/**\n * Executes an [HttpClient]'s DELETE request with the specified [url] and\n * an optional [block] receiving an [HttpRequestBuilder] for configuring the request.\n *\n * Learn more from [Making requests](https://ktor.io/docs/request.html).\n */"} {"signature":"public inline fun NotebookHttpClient . options ( urlString : String , crossinline block : HttpRequestBuilder . ( ) -> Unit = { } ) : NotebookHttpResponse","body":"= NotebookHttpResponse ( runBlocking { ktorClient . options ( urlString , block ) } )","docstring":"/**\n * Executes an [HttpClient]'s OPTIONS request with the specified [url] and\n * an optional [block] receiving an [HttpRequestBuilder] for configuring the request.\n *\n * Learn more from [Making requests](https://ktor.io/docs/request.html).\n */"} {"signature":"public suspend inline fun NotebookHttpClient . patch ( urlString : String , crossinline block : HttpRequestBuilder . ( ) -> Unit = { } ) : NotebookHttpResponse","body":"= NotebookHttpResponse ( runBlocking { ktorClient . patch ( urlString , block ) } )","docstring":"/**\n * Executes an [HttpClient]'s PATCH request with the specified [url] and\n * an optional [block] receiving an [HttpRequestBuilder] for configuring the request.\n *\n * Learn more from [Making requests](https://ktor.io/docs/request.html).\n */"} {"signature":"public suspend inline fun NotebookHttpClient . head ( urlString : String , crossinline block : HttpRequestBuilder . ( ) -> Unit = { } ) : NotebookHttpResponse","body":"= NotebookHttpResponse ( runBlocking { ktorClient . head ( urlString , block ) } )","docstring":"/**\n * Executes an [HttpClient]'s HEAD request with the specified [url] and\n * an optional [block] receiving an [HttpRequestBuilder] for configuring the request.\n *\n * Learn more from [Making requests](https://ktor.io/docs/request.html).\n */"} {"signature":"fun shouldBeSkipped ( declaration : IrDeclaration ) : Boolean","body":"fun shouldBeSkipped ( declaration : IrDeclaration ) : Boolean","docstring":"/**\n * Fast check to determine if the given [declaration] should be skipped from the partial linkage point of view.\n *\n * This check is typically used to avoid processing and patching declarations that came from stdlib or were generated\n * on the fly by the compiler itself and this way are automatically supposed to be correct.\n *\n * Note: There is no need to call [shouldBeSkipped] prior to [exploreClassifiersInInlineLazyIrFunction] and\n * [generateStubsAndPatchUsages] functions. These function do the same check internally in more optimal way.\n */"} {"signature":"fun exploreClassifiers ( fakeOverrideBuilder : IrLinkerFakeOverrideProvider )","body":"fun exploreClassifiers ( fakeOverrideBuilder : IrLinkerFakeOverrideProvider )","docstring":"/**\n * For general use in IR linker.\n *\n * Note: Those classifiers that were detected as partially linked are excluded from the fake overrides generation\n * to avoid failing with `Symbol for is unbound` error or generating fake overrides with incorrect signatures.\n */"} {"signature":"fun exploreClassifiersInInlineLazyIrFunction ( function : IrFunction )","body":"fun exploreClassifiersInInlineLazyIrFunction ( function : IrFunction )","docstring":"/**\n * For local use only in inline lazy-IR functions.\n *\n * Such functions are fully deserialized when e.g. a cache is generated for a Kotlin/Native library given that the function itself\n * is from another library. The rest of IR from another library remains lazy meantime.\n */"} {"signature":"fun generateStubsAndPatchUsages ( symbolTable : SymbolTable , roots : ( ) -> Sequence < IrModuleFragment > )","body":"fun generateStubsAndPatchUsages ( symbolTable : SymbolTable , roots : ( ) -> Sequence < IrModuleFragment > )","docstring":"/**\n * Generate stubs for the remaining unbound symbols. Traverse the IR tree and patch every usage of any unbound symbol\n * to throw an appropriate IrLinkageError on access.\n */"} {"signature":"fun collectAllStubbedSymbols ( ) : Set < IrSymbol >","body":"fun collectAllStubbedSymbols ( ) : Set < IrSymbol >","docstring":"/**\n * Collect all symbols which were stubbed\n */"} {"signature":"fun createImmutableBlob ( value : IrConst < String > ) : LLVMValueRef","body":"{ val args = value . value . map { llvm . int8 ( it . code . toByte ( ) ) } return createConstKotlinArray ( context . ir . symbols . immutableBlob . owner , args ) }","docstring":"/**\n * Creates static instance of `konan.ImmutableByteArray` with given values of elements.\n *\n * @param args data for constant creation.\n */"} {"signature":"public inline fun < T > Flow < T > . filter ( crossinline predicate : suspend ( T ) -> Boolean ) : Flow < T >","body":"= transform { value -> if ( predicate ( value ) ) return@transform emit ( value ) }","docstring":"/**\n * Returns a flow containing only values of the original flow that match the given [predicate].\n */"} {"signature":"public inline fun < T > Flow < T > . filterNot ( crossinline predicate : suspend ( T ) -> Boolean ) : Flow < T >","body":"= transform { value -> if ( ! predicate ( value ) ) return@transform emit ( value ) }","docstring":"/**\n * Returns a flow containing only values of the original flow that do not match the given [predicate].\n */"} {"signature":"@ Suppress ( \"\" ) public inline fun < reified R > Flow < * > . filterIsInstance ( ) : Flow < R >","body":"= filter { it is R } as Flow < R >","docstring":"/**\n * Returns a flow containing only values that are instances of specified type [R].\n */"} {"signature":"public fun < R : Any > Flow < * > . filterIsInstance ( klass : KClass < R > ) : Flow < R >","body":"= filter { klass . isInstance ( it ) } as Flow < R >","docstring":"/**\n * Returns a flow containing only values that are instances of the given [klass].\n */"} {"signature":"public fun < T : Any > Flow < T ? > . filterNotNull ( ) : Flow < T >","body":"= transform < T ? , T > { value -> if ( value != null ) return@transform emit ( value ) }","docstring":"/**\n * Returns a flow containing only values of the original flow that are not null.\n */"} {"signature":"public inline fun < T , R > Flow < T > . map ( crossinline transform : suspend ( value : T ) -> R ) : Flow < R >","body":"= transform { value -> return@transform emit ( transform ( value ) ) }","docstring":"/**\n * Returns a flow containing the results of applying the given [transform] function to each value of the original flow.\n */"} {"signature":"public inline fun < T , R : Any > Flow < T > . mapNotNull ( crossinline transform : suspend ( value : T ) -> R ? ) : Flow < R >","body":"= transform { value -> val transformed = transform ( value ) ? : return@transform return@transform emit ( transformed ) }","docstring":"/**\n * Returns a flow that contains only non-null results of applying the given [transform] function to each value of the original flow.\n */"} {"signature":"public fun < T > Flow < T > . withIndex ( ) : Flow < IndexedValue < T > >","body":"= flow { var index = collect { value -> emit ( IndexedValue ( checkIndexOverflow ( index ++ ) , value ) ) } }","docstring":"/**\n * Returns a flow that wraps each element into [IndexedValue], containing value and its index (starting from zero).\n */"} {"signature":"public fun < T > Flow < T > . onEach ( action : suspend ( T ) -> Unit ) : Flow < T >","body":"= transform { value -> action ( value ) return@transform emit ( value ) }","docstring":"/**\n * Returns a flow that invokes the given [action] **before** each value of the upstream flow is emitted downstream.\n */"} {"signature":"public fun < T , R > Flow < T > . scan ( initial : R , @ BuilderInference operation : suspend ( accumulator : R , value : T ) -> R ) : Flow < R >","body":"= runningFold ( initial , operation )","docstring":"/**\n * Folds the given flow with [operation], emitting every intermediate result, including [initial] value.\n * Note that initial value should be immutable (or should not be mutated) as it is shared between different collectors.\n * For example:\n * ```\n * flowOf(1, 2, 3).scan(emptyList()) { acc, value -> acc + value }.toList()\n * ```\n * will produce `[[], [1], [1, 2], [1, 2, 3]]`.\n *\n * This function is an alias to [runningFold] operator.\n */"} {"signature":"public fun < T , R > Flow < T > . runningFold ( initial : R , @ BuilderInference operation : suspend ( accumulator : R , value : T ) -> R ) : Flow < R >","body":"= flow { var accumulator : R = initial emit ( accumulator ) collect { value -> accumulator = operation ( accumulator , value ) emit ( accumulator ) } }","docstring":"/**\n * Folds the given flow with [operation], emitting every intermediate result, including [initial] value.\n * Note that initial value should be immutable (or should not be mutated) as it is shared between different collectors.\n * For example:\n * ```\n * flowOf(1, 2, 3).runningFold(emptyList()) { acc, value -> acc + value }.toList()\n * ```\n * will produce `[[], [1], [1, 2], [1, 2, 3]]`.\n */"} {"signature":"public fun < T > Flow < T > . runningReduce ( operation : suspend ( accumulator : T , value : T ) -> T ) : Flow < T >","body":"= flow { var accumulator : Any ? = NULL collect { value -> accumulator = if ( accumulator === NULL ) { value } else { operation ( accumulator as T , value ) } emit ( accumulator as T ) } }","docstring":"/**\n * Reduces the given flow with [operation], emitting every intermediate result, including initial value.\n * The first element is taken as initial value for operation accumulator.\n * This operator has a sibling with initial value -- [scan].\n *\n * For example:\n * ```\n * flowOf(1, 2, 3, 4).runningReduce { acc, value -> acc + value }.toList()\n * ```\n * will produce `[1, 3, 6, 10]`\n */"} {"signature":"fun isClassInlineLike ( klass : IrClass ) : Boolean","body":"= klass . isSingleFieldValueClass","docstring":"/**\n * Should this class be treated as inline class?\n */"} {"signature":"fun getInlineClassUnderlyingType ( irClass : IrClass ) : IrType","body":"= irClass . declarations . firstIsInstanceOrNull < IrConstructor > ( ) ? . takeIf { it . isPrimary } ? . valueParameters ? . get ( ) ? . type ? : error ( \"\" )","docstring":"/**\n * Unlike [org.jetbrains.kotlin.ir.util.getInlineClassUnderlyingType], doesn't use [IrClass.inlineClassRepresentation] because\n * for some reason it can be called for classes which are not inline, e.g. `kotlin.Double`.\n */"} {"signature":"open fun transformForeignAnnotationCall ( symbol : FirBasedSymbol < * > , annotationCall : FirAnnotationCall ) : FirAnnotationCall","body":"{ return annotationCall }","docstring":"/**\n * @param symbol an owner of [annotationCall]\n * @param annotationCall an annotation call which does not belong to any declarations on the stack\n *\n * @see FirAnnotationCall.containingDeclarationSymbol\n */"} {"signature":"fun FirClassSymbol < * > . isSupertypeOf ( other : FirClassSymbol < * > , session : FirSession ) : Boolean","body":"{ fun FirClassSymbol < * > . isSupertypeOf ( other : FirClassSymbol < * > , exclude : MutableSet < FirClassSymbol < * > > ) : Boolean { for ( it in other . resolvedSuperTypeRefs ) { val candidate = it . toClassLikeSymbol ( session ) ? . fullyExpandedClass ( session ) ? : continue if ( candidate in exclude ) { continue } exclude . add ( candidate ) if ( candidate == this ) { return true } if ( this . isSupertypeOf ( candidate , exclude ) ) { return true } } return false } return isSupertypeOf ( other , mutableSetOf ( ) ) }","docstring":"/**\n * Returns true if this is a supertype of other.\n */"} {"signature":"fun FirTypeRef . toRegularClassSymbol ( session : FirSession ) : FirRegularClassSymbol ?","body":"{ return coneType . toRegularClassSymbol ( session ) }","docstring":"/**\n * Returns the FirRegularClass associated with this\n * or null of something goes wrong.\n */"} {"signature":"fun FirBasedSymbol < * > . getContainingClassSymbol ( session : FirSession ) : FirClassLikeSymbol < * > ?","body":"= when ( this ) { is FirCallableSymbol < * > -> containingClassLookupTag ( ) ? . toSymbol ( session ) is FirClassLikeSymbol < * > -> getContainingClassLookupTag ( ) ? . toSymbol ( session ) is FirAnonymousInitializerSymbol -> containingDeclarationSymbol as? FirClassLikeSymbol < * > else -> null }","docstring":"/**\n * Returns the ClassLikeDeclaration where the Fir object has been defined\n * or null if no proper declaration has been found.\n */"} {"signature":"fun FirCallableSymbol < * > . getContainingSymbol ( session : FirSession ) : FirBasedSymbol < * > ?","body":"{ return getContainingClassSymbol ( session ) ? : session . firProvider . getFirCallableContainerFile ( this ) ? . symbol }","docstring":"/**\n * Returns the containing class or file if the callable is top-level.\n */"} {"signature":"fun CheckerContext . findClosestClassOrObject ( ) : FirClass ?","body":"{ for ( it in containingDeclarations . asReversed ( ) ) { if ( it is FirRegularClass || it is FirAnonymousObject ) { @ Suppress ( \"\" ) return it as FirClass } } return null }","docstring":"/**\n * Returns the closest to the end of context.containingDeclarations\n * item like FirRegularClass or FirAnonymousObject\n * or null if no such item could be found.\n */"} {"signature":"fun FirClass . modality ( ) : Modality ?","body":"{ return when ( this ) { is FirRegularClass -> modality else -> Modality . FINAL } }","docstring":"/**\n * Returns the modality of the class\n */"} {"signature":"fun FirMemberDeclaration . redundantModalities ( context : CheckerContext ) : Set < Modality >","body":"{ if ( this is FirRegularClass ) { return when ( classKind ) { ClassKind . INTERFACE -> setOf ( Modality . ABSTRACT , Modality . OPEN ) else -> setOf ( Modality . FINAL ) } } val containingClass = context . findClosestClassOrObject ( ) ? : return setOf ( Modality . FINAL ) return when { isOverride && ! containingClass . isFinal -> setOf ( Modality . OPEN ) containingClass . isInterface -> when { hasBody ( ) -> setOf ( Modality . OPEN ) else -> setOf ( Modality . ABSTRACT , Modality . OPEN ) } else -> setOf ( Modality . FINAL ) } }","docstring":"/**\n * Returns a set of [Modality] modifiers which are redundant for the given [FirMemberDeclaration]. If a modality modifier is redundant, the\n * declaration's modality won't be changed by the modifier.\n */"} {"signature":"fun FirClass . findNonInterfaceSupertype ( context : CheckerContext ) : FirTypeRef ?","body":"{ for ( superTypeRef in superTypeRefs ) { val lookupTag = ( superTypeRef . coneType as? ConeClassLikeType ) ? . lookupTag ? : continue val symbol = lookupTag . toSymbol ( context . session ) as? FirClassSymbol < * > ? : continue if ( symbol . classKind != ClassKind . INTERFACE ) { return superTypeRef } } return null }","docstring":"/**\n * Finds any non-interface supertype and returns it\n * or null if couldn't find any.\n */"} {"signature":"fun FirCallableSymbol < * > . getImplementationStatus ( sessionHolder : SessionHolder , parentClassSymbol : FirClassSymbol < * > ) : ImplementationStatus","body":"{ val containingClassSymbol = getContainingClassSymbol ( sessionHolder . session ) val symbol = this if ( this . multipleDelegatesWithTheSameSignature == true && containingClassSymbol == parentClassSymbol ) { return ImplementationStatus . AMBIGUOUSLY_INHERITED } if ( symbol is FirIntersectionCallableSymbol ) { val dispatchReceiverScope = symbol . dispatchReceiverScope ( sessionHolder . session , sessionHolder . scopeSession ) val memberWithBaseScope = MemberWithBaseScope ( symbol , dispatchReceiverScope ) val nonSubsumed = memberWithBaseScope . getNonSubsumedOverriddenSymbols ( ) if ( containingClassSymbol === parentClassSymbol && ! memberWithBaseScope . isTrivialIntersection ( ) && nonSubsumed . subjectToManyNotImplemented ( sessionHolder ) ) { return ImplementationStatus . AMBIGUOUSLY_INHERITED } var hasAbstractFromClass = false var hasInterfaceDelegation = false var hasAbstractVar = false var hasImplementation = false var hasImplementationVar = false for ( intersection in nonSubsumed ) { val unwrapped = intersection . unwrapFakeOverrides ( ) val isVar = unwrapped is FirPropertySymbol && unwrapped . isVar val isFromClass = unwrapped . getContainingClassSymbol ( sessionHolder . session ) ? . classKind == ClassKind . CLASS if ( intersection . isAbstract ) { if ( isFromClass ) { hasAbstractFromClass = true } if ( isVar ) { hasAbstractVar = true } } else { if ( intersection . origin == FirDeclarationOrigin . Delegated ) { hasInterfaceDelegation = true } if ( isFromClass ) { hasImplementation = true if ( isVar ) { hasImplementationVar = true } } } } if ( hasAbstractFromClass && ! hasInterfaceDelegation ) { return ImplementationStatus . NOT_IMPLEMENTED } if ( hasAbstractVar && hasImplementation && ! hasImplementationVar ) { return ImplementationStatus . VAR_IMPLEMENTED_BY_VAL } } when ( symbol ) { is FirNamedFunctionSymbol -> { if ( parentClassSymbol is FirRegularClassSymbol && parentClassSymbol . isData && symbol . matchesDataClassSyntheticMemberSignatures ) { return ImplementationStatus . INHERITED_OR_SYNTHESIZED } } is FirFieldSymbol -> if ( symbol . isJavaOrEnhancement ) return ImplementationStatus . CANNOT_BE_IMPLEMENTED } return when { isFinal -> ImplementationStatus . CANNOT_BE_IMPLEMENTED containingClassSymbol === parentClassSymbol && ( origin == FirDeclarationOrigin . Source || origin == FirDeclarationOrigin . Precompiled ) -> ImplementationStatus . ALREADY_IMPLEMENTED isAbstract -> ImplementationStatus . NOT_IMPLEMENTED else -> ImplementationStatus . INHERITED_OR_SYNTHESIZED } }","docstring":"/**\n * Get the [ImplementationStatus] for this member.\n *\n * @param parentClassSymbol the contextual class for this query.\n */"} {"signature":"public fun IntRange . toSlice ( ) : Slice","body":"= Slice ( this . first , this . last , )","docstring":"/**\n * Returns Slice containing the first, the last with a step of 1.\n */"} {"signature":"public fun ClosedRange < Int > . toSlice ( ) : Slice","body":"= when ( this ) { is Slice -> this is IntRange -> this . toSlice ( ) else -> throw IllegalStateException ( \"\" ) }","docstring":"/**\n * Returns Slice containing the first, the last with a step of 1.\n */"} {"signature":"public operator fun SliceStartStub . rangeTo ( that : Int ) : Slice","body":"= Slice ( - , that , )","docstring":"/**\n * Returns Slice with stub of the start.\n */"} {"signature":"public operator fun Int . rangeTo ( that : SliceEndStub ) : Slice","body":"= Slice ( this , - , )","docstring":"/**\n * Returns Slice with stub of the stop.\n */"} {"signature":"public operator fun Int . rangeTo ( that : RInt ) : Slice","body":"= Slice ( this , that . data , )","docstring":"/**\n * Returns Slice where stop from RInt.\n */"} {"signature":"public operator fun IntRange . rangeTo ( step : Int ) : Slice","body":"{ return Slice ( this . first , this . last , step ) }","docstring":"/**\n * Returns a slice at a specified [step].\n */"} {"signature":"fun clearBuildName ( )","body":"{ _builder . clearBuildName ( ) }","docstring":"/**\n * 
\n * Renamed from 'build_id' to 'build_name' in 1.9.20\n *
\n *\n * optional string build_name = 1;\n */"} {"signature":"fun hasBuildName ( ) : kotlin . Boolean","body":"{ return _builder . hasBuildName ( ) }","docstring":"/**\n * 
\n * Renamed from 'build_id' to 'build_name' in 1.9.20\n *
\n *\n * optional string build_name = 1;\n * @return Whether the buildName field is set.\n */"} {"signature":"fun clearBuildPath ( )","body":"{ _builder . clearBuildPath ( ) }","docstring":"/**\n * 
\n * Added in 1.9.20\n *
\n *\n * optional string build_path = 4;\n */"} {"signature":"fun hasBuildPath ( ) : kotlin . Boolean","body":"{ return _builder . hasBuildPath ( ) }","docstring":"/**\n * 
\n * Added in 1.9.20\n *
\n *\n * optional string build_path = 4;\n * @return Whether the buildPath field is set.\n */"} {"signature":"fun clearProjectPath ( )","body":"{ _builder . clearProjectPath ( ) }","docstring":"/**\n * optional string project_path = 2;\n */"} {"signature":"fun hasProjectPath ( ) : kotlin . Boolean","body":"{ return _builder . hasProjectPath ( ) }","docstring":"/**\n * optional string project_path = 2;\n * @return Whether the projectPath field is set.\n */"} {"signature":"fun clearProjectName ( )","body":"{ _builder . clearProjectName ( ) }","docstring":"/**\n * optional string project_name = 3;\n */"} {"signature":"fun hasProjectName ( ) : kotlin . Boolean","body":"{ return _builder . hasProjectName ( ) }","docstring":"/**\n * optional string project_name = 3;\n * @return Whether the projectName field is set.\n */"} {"signature":"public fun mnist ( cacheDirectory : File = File ( \"\" ) ) : Pair < OnHeapDataset , OnHeapDataset >","body":"{ return createDataset ( cacheDirectory , TRAIN_IMAGES_ARCHIVE , TRAIN_LABELS_ARCHIVE , TEST_IMAGES_ARCHIVE , TEST_LABELS_ARCHIVE ) }","docstring":"/**\n * Loads the [MNIST dataset](http://yann.lecun.com/exdb/mnist/).\n * This is a dataset of 60,000 28x28 grayscale images of the 10 digits,\n * along with a test set of 10,000 images.\n * More info can be found at the [MNIST homepage](http://yann.lecun.com/exdb/mnist/).\n *\n * NOTE: Yann LeCun and Corinna Cortes hold the copyright of MNIST dataset,\n * which is a derivative work from original NIST datasets.\n * MNIST dataset is made available under the terms of the\n * [Creative Commons Attribution-Share Alike 3.0 license.](https://creativecommons.org/licenses/by-sa/3.0/)\n *\n * @param [cacheDirectory] Cache directory to cached models and datasets.\n *\n * @return Train and test datasets. Each dataset includes X and Y data. X data are uint8 arrays of grayscale image data with shapes\n * (num_samples, 28, 28). Y data uint8 arrays of digit labels (integers in range 0-9) with shapes (num_samples,).\n */"} {"signature":"public fun fashionMnist ( cacheDirectory : File = File ( \"\" ) ) : Pair < OnHeapDataset , OnHeapDataset >","body":"{ return createDataset ( cacheDirectory , FASHION_TRAIN_IMAGES_ARCHIVE , FASHION_TRAIN_LABELS_ARCHIVE , FASHION_TEST_IMAGES_ARCHIVE , FASHION_TEST_LABELS_ARCHIVE ) }","docstring":"/**\n * Loads the Fashion-MNIST dataset.\n *\n * This is a dataset of 60,000 28x28 grayscale images of 10 fashion categories,\n * along with a test set of 10,000 images. This dataset can be used as\n * a drop-in replacement for MNIST. The class labels are:\n *\n * | Label | Description |\n * |:-----:|-------------|\n * | 0 | T-shirt/top |\n * | 1 | Trousers |\n * | 2 | Pullover |\n * | 3 | Dress |\n * | 4 | Coat |\n * | 5 | Sandals |\n * | 6 | Shirt |\n * | 7 | Sneakers |\n * | 8 | Bag |\n * | 9 | Ankle boots |\n *\n * NOTE: The copyright for Fashion-MNIST is held by Zalando SE.\n * Fashion-MNIST is licensed under the [MIT license](https://github.com/zalandoresearch/fashion-mnist/blob/master/LICENSE).\n *\n * @param [cacheDirectory] Cache directory to cached models and datasets.\n *\n * @return Train and test datasets. Each dataset includes X and Y data. X data are uint8 arrays of grayscale image data with shapes\n * (num_samples, 28, 28). Y data uint8 arrays of digit labels (integers in range 0-9) with shapes (num_samples,).\n */"} {"signature":"public fun mnist3D ( cacheDirectory : File = File ( \"\" ) ) : Pair < OnHeapDataset , OnHeapDataset >","body":"{ cacheDirectory . existsOrMkdirs ( ) return HdfFile ( loadFile ( cacheDirectory , MNIST_3D_DATASET ) ) . use { val ( trainData , trainLabels ) = it . extractMnist3DDataset ( \"\" ) val ( testData , testLabels ) = it . extractMnist3DDataset ( \"\" ) val shape = TensorShape ( MNIST_3D_FRAME_SIZE , MNIST_3D_FRAME_SIZE , MNIST_3D_FRAME_SIZE ) Pair ( OnHeapDataset . create ( trainData , trainLabels , shape ) , OnHeapDataset . create ( testData , testLabels , shape ) ) } }","docstring":"/**\n * Loads the [MNIST 3D dataset](https://www.kaggle.com/daavoo/3d-mnist).\n * This is a dataset of 10,000 16x16x16 grayscale 3D images of the 10 digits,\n * along with a test set of 2,000 3D images.\n *\n * NOTE: Yann LeCun and Corinna Cortes hold the copyright of MNIST dataset,\n * which is a derivative work from original NIST datasets.\n * MNIST dataset is made available under the terms of the\n * [Creative Commons Attribution-Share Alike 3.0 license.](https://creativecommons.org/licenses/by-sa/3.0/)\n * MNIST 3D dataset was created by [daavoo](https://github.com/daavoo) as a transformation of\n * original MNIST dataset to 3D images to provide a simple example of working with 3D images.\n *\n * @param [cacheDirectory] Cache directory to cached models and datasets.\n *\n * @return Train and test datasets. Each dataset includes X and Y data.\n * X data are float arrays of grayscale image data with shapes (num_samples, 16, 16, 16).\n * Y data float arrays of digit labels (integers in range 0-9) with shapes (num_samples,).\n */"} {"signature":"private fun extractMnist3DData ( dataset : Dataset )","body":"= ( dataset . data as Array < * > ) . map { ( it as DoubleArray ) . map ( Double :: toFloat ) . toFloatArray ( ) } . toTypedArray ( )","docstring":"/** Extract mnist3d X data from HD5 file [dataset] */"} {"signature":"private fun extractMnist3DLabels ( dataset : Dataset )","body":"= ( dataset . data as LongArray ) . map ( Long :: toFloat ) . toFloatArray ( )","docstring":"/** Extract mnist3d Y labels from HD5 file [dataset] */"} {"signature":"private fun HdfFile . extractMnist3DDataset ( label : String ) : Pair < Array < FloatArray > , FloatArray >","body":"= Pair ( extractMnist3DData ( getDatasetByPath ( \"\" ) ) , extractMnist3DLabels ( getDatasetByPath ( \"\" ) ) )","docstring":"/** Extract mnist3d data and labels from HD5 file under specified [label] */"} {"signature":"public fun freeSpokenDigits ( cacheDirectory : File = File ( \"\" ) , maxTestIndex : Int = ) : Pair < OnHeapDataset , OnHeapDataset >","body":"{ cacheDirectory . existsOrMkdirs ( ) val path = freeSpokenDigitDatasetPath ( cacheDirectory ) val dataset = File ( path ) . listFiles ( ) ? . flatMap ( :: extractWavFileSamples ) ? : throw IllegalStateException ( \"\" ) val maxDataSize = dataset . maxOfOrNull { it . first . size } ? : throw IllegalStateException ( \"\" ) check ( maxDataSize <= FSDD_SOUND_DATA_SIZE ) { \"\" } val data = dataset . map ( :: extractPaddedDataWithIndex ) val labels = dataset . map ( :: extractLabelWithIndex ) val ( trainData , testData ) = data . splitToTrainAndTestByIndex ( maxTestIndex ) val ( trainLabels , testLabels ) = labels . splitToTrainAndTestByIndex ( maxTestIndex ) val shape = TensorShape ( FSDD_SOUND_DATA_SIZE , ) return Pair ( OnHeapDataset . create ( trainData , trainLabels . toFloatArray ( ) , shape ) , OnHeapDataset . create ( testData , testLabels . toFloatArray ( ) , shape ) ) }","docstring":"/**\n * Loads the [Free Spoken Digits Dataset](https://github.com/Jakobovski/free-spoken-digit-dataset).\n * This is a dataset of wav sound files of the 10 digits spoken by different people many times each.\n * The test set officially consists of the first 10% of the recordings. Recordings numbered 0-4 (inclusive)\n * are in the test, and 5-49 are in the training set.\n *\n * As the input data files have different number of channels of data, we split every input file into separate samples\n * that are threatened as separate samples with the same label.\n *\n * Free Spoken Digits Dataset is made available under the terms of the\n * [Creative Commons Attribution-ShareAlike 4.0 International.](https://creativecommons.org/licenses/by-sa/4.0/)\n *\n * @param [cacheDirectory] Cache directory to cached models and datasets.\n * @param [maxTestIndex] Index of max sample to be selected to test part of data.\n *\n * @return Train and test datasets. Each dataset includes X and Y data. X data are float arrays of sound data with\n * shapes (num_samples, FSDD_SOUND_DATA_SIZE)\n * where FSDD_SOUND_DATA_SIZE is at least as long as the longest input sequence and all\n * sequences are padded with zeros to have equal length. Y data float arrays of digit labels (integers in range 0-9)\n * with shapes (num_samples,).\n */"} {"signature":"private fun extractWavFileSamples ( file : File ) : List < Triple < FloatArray , Float , Int > >","body":"= WavFile ( file ) . use { val data = it . readRemainingFrames ( ) val parts = file . name . split ( \"\" ) val label = parts [ ] . toFloat ( ) val index = parts [ ] . split ( \"\" ) [ ] . toInt ( ) data . map { channel -> Triple ( channel , label , index ) } }","docstring":"/**\n * Extract wav file samples from a given file and return a list of data from all its\n * channels as a triple of (channel_data, label, sample_index).\n *\n * @param [file] to read from the sound data.\n * @return list of triples (channel_data, label, sample_index) from all channels from file.\n */"} {"signature":"public fun cifar10Paths ( cacheDirectory : File = File ( \"\" ) ) : Pair < String , String >","body":"{ cacheDirectory . existsOrMkdirs ( ) val pathToLabel = loadFile ( cacheDirectory , CIFAR_10_LABELS_ARCHIVE ) . absolutePath val datasetDirectory = File ( cacheDirectory . absolutePath + \"\" ) val toFolder = datasetDirectory . toPath ( ) val imageDataDirectory = File ( cacheDirectory . absolutePath + \"\" ) if ( ! imageDataDirectory . exists ( ) ) { Files . createDirectories ( imageDataDirectory . toPath ( ) ) val pathToImageArchive = loadFile ( cacheDirectory , CIFAR_10_IMAGES_ARCHIVE ) extractFromZipArchiveToFolder ( pathToImageArchive . toPath ( ) , toFolder ) val deleted = pathToImageArchive . delete ( ) if ( ! deleted ) throw Exception ( \"\" ) } return Pair ( imageDataDirectory . toPath ( ) . toAbsolutePath ( ) . toString ( ) , pathToLabel ) }","docstring":"/** Returns paths to images and its labels for the Cifar'10 dataset. */"} {"signature":"public fun dogsCatsDatasetPath ( cacheDirectory : File = File ( \"\" ) ) : String","body":"= unzipDatasetPath ( cacheDirectory , loadFile ( cacheDirectory , DOGS_CATS_IMAGES_ARCHIVE ) , \"\" )","docstring":"/** Returns path to images of the Dogs-vs-Cats dataset. */"} {"signature":"public fun dogsCatsSmallDatasetPath ( cacheDirectory : File = File ( \"\" ) ) : String","body":"= unzipDatasetPath ( cacheDirectory , loadFile ( cacheDirectory , DOGS_CATS_SMALL_IMAGES_ARCHIVE ) , \"\" )","docstring":"/** Returns path to images of the subset of the Dogs-vs-Cats dataset. */"} {"signature":"public fun freeSpokenDigitDatasetPath ( cacheDirectory : File = File ( \"\" ) ) : String","body":"= unzipDatasetPath ( cacheDirectory , loadFile ( cacheDirectory , FSDD_SOUNDS_ARCHIVE , downloadURLFromRelativePath = { FSS_SOUNDS_SOURCE } ) , \"\" ) . run { \"\" }","docstring":"/** Returns path to sound data files from Free Spoken Digits Dataset. */"} {"signature":"private fun unzipDatasetPath ( cacheDirectory : File , archive : File , dirRelativePath : String ) : String","body":"{ cacheDirectory . existsOrMkdirs ( ) val dataDirectory = File ( cacheDirectory . absolutePath + dirRelativePath ) val toFolder = dataDirectory . toPath ( ) if ( ! dataDirectory . exists ( ) ) Files . createDirectories ( dataDirectory . toPath ( ) ) if ( archive . exists ( ) ) { extractFromZipArchiveToFolder ( archive . toPath ( ) , toFolder ) val deleted = archive . delete ( ) if ( ! deleted ) { throw Exception ( \"\" ) } } else { throw Exception ( \"\" ) } return toFolder . toAbsolutePath ( ) . toString ( ) }","docstring":"/**\n * Download the compressed dataset from an external source, decompress the file and remove the downloaded file\n * but leave the decompressed data from dataset.\n *\n * @param [cacheDirectory] The directory where the downloaded files are stored.\n * @param [archive] Archive file.\n * @param [dirRelativePath] The relative path where to store the downloaded archive temporarily and decompress its data.\n * @return The absolute path string to directory where dataset is decompressed.\n */"} {"signature":"private fun loadFile ( cacheDirectory : File , relativePathToFile : String , downloadURLFromRelativePath : ( String ) -> String = { \"\" } , loadingMode : LoadingMode = LoadingMode . SKIP_LOADING_IF_EXISTS ) : File","body":"{ val fileName = cacheDirectory . absolutePath + \"\" + relativePathToFile val file = File ( fileName ) file . parentFile . mkdirs ( ) if ( ! file . exists ( ) || loadingMode == LoadingMode . OVERRIDE_IF_EXISTS ) { val urlString = downloadURLFromRelativePath ( relativePathToFile ) val inputStream = URL ( urlString ) . openStream ( ) Files . copy ( inputStream , Paths . get ( fileName ) , StandardCopyOption . REPLACE_EXISTING ) } return file }","docstring":"/**\n * Downloads a file from a URL if it not already in the cache.\n *\n * By default, the download location\n * is defined as the concatenation of [AWS_S3_URL] and [relativePathToFile] but can be defined\n * as an arbitrary file location to download file from *\n *\n * @param [cacheDirectory] where the downloaded file is stored\n * @param [relativePathToFile] where the downloaded file is stored in [cacheDirectory] and which can\n * define the location of file to be downloaded\n * @param [downloadURLFromRelativePath] can produce the download URL of the file using.\n * Defaults to [AWS_S3_URL]/[relativePathToFile].\n * @param [loadingMode] of the file to be loaded. Defaults to [LoadingMode.SKIP_LOADING_IF_EXISTS]\n * @return downloaded [File] on a local file system.\n */"} {"signature":"@ Throws ( IOException :: class ) internal fun extractFromZipArchiveToFolder ( zipArchivePath : Path , toFolder : Path , bufferSize : Int = )","body":"{ val zipFile = ZipFile ( zipArchivePath . toFile ( ) ) val entries = zipFile . entries ( ) while ( entries . hasMoreElements ( ) ) { val entry = entries . nextElement ( ) as ZipEntry var currentEntry = entry . name currentEntry = currentEntry . replace ( '' , '' ) val destFile = File ( toFolder . toFile ( ) , currentEntry ) val destinationParent = destFile . parentFile destinationParent . mkdirs ( ) if ( ! entry . isDirectory && ! destFile . exists ( ) ) { val inputStream = BufferedInputStream ( zipFile . getInputStream ( entry ) ) var currentByte : Int val data = ByteArray ( bufferSize ) val fos = FileOutputStream ( destFile ) val dest = BufferedOutputStream ( fos , bufferSize ) while ( inputStream . read ( data , , bufferSize ) . also { currentByte = it } != - ) { dest . write ( data , , currentByte ) } dest . flush ( ) dest . close ( ) inputStream . close ( ) } } zipFile . close ( ) }","docstring":"/** Creates file structure archived in zip file with all directories and subdirectories. */"} {"signature":"fun FirResolvePhase . isItAllowedToCallLazyResolveTo ( requestedPhase : FirResolvePhase ) : Boolean","body":"= when { this > requestedPhase -> true this == requestedPhase -> isItAllowedToCallLazyResolveToTheSamePhase else -> false }","docstring":"/**\n * See [FirResolvePhase] KDoc for more details about resolution contacts.\n *\n * @param this The current phase\n * @param requestedPhase The requested phase\n *\n * @see FirResolvePhase\n * @see org.jetbrains.kotlin.fir.symbols.FirLazyDeclarationResolver\n * @see org.jetbrains.kotlin.fir.symbols.lazyResolveToPhase\n * @see isItAllowedToCallLazyResolveToTheSamePhase\n */"} {"signature":"internal inline fun < reified T : KotlinTarget > KotlinTargetSideEffect ( crossinline effect : ( T ) -> Unit )","body":"= KotlinTargetSideEffect { target -> if ( target is T ) effect ( target ) }","docstring":"/**\n * see [KotlinTargetSideEffect]\n */"} {"signature":"public fun KtSymbol . getDeprecationStatus ( annotationUseSiteTarget : AnnotationUseSiteTarget ? ) : DeprecationInfo ?","body":"= withValidityAssertion { analysisSession . symbolInfoProvider . getDeprecation ( this , annotationUseSiteTarget ) }","docstring":"/**\n * Gets the deprecation status of the given symbol. Returns null if the symbol is not deprecated.\n */"} {"signature":"public fun valueParameter ( name : Name , type : ConeKotlinType , isCrossinline : Boolean = false , isNoinline : Boolean = false , isVararg : Boolean = false , hasDefaultValue : Boolean = false , key : GeneratedDeclarationKey = this @ FunctionBuildingContext . key )","body":"{ valueParameter ( name , { type } , isCrossinline , isNoinline , isVararg , hasDefaultValue , key ) }","docstring":"/**\n * Adds value parameter with [type] type to constructed function\n *\n * If you set [hasDefaultValue] to true then you need to generate actual default value\n * in [IrGenerationExtension]\n */"} {"signature":"public fun valueParameter ( name : Name , typeProvider : ( List < FirTypeParameterRef > ) -> ConeKotlinType , isCrossinline : Boolean = false , isNoinline : Boolean = false , isVararg : Boolean = false , hasDefaultValue : Boolean = false , key : GeneratedDeclarationKey = this @ FunctionBuildingContext . key )","body":"{ valueParameters += ValueParameterData ( name , typeProvider , isCrossinline , isNoinline , isVararg , hasDefaultValue , key ) }","docstring":"/**\n * Adds value parameter with type provided by [typeProvider] to constructed function\n * Use this overload when parameter type uses type parameters of constructed declaration\n *\n * If you set [hasDefaultValue] to true then you need to generate actual default value\n * in [IrGenerationExtension]\n */"} {"signature":"@ SuppressLint ( \"\" ) override fun onCreate ( savedInstanceState : Bundle ? )","body":"{ super . onCreate ( savedInstanceState ) val textView = TextView ( this ) textView . text = \"\" setContentView ( textView ) }","docstring":"/**\n * Will show a small happy text\n */"} {"signature":"public abstract fun allocate ( size : Int ) : Pointer","body":"public abstract fun allocate ( size : Int ) : Pointer","docstring":"/**\n * Allocates a block of uninitialized linear memory of the given [size] in bytes.\n *\n * @return an address of allocated memory. It is guaranteed to be a multiple of 8.\n */"} {"signature":"@ UnsafeWasmMemoryApi public inline fun < T > withScopedMemoryAllocator ( block : ( allocator : MemoryAllocator ) -> T ) : T","body":"{ contract { callsInPlace ( block , InvocationKind . EXACTLY_ONCE ) } val allocator = createAllocatorInTheNewScope ( ) val result = try { block ( allocator ) } finally { allocator . destroy ( ) currentAllocator = allocator . parent } return result }","docstring":"/**\n * Runs the [block] of code, providing it a temporary [MemoryAllocator] as an argument, and returns the result of this block.\n *\n * Frees all memory allocated with the provided allocator after running the [block].\n *\n * This function is intened to facilitate the exchange of values with outside world through linear memory.\n * For example:\n *\n * ```\n * val buffer_size = ...\n * withScopedMemoryAllocator { allocator ->\n * val buffer_address = allocator.allocate(buffer_size)\n * importedWasmFunctionThatWritesToBuffer(buffer_address, buffer_size)\n * return readDataFromBufferIntoManagedKotlinMemory(buffer_address, buffer_size)\n * }\n * ```\n *\n * WARNING! Addresses allocated inside the [block] function become invalid after exiting the function.\n *\n * WARNING! A nested call to [withScopedMemoryAllocator] will temporarily disable the allocator from the outer scope\n * for the duration of the call. Calling [MemoryAllocator.allocate] on a disabled allocator\n * will throw [IllegalStateException].\n *\n * WARNING! Accessing the allocator outside of the [block] scope will throw [IllegalStateException].\n */"} {"signature":"@ WasmOp ( WasmOp . MEMORY_SIZE ) internal fun wasmMemorySize ( ) : Int","body":"= implementedAsIntrinsic","docstring":"/**\n * Current linear memory size in pages\n */"} {"signature":"@ Suppress ( \"\" ) @ WasmOp ( WasmOp . MEMORY_GROW ) internal fun wasmMemoryGrow ( delta : Int ) : Int","body":"= implementedAsIntrinsic","docstring":"/**\n * Grow memory by a given delta (in pages).\n * Return the previous size, or -1 if enough memory cannot be allocated.\n */"} {"signature":"fun main ( )","body":"{ val resource = Operation :: class . java . getResource ( \"\" ) ! ! val imageDirectory = Paths . get ( resource . toURI ( ) ) . toFile ( ) val images = OnHeapDataset . create ( imageDirectory , EmptyLabels ( ) ) . x val datasetMean = mean ( * images , channels = ) val datasetStd = std ( * images , channels = ) println ( \"\" ) val imageResource = Operation :: class . java . getResource ( \"\" ) val image = File ( imageResource ! ! . toURI ( ) ) val imageFloats = ImageConverter . toRawFloatArray ( image ) println ( \"\" + \"\" ) val preprocessing = pipeline < BufferedImage > ( ) . toFloatArray { } . normalize { mean = datasetMean std = datasetStd } val ( processedImageFloats , _ ) = preprocessing . fileLoader ( ) . load ( image ) println ( \"\" + \"\" ) }","docstring":"/**\n * This example demonstrates [normalize] tensor preprocessor.\n * It shows how to compute mean and std values for the dataset and how to use these values for normalization.\n */"} {"signature":"fun getTypeBounds ( typeVariable : TypeVariable ) : TypeBounds","body":"fun getTypeBounds ( typeVariable : TypeVariable ) : TypeBounds","docstring":"/**\n * Returns the resulting type constraints of solving the constraint system for specific type parameter descriptor.\n * Throws IllegalArgumentException if the type parameter descriptor is not known to the system.\n */"} {"signature":"fun registerTypeVariables ( call : CallHandle , typeParameters : Collection < TypeParameterDescriptor > , external : Boolean = false ) : TypeSubstitutor","body":"fun registerTypeVariables ( call : CallHandle , typeParameters : Collection < TypeParameterDescriptor > , external : Boolean = false ) : TypeSubstitutor","docstring":"/**\n * Registers variables in a constraint system. Returns a substitutor which maps type parameter descriptors passed as parameters\n * to the corresponding types of variables of the system. Use that substitutor to provide constraints to the system\n */"} {"signature":"fun addSubtypeConstraint ( constrainingType : KotlinType ? , subjectType : KotlinType ? , constraintPosition : ConstraintPosition )","body":"fun addSubtypeConstraint ( constrainingType : KotlinType ? , subjectType : KotlinType ? , constraintPosition : ConstraintPosition )","docstring":"/**\n * Adds a constraint that the constraining type is a subtype of the subject type.\n * Asserts that only subject type may contain registered type variables.\n *\n * For example, for `fun id(t: T) {}` to infer `T` in invocation `id(1)`\n * the constraint \"Int is a subtype of T\" should be generated where T is a subject type, and Int is a constraining type.\n */"} {"signature":"fun add ( other : Builder )","body":"fun add ( other : Builder )","docstring":"/**\n * Add all variables and constraints from the other system to this one. The other system may not have any common variables\n * with this one, or even variables registered for calls, for which this system also has some registered variables\n */"} {"signature":"public inline fun LayerCollectorContext . step ( block : StepContext . ( ) -> Unit )","body":"{ addLayer ( StepContext ( this ) . apply ( block ) ) }","docstring":"/**\n * Adds a new `step` layer to the plot.\n *\n * The `step` layer is used to create step plots,\n * which are useful for representing data that changes at discrete intervals,\n * often seen in time series or ordinal data.\n *\n * This function creates a context where you can set aesthetic mappings (`aes`) or aesthetic constants.\n * - Mappings are specified by calling methods that correspond to aesthetic names (`aes`).\n * - Constants are directly assigned using properties with the names corresponding to aesthetics.\n * For positional aesthetics, you can use the `.constant()` method.\n *\n * ## Step Aesthetics\n * * **`x`** - The X-coordinate specifying the points at which the steps change.\n * * **`y`** - The Y-coordinate specifying the height of each step.\n * * **`color`** - The color of the steps.\n * * **`lineType`** - The type of the step line, such as dashed or dotted.\n * * **`width`** - The width of the step line.\n * * **`alpha`** - The transparency of the step line.\n *\n * ## Example Usage\n *\n * ```kotlin\n * plot {\n * step {\n * // Positional mapping\n * x(listOf(1, 2, 3, 4, 5))\n * y(listOf(3, 5, 2, 8, 3))\n *\n * // Non-positional mapping\n * color = Color.RED\n *\n * // Non-positional settings\n * width = 2.5\n * alpha = 0.7\n * lineType = LineType.LONGDASH\n * }\n * }\n * ```\n */"} {"signature":"internal fun Project . setupCInteropPropagatedDependencies ( )","body":"{ val kotlin = this . multiplatformExtensionOrNull ? : return kotlin . forAllSharedNativeCompilations { compilation -> compilation . compileDependencyFiles += getPropagatedCInteropDependenciesOrEmpty ( compilation ) } kotlin . forAllDefaultKotlinSourceSets { sourceSet -> addIntransitiveMetadataDependencyIfPossible ( sourceSet , getPropagatedCInteropDependenciesOrEmpty ( sourceSet ) ) } }","docstring":"/**\n * Will propagate \"original\"/\"platform\" cinterops to intermediate source sets\n * and 'shared native' compilations if necessary.\n *\n * cinterops will be forwarded when a source set/ compilation has just a single platform\n * dependee\n *\n * e.g.\n *\n * ```\n * kotlin {\n * sourceSets {\n * val nativeMain by sourceSets.creating\n * val linuxX64Main by sourceSets.getting\n * linuxX64Main.dependsOn(nativeMain)\n * }\n * }\n * ```\n *\n * In this example 'nativeMain' has only a single native\n * target and a single native source set depending on it.\n * All cinterops defined on linuxX64's main compilation shall be propagated\n * to the 'nativeMain' source set (and its 'shared native' compilation) if it exists.\n */"} {"signature":"public fun Path . copyToIgnoringExistingDirectory ( target : Path , followLinks : Boolean ) : CopyActionResult","body":"public fun Path . copyToIgnoringExistingDirectory ( target : Path , followLinks : Boolean ) : CopyActionResult","docstring":"/**\n * Copies the entry located by this path to the specified [target] path,\n * except if both this and [target] entries are directories,\n * in which case the method completes without copying the entry.\n *\n * The entry is copied using `this.copyTo(target, *followLinksOption)`. See [kotlin.io.path.copyTo].\n *\n * @param target the path to copy this entry to.\n * @param followLinks `false` to copy the entry itself even if it's a symbolic link.\n * `true` to copy its target if this entry is a symbolic link.\n * If this entry is not a symbolic link, the value of this parameter doesn't make any difference.\n * @return [CopyActionResult.CONTINUE]\n */"} {"signature":"@ SinceKotlin ( \"\" ) public actual fun < T , K > Grouping < T , K > . eachCount ( ) : Map < K , Int >","body":"= foldTo ( destination = mutableMapOf ( ) , initialValueSelector = { _ , _ -> kotlin . jvm . internal . Ref . IntRef ( ) } , operation = { _ , acc , _ -> acc . apply { element += } } ) . mapValuesInPlace { it . value . element }","docstring":"/**\n * Groups elements from the [Grouping] source by key and counts elements in each group.\n *\n * @return a [Map] associating the key of each group with the count of elements in the group.\n *\n * @sample samples.collections.Grouping.groupingByEachCount\n */"} {"signature":"private fun IrBuilderWithScope . kClassArrayToJClassArray ( kClassArray : IrExpression ) : IrExpression","body":"{ val javaLangClassType = javaLangClassSymbol . starProjectedType val jlcArray = symbols . array . typeWith ( javaLangClassType ) val arrayClass = symbols . array . owner val arrayOfNulls = symbols . arrayOfNulls val arraySizeSymbol = arrayClass . findDeclaration < IrProperty > { it . name . asString ( ) == \"\" } ! ! . getter ! ! val block = irBlock { val sourceArray = createTmpVariable ( kClassArray , \"\" , isMutable = false ) val index = createTmpVariable ( irInt ( ) , \"\" , isMutable = true ) val size = createTmpVariable ( irCall ( arraySizeSymbol ) . apply { dispatchReceiver = irGet ( sourceArray ) } , \"\" , isMutable = false ) val result = createTmpVariable ( irCall ( arrayOfNulls , jlcArray ) . apply { listOf ( javaLangClassType ) putValueArgument ( , irGet ( size ) ) } ) val comparison = primitiveOp2 ( startOffset , endOffset , context . irBuiltIns . lessFunByOperandType [ context . irBuiltIns . intType . classifierOrFail ] ! ! , context . irBuiltIns . booleanType , IrStatementOrigin . LT , irGet ( index ) , irGet ( size ) ) val setArraySymbol = arrayClass . functions . single { it . name == OperatorNameConventions . SET } val getArraySymbol = arrayClass . functions . single { it . name == OperatorNameConventions . GET } val inc = context . irBuiltIns . intType . getClass ( ) ! ! . functions . single { it . name == OperatorNameConventions . INC } + irWhile ( ) . also { loop -> loop . condition = comparison loop . body = irBlock { val tempIndex = createTmpVariable ( irGet ( index ) ) val getArray = irCall ( getArraySymbol ) . apply { dispatchReceiver = irGet ( sourceArray ) putValueArgument ( , irGet ( tempIndex ) ) } + irCall ( setArraySymbol ) . apply { dispatchReceiver = irGet ( result ) putValueArgument ( , irGet ( tempIndex ) ) putValueArgument ( , kClassToJClass ( getArray ) ) } + irSet ( index . symbol , irCallOp ( inc . symbol , index . type , irGet ( index ) ) ) } } + irGet ( result ) } return block }","docstring":"/**\n * Copies array by one element, roughly as following:\n * val size = kClassArray.size\n * val result = arrayOfNulls(size)\n * var i = 0\n * while(i < size) {\n * result[i] = kClassArray[i].java\n * i++\n * }\n * Partially taken from ArrayConstructorLowering.kt\n */"} {"signature":"fun moveBlockAfterEntry ( block : LLVMBasicBlockRef )","body":"{ LLVMMoveBasicBlockAfter ( block , this . entryBb ) }","docstring":"/**\n * This function shouldn't be used normally.\n * It is used to move block with strange debug info in the middle of function, to avoid last debug info being too strange,\n * because it will break heuristics in CoreSymbolication\n */"} {"signature":"fun getEnumEntry ( enumEntry : IrEnumEntry , exceptionHandler : ExceptionHandler ) : LLVMValueRef","body":"{ val enumClass = enumEntry . parentAsClass val getterId = context . enumsSupport . enumEntriesMap ( enumClass ) [ enumEntry . name ] ! ! . getterId return call ( context . enumsSupport . getValueGetter ( enumClass ) . llvmFunction , listOf ( llvm . int32 ( getterId ) ) , Lifetime . GLOBAL , exceptionHandler ) }","docstring":"/**\n * Note: the same code is generated as IR in [org.jetbrains.kotlin.backend.konan.lower.EnumUsageLowering].\n */"} {"signature":"fun isAfterTerminator ( )","body":"= currentPositionHolder . isAfterTerminator","docstring":"/**\n * Returns `true` iff the current code generation position is located after terminator instruction.\n */"} {"signature":"override fun visit ( x : JsObjectLiteral , ctx : JsContext < JsNode > ) : Boolean","body":"= false","docstring":"/**\n * Prevents replacing returns in object literal\n */"} {"signature":"override fun visit ( x : JsFunction , ctx : JsContext < JsNode > ) : Boolean","body":"= false","docstring":"/**\n * Prevents replacing returns in inner function\n */"} {"signature":"public fun ConvertSchemaDsl < * > . convertDataRowsWithOpenApi ( )","body":"{ convert < DataRow < * > > ( ) . with < _ , Any ? > { it } convertIf ( { fromType , toSchema -> val ( fromIsRecursiveListOfDataFrame , fromDepth ) = fromType . isRecursiveListOfDataFrame ( ) val ( toIsRecursiveListOfDataFrame , toDepth ) = toSchema . type . isRecursiveListOfDataFrame ( ) fromIsRecursiveListOfDataFrame && toIsRecursiveListOfDataFrame && fromDepth == toDepth } ) { try { it . convertRecursiveListOfDataFrame ( toSchema . type ) { convertDataRowsWithOpenApi ( ) } } catch ( _ : Exception ) { it } } }","docstring":"/**\n * Function to be used in [ConvertSchemaDsl] ([DataFrame.convertTo]) to help convert a DataFrame to adhere to an\n * OpenApi schema. Is used in generated OpenAPI code.\n */"} {"signature":"private fun KType . isRecursiveListOfDataFrame ( depth : Int = ) : Pair < Boolean , Int >","body":"= when ( jvmErasure ) { typeOf < List < * > > ( ) . jvmErasure -> arguments [ ] . type ? . isRecursiveListOfDataFrame ( depth + ) ? : ( false to depth ) typeOf < DataFrame < * > > ( ) . jvmErasure -> true to depth typeOf < DataFrame < * > ? > ( ) . jvmErasure -> true to depth else -> false to depth }","docstring":"/**\n * @receiver [KType] to check if it is a recursive list of [DataFrame]s\n * @return [Pair] of result and the recursive depth.\n * `true` if Receiver is a recursive list of [DataFrame]s, like [List]<[List]<[DataFrame]<*>>>\n */"} {"signature":"private fun Any ? . convertRecursiveListOfDataFrame ( type : KType , convertTo : ConvertSchemaDsl < * > . ( ) -> Unit = { } , ) : Any ?","body":"= when ( this ) { is List < * > -> map { it ? . convertRecursiveListOfDataFrame ( type . arguments [ ] . type ! ! , convertTo ) } is DataFrame < * > -> convertTo ( schemaType = type . arguments [ ] . type ! ! , body = convertTo ) null -> null else -> throw IllegalArgumentException ( \"\" ) }","docstring":"/**\n * @receiver Recursive [List] of [DataFrame]s, like [List]<[List]<[DataFrame]<*>>>, for which to convert the [DataFrame]s.\n * @param type Type to which to convert the [DataFrame]s.\n * @param convertTo Optional [ConvertSchemaDsl] to use for the conversion.\n * @return Receiver with converted [DataFrame]s.\n */"} {"signature":"fun efficientNetB7LightAPIPrediction ( )","body":"{ val modelHub = ONNXModelHub ( cacheDirectory = File ( \"\" ) ) val model = ONNXModels . CV . EfficientNetB7 . pretrainedModel ( modelHub ) model . printSummary ( ) model . use { for ( i in .. ) { val imageFile = getFileFromResource ( \"\" ) val recognizedObject = it . predictObject ( imageFile = imageFile ) println ( recognizedObject ) val top5 = it . predictTopKObjects ( imageFile = imageFile , topK = ) println ( top5 . toString ( ) ) } } }","docstring":"/**\n * This examples demonstrates the light-weight inference API with [ImageRecognitionModel] on EfficientNetB7 model:\n * - Model is obtained from [ONNXModelHub].\n * - Model predicts on a few images located in resources.\n */"} {"signature":"fun main ( ) : Unit","body":"= efficientNetB7LightAPIPrediction ( )","docstring":"/** */"} {"signature":"public fun < R > CameraXCompatibleModel . doWithRotation ( rotation : Int , function : ( ) -> R ) : R","body":"{ val currentRotation = targetRotation targetRotation = rotation return function ( ) . apply { targetRotation = currentRotation } }","docstring":"/**\n * Convenience function to execute arbitrary code with a preliminary updated target rotation.\n * After the code is executed, the target rotation is restored to its original value.\n *\n * @param rotation target rotation to be set for the duration of the code execution\n * @param function arbitrary code to be executed\n */"} {"signature":"public fun getAllPossibleNames ( ) : Set < Name >","body":"= withValidityAssertion { getPossibleCallableNames ( ) + getPossibleClassifierNames ( ) }","docstring":"/**\n * Returns a **superset** of names which current scope may contain.\n * In other words `ALL_NAMES(scope)` is a subset of `scope.getAllNames()`\n */"} {"signature":"public fun getPossibleCallableNames ( ) : Set < Name >","body":"public fun getPossibleCallableNames ( ) : Set < Name >","docstring":"/**\n * Returns a **superset** of callable names which current scope may contain.\n * In other words `ALL_CALLABLE_NAMES(scope)` is a subset of `scope.getCallableNames()`\n */"} {"signature":"public fun getPossibleClassifierNames ( ) : Set < Name >","body":"public fun getPossibleClassifierNames ( ) : Set < Name >","docstring":"/**\n * Returns a **superset** of classifier names which current scope may contain.\n * In other words `ALL_CLASSIFIER_NAMES(scope)` is a subset of `scope.getClassifierNames()`\n */"} {"signature":"public fun mayContainName ( name : Name ) : Boolean","body":"= withValidityAssertion { name in getPossibleCallableNames ( ) || name in getPossibleClassifierNames ( ) }","docstring":"/**\n * return true if the scope may contain name, false otherwise.\n *\n * In other words `(mayContainName(name) == false) => (name !in scope)`; vice versa is not always true\n */"} {"signature":"@ Suppress ( \"\" ) @ kotlin . internal . InlineOnly public actual inline fun < T > ( suspend ( ) -> T ) . startCoroutineUninterceptedOrReturn ( completion : Continuation < T > ) : Any ?","body":"{ val wrappedCompletion = wrapWithContinuationImpl ( completion ) val function = this as? Function1 < Continuation < T > , Any ? > return if ( function == null ) startCoroutineUninterceptedOrReturnFallback ( this , wrappedCompletion ) else function . invoke ( wrappedCompletion ) }","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":"@ Suppress ( \"\" ) @ kotlin . internal . InlineOnly public actual inline fun < R , T > ( suspend R . ( ) -> T ) . startCoroutineUninterceptedOrReturn ( receiver : R , completion : Continuation < T > ) : Any ?","body":"{ val wrappedCompletion = wrapWithContinuationImpl ( completion ) val function = this as? Function2 < R , Continuation < T > , Any ? > return if ( function == null ) startCoroutineUninterceptedOrReturnFallback ( this , receiver , wrappedCompletion ) else function . invoke ( receiver , wrappedCompletion ) }","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 ( \"\" ) @ Suppress ( \"\" ) public actual fun < T > ( suspend ( ) -> T ) . createCoroutineUnintercepted ( completion : Continuation < T > ) : Continuation < Unit >","body":"{ val probeCompletion = probeCoroutineCreated ( completion ) return if ( this is BaseContinuationImpl ) create ( probeCompletion ) else createCoroutineFromSuspendFunction ( probeCompletion ) { this . startCoroutineUninterceptedOrReturn ( it ) } }","docstring":"/**\n * Creates unintercepted coroutine without receiver and with result type [T].\n * This function creates a new, fresh instance of suspendable computation every time it is invoked.\n *\n * To start executing the created coroutine, invoke `resume(Unit)` on the returned [Continuation] instance.\n * The [completion] continuation is invoked when coroutine completes with result or exception.\n *\n * This function returns unintercepted continuation.\n * Invocation of `resume(Unit)` starts coroutine immediately in the invoker's call stack without going through the\n * [ContinuationInterceptor] that might be present in the completion's [CoroutineContext].\n * It is the invoker's responsibility to ensure that a proper invocation context is established.\n * Note that [completion] of this function may get invoked in an arbitrary context.\n *\n * [Continuation.intercepted] can be used to acquire the intercepted continuation.\n * Invocation of `resume(Unit)` on intercepted continuation guarantees that execution of\n * both the coroutine and [completion] happens in the invocation context established by\n * [ContinuationInterceptor].\n *\n * Repeated invocation of any resume function on the resulting continuation corrupts the\n * state machine of the coroutine and may result in arbitrary behaviour or exception.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ Suppress ( \"\" ) public actual fun < R , T > ( suspend R . ( ) -> T ) . createCoroutineUnintercepted ( receiver : R , completion : Continuation < T > ) : Continuation < Unit >","body":"{ val probeCompletion = probeCoroutineCreated ( completion ) return if ( this is BaseContinuationImpl ) create ( receiver , probeCompletion ) else { createCoroutineFromSuspendFunction ( probeCompletion ) { this . startCoroutineUninterceptedOrReturn ( receiver , it ) } } }","docstring":"/**\n * Creates unintercepted coroutine with receiver type [R] and result type [T].\n * This function creates a new, fresh instance of suspendable computation every time it is invoked.\n *\n * To start executing the created coroutine, invoke `resume(Unit)` on the returned [Continuation] instance.\n * The [completion] continuation is invoked when coroutine completes with result or exception.\n *\n * This function returns unintercepted continuation.\n * Invocation of `resume(Unit)` starts coroutine immediately in the invoker's call stack without going through the\n * [ContinuationInterceptor] that might be present in the completion's [CoroutineContext].\n * It is the invoker's responsibility to ensure that a proper invocation context is established.\n * Note that [completion] of this function may get invoked in an arbitrary context.\n *\n * [Continuation.intercepted] can be used to acquire the intercepted continuation.\n * Invocation of `resume(Unit)` on intercepted continuation guarantees that execution of\n * both the coroutine and [completion] happens in the invocation context established by\n * [ContinuationInterceptor].\n *\n * Repeated invocation of any resume function on the resulting continuation corrupts the\n * state machine of the coroutine and may result in arbitrary behaviour or exception.\n */"} {"signature":"@ SinceKotlin ( \"\" ) public actual fun < T > Continuation < T > . intercepted ( ) : Continuation < T >","body":"= ( this as? ContinuationImpl ) ? . intercepted ( ) ? : this","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 ( \"\" ) @ Suppress ( \"\" ) private inline fun < T > createCoroutineFromSuspendFunction ( completion : Continuation < T > , crossinline block : ( Continuation < T > ) -> Any ? ) : Continuation < Unit >","body":"{ val context = completion . context return if ( context === EmptyCoroutineContext ) object : RestrictedContinuationImpl ( completion as Continuation < Any ? > ) { private var label = override fun invokeSuspend ( result : Result < Any ? > ) : Any ? = when ( label ) { -> { label = result . getOrThrow ( ) block ( this ) } -> { label = result . getOrThrow ( ) } else -> error ( \"\" ) } } else object : ContinuationImpl ( completion as Continuation < Any ? > , context ) { private var label = override fun invokeSuspend ( result : Result < Any ? > ) : Any ? = when ( label ) { -> { label = result . getOrThrow ( ) block ( this ) } -> { label = result . getOrThrow ( ) } else -> error ( \"\" ) } } }","docstring":"/**\n * This function is used when [createCoroutineUnintercepted] encounters suspending lambda that does not extend BaseContinuationImpl.\n *\n * It happens in two cases:\n * 1. Callable reference to suspending function,\n * 2. Suspending function reference implemented by Java code.\n *\n * We must wrap it into an instance that extends [BaseContinuationImpl], because that is an expectation of all coroutines machinery.\n * As an optimization we use lighter-weight [RestrictedContinuationImpl] base class (it has less fields) if the context is\n * [EmptyCoroutineContext], and a full-blown [ContinuationImpl] class otherwise.\n *\n * The instance of [BaseContinuationImpl] is passed to the [block] so that it can be passed to the corresponding invocation.\n */"} {"signature":"@ Suppress ( \"\" ) internal inline fun createContinuationArgumentFromCallback ( completion : Continuation < Unit > , crossinline callback : ( Result < Any ? > ) -> Unit ) : Continuation < Any ? >","body":"= object : ContinuationImpl ( completion as Continuation < Any ? > ) { private var invoked = false override fun invokeSuspend ( result : Result < Any ? > ) : Any ? { if ( invoked ) error ( \"\" ) invoked = true callback ( result ) return Unit } }","docstring":"/**\n * This function creates continuation suitable for passing as implicit argument to suspend functions.\n * The continuation calls [callback] and then delegates to [completion].\n *\n * The result is [ContinuationImpl] because that is an expectation of all coroutines machinery.\n *\n * It can be thought as a state machine of\n * ```\n * suspend fun foo() {\n * val result = runCatching { }\n * callback(result)\n * }\n * ```\n */"} {"signature":"@ Suppress ( \"\" ) private fun < T > createSimpleCoroutineForSuspendFunction ( completion : Continuation < T > ) : Continuation < T >","body":"{ val context = completion . context return if ( context === EmptyCoroutineContext ) object : RestrictedContinuationImpl ( completion as Continuation < Any ? > ) { override fun invokeSuspend ( result : Result < Any ? > ) : Any ? { return result . getOrThrow ( ) } } else object : ContinuationImpl ( completion as Continuation < Any ? > , context ) { override fun invokeSuspend ( result : Result < Any ? > ) : Any ? { return result . getOrThrow ( ) } } }","docstring":"/**\n * This function is used when [startCoroutineUninterceptedOrReturn] encounters suspending lambda that does not extend BaseContinuationImpl.\n *\n * It happens in two cases: callable reference to suspending function or tail-call lambdas.\n *\n * This function is the same as above, but does not run lambda itself - the caller is expected to call [invoke] manually.\n */"} {"signature":"@ JvmName ( \"\" ) public fun < D : Dim2 > LinAlg . solve ( a : MultiArray < Float , D2 > , b : MultiArray < Float , D > ) : NDArray < Float , D >","body":"= this . linAlgEx . solveF ( a , b )","docstring":"/**\n * Solves a linear matrix equation, or system of linear scalar equations.\n */"} {"signature":"@ JvmName ( \"\" ) public fun < T : Number , D : Dim2 > LinAlg . solve ( a : MultiArray < T , D2 > , b : MultiArray < T , D > ) : NDArray < Double , D >","body":"= this . linAlgEx . solve ( a , b )","docstring":"/**\n * Solves a linear matrix equation, or system of linear scalar equations.\n */"} {"signature":"@ JvmName ( \"\" ) public fun < T : Complex , D : Dim2 > LinAlg . solve ( a : MultiArray < T , D2 > , b : MultiArray < T , D > ) : NDArray < T , D >","body":"= this . linAlgEx . solveC ( a , b )","docstring":"/**\n * Solves a linear matrix equation, or system of linear scalar equations.\n */"} {"signature":"@ HtmlTagMarker inline fun OBJECT . param ( name : String ? = null , value : String ? = null , crossinline block : PARAM . ( ) -> Unit = { } ) : Unit","body":"= PARAM ( attributesMapOf ( \"\" , name , \"\" , value ) , consumer ) . visit ( block )","docstring":"/**\n * Named property value\n */"} {"signature":"@ HtmlTagMarker inline fun OL . li ( classes : String ? = null , crossinline block : LI . ( ) -> Unit = { } ) : Unit","body":"= LI ( attributesMapOf ( \"\" , classes ) , consumer ) . visit ( block )","docstring":"/**\n * List item\n */"} {"signature":"@ HtmlTagMarker inline fun OPTGROUP . option ( classes : String ? = null , crossinline block : OPTION . ( ) -> Unit = { } ) : Unit","body":"= OPTION ( attributesMapOf ( \"\" , classes ) , consumer ) . visit ( block )","docstring":"/**\n * Selectable choice\n */"} {"signature":"@ HtmlTagMarker fun OPTGROUP . option ( classes : String ? = null , content : String = \"\" ) : Unit","body":"= OPTION ( attributesMapOf ( \"\" , classes ) , consumer ) . visit ( { + content } )","docstring":"/**\n * Selectable choice\n */"} {"signature":"internal fun PhaseEngine < NativeGenerationState > . runAllLowerings ( irModuleFragment : IrModuleFragment )","body":"{ val lowerings = getAllLowerings ( ) irModuleFragment . files . forEach { file -> context . fileLowerState = FileLowerState ( ) lowerings . fold ( file ) { loweredFile , lowering -> runPhase ( lowering , loweredFile ) } } }","docstring":"/**\n * Run whole IR lowering pipeline over [irModuleFragment].\n */"} {"signature":"internal fun addBuildEventsListenerRegistryMock ( project : Project )","body":"{ val executedExtensionKey = \"\" try { if ( project . findExtension < Boolean > ( executedExtensionKey ) == true ) return val projectScopeServices = ( project as DefaultProject ) . services as ProjectScopeServices val state : Field = ProjectScopeServices :: class . java . superclass . getDeclaredField ( \"\" ) state . isAccessible = true @ Suppress ( \"\" ) val stateValue : AtomicReference < Any > = state . get ( projectScopeServices ) as AtomicReference < Any > val enumClass = Class . forName ( DefaultServiceRegistry :: class . java . name + \"\" ) stateValue . set ( enumClass . enumConstants [ ] ) projectScopeServices . add ( BuildEventsListenerRegistry :: class . java , BuildEventsListenerRegistryMock ) stateValue . set ( enumClass . enumConstants [ ] ) project . addExtension ( executedExtensionKey , true ) } catch ( e : Throwable ) { throw RuntimeException ( e ) } }","docstring":"/**\n * In Gradle 6.7-rc-1 BuildEventsListenerRegistry service is not created in we need it in order\n * to instantiate AGP. This creates a fake one and injects it - http://b/168630734.\n * https://github.com/gradle/gradle/issues/16774 (Waiting for Gradle 7.5)\n */"} {"signature":"internal 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":"internal fun Char . digitToIntImpl ( ) : Int","body":"{ val ch = this . code val index = binarySearchRange ( rangeStart , ch ) val diff = ch - rangeStart [ index ] return if ( diff < ) diff else - }","docstring":"/**\n * Returns an integer from 0..9 indicating the digit this character represents,\n * or -1 if this character is not a digit.\n */"} {"signature":"internal fun Char . isDigitImpl ( ) : Boolean","body":"{ return digitToIntImpl ( ) >= }","docstring":"/**\n * Returns `true` if this character is a digit.\n */"} {"signature":"private infix fun < T : Comparable < T > > ClosedRange < T > . joinable ( other : ClosedRange < T > ) : Boolean","body":"{ return ( other . start in this ) || ( other . endInclusive in this ) || ( start in other ) }","docstring":"/**\n * Additional range functions\n */"} {"signature":"@ Test fun createZeroFilledByteArray ( )","body":"{ val size = val a = mk . zeros < Byte > ( size ) assertEquals ( size , a . size ) assertEquals ( size , a . data . size ) assertTrue { a . all { it == . toByte ( ) } } }","docstring":"/**\n * This method checks if a byte array of a given size is correctly created with all elements set to zero.\n */"} {"signature":"@ Test fun createByteArrayFilledWithOnes ( )","body":"{ val size = val a = mk . ones < Byte > ( size ) assertEquals ( size , a . size ) assertEquals ( size , a . data . size ) assertTrue { a . all { it == . toByte ( ) } } }","docstring":"/**\n * Creates a byte array filled with ones of a given size and checks if all elements are set to one.\n */"} {"signature":"@ Test fun createOneDimensionalArrayFromByteList ( )","body":"{ val list = listOf < Byte > ( , , , , ) val a : D1Array < Byte > = mk . ndarray ( list ) assertEquals ( list , a . toList ( ) ) }","docstring":"/**\n * Creates a one-dimensional array from a list of bytes\n * and checks if the array's list representation matches the input list.\n */"} {"signature":"@ Test fun createOneDimensionalArrayFromByteSet ( )","body":"{ val set = setOf < Byte > ( , , , , ) val a : D1Array < Byte > = mk . ndarray ( set , shape = intArrayOf ( ) ) assertEquals ( set . size , a . size ) assertEquals ( set , a . toSet ( ) ) }","docstring":"/**\n * Creates a one-dimensional array from a set of bytes\n * and checks if the array's set representation matches the input set.\n */"} {"signature":"@ Test fun createOneDimensionalArrayFromPrimitiveByteArray ( )","body":"{ val array = byteArrayOf ( , , , , ) val a : D1Array < Byte > = mk . ndarray ( array ) assertEquals ( array . size , a . size ) a . data . getByteArray ( ) shouldBe array }","docstring":"/**\n * Creates a one-dimensional array from a primitive ByteArray\n * and checks if the array's ByteArray representation matches the input ByteArray.\n */"} {"signature":"@ Test fun createByte1DArrayWithInitializationFunction ( )","body":"{ val a = mk . d1array < Byte > ( ) { ( it + ) . toByte ( ) } val expected = byteArrayOf ( , , , , ) assertEquals ( expected . size , a . size ) a . data . getByteArray ( ) shouldBe expected }","docstring":"/**\n * Creates a one-dimensional array with a given size using an initialization function\n * and checks if the array's ByteArray representation matches the expected output.\n */"} {"signature":"@ Test fun createByte1DArrayWithNdarrayOf ( )","body":"{ val a : D1Array < Byte > = mk . ndarrayOf ( . toByte ( ) , . toByte ( ) , . toByte ( ) , . toByte ( ) , . toByte ( ) ) val expected = byteArrayOf ( , , , , ) assertEquals ( expected . size , a . size ) a . data . getByteArray ( ) shouldBe expected }","docstring":"/**\n * Creates a one-dimensional array with a given size from bytes\n * and checks if the array's ByteArray representation matches the expected output.\n */"} {"signature":"@ Test fun generateArangeByteArrayWithStep ( )","body":"{ val a = mk . arange < Byte > ( , , step = ) val expected = byteArrayOf ( , , , ) assertEquals ( expected . size , a . size ) a . data . getByteArray ( ) shouldBe expected }","docstring":"/**\n * Tests the function `arange` for the Byte type.\n * The function is supposed to generate an array starting from 3, ending before 10, with a step of 2.\n * The created array is then checked against an expected array for both size and element equality.\n */"} {"signature":"@ Test fun generateArangeByteArrayWithNonIntegerStep ( )","body":"{ val a = mk . arange < Byte > ( , , step = ) val expected = byteArrayOf ( , , ) assertEquals ( expected . size , a . size ) a . data . getByteArray ( ) shouldBe expected }","docstring":"/**\n * Tests the function `arange` for the Byte type.\n * The function is supposed to generate an array starting from 3, ending before 10, with a non-integer step of 2.5.\n * The created array is then checked against an expected array for both size and element equality.\n */"} {"signature":"@ Test fun generateArangeByteArrayWithDefaultStart ( )","body":"{ val a = mk . arange < Byte > ( , step = ) val expected = byteArrayOf ( , , , , ) assertEquals ( expected . size , a . size ) a . data . getByteArray ( ) shouldBe expected }","docstring":"/**\n * Tests the function `arange` for the Byte type.\n * The function is supposed to generate an array starting from the default start value of 0,\n * ending before 10, with a step of 2.\n * The created array is then checked against an expected array for both size and element equality.\n */"} {"signature":"@ Test fun generateArangeByteArrayWithDefaultStartAndNonIntegerStep ( )","body":"{ val a = mk . arange < Byte > ( , step = ) val expected = byteArrayOf ( , , , , ) assertEquals ( expected . size , a . size ) a . data . getByteArray ( ) shouldBe expected }","docstring":"/**\n * Tests the function `arange` for the Byte type.\n * The function is supposed to generate an array starting from the default start value of 0,\n * ending before 10, with a non-integer step of 2.3.\n * The created array is then checked against an expected array for both size and element equality.\n */"} {"signature":"@ Test fun generateLinspaceByteArray ( )","body":"{ val a = mk . linspace < Byte > ( , , num = ) val expected = byteArrayOf ( , , , , , , , , , , , , , , ) assertEquals ( expected . size , a . size ) a . data . getByteArray ( ) shouldBe expected }","docstring":"/**\n * Tests the function `linspace` for the Byte type.\n * The function is supposed to generate an array of 15 elements evenly spaced from 3 to 10 inclusive.\n * The created array is then checked against an expected array for both size and element equality.\n */"} {"signature":"@ Test fun generateLinspaceByteArrayWithNonIntegerBounds ( )","body":"{ val a = mk . linspace < Byte > ( , , num = ) val expected = byteArrayOf ( , , , , , , , , , , , , , , ) assertEquals ( expected . size , a . size ) a . data . getByteArray ( ) shouldBe expected }","docstring":"/**\n * Tests the function `linspace` for the Byte type.\n * The function is supposed to generate an array of 15 elements evenly spaced from 1.7 to 13.8 inclusive.\n * The created array is then checked against an expected array for both size and element equality.\n */"} {"signature":"@ Test fun convertIterableToByteArrayNDArray ( )","body":"{ val expected = listOf < Byte > ( , , , , ) val a = expected . toNDArray ( ) assertEquals ( expected . size , a . size ) assertEquals ( expected , a . toList ( ) ) }","docstring":"/**\n * Tests the function `toNDArray` which converts an Iterable to a one-dimensional NDArray.\n * The test creates a list of bytes, converts it to an NDArray,\n * and then checks that the size and elements of the NDArray match those of the original list.\n */"} {"signature":"@ Test fun createZeroFilledShortArray ( )","body":"{ val size = val a = mk . zeros < Short > ( size ) assertEquals ( size , a . size ) assertEquals ( size , a . data . size ) assertTrue { a . all { it == . toShort ( ) } } }","docstring":"/**\n * This method checks if a short array of a given size is correctly created with all elements set to zero.\n */"} {"signature":"@ Test fun createShortArrayFilledWithOnes ( )","body":"{ val size = val a = mk . ones < Short > ( size ) assertEquals ( size , a . size ) assertEquals ( size , a . data . size ) assertTrue { a . all { it == . toShort ( ) } } }","docstring":"/**\n * Creates a short array filled with ones of a given size and checks if all elements are set to one.\n */"} {"signature":"@ Test fun createOneDimensionalArrayFromShortList ( )","body":"{ val list = listOf < Short > ( , , , , ) val a : D1Array < Short > = mk . ndarray ( list ) assertEquals ( list , a . toList ( ) ) }","docstring":"/**\n * Creates a one-dimensional array from a list of shorts\n * and checks if the array's list representation matches the input list.\n */"} {"signature":"@ Test @ Ignore fun createOneDimensionalArrayFromShortSet ( )","body":"{ val set = setOf < Short > ( , , , , ) val a : D1Array < Short > = mk . ndarray ( set , shape = intArrayOf ( ) ) assertEquals ( set . size , a . size ) assertEquals ( set , a . toSet ( ) ) }","docstring":"/**\n * Creates a one-dimensional array from a set of shorts\n * and checks if the array's set representation matches the input set.\n */"} {"signature":"@ Test fun createOneDimensionalArrayFromPrimitiveShortArray ( )","body":"{ val array = shortArrayOf ( , , , , ) val a : D1Array < Short > = mk . ndarray ( array ) assertEquals ( array . size , a . size ) a . data . getShortArray ( ) shouldBe array }","docstring":"/**\n * Creates a one-dimensional array from a primitive ShortArray\n * and checks if the array's ShortArray representation matches the input ShortArray.\n */"} {"signature":"@ Test fun createShort1DArrayWithInitializationFunction ( )","body":"{ val a = mk . d1array < Short > ( ) { ( it + ) . toShort ( ) } val expected = shortArrayOf ( , , , , ) assertEquals ( expected . size , a . size ) a . data . getShortArray ( ) shouldBe expected }","docstring":"/**\n * Creates a one-dimensional array with a given size using an initialization function\n * and checks if the array's ShortArray representation matches the expected output.\n */"} {"signature":"@ Test fun createShort1DArrayWithNdarrayOf ( )","body":"{ val a : D1Array < Short > = mk . ndarrayOf ( . toShort ( ) , . toShort ( ) , . toShort ( ) , . toShort ( ) , . toShort ( ) ) val expected = shortArrayOf ( , , , , ) assertEquals ( expected . size , a . size ) a . data . getShortArray ( ) shouldBe expected }","docstring":"/**\n * Creates a one-dimensional array with a given size from shorts\n * and checks if the array's ShortArray representation matches the expected output.\n */"} {"signature":"@ Test fun generateArangeShortArrayWithStep ( )","body":"{ val a = mk . arange < Short > ( , , step = ) val expected = shortArrayOf ( , , , ) assertEquals ( expected . size , a . size ) a . data . getShortArray ( ) shouldBe expected }","docstring":"/**\n * Tests the function `arange` for the Short type.\n * The function is supposed to generate an array starting from 3, ending before 10, with a step of 2.\n * The created array is then checked against an expected array for both size and element equality.\n */"} {"signature":"@ Test fun generateArangeShortArrayWithNonIntegerStep ( )","body":"{ val a = mk . arange < Short > ( , , step = ) val expected = shortArrayOf ( , , ) assertEquals ( expected . size , a . size ) a . data . getShortArray ( ) shouldBe expected }","docstring":"/**\n * Tests the function `arange` for the Short type.\n * The function is supposed to generate an array starting from 3, ending before 10, with a non-integer step of 2.5.\n * The created array is then checked against an expected array for both size and element equality.\n */"} {"signature":"@ Test fun generateArangeShortArrayWithDefaultStart ( )","body":"{ val a = mk . arange < Short > ( , step = ) val expected = shortArrayOf ( , , , , ) assertEquals ( expected . size , a . size ) a . data . getShortArray ( ) shouldBe expected }","docstring":"/**\n * Tests the function `arange` for the Short type.\n * The function is supposed to generate an array starting from the default start value of 0,\n * ending before 10, with a step of 2.\n * The created array is then checked against an expected array for both size and element equality.\n */"} {"signature":"@ Test fun generateArangeShortArrayWithDefaultStartAndNonIntegerStep ( )","body":"{ val a = mk . arange < Short > ( , step = ) val expected = shortArrayOf ( , , , , ) assertEquals ( expected . size , a . size ) a . data . getShortArray ( ) shouldBe expected }","docstring":"/**\n * Tests the function `arange` for the Short type.\n * The function is supposed to generate an array starting from the default start value of 0,\n * ending before 10, with a non-integer step of 2.3.\n * The created array is then checked against an expected array for both size and element equality.\n */"} {"signature":"@ Test fun generateLinspaceShortArray ( )","body":"{ val a = mk . linspace < Short > ( , , num = ) val expected = shortArrayOf ( , , , , , , , , , , , , , , ) assertEquals ( expected . size , a . size ) a . data . getShortArray ( ) shouldBe expected }","docstring":"/**\n * Tests the function `linspace` for the Short type.\n * The function is supposed to generate an array of 15 elements evenly spaced from 3 to 10 inclusive.\n * The created array is then checked against an expected array for both size and element equality.\n */"} {"signature":"@ Test fun generateLinspaceShortArrayWithNonIntegerBounds ( )","body":"{ val a = mk . linspace < Short > ( , , num = ) val expected = shortArrayOf ( , , , , , , , , , , , , , , ) assertEquals ( expected . size , a . size ) a . data . getShortArray ( ) shouldBe expected }","docstring":"/**\n * Tests the function `linspace` for the Short type.\n * The function is supposed to generate an array of 15 elements evenly spaced from 1.7 to 13.8 inclusive.\n * The created array is then checked against an expected array for both size and element equality.\n */"} {"signature":"@ Test @ Ignore fun convertIterableToShortArrayNDArray ( )","body":"{ val expected = listOf < Short > ( , , , , ) val a = expected . toNDArray ( ) assertEquals ( expected . size , a . size ) assertEquals ( expected , a . toList ( ) ) }","docstring":"/**\n * Tests the function `toNDArray` which converts an Iterable to a one-dimensional NDArray.\n * The test creates a list of Shorts, converts it to an NDArray,\n * and then checks that the size and elements of the NDArray match those of the original list.\n */"} {"signature":"@ Test fun createZeroFilledIntArray ( )","body":"{ val size = val a = mk . zeros < Int > ( size ) assertEquals ( size , a . size ) assertEquals ( size , a . data . size ) assertTrue { a . all { it == } } }","docstring":"/**\n * This method checks if an integer array of a given size is correctly created with all elements set to zero.\n */"} {"signature":"@ Test fun createIntArrayFilledWithOnes ( )","body":"{ val size = val a = mk . ones < Int > ( size ) assertEquals ( size , a . size ) assertEquals ( size , a . data . size ) assertTrue { a . all { it == } } }","docstring":"/**\n * Creates an integer array filled with ones of a given size and checks if all elements are set to one.\n */"} {"signature":"@ Test fun createOneDimensionalArrayFromIntList ( )","body":"{ val list = listOf ( , , , , ) val a : D1Array < Int > = mk . ndarray ( list ) assertEquals ( list , a . toList ( ) ) }","docstring":"/**\n * Creates a one-dimensional array from a list of integers\n * and checks if the array's list representation matches the input list.\n */"} {"signature":"@ Test fun createOneDimensionalArrayFromIntSet ( )","body":"{ val set = setOf ( , , , , ) val a : D1Array < Int > = mk . ndarray ( set , shape = intArrayOf ( ) ) assertEquals ( set . size , a . size ) assertEquals ( set , a . toSet ( ) ) }","docstring":"/**\n * Creates a one-dimensional array from a set of integers\n * and checks if the array's set representation matches the input set.\n */"} {"signature":"@ Test fun createOneDimensionalArrayFromPrimitiveIntArray ( )","body":"{ val array = intArrayOf ( , , , , ) val a : D1Array < Int > = mk . ndarray ( array ) assertEquals ( array . size , a . size ) a . data . getIntArray ( ) shouldBe array }","docstring":"/**\n * Creates a one-dimensional array from a primitive IntArray\n * and checks if the array's IntArray representation matches the input IntArray.\n */"} {"signature":"@ Test fun createInt1DArrayWithInitializationFunction ( )","body":"{ val a = mk . d1array < Int > ( ) { ( it + ) } val expected = intArrayOf ( , , , , ) assertEquals ( expected . size , a . size ) a . data . getIntArray ( ) shouldBe expected }","docstring":"/**\n * Creates a one-dimensional array with a given size using an initialization function\n * and checks if the array's IntArray representation matches the expected output.\n */"} {"signature":"@ Test fun createInt1DArrayWithNdarrayOf ( )","body":"{ val a : D1Array < Int > = mk . ndarrayOf ( , , , , ) val expected = intArrayOf ( , , , , ) assertEquals ( expected . size , a . size ) a . data . getIntArray ( ) shouldBe expected }","docstring":"/**\n * Creates a one-dimensional array with a given size from integers\n * and checks if the array's IntArray representation matches the expected output.\n */"} {"signature":"@ Test fun generateArangeIntArrayWithStep ( )","body":"{ val a = mk . arange < Int > ( , , step = ) val expected = intArrayOf ( , , , ) assertEquals ( expected . size , a . size ) a . data . getIntArray ( ) shouldBe expected }","docstring":"/**\n * Tests the function `arange` for the Int type.\n * The function is supposed to generate an array starting from 3, ending before 10, with a step of 2.\n * The created array is then checked against an expected array for both size and element equality.\n */"} {"signature":"@ Test fun generateArangeIntArrayWithNonIntegerStep ( )","body":"{ val a = mk . arange < Int > ( , , step = ) val expected = intArrayOf ( , , ) assertEquals ( expected . size , a . size ) a . data . getIntArray ( ) shouldBe expected }","docstring":"/**\n * Tests the function `arange` for the Int type.\n * The function is supposed to generate an array starting from 3, ending before 10, with a non-integer step of 2.5.\n * The created array is then checked against an expected array for both size and element equality.\n */"} {"signature":"@ Test fun generateArangeIntArrayWithDefaultStart ( )","body":"{ val a = mk . arange < Int > ( , step = ) val expected = intArrayOf ( , , , , ) assertEquals ( expected . size , a . size ) a . data . getIntArray ( ) shouldBe expected }","docstring":"/**\n * Tests the function `arange` for the Int type.\n * The function is supposed to generate an array starting from the default start value of 0,\n * ending before 10, with a step of 2.\n * The created array is then checked against an expected array for both size and element equality.\n */"} {"signature":"@ Test fun generateArangeIntArrayWithDefaultStartAndNonIntegerStep ( )","body":"{ val a = mk . arange < Int > ( , step = ) val expected = intArrayOf ( , , , , ) assertEquals ( expected . size , a . size ) a . data . getIntArray ( ) shouldBe expected }","docstring":"/**\n * Tests the function `arange` for the Int type.\n * The function is supposed to generate an array starting from the default start value of 0,\n * ending before 10, with a non-integer step of 2.3.\n * The created array is then checked against an expected array for both size and element equality.\n */"} {"signature":"@ Test fun generateLinspaceIntArray ( )","body":"{ val a = mk . linspace < Int > ( , , num = ) val expected = intArrayOf ( , , , , , , , , , , , , , , ) assertEquals ( expected . size , a . size ) a . data . getIntArray ( ) shouldBe expected }","docstring":"/**\n * Tests the function `linspace` for the Int type.\n * The function is supposed to generate an array of 15 elements evenly spaced from 3 to 10 inclusive.\n * The created array is then checked against an expected array for both size and element equality.\n */"} {"signature":"@ Test fun generateLinspaceIntArrayWithNonIntegerBounds ( )","body":"{ val a = mk . linspace < Int > ( , , num = ) val expected = intArrayOf ( , , , , , , , , , , , , , , ) assertEquals ( expected . size , a . size ) a . data . getIntArray ( ) shouldBe expected }","docstring":"/**\n * Tests the function `linspace` for the Int type.\n * The function is supposed to generate an array of 15 elements evenly spaced from 1.7 to 13.8 inclusive.\n * The created array is then checked against an expected array for both size and element equality.\n */"} {"signature":"@ Test fun convertIterableToIntArrayNDArray ( )","body":"{ val expected = listOf ( , , , , ) val a = expected . toNDArray ( ) assertEquals ( expected . size , a . size ) assertEquals ( expected , a . toList ( ) ) }","docstring":"/**\n * Tests the function `toNDArray` which converts an Iterable to a one-dimensional NDArray.\n * The test creates a list of Ints, converts it to an NDArray,\n * and then checks that the size and elements of the NDArray match those of the original list.\n */"} {"signature":"@ Test fun createZeroFilledLongArray ( )","body":"{ val size = val a = mk . zeros < Long > ( size ) assertEquals ( size , a . size ) assertEquals ( size , a . data . size ) assertTrue { a . all { it == } } }","docstring":"/**\n * This method checks if a long array of a given size is correctly created with all elements set to zero.\n */"} {"signature":"@ Test fun createLongArrayFilledWithOnes ( )","body":"{ val size = val a = mk . ones < Long > ( size ) assertEquals ( size , a . size ) assertEquals ( size , a . data . size ) assertTrue { a . all { it == } } }","docstring":"/**\n * Creates a long array filled with ones of a given size and checks if all elements are set to one.\n */"} {"signature":"@ Test fun createOneDimensionalArrayFromLongList ( )","body":"{ val list = listOf < Long > ( , , , , ) val a : D1Array < Long > = mk . ndarray ( list ) assertEquals ( list , a . toList ( ) ) }","docstring":"/**\n * Creates a one-dimensional array from a list of longs\n * and checks if the array's list representation matches the input list.\n */"} {"signature":"@ Test fun createOneDimensionalArrayFromLongSet ( )","body":"{ val set = setOf < Long > ( , , , , ) val a : D1Array < Long > = mk . ndarray ( set , shape = intArrayOf ( ) ) assertEquals ( set . size , a . size ) assertEquals ( set , a . toSet ( ) ) }","docstring":"/**\n * Creates a one-dimensional array from a set of longs\n * and checks if the array's set representation matches the input set.\n */"} {"signature":"@ Test fun createOneDimensionalArrayFromPrimitiveLongArray ( )","body":"{ val array = longArrayOf ( , , , , ) val a : D1Array < Long > = mk . ndarray ( array ) assertEquals ( array . size , a . size ) a . data . getLongArray ( ) shouldBe array }","docstring":"/**\n * Creates a one-dimensional array from a primitive LongArray\n * and checks if the array's LongArray representation matches the input LongArray.\n */"} {"signature":"@ Test fun createLong1DArrayWithInitializationFunction ( )","body":"{ val a = mk . d1array < Long > ( ) { it + } val expected = longArrayOf ( , , , , ) assertEquals ( expected . size , a . size ) a . data . getLongArray ( ) shouldBe expected }","docstring":"/**\n * Creates a one-dimensional array with a given size using an initialization function\n * and checks if the array's LongArray representation matches the expected output.\n */"} {"signature":"@ Test fun createLong1DArrayWithNdarrayOf ( )","body":"{ val a : D1Array < Long > = mk . ndarrayOf ( , , , , ) val expected = longArrayOf ( , , , , ) assertEquals ( expected . size , a . size ) a . data . getLongArray ( ) shouldBe expected }","docstring":"/**\n * Creates a one-dimensional array with a given size from longs\n * and checks if the array's LongArray representation matches the expected output.\n */"} {"signature":"@ Test fun generateArangeLongArrayWithStep ( )","body":"{ val a = mk . arange < Long > ( , , step = ) val expected = longArrayOf ( , , , ) assertEquals ( expected . size , a . size ) a . data . getLongArray ( ) shouldBe expected }","docstring":"/**\n * Tests the function `arange` for the Long type.\n * The function is supposed to generate an array starting from 3, ending before 10, with a step of 2.\n * The created array is then checked against an expected array for both size and element equality.\n */"} {"signature":"@ Test fun generateArangeLongArrayWithNonIntegerStep ( )","body":"{ val a = mk . arange < Long > ( , , step = ) val expected = longArrayOf ( , , ) assertEquals ( expected . size , a . size ) a . data . getLongArray ( ) shouldBe expected }","docstring":"/**\n * Tests the function `arange` for the Long type.\n * The function is supposed to generate an array starting from 3, ending before 10, with a non-integer step of 2.5.\n * The created array is then checked against an expected array for both size and element equality.\n */"} {"signature":"@ Test fun generateArangeLongArrayWithDefaultStart ( )","body":"{ val a = mk . arange < Long > ( , step = ) val expected = longArrayOf ( , , , , ) assertEquals ( expected . size , a . size ) a . data . getLongArray ( ) shouldBe expected }","docstring":"/**\n * Tests the function `arange` for the Long type.\n * The function is supposed to generate an array starting from the default start value of 0,\n * ending before 10, with a step of 2.\n * The created array is then checked against an expected array for both size and element equality.\n */"} {"signature":"@ Test fun generateArangeLongArrayWithDefaultStartAndNonIntegerStep ( )","body":"{ val a = mk . arange < Long > ( , step = ) val expected = longArrayOf ( , , , , ) assertEquals ( expected . size , a . size ) a . data . getLongArray ( ) shouldBe expected }","docstring":"/**\n * Tests the function `arange` for the Long type.\n * The function is supposed to generate an array starting from the default start value of 0,\n * ending before 10, with a non-integer step of 2.3.\n * The created array is then checked against an expected array for both size and element equality.\n */"} {"signature":"@ Test fun generateLinspaceLongArray ( )","body":"{ val a = mk . linspace < Long > ( , , num = ) val expected = longArrayOf ( , , , , , , , , , , , , , , ) assertEquals ( expected . size , a . size ) a . data . getLongArray ( ) shouldBe expected }","docstring":"/**\n * Tests the function `linspace` for the Long type.\n * The function is supposed to generate an array of 15 elements evenly spaced from 3 to 10 inclusive.\n * The created array is then checked against an expected array for both size and element equality.\n */"} {"signature":"@ Test fun generateLinspaceLongArrayWithNonIntegerBounds ( )","body":"{ val a = mk . linspace < Long > ( , , num = ) val expected = longArrayOf ( , , , , , , , , , , , , , , ) assertEquals ( expected . size , a . size ) a . data . getLongArray ( ) shouldBe expected }","docstring":"/**\n * Tests the function `linspace` for the Long type.\n * The function is supposed to generate an array of 15 elements evenly spaced from 1.7 to 13.8 inclusive.\n * The created array is then checked against an expected array for both size and element equality.\n */"} {"signature":"@ Test fun convertIterableToLongArrayNDArray ( )","body":"{ val expected = listOf < Long > ( , , , , ) val a = expected . toNDArray ( ) assertEquals ( expected . size , a . size ) assertEquals ( expected , a . toList ( ) ) }","docstring":"/**\n * Tests the function `toNDArray` which converts an Iterable to a one-dimensional NDArray.\n * The test creates a list of Longs, converts it to an NDArray,\n * and then checks that the size and elements of the NDArray match those of the original list.\n */"} {"signature":"@ Test fun createZeroFilledFloatArray ( )","body":"{ val size = val a = mk . zeros < Float > ( size ) assertEquals ( size , a . size ) assertEquals ( size , a . data . size ) assertTrue { a . all { it == } } }","docstring":"/**\n * This method checks if a float array of a given size is correctly created with all elements set to zero.\n */"} {"signature":"@ Test fun createFloatArrayFilledWithOnes ( )","body":"{ val size = val a = mk . ones < Float > ( size ) assertEquals ( size , a . size ) assertEquals ( size , a . data . size ) assertTrue { a . all { it == } } }","docstring":"/**\n * Creates a float array filled with ones of a given size and checks if all elements are set to one.\n */"} {"signature":"@ Test fun createOneDimensionalArrayFromFloatList ( )","body":"{ val list = listOf ( , , , , ) val a : D1Array < Float > = mk . ndarray ( list ) assertEquals ( list , a . toList ( ) ) }","docstring":"/**\n * Creates a one-dimensional array from a list of floats\n * and checks if the array's list representation matches the input list.\n */"} {"signature":"@ Test fun createOneDimensionalArrayFromFloatSet ( )","body":"{ val set = setOf ( , , , , ) val a : D1Array < Float > = mk . ndarray ( set , shape = intArrayOf ( ) ) assertEquals ( set . size , a . size ) assertEquals ( set , a . toSet ( ) ) }","docstring":"/**\n * Creates a one-dimensional array from a set of floats\n * and checks if the array's set representation matches the input set.\n */"} {"signature":"@ Test fun createOneDimensionalArrayFromPrimitiveFloatArray ( )","body":"{ val array = floatArrayOf ( , , , , ) val a : D1Array < Float > = mk . ndarray ( array ) assertEquals ( array . size , a . size ) a . data . getFloatArray ( ) shouldBe array }","docstring":"/**\n * Creates a one-dimensional array from a primitive FloatArray\n * and checks if the array's FloatArray representation matches the input FloatArray.\n */"} {"signature":"@ Test fun createFloat1DArrayWithInitializationFunction ( )","body":"{ val a = mk . d1array < Float > ( ) { it + } val expected = floatArrayOf ( , , , , ) assertEquals ( expected . size , a . size ) a . data . getFloatArray ( ) shouldBe expected }","docstring":"/**\n * Creates a one-dimensional array with a given size using an initialization function\n * and checks if the array's FloatArray representation matches the expected output.\n */"} {"signature":"@ Test fun createFloat1DArrayWithNdarrayOf ( )","body":"{ val a : D1Array < Float > = mk . ndarrayOf ( , , , , ) val expected = floatArrayOf ( , , , , ) assertEquals ( expected . size , a . size ) a . data . getFloatArray ( ) shouldBe expected }","docstring":"/**\n * Creates a one-dimensional array with a given size from floats\n * and checks if the array's FloatArray representation matches the expected output.\n */"} {"signature":"@ Test fun generateArangeFloatArrayWithStep ( )","body":"{ val a = mk . arange < Float > ( , , step = ) val expected = floatArrayOf ( , , , ) assertEquals ( expected . size , a . size ) a . data . getFloatArray ( ) shouldBe expected }","docstring":"/**\n * Tests the function `arange` for the Float type.\n * The function is supposed to generate an array starting from 3, ending before 10, with a step of 2.\n * The created array is then checked against an expected array for both size and element equality.\n */"} {"signature":"@ Test fun generateArangeFloatArrayWithNonIntegerStep ( )","body":"{ val a = mk . arange < Float > ( , , step = ) val expected = floatArrayOf ( , , ) assertEquals ( expected . size , a . size ) a . data . getFloatArray ( ) shouldBe expected }","docstring":"/**\n * Tests the function `arange` for the Float type.\n * The function is supposed to generate an array starting from 3, ending before 10, with a non-integer step of 2.5.\n * The created array is then checked against an expected array for both size and element equality.\n */"} {"signature":"@ Test fun generateArangeFloatArrayWithDefaultStart ( )","body":"{ val a = mk . arange < Float > ( , step = ) val expected = floatArrayOf ( , , , , ) assertEquals ( expected . size , a . size ) a . data . getFloatArray ( ) shouldBe expected }","docstring":"/**\n * Tests the function `arange` for the Float type.\n * The function is supposed to generate an array starting from the default start value of 0,\n * ending before 10, with a step of 2.\n * The created array is then checked against an expected array for both size and element equality.\n */"} {"signature":"@ Test fun generateArangeFloatArrayWithDefaultStartAndNonIntegerStep ( )","body":"{ val a = mk . arange < Float > ( , step = ) val expected = floatArrayOf ( , , , , ) assertEquals ( expected . size , a . size ) a . data . getFloatArray ( ) shouldBe expected }","docstring":"/**\n * Tests the function `arange` for the Float type.\n * The function is supposed to generate an array starting from the default start value of 0,\n * ending before 10, with a non-integer step of 2.3.\n * The created array is then checked against an expected array for both size and element equality.\n */"} {"signature":"@ Test fun generateLinspaceFloatArray ( )","body":"{ val a = mk . linspace < Float > ( , , num = ) val expected = floatArrayOf ( , , , , , , , , , , , , , , ) assertEquals ( expected . size , a . size ) a . data . getFloatArray ( ) shouldBe expected }","docstring":"/**\n * Tests the function `linspace` for the Float type.\n * The function is supposed to generate an array of 15 elements evenly spaced from 3 to 10 inclusive.\n * The created array is then checked against an expected array for both size and element equality.\n */"} {"signature":"@ Test fun generateLinspaceFloatArrayWithNonIntegerBounds ( )","body":"{ val a = mk . linspace < Float > ( , , num = ) . map { round ( it * ) / } val expected = floatArrayOf ( , , , , , , , , , , , , , , ) assertEquals ( expected . size , a . size ) a . data . getFloatArray ( ) shouldBe expected }","docstring":"/**\n * Tests the function `linspace` for the Float type.\n * The function is supposed to generate an array of 15 elements evenly spaced from 1.7 to 13.8 inclusive.\n * The created array is then checked against an expected array for both size and element equality.\n */"} {"signature":"@ Test fun convertIterableToFloatArrayNDArray ( )","body":"{ val expected = listOf ( , , , , ) val a = expected . toNDArray ( ) assertEquals ( expected . size , a . size ) assertEquals ( expected , a . toList ( ) ) }","docstring":"/**\n * Tests the function `toNDArray` which converts an Iterable to a one-dimensional NDArray.\n * The test creates a list of Floats, converts it to an NDArray,\n * and then checks that the size and elements of the NDArray match those of the original list.\n */"} {"signature":"@ Test fun createZeroFilledDoubleArray ( )","body":"{ val size = val a = mk . zeros < Double > ( size ) assertEquals ( size , a . size ) assertEquals ( size , a . data . size ) assertTrue { a . all { it == } } }","docstring":"/**\n * This method checks if a double array of a given size is correctly created with all elements set to zero.\n */"} {"signature":"@ Test fun createDoubleArrayFilledWithOnes ( )","body":"{ val size = val a = mk . ones < Double > ( size ) assertEquals ( size , a . size ) assertEquals ( size , a . data . size ) assertTrue { a . all { it == } } }","docstring":"/**\n * Creates a double array filled with ones of a given size and checks if all elements are set to one.\n */"} {"signature":"@ Test fun createOneDimensionalArrayFromDoubleList ( )","body":"{ val list = listOf ( , , , , ) val a : D1Array < Double > = mk . ndarray ( list ) assertEquals ( list , a . toList ( ) ) }","docstring":"/**\n * Creates a one-dimensional array from a list of doubles\n * and checks if the array's list representation matches the input list.\n */"} {"signature":"@ Test fun createOneDimensionalArrayFromDoubleSet ( )","body":"{ val set = setOf ( , , , , ) val a : D1Array < Double > = mk . ndarray ( set , shape = intArrayOf ( ) ) assertEquals ( set . size , a . size ) assertEquals ( set , a . toSet ( ) ) }","docstring":"/**\n * Creates a one-dimensional array from a set of doubles\n * and checks if the array's set representation matches the input set.\n */"} {"signature":"@ Test fun createOneDimensionalArrayFromPrimitiveDoubleArray ( )","body":"{ val array = doubleArrayOf ( , , , , ) val a : D1Array < Double > = mk . ndarray ( array ) assertEquals ( array . size , a . size ) a . data . getDoubleArray ( ) shouldBe array }","docstring":"/**\n * Creates a one-dimensional array from a primitive DoubleArray\n * and checks if the array's DoubleArray representation matches the input DoubleArray.\n */"} {"signature":"@ Test fun createDouble1DArrayWithInitializationFunction ( )","body":"{ val a = mk . d1array < Double > ( ) { it + } val expected = doubleArrayOf ( , , , , ) assertEquals ( expected . size , a . size ) a . data . getDoubleArray ( ) shouldBe expected }","docstring":"/**\n * Creates a one-dimensional array with a given size using an initialization function\n * and checks if the array's DoubleArray representation matches the expected output.\n */"} {"signature":"@ Test fun createDouble1DArrayWithNdarrayOf ( )","body":"{ val a : D1Array < Double > = mk . ndarrayOf ( , , , , ) val expected = doubleArrayOf ( , , , , ) assertEquals ( expected . size , a . size ) a . data . getDoubleArray ( ) shouldBe expected }","docstring":"/**\n * Creates a one-dimensional array with a given size from Doubles\n * and checks if the array's DoubleArray representation matches the expected output.\n */"} {"signature":"@ Test fun generateArangeDoubleArrayWithStep ( )","body":"{ val a = mk . arange < Double > ( , , step = ) val expected = doubleArrayOf ( , , , ) assertEquals ( expected . size , a . size ) a . data . getDoubleArray ( ) shouldBe expected }","docstring":"/**\n * Tests the function `arange` for the Double type.\n * The function is supposed to generate an array starting from 3, ending before 10, with a step of 2.\n * The created array is then checked against an expected array for both size and element equality.\n */"} {"signature":"@ Test fun generateArangeDoubleArrayWithNonIntegerStep ( )","body":"{ val a = mk . arange < Double > ( , , step = ) val expected = doubleArrayOf ( , , ) assertEquals ( expected . size , a . size ) a . data . getDoubleArray ( ) shouldBe expected }","docstring":"/**\n * Tests the function `arange` for the Double type.\n * The function is supposed to generate an array starting from 3, ending before 10, with a non-integer step of 2.5.\n * The created array is then checked against an expected array for both size and element equality.\n */"} {"signature":"@ Test fun generateArangeDoubleArrayWithDefaultStart ( )","body":"{ val a = mk . arange < Double > ( , step = ) val expected = doubleArrayOf ( , , , , ) assertEquals ( expected . size , a . size ) a . data . getDoubleArray ( ) shouldBe expected }","docstring":"/**\n * Tests the function `arange` for the Double type.\n * The function is supposed to generate an array starting from the default start value of 0,\n * ending before 10, with a step of 2.\n * The created array is then checked against an expected array for both size and element equality.\n */"} {"signature":"@ Test fun generateArangeDoubleArrayWithDefaultStartAndNonIntegerStep ( )","body":"{ val a = mk . arange < Double > ( , step = ) . map { round ( it * ) / } val expected = doubleArrayOf ( , , , , ) assertEquals ( expected . size , a . size ) a . data . getDoubleArray ( ) shouldBe expected }","docstring":"/**\n * Tests the function `arange` for the Double type.\n * The function is supposed to generate an array starting from the default start value of 0,\n * ending before 10, with a non-integer step of 2.3.\n * The created array is then checked against an expected array for both size and element equality.\n */"} {"signature":"@ Test fun generateLinspaceDoubleArray ( )","body":"{ val a = mk . linspace < Double > ( , , num = ) val expected = doubleArrayOf ( , , , , , , , , , , , , , , ) assertEquals ( expected . size , a . size ) a . data . getDoubleArray ( ) shouldBe expected }","docstring":"/**\n * Tests the function `linspace` for the Double type.\n * The function is supposed to generate an array of 15 elements evenly spaced from 3 to 10 inclusive.\n * The created array is then checked against an expected array for both size and element equality.\n */"} {"signature":"@ Test fun generateLinspaceDoubleArrayWithNonIntegerBounds ( )","body":"{ val a = mk . linspace < Double > ( , , num = ) . map { round ( it * ) / } val expected = doubleArrayOf ( , , , , , , , , , , , , , , ) assertEquals ( expected . size , a . size ) a . data . getDoubleArray ( ) shouldBe expected }","docstring":"/**\n * Tests the function `linspace` for the Double type.\n * The function is supposed to generate an array of 15 elements evenly spaced from 1.7 to 13.8 inclusive.\n * The created array is then checked against an expected array for both size and element equality.\n */"} {"signature":"@ Test fun convertIterableToDoubleArrayNDArray ( )","body":"{ val expected = listOf ( , , , , ) val a = expected . toNDArray ( ) assertEquals ( expected . size , a . size ) assertEquals ( expected , a . toList ( ) ) }","docstring":"/**\n * Tests the function `toNDArray` which converts an Iterable to a one-dimensional NDArray.\n * The test creates a list of Doubles, converts it to an NDArray,\n * and then checks that the size and elements of the NDArray match those of the original list.\n */"} {"signature":"@ Test fun createZeroFilledComplexFloatArray ( )","body":"{ val size = val a = mk . zeros < ComplexFloat > ( size ) assertEquals ( size , a . size ) assertEquals ( size , a . data . size ) assertTrue { a . all { it == ComplexFloat . zero } } }","docstring":"/**\n * This method checks if a ComplexFloat array of a given size is correctly created with all elements set to zero.\n */"} {"signature":"@ Test fun createComplexFloatArrayFilledWithOnes ( )","body":"{ val size = val a = mk . ones < ComplexFloat > ( size ) assertEquals ( size , a . size ) assertEquals ( size , a . data . size ) assertTrue { a . all { it == ComplexFloat . one } } }","docstring":"/**\n * Creates a ComplexFloat array filled with ones of a given size and checks if all elements are set to one.\n */"} {"signature":"@ Test fun createOneDimensionalArrayFromComplexFloatList ( )","body":"{ val list = complexFloatList val a : D1Array < ComplexFloat > = mk . ndarray ( list ) assertEquals ( list , a . toList ( ) ) }","docstring":"/**\n * Creates a one-dimensional array from a list of complex floats\n * and checks if the array's list representation matches the input list.\n */"} {"signature":"@ Test fun createOneDimensionalArrayFromComplexFloatSet ( )","body":"{ val set = complexFloatList . toSet ( ) val a : D1Array < ComplexFloat > = mk . ndarray ( set , shape = intArrayOf ( ) ) assertEquals ( set . size , a . size ) assertEquals ( set , a . toSet ( ) ) }","docstring":"/**\n * Creates a one-dimensional array from a set of complex floats\n * and checks if the array's set representation matches the input set.\n */"} {"signature":"@ Test fun createOneDimensionalArrayFromPrimitiveComplexFloatArray ( )","body":"{ val array = complexFloatList . toComplexFloatArray ( ) val a : D1Array < ComplexFloat > = mk . ndarray ( array ) assertEquals ( array . size , a . size ) a . data . getComplexFloatArray ( ) shouldBe array }","docstring":"/**\n * Creates a one-dimensional array from a primitive ComplexFloatArray\n * and checks if the array's ComplexFloatArray representation matches the input ComplexFloatArray.\n */"} {"signature":"@ Test fun createComplexFloat1DArrayWithInitializationFunction ( )","body":"{ val a = mk . d1array < ComplexFloat > ( ) { ComplexFloat ( it + , round ( ( it - ) * ) / ) } val expected = complexFloatArrayOf ( - . i , + . i , + . i , + . i , + . i ) assertEquals ( expected . size , a . size ) a . data . getComplexFloatArray ( ) shouldBe expected }","docstring":"/**\n * Creates a one-dimensional array with a given size using an initialization function\n * and checks if the array's ComplexFloatArray representation matches the expected output.\n */"} {"signature":"@ Test fun createComplexFloat1DArrayWithNdarrayOf ( )","body":"{ val a : D1Array < ComplexFloat > = mk . ndarrayOf ( + . i , + . i , + . i , + . i , + . i ) val expected = complexFloatArrayOf ( + . i , + . i , + . i , + . i , + . i ) assertEquals ( expected . size , a . size ) a . data . getComplexFloatArray ( ) shouldBe expected }","docstring":"/**\n * Creates a one-dimensional array with a given size from floats\n * and checks if the array's ComplexFloatArray representation matches the expected output.\n */"} {"signature":"@ Test fun convertIterableToComplexFloatArrayNDArray ( )","body":"{ val expected = listOf ( ComplexFloat ( , ) , ComplexFloat ( , ) , ComplexFloat ( , ) , ComplexFloat ( , ) , ComplexFloat ( , ) ) val a = expected . toNDArray ( ) assertEquals ( expected . size , a . size ) assertEquals ( expected , a . toList ( ) ) }","docstring":"/**\n * Tests the function `toNDArray` which converts an Iterable to a one-dimensional NDArray.\n * The test creates a list of ComplexFloats, converts it to an NDArray,\n * and then checks that the size and elements of the NDArray match those of the original list.\n */"} {"signature":"@ Test fun createZeroFilledComplexDoubleArray ( )","body":"{ val size = val a = mk . zeros < ComplexDouble > ( size ) assertEquals ( size , a . size ) assertEquals ( size , a . data . size ) assertTrue { a . all { it == ComplexDouble . zero } } }","docstring":"/**\n * This method checks if a ComplexDouble array of a given size is correctly created with all elements set to zero.\n */"} {"signature":"@ Test fun createComplexDoubleArrayFilledWithOnes ( )","body":"{ val size = val a = mk . ones < ComplexDouble > ( size ) assertEquals ( size , a . size ) assertEquals ( size , a . data . size ) assertTrue { a . all { it == ComplexDouble . one } } }","docstring":"/**\n * Creates a ComplexDouble array filled with ones of a given size and checks if all elements are set to one.\n */"} {"signature":"@ Test fun createOneDimensionalArrayFromComplexDoubleList ( )","body":"{ val list = complexDoubleList val a : D1Array < ComplexDouble > = mk . ndarray ( list ) assertEquals ( list , a . toList ( ) ) }","docstring":"/**\n * Creates a one-dimensional array from a list of complex doubles\n * and checks if the array's list representation matches the input list.\n */"} {"signature":"@ Test fun createOneDimensionalArrayFromComplexDoubleSet ( )","body":"{ val set = complexDoubleList . toSet ( ) val a : D1Array < ComplexDouble > = mk . ndarray ( set , shape = intArrayOf ( ) ) assertEquals ( set . size , a . size ) assertEquals ( set , a . toSet ( ) ) }","docstring":"/**\n * Creates a one-dimensional array from a set of complex doubles\n * and checks if the array's set representation matches the input set.\n */"} {"signature":"@ Test fun createOneDimensionalArrayFromPrimitiveComplexDoubleArray ( )","body":"{ val array = complexDoubleList . toComplexDoubleArray ( ) val a : D1Array < ComplexDouble > = mk . ndarray ( array ) assertEquals ( array . size , a . size ) a . data . getComplexDoubleArray ( ) shouldBe array }","docstring":"/**\n * Creates a one-dimensional array from a primitive ComplexDoubleArray\n * and checks if the array's ComplexDoubleArray representation matches the input ComplexDoubleArray.\n */"} {"signature":"@ Test fun createComplexDouble1DArrayWithInitializationFunction ( )","body":"{ val a = mk . d1array < ComplexDouble > ( ) { ComplexDouble ( it + , round ( ( it - ) * ) / ) } val expected = complexDoubleArrayOf ( - . i , + . i , + . i , + . i , + . i ) assertEquals ( expected . size , a . size ) a . data . getComplexDoubleArray ( ) shouldBe expected }","docstring":"/**\n * Creates a one-dimensional array with a given size using an initialization function\n * and checks if the array's ComplexDoubleArray representation matches the expected output.\n */"} {"signature":"@ Test fun createComplexDouble1DArrayWithNdarrayOf ( )","body":"{ val a : D1Array < ComplexDouble > = mk . ndarrayOf ( + . i , + . i , + . i , + . i , + . i ) val expected = complexDoubleArrayOf ( + . i , + . i , + . i , + . i , + . i ) assertEquals ( expected . size , a . size ) a . data . getComplexDoubleArray ( ) shouldBe expected }","docstring":"/**\n * Creates a one-dimensional array with a given size from doubles\n * and checks if the array's ComplexDoubleArray representation matches the expected output.\n */"} {"signature":"@ Test fun convertIterableToComplexDoubleArrayNDArray ( )","body":"{ val expected = listOf ( + . i , + . i , + . i , + . i , + . i ) val a = expected . toNDArray ( ) assertEquals ( expected . size , a . size ) assertEquals ( expected , a . toList ( ) ) }","docstring":"/**\n * Tests the function `toNDArray` which converts an Iterable to a one-dimensional NDArray.\n * The test creates a list of ComplexDoubles, converts it to an NDArray,\n * and then checks that the size and elements of the NDArray match those of the original list.\n */"} {"signature":"fun checkSubTypes ( types : List < ConeKotlinType > , context : CheckerContext ) : Boolean","body":"{ fun replaceTypeParametersByStarProjections ( type : ConeClassLikeType ) : ConeClassLikeType { return type . withArguments ( type . typeArguments . map { when { it . isStarProjection -> it it . type ! ! is ConeTypeParameterType -> ConeStarProjection it . type ! ! is ConeClassLikeType -> replaceTypeParametersByStarProjections ( it . type as ConeClassLikeType ) else -> it } } . toTypedArray ( ) ) } val replacedTypeParameters = types . flatMap { r -> when ( r ) { is ConeTypeParameterType -> r . lookupTag . typeParameterSymbol . resolvedBounds . map { it . type } is ConeClassLikeType -> listOf ( replaceTypeParametersByStarProjections ( r ) ) else -> listOf ( r ) } } for ( i in replacedTypeParameters . indices ) for ( j in i + ..< replacedTypeParameters . size ) { if ( replacedTypeParameters [ i ] . isSubtypeOf ( replacedTypeParameters [ j ] , context . session ) || replacedTypeParameters [ j ] . isSubtypeOf ( replacedTypeParameters [ i ] , context . session ) ) return true } return false }","docstring":"/**\n * Simplified checking of subtype relation used in context receiver checkers.\n * It converts type parameters to star projections and top level type parameters to its supertypes. Then it checks the relation.\n */"} {"signature":"public fun predictObject ( image : I ) : String","body":"{ val input = preprocessing . apply ( image ) return classLabels [ internalModel . predictLabel ( input ) ] ! ! }","docstring":"/**\n * Predicts an object for the given [image].\n * Default preprocessing [Operation] is applied to an image.\n *\n * @param [image] Input image.\n * @see preprocessing\n *\n * @return The label of the recognized object with the highest probability.\n */"} {"signature":"public fun predictTopKObjects ( image : I , topK : Int = ) : List < Pair < String , Float > >","body":"{ val input = preprocessing . apply ( image ) return internalModel . predictTopNLabels ( input , classLabels , topK ) }","docstring":"/**\n * Predicts [topK] objects for the given [image].\n * Default preprocessing [Operation] is applied to an image.\n *\n * @param [image] Input image.\n * @param [topK] Number of top-ranked predictions to return\n *\n * @see preprocessing\n *\n * @return The list of pairs sorted from the most probable to the lowest probable.\n */"} {"signature":"fun Sequence < String > . ifNotContainsSequence ( patternsIter : Iterator < LinePattern > , body : ( LinePattern , Int ) -> Unit ) : Unit","body":"{ class Accumulator ( it : Iterator < LinePattern > ) { val iter = EndBoundIteratorWithValue ( it ) var lineNo = var lastMatchedLineNo = fun nextLineAndPattern ( ) : Accumulator { iter . traverseNext ( ) ; lastMatchedLineNo = lineNo ; return nextLine ( ) } fun nextLine ( ) : Accumulator { lineNo ++ ; return this } } val res = fold ( Accumulator ( patternsIter ) ) { acc , line -> when { ! acc . iter . isValid ( ) -> return@fold acc acc . iter . value . regex . find ( line ) ? . let { acc . iter . value . matchCheck ( it ) } ? : false -> acc . nextLineAndPattern ( ) else -> acc . nextLine ( ) } } if ( res . iter . isValid ( ) ) { body ( res . iter . value , res . lastMatchedLineNo ) } }","docstring":"/**\n * calls [body] if receiver does not contain complete sequence of lines matched by [patternsIter], separated by any number of other lines\n * [body] receives first unmatched pattern and index of last matched line in the sequence\n */"} {"signature":"fun Sequence < String > . ifNotContainsSequence ( patterns : List < LinePattern > , body : ( LinePattern , Int ) -> Unit ) : Unit","body":"{ ifNotContainsSequence ( patterns . iterator ( ) , body ) }","docstring":"/**\n * calls [body] if receiver does not contain complete sequence of lines matched by [patterns], separated by any number of other lines\n * [body] receives first unmatched pattern and index of last matched line in the sequence\n */"} {"signature":"fun Sequence < String > . ifNotContainsSequence ( vararg patterns : LinePattern , body : ( LinePattern , Int ) -> Unit ) : Unit","body":"{ ifNotContainsSequence ( patterns . iterator ( ) , body ) }","docstring":"/**\n * calls [body] if receiver does not contain complete sequence of lines matched by [patterns], separated by any number of other lines\n * [body] receives first unmatched pattern and index of last matched line in the sequence\n */"} {"signature":"fun prepare ( buildErrorExpected : Boolean ? = false )","body":"fun prepare ( buildErrorExpected : Boolean ? = false )","docstring":"/**\n * Perform built-in checks.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ InlineOnly public actual inline fun sin ( x : Double ) : Double","body":"= nativeMath . sin ( x )","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 ( \"\" ) @ InlineOnly public actual inline fun cos ( x : Double ) : Double","body":"= nativeMath . cos ( x )","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 ( \"\" ) @ InlineOnly public actual inline fun tan ( x : Double ) : Double","body":"= nativeMath . tan ( x )","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 ( \"\" ) @ InlineOnly public actual inline fun asin ( x : Double ) : Double","body":"= nativeMath . asin ( x )","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 ( \"\" ) @ InlineOnly public actual inline fun acos ( x : Double ) : Double","body":"= nativeMath . acos ( x )","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 ( \"\" ) @ InlineOnly public actual inline fun atan ( x : Double ) : Double","body":"= nativeMath . atan ( x )","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 ( \"\" ) @ InlineOnly public actual inline fun atan2 ( y : Double , x : Double ) : Double","body":"= nativeMath . atan2 ( y , x )","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 ( \"\" ) @ InlineOnly public actual inline fun sinh ( x : Double ) : Double","body":"= nativeMath . sinh ( x )","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 ( \"\" ) @ InlineOnly public actual inline fun cosh ( x : Double ) : Double","body":"= nativeMath . cosh ( x )","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 ( \"\" ) @ InlineOnly public actual inline fun tanh ( x : Double ) : Double","body":"= nativeMath . tanh ( x )","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 actual fun asinh ( x : Double ) : Double","body":"= when { x >= + taylor_n_bound -> if ( x > upper_taylor_n_bound ) { if ( x > upper_taylor_2_bound ) { nativeMath . log ( x ) + LN2 } else { nativeMath . log ( x * + ( / ( x * ) ) ) } } else { nativeMath . log ( x + nativeMath . sqrt ( x * x + ) ) } x <= - taylor_n_bound -> - asinh ( - x ) else -> { var result = x ; if ( nativeMath . abs ( x ) >= taylor_2_bound ) { result -= ( x * x * x ) / } result } }","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 actual fun acosh ( x : Double ) : Double","body":"= when { x < -> Double . NaN x > upper_taylor_2_bound -> nativeMath . log ( x ) + LN2 x - >= taylor_n_bound -> nativeMath . log ( x + nativeMath . sqrt ( x * x - ) ) else -> { val y = nativeMath . sqrt ( x - ) var result = y if ( y >= taylor_2_bound ) { result -= ( y * y * y ) / } nativeMath . sqrt ( ) * result } }","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 actual fun atanh ( x : Double ) : Double","body":"{ if ( nativeMath . abs ( x ) < taylor_n_bound ) { var result = x if ( nativeMath . abs ( x ) > taylor_2_bound ) { result += ( x * x * x ) / } return result } return nativeMath . log ( ( + x ) / ( - x ) ) / }","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 ( \"\" ) @ InlineOnly public actual inline fun hypot ( x : Double , y : Double ) : Double","body":"= nativeMath . hypot ( x , y )","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 ( \"\" ) @ InlineOnly public actual inline fun sqrt ( x : Double ) : Double","body":"= nativeMath . sqrt ( x )","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 ( \"\" ) @ InlineOnly public actual inline fun exp ( x : Double ) : Double","body":"= nativeMath . exp ( x )","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 ( \"\" ) @ InlineOnly public actual inline fun expm1 ( x : Double ) : Double","body":"= nativeMath . expm1 ( x )","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 actual fun log ( x : Double , base : Double ) : Double","body":"{ if ( base <= || base == ) return Double . NaN return nativeMath . log ( x ) / nativeMath . log ( base ) }","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 ( \"\" ) @ InlineOnly public actual inline fun ln ( x : Double ) : Double","body":"= nativeMath . log ( x )","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 ( \"\" ) @ InlineOnly public actual inline fun log10 ( x : Double ) : Double","body":"= nativeMath . log10 ( x )","docstring":"/**\n * Computes the common logarithm (base 10) of the value [x].\n *\n * @see [ln] function for special cases.\n */"} {"signature":"@ SinceKotlin ( \"\" ) public actual fun log2 ( x : Double ) : Double","body":"= nativeMath . log ( x ) / LN2","docstring":"/**\n * Computes the binary logarithm (base 2) of the value [x].\n *\n * @see [ln] function for special cases.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ InlineOnly public actual inline fun ln1p ( x : Double ) : Double","body":"= nativeMath . log1p ( x )","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 ( \"\" ) @ InlineOnly public actual inline fun ceil ( x : Double ) : Double","body":"= nativeMath . ceil ( x )","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 ( \"\" ) @ InlineOnly public actual inline fun floor ( x : Double ) : Double","body":"= nativeMath . floor ( x )","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 actual fun truncate ( x : Double ) : Double","body":"= when { x . isNaN ( ) || x . isInfinite ( ) -> x x > -> floor ( x ) else -> ceil ( x ) }","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 ( \"\" ) @ InlineOnly public actual inline fun round ( x : Double ) : Double","body":"= nativeMath . rint ( x )","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 ( \"\" ) @ InlineOnly public actual inline fun abs ( x : Double ) : Double","body":"= nativeMath . abs ( x )","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 ( \"\" ) @ InlineOnly public actual inline fun sign ( x : Double ) : Double","body":"= nativeMath . signum ( x )","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 ( \"\" ) @ InlineOnly public actual inline fun min ( a : Double , b : Double ) : Double","body":"= nativeMath . min ( a , b )","docstring":"/**\n * Returns the smaller of two values.\n *\n * If either value is `NaN`, then the result is `NaN`.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ InlineOnly public actual inline fun max ( a : Double , b : Double ) : Double","body":"= nativeMath . max ( a , b )","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 ) @ InlineOnly public actual inline fun cbrt ( x : Double ) : Double","body":"= nativeMath . cbrt ( x )","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 ( \"\" ) @ InlineOnly public actual inline fun Double . pow ( x : Double ) : Double","body":"= nativeMath . pow ( this , x )","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 ( \"\" ) @ InlineOnly public actual inline fun Double . pow ( n : Int ) : Double","body":"= nativeMath . pow ( this , n . toDouble ( ) )","docstring":"/**\n * Raises this value to the integer power [n].\n *\n * See the other overload of [pow] for details.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ InlineOnly public inline fun Double . IEEErem ( divisor : Double ) : Double","body":"= nativeMath . IEEEremainder ( this , divisor )","docstring":"/**\n * Computes the remainder of division of this value by the [divisor] value according to the IEEE 754 standard.\n *\n * The result is computed as `r = this - (q * divisor)` where `q` is the quotient of division rounded to the nearest integer,\n * `q = round(this / other)`.\n *\n * Special cases:\n * - `x.IEEErem(y)` is `NaN`, when `x` is `NaN` or `y` is `NaN` or `x` is `+Inf|-Inf` or `y` is zero.\n * - `x.IEEErem(y) == x` when `x` is finite and `y` is infinite.\n *\n * @see round\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ InlineOnly public actual inline fun Double . withSign ( sign : Double ) : Double","body":"= nativeMath . copySign ( this , sign )","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 ( \"\" ) @ InlineOnly public actual inline fun Double . withSign ( sign : Int ) : Double","body":"= nativeMath . copySign ( this , sign . toDouble ( ) )","docstring":"/**\n * Returns this value with the sign bit same as of the [sign] value.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ InlineOnly public actual inline fun Double . nextUp ( ) : Double","body":"= nativeMath . nextUp ( this )","docstring":"/**\n * Returns the [Double] value nearest to this value in direction of positive infinity.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ InlineOnly public actual inline fun Double . nextDown ( ) : Double","body":"= nativeMath . nextAfter ( this , Double . NEGATIVE_INFINITY )","docstring":"/**\n * Returns the [Double] value nearest to this value in direction of negative infinity.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ InlineOnly public actual inline fun Double . nextTowards ( to : Double ) : Double","body":"= nativeMath . nextAfter ( this , to )","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 actual fun Double . roundToInt ( ) : Int","body":"= when { isNaN ( ) -> throw IllegalArgumentException ( \"\" ) this > Int . MAX_VALUE -> Int . MAX_VALUE this < Int . MIN_VALUE -> Int . MIN_VALUE else -> nativeMath . round ( this ) . toInt ( ) }","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 actual fun Double . roundToLong ( ) : Long","body":"= if ( isNaN ( ) ) throw IllegalArgumentException ( \"\" ) else nativeMath . round ( this )","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 ( \"\" ) @ InlineOnly public actual inline fun sin ( x : Float ) : Float","body":"= nativeMath . sin ( x . toDouble ( ) ) . toFloat ( )","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 ( \"\" ) @ InlineOnly public actual inline fun cos ( x : Float ) : Float","body":"= nativeMath . cos ( x . toDouble ( ) ) . toFloat ( )","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 ( \"\" ) @ InlineOnly public actual inline fun tan ( x : Float ) : Float","body":"= nativeMath . tan ( x . toDouble ( ) ) . toFloat ( )","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 ( \"\" ) @ InlineOnly public actual inline fun asin ( x : Float ) : Float","body":"= nativeMath . asin ( x . toDouble ( ) ) . toFloat ( )","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 ( \"\" ) @ InlineOnly public actual inline fun acos ( x : Float ) : Float","body":"= nativeMath . acos ( x . toDouble ( ) ) . toFloat ( )","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 ( \"\" ) @ InlineOnly public actual inline fun atan ( x : Float ) : Float","body":"= nativeMath . atan ( x . toDouble ( ) ) . toFloat ( )","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 ( \"\" ) @ InlineOnly public actual inline fun atan2 ( y : Float , x : Float ) : Float","body":"= nativeMath . atan2 ( y . toDouble ( ) , x . toDouble ( ) ) . toFloat ( )","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 ( \"\" ) @ InlineOnly public actual inline fun sinh ( x : Float ) : Float","body":"= nativeMath . sinh ( x . toDouble ( ) ) . toFloat ( )","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 ( \"\" ) @ InlineOnly public actual inline fun cosh ( x : Float ) : Float","body":"= nativeMath . cosh ( x . toDouble ( ) ) . toFloat ( )","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 ( \"\" ) @ InlineOnly public actual inline fun tanh ( x : Float ) : Float","body":"= nativeMath . tanh ( x . toDouble ( ) ) . toFloat ( )","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 ( \"\" ) @ InlineOnly public actual inline fun asinh ( x : Float ) : Float","body":"= asinh ( x . toDouble ( ) ) . toFloat ( )","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 ( \"\" ) @ InlineOnly public actual inline fun acosh ( x : Float ) : Float","body":"= acosh ( x . toDouble ( ) ) . toFloat ( )","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 ( \"\" ) @ InlineOnly public actual inline fun atanh ( x : Float ) : Float","body":"= atanh ( x . toDouble ( ) ) . toFloat ( )","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 ( \"\" ) @ InlineOnly public actual inline fun hypot ( x : Float , y : Float ) : Float","body":"= nativeMath . hypot ( x . toDouble ( ) , y . toDouble ( ) ) . toFloat ( )","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 ( \"\" ) @ InlineOnly public actual inline fun sqrt ( x : Float ) : Float","body":"= nativeMath . sqrt ( x . toDouble ( ) ) . toFloat ( )","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 ( \"\" ) @ InlineOnly public actual inline fun exp ( x : Float ) : Float","body":"= nativeMath . exp ( x . toDouble ( ) ) . toFloat ( )","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 ( \"\" ) @ InlineOnly public actual inline fun expm1 ( x : Float ) : Float","body":"= nativeMath . expm1 ( x . toDouble ( ) ) . toFloat ( )","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 actual fun log ( x : Float , base : Float ) : Float","body":"{ if ( base <= || base == ) return Float . NaN return ( nativeMath . log ( x . toDouble ( ) ) / nativeMath . log ( base . toDouble ( ) ) ) . toFloat ( ) }","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 ( \"\" ) @ InlineOnly public actual inline fun ln ( x : Float ) : Float","body":"= nativeMath . log ( x . toDouble ( ) ) . toFloat ( )","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 ( \"\" ) @ InlineOnly public actual inline fun log10 ( x : Float ) : Float","body":"= nativeMath . log10 ( x . toDouble ( ) ) . toFloat ( )","docstring":"/**\n * Computes the common logarithm (base 10) of the value [x].\n *\n * @see [ln] function for special cases.\n */"} {"signature":"@ SinceKotlin ( \"\" ) public actual fun log2 ( x : Float ) : Float","body":"= ( nativeMath . log ( x . toDouble ( ) ) / LN2 ) . toFloat ( )","docstring":"/**\n * Computes the binary logarithm (base 2) of the value [x].\n *\n * @see [ln] function for special cases.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ InlineOnly public actual inline fun ln1p ( x : Float ) : Float","body":"= nativeMath . log1p ( x . toDouble ( ) ) . toFloat ( )","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 ( \"\" ) @ InlineOnly public actual inline fun ceil ( x : Float ) : Float","body":"= nativeMath . ceil ( x . toDouble ( ) ) . toFloat ( )","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 ( \"\" ) @ InlineOnly public actual inline fun floor ( x : Float ) : Float","body":"= nativeMath . floor ( x . toDouble ( ) ) . toFloat ( )","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 actual fun truncate ( x : Float ) : Float","body":"= when { x . isNaN ( ) || x . isInfinite ( ) -> x x > -> floor ( x ) else -> ceil ( x ) }","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 ( \"\" ) @ InlineOnly public actual inline fun round ( x : Float ) : Float","body":"= nativeMath . rint ( x . toDouble ( ) ) . toFloat ( )","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 ( \"\" ) @ InlineOnly public actual inline fun abs ( x : Float ) : Float","body":"= nativeMath . abs ( x )","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 ( \"\" ) @ InlineOnly public actual inline fun sign ( x : Float ) : Float","body":"= nativeMath . signum ( x )","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 ( \"\" ) @ InlineOnly public actual inline fun min ( a : Float , b : Float ) : Float","body":"= nativeMath . min ( a , b )","docstring":"/**\n * Returns the smaller of two values.\n *\n * If either value is `NaN`, then the result is `NaN`.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ InlineOnly public actual inline fun max ( a : Float , b : Float ) : Float","body":"= nativeMath . max ( a , b )","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 ) @ InlineOnly public actual inline fun cbrt ( x : Float ) : Float","body":"= nativeMath . cbrt ( x . toDouble ( ) ) . toFloat ( )","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 ( \"\" ) @ InlineOnly public actual inline fun Float . pow ( x : Float ) : Float","body":"= nativeMath . pow ( this . toDouble ( ) , x . toDouble ( ) ) . toFloat ( )","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 ( \"\" ) @ InlineOnly public actual inline fun Float . pow ( n : Int ) : Float","body":"= nativeMath . pow ( this . toDouble ( ) , n . toDouble ( ) ) . toFloat ( )","docstring":"/**\n * Raises this value to the integer power [n].\n *\n * See the other overload of [pow] for details.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ InlineOnly public inline fun Float . IEEErem ( divisor : Float ) : Float","body":"= nativeMath . IEEEremainder ( this . toDouble ( ) , divisor . toDouble ( ) ) . toFloat ( )","docstring":"/**\n * Computes the remainder of division of this value by the [divisor] value according to the IEEE 754 standard.\n *\n * The result is computed as `r = this - (q * divisor)` where `q` is the quotient of division rounded to the nearest integer,\n * `q = round(this / other)`.\n *\n * Special cases:\n * - `x.IEEErem(y)` is `NaN`, when `x` is `NaN` or `y` is `NaN` or `x` is `+Inf|-Inf` or `y` is zero.\n * - `x.IEEErem(y) == x` when `x` is finite and `y` is infinite.\n *\n * @see round\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ InlineOnly public actual inline fun Float . withSign ( sign : Float ) : Float","body":"= nativeMath . copySign ( this , sign )","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 ( \"\" ) @ InlineOnly public actual inline fun Float . withSign ( sign : Int ) : Float","body":"= nativeMath . copySign ( this , sign . toFloat ( ) )","docstring":"/**\n * Returns this value with the sign bit same as of the [sign] value.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ InlineOnly public inline fun Float . nextUp ( ) : Float","body":"= nativeMath . nextUp ( this )","docstring":"/**\n * Returns the [Float] value nearest to this value in direction of positive infinity.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ InlineOnly public inline fun Float . nextDown ( ) : Float","body":"= nativeMath . nextAfter ( this , Double . NEGATIVE_INFINITY )","docstring":"/**\n * Returns the [Float] value nearest to this value in direction of negative infinity.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ InlineOnly public inline fun Float . nextTowards ( to : Float ) : Float","body":"= nativeMath . nextAfter ( this , to . toDouble ( ) )","docstring":"/**\n * Returns the [Float] 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 actual fun Float . roundToInt ( ) : Int","body":"= if ( isNaN ( ) ) throw IllegalArgumentException ( \"\" ) else nativeMath . round ( this )","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 actual fun Float . roundToLong ( ) : Long","body":"= toDouble ( ) . roundToLong ( )","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 ( \"\" ) @ InlineOnly public actual inline fun abs ( n : Int ) : Int","body":"= nativeMath . abs ( n )","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 ( \"\" ) @ InlineOnly public actual inline fun min ( a : Int , b : Int ) : Int","body":"= nativeMath . min ( a , b )","docstring":"/**\n * Returns the smaller of two values.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ InlineOnly public actual inline fun max ( a : Int , b : Int ) : Int","body":"= nativeMath . max ( a , b )","docstring":"/**\n * Returns the greater of two values.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ InlineOnly public actual inline fun abs ( n : Long ) : Long","body":"= nativeMath . abs ( n )","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 ( \"\" ) @ InlineOnly public actual inline fun min ( a : Long , b : Long ) : Long","body":"= nativeMath . min ( a , b )","docstring":"/**\n * Returns the smaller of two values.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ InlineOnly public actual inline fun max ( a : Long , b : Long ) : Long","body":"= nativeMath . max ( a , b )","docstring":"/**\n * Returns the greater of two values.\n */"} {"signature":"@ InlineOnly public inline fun bytes ( builderAction : BytesHexFormat . Builder . ( ) -> Unit )","body":"{ bytes . builderAction ( ) }","docstring":"/**\n * Provides a scope for configuring the [HexFormat.bytes] format options.\n *\n * See [BytesHexFormat.Builder] for default values of the options.\n */"} {"signature":"@ InlineOnly public inline fun number ( builderAction : NumberHexFormat . Builder . ( ) -> Unit )","body":"{ number . builderAction ( ) }","docstring":"/**\n * Provides a scope for configuring the [HexFormat.number] format options.\n *\n * See [NumberHexFormat.Builder] for default values of the options.\n */"} {"signature":"@ ExperimentalStdlibApi @ SinceKotlin ( \"\" ) @ InlineOnly public inline fun HexFormat ( builderAction : HexFormat . Builder . ( ) -> Unit ) : HexFormat","body":"{ return HexFormat . Builder ( ) . apply ( builderAction ) . build ( ) }","docstring":"/**\n * Builds a new [HexFormat] by configuring its format options using the specified [builderAction],\n * and returns the resulting format.\n *\n * The builder passed as a receiver to the [builderAction] is valid only inside that function.\n * Using it outside the function produces an unspecified behavior.\n */"} {"signature":"@ JvmOverloads public fun seconds ( timeout : Int , cancelOnTimeout : Boolean = false , enableCoroutineCreationStackTraces : Boolean = true ) : CoroutinesTimeoutExtension","body":"= CoroutinesTimeoutExtension ( enableCoroutineCreationStackTraces , timeout . toLong ( ) * , cancelOnTimeout )","docstring":"/**\n * Creates the [CoroutinesTimeoutExtension] extension with the given timeout in seconds.\n */"} {"signature":"private fun initialize ( extensionContext : ExtensionContext )","body":"{ val store : ExtensionContext . Store = extensionContext . getStore ( ExtensionContext . Namespace . create ( CoroutinesTimeoutExtension :: class , extensionContext . uniqueId ) ) synchronized ( store ) { if ( store [ \"\" ] == null ) { if ( ! tryPassDebugProbesOwnership ( ) ) { DebugProbes . enableCreationStackTraces = enableCoroutineCreationStackTraces DebugProbes . install ( ) } store . put ( \"\" , ExtensionContext . Store . CloseableResource { DebugProbes . uninstall ( ) } ) } else if ( ! debugProbesOwnershipPassed . get ( ) ) { if ( tryPassDebugProbesOwnership ( ) ) { DebugProbes . uninstall ( ) } } } }","docstring":"/**\n * Initialize this extension instance and/or the extension value store.\n *\n * It seems that the only way to reliably have JUnit5 clean up after its extensions is to put an instance of\n * [ExtensionContext.Store.CloseableResource] into the value store corresponding to the extension instance, which\n * means that [DebugProbes.uninstall] must be placed into the value store. [debugProbesOwnershipPassed] is `true`\n * if the call to [DebugProbes.install] performed in the constructor of the extension instance was matched with a\n * placing of [DebugProbes.uninstall] into the value store. We call the process of placing the cleanup procedure\n * \"passing the ownership\", as now JUnit5 (and not our code) has to worry about uninstalling the debug probes.\n *\n * However, extension instances can be reused with different value stores, and value stores can be reused across\n * extension instances. This leads to a tricky scheme of performing [DebugProbes.uninstall]:\n *\n * - If neither the ownership of this instance's [DebugProbes] was yet passed nor there is any cleanup procedure\n * stored, it means that we can just store our cleanup procedure, passing the ownership.\n * - If the ownership was not yet passed, but a cleanup procedure is already stored, we can't just replace it with\n * another one, as this would lead to imbalance between [DebugProbes.install] and [DebugProbes.uninstall].\n * Instead, we know that this extension context will at least outlive this use of this instance, so some debug\n * probes other than the ones from our constructor are already installed and won't be uninstalled during our\n * operation. We simply uninstall the debug probes that were installed in our constructor.\n * - If the ownership was passed, but the store is empty, it means that this test instance is reused and, possibly,\n * the debug probes installed in its constructor were already uninstalled. This means that we have to install them\n * anew and store an uninstaller.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalTime :: class ) public fun DurationUnit . toTimeUnit ( ) : TimeUnit","body":"= timeUnit","docstring":"/**\n * Converts this [kotlin.time.DurationUnit][DurationUnit] enum value to the corresponding [java.util.concurrent.TimeUnit][java.util.concurrent.TimeUnit] value.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalTime :: class ) public fun TimeUnit . toDurationUnit ( ) : DurationUnit","body":"= when ( this ) { TimeUnit . NANOSECONDS -> DurationUnit . NANOSECONDS TimeUnit . MICROSECONDS -> DurationUnit . MICROSECONDS TimeUnit . MILLISECONDS -> DurationUnit . MILLISECONDS TimeUnit . SECONDS -> DurationUnit . SECONDS TimeUnit . MINUTES -> DurationUnit . MINUTES TimeUnit . HOURS -> DurationUnit . HOURS TimeUnit . DAYS -> DurationUnit . DAYS }","docstring":"/**\n * Converts this [java.util.concurrent.TimeUnit][java.util.concurrent.TimeUnit] enum value to the corresponding [kotlin.time.DurationUnit][DurationUnit] value.\n */"} {"signature":"@ JvmName ( \"\" ) public fun LinAlg . qr ( mat : MultiArray < Float , D2 > ) : Pair < D2Array < Float > , D2Array < Float > >","body":"= this . linAlgEx . qrF ( mat )","docstring":"/**\n * Returns QR decomposition of the float matrix\n */"} {"signature":"@ JvmName ( \"\" ) public fun < T : Number > LinAlg . qr ( mat : MultiArray < T , D2 > ) : Pair < D2Array < Double > , D2Array < Double > >","body":"= this . linAlgEx . qr ( mat )","docstring":"/**\n * Returns QR decomposition of the numeric matrix\n */"} {"signature":"@ JvmName ( \"\" ) public fun < T : Complex > LinAlg . qr ( mat : MultiArray < T , D2 > ) : Pair < D2Array < T > , D2Array < T > >","body":"= this . linAlgEx . qrC ( mat )","docstring":"/**\n * Returns QR decomposition of the complex matrix\n */"} {"signature":"fun runONNXAdditionalTraining ( modelType : ONNXModels . CVnoTop )","body":"{ val modelHub = ONNXModelHub ( cacheDirectory = File ( \"\" ) ) val dogsVsCatsDatasetPath = dogsCatsSmallDatasetPath ( ) modelHub . loadModel ( modelType ) . use { model -> println ( model ) val preprocessing = modelType . createPreprocessing ( model ) . onnx { onnxModel = model } val dataset = OnFlyImageDataset . create ( File ( dogsVsCatsDatasetPath ) , FromFolders ( mapping = mapOf ( \"\" to , \"\" to ) ) , preprocessing ) . shuffle ( ) val ( train , test ) = dataset . split ( TRAIN_TEST_SPLIT_RATIO ) val topModel = Sequential . of ( Input ( model . outputShape [ ] , model . outputShape [ ] , model . outputShape [ ] ) , GlobalAvgPool2D ( ) , Dense ( NUM_CLASSES , Activations . Linear , kernelInitializer = HeNormal ( ) , biasInitializer = Zeros ( ) ) ) topModel . use { topModel . compile ( optimizer = Adam ( ) , loss = Losses . SOFT_MAX_CROSS_ENTROPY_WITH_LOGITS , metric = Metrics . ACCURACY ) topModel . fit ( dataset = train , epochs = EPOCHS , batchSize = TRAINING_BATCH_SIZE ) val accuracy = topModel . evaluate ( dataset = test , batchSize = TEST_BATCH_SIZE ) . metrics [ Metrics . ACCURACY ] println ( \"\" ) } } }","docstring":"/**\n * This examples demonstrates the transfer learning concept on the Image Recognition model:\n * - Model configuration, model weights and labels are obtained from [ONNXModelHub].\n * - All layers, excluding the last [Dense], are added to the new Neural Network, its weights are frozen.\n * - ONNX frozen model is used as a preprocessing stage via `onnx` stage of the Image Preprocessing DSL.\n * - New Dense layers are added and initialized via defined initializers.\n * - Model is re-trained on [dogsCatsDatasetPath] dataset.\n *\n *\n * We use the preprocessing DSL to describe the dataset generation pipeline.\n * We demonstrate the workflow on the subset of Kaggle Cats vs Dogs binary classification dataset.\n */"} {"signature":"fun createClass ( descriptor : ClassDescriptor , builder : ( IrClass ) -> Unit ) : IrClass","body":"= symbolTable . descriptorExtension . declareClass ( descriptor ) { symbolTable . irFactory . createIrClassFromDescriptor ( SYNTHETIC_OFFSET , SYNTHETIC_OFFSET , IrDeclarationOrigin . IR_EXTERNAL_DECLARATION_STUB , it , descriptor ) } . also { irClass -> symbolTable . withScope ( irClass ) { irClass . superTypes += descriptor . typeConstructor . supertypes . map { it . toIrType ( ) } irClass . generateAnnotations ( ) irClass . createParameterDeclarations ( ) builder ( irClass ) createFakeOverrides ( descriptor ) . forEach ( irClass :: addMember ) } }","docstring":"/**\n * Declares [IrClass] instance from [descriptor] and populates it with\n * supertypes, parameter declaration and fake overrides.\n * Additional elements are passed via [builder] callback.\n */"} {"signature":"@ OptIn ( ObsoleteDescriptorBasedAPI :: class ) internal fun IrSymbol . findCEnumDescriptor ( ) : ClassDescriptor ?","body":"= descriptor . findCEnumDescriptor ( )","docstring":"/**\n * All enums that come from interop library implement CEnum interface.\n * This function checks that given symbol located in subtree of\n * CEnum inheritor.\n */"} {"signature":"@ OptIn ( ObsoleteDescriptorBasedAPI :: class ) internal fun IrSymbol . findCStructDescriptor ( ) : ClassDescriptor ?","body":"= descriptor . findCStructDescriptor ( )","docstring":"/**\n * All structs that come from interop library inherit from CStructVar class.\n * This function checks that given symbol located in subtree of\n * CStructVar inheritor.\n */"} {"signature":"public fun KtType . isArrayOrPrimitiveArray ( ) : Boolean","body":"= withValidityAssertion { analysisSession . typeInfoProvider . isArrayOrPrimitiveArray ( this ) }","docstring":"/**\n * Returns whether the given [KtType] is an array or a primitive array type or not.\n */"} {"signature":"public fun KtType . isNestedArray ( ) : Boolean","body":"= withValidityAssertion { analysisSession . typeInfoProvider . isNestedArray ( this ) }","docstring":"/**\n * Returns whether the given [KtType] is an array or a primitive array type and its element is also an array type or not.\n */"} {"signature":"fun String . asSimpleName ( ) : String","body":"= if ( this in kotlinKeywords || this . contains ( \"\" ) ) { \"\" } else { this . replace ( '' , '' ) }","docstring":"/**\n * For this identifier constructs the string to be parsed by Kotlin as `SimpleName`\n * defined [here](https://kotlinlang.org/docs/reference/grammar.html#SimpleName).\n */"} {"signature":"internal fun mangleSimple ( name : String ) : String","body":"{ val reserved = setOf ( \"\" ) val postfix = \"\" return if ( name in reserved ) \"\" else name }","docstring":"/**\n * Yet another mangler, particularly to avoid secondary clash, e.g. when a property\n * in prototype (interface) is mangled and that will cause another clash in the class\n * which implements this interface.\n * Rationale: keep algorithm simple but use the mangling characters which are rare\n * in normal code, and keep mangling easy readable.\n */"} {"signature":"fun String . quoteAsKotlinLiteral ( ) : KotlinExpression","body":"= buildString { append ( '' ) this@quoteAsKotlinLiteral . forEach { c -> when ( c ) { in charactersAllowedInKotlinStringLiterals -> append ( c ) '' -> append ( \"\" ) else -> append ( \"\" + \"\" . format ( c . code ) ) } } append ( '' ) }","docstring":"/**\n * Returns the expression to be parsed by Kotlin as string literal with given contents,\n * i.e. transforms `foo$bar` to `\"foo\\$bar\"`.\n */"} {"signature":"public fun < T > interceptContinuation ( continuation : Continuation < T > ) : Continuation < T >","body":"public fun < T > interceptContinuation ( continuation : Continuation < T > ) : Continuation < T >","docstring":"/**\n * Returns continuation that wraps the original [continuation], thus intercepting all resumptions.\n * This function is invoked by coroutines framework when needed and the resulting continuations are\n * cached internally per each instance of the original [continuation].\n *\n * This function may simply return original [continuation] if it does not want to intercept this particular continuation.\n *\n * When the original [continuation] completes, coroutine framework invokes [releaseInterceptedContinuation]\n * with the resulting continuation if it was intercepted, that is if `interceptContinuation` had previously\n * returned a different continuation instance.\n */"} {"signature":"public fun releaseInterceptedContinuation ( continuation : Continuation < * > )","body":"{ }","docstring":"/**\n * Invoked for the continuation instance returned by [interceptContinuation] when the original\n * continuation completes and will not be used anymore. This function is invoked only if [interceptContinuation]\n * had returned a different continuation instance from the one it was invoked with.\n *\n * Default implementation does nothing.\n *\n * @param continuation Continuation instance returned by this interceptor's [interceptContinuation] invocation.\n */"} {"signature":"fun isSuccessful ( ) : Boolean","body":"fun isSuccessful ( ) : Boolean","docstring":"/**\n * Returns `true` if constraint system has a solution (has no contradiction and has enough information to infer each registered type variable).\n */"} {"signature":"fun hasContradiction ( ) : Boolean","body":"fun hasContradiction ( ) : Boolean","docstring":"/**\n * Return `true` if constraint system has no contradiction (it can be not successful because of the lack of information for a type variable).\n */"} {"signature":"fun hasConflictingConstraints ( ) : Boolean","body":"fun hasConflictingConstraints ( ) : Boolean","docstring":"/**\n * Returns `true` if type constraints for some type variable are contradicting.\n *\n * For example, for `fun foo(r: R, t: java.util.List) {}` in invocation `foo(1, arrayList(\"s\"))`\n * type variable `R` has two conflicting constraints:\n * - \"R is a supertype of Int\"\n * - \"List is a supertype of List\" which leads to \"R is equal to String\"\n */"} {"signature":"fun hasViolatedUpperBound ( ) : Boolean","body":"fun hasViolatedUpperBound ( ) : Boolean","docstring":"/**\n * Returns `true` if contradiction of type constraints comes from declared bounds for type parameters.\n *\n * For example, for `fun foo(r: R) {}` in invocation `foo(null)`\n * upper bounds `Any` for type parameter `R` is violated.\n *\n * It's the special case of 'hasConflictingConstraints' case.\n */"} {"signature":"fun hasUnknownParameters ( ) : Boolean","body":"fun hasUnknownParameters ( ) : Boolean","docstring":"/**\n * Returns `true` if there is no information for some registered type variable.\n *\n * For example, for `fun newList()` in invocation `val nl = newList()`\n * there is no information to infer type variable `E`.\n */"} {"signature":"fun hasParameterConstraintError ( ) : Boolean","body":"fun hasParameterConstraintError ( ) : Boolean","docstring":"/**\n * Returns `true` if some constraint cannot be processed because of type constructor mismatch.\n *\n * For example, for `fun foo(t: List) {}` in invocation `foo(hashSetOf(\"s\"))`\n * there is type constructor mismatch: \"HashSet cannot be a subtype of List\".\n */"} {"signature":"fun hasOnlyErrorsDerivedFrom ( kind : ConstraintPositionKind ) : Boolean","body":"fun hasOnlyErrorsDerivedFrom ( kind : ConstraintPositionKind ) : Boolean","docstring":"/**\n * Returns `true` if there is type constructor mismatch only in constraintPosition or\n * constraint system is successful without constraints from this position.\n */"} {"signature":"fun hasErrorInConstrainingTypes ( ) : Boolean","body":"fun hasErrorInConstrainingTypes ( ) : Boolean","docstring":"/**\n * Returns `true` if there is an error in constraining types.\n * Is used not to generate type inference error if there was one in argument types.\n */"} {"signature":"fun hasCannotCaptureTypesError ( ) : Boolean","body":"fun hasCannotCaptureTypesError ( ) : Boolean","docstring":"/**\n * Returns `true` if a user type contains the type projection that cannot be captured.\n *\n * For example, for `fun foo(t: Array>) {}`\n * in invocation `foo(array)` where `array` has type `Array>`.\n */"} {"signature":"fun hasTypeInferenceIncorporationError ( ) : Boolean","body":"fun hasTypeInferenceIncorporationError ( ) : Boolean","docstring":"/**\n * Returns `true` if there's an error in constraint system incorporation.\n */"} {"signature":"public fun formatLine ( columnSeparator : String , columnWidths : List < Int > , rows : List < String > ) : String","body":"{ return columnWidths . mapIndexed { index , columnWidth -> ( rows . getOrNull ( index ) ? : \"\" ) . padEnd ( columnWidth ) } . joinToString ( separator = columnSeparator ) }","docstring":"/**\n * Format a list of strings to a single line with appropriate paddings for each column.\n * @param [columnSeparator] sequence of symbols to separate columns\n * @param [columnWidths] widths of all columns\n * @param [rows] list of strings to substitute to columns\n */"} {"signature":"public fun formatTable ( sections : List < Section > , columnSeparator : String = \"\" , lineSeparatorSymbol : Char = '' , thickLineSeparatorSymbol : Char = '' , ) : List < String >","body":"{ require ( sections . isNotEmpty ( ) ) { \"\" } val sectionsWithColumns = sections . filterIsInstance < SectionWithColumns > ( ) val columnsCount = sectionsWithColumns . maxOf { it . columnsCount } val columnWidth = List ( columnsCount ) { column -> sectionsWithColumns . maxOfOrNull { section -> section . columnWidth ( column ) } ? : } val simpleSectionsWidth = sections . filterIsInstance < SimpleSection > ( ) . maxOfOrNull ( SimpleSection :: width ) ? : val sectionsWithColumnWidth = columnWidth . sum ( ) + ( columnWidth . size - ) . coerceAtLeast ( ) * columnSeparator . length val tableWidth = max ( simpleSectionsWidth , sectionsWithColumnWidth ) val result = mutableListOf < String > ( ) for ( section in sections ) { val lines = when ( section ) { is SimpleSection -> section . format ( tableWidth , lineSeparatorSymbol , thickLineSeparatorSymbol ) is SectionWithColumns -> section . format ( columnWidth , tableWidth , columnSeparator , lineSeparatorSymbol , thickLineSeparatorSymbol ) } result . addAll ( lines ) } return result }","docstring":"/**\n * Pretty print table from multiple sections.\n * Each section consists of multiple rows, each row may consist of multiple lines.\n * Sections may or may not have columns.\n *\n * @see [Section]\n * @param [sections] list of sections to print\n * @param [columnSeparator] sequence of symbols to separate columns\n * @param [lineSeparatorSymbol] character that will be used to produce a string to separate rows.\n * @param [thickLineSeparatorSymbol] character that will be used to produce a string to separate sections.\n */"} {"signature":"public fun format ( tableWidth : Int , lineSeparatorSymbol : Char = '' , thickLineSeparatorSymbol : Char = '' , ) : List < String >","body":"{ require ( tableWidth >= width ) { \"\" } val thickLineSeparator = thickLineSeparatorSymbol . toString ( ) . repeat ( tableWidth ) val lineSeparator = lineSeparatorSymbol . toString ( ) . repeat ( tableWidth ) val result = mutableListOf < String > ( ) result . add ( thickLineSeparator ) result . addAll ( rows ) result . add ( lineSeparator ) return result }","docstring":"/**\n * Format section to a list of strings, properly aligned with other sections.\n * @param [tableWidth] required width of the section to be aligned with other sections of the table\n * @param [lineSeparatorSymbol] symbol to use for line separator\n * @param [thickLineSeparatorSymbol] symbol to use for thick line separator\n */"} {"signature":"public fun columnWidth ( column : Int ) : Int","body":"{ return rows . maxOf { it . columnWidth ( column ) } . coerceAtLeast ( columnNames . getOrNull ( column ) ? . length ? : ) }","docstring":"/**\n * Calculate the width of the [column] in the section.\n * It is the maximum width of the column name and all the cells in the column.\n * If section has no column with the given index, returns 0.\n * @param [column] index of the column\n */"} {"signature":"public fun format ( alignedColumnsWidths : List < Int > , tableWidth : Int , columnSeparator : String = \"\" , lineSeparatorSymbol : Char = '' , thickLineSeparatorSymbol : Char = '' , ) : List < String >","body":"{ val lineSeparator = lineSeparatorSymbol . toString ( ) . repeat ( tableWidth ) val thickLineSeparator = thickLineSeparatorSymbol . toString ( ) . repeat ( tableWidth ) val result = mutableListOf < String > ( ) result . add ( formatLine ( columnSeparator , alignedColumnsWidths , columnNames ) ) result . add ( thickLineSeparator ) rows . forEach { row -> result . addAll ( row . format ( columnSeparator , alignedColumnsWidths ) ) result . add ( lineSeparator ) } return result }","docstring":"/**\n * Format section to a list of strings, properly aligned with other sections.\n * @param [alignedColumnsWidths] required widths of all columns to be aligned with other sections of the table\n * @param [columnSeparator] sequence of symbols to separate columns\n * @param [lineSeparatorSymbol] symbol to use for line separator\n * @param [thickLineSeparatorSymbol] symbol to use for thick line separator\n */"} {"signature":"public fun columnWidth ( column : Int ) : Int","body":"{ val cell = cells . getOrNull ( column ) ? : return return cell . width }","docstring":"/**\n * Calculate the width of the [column] in the section.\n * It is the maximum width of the column name and all the cells in the column.\n * If section has no column with the given index, returns 0.\n * @param [column] index of the column\n */"} {"signature":"public fun format ( columnSeparator : String , columnsWidths : List < Int > ) : List < String >","body":"{ return lines . map { line -> formatLine ( columnSeparator , columnsWidths , line ) } }","docstring":"/**\n * Format all lines of the row to fit the specified column widths.\n */"} {"signature":"fun pop ( ) : String ?","body":"{ if ( argumentsUsageNumber . isEmpty ( ) ) return null val ( currentDescriptor , usageNumber ) = argumentsUsageNumber . iterator ( ) . next ( ) currentDescriptor . number ? . let { if ( usageNumber + >= currentDescriptor . number ) { argumentsUsageNumber . remove ( currentDescriptor ) } else { argumentsUsageNumber [ currentDescriptor ] = usageNumber + } } return currentDescriptor . fullName }","docstring":"/**\n * Get next descriptor from queue.\n */"} {"signature":"operator fun getValue ( thisRef : Any ? , property : KProperty < * > ) : T","body":"= value","docstring":"/** Provides the value for the delegated property getter. Returns the [value] property.\n * @throws IllegalStateException in case of accessing the value before [ArgParser.parse] method is called.\n */"} {"signature":"operator fun setValue ( thisRef : Any ? , property : KProperty < * > , value : T )","body":"{ this . value = value }","docstring":"/** Sets the [value] to the [ArgumentValueDelegate.value] property from the delegated property setter.\n * This operation is possible only after command line arguments were parsed with [ArgParser.parse]\n * @throws IllegalStateException in case of resetting value before command line arguments are parsed.\n */"} {"signature":"abstract fun execute ( )","body":"abstract fun execute ( )","docstring":"/**\n * Execute action if subcommand was provided.\n */"} {"signature":"fun < T : Any > option ( type : ArgType < T > , fullName : String ? = null , shortName : String ? = null , description : String ? = null , deprecatedWarning : String ? = null ) : SingleNullableOption < T >","body":"{ if ( prefixStyle == OptionPrefixStyle . GNU && shortName != null ) require ( shortName . length == ) { \"\"\"\"\"\" . trimIndent ( ) } val option = SingleNullableOption ( OptionDescriptor ( optionFullFormPrefix , optionShortFromPrefix , type , fullName , shortName , description , deprecatedWarning = deprecatedWarning ) , CLIEntityWrapper ( ) ) option . owner . entity = option declaredOptions . add ( option . owner ) return option }","docstring":"/**\n * Declares a named option and returns an object which can be used to access the option value\n * after all arguments are parsed or to delegate a property for accessing the option value to.\n *\n * By default, the option supports only a single value, is optional, and has no default value,\n * therefore its value's type is `T?`.\n *\n * You can alter the option properties by chaining extensions for the option type on the returned object:\n * - [AbstractSingleOption.default] to provide a default value that is used when the option is not specified;\n * - [SingleNullableOption.required] to make the option non-optional;\n * - [AbstractSingleOption.delimiter] to allow specifying multiple values in one command line argument with a delimiter;\n * - [AbstractSingleOption.multiple] to allow specifying the option several times.\n *\n * @param type The type describing how to parse an option value from a string,\n * an instance of [ArgType], e.g. [ArgType.String] or [ArgType.Choice].\n * @param fullName the full name of the option, can be omitted if the option name is inferred\n * from the name of a property delegated to this option.\n * @param shortName the short name of the option, `null` if the option cannot be specified in a short form.\n * @param description the description of the option used when rendering the usage information.\n * @param deprecatedWarning the deprecation message for the option.\n * Specifying anything except `null` makes this option deprecated. The message is rendered in a help message and\n * issued as a warning when the option is encountered when parsing command line arguments.\n */"} {"signature":"private fun inspectRequiredAndDefaultUsage ( )","body":"{ var previousArgument : ParsingValue < * , * > ? = null arguments . forEach { ( _ , currentArgument ) -> previousArgument ? . let { previous -> if ( previous . descriptor . defaultValueSet ) { if ( ! currentArgument . descriptor . defaultValueSet && currentArgument . descriptor . required ) { error ( \"\" + \"\" ) } } if ( ! previous . descriptor . required ) { if ( ! currentArgument . descriptor . defaultValueSet && currentArgument . descriptor . required ) { error ( \"\" + \"\" ) } } } previousArgument = currentArgument } }","docstring":"/**\n * Check usage of required property for arguments.\n * Make sense only for several last arguments.\n */"} {"signature":"fun < T : Any > argument ( type : ArgType < T > , fullName : String ? = null , description : String ? = null , deprecatedWarning : String ? = null ) : SingleArgument < T , DefaultRequiredType . Required >","body":"{ val argument = SingleArgument < T , DefaultRequiredType . Required > ( ArgDescriptor ( type , fullName , , description , deprecatedWarning = deprecatedWarning ) , CLIEntityWrapper ( ) ) argument . owner . entity = argument declaredArguments . add ( argument . owner ) return argument }","docstring":"/**\n * Declares an argument and returns an object which can be used to access the argument value\n * after all arguments are parsed or to delegate a property for accessing the argument value to.\n *\n * By default, the argument supports only a single value, is required, and has no default value,\n * therefore its value's type is `T`.\n *\n * You can alter the argument properties by chaining extensions for the argument type on the returned object:\n * - [AbstractSingleArgument.default] to provide a default value that is used when the argument is not specified;\n * - [SingleArgument.optional] to allow omitting the argument;\n * - [AbstractSingleArgument.multiple] to require the argument to have exactly the number of values specified;\n * - [AbstractSingleArgument.vararg] to allow specifying an unlimited number of values for the _last_ argument.\n *\n * @param type The type describing how to parse an option value from a string,\n * an instance of [ArgType], e.g. [ArgType.String] or [ArgType.Choice].\n * @param fullName the full name of the argument, can be omitted if the argument name is inferred\n * from the name of a property delegated to this argument.\n * @param description the description of the argument used when rendering the usage information.\n * @param deprecatedWarning the deprecation message for the argument.\n * Specifying anything except `null` makes this argument deprecated. The message is rendered in a help message and\n * issued as a warning when the argument is encountered when parsing command line arguments.\n */"} {"signature":"@ ExperimentalCli fun subcommands ( vararg subcommandsList : Subcommand )","body":"{ subcommandsList . forEach { if ( it . name in subcommands ) { error ( \"\" ) } it . prefixStyle = prefixStyle it . useDefaultHelpShortName = useDefaultHelpShortName it . strictSubcommandOptionsOrder = strictSubcommandOptionsOrder fullCommandName . forEachIndexed { index , namePart -> it . fullCommandName . add ( index , namePart ) } it . outputAndTerminate = outputAndTerminate subcommands [ it . name ] = it } }","docstring":"/**\n * Registers one or more subcommands.\n *\n * @param subcommandsList subcommands to add.\n */"} {"signature":"private fun printError ( message : String ) : Nothing","body":"{ outputAndTerminate ( \"\" , ) }","docstring":"/**\n * Outputs an error message adding the usage information after it.\n *\n * @param message error message.\n */"} {"signature":"private fun saveAsArg ( arg : String , argumentsQueue : ArgumentsQueue ) : Boolean","body":"{ val name = argumentsQueue . pop ( ) name ? . let { val argumentValue = arguments [ name ] ! ! argumentValue . descriptor . deprecatedWarning ? . let { printWarning ( it ) } argumentValue . addValue ( arg ) return true } return false }","docstring":"/**\n * Save value as argument value.\n *\n * @param arg string with argument value.\n * @param argumentsQueue queue with active argument descriptors.\n */"} {"signature":"private fun treatAsArgument ( arg : String , argumentsQueue : ArgumentsQueue )","body":"{ if ( ! saveAsArg ( arg , argumentsQueue ) ) { usedSubcommand ? . let { ( if ( treatAsOption ) subcommandsOptions else subcommandsArguments ) . add ( arg ) } ? : printError ( \"\" ) } }","docstring":"/**\n * Treat value as argument value.\n *\n * @param arg string with argument value.\n * @param argumentsQueue queue with active argument descriptors.\n */"} {"signature":"private fun < T : Any , U : Any > saveAsOption ( parsingValue : ParsingValue < T , U > , value : String )","body":"{ parsingValue . addValue ( value ) }","docstring":"/**\n * Save value as option value.\n */"} {"signature":"private fun recognizeAndSaveOptionFullForm ( candidate : String , argIterator : Iterator < String > ) : Boolean","body":"{ if ( prefixStyle == OptionPrefixStyle . GNU && candidate == optionFullFormPrefix ) { treatAsOption = false return false } if ( ! candidate . startsWith ( optionFullFormPrefix ) ) return false val optionString = candidate . substring ( optionFullFormPrefix . length ) val argValue = if ( prefixStyle == OptionPrefixStyle . GNU ) null else options [ optionString ] if ( argValue != null ) { saveStandardOptionForm ( argValue , argIterator ) return true } else { if ( prefixStyle == OptionPrefixStyle . GNU ) { if ( options [ optionString ] ? . descriptor ? . type ? . hasParameter == false ) { saveOptionWithoutParameter ( options [ optionString ] ! ! ) return true } val optionParts = optionString . split ( '' , limit = ) if ( optionParts . size != ) return false if ( options [ optionParts [ ] ] != null ) { saveAsOption ( options [ optionParts [ ] ] ! ! , optionParts [ ] ) return true } } } return false }","docstring":"/**\n * Try to recognize and save command line element as full form of option.\n *\n * @param candidate string with candidate in options.\n * @param argIterator iterator over command line arguments.\n */"} {"signature":"internal fun saveOptionWithoutParameter ( argValue : ParsingValue < * , * > )","body":"{ if ( argValue . descriptor . fullName == \"\" ) { usedSubcommand ? . let { it . parse ( listOf ( \"\" ) ) } outputAndTerminate ( makeUsage ( ) , ) } saveAsOption ( argValue , \"\" ) }","docstring":"/**\n * Save option without parameter.\n *\n * @param argValue argument value with all information about option.\n */"} {"signature":"private fun saveStandardOptionForm ( argValue : ParsingValue < * , * > , argIterator : Iterator < String > )","body":"{ if ( argValue . descriptor . type . hasParameter ) { if ( argIterator . hasNext ( ) ) { saveAsOption ( argValue , argIterator . next ( ) ) } else { printError ( \"\" ) } } else { saveOptionWithoutParameter ( argValue ) } }","docstring":"/**\n * Save option described with standard separated form `--name value`.\n *\n * @param argValue argument value with all information about option.\n * @param argIterator iterator over command line arguments.\n */"} {"signature":"private fun recognizeAndSaveOptionShortForm ( candidate : String , argIterator : Iterator < String > ) : Boolean","body":"{ if ( ! candidate . startsWith ( optionShortFromPrefix ) || optionFullFormPrefix != optionShortFromPrefix && candidate . startsWith ( optionFullFormPrefix ) ) return false val option = candidate . substring ( optionShortFromPrefix . length ) val argValue = shortNames [ option ] if ( argValue != null ) { saveStandardOptionForm ( argValue , argIterator ) } else { if ( prefixStyle != OptionPrefixStyle . GNU || option . isEmpty ( ) ) return false val firstOption = shortNames [ \"\" ] ? : return false if ( firstOption . descriptor . type . hasParameter ) { saveAsOption ( firstOption , option . substring ( ) ) } else { val otherBooleanOptions = option . substring ( ) saveOptionWithoutParameter ( firstOption ) for ( opt in otherBooleanOptions ) { shortNames [ \"\" ] ? . let { if ( it . descriptor . type . hasParameter ) { printError ( \"\" + \"\" + \"\" ) } } ? : printError ( \"\" ) saveOptionWithoutParameter ( shortNames [ \"\" ] ! ! ) } } } return true }","docstring":"/**\n * Try to recognize and save command line element as short form of option.\n *\n * @param candidate string with candidate in options.\n * @param argIterator iterator over command line arguments.\n */"} {"signature":"fun parse ( args : Array < out String > ) : ArgParserResult","body":"= parse ( args . asList ( ) )","docstring":"/**\n * Parses the provided array of command line arguments.\n * After a successful parsing, the options and arguments declared in this parser get their values and can be accessed\n * with the properties delegated to them.\n *\n * @param args the array with command line arguments.\n *\n * @return an [ArgParserResult] if all arguments were parsed successfully.\n * Otherwise, prints the usage information and terminates the program execution.\n * @throws IllegalStateException in case of attempt of calling parsing several times.\n */"} {"signature":"internal fun makeUsage ( ) : String","body":"{ val result = StringBuilder ( ) result . append ( \"\" ) if ( subcommands . isNotEmpty ( ) ) { result . append ( \"\" ) subcommands . forEach { ( _ , subcommand ) -> result . append ( subcommand . helpMessage ) } result . append ( \"\" ) } if ( arguments . isNotEmpty ( ) ) { result . append ( \"\" ) arguments . forEach { result . append ( it . value . descriptor . helpMessage ) } } if ( options . isNotEmpty ( ) ) { result . append ( \"\" ) options . forEach { result . append ( it . value . descriptor . helpMessage ) } } return result . toString ( ) }","docstring":"/**\n * Creates a message with the usage information.\n */"} {"signature":"internal fun printWarning ( message : String )","body":"{ println ( \"\" ) }","docstring":"/**\n * Output warning.\n *\n * @param message warning message.\n */"} {"signature":"private fun jumpWithFinally ( targetTryDepth : Int , successor : CoroutineBlock , fromNode : JsNode )","body":"{ if ( targetTryDepth < tryStack . size ) { val tryBlock = tryStack [ targetTryDepth ] currentStatements += exceptionState ( tryBlock . catchBlock , fromNode ) } val relativeFinallyPath = relativeFinallyPath ( targetTryDepth ) val fullPath = relativeFinallyPath + successor if ( fullPath . size > ) { currentStatements += updateFinallyPath ( fullPath . drop ( ) ) } currentStatements += state ( fullPath [ ] , fromNode ) }","docstring":"/**\n * When we perform break, continue or return, we can leave try blocks, so we should update $exceptionHandler correspondingly.\n * Also, these try blocks can contain finally clauses, therefore we need to update $finallyPath as well.\n */"} {"signature":"public fun getAllSymbols ( ) : Sequence < KtDeclarationSymbol >","body":"= withValidityAssertion { sequence { yieldAll ( getCallableSymbols ( ) ) yieldAll ( getClassifierSymbols ( ) ) yieldAll ( getConstructors ( ) ) } }","docstring":"/**\n * Return a sequence of all [KtDeclarationSymbol] which current scope contain\n */"} {"signature":"public fun getCallableSymbols ( nameFilter : KtScopeNameFilter = { true } ) : Sequence < KtCallableSymbol >","body":"public fun getCallableSymbols ( nameFilter : KtScopeNameFilter = { true } ) : Sequence < KtCallableSymbol >","docstring":"/**\n * Return a sequence of [KtCallableSymbol] which current scope contain if declaration name matches [nameFilter].\n *\n * This function needs to retrieve a set of all possible names before processing the scope.\n * The overload with `names: Collection` should be used when the candidate name set is known.\n */"} {"signature":"public fun getCallableSymbols ( names : Collection < Name > ) : Sequence < KtCallableSymbol >","body":"public fun getCallableSymbols ( names : Collection < Name > ) : Sequence < KtCallableSymbol >","docstring":"/**\n * Return a sequence of [KtCallableSymbol] which current scope contain, if declaration name present in [names]\n *\n * This implementation is more optimal than the one with `nameFilter` and should be used when the candidate name set is known.\n */"} {"signature":"public fun getCallableSymbols ( vararg names : Name ) : Sequence < KtCallableSymbol >","body":"= getCallableSymbols ( names . toList ( ) )","docstring":"/**\n * Return a sequence of [KtCallableSymbol] which current scope contain, if declaration name present in [names]\n *\n * @see getCallableSymbols\n */"} {"signature":"public fun getClassifierSymbols ( nameFilter : KtScopeNameFilter = { true } ) : Sequence < KtClassifierSymbol >","body":"public fun getClassifierSymbols ( nameFilter : KtScopeNameFilter = { true } ) : Sequence < KtClassifierSymbol >","docstring":"/**\n * Return a sequence of [KtClassifierSymbol] which current scope contain if classifier name matches [nameFilter]. The sequence includes:\n * nested classes, inner classes, nested type aliases for the class scope, and top-level classes and top-level type aliases for file scope.\n *\n * This function needs to retrieve a set of all possible names before processing the scope.\n * The overload with `names: Collection` should be used when the candidate name set is known.\n */"} {"signature":"public fun getClassifierSymbols ( names : Collection < Name > ) : Sequence < KtClassifierSymbol >","body":"public fun getClassifierSymbols ( names : Collection < Name > ) : Sequence < KtClassifierSymbol >","docstring":"/**\n * Return a sequence of [KtClassifierSymbol] which current scope contains, if classifier name present in [names].\n *\n * The sequence includes: nested classes, inner classes, nested type aliases for the class scope,\n * and top-level classes and top-level type aliases for file scope.\n *\n * This implementation is more optimal than the one with `nameFilter` and should be used when the candidate name set is known.\n */"} {"signature":"public fun getClassifierSymbols ( vararg names : Name ) : Sequence < KtClassifierSymbol >","body":"= getClassifierSymbols ( names . toList ( ) )","docstring":"/**\n * Return a sequence of [KtClassifierSymbol] which current scope contains, if classifier name present in [names].\n *\n * @see getClassifierSymbols\n */"} {"signature":"public fun getConstructors ( ) : Sequence < KtConstructorSymbol >","body":"public fun getConstructors ( ) : Sequence < KtConstructorSymbol >","docstring":"/**\n * Return a sequence of [KtConstructorSymbol] which current scope contain\n */"} {"signature":"public fun getPackageSymbols ( nameFilter : KtScopeNameFilter = { true } ) : Sequence < KtPackageSymbol >","body":"public fun getPackageSymbols ( nameFilter : KtScopeNameFilter = { true } ) : Sequence < KtPackageSymbol >","docstring":"/**\n * Return a sequence of [KtPackageSymbol] nested in current scope contain if package name matches [nameFilter]\n */"} {"signature":"@ kotlin . jvm . JvmSynthetic @ kotlin . jvm . JvmName ( \"\" ) fun com . google . protobuf . kotlin . DslList < kotlin . String , FilesProxy > . add ( value : kotlin . String )","body":"{ _builder . addFiles ( value ) }","docstring":"/**\n * repeated string files = 1;\n * @param value The files to add.\n */"} {"signature":"@ kotlin . jvm . JvmSynthetic @ kotlin . jvm . JvmName ( \"\" ) @ Suppress ( \"\" ) inline operator fun com . google . protobuf . kotlin . DslList < kotlin . String , FilesProxy > . plusAssign ( value : kotlin . String )","body":"{ add ( value ) }","docstring":"/**\n * repeated string files = 1;\n * @param value The files to add.\n */"} {"signature":"@ kotlin . jvm . JvmSynthetic @ kotlin . jvm . JvmName ( \"\" ) fun com . google . protobuf . kotlin . DslList < kotlin . String , FilesProxy > . addAll ( values : kotlin . collections . Iterable < kotlin . String > )","body":"{ _builder . addAllFiles ( values ) }","docstring":"/**\n * repeated string files = 1;\n * @param values The files to add.\n */"} {"signature":"@ kotlin . jvm . JvmSynthetic @ kotlin . jvm . JvmName ( \"\" ) @ Suppress ( \"\" ) inline operator fun com . google . protobuf . kotlin . DslList < kotlin . String , FilesProxy > . plusAssign ( values : kotlin . collections . Iterable < kotlin . String > )","body":"{ addAll ( values ) }","docstring":"/**\n * repeated string files = 1;\n * @param values The files to add.\n */"} {"signature":"@ kotlin . jvm . JvmSynthetic @ kotlin . jvm . JvmName ( \"\" ) operator fun com . google . protobuf . kotlin . DslList < kotlin . String , FilesProxy > . set ( index : kotlin . Int , value : kotlin . String )","body":"{ _builder . setFiles ( index , value ) }","docstring":"/**\n * repeated string files = 1;\n * @param index The index to set the value at.\n * @param value The files to set.\n */"} {"signature":"@ kotlin . jvm . JvmSynthetic @ kotlin . jvm . JvmName ( \"\" ) fun com . google . protobuf . kotlin . DslList < kotlin . String , FilesProxy > . clear ( )","body":"{ _builder . clearFiles ( ) }","docstring":"/**\n * repeated string files = 1;\n */"} {"signature":"public fun < T : Any > JsReference < T > . get ( ) : T","body":"{ returnArgumentIfItIsKotlinAny ( ) throw ClassCastException ( \"\" ) }","docstring":"/** Retrieve original Kotlin value from JsReference */"} {"signature":"private fun readResolve ( ) : Any","body":"{ @ Suppress ( \"\" , \"\" ) if ( capabilities == null || attributes == null ) { return copy ( capabilities = capabilities ? : emptySet ( ) , attributes = attributes ? : IdeaKotlinBinaryAttributes ( ) ) } return this }","docstring":"/**\n * In order to keep java.io.Serializable implementation backwards compatible:\n * 'capabilities' was added in 1.9.20. If a binary produced before 1.9.20 gets deserialized, then 'capabilities'\n * will be 'null'. In this case we use the 'copy' function to provide an instance that will have an emptySet instead.\n */"} {"signature":"@ Suppress ( \"\" ) @ Deprecated ( \"\" , level = DeprecationLevel . ERROR ) fun copy ( buildId : String = this . buildId , projectPath : String = this . projectPath , projectName : String = this . projectName , ) : IdeaKotlinProjectCoordinates","body":"{ return if ( this . buildId != buildId ) { IdeaKotlinProjectCoordinates ( buildId = buildId , projectPath = projectPath , projectName = projectName ) } else { IdeaKotlinProjectCoordinates ( buildName = buildName , buildPath = buildPath , projectPath = projectPath , projectName = projectName ) } }","docstring":"/**\n * Keeping binary compatibility!\n */"} {"signature":"@ Deprecated ( \"\" , level = DeprecationLevel . ERROR ) @ Suppress ( \"\" ) operator fun component1 ( )","body":"= buildId","docstring":"/**\n * Keeping binary compatibility!\n */"} {"signature":"@ Deprecated ( \"\" , level = DeprecationLevel . ERROR ) operator fun component2 ( )","body":"= projectPath","docstring":"/**\n * Keeping binary compatibility!\n */"} {"signature":"@ Deprecated ( \"\" , level = DeprecationLevel . ERROR ) operator fun component3 ( )","body":"= projectName","docstring":"/**\n * Keeping binary compatibility!\n */"} {"signature":"internal fun String . utf8Size ( startIndex : Int = , endIndex : Int = length ) : Long","body":"{ checkBounds ( length , startIndex , endIndex ) var result = var i = startIndex while ( i < endIndex ) { val c = this [ i ] . code if ( c < ) { result ++ i ++ } else if ( c < ) { result += i ++ } else if ( c < || c > ) { result += i ++ } else { val low = if ( i + < endIndex ) this [ i + ] . code else if ( c > || low < || low > ) { result ++ i ++ } else { result += i += } } } return result }","docstring":"/**\n * Returns the number of bytes used to encode the slice of `string` as UTF-8 when using [Sink.writeString].\n *\n * @param startIndex the index (inclusive) of the first character to encode, `0` by default.\n * @param endIndex the index (exclusive) of the character past the last character to encode, `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 *\n * @sample kotlinx.io.samples.KotlinxIoCoreCommonSamples.utf8SizeSample\n */"} {"signature":"@ OptIn ( DelicateIoApi :: class ) internal fun Sink . writeUtf8CodePoint ( codePoint : Int ) : Unit","body":"= writeToInternalBuffer { it . commonWriteUtf8CodePoint ( codePoint ) }","docstring":"/**\n * Encodes [codePoint] in UTF-8 and writes it to this sink.\n *\n * @param codePoint the codePoint to be written.\n *\n * @throws IllegalStateException when the sink is closed.\n *\n * @sample kotlinx.io.samples.KotlinxIoCoreCommonSamples.utf8CodePointSample\n */"} {"signature":"@ OptIn ( DelicateIoApi :: class ) public fun Sink . writeString ( string : String , startIndex : Int = , endIndex : Int = string . length ) : Unit","body":"= writeToInternalBuffer { it . commonWriteUtf8 ( string , startIndex , endIndex ) }","docstring":"/**\n * Encodes the characters at [startIndex] up to [endIndex] from [string] in UTF-8 and writes it to this sink.\n *\n * @param string the string to be encoded.\n * @param startIndex the index (inclusive) of the first character to encode, 0 by default.\n * @param endIndex the index (exclusive) of a character past to a last character to encode, `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.KotlinxIoCoreCommonSamples.writeUtf8Sample\n */"} {"signature":"@ OptIn ( InternalIoApi :: class ) public fun Source . readString ( ) : String","body":"{ var req : Long = Segment . SIZE . toLong ( ) while ( request ( req ) ) { req *= } return buffer . commonReadUtf8 ( buffer . size ) }","docstring":"/**\n * Removes all bytes from this source, decodes them as UTF-8, and returns the string.\n *\n * Returns the empty string if this source is empty.\n *\n * @throws IllegalStateException when the source is closed.\n *\n * @sample kotlinx.io.samples.KotlinxIoCoreCommonSamples.readUtf8\n */"} {"signature":"public fun Buffer . readString ( ) : String","body":"{ return commonReadUtf8 ( size ) }","docstring":"/**\n * Removes all bytes from this buffer, decodes them as UTF-8, and returns the string.\n *\n * Returns the empty string if this buffer is empty.\n *\n * @sample kotlinx.io.samples.KotlinxIoCoreCommonSamples.readUtf8\n */"} {"signature":"@ OptIn ( InternalIoApi :: class ) public fun Source . readString ( byteCount : Long ) : String","body":"{ require ( byteCount ) return buffer . commonReadUtf8 ( byteCount ) }","docstring":"/**\n * Removes [byteCount] bytes from this source, decodes them as UTF-8, and returns the string.\n *\n * @param byteCount the number of bytes to read from the source for string decoding.\n *\n * @throws IllegalArgumentException when [byteCount] is negative.\n * @throws EOFException when the source is exhausted before reading [byteCount] bytes from it.\n * @throws IllegalStateException when the source is closed.\n *\n * @sample kotlinx.io.samples.KotlinxIoCoreCommonSamples.readUtf8\n */"} {"signature":"@ OptIn ( InternalIoApi :: class ) internal fun Source . readUtf8CodePoint ( ) : Int","body":"{ require ( ) val b0 = buffer [ ] . toInt ( ) when { b0 and == -> require ( ) b0 and == -> require ( ) b0 and == -> require ( ) } return buffer . commonReadUtf8CodePoint ( ) }","docstring":"/**\n * Removes and returns a single UTF-8 code point, reading between 1 and 4 bytes as necessary.\n *\n * If this source is exhausted before a complete code point can be read, this throws an\n * [EOFException] and consumes no input.\n *\n * If this source doesn't start with a properly-encoded UTF-8 code point, this method will remove\n * 1 or more non-UTF-8 bytes and return the replacement character (`U+fffd`). This covers encoding\n * problems (the input is not properly-encoded UTF-8), characters out of range (beyond the\n * `0x10ffff` limit of Unicode), code points for UTF-16 surrogates (`U+d800`..`U+dfff`) and overlong\n * encodings (such as `0xc080` for the NUL character in modified UTF-8).\n *\n * @throws EOFException when the source is exhausted before a complete code point can be read.\n * @throws IllegalStateException when the source is closed.\n *\n * @sample kotlinx.io.samples.KotlinxIoCoreCommonSamples.readUtf8CodePointSample\n */"} {"signature":"internal fun Buffer . readUtf8CodePoint ( ) : Int","body":"{ return this . commonReadUtf8CodePoint ( ) }","docstring":"/**\n * @see Source.readUtf8CodePoint\n */"} {"signature":"@ OptIn ( InternalIoApi :: class ) public fun Source . readLine ( ) : String ?","body":"{ if ( ! request ( ) ) return null var lfIndex = this . indexOf ( '' . code . toByte ( ) ) return when ( lfIndex ) { - -> readString ( ) -> { skip ( ) \"\" } else -> { var skipBytes = if ( buffer [ lfIndex - ] == '' . code . toByte ( ) ) { lfIndex -= skipBytes += } val string = readString ( lfIndex ) skip ( skipBytes . toLong ( ) ) string } } }","docstring":"/**\n * Removes and returns UTF-8 encoded characters up to but not including the next line break. A line break is\n * either `\"\\n\"` or `\"\\r\\n\"`; these characters are not included in the result.\n *\n * On the end of the stream this method returns null. If the source doesn't end with a line break, then\n * an implicit line break is assumed. Null is returned once the source is exhausted.\n *\n * @throws IllegalStateException when the source is closed.\n *\n * @sample kotlinx.io.samples.KotlinxIoCoreCommonSamples.readLinesSample\n */"} {"signature":"@ OptIn ( InternalIoApi :: class ) public fun Source . readLineStrict ( limit : Long = Long . MAX_VALUE ) : String","body":"{ require ( limit >= ) { \"\" } require ( ) var lfIndex = indexOf ( '' . code . toByte ( ) , startIndex = , endIndex = limit ) if ( lfIndex == ) { skip ( ) return \"\" } if ( lfIndex > ) { var skipBytes = if ( buffer [ lfIndex - ] == '' . code . toByte ( ) ) { lfIndex -= skipBytes += } val str = readString ( lfIndex ) skip ( skipBytes ) return str } if ( buffer . size < limit ) throw EOFException ( ) if ( limit == Long . MAX_VALUE ) throw EOFException ( ) if ( ! request ( limit + ) ) throw EOFException ( ) val b = buffer [ limit ] if ( b == '' . code . toByte ( ) ) { val str = readString ( limit ) skip ( ) return str } if ( b != '' . code . toByte ( ) || ! request ( limit + ) ) throw EOFException ( ) if ( buffer [ limit + ] != '' . code . toByte ( ) ) throw EOFException ( ) val res = readString ( limit ) skip ( ) return res }","docstring":"/**\n * Removes and returns UTF-8 encoded characters up to but not including the next line break, throwing\n * [EOFException] if a line break was not encountered. A line break is either `\"\\n\"` or `\"\\r\\n\"`;\n * these characters are not included in the result.\n *\n * The returned string will have at most [limit] UTF-8 bytes, and the maximum number of bytes\n * scanned is `limit + 2`. If `limit == 0` this will always throw an [EOFException] because no\n * bytes will be scanned.\n *\n * No bytes are discarded if the match fails.\n *\n * @param limit the maximum UTF-8 bytes constituting a returned string.\n *\n * @throws EOFException when the source does not contain a string consisting with at most [limit] bytes followed by\n * line break characters.\n * @throws IllegalStateException when the source is closed.\n * @throws IllegalArgumentException when [limit] is negative.\n *\n * @sample kotlinx.io.samples.KotlinxIoCoreCommonSamples.readLinesSample\n */"} {"signature":"fun KtSimpleNameExpression . getQualifiedElement ( ) : KtElement","body":"{ val baseExpression = ( parent as? KtCallExpression ) ? : this val parent = baseExpression . parent return when ( parent ) { is KtQualifiedExpression -> if ( parent . selectorExpression == baseExpression ) parent else baseExpression is KtUserType -> if ( parent . referenceExpression == baseExpression ) parent else baseExpression else -> baseExpression } }","docstring":"/**\n * Returns enclosing qualifying element for given [[KtSimpleNameExpression]]\n * ([[KtQualifiedExpression]] or [[KtUserType]] or original expression)\n */"} {"signature":"fun KtElement . getQualifiedElementSelector ( ) : KtElement ?","body":"{ return when ( this ) { is KtSimpleNameExpression -> this is KtCallExpression -> calleeExpression is KtQualifiedExpression -> { val selector = selectorExpression ( selector as? KtCallExpression ) ? . calleeExpression ? : selector } is KtUserType -> referenceExpression else -> null } }","docstring":"/**\n * Returns rightmost selector of the qualified element (null if there is no such selector)\n */"} {"signature":"fun StubBasedPsiElementBase < out KotlinClassOrObjectStub < out KtClassOrObject > > . getSuperNames ( ) : List < String >","body":"{ fun addSuperName ( result : MutableList < String > , referencedName : String ) { result . add ( referencedName ) val file = containingFile if ( file is KtFile ) { getImportedSimpleNameByImportAlias ( file , referencedName ) ? . let ( result :: add ) } } require ( this is KtClassOrObject ) { \"\" } val stub = stub if ( stub != null ) { return stub . getSuperNames ( ) } val specifiers = this . superTypeListEntries if ( specifiers . isEmpty ( ) ) return Collections . emptyList ( ) val result = ArrayList < String > ( ) for ( specifier in specifiers ) { val superType = specifier . typeAsUserType if ( superType != null ) { val referencedName = superType . referencedName if ( referencedName != null ) { addSuperName ( result , referencedName ) } } } return result }","docstring":"/**\n * Returns the list of unqualified names that are indexed as the superclass names of this class. For the names that might be imported\n * via an aliased import, includes both the original and the aliased name (reference resolution during inheritor search will sort this out).\n *\n * @return the list of possible superclass names\n */"} {"signature":"fun KtSimpleNameExpression . isCallee ( ) : Boolean","body":"{ val parent = parent return when ( parent ) { is KtCallElement -> parent . calleeExpression == this is KtBinaryExpression -> parent . operationReference == this else -> { val callElement = getStrictParentOfType < KtUserType > ( ) ? . getStrictParentOfType < KtTypeReference > ( ) ? . getStrictParentOfType < KtConstructorCalleeExpression > ( ) ? . getStrictParentOfType < KtCallElement > ( ) if ( callElement != null ) { val ktConstructorCalleeExpression = callElement . calleeExpression as? KtConstructorCalleeExpression ( ktConstructorCalleeExpression ? . typeReference ? . typeElement as? KtUserType ) ? . referenceExpression == this } else { false } } } }","docstring":"/**\n * Check expression might be a callee of call with the same name.\n * Note that 'this' in 'this(args)' isn't considered to be a callee, also 'name' is not a callee in 'name++'.\n */"} {"signature":"internal abstract fun getOrBuildFirFor ( element : KtElement ) : FirElement ?","body":"internal abstract fun getOrBuildFirFor ( element : KtElement ) : FirElement ?","docstring":"/**\n * Build [FirElement] node in its final resolved state for a requested element.\n *\n * Note: that it isn't always [BODY_RESOLVE][FirResolvePhase.BODY_RESOLVE]\n * as not all declarations have types/bodies/etc. to resolve.\n *\n * This operation could be time-consuming because it creates\n * [FileStructureElement][org.jetbrains.kotlin.analysis.low.level.api.fir.file.structure.FileStructureElement]\n * and may resolve non-local declarations into [BODY_RESOLVE][FirResolvePhase.BODY_RESOLVE] phase.\n *\n * Please use [getOrBuildFirFile] to get [FirFile] in undefined phase.\n *\n * @return associated [FirElement] in final resolved state if it exists.\n *\n * @see getOrBuildFirFile\n * @see org.jetbrains.kotlin.analysis.low.level.api.fir.element.builder.FirElementBuilder.getOrBuildFirFor\n */"} {"signature":"internal abstract fun getOrBuildFirFile ( ktFile : KtFile ) : FirFile","body":"internal abstract fun getOrBuildFirFile ( ktFile : KtFile ) : FirFile","docstring":"/**\n * Get or build or get cached [FirFile] for requested file in undefined phase\n */"} {"signature":"internal fun getDiagnostics ( element : KtElement , filter : DiagnosticCheckerFilter ) : List < KtPsiDiagnostic >","body":"{ return diagnosticProvider . getDiagnostics ( element , filter ) }","docstring":"/**\n * @see LLDiagnosticProvider.getDiagnostics\n */"} {"signature":"internal fun collectDiagnosticsForFile ( ktFile : KtFile , filter : DiagnosticCheckerFilter ) : Collection < KtPsiDiagnostic >","body":"{ return diagnosticProvider . collectDiagnostics ( ktFile , filter ) }","docstring":"/**\n * @see LLDiagnosticProvider.collectDiagnostics\n */"} {"signature":"fun declaresDefaultValue ( ) : Boolean","body":"fun declaresDefaultValue ( ) : Boolean","docstring":"/**\n * @return true iff this parameter belongs to a declared function (not a fake override) and declares the default value,\n * i.e. explicitly specifies it in the function signature. Also see 'hasDefaultValue' extension in DescriptorUtils.kt\n */"} {"signature":"override fun getOverriddenDescriptors ( ) : Collection < ValueParameterDescriptor >","body":"override fun getOverriddenDescriptors ( ) : Collection < ValueParameterDescriptor >","docstring":"/**\n * Parameter p1 overrides p2 iff\n * a) their respective owners (function declarations) f1 override f2\n * b) p1 and p2 have the same indices in the owners' parameter lists\n */"} {"signature":"public fun NSOutputStream . asSink ( ) : RawSink","body":"= OutputStreamSink ( this )","docstring":"/**\n * Returns [RawSink] that writes to an output stream.\n *\n * Use [RawSink.buffered] to create a buffered sink from it.\n *\n * @sample kotlinx.io.samples.KotlinxIoSamplesApple.outputStreamAsSink\n */"} {"signature":"public fun NSInputStream . asSource ( ) : RawSource","body":"= NSInputStreamSource ( this )","docstring":"/**\n * Returns [RawSource] that reads from an input stream.\n *\n * Use [RawSource.buffered] to create a buffered source from it.\n *\n * @sample kotlinx.io.samples.KotlinxIoSamplesApple.inputStreamAsSource\n */"} {"signature":"protected abstract fun orderByDeclarationKind ( renderedDeclaration : RenderedDeclaration < * > ) : Int","body":"protected abstract fun orderByDeclarationKind ( renderedDeclaration : RenderedDeclaration < * > ) : Int","docstring":"/**\n * Determines the relative order of the given [renderedDeclaration] to put it upper or lower in the renderer's output.\n * The declarations of different kinds (ex: a class and a function) should always get a different order index.\n */"} {"signature":"override fun orderByDeclarationKind ( renderedDeclaration : RenderedDeclaration < * > )","body":"= when ( renderedDeclaration . declaration ) { is AbiClass -> is AbiProperty -> is AbiFunction -> else -> }","docstring":"/**\n * When printing top-level declarations, the following order is used:\n * 1. classes\n * 2. properties\n * 3. functions\n */"} {"signature":"override fun orderByDeclarationKind ( renderedDeclaration : RenderedDeclaration < * > )","body":"= when ( val declaration = renderedDeclaration . declaration ) { is AbiProperty -> is AbiFunction -> if ( declaration . isConstructor ) else is AbiClass -> is AbiEnumEntry -> }","docstring":"/**\n * When printing top-level declarations, the following order is used:\n * 1. classes\n * 2. properties\n * 3. functions\n */"} {"signature":"public fun JsonPrimitive ( value : Boolean ? ) : JsonPrimitive","body":"{ if ( value == null ) return JsonNull return JsonLiteral ( value , isString = false ) }","docstring":"/** Creates a [JsonPrimitive] from the given boolean. */"} {"signature":"public fun JsonPrimitive ( value : Number ? ) : JsonPrimitive","body":"{ if ( value == null ) return JsonNull return JsonLiteral ( value , isString = false ) }","docstring":"/** Creates a [JsonPrimitive] from the given number. */"} {"signature":"@ ExperimentalSerializationApi public fun JsonPrimitive ( value : UByte ) : JsonPrimitive","body":"= JsonPrimitive ( value . toULong ( ) )","docstring":"/**\n * Creates a numeric [JsonPrimitive] from the given [UByte].\n *\n * The value will be encoded as a JSON number.\n */"} {"signature":"@ ExperimentalSerializationApi public fun JsonPrimitive ( value : UShort ) : JsonPrimitive","body":"= JsonPrimitive ( value . toULong ( ) )","docstring":"/**\n * Creates a numeric [JsonPrimitive] from the given [UShort].\n *\n * The value will be encoded as a JSON number.\n */"} {"signature":"@ ExperimentalSerializationApi public fun JsonPrimitive ( value : UInt ) : JsonPrimitive","body":"= JsonPrimitive ( value . toULong ( ) )","docstring":"/**\n * Creates a numeric [JsonPrimitive] from the given [UInt].\n *\n * The value will be encoded as a JSON number.\n */"} {"signature":"@ SuppressAnimalSniffer @ ExperimentalSerializationApi public fun JsonPrimitive ( value : ULong ) : JsonPrimitive","body":"= JsonUnquotedLiteral ( value . toString ( ) )","docstring":"/**\n * Creates a numeric [JsonPrimitive] from the given [ULong].\n *\n * The value will be encoded as a JSON number.\n */"} {"signature":"public fun JsonPrimitive ( value : String ? ) : JsonPrimitive","body":"{ if ( value == null ) return JsonNull return JsonLiteral ( value , isString = true ) }","docstring":"/** Creates a [JsonPrimitive] from the given string. */"} {"signature":"@ ExperimentalSerializationApi @ Suppress ( \"\" , \"\" ) public fun JsonPrimitive ( value : Nothing ? ) : JsonNull","body":"= JsonNull","docstring":"/** Creates [JsonNull]. */"} {"signature":"@ ExperimentalSerializationApi @ Suppress ( \"\" ) public fun JsonUnquotedLiteral ( value : String ? ) : JsonPrimitive","body":"{ return when ( value ) { null -> JsonNull JsonNull . content -> throw JsonEncodingException ( \"\" ) else -> JsonLiteral ( value , isString = false , coerceToInlineType = jsonUnquotedLiteralDescriptor ) } }","docstring":"/**\n * Creates a [JsonPrimitive] from the given string, without surrounding it in quotes.\n *\n * This function is provided for encoding raw JSON values that cannot be encoded using the [JsonPrimitive] functions.\n * For example,\n *\n * * precise numeric values (avoiding floating-point precision errors associated with [Double] and [Float]),\n * * large numbers,\n * * or complex JSON objects.\n *\n * Be aware that it is possible to create invalid JSON using this function.\n *\n * Creating a literal unquoted value of `null` (as in, `value == \"null\"`) is forbidden. If you want to create\n * JSON null literal, use [JsonNull] object, otherwise, use [JsonPrimitive].\n *\n * @see JsonPrimitive is the preferred method for encoding JSON primitives.\n * @throws JsonEncodingException if `value == \"null\"`\n */"} {"signature":"@ ObsoleteCoroutinesApi @ Suppress ( \"\" ) @ Deprecated ( level = DeprecationLevel . ERROR , message = \"\" ) public inline fun < E , R > BroadcastChannel < E > . consume ( block : ReceiveChannel < E > . ( ) -> R ) : R","body":"{ val channel = openSubscription ( ) try { return channel . block ( ) } finally { channel . cancel ( ) } }","docstring":"/**\n * Opens subscription to this [BroadcastChannel] and makes sure that the given [block] consumes all elements\n * from it by always invoking [cancel][ReceiveChannel.cancel] after the execution of the block.\n *\n * **Note: This API is obsolete since 1.5.0 and deprecated for removal since 1.7.0**\n * It is replaced with [SharedFlow][kotlinx.coroutines.flow.SharedFlow].\n *\n * Safe to remove in 1.9.0 as was inline before.\n */"} {"signature":"@ Deprecated ( level = DeprecationLevel . ERROR , message = \"\" ) @ Suppress ( \"\" , \"\" ) public suspend inline fun < E > BroadcastChannel < E > . consumeEach ( action : ( E ) -> Unit ) : Unit","body":"= consume { for ( element in this ) action ( element ) }","docstring":"/**\n * Subscribes to this [BroadcastChannel] and performs the specified action for each received element.\n *\n * **Note: This API is obsolete since 1.5.0 and deprecated for removal since 1.7.0**\n */"} {"signature":"@ PublishedApi internal fun consumesAll ( vararg channels : ReceiveChannel < * > ) : CompletionHandler","body":"= { cause : Throwable ? -> var exception : Throwable ? = null for ( channel in channels ) try { channel . cancelConsumed ( cause ) } catch ( e : Throwable ) { if ( exception == null ) { exception = e } else { exception . addSuppressed ( e ) } } exception ? . let { throw it } }","docstring":"/** @suppress **/"} {"signature":"@ Deprecated ( message = \"\" , level = DeprecationLevel . HIDDEN ) public suspend fun < E > ReceiveChannel < E > . elementAt ( index : Int ) : E","body":"= consume { if ( index < ) throw IndexOutOfBoundsException ( \"\" ) var count = for ( element in this ) { @ Suppress ( \"\" ) if ( index == count ++ ) return element } throw IndexOutOfBoundsException ( \"\" ) }","docstring":"/** @suppress **/"} {"signature":"@ Deprecated ( message = \"\" , level = DeprecationLevel . HIDDEN ) public suspend fun < E > ReceiveChannel < E > . elementAtOrNull ( index : Int ) : E ?","body":"= consume { if ( index < ) return null var count = for ( element in this ) { if ( index == count ++ ) return element } return null }","docstring":"/** @suppress **/"} {"signature":"@ Deprecated ( message = \"\" , level = DeprecationLevel . HIDDEN ) public suspend fun < E > ReceiveChannel < E > . first ( ) : E","body":"= consume { val iterator = iterator ( ) if ( ! iterator . hasNext ( ) ) throw NoSuchElementException ( \"\" ) return iterator . next ( ) }","docstring":"/** @suppress **/"} {"signature":"@ Deprecated ( message = \"\" , level = DeprecationLevel . HIDDEN ) public suspend fun < E > ReceiveChannel < E > . firstOrNull ( ) : E ?","body":"= consume { val iterator = iterator ( ) if ( ! iterator . hasNext ( ) ) return null return iterator . next ( ) }","docstring":"/** @suppress **/"} {"signature":"@ Deprecated ( message = \"\" , level = DeprecationLevel . HIDDEN ) public suspend fun < E > ReceiveChannel < E > . indexOf ( element : E ) : Int","body":"{ var index = consumeEach { if ( element == it ) return index index ++ } return - }","docstring":"/** @suppress **/"} {"signature":"@ Deprecated ( message = \"\" , level = DeprecationLevel . HIDDEN ) public suspend fun < E > ReceiveChannel < E > . last ( ) : E","body":"= consume { val iterator = iterator ( ) if ( ! iterator . hasNext ( ) ) throw NoSuchElementException ( \"\" ) var last = iterator . next ( ) while ( iterator . hasNext ( ) ) last = iterator . next ( ) return last }","docstring":"/** @suppress **/"} {"signature":"@ Deprecated ( message = \"\" , level = DeprecationLevel . HIDDEN ) public suspend fun < E > ReceiveChannel < E > . lastIndexOf ( element : E ) : Int","body":"{ var lastIndex = - var index = consumeEach { if ( element == it ) lastIndex = index index ++ } return lastIndex }","docstring":"/** @suppress **/"} {"signature":"@ Deprecated ( message = \"\" , level = DeprecationLevel . HIDDEN ) public suspend fun < E > ReceiveChannel < E > . lastOrNull ( ) : E ?","body":"= consume { val iterator = iterator ( ) if ( ! iterator . hasNext ( ) ) return null var last = iterator . next ( ) while ( iterator . hasNext ( ) ) last = iterator . next ( ) return last }","docstring":"/** @suppress **/"} {"signature":"@ Deprecated ( message = \"\" , level = DeprecationLevel . HIDDEN ) public suspend fun < E > ReceiveChannel < E > . single ( ) : E","body":"= consume { val iterator = iterator ( ) if ( ! iterator . hasNext ( ) ) throw NoSuchElementException ( \"\" ) val single = iterator . next ( ) if ( iterator . hasNext ( ) ) throw IllegalArgumentException ( \"\" ) return single }","docstring":"/** @suppress **/"} {"signature":"@ Deprecated ( message = \"\" , level = DeprecationLevel . HIDDEN ) public suspend fun < E > ReceiveChannel < E > . singleOrNull ( ) : E ?","body":"= consume { val iterator = iterator ( ) if ( ! iterator . hasNext ( ) ) return null val single = iterator . next ( ) if ( iterator . hasNext ( ) ) return null return single }","docstring":"/** @suppress **/"} {"signature":"@ Deprecated ( message = \"\" , level = DeprecationLevel . HIDDEN ) public fun < E > ReceiveChannel < E > . drop ( n : Int , context : CoroutineContext = Dispatchers . Unconfined ) : ReceiveChannel < E >","body":"= GlobalScope . produce ( context , onCompletion = consumes ( ) ) { require ( n >= ) { \"\" } var remaining : Int = n if ( remaining > ) for ( e in this @ drop ) { remaining -- if ( remaining == ) break } for ( e in this @ drop ) { send ( e ) } }","docstring":"/** @suppress **/"} {"signature":"@ Deprecated ( message = \"\" , level = DeprecationLevel . HIDDEN ) public fun < E > ReceiveChannel < E > . dropWhile ( context : CoroutineContext = Dispatchers . Unconfined , predicate : suspend ( E ) -> Boolean ) : ReceiveChannel < E >","body":"= GlobalScope . produce ( context , onCompletion = consumes ( ) ) { for ( e in this @ dropWhile ) { if ( ! predicate ( e ) ) { send ( e ) break } } for ( e in this @ dropWhile ) { send ( e ) } }","docstring":"/** @suppress **/"} {"signature":"@ Deprecated ( message = \"\" , level = DeprecationLevel . HIDDEN ) public fun < E > ReceiveChannel < E > . filterIndexed ( context : CoroutineContext = Dispatchers . Unconfined , predicate : suspend ( index : Int , E ) -> Boolean ) : ReceiveChannel < E >","body":"= GlobalScope . produce ( context , onCompletion = consumes ( ) ) { var index = for ( e in this @ filterIndexed ) { if ( predicate ( index ++ , e ) ) send ( e ) } }","docstring":"/** @suppress **/"} {"signature":"@ Deprecated ( message = \"\" , level = DeprecationLevel . HIDDEN ) public fun < E > ReceiveChannel < E > . filterNot ( context : CoroutineContext = Dispatchers . Unconfined , predicate : suspend ( E ) -> Boolean ) : ReceiveChannel < E >","body":"= filter ( context ) { ! predicate ( it ) }","docstring":"/** @suppress **/"} {"signature":"@ Deprecated ( message = \"\" , level = DeprecationLevel . HIDDEN ) public suspend fun < E : Any , C : MutableCollection < in E > > ReceiveChannel < E ? > . filterNotNullTo ( destination : C ) : C","body":"{ consumeEach { if ( it != null ) destination . add ( it ) } return destination }","docstring":"/** @suppress **/"} {"signature":"@ Deprecated ( message = \"\" , level = DeprecationLevel . HIDDEN ) public suspend fun < E : Any , C : SendChannel < E > > ReceiveChannel < E ? > . filterNotNullTo ( destination : C ) : C","body":"{ consumeEach { if ( it != null ) destination . send ( it ) } return destination }","docstring":"/** @suppress **/"} {"signature":"@ Deprecated ( message = \"\" , level = DeprecationLevel . HIDDEN ) public fun < E > ReceiveChannel < E > . take ( n : Int , context : CoroutineContext = Dispatchers . Unconfined ) : ReceiveChannel < E >","body":"= GlobalScope . produce ( context , onCompletion = consumes ( ) ) { if ( n == ) return@produce require ( n >= ) { \"\" } var remaining : Int = n for ( e in this @ take ) { send ( e ) remaining -- if ( remaining == ) return@produce } }","docstring":"/** @suppress **/"} {"signature":"@ Deprecated ( message = \"\" , level = DeprecationLevel . HIDDEN ) public fun < E > ReceiveChannel < E > . takeWhile ( context : CoroutineContext = Dispatchers . Unconfined , predicate : suspend ( E ) -> Boolean ) : ReceiveChannel < E >","body":"= GlobalScope . produce ( context , onCompletion = consumes ( ) ) { for ( e in this @ takeWhile ) { if ( ! predicate ( e ) ) return@produce send ( e ) } }","docstring":"/** @suppress **/"} {"signature":"@ Deprecated ( message = \"\" , level = DeprecationLevel . HIDDEN ) public suspend fun < K , V > ReceiveChannel < Pair < K , V > > . toMap ( ) : Map < K , V >","body":"= toMap ( LinkedHashMap ( ) )","docstring":"/** @suppress **/"} {"signature":"@ Deprecated ( message = \"\" , level = DeprecationLevel . HIDDEN ) public suspend fun < E > ReceiveChannel < E > . toMutableList ( ) : MutableList < E >","body":"= toCollection ( ArrayList ( ) )","docstring":"/** @suppress **/"} {"signature":"@ Deprecated ( message = \"\" , level = DeprecationLevel . HIDDEN ) public suspend fun < E > ReceiveChannel < E > . toSet ( ) : Set < E >","body":"= this . toMutableSet ( )","docstring":"/** @suppress **/"} {"signature":"@ Deprecated ( message = \"\" , level = DeprecationLevel . HIDDEN ) public fun < E , R > ReceiveChannel < E > . flatMap ( context : CoroutineContext = Dispatchers . Unconfined , transform : suspend ( E ) -> ReceiveChannel < R > ) : ReceiveChannel < R >","body":"= GlobalScope . produce ( context , onCompletion = consumes ( ) ) { for ( e in this @ flatMap ) { transform ( e ) . toChannel ( this ) } }","docstring":"/** @suppress **/"} {"signature":"@ Deprecated ( message = \"\" , level = DeprecationLevel . HIDDEN ) public fun < E , R : Any > ReceiveChannel < E > . mapIndexedNotNull ( context : CoroutineContext = Dispatchers . Unconfined , transform : suspend ( index : Int , E ) -> R ? ) : ReceiveChannel < R >","body":"= mapIndexed ( context , transform ) . filterNotNull ( )","docstring":"/** @suppress **/"} {"signature":"@ Deprecated ( message = \"\" , level = DeprecationLevel . HIDDEN ) public fun < E , R : Any > ReceiveChannel < E > . mapNotNull ( context : CoroutineContext = Dispatchers . Unconfined , transform : suspend ( E ) -> R ? ) : ReceiveChannel < R >","body":"= map ( context , transform ) . filterNotNull ( )","docstring":"/** @suppress **/"} {"signature":"@ Deprecated ( message = \"\" , level = DeprecationLevel . HIDDEN ) public fun < E > ReceiveChannel < E > . withIndex ( context : CoroutineContext = Dispatchers . Unconfined ) : ReceiveChannel < IndexedValue < E > >","body":"= GlobalScope . produce ( context , onCompletion = consumes ( ) ) { var index = for ( e in this @ withIndex ) { send ( IndexedValue ( index ++ , e ) ) } }","docstring":"/** @suppress **/"} {"signature":"@ Deprecated ( message = \"\" , level = DeprecationLevel . HIDDEN ) public fun < E > ReceiveChannel < E > . distinct ( ) : ReceiveChannel < E >","body":"= this . distinctBy { it }","docstring":"/** @suppress **/"} {"signature":"@ Deprecated ( message = \"\" , level = DeprecationLevel . HIDDEN ) public suspend fun < E > ReceiveChannel < E > . any ( ) : Boolean","body":"= consume { return iterator ( ) . hasNext ( ) }","docstring":"/** @suppress **/"} {"signature":"@ Deprecated ( message = \"\" , level = DeprecationLevel . HIDDEN ) public suspend fun < E > ReceiveChannel < E > . count ( ) : Int","body":"{ var count = consumeEach { count ++ } return count }","docstring":"/** @suppress **/"} {"signature":"@ Deprecated ( message = \"\" , level = DeprecationLevel . HIDDEN ) public suspend fun < E > ReceiveChannel < E > . maxWith ( comparator : Comparator < in E > ) : E ?","body":"= consume { 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":"/** @suppress **/"} {"signature":"@ Deprecated ( message = \"\" , level = DeprecationLevel . HIDDEN ) public suspend fun < E > ReceiveChannel < E > . minWith ( comparator : Comparator < in E > ) : E ?","body":"= consume { 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":"/** @suppress **/"} {"signature":"@ Deprecated ( message = \"\" , level = DeprecationLevel . HIDDEN ) public suspend fun < E > ReceiveChannel < E > . none ( ) : Boolean","body":"= consume { return ! iterator ( ) . hasNext ( ) }","docstring":"/** @suppress **/"} {"signature":"@ Deprecated ( message = \"\" , level = DeprecationLevel . HIDDEN ) public fun < E : Any > ReceiveChannel < E ? > . requireNoNulls ( ) : ReceiveChannel < E >","body":"= map { it ? : throw IllegalArgumentException ( \"\" ) }","docstring":"/** @suppress **/"} {"signature":"@ Deprecated ( message = \"\" , level = DeprecationLevel . HIDDEN ) public infix fun < E , R > ReceiveChannel < E > . zip ( other : ReceiveChannel < R > ) : ReceiveChannel < Pair < E , R > >","body":"= zip ( other ) { t1 , t2 -> t1 to t2 }","docstring":"/** @suppress **/"} {"signature":"fun clearGroup ( )","body":"{ _builder . clearGroup ( ) }","docstring":"/**\n * optional string group = 1;\n */"} {"signature":"fun hasGroup ( ) : kotlin . Boolean","body":"{ return _builder . hasGroup ( ) }","docstring":"/**\n * optional string group = 1;\n * @return Whether the group field is set.\n */"} {"signature":"fun clearModule ( )","body":"{ _builder . clearModule ( ) }","docstring":"/**\n * optional string module = 2;\n */"} {"signature":"fun hasModule ( ) : kotlin . Boolean","body":"{ return _builder . hasModule ( ) }","docstring":"/**\n * optional string module = 2;\n * @return Whether the module field is set.\n */"} {"signature":"fun clearVersion ( )","body":"{ _builder . clearVersion ( ) }","docstring":"/**\n * optional string version = 3;\n */"} {"signature":"fun hasVersion ( ) : kotlin . Boolean","body":"{ return _builder . hasVersion ( ) }","docstring":"/**\n * optional string version = 3;\n * @return Whether the version field is set.\n */"} {"signature":"fun clearSourceSetName ( )","body":"{ _builder . clearSourceSetName ( ) }","docstring":"/**\n * optional string source_set_name = 4;\n */"} {"signature":"fun hasSourceSetName ( ) : kotlin . Boolean","body":"{ return _builder . hasSourceSetName ( ) }","docstring":"/**\n * optional string source_set_name = 4;\n * @return Whether the sourceSetName field is set.\n */"} {"signature":"@ kotlin . jvm . JvmSynthetic @ kotlin . jvm . JvmName ( \"\" ) fun com . google . protobuf . kotlin . DslList < org . jetbrains . kotlin . gradle . idea . proto . generated . tcs . IdeaKotlinBinaryCapabilityProto , CapabilitiesProxy > . add ( value : org . jetbrains . kotlin . gradle . idea . proto . generated . tcs . IdeaKotlinBinaryCapabilityProto )","body":"{ _builder . addCapabilities ( value ) }","docstring":"/**\n * repeated .org.jetbrains.kotlin.gradle.idea.proto.generated.tcs.IdeaKotlinBinaryCapabilityProto capabilities = 5;\n * @param value The capabilities to add.\n */"} {"signature":"@ kotlin . jvm . JvmSynthetic @ kotlin . jvm . JvmName ( \"\" ) @ Suppress ( \"\" ) inline operator fun com . google . protobuf . kotlin . DslList < org . jetbrains . kotlin . gradle . idea . proto . generated . tcs . IdeaKotlinBinaryCapabilityProto , CapabilitiesProxy > . plusAssign ( value : org . jetbrains . kotlin . gradle . idea . proto . generated . tcs . IdeaKotlinBinaryCapabilityProto )","body":"{ add ( value ) }","docstring":"/**\n * repeated .org.jetbrains.kotlin.gradle.idea.proto.generated.tcs.IdeaKotlinBinaryCapabilityProto capabilities = 5;\n * @param value The capabilities to add.\n */"} {"signature":"@ kotlin . jvm . JvmSynthetic @ kotlin . jvm . JvmName ( \"\" ) fun com . google . protobuf . kotlin . DslList < org . jetbrains . kotlin . gradle . idea . proto . generated . tcs . IdeaKotlinBinaryCapabilityProto , CapabilitiesProxy > . addAll ( values : kotlin . collections . Iterable < org . jetbrains . kotlin . gradle . idea . proto . generated . tcs . IdeaKotlinBinaryCapabilityProto > )","body":"{ _builder . addAllCapabilities ( values ) }","docstring":"/**\n * repeated .org.jetbrains.kotlin.gradle.idea.proto.generated.tcs.IdeaKotlinBinaryCapabilityProto capabilities = 5;\n * @param values The capabilities to add.\n */"} {"signature":"@ kotlin . jvm . JvmSynthetic @ kotlin . jvm . JvmName ( \"\" ) @ Suppress ( \"\" ) inline operator fun com . google . protobuf . kotlin . DslList < org . jetbrains . kotlin . gradle . idea . proto . generated . tcs . IdeaKotlinBinaryCapabilityProto , CapabilitiesProxy > . plusAssign ( values : kotlin . collections . Iterable < org . jetbrains . kotlin . gradle . idea . proto . generated . tcs . IdeaKotlinBinaryCapabilityProto > )","body":"{ addAll ( values ) }","docstring":"/**\n * repeated .org.jetbrains.kotlin.gradle.idea.proto.generated.tcs.IdeaKotlinBinaryCapabilityProto capabilities = 5;\n * @param values The capabilities to add.\n */"} {"signature":"@ kotlin . jvm . JvmSynthetic @ kotlin . jvm . JvmName ( \"\" ) operator fun com . google . protobuf . kotlin . DslList < org . jetbrains . kotlin . gradle . idea . proto . generated . tcs . IdeaKotlinBinaryCapabilityProto , CapabilitiesProxy > . set ( index : kotlin . Int , value : org . jetbrains . kotlin . gradle . idea . proto . generated . tcs . IdeaKotlinBinaryCapabilityProto )","body":"{ _builder . setCapabilities ( index , value ) }","docstring":"/**\n * repeated .org.jetbrains.kotlin.gradle.idea.proto.generated.tcs.IdeaKotlinBinaryCapabilityProto capabilities = 5;\n * @param index The index to set the value at.\n * @param value The capabilities to set.\n */"} {"signature":"@ kotlin . jvm . JvmSynthetic @ kotlin . jvm . JvmName ( \"\" ) fun com . google . protobuf . kotlin . DslList < org . jetbrains . kotlin . gradle . idea . proto . generated . tcs . IdeaKotlinBinaryCapabilityProto , CapabilitiesProxy > . clear ( )","body":"{ _builder . clearCapabilities ( ) }","docstring":"/**\n * repeated .org.jetbrains.kotlin.gradle.idea.proto.generated.tcs.IdeaKotlinBinaryCapabilityProto capabilities = 5;\n */"} {"signature":"fun clearAttributes ( )","body":"{ _builder . clearAttributes ( ) }","docstring":"/**\n * optional .org.jetbrains.kotlin.gradle.idea.proto.generated.tcs.IdeaKotlinBinaryAttributesProto attributes = 6;\n */"} {"signature":"fun hasAttributes ( ) : kotlin . Boolean","body":"{ return _builder . hasAttributes ( ) }","docstring":"/**\n * optional .org.jetbrains.kotlin.gradle.idea.proto.generated.tcs.IdeaKotlinBinaryAttributesProto attributes = 6;\n * @return Whether the attributes field is set.\n */"} {"signature":"@ JsName ( \"\" ) protected open fun toArray ( ) : Array < Any ? >","body":"= collectionToArray ( this )","docstring":"/**\n * Returns new array of type `Array` with the elements of this collection.\n */"} {"signature":"protected open fun < T > toArray ( array : Array < T > ) : Array < T >","body":"= collectionToArray ( this , array )","docstring":"/**\n * Fills the provided [array] or creates new array of the same type\n * and fills it with the elements of this collection.\n *\n * If this collection doesn't fit in the provided [array],\n * a new array is created with the same array type and the size of this collection,\n * and filled with this collection elements.\n * Otherwise, the specified [array] is filled starting from index 0.\n * The value of the elements following the collection elements is unspecified.\n *\n * @return An array containing all elements of this collection.\n */"} {"signature":"fun resolveExtrasSerialized ( owner : Any ) : ByteArray ?","body":"fun resolveExtrasSerialized ( owner : Any ) : ByteArray ?","docstring":"/**\n * @param owner: Should implement [HasMutableExtras]. Passing [Any] is fine to make it easier to cross\n * ClassLoader boundaries. Passing some non [HasMutableExtras] will just return null\n */"} {"signature":"fun < T : Any > serialize ( key : Extras . Key < T > , value : T ) : ByteArray ?","body":"fun < T : Any > serialize ( key : Extras . Key < T > , value : T ) : ByteArray ?","docstring":"/**\n * Will try to serialise the [value] for IDE import.\n * Returns `null` if there is no [IdeaKotlinExtrasSerializationExtension] provided that can handle the particular [key],\n * or if the registered serializer fails with an exception.\n * See [registerExtrasSerializationExtension] for 'how to register a serializer for extra values'\n */"} {"signature":"@ ExternalKotlinTargetApi fun registerDependencyResolver ( resolver : IdeDependencyResolver , constraint : SourceSetConstraint , phase : DependencyResolutionPhase , priority : Priority = Priority . normal , )","body":"@ ExternalKotlinTargetApi fun registerDependencyResolver ( resolver : IdeDependencyResolver , constraint : SourceSetConstraint , phase : DependencyResolutionPhase , priority : Priority = Priority . normal , )","docstring":"/**\n * Registers a given [resolver] to run during Gradle import:\n * The given resolver will only run if the [constraint] matches a given SourceSet and if not overwritten by another\n * resolver registered in the same [phase] and higher [Priority]\n */"} {"signature":"@ ExternalKotlinTargetApi fun registerAdditionalArtifactResolver ( resolver : IdeAdditionalArtifactResolver , constraint : SourceSetConstraint , phase : AdditionalArtifactResolutionPhase , priority : Priority = Priority . normal , )","body":"@ ExternalKotlinTargetApi fun registerAdditionalArtifactResolver ( resolver : IdeAdditionalArtifactResolver , constraint : SourceSetConstraint , phase : AdditionalArtifactResolutionPhase , priority : Priority = Priority . normal , )","docstring":"/**\n * Registers a given [resolver] to run during Gradle import:\n * The given resolver will only run if the [constraint] matches a given SourceSet and if not overwritten by another\n * resolver registered in the same [phase] and higher [Priority]\n */"} {"signature":"@ ExternalKotlinTargetApi fun registerDependencyTransformer ( transformer : IdeDependencyTransformer , constraint : SourceSetConstraint , phase : DependencyTransformationPhase , )","body":"@ ExternalKotlinTargetApi fun registerDependencyTransformer ( transformer : IdeDependencyTransformer , constraint : SourceSetConstraint , phase : DependencyTransformationPhase , )","docstring":"/**\n * Registers a given [transformer] to run during Gradle import:\n * The resolver will only run if the [constraint] matches the SourceSet\n */"} {"signature":"@ ExternalKotlinTargetApi fun registerDependencyEffect ( effect : IdeDependencyEffect , constraint : SourceSetConstraint , )","body":"@ ExternalKotlinTargetApi fun registerDependencyEffect ( effect : IdeDependencyEffect , constraint : SourceSetConstraint , )","docstring":"/**\n * Registers a given [effect] to run during Gradle import:\n * The effect will only run for SourceSets matching the given [constraint]\n */"} {"signature":"@ ExternalKotlinTargetApi fun registerExtrasSerializationExtension ( extension : IdeaKotlinExtrasSerializationExtension , )","body":"@ ExternalKotlinTargetApi fun registerExtrasSerializationExtension ( extension : IdeaKotlinExtrasSerializationExtension , )","docstring":"/**\n * Registers a [IdeaKotlinExtrasSerializationExtension] for transporting generic/external data into the\n * IDE process using the [Extras]. Entities that implement [HasMutableExtras] which are imported to the IDE\n * (like KotlinTarget, KotlinCompilation and KotlinSourceSet) will automatically retain their attached extras using\n * the serializers registered as [extension].\n *\n * Note 1: In order to access the extras in the IDE during (or after) Gradle import, a similar\n * extension needs to be registered in the IDE plugin to deserialize the payload.\n * Note 2: Extras that do not have a serializer attached will not be transported into the IDE process\n * Note 3: This transport mechanism will only act as transport mechanics of data. Keeping serializers and deserializers compatible\n * shall be handled by the implementers of the [extension]\n */"} {"signature":"@ ExternalKotlinTargetApi fun registerImportAction ( action : IdeMultiplatformImportAction )","body":"@ ExternalKotlinTargetApi fun registerImportAction ( action : IdeMultiplatformImportAction )","docstring":"/**\n * Registers a [IdeMultiplatformImportAction] which will be invoked only if an IDE/Gradle sync (import) is running.\n * This action is guaranteed to run before the Kotlin Multiplatform Model is being built.\n * There is no 'guarantee' whether this action will be running during configuration phase or as a first step\n * of model building. This is considered an implementation detail.\n * For further details please read [IdeMultiplatformImportAction]\n */"} {"signature":"@ Suppress ( \"\" ) @ ExternalKotlinTargetApi fun IdeMultiplatformImport . registerExtrasSerializationExtension ( builder : IdeaKotlinExtrasSerializationExtensionBuilder . ( ) -> Unit , )","body":"{ registerExtrasSerializationExtension ( IdeaKotlinExtrasSerializationExtension ( builder ) ) }","docstring":"/**\n * Convenience shortcut method for\n * `registerExtrasSerializationExtension(IdeaKotlinExtrasSerializationExtension(builder))`\n * see [IdeMultiplatformImport.registerExtrasSerializationExtension]\n */"} {"signature":"@ ExternalKotlinTargetApi infix fun SourceSetConstraint . or ( other : SourceSetConstraint , )","body":"= SourceSetConstraint { sourceSet -> this@or ( sourceSet ) || other ( sourceSet ) }","docstring":"/**\n * Combines two given [SourceSetConstraint] using a logical 'or':\n * The resulting constraint will match any SourceSet that matches at least one of the specified constraints\n */"} {"signature":"@ ExternalKotlinTargetApi infix fun SourceSetConstraint . and ( other : SourceSetConstraint , )","body":"= SourceSetConstraint { sourceSet -> this@and ( sourceSet ) && other ( sourceSet ) }","docstring":"/**\n * Combines two given [SourceSetConstraint] using a logical 'and':\n * The resulting constraint will match only SourceSets that matches both of the specified constraints\n */"} {"signature":"@ ExternalKotlinTargetApi operator fun SourceSetConstraint . not ( )","body":"= SourceSetConstraint { sourceSet -> this@not ( sourceSet ) . not ( ) }","docstring":"/**\n * Negates a given [SourceSetConstraint]:\n * The resulting constraint will match only SourceSets that would *not* have been matched by the source constraint\n */"} {"signature":"@ Test fun sample ( )","body":"{ val testProject = kotlinJvmTestProject { dokkaConfiguration { moduleName = \"\" kotlinSourceSet { } } ktFile ( pathFromSrc = \"\" ) { + \"\" } } val module = testProject . parse ( ) assertEquals ( \"\" , module . name ) assertEquals ( , module . packages . size ) val pckg = module . packages [ ] assertEquals ( \"\" , pckg . name ) assertEquals ( , pckg . classlikes . size ) val fooClass = pckg . classlikes [ ] assertEquals ( \"\" , fooClass . name ) }","docstring":"/**\n * Used as a sample for [kotlinJvmTestProject]\n */"} {"signature":"fun < T > JavaSparkContext . rddOf ( vararg elements : T , numSlices : Int = defaultParallelism ( ) , ) : JavaRDD < T >","body":"= parallelize ( elements . toList ( ) , numSlices )","docstring":"/**\n * Utility method to create an RDD from a list.\n * NOTE: [T] must be [Serializable].\n */"} {"signature":"fun < T > JavaSparkContext . toRDD ( elements : List < T > , numSlices : Int = defaultParallelism ( ) , ) : JavaRDD < T >","body":"= parallelize ( elements , numSlices )","docstring":"/**\n * Utility method to create an RDD from a list.\n * NOTE: [T] must be [Serializable].\n */"} {"signature":"fun < T : Comparable < T > > JavaRDD < T > . min ( ) : T","body":"= min ( object : Comparator < T > , Serializable { override fun compare ( o1 : T , o2 : T ) : Int = o1 . compareTo ( o2 ) } )","docstring":"/**\n * Returns the minimum element from this RDD as defined by the specified\n * [Comparator].\n *\n * @return the minimum of the RDD\n */"} {"signature":"fun < T : Comparable < T > > JavaRDD < T > . max ( ) : T","body":"= max ( object : Comparator < T > , Serializable { override fun compare ( o1 : T , o2 : T ) : Int = o1 . compareTo ( o2 ) } )","docstring":"/**\n * Returns the maximum element from this RDD as defined by the specified\n * [Comparator].\n *\n * @return the maximum of the RDD\n */"} {"signature":"@ Test fun testClosingNotDroppingTasks ( )","body":"{ repeat ( ) { shared . value = val nThreads = it + val dispatcher = newFixedThreadPoolContext ( nThreads , \"\" ) repeat ( ) { dispatcher . dispatch ( EmptyCoroutineContext , Runnable { shared . incrementAndGet ( ) } ) } dispatcher . close ( ) while ( shared . value < ) { } } }","docstring":"/**\n * Tests that [newFixedThreadPoolContext] will not drop tasks when closed.\n */"} {"signature":"override fun iterator ( ) : Iterator < File >","body":"= FileTreeWalkIterator ( )","docstring":"/** Returns an iterator walking through files. */"} {"signature":"public abstract fun step ( ) : File ?","body":"public abstract fun step ( ) : File ?","docstring":"/** Call of this function proceeds to a next file for visiting and returns it */"} {"signature":"override fun step ( ) : File ?","body":"{ if ( ! failed && fileList == null ) { if ( onEnter ? . invoke ( root ) == false ) { return null } fileList = root . listFiles ( ) if ( fileList == null ) { onFail ? . invoke ( root , AccessDeniedException ( file = root , reason = \"\" ) ) failed = true } } if ( fileList != null && fileIndex < fileList ! ! . size ) { return fileList ! ! [ fileIndex ++ ] } else if ( ! rootVisited ) { rootVisited = true return root } else { onLeave ? . invoke ( root ) return null } }","docstring":"/** First all children, then root directory */"} {"signature":"override fun step ( ) : File ?","body":"{ if ( ! rootVisited ) { if ( onEnter ? . invoke ( root ) == false ) { return null } rootVisited = true return root } else if ( fileList == null || fileIndex < fileList ! ! . size ) { if ( fileList == null ) { fileList = root . listFiles ( ) if ( fileList == null ) { onFail ? . invoke ( root , AccessDeniedException ( file = root , reason = \"\" ) ) } if ( fileList == null || fileList ! ! . size == ) { onLeave ? . invoke ( root ) return null } } return fileList ! ! [ fileIndex ++ ] } else { onLeave ? . invoke ( root ) return null } }","docstring":"/** First all children, then root directory */"} {"signature":"override fun step ( ) : File ?","body":"{ if ( visited ) return null visited = true return root }","docstring":"/** First all children, then root directory */"} {"signature":"public fun onEnter ( function : ( File ) -> Boolean ) : FileTreeWalk","body":"{ return FileTreeWalk ( start , direction , onEnter = function , onLeave = onLeave , onFail = onFail , maxDepth = maxDepth ) }","docstring":"/**\n * Sets a predicate [function], that is called on any entered directory before its files are visited\n * and before it is visited itself.\n *\n * If the [function] returns `false` the directory is not entered and neither it nor its files are visited.\n */"} {"signature":"public fun onLeave ( function : ( File ) -> Unit ) : FileTreeWalk","body":"{ return FileTreeWalk ( start , direction , onEnter = onEnter , onLeave = function , onFail = onFail , maxDepth = maxDepth ) }","docstring":"/**\n * Sets a callback [function], that is called on any left directory after its files are visited and after it is visited itself.\n */"} {"signature":"public fun onFail ( function : ( File , IOException ) -> Unit ) : FileTreeWalk","body":"{ return FileTreeWalk ( start , direction , onEnter = onEnter , onLeave = onLeave , onFail = function , maxDepth = maxDepth ) }","docstring":"/**\n * Set a callback [function], that is called on a directory when it's impossible to get its file list.\n *\n * [onEnter] and [onLeave] callback functions are called even in this case.\n */"} {"signature":"public fun maxDepth ( depth : Int ) : FileTreeWalk","body":"{ if ( depth <= ) throw IllegalArgumentException ( \"\" ) return FileTreeWalk ( start , direction , onEnter , onLeave , onFail , depth ) }","docstring":"/**\n * Sets the maximum [depth] of a directory tree to traverse. By default there is no limit.\n *\n * The value must be positive and [Int.MAX_VALUE] is used to specify an unlimited depth.\n *\n * With a value of 1, walker visits only the origin directory and all its immediate children,\n * with a value of 2 also grandchildren, etc.\n */"} {"signature":"public fun File . walk ( direction : FileWalkDirection = FileWalkDirection . TOP_DOWN ) : FileTreeWalk","body":"= FileTreeWalk ( this , direction )","docstring":"/**\n * Gets a sequence for visiting this directory and all its content.\n *\n * @param direction walk direction, top-down (by default) or bottom-up.\n */"} {"signature":"public fun File . walkTopDown ( ) : FileTreeWalk","body":"= walk ( FileWalkDirection . TOP_DOWN )","docstring":"/**\n * Gets a sequence for visiting this directory and all its content in top-down order.\n * Depth-first search is used and directories are visited before all their files.\n */"} {"signature":"public fun File . walkBottomUp ( ) : FileTreeWalk","body":"= walk ( FileWalkDirection . BOTTOM_UP )","docstring":"/**\n * Gets a sequence for visiting this directory and all its content in bottom-up order.\n * Depth-first search is used and directories are visited after all their files.\n */"} {"signature":"private fun DProperty . isAlsoParameter ( sourceSet : DokkaSourceSet ) : Boolean","body":"{ return this . extra [ IsAlsoParameter ] ? . inSourceSets ? . any { it . sourceSetID == sourceSet . sourceSetID } ? : false }","docstring":"/**\n * An example would be a primary constructor `class A(val s: String)`,\n * where `s` is both a function parameter and a property\n */"} {"signature":"internal fun prepareTargets ( graph : KGraph , weights : List < Variable < Float > > , tf : Ops , loss : Operand < Float > ) : List < Operand < Float > >","body":"{ slots = mutableMapOf ( ) val gradients : Gradients = computeGradients ( tf , loss , weights ) val variableOutputs = variablesToOutputs ( weights ) createSlots ( graph , tf , variableOutputs ) return applyGradients ( graph , tf , weights , gradients ) }","docstring":"/**\n * Prepares targets for optimization process.\n *\n * NOTE: Developer API.\n *\n * @param [graph] KGraph to be updated.\n * @param [tf] TensorFlow graph API for building operations.\n * @param [loss] Loss function.\n * @return List of optimizer operands to update variables.\n */"} {"signature":"protected abstract fun applyGradients ( graph : KGraph , tf : Ops , weights : List < Variable < Float > > , gradients : Gradients ) : List < Operand < Float > >","body":"protected abstract fun applyGradients ( graph : KGraph , tf : Ops , weights : List < Variable < Float > > , gradients : Gradients ) : List < Operand < Float > >","docstring":"/**\n * Applies gradients to weights.\n *\n * NOTE: Developer API. Override this method in each optimizer.\n *\n * @param [graph] KGraph to be updated.\n * @param [tf] TensorFlow graph API for building operations.\n * @param [weights] Variables to update in optimizer.\n * @param [gradients] See [Gradients] for more information.\n */"} {"signature":"protected open fun createSlots ( graph : KGraph , tf : Ops , variables : List < Output < Float > > )","body":"{ }","docstring":"/**\n * No-op slot creation method.\n *\n * @param variables The variables to create slots for.\n */"} {"signature":"protected open fun createSlot ( graph : KGraph , tf : Ops , variable : Output < Float > , slotName : String , initializer : Operand < Float > )","body":"{ val createName : String = createName ( variable , slotName ) val slot : Variable < Float > = tf . withName ( createName ) . variable ( variable . shape ( ) , getDType ( ) ) val assignName = defaultAssignOpName ( createName ( variable , slotName ) ) val slotInit : Assign < Float > = tf . withName ( assignName ) . assign ( slot , initializer ) graph . addOptimizerVariableInitializer ( slotInit ) graph . addOptimizerVariable ( slot ) val varName = variable . op ( ) . name ( ) val variables : MutableMap < String , Variable < Float > > = slots . computeIfAbsent ( slotName ) { mutableMapOf ( ) } variables [ varName ] = slot }","docstring":"/**\n * Creates a slot in the graph for the specified variable with the specified name. Adds the slot's\n * initializer to the graph's initializers, and the slot to the optimiser's slot map.\n *\n * @param [graph] KGraph to be updated.\n * @param [tf] TensorFlow graph API for building operations.\n * @param [variable] The variable to create the slot for.\n * @param [slotName] The name of the slot.\n * @param [initializer] The initializer for the slot.\n */"} {"signature":"protected fun getSlot ( varName : String , slotName : String ) : Variable < Float >","body":"{ val variables : MutableMap < String , Variable < Float > > = slots [ slotName ] ! ! return variables [ varName ] ! ! }","docstring":"/**\n * Gets the slot associated with the specified variable and slot name.\n *\n * @param [varName] The variable to lookup.\n * @param [slotName] The slot name.\n * @return The slot.\n */"} {"signature":"internal open fun createName ( variable : Output < Float > , slotName : String ) : String","body":"{ return defaultOptimizerVariableName ( variable . op ( ) . name ( ) + \"\" + slotName ) }","docstring":"/**\n * Creates name for [variable] used in slot with name [slotName].\n */"} {"signature":"open fun < T > runInCoroutineContext ( block : suspend ( ) -> T ) : T","body":"= @ Suppress ( \"\" ) internalScriptingRunSuspend { block ( ) }","docstring":"/**\n * The overridable wrapper for executing evaluation in a desired coroutines context\n */"} {"signature":"open fun eval ( script : SourceCode , compilationConfiguration : ScriptCompilationConfiguration , evaluationConfiguration : ScriptEvaluationConfiguration ? ) : ResultWithDiagnostics < EvaluationResult >","body":"= runInCoroutineContext { compiler ( script , compilationConfiguration ) . onSuccess { evaluator ( it , evaluationConfiguration ? : ScriptEvaluationConfiguration . Default ) } }","docstring":"/**\n * The default implementation of the evaluation function\n */"} {"signature":"@ Suppress ( \"\" ) public expect fun Trace ( size : Int = , format : TraceFormat = traceFormatDefault ) : TraceBase","body":"@ Suppress ( \"\" ) public expect fun Trace ( size : Int = , format : TraceFormat = traceFormatDefault ) : TraceBase","docstring":"/**\n * Creates `Trace` object for tracing atomic operations.\n *\n * To use a trace create a separate field for `Trace`:\n *\n * ```\n * val trace = Trace(size)\n * ```\n *\n * Using it to add trace messages:\n *\n * ```\n * trace { \"Doing something\" }\n * ```\n * or you can do multi-append in a garbage-free manner\n * ```\n * // Before queue.send(element) invocation\n * trace.append(\"Adding element to the queue\", element, Thread.currentThread())\n * ```\n *\n * Pass it to `atomic` constructor to automatically trace all modifications of the corresponding field:\n *\n * ```\n * val state = atomic(initialValue, trace)\n * ```\n * An optional [named][TraceBase.named] call can be used to name all the messages related to this specific instance:\n *\n * ```\n * val state = atomic(initialValue, trace.named(\"state\"))\n * ```\n *\n * An optional [format] parameter can be specified to add context-specific information to each trace.\n * The default format is [traceFormatDefault].\n */"} {"signature":"public expect fun TraceBase . named ( name : String ) : TraceBase","body":"public expect fun TraceBase . named ( name : String ) : TraceBase","docstring":"/**\n * Adds a name to the trace. For example:\n * \n * ```\n * val state = atomic(initialValue, trace.named(\"state\"))\n * ```\n */"} {"signature":"@ OptionalJsName ( TRACE_APPEND_1 ) public open fun append ( event : Any )","body":"{ }","docstring":"/**\n * Accepts the logging [event] and appends it to the trace.\n */"} {"signature":"@ OptionalJsName ( TRACE_APPEND_2 ) public open fun append ( event1 : Any , event2 : Any )","body":"{ }","docstring":"/**\n * Accepts the logging events [event1], [event2] and appends them to the trace.\n */"} {"signature":"@ OptionalJsName ( TRACE_APPEND_3 ) public open fun append ( event1 : Any , event2 : Any , event3 : Any )","body":"{ }","docstring":"/**\n * Accepts the logging events [event1], [event2], [event3] and appends them to the trace.\n */"} {"signature":"@ OptionalJsName ( TRACE_APPEND_4 ) public open fun append ( event1 : Any , event2 : Any , event3 : Any , event4 : Any )","body":"{ }","docstring":"/**\n * Accepts the logging events [event1], [event2], [event3], [event4] and appends them to the trace.\n */"} {"signature":"@ InlineOnly public inline operator fun invoke ( event : ( ) -> Any )","body":"{ append ( event ( ) ) }","docstring":"/**\n * Accepts the logging [event] and appends it to the trace.\n */"} {"signature":"public fun < T > xMin ( column : ColumnReference < T > ) : PositionalMapping < T >","body":"{ return addPositionalMapping < T > ( X_MIN , column . name ( ) , null ) }","docstring":"/**\n * Maps the `xMin` aesthetic to a data column specified by a [ColumnReference].\n *\n * @param column the data column to be mapped.\n * @return a [PositionalMapping] object representing the mapping.\n */"} {"signature":"public fun < T > xMin ( column : KProperty < T > ) : PositionalMapping < T >","body":"{ return addPositionalMapping < T > ( X_MIN , column . name , null ) }","docstring":"/**\n * Maps the `xMin` aesthetic to a data column specified by a [KProperty].\n *\n * @param column the data column to be mapped.\n * @return a [PositionalMapping] object representing the mapping.\n */"} {"signature":"public fun xMin ( column : String ) : PositionalMapping < Any ? >","body":"{ return addPositionalMapping ( X_MIN , column , null ) }","docstring":"/**\n * Maps the `xMin` aesthetic to a data column specified by a [String].\n *\n * @param column the data column to be mapped.\n * @return a [PositionalMapping] object representing the mapping.\n */"} {"signature":"public fun < T > xMin ( values : Iterable < T > ) : PositionalMapping < T >","body":"{ return addPositionalMapping < T > ( X_MIN , values . toList ( ) , null , null ) }","docstring":"/**\n * Maps the `xMin` 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 > xMin ( values : DataColumn < T > ) : PositionalMapping < T >","body":"{ return addPositionalMapping < T > ( X_MIN , values , null ) }","docstring":"/**\n * Maps the `xMin` 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 fun < T : Any > rxObservable ( context : CoroutineContext = EmptyCoroutineContext , @ BuilderInference block : suspend ProducerScope < T > . ( ) -> Unit ) : Observable < T >","body":"{ require ( context [ Job ] === null ) { \"\" + \"\" } return rxObservableInternal ( GlobalScope , context , block ) }","docstring":"/**\n * Creates cold [observable][Observable] that will run a given [block] in a coroutine.\n * Every time the returned observable is subscribed, it starts a new coroutine.\n *\n * Coroutine emits ([ObservableEmitter.onNext]) values with `send`, completes ([ObservableEmitter.onComplete])\n * when the coroutine completes or channel is explicitly closed and emits error ([ObservableEmitter.onError])\n * if coroutine throws an exception or closes channel with a cause.\n * Unsubscribing cancels running coroutine.\n *\n * Invocations of `send` are suspended appropriately to ensure that `onNext` is not invoked concurrently.\n * Note that Rx 2.x [Observable] **does not support backpressure**.\n *\n * Coroutine context can be specified with [context] argument.\n * If the context does not have any dispatcher nor any other [ContinuationInterceptor], then [Dispatchers.Default] is used.\n * Method throws [IllegalArgumentException] if provided [context] contains a [Job] instance.\n */"} {"signature":"@ Deprecated ( message = \"\" , level = DeprecationLevel . HIDDEN , replaceWith = ReplaceWith ( \"\" ) ) public fun < T : Any > CoroutineScope . rxObservable ( context : CoroutineContext = EmptyCoroutineContext , @ BuilderInference block : suspend ProducerScope < T > . ( ) -> Unit ) : Observable < T >","body":"= rxObservableInternal ( this , context , block )","docstring":"/** @suppress */"} {"signature":"public fun FloatArray . set3D ( rowIndex : Int , columnIndex : Int , channelIndex : Int , width : Int , channels : Int , value : Float )","body":"{ this [ width * rowIndex * channels + columnIndex * channels + channelIndex ] = value }","docstring":"/** */"} {"signature":"public fun FloatArray . get3D ( rowIndex : Int , columnIndex : Int , channelIndex : Int , width : Int , channels : Int ) : Float","body":"{ return this [ width * rowIndex * channels + columnIndex * channels + channelIndex ] }","docstring":"/** */"} {"signature":"public fun FloatArray . set2D ( rowIndex : Int , columnIndex : Int , width : Int , value : Float )","body":"{ this [ width * rowIndex + columnIndex ] = value }","docstring":"/** */"} {"signature":"public fun FloatArray . get2D ( rowIndex : Int , columnIndex : Int , width : Int ) : Float","body":"{ return this [ width * rowIndex + columnIndex ] }","docstring":"/** */"} {"signature":"public fun FloatArray . argmax ( ) : Int","body":"= maxOrNull ( ) ? . let { max -> indexOfFirst { it == max } } ? : - ","docstring":"/**\n * Returns the index of the maximum element in the given FloatArray.\n * TODO: Should be replaced with Multik in future.\n */"} {"signature":"fun get ( key : K , compute : ( K ) -> V ? ) : V ?","body":"= cache . get ( key ) { compute ( it ) ? : NullValue } ? . nullValueToNull ( )","docstring":"/**\n * Returns the value for the given [key] if it's contained in the cache, or computes the value with [compute] and adds it to the cache.\n */"} {"signature":"internal fun prepare ( project : Project ) : KoverContext","body":"{ val koverBucketConfiguration = project . configurations . create ( KOVER_DEPENDENCY_NAME ) { asBucket ( ) } val projectExtension = project . extensions . create < KoverProjectExtensionImpl > ( KOVER_PROJECT_EXTENSION_NAME , project . objects , project . layout , project . path ) val toolProvider = CoverageToolFactory . get ( projectExtension ) val agentClasspath = project . configurations . create ( JVM_AGENT_CONFIGURATION_NAME ) { asTransitiveDependencies ( ) } project . dependencies . add ( JVM_AGENT_CONFIGURATION_NAME , toolProvider . map { tool -> tool . jvmAgentDependency } ) project . configurations . register ( \"\" ) { isVisible = false asProducer ( ) attributes { attribute ( VariantNameAttr . ATTRIBUTE , project . objects . named ( \"\" ) ) attribute ( ProjectPathAttr . ATTRIBUTE , project . objects . named ( project . path ) ) } } val findAgentJarTask = project . tasks . register < KoverAgentJarTask > ( FIND_JAR_TASK ) findAgentJarTask . configure { dependsOn ( agentClasspath ) this . tool . convention ( toolProvider ) this . koverDisabled . convention ( projectExtension . koverDisabled ) this . agentJar . set ( project . layout . buildDirectory . map { dir -> dir . file ( agentFilePath ( toolProvider . get ( ) . variant ) ) } ) this . agentClasspath . from ( agentClasspath ) } val reporterClasspath = project . configurations . create ( JVM_REPORTER_CONFIGURATION_NAME ) { asTransitiveDependencies ( ) } project . dependencies . add ( JVM_REPORTER_CONFIGURATION_NAME , toolProvider . map { tool -> tool . jvmReporterDependency } ) project . dependencies . add ( JVM_REPORTER_CONFIGURATION_NAME , toolProvider . map { tool -> tool . jvmReporterExtraDependency } ) val totalReports = VariantReportsSet ( project , TOTAL_VARIANT_NAME , ReportVariantType . TOTAL , toolProvider , projectExtension . reports . total , reporterClasspath , projectExtension . koverDisabled ) return KoverContext ( project , projectExtension , toolProvider , findAgentJarTask , koverBucketConfiguration , agentClasspath , reporterClasspath , totalReports ) }","docstring":"/**\n * The first stage of applying the Kover plugin.\n * Objects are created that will be available in user build scripts during the evaluation step.\n */"} {"signature":"public suspend fun delay ( duration : Duration ) : Unit","body":"= delay ( duration . coerceToMillis ( ) )","docstring":"/**\n * \"java.time\" adapter method for [kotlinx.coroutines.delay].\n */"} {"signature":"@ FlowPreview public fun < T > Flow < T > . debounce ( timeout : Duration ) : Flow < T >","body":"= debounce ( timeout . coerceToMillis ( ) )","docstring":"/**\n * \"java.time\" adapter method for [kotlinx.coroutines.flow.debounce].\n */"} {"signature":"@ FlowPreview public fun < T > Flow < T > . sample ( period : Duration ) : Flow < T >","body":"= sample ( period . coerceToMillis ( ) )","docstring":"/**\n * \"java.time\" adapter method for [kotlinx.coroutines.flow.sample].\n */"} {"signature":"public fun < R > SelectBuilder < R > . onTimeout ( duration : Duration , block : suspend ( ) -> R ) : Unit","body":"= onTimeout ( duration . coerceToMillis ( ) , block )","docstring":"/**\n * \"java.time\" adapter method for [SelectBuilder.onTimeout].\n */"} {"signature":"public suspend fun < T > withTimeout ( duration : Duration , block : suspend CoroutineScope . ( ) -> T ) : T","body":"{ contract { callsInPlace ( block , InvocationKind . EXACTLY_ONCE ) } return kotlinx . coroutines . withTimeout ( duration . coerceToMillis ( ) , block ) }","docstring":"/**\n * \"java.time\" adapter method for [kotlinx.coroutines.withTimeout].\n */"} {"signature":"public suspend fun < T > withTimeoutOrNull ( duration : Duration , block : suspend CoroutineScope . ( ) -> T ) : T ?","body":"= kotlinx . coroutines . withTimeoutOrNull ( duration . coerceToMillis ( ) , block )","docstring":"/**\n * \"java.time\" adapter method for [kotlinx.coroutines.withTimeoutOrNull].\n */"} {"signature":"private fun Duration . coerceToMillis ( ) : Long","body":"{ if ( this <= Duration . ZERO ) return if ( this <= ChronoUnit . MILLIS . duration ) return val maxSeconds = val maxNanos = return if ( seconds < maxSeconds || seconds == maxSeconds && nano < maxNanos ) toMillis ( ) else Long . MAX_VALUE }","docstring":"/**\n * Coerces the given [Duration] to a millisecond delay.\n * Negative values are coerced to zero, values that cannot\n * be represented in milliseconds as long (\"infinite\" duration) are coerced to [Long.MAX_VALUE]\n * and durations lesser than a millisecond are coerced to 1 millisecond.\n *\n * The rationale of coercion:\n * 1) Too large durations typically indicate infinity and Long.MAX_VALUE is the\n * best approximation of infinity we can provide.\n * 2) Coercing too small durations to 1 instead of 0 is crucial for two patterns:\n * - Programming with deadlines and delays\n * - Non-suspending fast-paths (e.g. `withTimeout(1 nanosecond) { 42 }` should not throw)\n */"} {"signature":"internal fun CallableDescriptor . unwrapFakeOverrideIfNeeded ( ) : CallableDescriptor","body":"{ val useSiteUnwrapped = unwrapUseSiteSubstitutionOverride ( ) if ( useSiteUnwrapped !is CallableMemberDescriptor ) return useSiteUnwrapped if ( useSiteUnwrapped . kind . isReal ) return useSiteUnwrapped val overriddenDescriptor = useSiteUnwrapped . overriddenDescriptors . singleOrNull ( ) ? . unwrapUseSiteSubstitutionOverride ( ) ? : return useSiteUnwrapped if ( hasTypeReferenceAffectingSignature ( useSiteUnwrapped , overriddenDescriptor ) ) { return useSiteUnwrapped } return overriddenDescriptor . unwrapFakeOverrideIfNeeded ( ) }","docstring":"/**\n * This logic should be equivalent to\n * [org.jetbrains.kotlin.analysis.api.fir.KtSymbolByFirBuilder.unwrapSubstitutionOverrideIfNeeded]. But this method unwrap all fake\n * overrides that do not change the signature.\n */"} {"signature":"@ Suppress ( \"\" ) private fun < T : CallableDescriptor > T . unwrapUseSiteSubstitutionOverride ( ) : T","body":"{ var current : CallableDescriptor = this while ( original != current ) { current = current . original } return current as T }","docstring":"/**\n * Use-site substitution override are tracked through [CallableDescriptor.getOriginal]. Note that overridden symbols are accessed through\n * [CallableDescriptor.getOverriddenDescriptors] instead, which is separate from [CallableDescriptor.getOriginal].\n */"} {"signature":"public fun addEngine ( type : EngineType )","body":"{ if ( ! _engines . containsKey ( type . name ) ) { _engines [ type . name ] = type } }","docstring":"/**\n * Adds engine to [engines].\n */"} {"signature":"public fun setEngine ( type : EngineType )","body":"{ if ( type . name in engines ) Engine . setDefaultEngine ( type ) }","docstring":"/**\n * Sets the engine of type [type] as the current implementation.\n */"} {"signature":"public operator fun < T > get ( vararg elements : T ) : List < T >","body":"= elements . toList ( )","docstring":"/**\n * Returns a list of [elements]. Sugar for easy array creation.\n */"} {"signature":"@ FirSymbolProviderInternals abstract fun getClassLikeSymbolByClassId ( classId : ClassId , classLikeDeclaration : KtClassLikeDeclaration ) : FirClassLikeSymbol < * > ?","body":"@ FirSymbolProviderInternals abstract fun getClassLikeSymbolByClassId ( classId : ClassId , classLikeDeclaration : KtClassLikeDeclaration ) : FirClassLikeSymbol < * > ?","docstring":"/**\n * This function is optimized for a known [classLikeDeclaration].\n */"} {"signature":"@ FirSymbolProviderInternals abstract fun getTopLevelCallableSymbolsTo ( destination : MutableList < FirCallableSymbol < * > > , callableId : CallableId , callables : Collection < KtCallableDeclaration > , )","body":"@ FirSymbolProviderInternals abstract fun getTopLevelCallableSymbolsTo ( destination : MutableList < FirCallableSymbol < * > > , callableId : CallableId , callables : Collection < KtCallableDeclaration > , )","docstring":"/**\n * This function is optimized for known [callables].\n */"} {"signature":"@ FirSymbolProviderInternals abstract fun getTopLevelFunctionSymbolsTo ( destination : MutableList < FirNamedFunctionSymbol > , callableId : CallableId , functions : Collection < KtNamedFunction > , )","body":"@ FirSymbolProviderInternals abstract fun getTopLevelFunctionSymbolsTo ( destination : MutableList < FirNamedFunctionSymbol > , callableId : CallableId , functions : Collection < KtNamedFunction > , )","docstring":"/**\n * This function is optimized for known [functions].\n */"} {"signature":"@ FirSymbolProviderInternals abstract fun getTopLevelPropertySymbolsTo ( destination : MutableList < FirPropertySymbol > , callableId : CallableId , properties : Collection < KtProperty > , )","body":"@ FirSymbolProviderInternals abstract fun getTopLevelPropertySymbolsTo ( destination : MutableList < FirPropertySymbol > , callableId : CallableId , properties : Collection < KtProperty > , )","docstring":"/**\n * This function is optimized for known [properties].\n */"} {"signature":"private fun validFileOrNull ( path : String ) : File ?","body":"= try { File ( Paths . get ( path ) ) } catch ( _ : InvalidPathException ) { null }","docstring":"/**\n * Returns a [File] instance if the [path] is valid on the current file system and null otherwise.\n * Doesn't check whether the file denoted by [path] really exists.\n */"} {"signature":"private fun directLibsSequence ( givenName : String ) : Sequence < File >","body":"{ return directLibraries . asSequence ( ) . filter { it . uniqueName == givenName } . map { it . libraryFile } }","docstring":"/**\n * Returns a sequence of libraries passed to the compiler directly for which unique_name == [givenName].\n */"} {"signature":"abstract operator fun contains ( ch : Int ) : Boolean","body":"abstract operator fun contains ( ch : Int ) : Boolean","docstring":"/** Returns true if this char class contains character specified. */"} {"signature":"fun classWithSurrogates ( ) : AbstractCharClass","body":"{ surrogates_ . value ? . let { return it } val surrogates = lowHighSurrogates val result = object : AbstractCharClass ( ) { override fun contains ( ch : Int ) : Boolean { val index = ch - Char . MIN_SURROGATE . toInt ( ) return if ( index >= && index < AbstractCharClass . SURROGATE_CARDINALITY ) { this . altSurrogates xor surrogates [ index ] } else { false } } } result . alt = this . alt result . altSurrogates = this . altSurrogates result . mayContainSupplCodepoints = this . mayContainSupplCodepoints surrogates_ . compareAndSet ( null , result . freeze ( ) ) return surrogates_ . value ! ! }","docstring":"/**\n * Returns a char class that contains only unpaired surrogate chars from this char class.\n *\n * Consider the following char class: `[a\\uD801\\uDC00\\uD800]`.\n * This function returns a char class that contains only `\\uD800`: `[\\uD800]`.\n * [classWithoutSurrogates] returns a char class that does not contain `\\uD800`: `[a\\uD801\\uDC00]`.\n *\n * The returned char class is used to create [SurrogateRangeSet] node\n * that matches any unpaired surrogate from this char class. [SurrogateRangeSet]\n * doesn't match a surrogate that is paired with the char before or after it.\n * The result of [classWithoutSurrogates] is used to create [SupplementaryRangeSet]\n * or [RangeSet] depending on [mayContainSupplCodepoints].\n * The two nodes are then combined in [CompositeRangeSet] node to fully represent this char class.\n */"} {"signature":"fun classWithoutSurrogates ( ) : AbstractCharClass","body":"{ val result = object : AbstractCharClass ( ) { override fun contains ( ch : Int ) : Boolean { val index = ch - Char . MIN_SURROGATE . toInt ( ) val containslHS = if ( index >= && index < AbstractCharClass . SURROGATE_CARDINALITY ) this . altSurrogates xor this@AbstractCharClass . lowHighSurrogates . get ( index ) else false return this@AbstractCharClass . contains ( ch ) && ! containslHS } } result . alt = this . alt result . altSurrogates = this . altSurrogates result . mayContainSupplCodepoints = this . mayContainSupplCodepoints return result }","docstring":"/**\n * Returns a char class that contains all chars from this char class excluding the unpaired surrogate chars.\n *\n * See [classWithSurrogates] for details.\n */"} {"signature":"fun setNegative ( value : Boolean ) : AbstractCharClass","body":"{ if ( alt xor value ) { alt = ! alt altSurrogates = ! altSurrogates if ( ! mayContainSupplCodepoints ) { mayContainSupplCodepoints = true } } return this }","docstring":"/**\n * Sets this CharClass to negative form, i.e. if they will add some characters and after that set this\n * class to negative it will accept all the characters except previously set ones.\n *\n * Although this method will not alternate all the already set characters,\n * just overall meaning of the class.\n */"} {"signature":"@ ExternalKotlinTargetApi fun < T : DecoratedExternalKotlinTarget > KotlinMultiplatformExtension . createExternalKotlinTarget ( descriptor : ExternalKotlinTargetDescriptor < T > , ) : T","body":"{ val apiElementsConfiguration = project . configurations . maybeCreateConsumable ( lowerCamelCaseName ( descriptor . targetName , \"\" ) ) val runtimeElementsConfiguration = project . configurations . maybeCreateConsumable ( lowerCamelCaseName ( descriptor . targetName , \"\" ) ) val sourcesElementsConfiguration = project . configurations . maybeCreateConsumable ( lowerCamelCaseName ( descriptor . targetName , \"\" ) ) fun Configuration . notVisible ( ) = apply { isVisible = false } val apiElementsPublishedConfiguration = project . configurations . maybeCreateDependencyScope ( lowerCamelCaseName ( descriptor . targetName , \"\" ) ) . notVisible ( ) val runtimeElementsPublishedConfiguration = project . configurations . maybeCreateDependencyScope ( lowerCamelCaseName ( descriptor . targetName , \"\" ) ) . notVisible ( ) val sourcesElementsPublishedConfiguration = project . configurations . maybeCreateDependencyScope ( lowerCamelCaseName ( descriptor . targetName , \"\" ) ) . notVisible ( ) val resourcesElementsPublishedConfiguration = project . configurations . maybeCreateDependencyScope ( lowerCamelCaseName ( descriptor . targetName , \"\" ) ) . notVisible ( ) val kotlinTargetComponent = ExternalKotlinTargetComponent ( ExternalKotlinTargetComponent . TargetProvider . byTargetName ( this , descriptor . targetName ) ) val artifactsTaskLocator = ExternalKotlinTargetImpl . ArtifactsTaskLocator { target -> target . project . locateOrRegisterTask < Jar > ( lowerCamelCaseName ( descriptor . targetName , \"\" ) ) } val compilerOptions = when ( descriptor . platformType ) { KotlinPlatformType . androidJvm , KotlinPlatformType . jvm -> project . objects . newInstance < KotlinJvmCompilerOptionsDefault > ( ) KotlinPlatformType . wasm , KotlinPlatformType . js -> project . objects . newInstance < KotlinJsCompilerOptionsDefault > ( ) KotlinPlatformType . common -> project . objects . newInstance < KotlinCommonCompilerOptionsDefault > ( ) KotlinPlatformType . native -> project . objects . newInstance < KotlinNativeCompilerOptionsDefault > ( ) } val target = ExternalKotlinTargetImpl ( project = project , targetName = descriptor . targetName , platformType = descriptor . platformType , publishable = true , compilerOptions = compilerOptions , apiElementsConfiguration = apiElementsConfiguration , runtimeElementsConfiguration = runtimeElementsConfiguration , sourcesElementsConfiguration = sourcesElementsConfiguration , apiElementsPublishedConfiguration = apiElementsPublishedConfiguration , runtimeElementsPublishedConfiguration = runtimeElementsPublishedConfiguration , sourcesElementsPublishedConfiguration = sourcesElementsPublishedConfiguration , resourcesElementsPublishedConfiguration = resourcesElementsPublishedConfiguration , kotlinTargetComponent = kotlinTargetComponent , artifactsTaskLocator = artifactsTaskLocator ) target . setupApiElements ( apiElementsConfiguration ) target . setupApiElements ( apiElementsPublishedConfiguration ) target . setupRuntimeElements ( runtimeElementsConfiguration ) target . setupRuntimeElements ( runtimeElementsPublishedConfiguration ) target . setupSourcesElements ( sourcesElementsConfiguration ) target . setupSourcesElements ( sourcesElementsPublishedConfiguration ) val decorated = descriptor . targetFactory . create ( DecoratedExternalKotlinTarget . Delegate ( target ) ) target . onCreated ( ) descriptor . configure ? . invoke ( decorated ) descriptor . apiElements . configure ? . invoke ( decorated , apiElementsConfiguration ) descriptor . runtimeElements . configure ? . invoke ( decorated , runtimeElementsConfiguration ) descriptor . sourcesElements . configure ? . invoke ( decorated , sourcesElementsConfiguration ) descriptor . apiElementsPublished . configure ? . invoke ( decorated , apiElementsPublishedConfiguration ) descriptor . runtimeElementsPublished . configure ? . invoke ( decorated , runtimeElementsPublishedConfiguration ) descriptor . sourcesElementsPublished . configure ? . invoke ( decorated , sourcesElementsPublishedConfiguration ) descriptor . configureIdeImport ? . invoke ( project . kotlinIdeMultiplatformImport ) targets . add ( decorated ) decorated . logger . info ( \"\" ) return decorated }","docstring":"/**\n * Creates an adhoc/external Kotlin Target which can be maintained and evolved outside the kotlin.git repository.\n * The target will be created adhering to the configuration provided by the [descriptor].\n * The instance will be backed by an internal implementation of [KotlinTarget]\n * The instance will be created using the [ExternalKotlinTargetDescriptor.targetFactory] which will have to inject the backing\n * internal implementation using the [DecoratedExternalKotlinTarget.Delegate] into [DecoratedExternalKotlinTarget]\n */"} {"signature":"@ ExternalKotlinTargetApi fun < T : DecoratedExternalKotlinTarget > KotlinMultiplatformExtension . createExternalKotlinTarget ( descriptor : ExternalKotlinTargetDescriptorBuilder < T > . ( ) -> Unit , ) : T","body":"{ return createExternalKotlinTarget ( ExternalKotlinTargetDescriptor ( descriptor ) ) }","docstring":"/**\n * @see createExternalKotlinTarget\n */"} {"signature":"@ HtmlTagMarker inline fun HGROUP . h1 ( classes : String ? = null , crossinline block : H1 . ( ) -> Unit = { } ) : Unit","body":"= H1 ( attributesMapOf ( \"\" , classes ) , consumer ) . visit ( block )","docstring":"/**\n * Heading\n */"} {"signature":"@ HtmlTagMarker inline fun HGROUP . h2 ( classes : String ? = null , crossinline block : H2 . ( ) -> Unit = { } ) : Unit","body":"= H2 ( attributesMapOf ( \"\" , classes ) , consumer ) . visit ( block )","docstring":"/**\n * Heading\n */"} {"signature":"@ HtmlTagMarker inline fun HGROUP . h3 ( classes : String ? = null , crossinline block : H3 . ( ) -> Unit = { } ) : Unit","body":"= H3 ( attributesMapOf ( \"\" , classes ) , consumer ) . visit ( block )","docstring":"/**\n * Heading\n */"} {"signature":"@ HtmlTagMarker inline fun HGROUP . h4 ( classes : String ? = null , crossinline block : H4 . ( ) -> Unit = { } ) : Unit","body":"= H4 ( attributesMapOf ( \"\" , classes ) , consumer ) . visit ( block )","docstring":"/**\n * Heading\n */"} {"signature":"@ HtmlTagMarker inline fun HGROUP . h5 ( classes : String ? = null , crossinline block : H5 . ( ) -> Unit = { } ) : Unit","body":"= H5 ( attributesMapOf ( \"\" , classes ) , consumer ) . visit ( block )","docstring":"/**\n * Heading\n */"} {"signature":"@ HtmlTagMarker inline fun HGROUP . h6 ( classes : String ? = null , crossinline block : H6 . ( ) -> Unit = { } ) : Unit","body":"= H6 ( attributesMapOf ( \"\" , classes ) , consumer ) . visit ( block )","docstring":"/**\n * Heading\n */"} {"signature":"@ HtmlTagMarker inline fun HTML . body ( classes : String ? = null , crossinline block : BODY . ( ) -> Unit = { } ) : Unit","body":"= BODY ( attributesMapOf ( \"\" , classes ) , consumer ) . visit ( block )","docstring":"/**\n * Document body\n */"} {"signature":"@ HtmlTagMarker inline fun HTML . head ( crossinline block : HEAD . ( ) -> Unit = { } ) : Unit","body":"= HEAD ( emptyMap , consumer ) . visit ( block )","docstring":"/**\n * Document head\n */"} {"signature":"@ ObsoleteCoroutinesApi public fun < E > CoroutineScope . actor ( context : CoroutineContext = EmptyCoroutineContext , capacity : Int = , start : CoroutineStart = CoroutineStart . DEFAULT , onCompletion : CompletionHandler ? = null , block : suspend ActorScope < E > . ( ) -> Unit ) : SendChannel < E >","body":"{ val newContext = newCoroutineContext ( context ) val channel = Channel < E > ( capacity ) val coroutine = if ( start . isLazy ) LazyActorCoroutine ( newContext , channel , block ) else ActorCoroutine ( newContext , channel , active = true ) if ( onCompletion != null ) coroutine . invokeOnCompletion ( handler = onCompletion ) coroutine . start ( start , coroutine , block ) return coroutine }","docstring":"/**\n * Launches new coroutine that is receiving messages from its mailbox channel\n * and returns a reference to its mailbox channel as a [SendChannel]. The resulting\n * object can be used to [send][SendChannel.send] messages to this coroutine.\n *\n * The scope of the coroutine contains [ActorScope] interface, which implements\n * both [CoroutineScope] and [ReceiveChannel], so that coroutine can invoke\n * [receive][ReceiveChannel.receive] directly. The channel is [closed][SendChannel.close]\n * when the coroutine completes.\n *\n * Coroutine context is inherited from a [CoroutineScope], additional context elements can be specified with [context] argument.\n * If the context does not have any dispatcher nor any other [ContinuationInterceptor], then [Dispatchers.Default] is used.\n * The parent job is inherited from a [CoroutineScope] as well, but it can also be overridden\n * with corresponding [context] element.\n *\n * By default, the coroutine is immediately scheduled for execution.\n * Other options can be specified via `start` parameter. See [CoroutineStart] for details.\n * An optional [start] parameter can be set to [CoroutineStart.LAZY] to start coroutine _lazily_. In this case,\n * it will be started implicitly on the first message\n * [sent][SendChannel.send] to this actors's mailbox channel.\n *\n * Uncaught exceptions in this coroutine close the channel with this exception as a cause and\n * the resulting channel becomes _failed_, so that any attempt to send to such a channel throws exception.\n *\n * The kind of the resulting channel depends on the specified [capacity] parameter.\n * See [Channel] interface documentation for details.\n *\n * See [newCoroutineContext][CoroutineScope.newCoroutineContext] for a description of debugging facilities that are available for newly created coroutine.\n *\n * ### Using actors\n *\n * A typical usage of the actor builder looks like this:\n *\n * ```\n * val c = actor {\n * // initialize actor's state\n * for (msg in channel) {\n * // process message here\n * }\n * }\n * // send messages to the actor\n * c.send(...)\n * ...\n * // stop the actor when it is no longer needed\n * c.close()\n * ```\n *\n * ### Stopping and cancelling actors\n *\n * When the inbox channel of the actor is [closed][SendChannel.close] it sends a special \"close token\" to the actor.\n * The actor still processes all the messages that were already sent and then \"`for (msg in channel)`\" loop terminates\n * and the actor completes.\n *\n * If the actor needs to be aborted without processing all the messages that were already sent to it, then\n * it shall be created with a parent job:\n *\n * ```\n * val job = Job()\n * val c = actor(context = job) { ... }\n * ...\n * // abort the actor\n * job.cancel()\n * ```\n *\n * When actor's parent job is [cancelled][Job.cancel], then actor's job becomes cancelled. It means that\n * \"`for (msg in channel)`\" and other cancellable suspending functions throw [CancellationException] and actor\n * completes without processing remaining messages.\n *\n * **Note: This API will become obsolete in future updates with introduction of complex actors.**\n * See [issue #87](https://github.com/Kotlin/kotlinx.coroutines/issues/87).\n *\n * @param context additional to [CoroutineScope.coroutineContext] context of the coroutine.\n * @param capacity capacity of the channel's buffer (no buffer by default).\n * @param start coroutine start option. The default value is [CoroutineStart.DEFAULT].\n * @param onCompletion optional completion handler for the actor coroutine (see [Job.invokeOnCompletion])\n * @param block the coroutine code.\n */"} {"signature":"public fun readCodeForGeneration ( stream : InputStream , name : String , generateHelperCompanionObject : Boolean = false , ) : Code","body":"public fun readCodeForGeneration ( stream : InputStream , name : String , generateHelperCompanionObject : Boolean = false , ) : Code","docstring":"/**\n * @param stream where to read the schema from\n * @param name the name of the top-level interface to generate\n * @param generateHelperCompanionObject whether to generate a helper companion object (only needed for Jupyter)\n */"} {"signature":"public fun readCodeForGeneration ( file : File , name : String , generateHelperCompanionObject : Boolean = false , ) : Code","body":"public fun readCodeForGeneration ( file : File , name : String , generateHelperCompanionObject : Boolean = false , ) : Code","docstring":"/**\n * @param file where to read the schema from\n * @param name the name of the top-level interface to generate\n * @param generateHelperCompanionObject whether to generate a helper companion object (only needed for Jupyter)\n */"} {"signature":"internal fun readCodeForGeneration ( stream : InputStream , name : String , format : SupportedCodeGenerationFormat ? = null , generateHelperCompanionObject : Boolean = false , formats : List < SupportedCodeGenerationFormat > = supportedFormats . filterIsInstance < SupportedCodeGenerationFormat > ( ) , ) : GeneratedCode","body":"{ if ( format != null ) return format to format . readCodeForGeneration ( stream , name , generateHelperCompanionObject ) val input = NotCloseableStream ( if ( stream . markSupported ( ) ) stream else BufferedInputStream ( stream ) ) try { val readLimit = input . mark ( readLimit ) formats . sortedBy { it . testOrder } . forEach { try { input . reset ( ) return it to it . readCodeForGeneration ( input , name , generateHelperCompanionObject ) } catch ( _ : Exception ) { } } throw IllegalArgumentException ( \"\" ) } finally { input . doClose ( ) } }","docstring":"/**\n * @param stream where to read the schema from\n * @param name the name of the top-level interface to generate\n * @param format the format to use\n * @param generateHelperCompanionObject whether to generate a helper companion object (only needed for Jupyter)\n * @param formats Optional list of supported formats to use. If not specified, all formats will be used.\n *\n * @return [GeneratedCode] with generated code\n */"} {"signature":"private fun FirQualifiedAccessExpression . findIrDynamicReceiver ( explicitReceiverExpression : IrExpression ? , ) : IrExpression","body":"{ return explicitReceiverExpression ? : ( dispatchReceiver as? FirThisReceiverExpression ) ? . let ( visitor :: convertToIrExpression ) ? : error ( \"\" ) }","docstring":"/**\n * A dynamic call has either an explicit receiver or an implicit this dispatch receiver.\n */"} {"signature":"private fun wrapWithImplicitCastForAssignment ( assignment : FirVariableAssignment , value : IrExpression ) : IrExpression","body":"{ if ( value is IrTypeOperatorCall ) return value val rValue = assignment . rValue if ( rValue !is FirSmartCastExpression ) return value val originalType = rValue . originalExpression . resolvedType . withNullability ( ConeNullability . NOT_NULL , session . typeContext ) val assignmentType = assignment . lValue . resolvedType if ( originalType . isSubtypeOf ( assignmentType , session ) ) return value return implicitCast ( value , assignmentType . toIrType ( ) , IrTypeOperator . IMPLICIT_CAST ) }","docstring":"/** Wrap an assignment - as needed - with an implicit cast to the left-hard side type. */"} {"signature":"private fun extractDispatchReceiverOfAssignment ( variableAssignment : FirVariableAssignment ) : FirExpression ?","body":"{ val receiver = variableAssignment . dispatchReceiver ? : return null if ( receiver !is FirSmartCastExpression ) return receiver val thisReceiver = receiver . originalExpression as? FirThisReceiverExpression ? : return receiver val thisClass = thisReceiver . calleeReference . boundSymbol as? FirClassSymbol < * > ? : return receiver val propertySymbol = variableAssignment . calleeReference ? . toResolvedPropertySymbol ( ) ? : return receiver val propertyDispatchReceiverType = propertySymbol . dispatchReceiverType ? : return receiver return when ( thisClass . defaultType ( ) . isSubtypeOf ( propertyDispatchReceiverType , session ) ) { true -> thisReceiver false -> receiver } }","docstring":"/**\n * If we have assignment like `this.x = ...` and this `this` is a dispatch this of some class, then we should unwrap\n * smartcast if possible to generate SetField instead of setter call\n *\n * See KT-57105\n */"} {"signature":"private fun List < FirTypeProjection > . toExpandedTypeArguments ( typeAliasSymbol : FirTypeAliasSymbol ) : List < FirTypeProjection >","body":"{ return typeAliasSymbol . constructType ( map { it . toConeTypeProjection ( ) } . toTypedArray ( ) , false ) . fullyExpandedType ( session ) . typeArguments . map { typeProjection -> buildTypeProjectionWithVariance { variance = when ( typeProjection ) { is ConeKotlinTypeProjectionIn -> Variance . IN_VARIANCE is ConeKotlinTypeProjectionOut -> Variance . OUT_VARIANCE else -> Variance . INVARIANT } typeRef = ( typeProjection as? ConeKotlinType ) ? . let { buildResolvedTypeRef { type = it } } ? : buildErrorTypeRef { diagnostic = ConeSimpleDiagnostic ( \"\" ) } } } }","docstring":"/**\n * Applies the list of type arguments to the given type alias, expands it fully and returns the list of type arguments for the\n * resulting type.\n */"} {"signature":"private fun getDefaultJdkModuleRoots ( javaModuleFinder : CliJavaModuleFinder , javaModuleGraph : JavaModuleGraph ) : List < JavaRoot >","body":"{ return javaModuleGraph . getAllDependencies ( javaModuleFinder . computeDefaultRootModules ( ) ) . flatMap { moduleName -> val module = javaModuleFinder . findModule ( moduleName ) ? : return@flatMap emptyList < JavaRoot > ( ) val result = module . getJavaModuleRoots ( ) result } }","docstring":"/**\n * Computes the [JavaRoot]s of the JDK's default modules.\n *\n * @see ClasspathRootsResolver.addModularRoots\n */"} {"signature":"fun findJvmRootsForJavaFiles ( files : List < PsiJavaFile > ) : List < PsiDirectory >","body":"{ if ( files . isEmpty ( ) ) return emptyList ( ) val result = mutableSetOf < PsiDirectory > ( ) for ( file in files ) { val packageParts = file . packageName . takeIf { it . isNotEmpty ( ) } ? . split ( '' ) ? : emptyList ( ) var javaDir : PsiDirectory ? = file . parent for ( part in packageParts . reversed ( ) ) { if ( javaDir ? . name == part ) { javaDir = javaDir . parent } else { break } } javaDir ? . let { result += it } } return result . toList ( ) }","docstring":"/**\n * Note that [findJvmRootsForJavaFiles] parses the given [files] because it needs access to each file's package name. To avoid parsing\n * errors, [registerJavaPsiFacade] ensures that the Java language level is configured before [findJvmRootsForJavaFiles] is called.\n */"} {"signature":"fun add ( framework : Framework )","body":"{ taskHolders . forEach { holder -> if ( framework . buildType == holder . buildType ) { holder . task . configure { task -> task . from ( framework ) } AppleTarget . values ( ) . firstOrNull { it . targets . contains ( framework . konanTarget ) } ? . also { appleTarget -> holder . fatTasks [ appleTarget ] ? . configure { fatTask -> fatTask . baseName = framework . baseName fatTask . from ( framework ) } } } } }","docstring":"/**\n * Adds the specified frameworks in this XCFramework.\n */"} {"signature":"fun from ( vararg frameworks : Framework )","body":"{ frameworks . forEach { framework -> require ( framework . konanTarget . family . isAppleFamily ) { \"\" } dependsOn ( framework . linkTask ) } fromFrameworkDescriptors ( frameworks . map { FrameworkDescriptor ( it ) } ) }","docstring":"/**\n * Adds the specified frameworks in this XCFramework.\n */"} {"signature":"fun suggest ( descriptor : DeclarationDescriptor , bindingContext : BindingContext )","body":"= cache . getOrPut ( descriptor ) { generate ( descriptor . original , bindingContext ) }","docstring":"/**\n * Generates names for declarations. Name consists of the following parts:\n *\n * * Aliasing declaration, if the given `descriptor` does not have its own entity in JS.\n * * Scoping declaration. Declarations are usually compiled to the hierarchy of nested JS objects,\n * this attribute allows to find out where to put the declaration.\n * * Simple name, which is a name that object must (or may) get on the generated JS.\n * * Whether the name is stable. Stable names are visible to other modules and to native JS.\n * Unstable names do not require particular name, so the code generator can invent any name\n * which does not clash with anything; however, it may derive the name from the suggested name to\n * improve readability and debugging experience.\n *\n * This method returns `null` for root declarations (modules and root packages).\n * It's guaranteed that a particular name is returned for any other declarations.\n *\n * Since packages in Kotlin do not always form hierarchy, suggested name is a list of strings. This\n * list consists of exactly one string for any declaration except for package. Package name lists\n * have at least one string.\n */"} {"signature":"public fun Buffer . transferFrom ( input : InputStream ) : Buffer","body":"{ write ( input , Long . MAX_VALUE , true ) return this }","docstring":"/**\n * Read and exhaust bytes from [input] into this buffer. Stops reading data on [input] exhaustion.\n *\n * @param input the stream to read data from.\n *\n * @sample kotlinx.io.samples.KotlinxIoSamplesJvm.bufferTransferToStream\n */"} {"signature":"public fun Buffer . write ( input : InputStream , byteCount : Long ) : Buffer","body":"{ checkByteCount ( byteCount ) write ( input , byteCount , false ) return this }","docstring":"/**\n * Read [byteCount] bytes from [input] into this buffer. Throws an exception when [input] is\n * exhausted before reading [byteCount] bytes.\n *\n * @param input the stream to read data from.\n * @param byteCount the number of bytes read from [input].\n *\n * @throws IOException when [input] exhausted before reading [byteCount] bytes from it.\n * @throws IllegalArgumentException when [byteCount] is negative.\n *\n * @sample kotlinx.io.samples.KotlinxIoSamplesJvm.writeInputStreamToBuffer\n */"} {"signature":"public fun Buffer . readTo ( out : OutputStream , byteCount : Long = size )","body":"{ checkOffsetAndCount ( size , , byteCount ) var remainingByteCount = byteCount var s = head while ( remainingByteCount > ) { val toCopy = minOf ( remainingByteCount , s ! ! . limit - s . pos ) . toInt ( ) out . write ( s . data , s . pos , toCopy ) s . pos += toCopy size -= toCopy . toLong ( ) remainingByteCount -= toCopy . toLong ( ) if ( s . pos == s . limit ) { val toRecycle = s s = toRecycle . pop ( ) head = s SegmentPool . recycle ( toRecycle ) } } }","docstring":"/**\n * Consumes [byteCount] bytes from this buffer and writes it to [out].\n *\n * @param out the [OutputStream] to write to.\n * @param byteCount the number of bytes to be written, [Buffer.size] by default.\n *\n * @throws IllegalArgumentException when [byteCount] is negative or exceeds the buffer size.\n *\n * @sample kotlinx.io.samples.KotlinxIoSamplesJvm.bufferTransferToStream\n */"} {"signature":"public fun Buffer . copyTo ( out : OutputStream , startIndex : Long = , endIndex : Long = size )","body":"{ checkBounds ( size , startIndex , endIndex ) if ( startIndex == endIndex ) return var currentOffset = startIndex var remainingByteCount = endIndex - startIndex var s = head while ( currentOffset >= s ! ! . limit - s . pos ) { currentOffset -= ( s . limit - s . pos ) . toLong ( ) s = s . next } while ( remainingByteCount > ) { val pos = ( s ! ! . pos + currentOffset ) . toInt ( ) val toCopy = minOf ( s . limit - pos , remainingByteCount ) . toInt ( ) out . write ( s . data , pos , toCopy ) remainingByteCount -= toCopy . toLong ( ) currentOffset = s = s . next } }","docstring":"/**\n * Copy bytes from this buffer's subrange, starting at [startIndex] and ending at [endIndex], to [out]. This method\n * does not consume data from the buffer.\n *\n * @param out the destination to copy data into.\n * @param startIndex the index (inclusive) of the first byte to copy, `0` by default.\n * @param endIndex the index (exclusive) of the last byte to copy, `buffer.size` by default.\n *\n * @throws IndexOutOfBoundsException when [startIndex] or [endIndex] is out of this buffer bounds (`[0..buffer.size)`).\n * @throws IllegalArgumentException when `startIndex > endIndex`.\n *\n * @sample kotlinx.io.samples.KotlinxIoSamplesJvm.copyBufferToOutputStream\n */"} {"signature":"public fun Buffer . readAtMostTo ( sink : ByteBuffer ) : Int","body":"{ val s = head ? : return - val toCopy = minOf ( sink . remaining ( ) , s . limit - s . pos ) sink . put ( s . data , s . pos , toCopy ) s . pos += toCopy size -= toCopy . toLong ( ) if ( s . pos == s . limit ) { head = s . pop ( ) SegmentPool . recycle ( s ) } return toCopy }","docstring":"/**\n * Writes up to [ByteBuffer.remaining] bytes from this buffer to the sink.\n * Return the number of bytes written.\n *\n * @param sink the sink to write data to.\n *\n * @sample kotlinx.io.samples.KotlinxIoSamplesJvm.readWriteByteBuffer\n */"} {"signature":"public fun Buffer . transferFrom ( source : ByteBuffer ) : Buffer","body":"{ val byteCount = source . remaining ( ) var remaining = byteCount while ( remaining > ) { val tail = writableSegment ( ) val toCopy = minOf ( remaining , Segment . SIZE - tail . limit ) source . get ( tail . data , tail . limit , toCopy ) remaining -= toCopy tail . limit += toCopy } size += byteCount . toLong ( ) return this }","docstring":"/**\n * Reads all data from [source] into this buffer.\n *\n * @sample kotlinx.io.samples.KotlinxIoSamplesJvm.transferBufferFromByteBuffer\n */"} {"signature":"public fun Buffer . asByteChannel ( ) : ByteChannel","body":"= object : ByteChannel { override fun read ( sink : ByteBuffer ) : Int = readAtMostTo ( sink ) override fun write ( source : ByteBuffer ) : Int { val sizeBefore = size transferFrom ( source ) return ( size - sizeBefore ) . toInt ( ) } override fun close ( ) { } override fun isOpen ( ) : Boolean = true }","docstring":"/**\n * Returns a new [ByteChannel] instance representing this buffer.\n */"} {"signature":"@ HtmlTagMarker inline fun COLGROUP . col ( classes : String ? = null , crossinline block : COL . ( ) -> Unit = { } ) : Unit","body":"= COL ( attributesMapOf ( \"\" , classes ) , consumer ) . visit ( block )","docstring":"/**\n * Table column\n */"} {"signature":"@ Test fun `it should be possible to replace compilation output classes` ( )","body":"{ fun Project . addClassesTransformationTask ( target : KotlinTarget ) { val compilation = target . compilations . getByName ( KotlinCompilation . MAIN_COMPILATION_NAME ) val classesDirs = compilation . output . classesDirs val originalClassesDirs : FileCollection = project . files ( classesDirs . from . toTypedArray ( ) ) val transformedClassesDir = project . layout . buildDirectory . dir ( \"\" ) val transformTask = project . tasks . create ( \"\" ) { it . dependsOn ( compilation . compileAllTaskName ) it . inputs . files ( originalClassesDirs ) it . outputs . files ( transformedClassesDir ) } classesDirs . setFrom ( transformedClassesDir ) classesDirs . builtBy ( transformTask ) } val project = buildProjectWithMPP { kotlin { val target = jvm { } addClassesTransformationTask ( target ) } } project . evaluate ( ) val jvmMainClasses = project . tasks . getByName ( \"\" ) jvmMainClasses . assertNoCircularTaskDependencies ( ) }","docstring":"/**\n * This mechanism used by `kotlinx-atomicfu` gradle plugin. It replaces compilation classes to transformed classes dir\n */"} {"signature":"fun configure ( target : KotlinAndroidTarget , kotlinSourceSet : KotlinSourceSet , @ Suppress ( \"\" ) androidSourceSet : DeprecatedAndroidSourceSet )","body":"= Unit","docstring":"/**\n * Called once, when the corresponding KotlinSourceSet is created for a given [DeprecatedAndroidSourceSet].\n * Note, this can also be called in 'afterEvaluate', when Android is finalizing its variants.\n */"} {"signature":"fun configureWithVariant ( target : KotlinAndroidTarget , kotlinSourceSet : KotlinSourceSet , @ Suppress ( \"\" ) variant : DeprecatedAndroidBaseVariant )","body":"= Unit","docstring":"/**\n * Called every time, when a given [KotlinSourceSet] participates in a given Android variant.\n */"} {"signature":"@ Test fun testStressReleaseCancelRace ( )","body":"= runTest { val n = iterations val semaphore = Semaphore ( , ) newSingleThreadContext ( \"\" ) . use { pool -> repeat ( n ) { assertEquals ( , semaphore . availablePermits ) var job1EnteredCriticalSection = false val job1 = launch ( start = CoroutineStart . UNDISPATCHED ) { semaphore . acquire ( ) job1EnteredCriticalSection = true semaphore . release ( ) } assertEquals ( false , job1EnteredCriticalSection ) val job2 = launch ( pool ) { semaphore . release ( ) } job1 . cancelAndJoin ( ) job2 . join ( ) assertEquals ( , semaphore . availablePermits ) semaphore . acquire ( ) } } }","docstring":"/**\n * This checks if repeated releases that race with cancellations put\n * the semaphore into an incorrect state where permits are leaked.\n */"} {"signature":"fun trySetWithoutReassigning ( container : Object , newValue : Type ) : Type ?","body":"fun trySetWithoutReassigning ( container : Object , newValue : Type ) : Type ?","docstring":"/**\n * If the field is not set, sets it to the given value.\n * If the field is set to the given value, does nothing.\n * If the field is set to a different value, throws [IllegalArgumentException].\n *\n * This function is used to ensure internal consistency during parsing.\n * There exist formats where the same data is repeated several times in the same object, for example,\n * \"14:15 (02:15 PM)\". In such cases, we want to ensure that the values are consistent.\n */"} {"signature":"private fun transformInMemoryResults ( rendered : InMemoryMimeTypedResult , evalData : EvalRequestData , ) : MimeTypedResultEx","body":"{ val id = evalData . jupyterId . toString ( ) val inMemoryValue = rendered . inMemoryOutput . result inMemoryReplResultsHolder . setReplResult ( id , inMemoryValue ) val mimeData = rendered . fallbackResult + Pair ( rendered . inMemoryOutput . mimeType , JsonPrimitive ( id ) ) return MimeTypedResultEx ( Json . encodeToJsonElement ( mimeData ) , null , standardMetadataModifiers ( ) ) }","docstring":"/**\n * If the render result is an in-memory value, we need to extract it from\n * the mimetype and put it into the `InMemoryReplResultsHolder`. Then we\n * construct a new DisplayResult where the in-memory value is replaced by\n * its `jupyterId`. This allows us to re-use the existing Jupyter protocol\n * infrastructure to send display results, but also allows a custom UI\n * component on the Client side to find the in-memory value\n * again by asking for it in the `InMemoryReplResultsHolder`.\n */"} {"signature":"private fun updateClasspath ( ) : Classpath","body":"{ val resolvedClasspath = resolver . popAddedClasspath ( ) . map { it . canonicalPath } if ( resolvedClasspath . isEmpty ( ) ) return emptyList ( ) val ( oldClasspath , newClasspath ) = resolvedClasspath . partition { it in currentClasspath } currentClasspath . addAll ( newClasspath ) if ( options . trackClasspath ) { val sb = StringBuilder ( ) if ( newClasspath . isNotEmpty ( ) ) { sb . appendLine ( \"\" ) newClasspath . sortedBy { it } . forEach { sb . appendLine ( it ) } } if ( oldClasspath . isNotEmpty ( ) ) { sb . appendLine ( \"\" ) oldClasspath . sortedBy { it } . forEach { sb . appendLine ( it ) } } sb . appendLine ( \"\" ) println ( sb . toString ( ) ) } return newClasspath }","docstring":"/**\n * Updates current classpath with newly resolved libraries paths\n * Also, prints information about resolved libraries to stdout if [ReplOptions.trackClasspath] is true\n *\n * @return Newly resolved classpath\n */"} {"signature":"internal fun FirBasedSymbol < * > . cannotResolveAnnotationsOnDemand ( ) : Boolean","body":"{ return this is FirCallableSymbol < * > && isLocalForLazyResolutionPurposes }","docstring":"/**\n * Some symbols shouldn't be processed as a regular annotation owner and should be just skipped.\n * Example:\n * ```kotlin\n * fun foo() {\n * class Local {\n * fun localMemberWithoutType() = localMember()\n * fun localMember(): @Anno Int = 0\n * }\n * }\n * ```\n * Here `localMember` is the owner of `Anno`, but we shouldn't process it as a usual non-local declaration, because\n * this annotation cannot be leaked out of the body in not fully resolved state.\n *\n * @return true if this symbol shouldn't be processed as the owner of an annotation call\n */"} {"signature":"internal fun FirDeclaration . forEachDeclarationWhichCanHavePostponedSymbols ( action : ( FirCallableDeclaration ) -> Unit )","body":"{ when ( this ) { is FirCallableDeclaration -> action ( this ) else -> { } } }","docstring":"/**\n * Invoke [action] on each callable declaration that can have postponed symbols\n *\n * @see postponedSymbolsForAnnotationResolution\n */"} {"signature":"internal fun FirBasedSymbol < * > . unwrapSymbolToPostpone ( ) : FirBasedSymbol < * >","body":"= when ( this ) { is FirValueParameterSymbol -> containingFunctionSymbol else -> this }","docstring":"/**\n * @return a symbol which should be used as a member of [postponedSymbolsForAnnotationResolution] collection\n *\n * @see postponedSymbolsForAnnotationResolution\n */"} {"signature":"internal fun FirBasedSymbol < * > . symbolToPostponeIfCanBeResolvedOnDemand ( ) : FirBasedSymbol < * > ?","body":"{ return unwrapSymbolToPostpone ( ) . takeUnless { it . cannotResolveAnnotationsOnDemand ( ) } }","docstring":"/**\n * @return an [unwrapped][unwrapSymbolToPostpone] symbol which [can][cannotResolveAnnotationsOnDemand] be resolved on demand\n *\n * @see unwrapSymbolToPostpone\n * @see cannotResolveAnnotationsOnDemand\n */"} {"signature":"fun shrinkClasspath ( allClasses : List < AccessibleClassSnapshot > , lookupStorage : LookupStorage , metrics : MetricsReporter = MetricsReporter ( ) ) : List < AccessibleClassSnapshot >","body":"{ val lookupSymbols = metrics . getLookupSymbols { lookupStorage . lookupSymbols } return shrinkClasses ( allClasses , lookupSymbols , metrics ) }","docstring":"/**\n * Shrinks the given classes by retaining only classes that are referenced by the lookup symbols stored in the given [LookupStorage].\n */"} {"signature":"fun shrinkClasses ( allClasses : List < AccessibleClassSnapshot > , lookupSymbols : Collection < LookupSymbolKey > , metrics : MetricsReporter = MetricsReporter ( ) ) : List < AccessibleClassSnapshot >","body":"{ val referencedClasses = metrics . findReferencedClasses { findReferencedClasses ( allClasses , lookupSymbols ) } return metrics . findTransitivelyReferencedClasses { findTransitivelyReferencedClasses ( allClasses , referencedClasses ) } }","docstring":"/**\n * Shrinks the given classes by retaining only classes that are referenced by the given lookup symbols.\n *\n * Note: We need to retain both directly and transitively referenced classes to compute the impact of classpath changes correctly (see\n * [ClasspathChangesComputer.computeChangedAndImpactedSet]).\n */"} {"signature":"private fun findReferencedClasses ( allClasses : List < AccessibleClassSnapshot > , lookupSymbolKeys : Collection < LookupSymbolKey > ) : List < AccessibleClassSnapshot >","body":"{ val lookupSymbols = LookupSymbolSet ( lookupSymbolKeys . asSequence ( ) . map { LookupSymbol ( name = it . name , scope = it . scope ) } . asIterable ( ) ) val referencedClasses = allClasses . filter { clazz -> when ( clazz ) { is RegularKotlinClassSnapshot , is JavaClassSnapshot -> { ClassSymbol ( clazz . classId ) . toLookupSymbol ( ) in lookupSymbols || lookupSymbols . getLookupNamesInScope ( clazz . classId . asSingleFqName ( ) ) . isNotEmpty ( ) } is PackageFacadeKotlinClassSnapshot , is MultifileClassKotlinClassSnapshot -> { val lookupNamesInScope = lookupSymbols . getLookupNamesInScope ( clazz . classId . packageFqName ) if ( lookupNamesInScope . isEmpty ( ) ) return@filter false val packageMemberNames = when ( clazz ) { is PackageFacadeKotlinClassSnapshot -> clazz . packageMemberNames else -> ( clazz as MultifileClassKotlinClassSnapshot ) . constantNames } packageMemberNames . any { it in lookupNamesInScope } } } } return referencedClasses }","docstring":"/**\n * Finds classes that are *directly* referenced by the given lookup symbols.\n *\n * Note: It's okay to over-approximate the result.\n */"} {"signature":"private fun findTransitivelyReferencedClasses ( allClasses : List < AccessibleClassSnapshot > , referencedClasses : List < AccessibleClassSnapshot > ) : List < AccessibleClassSnapshot >","body":"{ val referencedClassIds = referencedClasses . map { it . classId } val impactingClassesResolver = AllImpacts . getReverseResolver ( allClasses ) val transitivelyReferencedClassIds : Set < ClassId > = findReachableNodes ( referencedClassIds , impactingClassesResolver :: getImpactingClasses ) return allClasses . filter { it . classId in transitivelyReferencedClassIds } }","docstring":"/**\n * Finds classes that are *transitively* referenced from the given classes. For example, if a subclass is referenced, its supertypes\n * will be transitively referenced.\n *\n * The returned list is *inclusive* (it contains the given list + the transitively referenced ones).\n */"} {"signature":"internal fun ClasspathSnapshot . removeDuplicateAndInaccessibleClasses ( ) : List < AccessibleClassSnapshot >","body":"{ return getNonDuplicateClassSnapshots ( ) . filterIsInstance < AccessibleClassSnapshot > ( ) }","docstring":"/**\n * Removes duplicate classes and [InaccessibleClassSnapshot]s from the given [ClasspathSnapshot].\n *\n * To see why removing duplicate classes is important, consider this example:\n * - Current classpath: (Unchanged) jar2!/com/example/A.class containing A.foo, (Added) jar3!/com/example/A.class containing A.bar\n * - Previous classpath: (Removed) jar1!/com/example/A.class containing A.bar, (Unchanged) jar2!/com/example/A.class containing A.foo\n * Without removing duplicates, we might report that there are no changes (both the current classpath and previous classpath have A.foo and\n * A.bar). However, the correct report should be that A.bar is removed and A.foo is added because the second A class on each classpath does\n * not have any effect.\n *\n * It's also important to remove duplicate classes first before removing [InaccessibleClassSnapshot]s. For example, if\n * jar1!/com/example/A.class is inaccessible and jar2!/com/example/A.class is accessible, removing inaccessible classes first would mean\n * that jar2!/com/example/A.class would be kept whereas it shouldn't be since it is a duplicate class (keeping a duplicate class can\n * lead to incorrect change reports as shown in the previous example).\n *\n * That is also why we cannot remove inaccessible classes from each classpath entry in isolation (i.e., during classpath entry\n * snapshotting), even though it seems more efficient to do so. For correctness, we need to look at the entire classpath first, remove\n * duplicate classes, and then remove inaccessible classes.\n */"} {"signature":"private fun ClasspathSnapshot . getNonDuplicateClassSnapshots ( ) : List < ClassSnapshot >","body":"{ val classSnapshots = LinkedHashMap < String , ClassSnapshot > ( classpathEntrySnapshots . sumOf { it . classSnapshots . size } ) for ( classpathEntrySnapshot in classpathEntrySnapshots ) { for ( ( unixStyleRelativePath , classSnapshot ) in classpathEntrySnapshot . classSnapshots ) { classSnapshots . putIfAbsent ( unixStyleRelativePath , classSnapshot ) } } return classSnapshots . values . toList ( ) }","docstring":"/**\n * Returns all [ClassSnapshot]s in this [ClasspathSnapshot].\n *\n * If there are duplicate classes on the classpath, retain only the first one to match the compiler's behavior.\n */"} {"signature":"@ Test fun `when compileOnly dependency is defined in commonTest, expect no warning` ( )","body":"{ val project = setupKmpProject { kotlin { sourceSets . apply { commonTest { dependencies { compileOnly ( \"\" ) } } } } } project . runLifecycleAwareTest { val diagnostics = kotlinToolingDiagnosticsCollector . getDiagnosticsForProject ( this ) diagnostics . assertNoDiagnostics ( IncorrectCompileOnlyDependencyWarning ) } }","docstring":"/**\n * The `compileOnly()` warning is only relevant for 'published' compilations.\n *\n * Verify `compileOnly()` dependencies in test sources do not trigger the warning.\n */"} {"signature":"fun AAA . foo ( )","body":"{ }","docstring":"/**\n * [this]\n */"} {"signature":"@ OptIn ( InternalKotlinGradlePluginApi :: class ) @ Deprecated ( message = KOTLIN_OPTIONS_DEPRECATION_MESSAGE ) fun kotlinOptions ( fn : T . ( ) -> Unit )","body":"{ @ Suppress ( \"\" ) kotlinOptions . fn ( ) }","docstring":"/**\n * Configures the [kotlinOptions] with the provided configuration.\n */"} {"signature":"@ OptIn ( InternalKotlinGradlePluginApi :: class ) @ Deprecated ( message = KOTLIN_OPTIONS_DEPRECATION_MESSAGE ) fun kotlinOptions ( fn : Action < in T > )","body":"{ @ Suppress ( \"\" ) fn . execute ( kotlinOptions ) }","docstring":"/**\n * Configures the [kotlinOptions] with the provided configuration.\n */"} {"signature":"suspend fun compile ( snippets : Iterable < SourceCode > , configuration : ScriptCompilationConfiguration ) : ResultWithDiagnostics < LinkedSnippet < CompiledSnippetT > >","body":"suspend fun compile ( snippets : Iterable < SourceCode > , configuration : ScriptCompilationConfiguration ) : ResultWithDiagnostics < LinkedSnippet < CompiledSnippetT > >","docstring":"/**\n * Compiles snippet chain and returns compilation result for the *last* snippet in the chain.\n * Generally changes the internal state of implementing object.\n * @param snippets Chain of snippets to compile\n * @param configuration Compilation configuration which is used\n * @return Compilation result with the last compiled snippet in chain\n */"} {"signature":"suspend fun compile ( snippet : SourceCode , configuration : ScriptCompilationConfiguration ) : ResultWithDiagnostics < LinkedSnippet < CompiledSnippetT > >","body":"= compile ( listOf ( snippet ) , configuration )","docstring":"/**\n * Compiles snippet and returns compilation result for it.\n * Generally changes the internal state of implementing object.\n * @param snippet Snippet to compile\n * @param configuration Compilation configuration which is used\n * @return Compilation result\n */"} {"signature":"public fun < T > injectCoroutineContext ( publisher : Publisher < T > , coroutineContext : CoroutineContext ) : Publisher < T >","body":"public fun < T > injectCoroutineContext ( publisher : Publisher < T > , coroutineContext : CoroutineContext ) : Publisher < T >","docstring":"/**\n * Injects `ReactorContext` element from the given context into the `SubscriberContext` of the publisher.\n * This API used as an indirection layer between `reactive` and `reactor` modules.\n */"} {"signature":"@ ExperimentalForeignApi @ TypedIntrinsic ( IntrinsicType . IDENTITY ) public external fun < T : NativePointed > interpretNullablePointed ( ptr : NativePtr ) : T ?","body":"@ ExperimentalForeignApi @ TypedIntrinsic ( IntrinsicType . IDENTITY ) public external fun < T : NativePointed > interpretNullablePointed ( ptr : NativePtr ) : T ?","docstring":"/**\n * Performs type cast of the native pointer to given interop type, including null values.\n *\n * @param T must not be abstract\n */"} {"signature":"@ ExperimentalForeignApi @ TypedIntrinsic ( IntrinsicType . IDENTITY ) public external fun < T : CPointed > interpretCPointer ( rawValue : NativePtr ) : CPointer < T > ?","body":"@ ExperimentalForeignApi @ TypedIntrinsic ( IntrinsicType . IDENTITY ) public external fun < T : CPointed > interpretCPointer ( rawValue : NativePtr ) : CPointer < T > ?","docstring":"/**\n * Performs type cast of the [CPointer] from the given raw pointer.\n */"} {"signature":"@ ExperimentalForeignApi @ TypedIntrinsic ( IntrinsicType . INTEROP_STATIC_C_FUNCTION ) public external fun < R > staticCFunction ( @ VolatileLambda function : ( ) -> R ) : CPointer < CFunction < ( ) -> R > >","body":"@ ExperimentalForeignApi @ TypedIntrinsic ( IntrinsicType . INTEROP_STATIC_C_FUNCTION ) public external fun < R > staticCFunction ( @ VolatileLambda function : ( ) -> R ) : CPointer < CFunction < ( ) -> R > >","docstring":"/**\n * Returns a pointer to C function which calls given Kotlin *static* function.\n *\n * @param function must be *static*, i.e. an (unbound) reference to a Kotlin function or\n * a closure which doesn't capture any variable\n */"} {"signature":"private fun createSampleBody ( imports : List < String > , body : String )","body":"= \"\"\"\"\"\" . trimMargin ( )","docstring":"/**\n * If both [imports] and [body] are present, it should return\n *\n * ```kotlin\n * import com.example.One\n * import com.example.Two\n *\n * fun main() {\n * //sampleStart\n * println(\"Sample function body\")\n * println(\"Another line\")\n * //sampleEnd\n * }\n * ```\n *\n * If [imports] are empty, it should return:\n *\n * ```kotlin\n * fun main() {\n * //sampleStart\n * println(\"Sample function body\")\n * println(\"Another line\")\n * //sampleEnd\n * }\n * ```\n *\n * Notice the presence/absence of the new line before the body.\n */"} {"signature":"private fun addKotlinDependenciesToAndroidSourceSets ( project : Project )","body":"{ fun addDependenciesToAndroidSourceSet ( @ Suppress ( \"\" ) androidSourceSet : DeprecatedAndroidSourceSet , apiConfigurationName : String , implementationConfigurationName : String , compileOnlyConfigurationName : String , runtimeOnlyConfigurationName : String ) { if ( project . configurations . findByName ( androidSourceSet . apiConfigurationName ) != null ) { project . addExtendsFromRelation ( androidSourceSet . apiConfigurationName , apiConfigurationName ) } else { project . configurations . getByName ( apiConfigurationName ) . dependencies . all { throw InvalidUserCodeException ( \"\" + \"\" ) } } project . addExtendsFromRelation ( androidSourceSet . implementationConfigurationName , implementationConfigurationName ) project . addExtendsFromRelation ( androidSourceSet . compileOnlyConfigurationName , compileOnlyConfigurationName ) project . addExtendsFromRelation ( androidSourceSet . runtimeOnlyConfigurationName , runtimeOnlyConfigurationName ) } ( project . extensions . getByName ( \"\" ) as BaseExtension ) . sourceSets . forEach { androidSourceSet -> project . findKotlinSourceSet ( androidSourceSet ) ? . let { kotlinSourceSet -> addDependenciesToAndroidSourceSet ( androidSourceSet , kotlinSourceSet . apiConfigurationName , kotlinSourceSet . implementationConfigurationName , kotlinSourceSet . compileOnlyConfigurationName , kotlinSourceSet . runtimeOnlyConfigurationName ) } } }","docstring":"/**\n * The Android variants have their configurations extendsFrom relation set up in a way that only some of the configurations of the\n * variants propagate the dependencies from production variants to test ones. To make this dependency propagation work for the Kotlin\n * source set dependencies as well, we need to add them to the Android source sets' api/implementation-like configurations,\n * not just the classpath-like configurations of the variants.\n */"} {"signature":"private fun MemberScope . collectClasses ( collector : MutableCollection < ClassDescriptor > )","body":"{ getContributedDescriptors ( ) . asSequence ( ) . filterIsInstance < ClassDescriptor > ( ) . forEach { collector += it if ( mapper . shouldBeExposed ( it ) ) { it . unsubstitutedMemberScope . collectClasses ( collector ) } } }","docstring":"/**\n * Recursively collect classes into [collector].\n * We need to do so because we want to make the order of declarations stable.\n */"} {"signature":"private fun translateExtraClasses ( )","body":"{ while ( extraClassesToTranslate . isNotEmpty ( ) ) { val descriptor = extraClassesToTranslate . first ( ) extraClassesToTranslate -= descriptor assert ( shouldTranslateExtraClass ( descriptor ) ) { \"\" } if ( descriptor . isInterface ) { generateInterface ( descriptor ) } else { generateClass ( descriptor ) } } }","docstring":"/**\n * Translates additional classes referenced from the module's declarations, such as parameter types, return types,\n * thrown exception types, and underlying enum types.\n *\n * This is required for classes from dependencies to be exported correctly. However, we also currently rely on this\n * for a few edge cases, such as some inner classes. Sub classes may reject certain descriptors to be translated.\n * Some referenced descriptors may be translated early for ordering reasons.\n * @see shouldTranslateExtraClass\n * @see generateExtraClassEarly\n * @see generateExtraInterfaceEarly\n */"} {"signature":"private fun writeUtf8CodePoint ( codePoint : Int )","body":"{ when { codePoint < -> { ensure ( ) write ( codePoint ) } codePoint < -> { ensure ( ) write ( codePoint shr or ) write ( codePoint and or ) } codePoint in .. -> { ensure ( ) write ( '' . code ) } codePoint < -> { ensure ( ) write ( codePoint shr or ) write ( codePoint shr and or ) write ( codePoint and or ) } codePoint <= -> { ensure ( ) write ( codePoint shr or ) write ( codePoint shr and or ) write ( codePoint shr and or ) write ( codePoint and or ) } else -> { throw JsonEncodingException ( \"\" ) } } }","docstring":"/**\n * Sources taken from okio library with minor changes, see https://github.com/square/okio\n */"} {"signature":"inline fun < R > withClassScopes ( firClass : FirClass , crossinline actionInsideStaticScope : ( ) -> Unit = { } , crossinline action : ( ) -> R , ) : R","body":"= withScopeCleanup { if ( removeOuterTypeParameterScope ( firClass ) ) { this . scopes = staticScopes } actionInsideStaticScope ( ) val superTypes = lookupSuperTypes ( firClass , lookupInterfaces = false , deep = true , substituteTypes = true , useSiteSession = session ) . asReversed ( ) val scopesToAdd = mutableListOf < FirScope > ( ) for ( superType in superTypes ) { superType . lookupTag . getNestedClassifierScope ( session , scopeSession ) ? . let { nestedClassifierScope -> val scope = nestedClassifierScope . wrapNestedClassifierScopeWithSubstitutionForSuperType ( superType , session ) scopesToAdd . add ( scope ) } } if ( firClass is FirRegularClass ) { firClass . companionObjectSymbol ? . fir ? . let ( session :: nestedClassifierScope ) ? . let ( scopesToAdd :: add ) session . nestedClassifierScope ( firClass ) ? . let ( scopesToAdd :: add ) addScopes ( scopesToAdd ) addTypeParametersScope ( firClass ) } else { session . nestedClassifierScope ( firClass ) ? . let ( scopesToAdd :: add ) addScopes ( scopesToAdd ) } action ( ) }","docstring":"/**\n * Changes to the order of scopes should also be reflected in\n * [org.jetbrains.kotlin.fir.resolve.transformers.body.resolve.BodyResolveContext.withScopesForClass].\n * Otherwise, we get different behavior between type resolve and body resolve phases.\n */"} {"signature":"private fun FirVariable . moveOrDeleteIrrelevantAnnotations ( )","body":"{ if ( annotations . isEmpty ( ) ) return val backingFieldAnnotations by lazy ( LazyThreadSafetyMode . NONE ) { backingField ? . annotations ? . toMutableList ( ) ? : mutableListOf ( ) } var replaceBackingFieldAnnotations = false replaceAnnotations ( annotations . filter { annotation -> when ( annotation . useSiteTarget ) { null -> { val allowedTargets = annotation . useSiteTargetsFromMetaAnnotation ( session ) when { this is FirValueParameter -> CONSTRUCTOR_PARAMETER in allowedTargets this . source ? . kind == KtFakeSourceElementKind . PropertyFromParameter && CONSTRUCTOR_PARAMETER in allowedTargets -> false this is FirProperty && backingField != null && annotationShouldBeMovedToField ( allowedTargets ) -> { backingFieldAnnotations += annotation replaceBackingFieldAnnotations = true false } else -> true } } else -> true } } ) if ( replaceBackingFieldAnnotations ) { backingField ? . replaceAnnotations ( backingFieldAnnotations ) } }","docstring":"/**\n * Filters annotations by target.\n * For example, in the following snippet the annotation may apply to the constructor value parameter, the property or the underlying field:\n * ```\n * class Foo(@Ann val x: String)\n * ```\n * This ambiguity may be resolved by specifying the use-site explicitly, i.e. `@field:Ann` or by analysing the allowed targets from\n * the [kotlin.annotation.Target] meta-annotation.\n * In latter case, the method will ensure that the annotation is moved to the correct element (field or parameter) or left at the property.\n */"} {"signature":"fun resnet50additionalTrainingNoTopWithHelper ( )","body":"{ val modelHub = TFModelHub ( cacheDirectory = File ( \"\" ) ) val modelType = TFModels . CVnoTop . ResNet50 ( inputShape = intArrayOf ( IMAGE_SIZE , IMAGE_SIZE , NUM_CHANNELS ) ) val noTopModel = modelHub . loadModel ( modelType ) val hdfFile = modelHub . loadWeights ( modelType ) val topModel = Sequential . of ( GlobalAvgPool2D ( name = \"\" , ) , Dense ( name = \"\" , kernelInitializer = GlorotUniform ( ) , biasInitializer = GlorotUniform ( ) , outputSize = , activation = Activations . Relu ) , Dense ( name = \"\" , kernelInitializer = GlorotUniform ( ) , biasInitializer = GlorotUniform ( ) , outputSize = NUM_CLASSES , activation = Activations . Linear ) , noInput = true ) val model = Functional . of ( pretrainedModel = noTopModel , topModel = topModel ) val dataset = OnFlyImageDataset . create ( File ( dogsCatsSmallDatasetPath ( ) ) , FromFolders ( mapping = mapOf ( \"\" to , \"\" to ) ) , modelType . createPreprocessing ( model ) ) . shuffle ( ) val ( train , test ) = dataset . split ( TRAIN_TEST_SPLIT_RATIO ) model . use { it . compile ( optimizer = Adam ( ) , loss = Losses . SOFT_MAX_CROSS_ENTROPY_WITH_LOGITS , metric = Metrics . ACCURACY ) it . loadWeightsForFrozenLayers ( hdfFile ) val accuracyBeforeTraining = it . evaluate ( dataset = test , batchSize = TEST_BATCH_SIZE ) . metrics [ Metrics . ACCURACY ] println ( \"\" ) it . fit ( dataset = train , batchSize = TRAINING_BATCH_SIZE , epochs = EPOCHS ) val accuracyAfterTraining = it . evaluate ( dataset = test , batchSize = TEST_BATCH_SIZE ) . metrics [ Metrics . ACCURACY ] println ( \"\" ) } }","docstring":"/**\n * This example demonstrates the transfer learning concept on ResNet'50 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 * - All layers, excluding the last [Dense], are added to the new Neural Network, its weights are frozen.\n * - New Dense layers are added and initialized via defined initializers.\n * - Model is re-trained on [dogsCatsSmallDatasetPath] dataset.\n *\n * We use the preprocessing DSL to describe the dataset generation pipeline.\n * We demonstrate the workflow on the subset of Kaggle Cats vs Dogs binary classification dataset.\n */"} {"signature":"fun main ( ) : Unit","body":"= resnet50additionalTrainingNoTopWithHelper ( )","docstring":"/** */"} {"signature":"internal fun Project . compositeBuildRootProject ( block : ( Project ) -> Unit )","body":"= compositeBuildRootGradle . rootProject ( block )","docstring":"/**\n * Run block function on root project of the root build in composite build only when a root project becomes available\n */"} {"signature":"override fun visitClass ( declaration : IrClass , data : KeepData )","body":"{ val prevShouldBeKept = data . classShouldBeKept val prevClassInKeep = data . classInKeep data . classShouldBeKept = false val keptClass = data . classInKeep || isInKeep ( declaration ) if ( keptClass ) { keptDeclarations . add ( declaration ) } data . classInKeep = keptClass super . visitClass ( declaration , data ) if ( data . classShouldBeKept ) { keptDeclarations . add ( declaration ) } data . classShouldBeKept = prevShouldBeKept data . classInKeep = prevClassInKeep }","docstring":"/** Keep declarations can work both ways\n * if member of a class is in keep, the class should be also kept\n * if a class is kept, members of the class should be also kept\n * but there can be nested classes, and for nested classes we need only to propagate \"keep\" from top-level to nested (not vice versa)\n * because we have 2 directions, we need 2 boolean flags\n * [KeepData.classInKeep] responsible to propagate \"keep\" from class level to members direction\n * [KeepData.classShouldBeKept] responsible to bubble \"keep\" from members to class level direction\n */"} {"signature":"abstract fun compileModuleChunk ( commonArguments : CommonCompilerArguments , dirtyFilesHolder : KotlinDirtySourceFilesHolder , environment : JpsCompilerEnvironment , buildMetricReporter : JpsBuilderMetricReporter ? ) : Boolean","body":"abstract fun compileModuleChunk ( commonArguments : CommonCompilerArguments , dirtyFilesHolder : KotlinDirtySourceFilesHolder , environment : JpsCompilerEnvironment , buildMetricReporter : JpsBuilderMetricReporter ? ) : Boolean","docstring":"/**\n * Called for `ModuleChunk.representativeTarget`\n */"} {"signature":"open fun updateChunkMappings ( localContext : CompileContext , chunk : ModuleChunk , dirtyFilesHolder : KotlinDirtySourceFilesHolder , outputItems : Map < ModuleBuildTarget , Iterable < GeneratedFile > > , incrementalCaches : Map < KotlinModuleBuildTarget < * > , JpsIncrementalCache > , environment : JpsCompilerEnvironment )","body":"{ }","docstring":"/**\n * Called for `ModuleChunk.representativeTarget`\n */"} {"signature":"protected fun collectSourcesToCompile ( dirtyFilesHolder : KotlinDirtySourceFilesHolder )","body":"= SourcesToCompile ( sources = when { chunk . representativeTarget . isIncrementalCompilationEnabled -> dirtyFilesHolder . getDirtyFiles ( jpsModuleBuildTarget ) . values else -> sources . values } , removedFiles = dirtyFilesHolder . getRemovedFiles ( jpsModuleBuildTarget ) )","docstring":"/**\n * Should be used only for particular target in chunk (jvm)\n *\n * Should not be cached since may be vary in different rounds.\n */"} {"signature":"fun logFiles ( ) : Boolean","body":"{ val hasRemovedSources = removedFiles . isNotEmpty ( ) val hasDirtyOrRemovedSources = allFiles . isNotEmpty ( ) || hasRemovedSources if ( hasDirtyOrRemovedSources ) { val logger = jpsGlobalContext . loggingManager . projectBuilderLogger if ( logger . isEnabled ) { logger . logCompiledFiles ( allFiles , KotlinBuilder . KOTLIN_BUILDER_NAME , \"\" ) } } return hasDirtyOrRemovedSources }","docstring":"/**\n * @return true, if there are removed files or files to compile\n */"} {"signature":"internal fun < T > sortTopologically ( start : T , nextNodes : ( T ) -> Collection < T > ) : List < T >","body":"{ val visited = mutableSetOf < T > ( ) val grayStack : Stack < T > = mutableListOf ( ) recursiveTopologicalSort ( start , grayStack , visited , nextNodes ) val sortedList = mutableListOf < T > ( ) while ( grayStack . isNotEmpty ( ) ) sortedList . add ( grayStack . pop ( ) ! ! ) return sortedList }","docstring":"/**\n * Topologically sort nodes in the DAG defined by a provided start node and a function returning next nodes.\n * @param [start] a node from which to start the sort\n * @param [nextNodes] a function which returns a collection of next nodes for a given node\n * @return a list of topologically sorted nodes in the graph\n */"} {"signature":"public inline fun < reified T > emptyOf ( ) : DataFrame < T >","body":"= createEmptyDataFrameOf ( T :: class ) . cast ( )","docstring":"/**\n * Creates a DataFrame with empty columns (rows = 0).\n * Can be used as a \"null object\" in aggregation operations, operations that work on columns (select, reorder, ...)\n *\n */"} {"signature":"public fun empty ( schema : DataFrameSchema ) : AnyFrame","body":"= schema . createEmptyDataFrame ( )","docstring":"/**\n * Creates a DataFrame with empty columns (rows = 0).\n * Can be used as a \"null object\" in aggregation operations, operations that work on columns (select, reorder, ...)\n */"} {"signature":"override fun < C > get ( columns : ColumnsSelector < T , C > ) : List < DataColumn < C > >","body":"= getColumnsImpl ( UnresolvedColumnsPolicy . Fail , columns )","docstring":"/**\n * Returns a list of columns selected by [columns], a [ColumnsSelectionDsl].\n *\n * NOTE: This doesn't work in [ColumnsSelectionDsl], use [ColumnsSelectionDsl.cols] to select columns by predicate.\n */"} {"signature":"public operator fun < T , C > DataFrame < T > . get ( columns : ColumnsSelector < T , C > ) : List < DataColumn < C > >","body":"= this . get ( columns )","docstring":"/**\n * Returns a list of columns selected by [columns], a [ColumnsSelectionDsl].\n */"} {"signature":"fun KtModifierKeywordToken . toVisibilityOrNull ( ) : Visibility ?","body":"{ return when ( this ) { KtTokens . PUBLIC_KEYWORD -> Visibilities . Public KtTokens . PRIVATE_KEYWORD -> Visibilities . Private KtTokens . PROTECTED_KEYWORD -> Visibilities . Protected KtTokens . INTERNAL_KEYWORD -> Visibilities . Internal else -> null } }","docstring":"/**\n * Returns Visibility by token or null\n */"} {"signature":"fun KtSourceElement . findContextReceiverListSource ( ) : KtLightSourceElement ?","body":"{ if ( this . lighterASTNode . tokenType == KtNodeTypes . CONTEXT_RECEIVER_LIST ) return this . lighterASTNode . toKtLightSourceElement ( treeStructure ) return treeStructure . findDescendantByType ( lighterASTNode , KtNodeTypes . CONTEXT_RECEIVER_LIST , false ) ? . toKtLightSourceElement ( treeStructure ) }","docstring":"/**\n * Locates first [CONTEXT_RECEIVER_LIST] and returns position in source.\n */"} {"signature":"fun findMetadataPackageParts ( packageFqName : String ) : List < String >","body":"fun findMetadataPackageParts ( packageFqName : String ) : List < String >","docstring":"/**\n * @return simple names of .kotlin_metadata files that store data for top level declarations in the package with the given FQ name\n */"} {"signature":"fun publishLibraryVariants ( vararg names : String )","body":"{ publishLibraryVariants = publishLibraryVariants . orEmpty ( ) + names }","docstring":"/** Add Android library variant names to [publishLibraryVariants]. */"} {"signature":"fun publishAllLibraryVariants ( )","body":"{ publishLibraryVariants = null }","docstring":"/** Set up all of the Android library variants to be published from this target's project within the default publications, which are\n * set up if the `maven-publish` Gradle plugin is applied. This overrides the variants chosen with [publishLibraryVariants] */"} {"signature":"private fun createSourcesElementsIfNeeded ( variantName : String , apiElementsConfigurationName : String , sourcesElementsConfigurationName : String , ) : Configuration","body":"{ val existingConfiguration = project . configurations . findByName ( sourcesElementsConfigurationName ) if ( existingConfiguration != null ) return existingConfiguration val apiElementsConfiguration = project . configurations . findConsumable ( apiElementsConfigurationName ) ? : error ( \"\" ) return project . configurations . createConsumable ( sourcesElementsConfigurationName ) . apply { description = \"\" isVisible = false apiElementsConfiguration . copyAttributesTo ( project , dest = this ) configureSourcesPublicationAttributes ( this @ KotlinAndroidTarget ) } }","docstring":"/**\n * TODO: Ask Google about providing such configuration where they could set their attributes and control them.\n * Just like as they do with apiElements or runtimeElements\n */"} {"signature":"private fun filterOutAndroidVariantAttribute ( attribute : Attribute < * > , ) : Boolean","body":"= attribute . name != \"\" && attribute . name != \"\"","docstring":"/** We filter this variant out as it is never requested on the consumer side, while keeping it leads to ambiguity between Android and\n * JVM variants due to non-nesting sets of unmatched attributes. */"} {"signature":"@ ExternalApi public fun List < ClassBinarySignature > . extractAnnotatedPackages ( targetAnnotations : Set < String > ) : List < String >","body":"{ if ( targetAnnotations . isEmpty ( ) ) return emptyList ( ) return filter { it . name . endsWith ( \"\" ) } . filter { it . access . isInterface && it . access . isSynthetic && it . access . isAbstract } . filter { it . annotations . any { ann -> targetAnnotations . any { ann . refersToName ( it ) } } } . map { val res = it . name . substring ( , it . name . length - \"\" . length ) res } }","docstring":"/**\n * Extracts name of packages annotated by one of the [targetAnnotations].\n * If there are no such packages, returns an empty list.\n *\n * Package is checked for being annotated by looking at classes with `package-info` name\n * ([see JSL 7.4.1](https://docs.oracle.com/javase/specs/jls/se21/html/jls-7.html#jls-7.4)\n * for details about `package-info`).\n */"} {"signature":"override fun testCase ( testCase : XCTestCase , didRecordIssue : XCTIssue )","body":"{ if ( testCase is XCTestCaseWrapper ) { val duration = testCase . getTestDuration ( ) val error = didRecordIssue . associatedError as NSError val throwable = if ( error is NSErrorWithKotlinException ) { error . kotlinException } else { Throwable ( didRecordIssue . compactDescription ) } sendToListeners { fail ( testCase . testCase , throwable , duration . inWholeMilliseconds ) } } }","docstring":"/**\n * Failed test case execution.\n *\n * Records test failures sending them to test listeners.\n */"} {"signature":"override fun testCase ( testCase : XCTestCase , didRecordExpectedFailure : XCTExpectedFailure )","body":"{ logger . log ( \"\" ) this . testCase ( testCase , didRecordExpectedFailure . issue ) }","docstring":"/**\n * Records expected failures as failed test as soon as such expectations should be processed in the test.\n */"} {"signature":"override fun testCaseDidFinish ( testCase : XCTestCase )","body":"{ val duration = testCase . getTestDuration ( ) if ( testCase . testRun ? . hasSucceeded == true ) { if ( testCase is XCTestCaseWrapper ) { val test = testCase . testCase if ( ! test . ignored ) sendToListeners { pass ( test , duration . inWholeMilliseconds ) } } } }","docstring":"/**\n * Test case finish notification.\n * Both successful and failed executions get this notification.\n */"} {"signature":"override fun testCaseWillStart ( testCase : XCTestCase )","body":"{ if ( testCase is XCTestCaseWrapper ) { val test = testCase . testCase if ( test . ignored ) { sendToListeners { ignore ( test ) } } else { sendToListeners { start ( test ) } } } }","docstring":"/**\n * Test case start notification.\n */"} {"signature":"override fun testSuite ( testSuite : XCTestSuite , didRecordIssue : XCTIssue )","body":"{ logger . log ( \"\" ) }","docstring":"/**\n * Test suite failure notification.\n *\n * Logs the failure of the test suite execution.\n */"} {"signature":"override fun testSuite ( testSuite : XCTestSuite , didRecordExpectedFailure : XCTExpectedFailure )","body":"{ logger . log ( \"\" ) this . testSuite ( testSuite , didRecordExpectedFailure . issue ) }","docstring":"/**\n * Test suite expected failure.\n *\n * Logs the failure of the test suite execution.\n * Treat expected failures as ordinary unexpected one.\n */"} {"signature":"override fun testSuiteDidFinish ( testSuite : XCTestSuite )","body":"{ val duration = testSuite . getTestDuration ( ) . inWholeMilliseconds if ( testSuite is XCTestSuiteWrapper ) { sendToListeners { finishSuite ( testSuite . testSuite , duration ) } } else if ( testSuite . name == TOP_LEVEL_SUITE ) { sendToListeners { finishIteration ( testSettings , , duration ) finishTesting ( testSettings , duration ) } } }","docstring":"/**\n * Test suite finish notification.\n */"} {"signature":"override fun testSuiteWillStart ( testSuite : XCTestSuite )","body":"{ if ( testSuite is XCTestSuiteWrapper ) { sendToListeners { startSuite ( testSuite . testSuite ) } } else if ( testSuite . name == TOP_LEVEL_SUITE ) { sendToListeners { startTesting ( testSettings ) startIteration ( testSettings , , testSettings . testSuites ) } } }","docstring":"/**\n * Test suite start notification.\n */"} {"signature":"fun preprocessCommandLineArguments ( args : List < String > , errors : Lazy < ArgumentParseErrors > ) : List < String >","body":"= args . flatMap { arg -> if ( arg . isArgfileArgument ) { File ( arg . argfilePath ) . expand ( errors . value ) } else if ( arg . isDeprecatedArgfileArgument ) { errors . value . deprecatedArguments [ EXPERIMENTAL_ARGFILE_ARGUMENT ] = ARGFILE_ARGUMENT File ( arg . deprecatedArgfilePath ) . expand ( errors . value ) } else { listOf ( arg ) } }","docstring":"/**\n * Performs initial preprocessing of arguments, passed to the compiler.\n * This is done prior to *any* arguments parsing, and result of preprocessing\n * will be used instead of actual passed arguments.\n */"} {"signature":"@ kotlin . internal . InlineOnly public inline fun java . util . regex . Pattern . toRegex ( ) : Regex","body":"= Regex ( this )","docstring":"/**\n * Converts this [java.util.regex.Pattern] to an instance of [Regex].\n *\n * Provides the way to use Regex API on the instances of [java.util.regex.Pattern].\n */"} {"signature":"fun fromProperty ( value : String ? )","body":"= if ( value == null ) { DAEMON } else { values ( ) . find { it . propertyValue . equals ( value , ignoreCase = true ) } ? : error ( \"\" ) }","docstring":"/**\n * @suppress\n */"} {"signature":"fun main ( )","body":"{ val ( _ , test ) = fashionMnist ( ) val jsonConfigFile = getJSONConfigFileToyResNet ( ) val model = Functional . loadModelConfiguration ( jsonConfigFile ) var copiedModel : Functional model . use { it . compile ( optimizer = Adam ( ) , loss = Losses . SOFT_MAX_CROSS_ENTROPY_WITH_LOGITS , metric = Metrics . ACCURACY ) it . logSummary ( ) val hdfFile = getWeightsFileToyResNet ( ) it . loadWeights ( hdfFile ) copiedModel = it . copy ( copyWeights = true ) val accuracy = it . evaluate ( dataset = test , batchSize = ) . metrics [ Metrics . ACCURACY ] println ( \"\" ) } copiedModel . use { copiedModel . logSummary ( ) val accuracy = copiedModel . evaluate ( dataset = test , batchSize = ) . metrics [ Metrics . ACCURACY ] println ( \"\" ) } }","docstring":"/** Just loading ToyResNet trained in Keras, making a copy and using for prediction. */"} {"signature":"inline fun < reified T : Number > prod ( a : KtNDArray < T > ) : T","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( a , None . none , a . dtype ) , kClass = T :: class )","docstring":"/**\n * Return the product of array elements over a given axis.\n */"} {"signature":"inline fun < reified T : Number > sum ( a : KtNDArray < T > ) : T","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( a , None . none , a . dtype ) , kClass = T :: class )","docstring":"/**\n * Sum of array elements over a given axis.\n */"} {"signature":"inline fun < reified T : Number > nanprod ( a : KtNDArray < T > ) : T","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( a , a . dtype ) , kClass = T :: class )","docstring":"/**\n * Return the product of array elements over a given axis treating Not a Numbers (NaNs) as ones.\n */"} {"signature":"inline fun < reified T : Number > nansum ( a : KtNDArray < T > ) : T","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( a , a . dtype ) , kClass = T :: class )","docstring":"/**\n * Return the sum of array elements over a given axis treating Not a Numbers (NaNs) as zero.\n */"} {"signature":"fun < T : Any > cumprod ( a : KtNDArray < T > , axis : Int ? = null ) : KtNDArray < T >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( a , axis ? : None . none , a . dtype ) )","docstring":"/**\n * Return the cumulative product of elements along a given axis.\n */"} {"signature":"@ JvmName ( \"\" ) fun < T : Number > cumsum ( a : KtNDArray < T > , axis : Int ? = null ) : KtNDArray < T >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( a , axis ? : None . none , a . dtype ) )","docstring":"/**\n * Return the cumulative sum of the elements along a given axis.\n */"} {"signature":"fun < T : Number > nancumprod ( a : KtNDArray < T > , axis : Int ? = null ) : KtNDArray < T >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( a , axis ? : None . none , a . dtype ) )","docstring":"/**\n * Return the cumulative product of array elements over a given axis treating Not a Numbers (NaNs) as one.\n */"} {"signature":"fun < T : Number > nancumsum ( a : KtNDArray < T > , axis : Int ? = null ) : KtNDArray < T >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( a , axis ? : None . none , a . dtype ) )","docstring":"/**\n * Return the cumulative sum of array elements over a given axis treating Not a Numbers (NaNs) as zero.\n */"} {"signature":"fun < T : Number > diff ( a : KtNDArray < T > , n : Int = , axis : Int = - ) : KtNDArray < T >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( a , n , axis ) )","docstring":"/**\n * Calculate the n-th discrete difference along the given axis.\n */"} {"signature":"fun < T : Number > ediff1d ( ary : KtNDArray < T > , toEnd : KtNDArray < T > ? = null , toStart : KtNDArray < T > ? = null ) : KtNDArray < T >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( ary , toEnd ? : None . none , toStart ? : None . none ) )","docstring":"/**\n * The differences between consecutive elements of an array.\n */"} {"signature":"fun < T : Any > gradient1D ( f : KtNDArray < T > ) : KtNDArray < Double >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( f ) )","docstring":"/**\n * Return the gradient of an one-dimensional array.\n */"} {"signature":"fun < T : Any > gradientND ( f : KtNDArray < T > ) : List < KtNDArray < Double > >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( f ) , kClass = List :: class ) as List < KtNDArray < Double > >","docstring":"/**\n * Return the gradient of an N-dimensional array.\n */"} {"signature":"fun < T : Number , E : Number > cross ( a : KtNDArray < T > , b : KtNDArray < E > , axisa : Int = - , axisb : Int = - , axisc : Int = - , axis : Int ? = null ) : KtNDArray < Double >","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( a , b , axisa , axisb , axisc , axis ? : None . none ) )","docstring":"/**\n * Return the cross product of two (arrays of) vectors.\n */"} {"signature":"fun < T : Number > trapz ( y : KtNDArray < T > , x : KtNDArray < out Number > ? = null , dx : Double = ) : Double","body":"= callFunc ( nameMethod = arrayOf ( \"\" ) , args = arrayOf ( y , x ? : None . none , dx ) , kClass = Double :: class )","docstring":"/**\n * Integrate along the given axis using the composite trapezoidal rule.\n */"} {"signature":"fun main ( )","body":"{ val modelHub = ONNXModelHub ( cacheDirectory = File ( \"\" ) ) val modelType = ONNXModels . FaceAlignment . Fan2d106 val model = modelHub . loadModel ( modelType ) model . printSummary ( ) model . use { println ( it ) val preprocessor = pipeline < BufferedImage > ( ) . resize { outputHeight = outputWidth = } . convert { colorMode = ColorMode . BGR } . toFloatArray { } . call ( modelType . preprocessor ) val result = mutableMapOf < BufferedImage , List < Landmark > > ( ) for ( i in .. ) { val inputFile = getFileFromResource ( \"\" ) val inputImage = ImageConverter . toBufferedImage ( inputFile ) val inputData = preprocessor . apply ( inputImage ) val floats = it . predict ( inputData ) { output -> output . getFloatArray ( \"\" ) } println ( floats . contentToString ( ) ) val landMarks = mutableListOf < Landmark > ( ) for ( j in floats . indices step ) { landMarks . add ( Landmark ( ( + floats [ j ] ) / , ( + floats [ j + ] ) / ) ) } result [ inputImage ] = landMarks } val panel = JPanel ( GridLayout ( , ) ) val resize = pipeline < BufferedImage > ( ) . resize { outputWidth = ; outputHeight = } for ( ( image , landmarks ) in result ) { panel . add ( createDetectedLandmarksPanel ( resize . apply ( image ) , landmarks ) ) } showFrame ( \"\" , panel ) } }","docstring":"/**\n * This examples demonstrates the light-weight inference API with [Fan2D106FaceAlignmentModel] on Fan2d106 model:\n * - Model is obtained from [ONNXModelHub].\n * - Model predicts landmarks on a few images located in resources.\n * - The detected landmarks are drawn on the images used for prediction.\n */"} {"signature":"private fun Candidate . isSyntheticFunctionCallThatShouldUseEqualityConstraint ( expectedType : ConeKotlinType ) : Boolean","body":"{ if ( components . context . isInsideAssignmentRhs ) return false val symbol = symbol as? FirCallableSymbol ? : return false if ( symbol . origin != FirDeclarationOrigin . Synthetic . FakeFunction || expectedType . isUnitOrNullableUnit || expectedType . isAnyOrNullableAny || ( symbol . callableId == SyntheticCallableId . CHECK_NOT_NULL && expectedType . canBeNull ( session ) ) ) { return false } if ( system . allTypeVariables . values . any { it is ConeTypeParameterBasedTypeVariable && it . typeParameterSymbol . containingDeclarationSymbol . isSyntheticElvisFunction ( ) } ) { return false } return true }","docstring":"/**\n * For synthetic functions (when, try, !!, but **not** elvis), we need to add an equality constraint for the expected type\n * so that some type variables aren't inferred to `Nothing` that appears in one of the branches.\n *\n * @See org.jetbrains.kotlin.types.expressions.ControlStructureTypingUtils.createKnownTypeParameterSubstitutorForSpecialCall\n */"} {"signature":"@ Suppress ( \"\" ) @ OptIn ( ExperimentalSerializationApi :: class ) public fun buildClassSerialDescriptor ( serialName : String , vararg typeParameters : SerialDescriptor , builderAction : ClassSerialDescriptorBuilder . ( ) -> Unit = { } ) : SerialDescriptor","body":"{ require ( serialName . isNotBlank ( ) ) { \"\" } val sdBuilder = ClassSerialDescriptorBuilder ( serialName ) sdBuilder . builderAction ( ) return SerialDescriptorImpl ( serialName , StructureKind . CLASS , sdBuilder . elementNames . size , typeParameters . toList ( ) , sdBuilder ) }","docstring":"/**\n * Builder for [SerialDescriptor].\n * The resulting descriptor will be uniquely identified by the given [serialName], [typeParameters] and\n * elements structure described in [builderAction] function.\n *\n * Example:\n * ```\n * // Class with custom serializer and custom serial descriptor\n * class Data(\n * val intField: Int, // This field is ignored by custom serializer\n * val longField: Long, // This field is written as long, but in serialized form is named as \"_longField\"\n * val stringList: List // This field is written as regular list of strings\n * val nullableInt: Int?\n * )\n * // Descriptor for such class:\n * buildClassSerialDescriptor(\"my.package.Data\") {\n * // intField is deliberately ignored by serializer -- not present in the descriptor as well\n * element(\"_longField\") // longField is named as _longField\n * element(\"stringField\", listSerialDescriptor()) // or ListSerializer(String.serializer()).descriptor\n * element(\"nullableInt\", serialDescriptor().nullable)\n * }\n * ```\n *\n * Example for generic classes:\n * ```\n * import kotlinx.serialization.builtins.*\n *\n * @Serializable(CustomSerializer::class)\n * class BoxedList(val list: List)\n *\n * class CustomSerializer(tSerializer: KSerializer): KSerializer> {\n * // here we use tSerializer.descriptor because it represents T\n * override val descriptor = buildClassSerialDescriptor(\"pkg.BoxedList\", tSerializer.descriptor) {\n * // here we have to wrap it with List first, because property has type List\n * element(\"list\", ListSerializer(tSerializer).descriptor) // or listSerialDescriptor(tSerializer.descriptor)\n * }\n * }\n * ```\n */"} {"signature":"public fun PrimitiveSerialDescriptor ( serialName : String , kind : PrimitiveKind ) : SerialDescriptor","body":"{ require ( serialName . isNotBlank ( ) ) { \"\" } return PrimitiveDescriptorSafe ( serialName , kind ) }","docstring":"/**\n * Factory to create a trivial primitive descriptors.\n * Primitive descriptors should be used when the serialized form of the data has a primitive form, for example:\n * ```\n * object LongAsStringSerializer : KSerializer {\n * override val descriptor: SerialDescriptor =\n * PrimitiveSerialDescriptor(\"kotlinx.serialization.LongAsStringSerializer\", PrimitiveKind.STRING)\n *\n * override fun serialize(encoder: Encoder, value: Long) {\n * encoder.encodeString(value.toString())\n * }\n *\n * override fun deserialize(decoder: Decoder): Long {\n * return decoder.decodeString().toLong()\n * }\n * }\n * ```\n */"} {"signature":"@ ExperimentalSerializationApi public fun SerialDescriptor ( serialName : String , original : SerialDescriptor ) : SerialDescriptor","body":"{ require ( serialName . isNotBlank ( ) ) { \"\" } require ( original . kind !is PrimitiveKind ) { \"\" } require ( serialName != original . serialName ) { \"\" } return WrappedSerialDescriptor ( serialName , original ) }","docstring":"/**\n * Factory to create a new descriptor that is identical to [original] except that the name is equal to [serialName].\n * Should be used when you want to serialize a type as another non-primitive type.\n * Don't use this if you want to serialize a type as a primitive value, use [PrimitiveSerialDescriptor] instead.\n * \n * Example:\n * ```\n * @Serializable(CustomSerializer::class)\n * class CustomType(val a: Int, val b: Int, val c: Int)\n *\n * class CustomSerializer: KSerializer {\n * override val descriptor = SerialDescriptor(\"CustomType\", IntArraySerializer().descriptor)\n *\n * override fun serialize(encoder: Encoder, value: CustomType) {\n * encoder.encodeSerializableValue(IntArraySerializer(), intArrayOf(value.a, value.b, value.c))\n * }\n *\n * override fun deserialize(decoder: Decoder): CustomType {\n * val array = decoder.decodeSerializableValue(IntArraySerializer())\n * return CustomType(array[0], array[1], array[2])\n * }\n * }\n * ```\n */"} {"signature":"@ InternalSerializationApi @ OptIn ( ExperimentalSerializationApi :: class ) public fun buildSerialDescriptor ( serialName : String , kind : SerialKind , vararg typeParameters : SerialDescriptor , builder : ClassSerialDescriptorBuilder . ( ) -> Unit = { } ) : SerialDescriptor","body":"{ require ( serialName . isNotBlank ( ) ) { \"\" } require ( kind != StructureKind . CLASS ) { \"\" } val sdBuilder = ClassSerialDescriptorBuilder ( serialName ) sdBuilder . builder ( ) return SerialDescriptorImpl ( serialName , kind , sdBuilder . elementNames . size , typeParameters . toList ( ) , sdBuilder ) }","docstring":"/**\n * An unsafe alternative to [buildClassSerialDescriptor] that supports an arbitrary [SerialKind].\n * This function is left public only for migration of pre-release users and is not intended to be used\n * as generally-safe and stable mechanism. Beware that it can produce inconsistent or non spec-compliant instances.\n *\n * If you end up using this builder, please file an issue with your use-case in kotlinx.serialization issue tracker.\n */"} {"signature":"public inline fun < reified T > serialDescriptor ( ) : SerialDescriptor","body":"= serializer < T > ( ) . descriptor","docstring":"/**\n * Retrieves descriptor of type [T] using reified [serializer] function.\n */"} {"signature":"public fun serialDescriptor ( type : KType ) : SerialDescriptor","body":"= serializer ( type ) . descriptor","docstring":"/**\n * Retrieves descriptor of type associated with the given [KType][type]\n */"} {"signature":"@ ExperimentalSerializationApi public fun listSerialDescriptor ( elementDescriptor : SerialDescriptor ) : SerialDescriptor","body":"{ return ArrayListClassDesc ( elementDescriptor ) }","docstring":"/**\n * Creates a descriptor for the type `List` where `T` is the type associated with [elementDescriptor].\n */"} {"signature":"@ ExperimentalSerializationApi public inline fun < reified T > listSerialDescriptor ( ) : SerialDescriptor","body":"{ return listSerialDescriptor ( serializer < T > ( ) . descriptor ) }","docstring":"/**\n * Creates a descriptor for the type `List`.\n */"} {"signature":"@ ExperimentalSerializationApi public fun mapSerialDescriptor ( keyDescriptor : SerialDescriptor , valueDescriptor : SerialDescriptor ) : SerialDescriptor","body":"{ return HashMapClassDesc ( keyDescriptor , valueDescriptor ) }","docstring":"/**\n * Creates a descriptor for the type `Map` where `K` and `V` are types\n * associated with [keyDescriptor] and [valueDescriptor] respectively.\n */"} {"signature":"@ ExperimentalSerializationApi public inline fun < reified K , reified V > mapSerialDescriptor ( ) : SerialDescriptor","body":"{ return mapSerialDescriptor ( serializer < K > ( ) . descriptor , serializer < V > ( ) . descriptor ) }","docstring":"/**\n * Creates a descriptor for the type `Map`.\n */"} {"signature":"@ ExperimentalSerializationApi public fun setSerialDescriptor ( elementDescriptor : SerialDescriptor ) : SerialDescriptor","body":"{ return HashSetClassDesc ( elementDescriptor ) }","docstring":"/**\n * Creates a descriptor for the type `Set` where `T` is the type associated with [elementDescriptor].\n */"} {"signature":"@ ExperimentalSerializationApi public inline fun < reified T > setSerialDescriptor ( ) : SerialDescriptor","body":"{ return setSerialDescriptor ( serializer < T > ( ) . descriptor ) }","docstring":"/**\n * Creates a descriptor for the type `Set`.\n */"} {"signature":"public fun element ( elementName : String , descriptor : SerialDescriptor , annotations : List < Annotation > = emptyList ( ) , isOptional : Boolean = false )","body":"{ require ( uniqueNames . add ( elementName ) ) { \"\" } elementNames += elementName elementDescriptors += descriptor elementAnnotations += annotations elementOptionality += isOptional }","docstring":"/**\n * Add an element with a given [name][elementName], [descriptor],\n * type annotations and optionality the resulting descriptor.\n *\n * Example of usage:\n * ```\n * class Data(\n * val intField: Int? = null, // Optional, has default value\n * @ProtoNumber(1) val longField: Long\n * )\n *\n * // Corresponding descriptor\n * SerialDescriptor(\"package.Data\") {\n * element(\"intField\", isOptional = true)\n * element(\"longField\", annotations = listOf(protoIdAnnotationInstance))\n * }\n * ```\n */"} {"signature":"public inline fun < reified T > ClassSerialDescriptorBuilder . element ( elementName : String , annotations : List < Annotation > = emptyList ( ) , isOptional : Boolean = false )","body":"{ val descriptor = serializer < T > ( ) . descriptor element ( elementName , descriptor , annotations , isOptional ) }","docstring":"/**\n * A reified version of [element] function that\n * extract descriptor using `serializer().descriptor` call with all the restrictions of `serializer().descriptor`.\n */"} {"signature":"@ Test fun testAwaitCancellation ( )","body":"= runTest { expect ( ) val observable = ObservableSource < Int > { s -> s . onSubscribe ( object : Disposable { override fun dispose ( ) { expect ( ) } override fun isDisposed ( ) : Boolean { expectUnreached ( ) ; return false } } ) } val job = launch ( start = CoroutineStart . UNDISPATCHED ) { try { expect ( ) observable . awaitFirst ( ) } catch ( e : CancellationException ) { expect ( ) throw e } } expect ( ) job . cancelAndJoin ( ) finish ( ) }","docstring":"/** Tests that calls to [awaitFirst] (and, thus, the other methods) throw [CancellationException] and dispose of\n * the subscription when their [Job] is cancelled. */"} {"signature":"private fun FunctionDescriptor . hasDifferentParameterNames ( other : FunctionDescriptor ) : Boolean","body":"{ return valueParameters . drop ( ) . map { it . name } != other . valueParameters . 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 verifyGolden ( testInfo : GoldenTransformTestInfo )","body":"{ if ( generateGoldens || ( ! goldenFile . exists ( ) && generateMissingGoldens ) || goldenFile . nameWithoutExtension in generateGoldenFiles ) { saveGolden ( testInfo ) } if ( ! goldenFile . exists ( ) ) { throw FileNotFoundException ( \"\" ) } val loadedTestInfo = try { GoldenTransformTestInfo . fromEncodedString ( goldenFile . readText ( ) ) } catch ( e : IllegalStateException ) { error ( \"\" ) } Assert . assertEquals ( \"\" + \"\" + \"\" + \"\" + \"\" + \"\" , loadedTestInfo . transformed , testInfo . transformed ) }","docstring":"/**\n * Verify the current test against the matching golden file.\n * If generateGoldens is true, the golden file will first be generated.\n */"} {"signature":"@ JvmStatic public fun invariant ( type : KType ) : KTypeProjection","body":"= KTypeProjection ( KVariance . INVARIANT , type )","docstring":"/**\n * Creates an invariant projection of a given type. Invariant projection is just the type itself,\n * without any use-site variance modifiers applied to it.\n * For example, in the type `Set`, `String` is an invariant projection of the type represented by the class `String`.\n */"} {"signature":"@ JvmStatic public fun contravariant ( type : KType ) : KTypeProjection","body":"= KTypeProjection ( KVariance . IN , type )","docstring":"/**\n * Creates a contravariant projection of a given type, denoted by the `in` modifier applied to a type.\n * For example, in the type `MutableList`, `in Number` is a contravariant projection of the type of class `Number`.\n */"} {"signature":"@ JvmStatic public fun covariant ( type : KType ) : KTypeProjection","body":"= KTypeProjection ( KVariance . OUT , type )","docstring":"/**\n * Creates a covariant projection of a given type, denoted by the `out` modifier applied to a type.\n * For example, in the type `Array`, `out Number` is a covariant projection of the type of class `Number`.\n */"} {"signature":"public fun serializeToBuffer ( src : Array < FloatArray > , start : Int , length : Int ) : FloatBuffer","body":"{ val buffer = FloatBuffer . allocate ( length * src [ ] . size ) for ( i in start until start + length ) { buffer . put ( src [ i ] ) } return ( buffer as Buffer ) . rewind ( ) as FloatBuffer }","docstring":"/** Converts [src] to [FloatBuffer] from [start] position for the next [length] positions. */"} {"signature":"public fun serializeToBuffer ( src : Array < FloatArray > ) : FloatBuffer","body":"{ val buffer = FloatBuffer . allocate ( src . size * src [ ] . size ) for ( element in src ) { buffer . put ( element ) } return ( buffer as Buffer ) . rewind ( ) as FloatBuffer }","docstring":"/** Converts [src] to [FloatBuffer]. */"} {"signature":"public fun serializeToBuffer ( src : FloatArray ) : FloatBuffer","body":"{ val buffer = FloatBuffer . allocate ( src . size ) buffer . put ( src ) return ( buffer as Buffer ) . rewind ( ) as FloatBuffer }","docstring":"/** Converts [src] to [FloatBuffer]. */"} {"signature":"public fun serializeLabelsToBuffer ( src : FloatArray , amountOfClasses : Long ) : FloatBuffer","body":"{ val oneHotEncodedLabels = Array ( src . size ) { FloatArray ( amountOfClasses . toInt ( ) ) { } } for ( i in src . indices ) { val label = src [ i ] if ( amountOfClasses == ) { oneHotEncodedLabels [ i ] [ ] = label } else { require ( <= label && label < amountOfClasses ) { \"\" } oneHotEncodedLabels [ i ] [ label . toInt ( ) ] = } } val buffer = FloatBuffer . allocate ( oneHotEncodedLabels . size * oneHotEncodedLabels [ ] . size ) for ( element in oneHotEncodedLabels ) { buffer . put ( element ) } return ( buffer as Buffer ) . rewind ( ) as FloatBuffer }","docstring":"/** Converts [src] to [FloatBuffer]. */"} {"signature":"private fun Candidate . mightBeAnalyzedAndCompletedIndependently ( ) : Boolean","body":"{ when ( callInfo . resolutionMode ) { is ResolutionMode . Delegate -> return false is ResolutionMode . WithExpectedType -> when { callInfo . resolutionMode . expectedTypeRef . type . containsNotFixedTypeVariables ( ) -> return false } is ResolutionMode . WithStatus , is ResolutionMode . LambdaResolution -> error ( \"\" ) is ResolutionMode . AssignmentLValue , is ResolutionMode . ContextDependent , is ResolutionMode . ContextIndependent , is ResolutionMode . ReceiverResolution , -> { } } val callSite = callInfo . callSite if ( callSite is FirAnnotationCall || callSite is FirArrayLiteral ) return true if ( callSite !is FirResolvable && callSite !is FirVariableAssignment ) return false if ( dispatchReceiver ? . isReceiverPostponed ( ) == true ) return false if ( givenExtensionReceiverOptions . any { it . isReceiverPostponed ( ) } ) return false val returnType = ( symbol as? FirCallableSymbol ) ? . let ( returnTypeCalculator :: tryCalculateReturnType ) if ( returnType ? . type ? . containsNotFixedTypeVariables ( ) == true ) return false if ( callInfo . arguments . any { ! it . isTrivialArgument ( ) } ) return false return true }","docstring":"/**\n * This function returns true only when it's safe & sound to analyze and complete the candidate outside the PCLA context,\n * i.e., independently of outer CS.\n *\n * That might be some plain variable accesses that do not contain type variables or regular function calls with only trivial arguments.\n *\n * The basic purpose of that function is performance enhancement because resolving all the calls inside PCLA lambda in the outer context\n * might be too much.\n *\n * Mostly, that means that this function might always return false and it should be correct.\n * TODO: Currently, making it always returning \"false\" leads to few test failures\n * TODO: due to some corner cases like annotations calls (KT-65465)\n */"} {"signature":"fun removeUnusedFunctionDefinitions ( root : JsNode , functions : Map < JsName , JsFunction > )","body":"{ val removable = with ( UnusedLocalFunctionsCollector ( functions ) ) { process ( ) accept ( root ) removableFunctions } . toSet ( ) val remover = NodeRemover ( JsStatement :: class . java ) { statement -> val expression = when ( statement ) { is JsExpressionStatement -> statement . expression is JsVars -> if ( statement . vars . size == ) statement . vars [ ] . initExpression else null else -> null } expression is JsFunction && expression in removable } remover . accept ( root ) }","docstring":"/**\n * Removes unused function definitions:\n * f: function() { return 10 }\n *\n * At now, it only removes unused local functions and function literals,\n * because named functions can be referenced from another module.\n */"} {"signature":"fun createIfNeeded ( session : FirSession , moduleData : FirModuleData , kotlinScopeProvider : FirKotlinScopeProvider , ) : FirExtensionSyntheticFunctionInterfaceProvider ?","body":"{ if ( ! session . functionTypeService . hasExtensionKinds ( ) ) return null return FirExtensionSyntheticFunctionInterfaceProvider ( session , moduleData , kotlinScopeProvider ) }","docstring":"/**\n * A [FirExtensionSyntheticFunctionInterfaceProvider] only needs to be created if the session's function type service has extension\n * function kinds. Otherwise, the provider would be useless.\n *\n * Important note: this provider should be created once per compiled set of modules, so all sessions will share the same provider\n * Otherwise it may lead to the situation when there are two different symbols for the same classId, which may trigger\n * errors during expect/actual matching\n */"} {"signature":"@ FirSymbolProviderInternals fun ClassId . mayBeSyntheticFunctionClassName ( ) : Boolean","body":"= relativeClassName . asString ( ) . lastOrNull ( ) ? . isDigit ( ) == true","docstring":"/**\n * A [ClassId] can only be a name for a generated function class if it ends with a digit. See [FunctionTypeKind].\n *\n * Checking this first is usually faster than checking `functionTypeService.getKindByClassNamePrefix` or a class cache.\n */"} {"signature":"@ Synchronized internal fun updateState ( state : String , frame : Continuation < * > , shouldBeMatched : Boolean )","body":"{ if ( _state == RUNNING && state == RUNNING && shouldBeMatched ) { ++ unmatchedResume } else if ( unmatchedResume > && state == SUSPENDED ) { -- unmatchedResume return } if ( _state == state && state == SUSPENDED && lastObservedFrame != null ) return _state = state lastObservedFrame = frame as? CoroutineStackFrame lastObservedThread = if ( state == RUNNING ) { Thread . currentThread ( ) } else { null } }","docstring":"/**\n * Here we orchestrate overlapping state updates that are coming asynchronously.\n * In a nutshell, `probeCoroutineSuspended` can arrive **later** than its matching `probeCoroutineResumed`,\n * e.g. for the following code:\n * ```\n * suspend fun foo() = yield()\n * ```\n *\n * we have this sequence:\n * ```\n * fun foo(...) {\n * uCont.intercepted().dispatchUsingDispatcher() // 1\n * // Notify the debugger the coroutine is suspended\n * probeCoroutineSuspended() // 2\n * return COROUTINE_SUSPENDED // Unroll the stack\n * }\n * ```\n * Nothing prevents coroutine to be dispatched and invoke `probeCoroutineResumed` right between '1' and '2'.\n * See also: https://github.com/Kotlin/kotlinx.coroutines/issues/3193\n *\n * [shouldBeMatched] -- `false` if it is an expected consecutive `probeCoroutineResumed` from BaseContinuationImpl,\n * `true` otherwise.\n */"} {"signature":"internal 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 main ( )","body":"{ val preprocessing = pipeline < BufferedImage > ( ) . resize { outputHeight = IMAGE_SIZE . toInt ( ) outputWidth = IMAGE_SIZE . toInt ( ) interpolation = InterpolationType . NEAREST } . convert { colorMode = ColorMode . BGR } . toFloatArray { } . rescale { scalingCoefficient = } val dogsCatsImages = dogsCatsDatasetPath ( ) val dataset = OnFlyImageDataset . create ( File ( dogsCatsImages ) , FromFolders ( mapping = mapOf ( \"\" to , \"\" to ) ) , preprocessing ) . shuffle ( ) 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 Kaggle Cats vs Dogs binary 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":"fun JsFunction . getInnerFunction ( ) : JsFunction ?","body":"{ val statements = body . statements if ( statements . size != ) return null val statement = statements . get ( ) val returnExpr = ( statement as? JsReturn ) ? . expression return returnExpr as? JsFunction }","docstring":"/**\n * Gets inner function from function, that creates closure\n *\n * For example:\n * function(a) {\n * return function() { return a; }\n * }\n *\n * Inner functions can only be generated when lambda\n * with closure is created\n */"} {"signature":"fun KonanTarget . withSanitizer ( sanitizer : SanitizerKind ? = null )","body":"= TargetWithSanitizer ( this , sanitizer )","docstring":"/**\n * Construct [TargetWithSanitizer] from [target][KonanTarget] and optional [sanitizer][SanitizerKind].\n */"} {"signature":"fun AttributesSchema . registerTargetWithSanitizerAttribute ( )","body":"{ attribute ( TargetWithSanitizer . TARGET_ATTRIBUTE ) { disambiguationRules . add ( TargetDisambiguationRule :: class . java ) } }","docstring":"/**\n * Register [TargetWithSanitizer] attribute with [AttributesSchema].\n */"} {"signature":"fun runTestOrSkip ( block : suspend CoroutineScope . ( ) -> Unit ) : TestResult","body":"{ return runTest { if ( shouldSkipTesting ( ) ) return@runTest val testBody = launch ( Dispatchers . Default ) { block ( ) } spinTest ( testBody ) } }","docstring":"/** Runs the given block as a test, unless [shouldSkipTesting] indicates that the environment is not suitable. */"} {"signature":"@ Test fun testMainDispatcherToString ( )","body":"{ assertEquals ( \"\" , Dispatchers . Main . toString ( ) ) assertEquals ( \"\" , Dispatchers . Main . immediate . toString ( ) ) }","docstring":"/** Tests the [toString] behavior of [Dispatchers.Main] and [MainCoroutineDispatcher.immediate] */"} {"signature":"@ Test fun testMainDispatcherOrderingInMainThread ( )","body":"= runTestOrSkip { withContext ( Dispatchers . Main ) { testMainDispatcherOrdering ( ) } }","docstring":"/** Tests that the tasks scheduled earlier from [MainCoroutineDispatcher.immediate] will be executed earlier,\n * even if the immediate dispatcher was entered from the main thread. */"} {"signature":"@ Test fun testMainDispatcherOrderingOutsideMainThread ( )","body":"= runTestOrSkip { testMainDispatcherOrdering ( ) }","docstring":"/** Tests that the tasks scheduled earlier from [MainCoroutineDispatcher.immediate] will be executed earlier\n * if the immediate dispatcher was entered from outside the main thread. */"} {"signature":"@ Test fun testHandlerDispatcherNotEqualToImmediate ( )","body":"{ assertNotEquals ( Dispatchers . Main , Dispatchers . Main . immediate ) }","docstring":"/** Tests that [Dispatchers.Main] and its [MainCoroutineDispatcher.immediate] are treated as different values. */"} {"signature":"@ Test fun testImmediateDispatcherYield ( )","body":"= runTestOrSkip { withContext ( Dispatchers . Main ) { expect ( ) checkIsMainThread ( ) launch ( Dispatchers . Main . immediate ) { expect ( ) yield ( ) expect ( ) } expect ( ) yield ( ) expect ( ) } finish ( ) }","docstring":"/** Tests that [Dispatchers.Main] shares its queue with [MainCoroutineDispatcher.immediate]. */"} {"signature":"@ Test fun testEnteringImmediateFromMain ( )","body":"= runTestOrSkip { withContext ( Dispatchers . Main ) { expect ( ) val job = launch { expect ( ) } withContext ( Dispatchers . Main . immediate ) { expect ( ) } job . join ( ) } finish ( ) }","docstring":"/** Tests that entering [MainCoroutineDispatcher.immediate] from [Dispatchers.Main] happens immediately. */"} {"signature":"@ Test fun testDispatchRequirements ( )","body":"= runTestOrSkip { checkDispatchRequirements ( ) withContext ( Dispatchers . Main ) { checkDispatchRequirements ( ) withContext ( Dispatchers . Main . immediate ) { checkDispatchRequirements ( ) } checkDispatchRequirements ( ) } checkDispatchRequirements ( ) }","docstring":"/** Tests that dispatching to [MainCoroutineDispatcher.immediate] is required from and only from dispatchers\n * other than the main dispatchers and that it's always required for [Dispatchers.Main] itself. */"} {"signature":"@ Test fun testLaunchInMainScope ( )","body":"= runTestOrSkip { var executed = false withMainScope { launch { checkIsMainThread ( ) executed = true } . join ( ) if ( ! executed ) throw AssertionError ( \"\" ) } }","docstring":"/** Tests that launching a coroutine in [MainScope] will execute it in the main thread. */"} {"signature":"@ Test fun testFailureInMainScope ( )","body":"= runTestOrSkip { var exception : Throwable ? = null withMainScope { launch ( CoroutineExceptionHandler { ctx , e -> exception = e } ) { checkIsMainThread ( ) throw TestException ( ) } . join ( ) } if ( exception ! ! !is TestException ) throw AssertionError ( \"\" ) }","docstring":"/** Tests that a failure in [MainScope] will not propagate upwards. */"} {"signature":"@ Test fun testCancellationInMainScope ( )","body":"= runTestOrSkip { withMainScope { cancel ( ) launch ( start = CoroutineStart . ATOMIC ) { checkIsMainThread ( ) delay ( Long . MAX_VALUE ) } . join ( ) } }","docstring":"/** Tests cancellation in [MainScope]. */"} {"signature":"@ Test fun testDelay ( )","body":"= runTestOrSkip { expect ( ) checkNotMainThread ( ) scheduleOnMainQueue { expect ( ) } withContext ( Dispatchers . Main ) { checkIsMainThread ( ) expect ( ) scheduleOnMainQueue { expect ( ) } delay ( ) checkIsMainThread ( ) expect ( ) } checkNotMainThread ( ) finish ( ) }","docstring":"/** Tests that after a delay, the execution gets back to the main thread. */"} {"signature":"@ Test fun testWithTimeoutContextDelayNoTimeout ( )","body":"= runTestOrSkip { expect ( ) withTimeout ( ) { withContext ( Dispatchers . Main ) { checkIsMainThread ( ) expect ( ) delay ( ) checkIsMainThread ( ) expect ( ) } } checkNotMainThread ( ) finish ( ) }","docstring":"/** Tests that [Dispatchers.Main] is in agreement with the default time source: it's not much slower. */"} {"signature":"@ Test fun testWithTimeoutContextDelayTimeout ( )","body":"= runTestOrSkip { expect ( ) assertFailsWith < TimeoutCancellationException > { withTimeout ( ) { launch ( Dispatchers . Main , start = CoroutineStart . ATOMIC ) { checkIsMainThread ( ) expect ( ) delay ( ) expectUnreached ( ) } . join ( ) } expectUnreached ( ) } checkNotMainThread ( ) finish ( ) }","docstring":"/** Tests that [Dispatchers.Main] is in agreement with the default time source: it's not much faster. */"} {"signature":"@ Test fun testWithContextTimeoutDelayNoTimeout ( )","body":"= runTestOrSkip { expect ( ) withContext ( Dispatchers . Main ) { withTimeout ( ) { checkIsMainThread ( ) expect ( ) delay ( ) checkIsMainThread ( ) expect ( ) } } checkNotMainThread ( ) finish ( ) }","docstring":"/** Tests that the timeout of [Dispatchers.Main] is in agreement with its [delay]: it's not much faster. */"} {"signature":"@ Test fun testWithContextTimeoutDelayTimeout ( )","body":"= runTestOrSkip { expect ( ) assertFailsWith < TimeoutCancellationException > { withContext ( Dispatchers . Main ) { withTimeout ( ) { checkIsMainThread ( ) expect ( ) delay ( ) expectUnreached ( ) } } expectUnreached ( ) } checkNotMainThread ( ) finish ( ) }","docstring":"/** Tests that the timeout of [Dispatchers.Main] is in agreement with its [delay]: it's not much slower. */"} {"signature":"internal inline fun < reified T > Any . castIsolatedKotlinPluginClassLoaderAware ( ) : T","body":"{ if ( this is T ) return this val targetClassFromReceiverClassLoader = try { this :: class . java . classLoader . loadClass ( T :: class . java . name ) } catch ( _ : ClassNotFoundException ) { null } if ( targetClassFromReceiverClassLoader != null && targetClassFromReceiverClassLoader != T :: class . java ) { if ( null is T && ! targetClassFromReceiverClassLoader . isInstance ( this ) ) return null as T throw IsolatedKotlinClasspathClassCastException ( ) } return if ( null is T ) null as T else this as T }","docstring":"/**\n * Behaves like a regular cast function, but will be able to detect cast failures because\n * of an isolated classpath. In this case a more detailed error message will be emitted.\n *\n * ```\n * \"\".castIsolatedKotlinPluginClassLoaderAware() // fails like \"\" as Int\n * \"\".castIsolatedKotlinPluginClassLoaderAware() // returns null like \"\" as? Int\n * ```\n * @return [this] as T if possible (regular cast)\n * @throws ClassCastException is not castable\n * @throws IsolatedKotlinClasspathClassCastException when a separated classpath is detected. See [MULTIPLE_KOTLIN_PLUGINS_LOADED_WARNING]\n */"} {"signature":"@ ExperimentalSerializationApi public fun < T > encodeToMap ( serializer : SerializationStrategy < T > , value : T ) : Map < String , Any >","body":"{ val m = OutAnyMapper ( ) m . encodeSerializableValue ( serializer , value ) return m . map }","docstring":"/**\n * Encodes properties from the given [value] to a map using the given [serializer].\n * `null` values are omitted from the output.\n */"} {"signature":"@ ExperimentalSerializationApi public fun < T > encodeToStringMap ( serializer : SerializationStrategy < T > , value : T ) : Map < String , String >","body":"{ val m = OutStringMapper ( ) m . encodeSerializableValue ( serializer , value ) return m . map }","docstring":"/**\n * Encodes properties from the given [value] to a map using the given [serializer].\n * Converts all primitive types to [String] using [toString] method.\n * `null` values are omitted from the output.\n */"} {"signature":"@ ExperimentalSerializationApi public fun < T > decodeFromMap ( deserializer : DeserializationStrategy < T > , map : Map < String , Any > ) : T","body":"{ val m = InAnyMapper ( map , deserializer . descriptor ) return m . decodeSerializableValue ( deserializer ) }","docstring":"/**\n * Decodes properties from the given [map] to a value of type [T] using the given [deserializer].\n * [T] may contain properties of nullable types; they will be filled by non-null values from the [map], if present.\n */"} {"signature":"@ ExperimentalSerializationApi public fun < T > decodeFromStringMap ( deserializer : DeserializationStrategy < T > , map : Map < String , String > ) : T","body":"{ val m = InStringMapper ( map , deserializer . descriptor ) return m . decodeSerializableValue ( deserializer ) }","docstring":"/**\n * Decodes properties from the given [map] to a value of type [T] using the given [deserializer].\n * [String] values are converted to respective primitive types using default conversion methods.\n * [T] may contain properties of nullable types; they will be filled by non-null values from the [map], if present.\n */"} {"signature":"@ ExperimentalSerializationApi public fun Properties ( module : SerializersModule ) : Properties","body":"= PropertiesImpl ( module )","docstring":"/**\n * Creates an instance of [Properties] with a given [module].\n */"} {"signature":"@ ExperimentalSerializationApi public inline fun < reified T > Properties . encodeToMap ( value : T ) : Map < String , Any >","body":"= encodeToMap ( serializersModule . serializer ( ) , value )","docstring":"/**\n * Encodes properties from given [value] to a map using serializer for reified type [T] and returns this map.\n * `null` values are omitted from the output.\n */"} {"signature":"@ ExperimentalSerializationApi public inline fun < reified T > Properties . encodeToStringMap ( value : T ) : Map < String , String >","body":"= encodeToStringMap ( serializersModule . serializer ( ) , value )","docstring":"/**\n * Encodes properties from given [value] to a map using serializer for reified type [T] and returns this map.\n * Converts all primitive types to [String] using [toString] method.\n * `null` values are omitted from the output.\n */"} {"signature":"@ ExperimentalSerializationApi public inline fun < reified T > Properties . decodeFromMap ( map : Map < String , Any > ) : T","body":"= decodeFromMap ( serializersModule . serializer ( ) , map )","docstring":"/**\n * Decodes properties from given [map], assigns them to an object using serializer for reified type [T] and returns this object.\n * [T] may contain properties of nullable types; they will be filled by non-null values from the [map], if present.\n */"} {"signature":"@ ExperimentalSerializationApi public inline fun < reified T > Properties . decodeFromStringMap ( map : Map < String , String > ) : T","body":"= decodeFromStringMap ( serializersModule . serializer ( ) , map )","docstring":"/**\n * Decodes properties from given [map], assigns them to an object using serializer for reified type [T] and returns this object.\n * [String] values are converted to respective primitive types using default conversion methods.\n * [T] may contain properties of nullable types; they will be filled by non-null values from the [map], if present.\n */"} {"signature":"fun < T > withScopesForClass ( owner : FirClass , holder : SessionHolder , f : ( ) -> T ) : T","body":"{ val labelName = ( owner as? FirRegularClass ) ? . name ? : if ( owner . classKind == ClassKind . ENUM_ENTRY ) { owner . primaryConstructorIfAny ( holder . session ) ? . callableId ? . className ? . shortName ( ) } else null val type = owner . defaultType ( ) val towerElementsForClass = holder . collectTowerDataElementsForClass ( owner , type ) val base = towerDataContext . addNonLocalTowerDataElements ( towerElementsForClass . superClassesStaticsAndCompanionReceivers ) val statics = base . addNonLocalScopesIfNotNull ( towerElementsForClass . companionStaticScope , towerElementsForClass . staticScope ) val staticsAndCompanion = when ( val companionReceiver = towerElementsForClass . companionReceiver ) { null -> statics else -> base . addReceiver ( null , companionReceiver ) . addNonLocalScopesIfNotNull ( towerElementsForClass . companionStaticScope , towerElementsForClass . staticScope ) } val typeParameterScope = ( owner as? FirRegularClass ) ? . typeParameterScope ( ) val forConstructorHeader = if ( typeParameterScope != null ) { towerDataContext . addNonLocalTowerDataElements ( towerElementsForClass . superClassesStaticsAndCompanionReceivers ) . run { towerElementsForClass . companionReceiver ? . let { addReceiver ( null , it ) } ? : this } . addNonLocalScopesIfNotNull ( towerElementsForClass . companionStaticScope , towerElementsForClass . staticScope ) . addNonLocalScope ( typeParameterScope ) } else { staticsAndCompanion } val forMembersResolution = forConstructorHeader . addReceiver ( labelName , towerElementsForClass . thisReceiver ) . addContextReceiverGroup ( towerElementsForClass . contextReceivers ) @ Suppress ( \"\" ) val scopeForEnumEntries = forConstructorHeader val newTowerDataContextForStaticNestedClasses = if ( ( owner as? FirRegularClass ) ? . classKind ? . isSingleton == true ) forMembersResolution else staticsAndCompanion val constructor = ( owner as? FirRegularClass ) ? . declarations ? . firstOrNull { it is FirConstructor } as? FirConstructor val ( primaryConstructorPureParametersScope , primaryConstructorAllParametersScope ) = if ( constructor ? . isPrimary == true ) { constructor . scopesWithPrimaryConstructorParameters ( holder . session ) } else { null to null } val newContexts = FirRegularTowerDataContexts ( regular = forMembersResolution , forClassHeaderAnnotations = base , forNestedClasses = newTowerDataContextForStaticNestedClasses , forCompanionObject = statics , forConstructorHeaders = forConstructorHeader , forEnumEntries = scopeForEnumEntries , primaryConstructorPureParametersScope = primaryConstructorPureParametersScope , primaryConstructorAllParametersScope = primaryConstructorAllParametersScope ) return withTowerDataContexts ( newContexts ) { f ( ) } }","docstring":"/**\n * Changes to the order of scopes should also be reflected in\n * [org.jetbrains.kotlin.fir.resolve.transformers.FirTypeResolveTransformer.withClassScopes].\n * Otherwise, we get different behavior between type resolve and body resolve phases.\n */"} {"signature":"fun testNoModuleInfoClass ( )","body":"{ val fooKt = tmpdir . resolve ( \"\" ) . also { it . writeText ( \"\" ) } val jar = tmpdir . resolve ( \"\" ) AbstractCliTest . executeCompilerGrabOutput ( K2JVMCompiler ( ) , listOf ( fooKt . path , \"\" , jar . path , \"\" ) ) assertNoModuleInfoClass ( jar ) }","docstring":"/**\n * KT-44078\n */"} {"signature":"public fun Window . asCoroutineDispatcher ( ) : CoroutineDispatcher","body":"= @ Suppress ( \"\" ) asDynamic ( ) . coroutineDispatcher ? : WindowDispatcher ( this ) . also { asDynamic ( ) . coroutineDispatcher = it }","docstring":"/**\n * Converts an instance of [Window] to an implementation of [CoroutineDispatcher].\n */"} {"signature":"public suspend fun Window . awaitAnimationFrame ( ) : Double","body":"= suspendCancellableCoroutine { cont -> asWindowAnimationQueue ( ) . enqueue ( cont ) }","docstring":"/**\n * Suspends coroutine until next JS animation frame and returns frame time on resumption.\n * The time is consistent with [window.performance.now()][org.w3c.performance.Performance.now].\n * This function is cancellable. If the [Job] of the current coroutine is completed while this suspending\n * function is waiting, this function immediately resumes with [CancellationException].\n */"} {"signature":"private fun checkSuperTypeNotInitialized ( primaryConstructorSymbol : FirConstructorSymbol , regularClass : FirClass , context : CheckerContext , reporter : DiagnosticReporter )","body":"{ val containingClass = context . containingDeclarations . lastIsInstanceOrNull < FirRegularClass > ( ) val delegatedConstructorCall = primaryConstructorSymbol . resolvedDelegatedConstructorCall ? : return val constructedTypeRef = delegatedConstructorCall . constructedTypeRef if ( constructedTypeRef is FirImplicitAnyTypeRef ) return val superClassSymbol = constructedTypeRef . coneType . toRegularClassSymbol ( context . session ) ? : return if ( superClassSymbol . classKind . isSingleton ) return if ( regularClass . isEffectivelyExpect ( containingClass , context ) || regularClass . isEffectivelyExternal ( containingClass , context ) ) { return } val delegatedCallSource = delegatedConstructorCall . source ? : return if ( delegatedCallSource . kind !is KtFakeSourceElementKind ) return val supertypesToSkip = context . session . primaryConstructorSuperTypePlatformSupport . supertypesThatDontNeedInitializationInSubtypesConstructors if ( superClassSymbol . classId in supertypesToSkip ) return if ( delegatedCallSource . elementType != KtNodeTypes . SUPER_TYPE_CALL_ENTRY ) { reporter . reportOn ( constructedTypeRef . source , FirErrors . SUPERTYPE_NOT_INITIALIZED , context ) } }","docstring":"/**\n * SUPERTYPE_NOT_INITIALIZED is reported on code like the following. It's skipped if `A` has `()` after it, in which case any\n * diagnostics for that constructor call will be reported, if applicable.\n *\n * ```\n * open class A\n * class B : A\n * ```\n */"} {"signature":"private fun checkSupertypeInitializedWithoutPrimaryConstructor ( regularClass : FirClass , reporter : DiagnosticReporter , context : CheckerContext )","body":"{ with ( SourceNavigator . forElement ( regularClass ) ) { for ( superTypeRef in regularClass . superTypeRefs ) { if ( superTypeRef . isInConstructorCallee ( ) ) { reporter . reportOn ( regularClass . source , FirErrors . SUPERTYPE_INITIALIZED_WITHOUT_PRIMARY_CONSTRUCTOR , context ) } } } }","docstring":"/**\n * SUPERTYPE_INITIALIZED_WITHOUT_PRIMARY_CONSTRUCTOR is reported on code like the following, where `B` does not have a primary\n * constructor, in which case, one can not call the delegated constructor of `A` in the super type list. `B` doesn't have a primary\n * constructor because it doesn't declare it, nor is it implicitly created in presence of an explicitly declared constructor inside the\n * class body.\n *\n * ```\n * open class A\n * class B : A() {\n * constructor()\n * }\n * ```\n */"} {"signature":"fun assertProcessRunResult ( result : ProcessRunResult , assertions : ProcessRunResult . ( ) -> Unit )","body":"{ try { result . assertions ( ) } catch ( e : AssertionError ) { println ( \"\"\"\"\"\" . trimMargin ( ) ) throw e } }","docstring":"/**\n * Asserts the result of running a process by calling a set of assertions on the result object.\n * If any of the assertions fail, an [AssertionError] is thrown and the process output information is printed.\n *\n * @param result The result of running a process.\n * @param assertions A lambda expression that performs a set of assertions on it.\n *\n * @throws AssertionError If any of the assertions fail.\n */"} {"signature":"abstract fun getContents ( ) : String","body":"abstract fun getContents ( ) : String","docstring":"/**\n * Returns the string contents of this file.\n *\n * The contents must be complete, as if the user themselves wrote it. For Kotlin files,\n * it should return Kotlin source code (including the package and all import statements).\n * For `.md` files, it should return valid Markdown documentation.\n *\n * These contents will be used to populate the real input file to be used by Dokka.\n */"} {"signature":"@ JvmStatic fun getSyntheticMethodNameForAnnotatedProperty ( baseName : String ) : String","body":"{ return baseName + ANNOTATED_PROPERTY_METHOD_NAME_SUFFIX }","docstring":"/**\n * @param baseName JVM name of the property getter since Kotlin 1.4, or Kotlin name of the property otherwise.\n */"} {"signature":"internal fun String . wildcardsToRegex ( ) : String","body":"{ val builder = StringBuilder ( length * ) forEach { char -> when ( char ) { in regexMetacharactersSet -> builder . append ( '' ) . append ( char ) '' -> builder . append ( '' ) . append ( \"\" ) '' -> builder . append ( '' ) '' -> builder . append ( \"\" ) else -> builder . append ( char ) } } return builder . toString ( ) }","docstring":"/**\n * Replaces characters `*` to `.*`, `#` to `[^.]*` and `?` to `.` regexp characters and also add escape char '\\' before regexp metacharacters (see [regexMetacharactersSet]).\n */"} {"signature":"public fun < T > width ( column : ColumnReference < T > ) : NonPositionalMapping < T , Double >","body":"{ return addNonPositionalMapping < T , Double > ( WIDTH , column . name ( ) , null ) }","docstring":"/**\n * Maps the `width` aesthetic to a data column by [ColumnReference].\n *\n * @param column the data column to map to the width.\n * @return a [NonPositionalMapping] object representing the mapping.\n */"} {"signature":"public fun < T > width ( column : KProperty < T > ) : NonPositionalMapping < T , Double >","body":"{ return addNonPositionalMapping < T , Double > ( WIDTH , column . name , null ) }","docstring":"/**\n * Maps the `width` aesthetic to a data column by [KProperty].\n *\n * @param column the data column to map to the width.\n * @return a [NonPositionalMapping] object representing the mapping.\n */"} {"signature":"public fun width ( column : String ) : NonPositionalMapping < Any ? , Double >","body":"{ return addNonPositionalMapping ( WIDTH , column , null ) }","docstring":"/**\n * Maps the `width` aesthetic to a data column by [String].\n *\n * @param column the data column to map to the width.\n * @return a [NonPositionalMapping] object representing the mapping.\n */"} {"signature":"public fun < T > width ( values : Iterable < T > , name : String ? = null ) : NonPositionalMapping < T , Double >","body":"{ return addNonPositionalMapping ( WIDTH , values . toList ( ) , name , null ) }","docstring":"/**\n * Maps the `width` aesthetic to iterable of values.\n *\n * @param values the iterable containing the width values.\n * @param name optional name for this aesthetic mapping.\n * @return a [NonPositionalMapping] object representing the mapping.\n */"} {"signature":"public fun < T > width ( values : DataColumn < T > ) : NonPositionalMapping < T , Double >","body":"{ return addNonPositionalMapping ( WIDTH , values , null ) }","docstring":"/**\n * Maps the `width` aesthetic to a data column.\n *\n * @param values the data column to map to the width.\n * @return a [NonPositionalMapping] object representing the mapping.\n */"} {"signature":"inline fun < reified T : IMessage > dumpCompare ( it : T , alwaysPrint : Boolean = false , protoBuf : BinaryFormat = defaultProtobuf ) : Boolean","body":"{ val msg = it . toProtobufMessage ( ) var parsed : GeneratedMessageV3 ? val c = try { val bytes = protoBuf . encodeToByteArray ( it ) if ( alwaysPrint ) println ( \"\" ) parsed = msg . parserForType . parseFrom ( bytes ) msg == parsed } catch ( e : Exception ) { e . printStackTrace ( ) parsed = null false } if ( ! c || alwaysPrint ) println ( \"\" ) return c }","docstring":"/**\n * Check serialization of [ProtoBuf].\n *\n * 1. Serializes the given [IMessage] into bytes using [ProtoBuf].\n * 2. Parses those bytes via the `Java ProtoBuf library`.\n * 3. Compares parsed `Java ProtoBuf object` to expected object ([IMessage.toProtobufMessage]).\n *\n * @param it The [IMessage] to check.\n * @param protoBuf Provide custom [ProtoBuf] instance (default: [ProtoBuf.plain]).\n *\n * @return `true` if the de-serialization returns the expected object.\n */"} {"signature":"inline fun < reified T : IMessage > readCompare ( it : T , alwaysPrint : Boolean = false , protoBuf : BinaryFormat = defaultProtobuf ) : Boolean","body":"{ var obj : T ? val c = try { val msg = it . toProtobufMessage ( ) val hex = msg . toHex ( ) obj = protoBuf . decodeFromHexString < T > ( hex ) obj == it } catch ( e : Exception ) { obj = null e . printStackTrace ( ) false } if ( ! c || alwaysPrint ) println ( \"\" ) return c }","docstring":"/**\n * Check de-serialization of [ProtoBuf].\n *\n * 1. Converts expected `Java ProtoBuf object` ([IMessage.toProtobufMessage]) to bytes.\n * 2. Parses those bytes via [ProtoBuf].\n * 3. Compares parsed ProtoBuf object to given object.\n *\n * @param it The [IMessage] to check.\n * @param alwaysPrint Set to `true` if expected/found objects should always get printed to console (default: `false`).\n * @param protoBuf Provide custom [ProtoBuf] instance (default: [ProtoBuf.plain]).\n *\n * @return `true` if the de-serialization returns the original object.\n */"} {"signature":"public fun < T > family ( column : ColumnReference < T > , ) : NonPositionalMapping < T , FontFamily >","body":"{ return addNonPositionalMapping < T , FontFamily > ( FONT_FAMILY , column . name ( ) , null ) }","docstring":"/**\n * Maps the `family` aesthetic to a data column by [ColumnReference].\n *\n * @param column the data column to be mapped.\n * @return a [NonPositionalMapping] object representing the mapping.\n */"} {"signature":"public fun < T > family ( column : KProperty < T > , ) : NonPositionalMapping < T , FontFamily >","body":"{ return addNonPositionalMapping < T , FontFamily > ( FONT_FAMILY , column . name , null ) }","docstring":"/**\n * Maps the `family` aesthetic to a data column by [KProperty].\n *\n * @param column the data column to be mapped.\n * @return a [NonPositionalMapping] object representing the mapping.\n */"} {"signature":"public fun family ( column : String , ) : NonPositionalMapping < Any ? , FontFamily >","body":"{ return addNonPositionalMapping < Any ? , FontFamily > ( FONT_FAMILY , column , null ) }","docstring":"/**\n * Maps the `family` aesthetic to a data column by [String].\n *\n * @param column the data column to be mapped.\n * @return a [NonPositionalMapping] object representing the mapping.\n */"} {"signature":"public fun < T > family ( values : Iterable < T > , name : String ? = null , ) : NonPositionalMapping < T , FontFamily >","body":"{ return addNonPositionalMapping < T , FontFamily > ( FONT_FAMILY , values . toList ( ) , name , null ) }","docstring":"/**\n * Maps the `family` aesthetic to the iterable of values.\n *\n * @param values the iterable of values to be mapped.\n * @param name optional name for this aesthetic mapping.\n * @return a [NonPositionalMapping] object representing the mapping.\n */"} {"signature":"public fun < T > family ( values : DataColumn < T > , ) : NonPositionalMapping < T , FontFamily >","body":"{ return addNonPositionalMapping < T , FontFamily > ( FONT_FAMILY , values , null ) }","docstring":"/**\n * Maps the `family` aesthetic to a data column.\n *\n * @param values the data column to be mapped.\n * @return a [NonPositionalMapping] object representing the mapping.\n */"} {"signature":"fun linkerOpts ( vararg options : String )","body":"{ linkerOpts . addAll ( options . toList ( ) ) }","docstring":"/** Additional options passed to the linker by the Kotlin/Native compiler. */"} {"signature":"fun linkerOpts ( options : Iterable < String > )","body":"{ linkerOpts . addAll ( options ) }","docstring":"/** Additional options passed to the linker by the Kotlin/Native compiler. */"} {"signature":"fun entryPoint ( point : String ? )","body":"{ entryPoint = point }","docstring":"/**\n * Set the fully qualified name of the main function. For an example:\n *\n * - \"main\"\n * - \"com.example.main\"\n *\n * The main function can either take no arguments or an Array.\n */"} {"signature":"fun export ( dependency : Any )","body":"{ project . dependencies . add ( exportConfigurationName , dependency ) }","docstring":"/**\n * Add a dependency to be exported in the framework.\n */"} {"signature":"fun export ( dependency : Any , configure : Closure < * > )","body":"{ project . dependencies . add ( exportConfigurationName , dependency , configure ) }","docstring":"/**\n * Add a dependency to be exported in the framework.\n */"} {"signature":"fun export ( dependency : Any , configure : Action < in Dependency > )","body":"{ project . dependencies . add ( exportConfigurationName , dependency ) ? . let { configure . execute ( it ) } }","docstring":"/**\n * Add a dependency to be exported in the framework.\n */"} {"signature":"fun embedBitcode ( mode : org . jetbrains . kotlin . gradle . plugin . mpp . BitcodeEmbeddingMode )","body":"{ embedBitcodeMode . set ( mode ) }","docstring":"/**\n * Enable or disable embedding bitcode for the framework. See [BitcodeEmbeddingMode].\n */"} {"signature":"fun embedBitcode ( mode : String )","body":"= embedBitcode ( org . jetbrains . kotlin . gradle . plugin . mpp . BitcodeEmbeddingMode . valueOf ( mode . toUpperCaseAsciiOnly ( ) ) )","docstring":"/**\n * Enable or disable embedding bitcode for the framework.\n * The parameter [mode] is one of the following string constants:\n *\n * disable - Don't embed LLVM IR bitcode.\n * bitcode - Embed LLVM IR bitcode as data.\n * Has the same effect as the -Xembed-bitcode command line option.\n * marker - Embed placeholder LLVM IR data as a marker.\n * Has the same effect as the -Xembed-bitcode-marker command line option.\n */"} {"signature":"@ JvmName ( \"\" ) operator fun KtNDArray < Byte > . plus ( other : KtNDArray < Byte > ) : KtNDArray < Byte >","body":"= add ( this , other )","docstring":"/**\n * Plus. Returns new [KtNDArray].\n */"} {"signature":"@ JvmName ( \"\" ) operator fun KtNDArray < Byte > . plusAssign ( other : KtNDArray < Byte > )","body":"= plusAssignTwoKtNDArray ( this , other )","docstring":"/**\n * Plus. In-place operation.\n */"} {"signature":"@ JvmName ( \"\" ) operator fun KtNDArray < Byte > . minus ( other : KtNDArray < Byte > ) : KtNDArray < Byte >","body":"= subtract ( this , other )","docstring":"/**\n * Subtract. Returns [KtNDArray].\n */"} {"signature":"@ JvmName ( \"\" ) operator fun KtNDArray < Byte > . minusAssign ( other : KtNDArray < Byte > )","body":"= minusAssignTwoKtNDArray ( this , other )","docstring":"/**\n * Subtract. In-place operation.\n */"} {"signature":"@ JvmName ( \"\" ) operator fun KtNDArray < Byte > . times ( other : KtNDArray < Byte > ) : KtNDArray < Byte >","body":"= multiply ( this , other )","docstring":"/**\n * Multiply. Returns [KtNDArray].\n */"} {"signature":"@ JvmName ( \"\" ) operator fun KtNDArray < Byte > . timesAssign ( other : KtNDArray < Byte > )","body":"= timesAssignTwoKtNDArray ( this , other )","docstring":"/**\n * Multiply. In-place operation.\n */"} {"signature":"@ JvmName ( \"\" ) operator fun < T : Number , T1 : Number , L : KtNDArray < T > , R : KtNDArray < T1 > > L . div ( other : R ) : KtNDArray < Double >","body":"= divide ( this , other )","docstring":"/**\n * Divide. Returns [KtNDArray].\n */"} {"signature":"@ JvmName ( \"\" ) operator fun KtNDArray < Byte > . divAssign ( other : KtNDArray < Byte > )","body":"= divAssignTwoKtNDArray ( this , other )","docstring":"/**\n * Divide. In-place operation.\n */"} {"signature":"inline infix fun < reified T : Number > KtNDArray < T > . `@` ( other : KtNDArray < T > )","body":"= dot ( this , other )","docstring":"/**\n * Alias for [dot].\n */"} {"signature":"infix fun < T : Number > KtNDArray < T > . `**` ( other : Byte ) : KtNDArray < T >","body":"= power ( this , other )","docstring":"/**\n * Pow operator\n */"} {"signature":"private fun BaseKotlinScope . createProjectWithSubModules ( )","body":"{ settingsGradleKts { resolve ( \"\" ) } buildGradleKts { resolve ( \"\" ) } initLocalProperties ( ) dir ( \"\" ) { buildGradleKts { resolve ( \"\" ) } kotlin ( \"\" ) { resolve ( \"\" ) } apiFile ( projectName = \"\" ) { resolve ( \"\" ) } } dir ( \"\" ) { buildGradleKts { resolve ( \"\" ) } java ( \"\" ) { resolve ( \"\" ) } apiFile ( projectName = \"\" ) { resolve ( \"\" ) } } }","docstring":"/**\n * Creates a single project with 2 (Kotlin and Java Android Library) modules, applies\n * the plugin on the root project.\n */"} {"signature":"override fun getName ( ) : String ?","body":"= ( firstChild as? KDocTag ) ? . name","docstring":"/**\n * Returns the name of the section (the name of the doc tag introducing the section,\n * or null for the default section).\n */"} {"signature":"fun encodeConfigValue ( value : ConfigValue )","body":"fun encodeConfigValue ( value : ConfigValue )","docstring":"/**\n * Appends the given [ConfigValue] element to the current output.\n *\n * @param value to insert\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":"@ JvmOverloads public fun seconds ( seconds : Int , cancelOnTimeout : Boolean = false , enableCoroutineCreationStackTraces : Boolean = true ) : CoroutinesTimeout","body":"= seconds ( seconds . toLong ( ) , cancelOnTimeout , enableCoroutineCreationStackTraces )","docstring":"/**\n * Creates [CoroutinesTimeout] rule with the given timeout in seconds.\n */"} {"signature":"@ JvmOverloads public fun seconds ( seconds : Long , cancelOnTimeout : Boolean = false , enableCoroutineCreationStackTraces : Boolean = true ) : CoroutinesTimeout","body":"= CoroutinesTimeout ( TimeUnit . SECONDS . toMillis ( seconds ) , cancelOnTimeout , enableCoroutineCreationStackTraces )","docstring":"/**\n * Creates [CoroutinesTimeout] rule with the given timeout in seconds.\n */"} {"signature":"override fun apply ( base : Statement , description : Description ) : Statement","body":"= CoroutinesTimeoutStatement ( base , description , testTimeoutMs , cancelOnTimeout )","docstring":"/**\n * @suppress suppress from Dokka\n */"} {"signature":"fun nasNetMobilePrediction ( )","body":"{ runImageRecognitionPrediction ( modelType = TFModels . CV . NASNetMobile ) }","docstring":"/**\n * This example demonstrates the inference concept on NasNetMobile 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 NasNetMobile during training on ImageNet dataset) is applied to the images before prediction.\n *\n * NOTE: Input resolution is 224*224\n */"} {"signature":"fun main ( ) : Unit","body":"= nasNetMobilePrediction ( )","docstring":"/** */"} {"signature":"fun < T > Iterable < AcceptanceRule < T > > . accepts ( obj : T ) : Boolean ?","body":"{ return unionAcceptance ( map { it . accepts ( obj ) } ) }","docstring":"/**\n * List of acceptance rules:\n * 1) accepts [obj] if latest not-null acceptance result is `true`\n * 2) doesn't accept [obj] if latest not-null acceptance result is `false`\n * 3) returns `null` if all acceptance results are `null` or the iterable is empty\n */"} {"signature":"private fun determineIfStandaloneTest ( ) : Boolean","body":"= with ( structure ) { if ( directives . contains ( NATIVE_STANDALONE_DIRECTIVE ) ) return true if ( directives . contains ( FILECHECK_STAGE . name ) ) return true if ( directives . contains ( ASSERTIONS_MODE . name ) ) return true if ( isExpectedFailure ) return true if ( directives . contains ( IGNORE_NATIVE . name ) || directives . contains ( IGNORE_NATIVE_K1 . name ) || directives . contains ( IGNORE_NATIVE_K2 . name ) ) return true if ( pipelineType != PipelineType . K1 && testDataFileSettings . languageSettings . contains ( \"\" ) ) return true var isStandaloneTest = false filesToTransform . forEach { handler -> handler . accept ( object : KtTreeVisitorVoid ( ) { override fun visitKtFile ( file : KtFile ) = when { isStandaloneTest -> Unit file . packageFqName . startsWith ( StandardNames . BUILT_INS_PACKAGE_NAME ) -> { isStandaloneTest = true } else -> super . visitKtFile ( file ) } } ) } isStandaloneTest }","docstring":"/**\n * Determine if the current test should be compiled as a standalone test, i.e.\n * - package names are not patched\n * - test is compiled independently of any other tests\n */"} {"signature":"private fun patchPackageNames ( isStandaloneTest : Boolean )","body":"= with ( structure ) { if ( isStandaloneTest ) return val basePackageName = FqName ( testDataFileSettings . nominalPackageName . toString ( ) ) val oldPackageNames : Set < FqName > = filesToTransform . mapToSet { it . packageFqName } val oldToNewPackageNameMapping : Map < FqName , FqName > = oldPackageNames . associateWith { oldPackageName -> basePackageName . child ( oldPackageName ) } filesToTransform . forEach { handler -> handler . accept ( object : KtVisitor < Unit , Set < Name > > ( ) { override fun visitKtElement ( element : KtElement , parentAccessibleDeclarationNames : Set < Name > ) { element . getChildrenOfType < KtElement > ( ) . forEach { child -> child . accept ( this , parentAccessibleDeclarationNames ) } } override fun visitKtFile ( file : KtFile , unused : Set < Name > ) { val oldPackageDirective = file . packageDirective val oldPackageName = oldPackageDirective ? . fqName ? : FqName . ROOT val newPackageName = oldToNewPackageNameMapping . getValue ( file . packageFqNameForKLib ) val newPackageDirective = handler . psiFactory . createPackageDirective ( newPackageName ) if ( oldPackageDirective != null ) { oldPackageDirective . replace ( newPackageDirective ) . ensureSurroundedByNewLines ( ) } else { file . addAfter ( newPackageDirective , file . fileAnnotationList ) . ensureSurroundedByNewLines ( ) } if ( ! file . name . endsWith ( \"\" ) ) { val annotationText = \"\" val fileAnnotationList = handler . psiFactory . createFileAnnotationListWithAnnotation ( annotationText ) file . addAnnotations ( fileAnnotationList ) visitKtElement ( file , file . collectAccessibleDeclarationNames ( ) ) } } override fun visitPackageDirective ( directive : KtPackageDirective , unused : Set < Name > ) = Unit override fun visitImportDirective ( importDirective : KtImportDirective , unused : Set < Name > ) { val importedFqName = importDirective . importedFqName if ( importedFqName == null || importedFqName . startsWith ( StandardNames . BUILT_INS_PACKAGE_NAME ) || importedFqName . startsWith ( KOTLINX_PACKAGE_NAME ) || importedFqName . startsWith ( HELPERS_PACKAGE_NAME ) || importedFqName . startsWith ( CNAMES_PACKAGE_NAME ) || importedFqName . startsWith ( OBJCNAMES_PACKAGE_NAME ) || importedFqName . startsWith ( PLATFORM_PACKAGE_NAME ) ) { return } val newImportPath = ImportPath ( fqName = basePackageName . child ( importedFqName ) , isAllUnder = importDirective . isAllUnder , alias = importDirective . aliasName ? . let ( Name :: identifier ) ) importDirective . replace ( handler . psiFactory . createImportDirective ( newImportPath ) ) } override fun visitTypeAlias ( typeAlias : KtTypeAlias , parentAccessibleDeclarationNames : Set < Name > ) = super . visitTypeAlias ( typeAlias , parentAccessibleDeclarationNames + typeAlias . collectAccessibleDeclarationNames ( ) ) override fun visitClassOrObject ( classOrObject : KtClassOrObject , parentAccessibleDeclarationNames : Set < Name > ) = super . visitClassOrObject ( classOrObject , parentAccessibleDeclarationNames + classOrObject . collectAccessibleDeclarationNames ( ) ) override fun visitClassBody ( classBody : KtClassBody , parentAccessibleDeclarationNames : Set < Name > ) = super . visitClassBody ( classBody , parentAccessibleDeclarationNames + classBody . collectAccessibleDeclarationNames ( ) ) override fun visitPropertyAccessor ( accessor : KtPropertyAccessor , parentAccessibleDeclarationNames : Set < Name > ) = transformDeclarationWithBody ( accessor , parentAccessibleDeclarationNames ) override fun visitNamedFunction ( function : KtNamedFunction , parentAccessibleDeclarationNames : Set < Name > ) = transformDeclarationWithBody ( function , parentAccessibleDeclarationNames ) override fun visitPrimaryConstructor ( constructor : KtPrimaryConstructor , parentAccessibleDeclarationNames : Set < Name > ) = transformDeclarationWithBody ( constructor , parentAccessibleDeclarationNames ) override fun visitSecondaryConstructor ( constructor : KtSecondaryConstructor , parentAccessibleDeclarationNames : Set < Name > ) = transformDeclarationWithBody ( constructor , parentAccessibleDeclarationNames ) private fun transformDeclarationWithBody ( declarationWithBody : KtDeclarationWithBody , parentAccessibleDeclarationNames : Set < Name > ) { val ( expressions , nonExpressions ) = declarationWithBody . getChildrenOfType < KtElement > ( ) . partition { it is KtExpression } val accessibleDeclarationNames = parentAccessibleDeclarationNames + declarationWithBody . collectAccessibleDeclarationNames ( ) nonExpressions . forEach { it . accept ( this , accessibleDeclarationNames ) } val bodyAccessibleDeclarationNames = accessibleDeclarationNames + declarationWithBody . valueParameters . map { it . nameAsSafeName } expressions . forEach { it . accept ( this , bodyAccessibleDeclarationNames ) } } override fun visitExpression ( expression : KtExpression , parentAccessibleDeclarationNames : Set < Name > ) = if ( expression is KtFunctionLiteral ) transformDeclarationWithBody ( expression , parentAccessibleDeclarationNames ) else super . visitExpression ( expression , parentAccessibleDeclarationNames ) override fun visitBlockExpression ( expression : KtBlockExpression , parentAccessibleDeclarationNames : Set < Name > ) { val accessibleDeclarationNames = parentAccessibleDeclarationNames . toMutableSet ( ) expression . getChildrenOfType < KtElement > ( ) . forEach { child -> child . accept ( this , accessibleDeclarationNames ) accessibleDeclarationNames . addIfNotNull ( child . name ? . let ( Name :: identifier ) ) } } override fun visitDotQualifiedExpression ( dotQualifiedExpression : KtDotQualifiedExpression , accessibleDeclarationNames : Set < Name > ) { val names = dotQualifiedExpression . collectNames ( ) val newDotQualifiedExpression = visitPossiblyTypeReferenceWithFullyQualifiedName ( names , accessibleDeclarationNames ) { newPackageName -> val newDotQualifiedExpression = handler . psiFactory . createFile ( \"\" ) . getChildOfType < KtProperty > ( ) ! ! . getChildOfType < KtDotQualifiedExpression > ( ) ! ! dotQualifiedExpression . replace ( newDotQualifiedExpression ) as KtDotQualifiedExpression } ? : dotQualifiedExpression super . visitDotQualifiedExpression ( newDotQualifiedExpression , accessibleDeclarationNames ) } override fun visitUserType ( userType : KtUserType , accessibleDeclarationNames : Set < Name > ) { val names = userType . collectNames ( ) val newUserType = visitPossiblyTypeReferenceWithFullyQualifiedName ( names , accessibleDeclarationNames ) { newPackageName -> val newUserType = handler . psiFactory . createFile ( \"\" ) . getChildOfType < KtProperty > ( ) ! ! . getChildOfType < KtTypeReference > ( ) ! ! . typeElement as KtUserType userType . replace ( newUserType ) as KtUserType } ? : userType newUserType . typeArgumentList ? . let { visitKtElement ( it , accessibleDeclarationNames ) } } private fun < T : KtElement > visitPossiblyTypeReferenceWithFullyQualifiedName ( names : List < Name > , accessibleDeclarationNames : Set < Name > , action : ( newSubPackageName : FqName ) -> T ) : T ? { if ( names . size < ) return null if ( names . first ( ) in accessibleDeclarationNames ) return null for ( index in until names . size ) { val subPackageName = names . fqNameBeforeIndex ( index ) val newPackageName = oldToNewPackageNameMapping [ subPackageName ] if ( newPackageName != null ) return action ( newPackageName . removeSuffix ( subPackageName ) ) } return null } } , emptySet ( ) ) } }","docstring":"/**\n * For every Kotlin file (*.kt) stored in this text:\n *\n * - If there is a \"package\" declaration, patch it to prepend unique package prefix.\n * Example: package foo -> package codegen.box.annotations.genericAnnotations.foo\n *\n * - If there is no \"package\" declaration, add one with the package name equal to unique package prefix.\n * Example (new line added): package codegen.box.annotations.genericAnnotations\n *\n * - All \"import\" declarations are patched to reflect appropriate changes in \"package\" declarations.\n * Example: import foo.* -> import codegen.box.annotations.genericAnnotations.foo.*\n *\n * - All fully-qualified references are patched to reflect appropriate changes in \"package\" declarations.\n * Example: val x = foo.Bar() -> val x = codegen.box.annotations.genericAnnotations.foo.Bar()\n *\n * The \"unique package prefix\" is computed individually for every test file and reflects relative path to the test file.\n * Example: codegen/box/annotations/genericAnnotations.kt -> codegen.box.annotations.genericAnnotations\n *\n * Note that packages with fully-qualified name starting with \"kotlin.\" and \"helpers.\" are kept unchanged.\n * Examples: package kotlin.coroutines -> package kotlin.coroutines\n * import kotlin.test.* -> import kotlin.test.*\n */"} {"signature":"private fun patchFileLevelAnnotations ( )","body":"= with ( structure ) { fun getAnnotationText ( fullyQualifiedName : String ) = \"\" if ( testDataFileSettings . optInsForSourceCode . isNotEmpty ( ) ) { filesToTransform . forEach { handler -> handler . accept ( object : KtTreeVisitorVoid ( ) { override fun visitKtFile ( file : KtFile ) { val newFileAnnotationList = handler . psiFactory . createFile ( buildString { testDataFileSettings . optInsForSourceCode . forEach { appendLine ( getAnnotationText ( it ) ) } } ) . fileAnnotationList ! ! file . addAnnotations ( newFileAnnotationList ) } } ) } } }","docstring":"/**\n * Make sure that the OptIns specified in test directives (see [ExtTestDataFileSettings.optInsForSourceCode]) are represented\n * as file-level annotations in every individual test file.\n */"} {"signature":"private fun findEntryPoint ( ) : String","body":"= with ( structure ) { val result = mutableListOf < String > ( ) filesToTransform . forEach { handler -> handler . accept ( object : KtTreeVisitorVoid ( ) { override fun visitKtFile ( file : KtFile ) { val hasBoxFunction = file . getChildrenOfType < KtNamedFunction > ( ) . any { function -> function . name == BOX_FUNCTION_NAME . asString ( ) && function . valueParameters . isEmpty ( ) } if ( hasBoxFunction ) { val boxFunctionFqName = file . packageFqName . child ( BOX_FUNCTION_NAME ) . asString ( ) result += boxFunctionFqName handler . module . markAsMain ( ) } } } ) } return result . singleOrNull ( ) ? : fail { \"\" + \"\" } }","docstring":"/** Finds the fully-qualified name of the entry point function (aka `fun box(): String`). */"} {"signature":"private fun generateTestLauncher ( isStandaloneTest : Boolean , entryPointFunctionFQN : String )","body":"{ val fileText = buildString { if ( ! isStandaloneTest ) { append ( \"\" ) . appendLine ( testDataFileSettings . nominalPackageName ) appendLine ( ) } append ( generateBoxFunctionLauncher ( entryPointFunctionFQN ) ) } structure . addFileToMainModule ( fileName = LAUNCHER_FILE_NAME , text = fileText ) }","docstring":"/** Adds a wrapper to run it as Kotlin test. */"} {"signature":"open fun processNextEvent ( ) : Long","body":"{ if ( ! processUnconfinedEvent ( ) ) return Long . MAX_VALUE return }","docstring":"/**\n * Processes next event in this event loop.\n *\n * The result of this function is to be interpreted like this:\n * - `<= 0` -- there are potentially more events for immediate processing;\n * - `> 0` -- a number of nanoseconds to wait for next scheduled event;\n * - [Long.MAX_VALUE] -- no more events.\n *\n * **NOTE**: Must be invoked only from the event loop's thread\n * (no check for performance reasons, may be added in the future).\n */"} {"signature":"open fun shouldBeProcessedFromContext ( ) : Boolean","body":"= false","docstring":"/**\n * Returns `true` if the invoking `runBlocking(context) { ... }` that was passed this event loop in its context\n * parameter should call [processNextEvent] for this event loop (otherwise, it will process thread-local one).\n * By default, event loop implementation is thread-local and should not processed in the context\n * (current thread's event loop should be processed instead).\n */"} {"signature":"fun dispatchUnconfined ( task : DispatchedTask < * > )","body":"{ val queue = unconfinedQueue ? : ArrayDeque < DispatchedTask < * > > ( ) . also { unconfinedQueue = it } queue . addLast ( task ) }","docstring":"/**\n * Dispatches task whose dispatcher returned `false` from [CoroutineDispatcher.isDispatchNeeded]\n * into the current event loop.\n */"} {"signature":"internal expect inline fun platformAutoreleasePool ( crossinline block : ( ) -> Unit )","body":"internal expect inline fun platformAutoreleasePool ( crossinline block : ( ) -> Unit )","docstring":"/**\n * Used by Darwin targets to wrap a [Runnable.run] call in an Objective-C Autorelease Pool. It is a no-op on JVM, JS and\n * non-Darwin native targets.\n *\n * Coroutines on Darwin targets can call into the Objective-C world, where a callee may push a to-be-returned object to\n * the Autorelease Pool, so as to avoid a premature ARC release before it reaches the caller. This means the pool must\n * be eventually drained to avoid leaks. Since Kotlin Coroutines does not use [NSRunLoop], which provides automatic\n * pool management, it must manage the pool creation and pool drainage manually.\n */"} {"signature":"public fun createDummyLogger ( ) : SwiftExportLogger","body":"= object : SwiftExportLogger { override fun report ( severity : SwiftExportLogger . Severity , message : String ) { println ( \"\" ) } }","docstring":"/**\n * Primitive implementation of [SwiftExportLogger] which should be sufficient for testing purposes.\n */"} {"signature":"public fun runSwiftExport ( input : InputModule , config : SwiftExportConfig = SwiftExportConfig ( ) , output : SwiftExportOutput , )","body":"{ val stableDeclarationsOrder = config . settings . containsKey ( STABLE_DECLARATIONS_ORDER ) val renderDocComments = config . settings [ RENDER_DOC_COMMENTS ] != \"\" val bridgeModuleName = config . settings . getOrElse ( BRIDGE_MODULE_NAME ) { config . logger . report ( SwiftExportLogger . Severity . Warning , \"\" ) DEFAULT_BRIDGE_MODULE_NAME } val module = buildSwiftModule ( input , config . distribution , bridgeModuleName = bridgeModuleName ) val bridgeRequests = module . buildFunctionBridges ( ) module . dumpResultToFiles ( bridgeRequests , output , stableDeclarationsOrder = stableDeclarationsOrder , renderDocComments = renderDocComments ) }","docstring":"/**\n * A root function for running Swift Export from build tool\n */"} {"signature":"abstract fun intercept ( callInfo : CallInfo , symbol : FirNamedFunctionSymbol ) : CallReturnType ?","body":"abstract fun intercept ( callInfo : CallInfo , symbol : FirNamedFunctionSymbol ) : CallReturnType ?","docstring":"/**\n * Allows a call to be completed with a more specific type than the declared return type of function\n * ```\n * interface Container { }\n * fun Container.add(item: String): Container\n * ```\n * at call site `Container` can be modified to become `Container`\n * ```\n * container.add(\"A\")\n * ```\n * this `NewLocalType` can be created in [intercept]. It must be later saved into FIR tree in [transform]\n * Generated declarations should be local because this [FirExtension] works at body resolve stage and thus cannot create new top level declarations\n *\n * When [intercept] returns non-null value, a copy will be created from FirFunction that [symbol]\n * points to. Copy will be used in call completion instead of original function.\n *\n * @return null if plugin is not interested in a [symbol]\n */"} {"signature":"abstract fun transform ( call : FirFunctionCall , originalSymbol : FirNamedFunctionSymbol ) : FirFunctionCall","body":"abstract fun transform ( call : FirFunctionCall , originalSymbol : FirNamedFunctionSymbol ) : FirFunctionCall","docstring":"/**\n * @param call to a function that was created with modified [FirResolvedTypeRef] as a result of [intercept].\n * This function doesn't exist in FIR, it is needed to complete the call.\n * @param originalSymbol [intercept] is called with symbol to a declaration that exists somewhere in FIR: library, project code.\n * The same symbol is [originalSymbol].\n * [transform] needs to generate call to [let] with the same return type as [call]\n * and put all generated declarations used in [FirResolvedTypeRef] in statements.\n */"} {"signature":"fun PropertyDescriptor . toAccessorBaseName ( config : Accessors ) : String ?","body":"{ val isPrimitiveBoolean = type . isPrimitiveBoolean ( ) return if ( config . prefix . isEmpty ( ) ) { val prefixes = if ( isPrimitiveBoolean ) listOf ( AccessorNames . IS ) else emptyList ( ) toPropertyName ( name . identifier , prefixes ) } else { val id = name . identifier val name = toPropertyName ( id , config . prefix ) name . takeIf { it . length != id . length } } }","docstring":"/**\n * Make property name from variable name\n * Returns null in case getter/setter shouldn't be generated at all\n */"} {"signature":"fun analyzeSpecialSerializers ( moduleDescriptor : ModuleDescriptor , annotations : Annotations ) : ClassDescriptor ?","body":"= when { annotations . hasAnnotation ( SerializationAnnotations . contextualFqName ) || annotations . hasAnnotation ( SerializationAnnotations . contextualOnPropertyFqName ) -> moduleDescriptor . getClassFromSerializationPackage ( SpecialBuiltins . contextSerializer ) annotations . hasAnnotation ( SerializationAnnotations . polymorphicFqName ) -> moduleDescriptor . getClassFromSerializationPackage ( SpecialBuiltins . polymorphicSerializer ) else -> null }","docstring":"/**\n * Returns class descriptor for ContextSerializer or PolymorphicSerializer\n * if [annotations] contains @Contextual or @Polymorphic annotation\n */"} {"signature":"fun report ( filePath : String , importedFqName : String )","body":"fun report ( filePath : String , importedFqName : String )","docstring":"/**\n * Report import directives, where FqName is [importedFqName].\n * Format of [importedFqName] class is \"package.Outer.Inner\"\n */"} {"signature":"@ Test fun testProcessNextEventInCurrentThreadSimple ( )","body":"= runTest { expect ( ) val event = EventSync ( ) launch { expect ( ) event . fireEvent ( ) } expect ( ) event . blockingAwait ( ) finish ( ) }","docstring":"/**\n * Simple test for [processNextEventInCurrentThread] API use-case.\n */"} {"signature":"@ Test fun testProcessNextEventInCurrentThreadDelay ( )","body":"= runTest { expect ( ) val event = EventSync ( ) launch { expect ( ) delay ( ) event . fireEvent ( ) } expect ( ) event . blockingAwait ( ) finish ( ) }","docstring":"/**\n * Test for [processNextEventInCurrentThread] API use-case with delay.\n */"} {"signature":"public operator fun get ( index : Int ) : T","body":"public operator fun get ( index : Int ) : T","docstring":"/**\n * Returns the value at [index].\n *\n * Note: Indexing takes place according to the initial data, so if you did any manipulations with the ndarray\n * (ex. reshape), then `get` from the ndarray with the same index will return another value.\n */"} {"signature":"public override fun iterator ( ) : Iterator < T >","body":"public override fun iterator ( ) : Iterator < T >","docstring":"/**\n * [data] iterator\n */"} {"signature":"public fun copyOf ( ) : ImmutableMemoryView < T >","body":"public fun copyOf ( ) : ImmutableMemoryView < T >","docstring":"/**\n * Returns a new instance with a copied primitive array.\n */"} {"signature":"public fun copyInto ( destination : MemoryView < T > , destinationOffset : Int = , startIndex : Int = , endIndex : Int = size ) : MemoryView < T >","body":"public fun copyInto ( destination : MemoryView < T > , destinationOffset : Int = , startIndex : Int = , endIndex : Int = size ) : MemoryView < T >","docstring":"/**\n *\n */"} {"signature":"public fun getByteArray ( ) : ByteArray","body":"public fun getByteArray ( ) : ByteArray","docstring":"/**\n * Returns [ByteArray] if it is [MemoryViewByteArray].\n */"} {"signature":"public fun getShortArray ( ) : ShortArray","body":"public fun getShortArray ( ) : ShortArray","docstring":"/**\n * Returns [ShortArray] if it is [MemoryViewShortArray].\n */"} {"signature":"public fun getIntArray ( ) : IntArray","body":"public fun getIntArray ( ) : IntArray","docstring":"/**\n * Returns [IntArray] if it is [MemoryViewIntArray].\n */"} {"signature":"public fun getLongArray ( ) : LongArray","body":"public fun getLongArray ( ) : LongArray","docstring":"/**\n * Returns [LongArray] if it is [MemoryViewLongArray].\n */"} {"signature":"public fun getFloatArray ( ) : FloatArray","body":"public fun getFloatArray ( ) : FloatArray","docstring":"/**\n * Returns [FloatArray] if it is [MemoryViewFloatArray].\n *\n * Note: For [MemoryViewComplexFloatArray], an array will be returned storing real and imaginary parts continuously.\n */"} {"signature":"public fun getDoubleArray ( ) : DoubleArray","body":"public fun getDoubleArray ( ) : DoubleArray","docstring":"/**\n * Returns [DoubleArray].\n *\n * Note: For [MemoryViewComplexDoubleArray], an array will be returned storing real and imaginary parts continuously.\n */"} {"signature":"public fun getComplexFloatArray ( ) : ComplexFloatArray","body":"public fun getComplexFloatArray ( ) : ComplexFloatArray","docstring":"/**\n * Returns [ComplexFloatArray] if it is [MemoryViewFloatArray].\n */"} {"signature":"public fun getComplexDoubleArray ( ) : ComplexDoubleArray","body":"public fun getComplexDoubleArray ( ) : ComplexDoubleArray","docstring":"/**\n * Returns [ComplexDoubleArray] if it is [MemoryViewComplexDoubleArray].\n */"} {"signature":"public abstract operator fun set ( index : Int , value : T )","body":"public abstract operator fun set ( index : Int , value : T )","docstring":"/**\n * Replaces the element at the given [index] with the specified [value].\n *\n * Note: Indexing takes place according to the initial data.\n */"} {"signature":"public fun < T > initMemoryView ( size : Int , dataType : DataType ) : MemoryView < T >","body":"{ val t = when ( dataType ) { DataType . ByteDataType -> MemoryViewByteArray ( ByteArray ( size ) ) DataType . ShortDataType -> MemoryViewShortArray ( ShortArray ( size ) ) DataType . IntDataType -> MemoryViewIntArray ( IntArray ( size ) ) DataType . LongDataType -> MemoryViewLongArray ( LongArray ( size ) ) DataType . FloatDataType -> MemoryViewFloatArray ( FloatArray ( size ) ) DataType . DoubleDataType -> MemoryViewDoubleArray ( DoubleArray ( size ) ) DataType . ComplexFloatDataType -> MemoryViewComplexFloatArray ( ComplexFloatArray ( size ) ) DataType . ComplexDoubleDataType -> MemoryViewComplexDoubleArray ( ComplexDoubleArray ( size ) ) } @ Suppress ( \"\" ) return t as MemoryView < T > }","docstring":"/**\n * Creates a [MemoryView] based [size] and [dataType].\n */"} {"signature":"@ Suppress ( \"\" ) public fun < T > initMemoryView ( size : Int , dataType : DataType , init : ( Int ) -> T ) : MemoryView < T >","body":"{ val t = when ( dataType ) { DataType . ByteDataType -> MemoryViewByteArray ( ByteArray ( size , init as ( Int ) -> Byte ) ) DataType . ShortDataType -> MemoryViewShortArray ( ShortArray ( size , init as ( Int ) -> Short ) ) DataType . IntDataType -> MemoryViewIntArray ( IntArray ( size , init as ( Int ) -> Int ) ) DataType . LongDataType -> MemoryViewLongArray ( LongArray ( size , init as ( Int ) -> Long ) ) DataType . FloatDataType -> MemoryViewFloatArray ( FloatArray ( size , init as ( Int ) -> Float ) ) DataType . DoubleDataType -> MemoryViewDoubleArray ( DoubleArray ( size , init as ( Int ) -> Double ) ) DataType . ComplexFloatDataType -> MemoryViewComplexFloatArray ( ComplexFloatArray ( size , init as ( Int ) -> ComplexFloat ) ) DataType . ComplexDoubleDataType -> MemoryViewComplexDoubleArray ( ComplexDoubleArray ( size , init as ( Int ) -> ComplexDouble ) ) } return t as MemoryView < T > }","docstring":"/**\n * Create a [MemoryView] based [size] and [dataType], where each elements will be initialized according\n * to the given [init] function.\n */"} {"signature":"public operator fun < T > Set < T > . minus ( element : T ) : Set < T >","body":"{ val result = LinkedHashSet < T > ( mapCapacity ( size ) ) var removed = false return this . filterTo ( result ) { if ( ! removed && it == element ) { removed = true ; false } else true } }","docstring":"/**\n * Returns a set containing all elements of the original set except the given [element].\n * \n * The returned set preserves the element iteration order of the original set.\n */"} {"signature":"public operator fun < T > Set < T > . minus ( elements : Array < out T > ) : Set < T >","body":"{ val result = LinkedHashSet < T > ( this ) result . removeAll ( elements ) return result }","docstring":"/**\n * Returns a set containing all elements of the original set except the elements contained in the given [elements] array.\n * \n * The returned set preserves the element iteration order of the original set.\n */"} {"signature":"public operator fun < T > Set < T > . minus ( elements : Iterable < T > ) : Set < T >","body":"{ val other = elements . convertToListIfNotCollection ( ) if ( other . isEmpty ( ) ) return this . toSet ( ) if ( other is Set ) return this . filterNotTo ( LinkedHashSet < T > ( ) ) { it in other } val result = LinkedHashSet < T > ( this ) result . removeAll ( other ) return result }","docstring":"/**\n * Returns a set containing all elements of the original set except the elements contained in the given [elements] collection.\n * \n * The returned set preserves the element iteration order of the original set.\n */"} {"signature":"public operator fun < T > Set < T > . minus ( elements : Sequence < T > ) : Set < T >","body":"{ val result = LinkedHashSet < T > ( this ) result . removeAll ( elements ) return result }","docstring":"/**\n * Returns a set containing all elements of the original set except the elements contained in the given [elements] sequence.\n * \n * The returned set preserves the element iteration order of the original set.\n */"} {"signature":"@ kotlin . internal . InlineOnly public inline fun < T > Set < T > . minusElement ( element : T ) : Set < T >","body":"{ return minus ( element ) }","docstring":"/**\n * Returns a set containing all elements of the original set except the given [element].\n * \n * The returned set preserves the element iteration order of the original set.\n */"} {"signature":"public operator fun < T > Set < T > . plus ( element : T ) : Set < T >","body":"{ val result = LinkedHashSet < T > ( mapCapacity ( size + ) ) result . addAll ( this ) result . add ( element ) return result }","docstring":"/**\n * Returns a set containing all elements of the original set and then the given [element] if it isn't already in this set.\n * \n * The returned set preserves the element iteration order of the original set.\n */"} {"signature":"public operator fun < T > Set < T > . plus ( elements : Array < out T > ) : Set < T >","body":"{ val result = LinkedHashSet < T > ( mapCapacity ( this . size + elements . size ) ) result . addAll ( this ) result . addAll ( elements ) return result }","docstring":"/**\n * Returns a set containing all elements of the original set and the given [elements] array,\n * which aren't already in this set.\n * \n * The returned set preserves the element iteration order of the original set.\n */"} {"signature":"public operator fun < T > Set < T > . plus ( elements : Iterable < T > ) : Set < T >","body":"{ val result = LinkedHashSet < T > ( mapCapacity ( elements . collectionSizeOrNull ( ) ? . let { this . size + it } ? : this . size * ) ) result . addAll ( this ) result . addAll ( elements ) return result }","docstring":"/**\n * Returns a set containing all elements of the original set and the given [elements] collection,\n * which aren't already in this set.\n * The returned set preserves the element iteration order of the original set.\n */"} {"signature":"public operator fun < T > Set < T > . plus ( elements : Sequence < T > ) : Set < T >","body":"{ val result = LinkedHashSet < T > ( mapCapacity ( this . size * ) ) result . addAll ( this ) result . addAll ( elements ) return result }","docstring":"/**\n * Returns a set containing all elements of the original set and the given [elements] sequence,\n * which aren't already in this set.\n * \n * The returned set preserves the element iteration order of the original set.\n */"} {"signature":"@ kotlin . internal . InlineOnly public inline fun < T > Set < T > . plusElement ( element : T ) : Set < T >","body":"{ return plus ( element ) }","docstring":"/**\n * Returns a set containing all elements of the original set and then the given [element] if it isn't already in this set.\n * \n * The returned set preserves the element iteration order of the original set.\n */"} {"signature":"public fun store ( dri : DRI ) : String","body":"{ val id = dri . toString ( ) driMap [ id ] = dri return id }","docstring":"/**\n * @return key of the stored DRI\n */"} {"signature":"public fun store ( documentationNode : DocumentationNode ) : String","body":"{ val id = UUID . randomUUID ( ) . toString ( ) inheritDocSections [ id ] = documentationNode return id }","docstring":"/**\n * @return key of the stored documentation node\n */"} {"signature":"@ Test fun testMainIsJavaFx ( )","body":"{ assertSame ( Dispatchers . JavaFx , Dispatchers . Main ) }","docstring":"/** Tests that the Main dispatcher is in fact the JavaFx one. */"} {"signature":"fun linearRegression ( )","body":"{ val rnd = Random ( SEED ) val data = Array ( ) { doubleArrayOf ( , , , , ) } for ( i in data . indices ) { data [ i ] [ ] = * ( rnd . nextDouble ( ) - ) data [ i ] [ ] = * ( rnd . nextDouble ( ) - ) data [ i ] [ ] = * ( rnd . nextDouble ( ) - ) data [ i ] [ ] = * ( rnd . nextDouble ( ) - ) data [ i ] [ ] = data [ i ] [ ] - * data [ i ] [ ] + * data [ i ] [ ] - * data [ i ] [ ] + rnd . nextDouble ( ) } data . shuffle ( ) fun extractX ( ) : Array < FloatArray > { val init : ( index : Int ) -> FloatArray = { index -> floatArrayOf ( data [ index ] [ ] . toFloat ( ) , data [ index ] [ ] . toFloat ( ) , data [ index ] [ ] . toFloat ( ) , data [ index ] [ ] . toFloat ( ) ) } return Array ( data . size , init = init ) } fun extractY ( ) : FloatArray { val labels = FloatArray ( data . size ) { } for ( i in labels . indices ) { labels [ i ] = data [ i ] [ ] . toFloat ( ) } return labels } val dataset = OnHeapDataset . create ( extractX ( ) , extractY ( ) ) val ( train , test ) = dataset . split ( ) model . use { it . compile ( optimizer = Adam ( ) , loss = Losses . MSE , metric = Metrics . MAE ) it . logSummary ( ) it . fit ( dataset = train , epochs = EPOCHS , batchSize = TRAINING_BATCH_SIZE ) repeat ( ) { id -> val xReal = test . getX ( id ) val yReal = test . getY ( id ) val yPred = it . predictSoftly ( xReal ) println ( \"\" ) } val mae = it . evaluate ( dataset = test , batchSize = TEST_BATCH_SIZE ) . metrics [ Metrics . MAE ] println ( \"\" + it . getLayer ( \"\" ) . weights [ \"\" ] . contentDeepToString ( ) ) println ( \"\" + it . getLayer ( \"\" ) . weights [ \"\" ] . contentDeepToString ( ) ) println ( \"\" ) repeat ( ) { id -> val xReal = test . getX ( id ) val yReal = test . getY ( id ) val yPred = it . predictSoftly ( xReal ) println ( \"\" ) } } }","docstring":"/**\n * This example shows how to do regression from scratch, starting from generated dataset, using simple Dense-based [model] with 1 neuron.\n *\n * It includes:\n * - dataset creation\n * - dataset splitting\n * - model compilation\n * - model training\n * - model evaluation\n * - model weights printing\n */"} {"signature":"fun main ( ) : Unit","body":"= linearRegression ( )","docstring":"/** */"} {"signature":"abstract fun perform ( affected : Any ? ) : Any ?","body":"abstract fun perform ( affected : Any ? ) : Any ?","docstring":"/**\n * Returns `null` is operation was performed successfully or some other\n * object that indicates the failure reason.\n */"} {"signature":"fun getSingleTestRun ( testCaseId : TestCaseId , settings : Settings ) : TestRun","body":"= withTestExecutable ( testCaseId , settings ) { testCase , executable -> createSingleTestRun ( testCase , executable ) }","docstring":"/**\n * Produces a single [TestRun] per [TestCase]. So-called \"one test case/one test run\" mode.\n *\n * If [TestCase] contains multiple functions annotated with [kotlin.test.Test], then all these functions will be executed\n * in one shot. If either function fails, the whole JUnit test will be considered as failed.\n *\n * Example:\n * ```\n * //+++ testData file (foo.kt): +++//\n * @kotlin.test.Test\n * fun one() { /* ... */ }\n *\n * @kotlin.test.Test\n * fun two() { /* ... */ }\n *\n * //+++ generated JUnit test suite: +++//\n * public class MyTestSuiteGenerated {\n * @org.junit.jupiter.api.Test\n * @org.jetbrains.kotlin.test.TestMetadata(\"foo.kt\")\n * public void testFoo() {\n * // Compiles foo.kt with test-runner, probably together with other testData files (bar.kt, qux.kt, ...).\n * // Then executes FooKt.one() and FooKt.two() test functions one after another in one shot.\n * // If either of test functions fails, the whole \"testFoo()\" JUnit test is marked as failed.\n * }\n * }\n * ```\n */"} {"signature":"fun getTestRuns ( testCaseId : TestCaseId , settings : Settings ) : Collection < TreeNode < TestRun > >","body":"= withTestExecutable ( testCaseId , settings ) { testCase , executable -> fun createTestRun ( testRunName : String , testName : TestName ? ) = createTestRun ( testCase , executable , testRunName , testName ) when ( testCase . kind ) { TestKind . STANDALONE_NO_TR , TestKind . STANDALONE_LLDB -> { val testRunName = ( testCase . extras < NoTestRunnerExtras > ( ) . entryPoint ? : \"\" ) . substringAfterLast ( '' ) val testRun = createTestRun ( testRunName , testName = null ) TreeNode . oneLevel ( testRun ) } TestKind . REGULAR , TestKind . STANDALONE -> { val testNames = executable . testNames . filterIrrelevant ( testCase ) testNames . buildTree ( TestName :: packageName ) { testName -> createTestRun ( testName . functionName , testName ) } } } }","docstring":"/**\n * Produces at least one [TestRun] per [TestCase]. So-called \"one test function/one test run\" mode.\n *\n * If [TestCase] contains multiple functions annotated with [kotlin.test.Test], then a separate [TestRun] will be produced\n * for each such function.\n *\n * This allows having a better granularity in tests. So that every test method inside [TestCase] will be considered\n * as an individual JUnit test, and will be presented as a separate row in JUnit test report.\n *\n * Example:\n * ```\n * //+++ testData file (foo.kt): +++//\n * @kotlin.test.Test\n * fun one() { /* ... */ }\n *\n * @kotlin.test.Test\n * fun two() { /* ... */ }\n *\n * //+++ generated JUnit test suite: +++//\n * public class MyTestSuiteGenerated {\n * @org.junit.jupiter.api.TestFactory\n * @org.jetbrains.kotlin.test.TestMetadata(\"foo.kt\")\n * public Collection testFoo() {\n * // Compiles foo.kt with test-runner, probably together with other testData files (bar.kt, qux.kt, ...).\n * // Then produces two instances of DynamicTest for FooKt.one() and FooKt.two() functions.\n * // Each DynamicTest is executed as a separate JUnit test.\n * // So if FooKt.one() fails and FooKt.two() succeeds, then \"testFoo.one\" JUnit test will be presented as failed\n * // in the test report, and \"testFoo.two\" will be presented as passed.\n * }\n * }\n * ```\n */"} {"signature":"operator fun invoke ( ) : Column","body":"{ return functions . callUDF ( udfName ) }","docstring":"/**\n * Calls the [functions.callUDF] for the UDF with the [udfName] and the given columns.\n */"} {"signature":"@ OptIn ( ExperimentalStdlibApi :: class ) @ Deprecated ( \"\" , ReplaceWith ( \"\" ) , DeprecationLevel . HIDDEN ) inline fun < reified R > UDFRegistration . register ( name : String , noinline func : ( ) -> R ) : UDFWrapper0","body":"{ register ( name , UDF0 ( func ) , schema ( typeOf < R > ( ) ) . unWrap ( ) ) return UDFWrapper0 ( name ) }","docstring":"/**\n * Registers the [func] with its [name] in [this].\n */"} {"signature":"operator fun invoke ( param0 : Column ) : Column","body":"{ return functions . callUDF ( udfName , param0 ) }","docstring":"/**\n * Calls the [functions.callUDF] for the UDF with the [udfName] and the given columns.\n */"} {"signature":"@ OptIn ( ExperimentalStdlibApi :: class ) @ Deprecated ( \"\" , ReplaceWith ( \"\" ) , DeprecationLevel . HIDDEN ) inline fun < reified T0 , reified R > UDFRegistration . register ( name : String , noinline func : ( T0 ) -> R ) : UDFWrapper1","body":"{ T0 :: class . checkForValidType ( \"\" ) register ( name , UDF1 ( func ) , schema ( typeOf < R > ( ) ) . unWrap ( ) ) return UDFWrapper1 ( name ) }","docstring":"/**\n * Registers the [func] with its [name] in [this].\n */"} {"signature":"operator fun invoke ( param0 : Column , param1 : Column ) : Column","body":"{ return functions . callUDF ( udfName , param0 , param1 ) }","docstring":"/**\n * Calls the [functions.callUDF] for the UDF with the [udfName] and the given columns.\n */"} {"signature":"@ OptIn ( ExperimentalStdlibApi :: class ) @ Deprecated ( \"\" , ReplaceWith ( \"\" ) , DeprecationLevel . HIDDEN ) inline fun < reified T0 , reified T1 , reified R > UDFRegistration . register ( name : String , noinline func : ( T0 , T1 ) -> R , ) : UDFWrapper2","body":"{ T0 :: class . checkForValidType ( \"\" ) T1 :: class . checkForValidType ( \"\" ) register ( name , UDF2 ( func ) , schema ( typeOf < R > ( ) ) . unWrap ( ) ) return UDFWrapper2 ( name ) }","docstring":"/**\n * Registers the [func] with its [name] in [this].\n */"} {"signature":"operator fun invoke ( param0 : Column , param1 : Column , param2 : Column ) : Column","body":"{ return functions . callUDF ( udfName , param0 , param1 , param2 ) }","docstring":"/**\n * Calls the [functions.callUDF] for the UDF with the [udfName] and the given columns.\n */"} {"signature":"@ OptIn ( ExperimentalStdlibApi :: class ) @ Deprecated ( \"\" , ReplaceWith ( \"\" ) , DeprecationLevel . HIDDEN ) inline fun < reified T0 , reified T1 , reified T2 , reified R > UDFRegistration . register ( name : String , noinline func : ( T0 , T1 , T2 ) -> R , ) : UDFWrapper3","body":"{ T0 :: class . checkForValidType ( \"\" ) T1 :: class . checkForValidType ( \"\" ) T2 :: class . checkForValidType ( \"\" ) register ( name , UDF3 ( func ) , schema ( typeOf < R > ( ) ) . unWrap ( ) ) return UDFWrapper3 ( name ) }","docstring":"/**\n * Registers the [func] with its [name] in [this].\n */"} {"signature":"operator fun invoke ( param0 : Column , param1 : Column , param2 : Column , param3 : Column ) : Column","body":"{ return functions . callUDF ( udfName , param0 , param1 , param2 , param3 ) }","docstring":"/**\n * Calls the [functions.callUDF] for the UDF with the [udfName] and the given columns.\n */"} {"signature":"@ OptIn ( ExperimentalStdlibApi :: class ) @ Deprecated ( \"\" , ReplaceWith ( \"\" ) , DeprecationLevel . HIDDEN ) inline fun < reified T0 , reified T1 , reified T2 , reified T3 , reified R > UDFRegistration . register ( name : String , noinline func : ( T0 , T1 , T2 , T3 ) -> R , ) : UDFWrapper4","body":"{ T0 :: class . checkForValidType ( \"\" ) T1 :: class . checkForValidType ( \"\" ) T2 :: class . checkForValidType ( \"\" ) T3 :: class . checkForValidType ( \"\" ) register ( name , UDF4 ( func ) , schema ( typeOf < R > ( ) ) . unWrap ( ) ) return UDFWrapper4 ( name ) }","docstring":"/**\n * Registers the [func] with its [name] in [this].\n */"} {"signature":"operator fun invoke ( param0 : Column , param1 : Column , param2 : Column , param3 : Column , param4 : Column ) : Column","body":"{ return functions . callUDF ( udfName , param0 , param1 , param2 , param3 , param4 ) }","docstring":"/**\n * Calls the [functions.callUDF] for the UDF with the [udfName] and the given columns.\n */"} {"signature":"@ OptIn ( ExperimentalStdlibApi :: class ) @ Deprecated ( \"\" , ReplaceWith ( \"\" ) , DeprecationLevel . HIDDEN ) inline fun < reified T0 , reified T1 , reified T2 , reified T3 , reified T4 , reified R > UDFRegistration . register ( name : String , noinline func : ( T0 , T1 , T2 , T3 , T4 ) -> R , ) : UDFWrapper5","body":"{ T0 :: class . checkForValidType ( \"\" ) T1 :: class . checkForValidType ( \"\" ) T2 :: class . checkForValidType ( \"\" ) T3 :: class . checkForValidType ( \"\" ) T4 :: class . checkForValidType ( \"\" ) register ( name , UDF5 ( func ) , schema ( typeOf < R > ( ) ) . unWrap ( ) ) return UDFWrapper5 ( name ) }","docstring":"/**\n * Registers the [func] with its [name] in [this].\n */"} {"signature":"operator fun invoke ( param0 : Column , param1 : Column , param2 : Column , param3 : Column , param4 : Column , param5 : Column , ) : Column","body":"{ return functions . callUDF ( udfName , param0 , param1 , param2 , param3 , param4 , param5 ) }","docstring":"/**\n * Calls the [functions.callUDF] for the UDF with the [udfName] and the given columns.\n */"} {"signature":"@ OptIn ( ExperimentalStdlibApi :: class ) @ Deprecated ( \"\" , ReplaceWith ( \"\" ) , DeprecationLevel . HIDDEN ) inline fun < reified T0 , reified T1 , reified T2 , reified T3 , reified T4 , reified T5 , reified R > UDFRegistration . register ( name : String , noinline func : ( T0 , T1 , T2 , T3 , T4 , T5 ) -> R , ) : UDFWrapper6","body":"{ T0 :: class . checkForValidType ( \"\" ) T1 :: class . checkForValidType ( \"\" ) T2 :: class . checkForValidType ( \"\" ) T3 :: class . checkForValidType ( \"\" ) T4 :: class . checkForValidType ( \"\" ) T5 :: class . checkForValidType ( \"\" ) register ( name , UDF6 ( func ) , schema ( typeOf < R > ( ) ) . unWrap ( ) ) return UDFWrapper6 ( name ) }","docstring":"/**\n * Registers the [func] with its [name] in [this].\n */"} {"signature":"operator fun invoke ( param0 : Column , param1 : Column , param2 : Column , param3 : Column , param4 : Column , param5 : Column , param6 : Column , ) : Column","body":"{ return functions . callUDF ( udfName , param0 , param1 , param2 , param3 , param4 , param5 , param6 ) }","docstring":"/**\n * Calls the [functions.callUDF] for the UDF with the [udfName] and the given columns.\n */"} {"signature":"@ OptIn ( ExperimentalStdlibApi :: class ) @ Deprecated ( \"\" , ReplaceWith ( \"\" ) , DeprecationLevel . HIDDEN ) inline fun < reified T0 , reified T1 , reified T2 , reified T3 , reified T4 , reified T5 , reified T6 , reified R > UDFRegistration . register ( name : String , noinline func : ( T0 , T1 , T2 , T3 , T4 , T5 , T6 ) -> R , ) : UDFWrapper7","body":"{ T0 :: class . checkForValidType ( \"\" ) T1 :: class . checkForValidType ( \"\" ) T2 :: class . checkForValidType ( \"\" ) T3 :: class . checkForValidType ( \"\" ) T4 :: class . checkForValidType ( \"\" ) T5 :: class . checkForValidType ( \"\" ) T6 :: class . checkForValidType ( \"\" ) register ( name , UDF7 ( func ) , schema ( typeOf < R > ( ) ) . unWrap ( ) ) return UDFWrapper7 ( name ) }","docstring":"/**\n * Registers the [func] with its [name] in [this].\n */"} {"signature":"operator fun invoke ( param0 : Column , param1 : Column , param2 : Column , param3 : Column , param4 : Column , param5 : Column , param6 : Column , param7 : Column , ) : Column","body":"{ return functions . callUDF ( udfName , param0 , param1 , param2 , param3 , param4 , param5 , param6 , param7 ) }","docstring":"/**\n * Calls the [functions.callUDF] for the UDF with the [udfName] and the given columns.\n */"} {"signature":"@ OptIn ( ExperimentalStdlibApi :: class ) @ Deprecated ( \"\" , ReplaceWith ( \"\" ) , DeprecationLevel . HIDDEN ) inline fun < reified T0 , reified T1 , reified T2 , reified T3 , reified T4 , reified T5 , reified T6 , reified T7 , reified R > UDFRegistration . register ( name : String , noinline func : ( T0 , T1 , T2 , T3 , T4 , T5 , T6 , T7 ) -> R , ) : UDFWrapper8","body":"{ T0 :: class . checkForValidType ( \"\" ) T1 :: class . checkForValidType ( \"\" ) T2 :: class . checkForValidType ( \"\" ) T3 :: class . checkForValidType ( \"\" ) T4 :: class . checkForValidType ( \"\" ) T5 :: class . checkForValidType ( \"\" ) T6 :: class . checkForValidType ( \"\" ) T7 :: class . checkForValidType ( \"\" ) register ( name , UDF8 ( func ) , schema ( typeOf < R > ( ) ) . unWrap ( ) ) return UDFWrapper8 ( name ) }","docstring":"/**\n * Registers the [func] with its [name] in [this].\n */"} {"signature":"operator fun invoke ( param0 : Column , param1 : Column , param2 : Column , param3 : Column , param4 : Column , param5 : Column , param6 : Column , param7 : Column , param8 : Column , ) : Column","body":"{ return functions . callUDF ( udfName , param0 , param1 , param2 , param3 , param4 , param5 , param6 , param7 , param8 ) }","docstring":"/**\n * Calls the [functions.callUDF] for the UDF with the [udfName] and the given columns.\n */"} {"signature":"@ OptIn ( ExperimentalStdlibApi :: class ) @ Deprecated ( \"\" , ReplaceWith ( \"\" ) , DeprecationLevel . HIDDEN ) inline fun < reified T0 , reified T1 , reified T2 , reified T3 , reified T4 , reified T5 , reified T6 , reified T7 , reified T8 , reified R > UDFRegistration . register ( name : String , noinline func : ( T0 , T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 ) -> R , ) : UDFWrapper9","body":"{ T0 :: class . checkForValidType ( \"\" ) T1 :: class . checkForValidType ( \"\" ) T2 :: class . checkForValidType ( \"\" ) T3 :: class . checkForValidType ( \"\" ) T4 :: class . checkForValidType ( \"\" ) T5 :: class . checkForValidType ( \"\" ) T6 :: class . checkForValidType ( \"\" ) T7 :: class . checkForValidType ( \"\" ) T8 :: class . checkForValidType ( \"\" ) register ( name , UDF9 ( func ) , schema ( typeOf < R > ( ) ) . unWrap ( ) ) return UDFWrapper9 ( name ) }","docstring":"/**\n * Registers the [func] with its [name] in [this].\n */"} {"signature":"operator fun invoke ( param0 : Column , param1 : Column , param2 : Column , param3 : Column , param4 : Column , param5 : Column , param6 : Column , param7 : Column , param8 : Column , param9 : Column , ) : Column","body":"{ return functions . callUDF ( udfName , param0 , param1 , param2 , param3 , param4 , param5 , param6 , param7 , param8 , param9 ) }","docstring":"/**\n * Calls the [functions.callUDF] for the UDF with the [udfName] and the given columns.\n */"} {"signature":"@ OptIn ( ExperimentalStdlibApi :: class ) @ Deprecated ( \"\" , ReplaceWith ( \"\" ) , DeprecationLevel . HIDDEN ) inline fun < reified T0 , reified T1 , reified T2 , reified T3 , reified T4 , reified T5 , reified T6 , reified T7 , reified T8 , reified T9 , reified R > UDFRegistration . register ( name : String , noinline func : ( T0 , T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 ) -> R , ) : UDFWrapper10","body":"{ T0 :: class . checkForValidType ( \"\" ) T1 :: class . checkForValidType ( \"\" ) T2 :: class . checkForValidType ( \"\" ) T3 :: class . checkForValidType ( \"\" ) T4 :: class . checkForValidType ( \"\" ) T5 :: class . checkForValidType ( \"\" ) T6 :: class . checkForValidType ( \"\" ) T7 :: class . checkForValidType ( \"\" ) T8 :: class . checkForValidType ( \"\" ) T9 :: class . checkForValidType ( \"\" ) register ( name , UDF10 ( func ) , schema ( typeOf < R > ( ) ) . unWrap ( ) ) return UDFWrapper10 ( name ) }","docstring":"/**\n * Registers the [func] with its [name] in [this].\n */"} {"signature":"operator fun invoke ( param0 : Column , param1 : Column , param2 : Column , param3 : Column , param4 : Column , param5 : Column , param6 : Column , param7 : Column , param8 : Column , param9 : Column , param10 : Column , ) : Column","body":"{ return functions . callUDF ( udfName , param0 , param1 , param2 , param3 , param4 , param5 , param6 , param7 , param8 , param9 , param10 ) }","docstring":"/**\n * Calls the [functions.callUDF] for the UDF with the [udfName] and the given columns.\n */"} {"signature":"@ OptIn ( ExperimentalStdlibApi :: class ) @ Deprecated ( \"\" , ReplaceWith ( \"\" ) , DeprecationLevel . HIDDEN ) inline fun < reified T0 , reified T1 , reified T2 , reified T3 , reified T4 , reified T5 , reified T6 , reified T7 , reified T8 , reified T9 , reified T10 , reified R > UDFRegistration . register ( name : String , noinline func : ( T0 , T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 ) -> R , ) : UDFWrapper11","body":"{ T0 :: class . checkForValidType ( \"\" ) T1 :: class . checkForValidType ( \"\" ) T2 :: class . checkForValidType ( \"\" ) T3 :: class . checkForValidType ( \"\" ) T4 :: class . checkForValidType ( \"\" ) T5 :: class . checkForValidType ( \"\" ) T6 :: class . checkForValidType ( \"\" ) T7 :: class . checkForValidType ( \"\" ) T8 :: class . checkForValidType ( \"\" ) T9 :: class . checkForValidType ( \"\" ) T10 :: class . checkForValidType ( \"\" ) register ( name , UDF11 ( func ) , schema ( typeOf < R > ( ) ) . unWrap ( ) ) return UDFWrapper11 ( name ) }","docstring":"/**\n * Registers the [func] with its [name] in [this].\n */"} {"signature":"operator fun invoke ( param0 : Column , param1 : Column , param2 : Column , param3 : Column , param4 : Column , param5 : Column , param6 : Column , param7 : Column , param8 : Column , param9 : Column , param10 : Column , param11 : Column , ) : Column","body":"{ return functions . callUDF ( udfName , param0 , param1 , param2 , param3 , param4 , param5 , param6 , param7 , param8 , param9 , param10 , param11 ) }","docstring":"/**\n * Calls the [functions.callUDF] for the UDF with the [udfName] and the given columns.\n */"} {"signature":"@ OptIn ( ExperimentalStdlibApi :: class ) @ Deprecated ( \"\" , ReplaceWith ( \"\" ) , DeprecationLevel . HIDDEN ) inline fun < reified T0 , reified T1 , reified T2 , reified T3 , reified T4 , reified T5 , reified T6 , reified T7 , reified T8 , reified T9 , reified T10 , reified T11 , reified R > UDFRegistration . register ( name : String , noinline func : ( T0 , T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 ) -> R , ) : UDFWrapper12","body":"{ T0 :: class . checkForValidType ( \"\" ) T1 :: class . checkForValidType ( \"\" ) T2 :: class . checkForValidType ( \"\" ) T3 :: class . checkForValidType ( \"\" ) T4 :: class . checkForValidType ( \"\" ) T5 :: class . checkForValidType ( \"\" ) T6 :: class . checkForValidType ( \"\" ) T7 :: class . checkForValidType ( \"\" ) T8 :: class . checkForValidType ( \"\" ) T9 :: class . checkForValidType ( \"\" ) T10 :: class . checkForValidType ( \"\" ) T11 :: class . checkForValidType ( \"\" ) register ( name , UDF12 ( func ) , schema ( typeOf < R > ( ) ) . unWrap ( ) ) return UDFWrapper12 ( name ) }","docstring":"/**\n * Registers the [func] with its [name] in [this].\n */"} {"signature":"operator fun invoke ( param0 : Column , param1 : Column , param2 : Column , param3 : Column , param4 : Column , param5 : Column , param6 : Column , param7 : Column , param8 : Column , param9 : Column , param10 : Column , param11 : Column , param12 : Column , ) : Column","body":"{ return functions . callUDF ( udfName , param0 , param1 , param2 , param3 , param4 , param5 , param6 , param7 , param8 , param9 , param10 , param11 , param12 ) }","docstring":"/**\n * Calls the [functions.callUDF] for the UDF with the [udfName] and the given columns.\n */"} {"signature":"@ OptIn ( ExperimentalStdlibApi :: class ) @ Deprecated ( \"\" , ReplaceWith ( \"\" ) , DeprecationLevel . HIDDEN ) inline fun < reified T0 , reified T1 , reified T2 , reified T3 , reified T4 , reified T5 , reified T6 , reified T7 , reified T8 , reified T9 , reified T10 , reified T11 , reified T12 , reified R > UDFRegistration . register ( name : String , noinline func : ( T0 , T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 , T12 ) -> R , ) : UDFWrapper13","body":"{ T0 :: class . checkForValidType ( \"\" ) T1 :: class . checkForValidType ( \"\" ) T2 :: class . checkForValidType ( \"\" ) T3 :: class . checkForValidType ( \"\" ) T4 :: class . checkForValidType ( \"\" ) T5 :: class . checkForValidType ( \"\" ) T6 :: class . checkForValidType ( \"\" ) T7 :: class . checkForValidType ( \"\" ) T8 :: class . checkForValidType ( \"\" ) T9 :: class . checkForValidType ( \"\" ) T10 :: class . checkForValidType ( \"\" ) T11 :: class . checkForValidType ( \"\" ) T12 :: class . checkForValidType ( \"\" ) register ( name , UDF13 ( func ) , schema ( typeOf < R > ( ) ) . unWrap ( ) ) return UDFWrapper13 ( name ) }","docstring":"/**\n * Registers the [func] with its [name] in [this].\n */"} {"signature":"operator fun invoke ( param0 : Column , param1 : Column , param2 : Column , param3 : Column , param4 : Column , param5 : Column , param6 : Column , param7 : Column , param8 : Column , param9 : Column , param10 : Column , param11 : Column , param12 : Column , param13 : Column , ) : Column","body":"{ return functions . callUDF ( udfName , param0 , param1 , param2 , param3 , param4 , param5 , param6 , param7 , param8 , param9 , param10 , param11 , param12 , param13 ) }","docstring":"/**\n * Calls the [functions.callUDF] for the UDF with the [udfName] and the given columns.\n */"} {"signature":"@ OptIn ( ExperimentalStdlibApi :: class ) @ Deprecated ( \"\" , ReplaceWith ( \"\" ) , DeprecationLevel . HIDDEN ) inline fun < reified T0 , reified T1 , reified T2 , reified T3 , reified T4 , reified T5 , reified T6 , reified T7 , reified T8 , reified T9 , reified T10 , reified T11 , reified T12 , reified T13 , reified R > UDFRegistration . register ( name : String , noinline func : ( T0 , T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 , T12 , T13 ) -> R , ) : UDFWrapper14","body":"{ T0 :: class . checkForValidType ( \"\" ) T1 :: class . checkForValidType ( \"\" ) T2 :: class . checkForValidType ( \"\" ) T3 :: class . checkForValidType ( \"\" ) T4 :: class . checkForValidType ( \"\" ) T5 :: class . checkForValidType ( \"\" ) T6 :: class . checkForValidType ( \"\" ) T7 :: class . checkForValidType ( \"\" ) T8 :: class . checkForValidType ( \"\" ) T9 :: class . checkForValidType ( \"\" ) T10 :: class . checkForValidType ( \"\" ) T11 :: class . checkForValidType ( \"\" ) T12 :: class . checkForValidType ( \"\" ) T13 :: class . checkForValidType ( \"\" ) register ( name , UDF14 ( func ) , schema ( typeOf < R > ( ) ) . unWrap ( ) ) return UDFWrapper14 ( name ) }","docstring":"/**\n * Registers the [func] with its [name] in [this].\n */"} {"signature":"operator fun invoke ( param0 : Column , param1 : Column , param2 : Column , param3 : Column , param4 : Column , param5 : Column , param6 : Column , param7 : Column , param8 : Column , param9 : Column , param10 : Column , param11 : Column , param12 : Column , param13 : Column , param14 : Column , ) : Column","body":"{ return functions . callUDF ( udfName , param0 , param1 , param2 , param3 , param4 , param5 , param6 , param7 , param8 , param9 , param10 , param11 , param12 , param13 , param14 ) }","docstring":"/**\n * Calls the [functions.callUDF] for the UDF with the [udfName] and the given columns.\n */"} {"signature":"@ OptIn ( ExperimentalStdlibApi :: class ) @ Deprecated ( \"\" , ReplaceWith ( \"\" ) , DeprecationLevel . HIDDEN ) inline fun < reified T0 , reified T1 , reified T2 , reified T3 , reified T4 , reified T5 , reified T6 , reified T7 , reified T8 , reified T9 , reified T10 , reified T11 , reified T12 , reified T13 , reified T14 , reified R > UDFRegistration . register ( name : String , noinline func : ( T0 , T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 , T12 , T13 , T14 ) -> R , ) : UDFWrapper15","body":"{ T0 :: class . checkForValidType ( \"\" ) T1 :: class . checkForValidType ( \"\" ) T2 :: class . checkForValidType ( \"\" ) T3 :: class . checkForValidType ( \"\" ) T4 :: class . checkForValidType ( \"\" ) T5 :: class . checkForValidType ( \"\" ) T6 :: class . checkForValidType ( \"\" ) T7 :: class . checkForValidType ( \"\" ) T8 :: class . checkForValidType ( \"\" ) T9 :: class . checkForValidType ( \"\" ) T10 :: class . checkForValidType ( \"\" ) T11 :: class . checkForValidType ( \"\" ) T12 :: class . checkForValidType ( \"\" ) T13 :: class . checkForValidType ( \"\" ) T14 :: class . checkForValidType ( \"\" ) register ( name , UDF15 ( func ) , schema ( typeOf < R > ( ) ) . unWrap ( ) ) return UDFWrapper15 ( name ) }","docstring":"/**\n * Registers the [func] with its [name] in [this].\n */"} {"signature":"operator fun invoke ( param0 : Column , param1 : Column , param2 : Column , param3 : Column , param4 : Column , param5 : Column , param6 : Column , param7 : Column , param8 : Column , param9 : Column , param10 : Column , param11 : Column , param12 : Column , param13 : Column , param14 : Column , param15 : Column , ) : Column","body":"{ return functions . callUDF ( udfName , param0 , param1 , param2 , param3 , param4 , param5 , param6 , param7 , param8 , param9 , param10 , param11 , param12 , param13 , param14 , param15 ) }","docstring":"/**\n * Calls the [functions.callUDF] for the UDF with the [udfName] and the given columns.\n */"} {"signature":"@ OptIn ( ExperimentalStdlibApi :: class ) @ Deprecated ( \"\" , ReplaceWith ( \"\" ) , DeprecationLevel . HIDDEN ) inline fun < reified T0 , reified T1 , reified T2 , reified T3 , reified T4 , reified T5 , reified T6 , reified T7 , reified T8 , reified T9 , reified T10 , reified T11 , reified T12 , reified T13 , reified T14 , reified T15 , reified R > UDFRegistration . register ( name : String , noinline func : ( T0 , T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 , T12 , T13 , T14 , T15 ) -> R , ) : UDFWrapper16","body":"{ T0 :: class . checkForValidType ( \"\" ) T1 :: class . checkForValidType ( \"\" ) T2 :: class . checkForValidType ( \"\" ) T3 :: class . checkForValidType ( \"\" ) T4 :: class . checkForValidType ( \"\" ) T5 :: class . checkForValidType ( \"\" ) T6 :: class . checkForValidType ( \"\" ) T7 :: class . checkForValidType ( \"\" ) T8 :: class . checkForValidType ( \"\" ) T9 :: class . checkForValidType ( \"\" ) T10 :: class . checkForValidType ( \"\" ) T11 :: class . checkForValidType ( \"\" ) T12 :: class . checkForValidType ( \"\" ) T13 :: class . checkForValidType ( \"\" ) T14 :: class . checkForValidType ( \"\" ) T15 :: class . checkForValidType ( \"\" ) register ( name , UDF16 ( func ) , schema ( typeOf < R > ( ) ) . unWrap ( ) ) return UDFWrapper16 ( name ) }","docstring":"/**\n * Registers the [func] with its [name] in [this].\n */"} {"signature":"operator fun invoke ( param0 : Column , param1 : Column , param2 : Column , param3 : Column , param4 : Column , param5 : Column , param6 : Column , param7 : Column , param8 : Column , param9 : Column , param10 : Column , param11 : Column , param12 : Column , param13 : Column , param14 : Column , param15 : Column , param16 : Column , ) : Column","body":"{ return functions . callUDF ( udfName , param0 , param1 , param2 , param3 , param4 , param5 , param6 , param7 , param8 , param9 , param10 , param11 , param12 , param13 , param14 , param15 , param16 ) }","docstring":"/**\n * Calls the [functions.callUDF] for the UDF with the [udfName] and the given columns.\n */"} {"signature":"@ OptIn ( ExperimentalStdlibApi :: class ) @ Deprecated ( \"\" , ReplaceWith ( \"\" ) , DeprecationLevel . HIDDEN ) inline fun < reified T0 , reified T1 , reified T2 , reified T3 , reified T4 , reified T5 , reified T6 , reified T7 , reified T8 , reified T9 , reified T10 , reified T11 , reified T12 , reified T13 , reified T14 , reified T15 , reified T16 , reified R > UDFRegistration . register ( name : String , noinline func : ( T0 , T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 , T12 , T13 , T14 , T15 , T16 ) -> R , ) : UDFWrapper17","body":"{ T0 :: class . checkForValidType ( \"\" ) T1 :: class . checkForValidType ( \"\" ) T2 :: class . checkForValidType ( \"\" ) T3 :: class . checkForValidType ( \"\" ) T4 :: class . checkForValidType ( \"\" ) T5 :: class . checkForValidType ( \"\" ) T6 :: class . checkForValidType ( \"\" ) T7 :: class . checkForValidType ( \"\" ) T8 :: class . checkForValidType ( \"\" ) T9 :: class . checkForValidType ( \"\" ) T10 :: class . checkForValidType ( \"\" ) T11 :: class . checkForValidType ( \"\" ) T12 :: class . checkForValidType ( \"\" ) T13 :: class . checkForValidType ( \"\" ) T14 :: class . checkForValidType ( \"\" ) T15 :: class . checkForValidType ( \"\" ) T16 :: class . checkForValidType ( \"\" ) register ( name , UDF17 ( func ) , schema ( typeOf < R > ( ) ) . unWrap ( ) ) return UDFWrapper17 ( name ) }","docstring":"/**\n * Registers the [func] with its [name] in [this].\n */"} {"signature":"operator fun invoke ( param0 : Column , param1 : Column , param2 : Column , param3 : Column , param4 : Column , param5 : Column , param6 : Column , param7 : Column , param8 : Column , param9 : Column , param10 : Column , param11 : Column , param12 : Column , param13 : Column , param14 : Column , param15 : Column , param16 : Column , param17 : Column , ) : Column","body":"{ return functions . callUDF ( udfName , param0 , param1 , param2 , param3 , param4 , param5 , param6 , param7 , param8 , param9 , param10 , param11 , param12 , param13 , param14 , param15 , param16 , param17 ) }","docstring":"/**\n * Calls the [functions.callUDF] for the UDF with the [udfName] and the given columns.\n */"} {"signature":"@ OptIn ( ExperimentalStdlibApi :: class ) @ Deprecated ( \"\" , ReplaceWith ( \"\" ) , DeprecationLevel . HIDDEN ) inline fun < reified T0 , reified T1 , reified T2 , reified T3 , reified T4 , reified T5 , reified T6 , reified T7 , reified T8 , reified T9 , reified T10 , reified T11 , reified T12 , reified T13 , reified T14 , reified T15 , reified T16 , reified T17 , reified R > UDFRegistration . register ( name : String , noinline func : ( T0 , T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 , T12 , T13 , T14 , T15 , T16 , T17 ) -> R , ) : UDFWrapper18","body":"{ T0 :: class . checkForValidType ( \"\" ) T1 :: class . checkForValidType ( \"\" ) T2 :: class . checkForValidType ( \"\" ) T3 :: class . checkForValidType ( \"\" ) T4 :: class . checkForValidType ( \"\" ) T5 :: class . checkForValidType ( \"\" ) T6 :: class . checkForValidType ( \"\" ) T7 :: class . checkForValidType ( \"\" ) T8 :: class . checkForValidType ( \"\" ) T9 :: class . checkForValidType ( \"\" ) T10 :: class . checkForValidType ( \"\" ) T11 :: class . checkForValidType ( \"\" ) T12 :: class . checkForValidType ( \"\" ) T13 :: class . checkForValidType ( \"\" ) T14 :: class . checkForValidType ( \"\" ) T15 :: class . checkForValidType ( \"\" ) T16 :: class . checkForValidType ( \"\" ) T17 :: class . checkForValidType ( \"\" ) register ( name , UDF18 ( func ) , schema ( typeOf < R > ( ) ) . unWrap ( ) ) return UDFWrapper18 ( name ) }","docstring":"/**\n * Registers the [func] with its [name] in [this].\n */"} {"signature":"operator fun invoke ( param0 : Column , param1 : Column , param2 : Column , param3 : Column , param4 : Column , param5 : Column , param6 : Column , param7 : Column , param8 : Column , param9 : Column , param10 : Column , param11 : Column , param12 : Column , param13 : Column , param14 : Column , param15 : Column , param16 : Column , param17 : Column , param18 : Column , ) : Column","body":"{ return functions . callUDF ( udfName , param0 , param1 , param2 , param3 , param4 , param5 , param6 , param7 , param8 , param9 , param10 , param11 , param12 , param13 , param14 , param15 , param16 , param17 , param18 ) }","docstring":"/**\n * Calls the [functions.callUDF] for the UDF with the [udfName] and the given columns.\n */"} {"signature":"@ OptIn ( ExperimentalStdlibApi :: class ) @ Deprecated ( \"\" , ReplaceWith ( \"\" ) , DeprecationLevel . HIDDEN ) inline fun < reified T0 , reified T1 , reified T2 , reified T3 , reified T4 , reified T5 , reified T6 , reified T7 , reified T8 , reified T9 , reified T10 , reified T11 , reified T12 , reified T13 , reified T14 , reified T15 , reified T16 , reified T17 , reified T18 , reified R > UDFRegistration . register ( name : String , noinline func : ( T0 , T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 , T12 , T13 , T14 , T15 , T16 , T17 , T18 ) -> R , ) : UDFWrapper19","body":"{ T0 :: class . checkForValidType ( \"\" ) T1 :: class . checkForValidType ( \"\" ) T2 :: class . checkForValidType ( \"\" ) T3 :: class . checkForValidType ( \"\" ) T4 :: class . checkForValidType ( \"\" ) T5 :: class . checkForValidType ( \"\" ) T6 :: class . checkForValidType ( \"\" ) T7 :: class . checkForValidType ( \"\" ) T8 :: class . checkForValidType ( \"\" ) T9 :: class . checkForValidType ( \"\" ) T10 :: class . checkForValidType ( \"\" ) T11 :: class . checkForValidType ( \"\" ) T12 :: class . checkForValidType ( \"\" ) T13 :: class . checkForValidType ( \"\" ) T14 :: class . checkForValidType ( \"\" ) T15 :: class . checkForValidType ( \"\" ) T16 :: class . checkForValidType ( \"\" ) T17 :: class . checkForValidType ( \"\" ) T18 :: class . checkForValidType ( \"\" ) register ( name , UDF19 ( func ) , schema ( typeOf < R > ( ) ) . unWrap ( ) ) return UDFWrapper19 ( name ) }","docstring":"/**\n * Registers the [func] with its [name] in [this].\n */"} {"signature":"operator fun invoke ( param0 : Column , param1 : Column , param2 : Column , param3 : Column , param4 : Column , param5 : Column , param6 : Column , param7 : Column , param8 : Column , param9 : Column , param10 : Column , param11 : Column , param12 : Column , param13 : Column , param14 : Column , param15 : Column , param16 : Column , param17 : Column , param18 : Column , param19 : Column , ) : Column","body":"{ return functions . callUDF ( udfName , param0 , param1 , param2 , param3 , param4 , param5 , param6 , param7 , param8 , param9 , param10 , param11 , param12 , param13 , param14 , param15 , param16 , param17 , param18 , param19 ) }","docstring":"/**\n * Calls the [functions.callUDF] for the UDF with the [udfName] and the given columns.\n */"} {"signature":"@ OptIn ( ExperimentalStdlibApi :: class ) @ Deprecated ( \"\" , ReplaceWith ( \"\" ) , DeprecationLevel . HIDDEN ) inline fun < reified T0 , reified T1 , reified T2 , reified T3 , reified T4 , reified T5 , reified T6 , reified T7 , reified T8 , reified T9 , reified T10 , reified T11 , reified T12 , reified T13 , reified T14 , reified T15 , reified T16 , reified T17 , reified T18 , reified T19 , reified R > UDFRegistration . register ( name : String , noinline func : ( T0 , T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 , T12 , T13 , T14 , T15 , T16 , T17 , T18 , T19 ) -> R , ) : UDFWrapper20","body":"{ T0 :: class . checkForValidType ( \"\" ) T1 :: class . checkForValidType ( \"\" ) T2 :: class . checkForValidType ( \"\" ) T3 :: class . checkForValidType ( \"\" ) T4 :: class . checkForValidType ( \"\" ) T5 :: class . checkForValidType ( \"\" ) T6 :: class . checkForValidType ( \"\" ) T7 :: class . checkForValidType ( \"\" ) T8 :: class . checkForValidType ( \"\" ) T9 :: class . checkForValidType ( \"\" ) T10 :: class . checkForValidType ( \"\" ) T11 :: class . checkForValidType ( \"\" ) T12 :: class . checkForValidType ( \"\" ) T13 :: class . checkForValidType ( \"\" ) T14 :: class . checkForValidType ( \"\" ) T15 :: class . checkForValidType ( \"\" ) T16 :: class . checkForValidType ( \"\" ) T17 :: class . checkForValidType ( \"\" ) T18 :: class . checkForValidType ( \"\" ) T19 :: class . checkForValidType ( \"\" ) register ( name , UDF20 ( func ) , schema ( typeOf < R > ( ) ) . unWrap ( ) ) return UDFWrapper20 ( name ) }","docstring":"/**\n * Registers the [func] with its [name] in [this].\n */"} {"signature":"operator fun invoke ( param0 : Column , param1 : Column , param2 : Column , param3 : Column , param4 : Column , param5 : Column , param6 : Column , param7 : Column , param8 : Column , param9 : Column , param10 : Column , param11 : Column , param12 : Column , param13 : Column , param14 : Column , param15 : Column , param16 : Column , param17 : Column , param18 : Column , param19 : Column , param20 : Column , ) : Column","body":"{ return functions . callUDF ( udfName , param0 , param1 , param2 , param3 , param4 , param5 , param6 , param7 , param8 , param9 , param10 , param11 , param12 , param13 , param14 , param15 , param16 , param17 , param18 , param19 , param20 ) }","docstring":"/**\n * Calls the [functions.callUDF] for the UDF with the [udfName] and the given columns.\n */"} {"signature":"@ OptIn ( ExperimentalStdlibApi :: class ) @ Deprecated ( \"\" , ReplaceWith ( \"\" ) , DeprecationLevel . HIDDEN ) inline fun < reified T0 , reified T1 , reified T2 , reified T3 , reified T4 , reified T5 , reified T6 , reified T7 , reified T8 , reified T9 , reified T10 , reified T11 , reified T12 , reified T13 , reified T14 , reified T15 , reified T16 , reified T17 , reified T18 , reified T19 , reified T20 , reified R > UDFRegistration . register ( name : String , noinline func : ( T0 , T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 , T12 , T13 , T14 , T15 , T16 , T17 , T18 , T19 , T20 ) -> R , ) : UDFWrapper21","body":"{ T0 :: class . checkForValidType ( \"\" ) T1 :: class . checkForValidType ( \"\" ) T2 :: class . checkForValidType ( \"\" ) T3 :: class . checkForValidType ( \"\" ) T4 :: class . checkForValidType ( \"\" ) T5 :: class . checkForValidType ( \"\" ) T6 :: class . checkForValidType ( \"\" ) T7 :: class . checkForValidType ( \"\" ) T8 :: class . checkForValidType ( \"\" ) T9 :: class . checkForValidType ( \"\" ) T10 :: class . checkForValidType ( \"\" ) T11 :: class . checkForValidType ( \"\" ) T12 :: class . checkForValidType ( \"\" ) T13 :: class . checkForValidType ( \"\" ) T14 :: class . checkForValidType ( \"\" ) T15 :: class . checkForValidType ( \"\" ) T16 :: class . checkForValidType ( \"\" ) T17 :: class . checkForValidType ( \"\" ) T18 :: class . checkForValidType ( \"\" ) T19 :: class . checkForValidType ( \"\" ) T20 :: class . checkForValidType ( \"\" ) register ( name , UDF21 ( func ) , schema ( typeOf < R > ( ) ) . unWrap ( ) ) return UDFWrapper21 ( name ) }","docstring":"/**\n * Registers the [func] with its [name] in [this].\n */"} {"signature":"operator fun invoke ( param0 : Column , param1 : Column , param2 : Column , param3 : Column , param4 : Column , param5 : Column , param6 : Column , param7 : Column , param8 : Column , param9 : Column , param10 : Column , param11 : Column , param12 : Column , param13 : Column , param14 : Column , param15 : Column , param16 : Column , param17 : Column , param18 : Column , param19 : Column , param20 : Column , param21 : Column , ) : Column","body":"{ return functions . callUDF ( udfName , param0 , param1 , param2 , param3 , param4 , param5 , param6 , param7 , param8 , param9 , param10 , param11 , param12 , param13 , param14 , param15 , param16 , param17 , param18 , param19 , param20 , param21 ) }","docstring":"/**\n * Calls the [functions.callUDF] for the UDF with the [udfName] and the given columns.\n */"} {"signature":"@ OptIn ( ExperimentalStdlibApi :: class ) @ Deprecated ( \"\" , ReplaceWith ( \"\" ) , DeprecationLevel . HIDDEN ) inline fun < reified T0 , reified T1 , reified T2 , reified T3 , reified T4 , reified T5 , reified T6 , reified T7 , reified T8 , reified T9 , reified T10 , reified T11 , reified T12 , reified T13 , reified T14 , reified T15 , reified T16 , reified T17 , reified T18 , reified T19 , reified T20 , reified T21 , reified R > UDFRegistration . register ( name : String , noinline func : ( T0 , T1 , T2 , T3 , T4 , T5 , T6 , T7 , T8 , T9 , T10 , T11 , T12 , T13 , T14 , T15 , T16 , T17 , T18 , T19 , T20 , T21 ) -> R , ) : UDFWrapper22","body":"{ T0 :: class . checkForValidType ( \"\" ) T1 :: class . checkForValidType ( \"\" ) T2 :: class . checkForValidType ( \"\" ) T3 :: class . checkForValidType ( \"\" ) T4 :: class . checkForValidType ( \"\" ) T5 :: class . checkForValidType ( \"\" ) T6 :: class . checkForValidType ( \"\" ) T7 :: class . checkForValidType ( \"\" ) T8 :: class . checkForValidType ( \"\" ) T9 :: class . checkForValidType ( \"\" ) T10 :: class . checkForValidType ( \"\" ) T11 :: class . checkForValidType ( \"\" ) T12 :: class . checkForValidType ( \"\" ) T13 :: class . checkForValidType ( \"\" ) T14 :: class . checkForValidType ( \"\" ) T15 :: class . checkForValidType ( \"\" ) T16 :: class . checkForValidType ( \"\" ) T17 :: class . checkForValidType ( \"\" ) T18 :: class . checkForValidType ( \"\" ) T19 :: class . checkForValidType ( \"\" ) T20 :: class . checkForValidType ( \"\" ) T21 :: class . checkForValidType ( \"\" ) register ( name , UDF22 ( func ) , schema ( typeOf < R > ( ) ) . unWrap ( ) ) return UDFWrapper22 ( name ) }","docstring":"/**\n * Registers the [func] with its [name] in [this].\n */"} {"signature":"public fun < C > columns ( selector : ColumnsSelector < T , C > ) : List < DataColumn < C > >","body":"= dataFrame . get ( selector )","docstring":"/**\n * Fetches the specified columns from the dataframe.\n *\n * @param selector a selector to determine the columns to be fetched.\n * @return a list of selected data columns.\n */"} {"signature":"public fun < C > columns ( vararg columns : String ) : List < AnyCol >","body":"= dataFrame . getColumns ( * columns )","docstring":"/**\n * Fetches the specified columns from the dataframe by their names.\n *\n * @param columns names of the desired columns.\n * @return a list of selected data columns.\n */"} {"signature":"public inline fun groupBy ( columns : Iterable < String > , block : GroupedContext < T , T > . ( ) -> Unit )","body":"{ val groupBy = dataFrame . groupBy ( * columns . toList ( ) . toTypedArray ( ) ) GroupedContext ( groupBy , datasetHandler . buffer , this ) . apply ( block ) }","docstring":"/**\n * Creates and initializes a new context with the dataframe grouped by the specified column names.\n *\n * @param columns the column names to group the dataframe by.\n * @param block a lambda with receiver block that configures the new grouped context.\n */"} {"signature":"public inline fun groupBy ( vararg columns : String , block : GroupedContext < T , T > . ( ) -> Unit ) : Unit","body":"= groupBy ( columns . toList ( ) , block )","docstring":"/**\n * Creates and initializes a new context with the dataframe grouped by the specified column names.\n *\n * @param columns the column names to group the dataframe by.\n * @param block a lambda with receiver block that configures the new grouped context.\n */"} {"signature":"public inline fun groupBy ( vararg columnReferences : ColumnReference < * > , block : GroupedContext < T , T > . ( ) -> Unit ) : Unit","body":"= groupBy ( columnReferences . map { it . name ( ) } , block )","docstring":"/**\n * Creates and initializes a new context with the dataframe grouped by the given column references.\n *\n * @param columnReferences references to the columns to group by.\n * @param block a lambda with receiver block that configures the new grouped context.\n */"} {"signature":"public inline fun groupBy ( columnReferences : List < ColumnReference < * > > , block : GroupedContext < T , T > . ( ) -> Unit ) : Unit","body":"= groupBy ( columnReferences . map { it . name ( ) } , block )","docstring":"/**\n * Creates and initializes a new context with the dataframe grouped by the given column references.\n *\n * @param columnReferences a list of references to the columns to group by.\n * @param block a lambda with receiver block that configures the new grouped context.\n */"} {"signature":"inline fun < T > Iterator < T > . stopAfter ( crossinline predicate : ( T ) -> Boolean ) : Iterator < T >","body":"= iterator { for ( element in this @ stopAfter ) { yield ( element ) if ( predicate ( element ) ) { break } } }","docstring":"/**\n * _Example_\n * The following will print `1`, `2` and `3` when executed:\n * ```\n * arrayOf(1, 2, 3, 4, 5)\n * .iterator()\n * .stopAfter { it == 3 }\n * .forEach(::println)\n * ```\n * @return an iterator, which stops [this] Iterator after first element for which [predicate] returns `true`\n */"} {"signature":"@ Test fun testTimeoutCancellationFailRace ( )","body":"{ repeat ( * stressTestMultiplier ) { runBlocking { withTimeoutOrNull ( ) { while ( true ) { var caught = false try { CompletableFuture . supplyAsync { throw TestException ( ) } . await ( ) } catch ( ignored : TestException ) { caught = true } assertTrue ( caught ) } } } } }","docstring":"/**\n * See [https://github.com/Kotlin/kotlinx.coroutines/issues/892]\n */"} {"signature":"@ Test fun testConsistentExceptionUnwrapping ( )","body":"= runTest { expect ( ) val fFast = CompletableFuture . supplyAsync { expect ( ) throw TestException ( ) } fFast . checkFutureException < TestException > ( ) expect ( ) val dFast = fFast . asDeferred ( ) assertFailsWith < TestException > { fFast . await ( ) } assertFailsWith < TestException > { dFast . await ( ) } expect ( ) val barrier = CyclicBarrier ( ) val fSlow = CompletableFuture . supplyAsync { barrier . await ( ) expect ( ) throw TestException ( ) } val dSlow = fSlow . asDeferred ( ) launch ( start = CoroutineStart . UNDISPATCHED ) { expect ( ) assertFailsWith < TestException > { fSlow . await ( ) } assertFailsWith < TestException > { dSlow . await ( ) } finish ( ) } barrier . await ( ) fSlow . checkFutureException < TestException > ( ) }","docstring":"/**\n * Tests that both [CompletionStage.await] and [CompletionStage.asDeferred] consistently unwrap\n * [CompletionException] both in their slow and fast paths.\n * See [issue #1479](https://github.com/Kotlin/kotlinx.coroutines/issues/1479).\n */"} {"signature":"@ Test fun testCompletedStageAwait ( )","body":"= runTest { val stage = CompletableFuture . completedStage ( \"\" ) assertEquals ( \"\" , stage . await ( ) ) }","docstring":"/**\n * https://github.com/Kotlin/kotlinx.coroutines/issues/2456\n */"} {"signature":"@ Test fun testCompletedStageAsDeferredAwait ( )","body":"= runTest { val stage = CompletableFuture . completedStage ( \"\" ) val deferred = stage . asDeferred ( ) assertEquals ( \"\" , deferred . await ( ) ) }","docstring":"/**\n * https://github.com/Kotlin/kotlinx.coroutines/issues/2456\n */"} {"signature":"protected fun irEqual ( lhs : IrExpression , rhs : IrExpression ) : IrExpression","body":"{ return irCall ( context . irBuiltIns . eqeqSymbol , null , null , null , lhs , rhs ) }","docstring":"/** Compare [lhs] and [rhs] using structural equality (`==`). */"} {"signature":"protected fun irNotEqual ( lhs : IrExpression , rhs : IrExpression ) : IrExpression","body":"{ return irNot ( irEqual ( lhs , rhs ) ) }","docstring":"/** Compare [lhs] and [rhs] using structural inequality (`!=`). */"} {"signature":"@ Test fun testChannelBroadcastLazyCancel ( )","body":"= runTest { expect ( ) val a = produce { expect ( ) assertFailsWith < CancellationException > { send ( \"\" ) } expect ( ) } expect ( ) yield ( ) val b = a . broadcast ( ) b . cancel ( ) expect ( ) yield ( ) assertTrue ( a . isClosedForReceive ) finish ( ) }","docstring":"/**\n * See https://github.com/Kotlin/kotlinx.coroutines/issues/1713\n */"} {"signature":"internal fun convTransposeOutputLength ( inputLength : Long , filterSize : Int , padding : ConvPadding , outputPaddingStart : Int ? , outputPaddingEnd : Int ? , stride : Int , dilation : Int ) : Long","body":"{ val dilatedFilterSize = dilatedFilterSize ( filterSize , dilation ) if ( outputPaddingEnd == null || outputPaddingStart == null ) { return when ( padding ) { ConvPadding . VALID -> inputLength * stride + max ( dilatedFilterSize - stride , ) ConvPadding . SAME -> inputLength * stride ConvPadding . FULL -> inputLength * stride - ( stride + dilatedFilterSize - ) } } val totalPadding = convTransposePadding ( padding , outputPaddingStart , outputPaddingEnd , filterSize , dilation ) . sum ( ) return ( inputLength - ) * stride + dilatedFilterSize + totalPadding }","docstring":"/**\n * Calculates output length after applying transposed convolution operation on a single axis.\n */"} {"signature":"fun KtClassOrObject . toLightClass ( ) : KtLightClass ?","body":"= KotlinAsJavaSupport . getInstance ( project ) . getLightClass ( this )","docstring":"/**\n * Can be null in scripts and for elements from non-jvm modules.\n */"} {"signature":"fun < T > Product1 < T > . first ( ) : T","body":"= this . _1 ( )","docstring":"/** Returns the first value of this Tuple or Product. */"} {"signature":"fun < T > Product1 < T > . last ( ) : T","body":"= this . _1 ( )","docstring":"/** Returns the last value of this Tuple or Product. */"} {"signature":"fun < T > Product2 < T , * > . first ( ) : T","body":"= this . _1 ( )","docstring":"/** Returns the first value of this Tuple or Product. */"} {"signature":"fun < T > Product2 < * , T > . last ( ) : T","body":"= this . _2 ( )","docstring":"/** Returns the last value of this Tuple or Product. */"} {"signature":"fun < T > Product3 < T , * , * > . first ( ) : T","body":"= this . _1 ( )","docstring":"/** Returns the first value of this Tuple or Product. */"} {"signature":"fun < T > Product3 < * , * , T > . last ( ) : T","body":"= this . _3 ( )","docstring":"/** Returns the last value of this Tuple or Product. */"} {"signature":"fun < T > Product4 < T , * , * , * > . first ( ) : T","body":"= this . _1 ( )","docstring":"/** Returns the first value of this Tuple or Product. */"} {"signature":"fun < T > Product4 < * , * , * , T > . last ( ) : T","body":"= this . _4 ( )","docstring":"/** Returns the last value of this Tuple or Product. */"} {"signature":"fun < T > Product5 < T , * , * , * , * > . first ( ) : T","body":"= this . _1 ( )","docstring":"/** Returns the first value of this Tuple or Product. */"} {"signature":"fun < T > Product5 < * , * , * , * , T > . last ( ) : T","body":"= this . _5 ( )","docstring":"/** Returns the last value of this Tuple or Product. */"} {"signature":"fun < T > Product6 < T , * , * , * , * , * > . first ( ) : T","body":"= this . _1 ( )","docstring":"/** Returns the first value of this Tuple or Product. */"} {"signature":"fun < T > Product6 < * , * , * , * , * , T > . last ( ) : T","body":"= this . _6 ( )","docstring":"/** Returns the last value of this Tuple or Product. */"} {"signature":"fun < T > Product7 < T , * , * , * , * , * , * > . first ( ) : T","body":"= this . _1 ( )","docstring":"/** Returns the first value of this Tuple or Product. */"} {"signature":"fun < T > Product7 < * , * , * , * , * , * , T > . last ( ) : T","body":"= this . _7 ( )","docstring":"/** Returns the last value of this Tuple or Product. */"} {"signature":"fun < T > Product8 < T , * , * , * , * , * , * , * > . first ( ) : T","body":"= this . _1 ( )","docstring":"/** Returns the first value of this Tuple or Product. */"} {"signature":"fun < T > Product8 < * , * , * , * , * , * , * , T > . last ( ) : T","body":"= this . _8 ( )","docstring":"/** Returns the last value of this Tuple or Product. */"} {"signature":"fun < T > Product9 < T , * , * , * , * , * , * , * , * > . first ( ) : T","body":"= this . _1 ( )","docstring":"/** Returns the first value of this Tuple or Product. */"} {"signature":"fun < T > Product9 < * , * , * , * , * , * , * , * , T > . last ( ) : T","body":"= this . _9 ( )","docstring":"/** Returns the last value of this Tuple or Product. */"} {"signature":"fun < T > Product10 < T , * , * , * , * , * , * , * , * , * > . first ( ) : T","body":"= this . _1 ( )","docstring":"/** Returns the first value of this Tuple or Product. */"} {"signature":"fun < T > Product10 < * , * , * , * , * , * , * , * , * , T > . last ( ) : T","body":"= this . _10 ( )","docstring":"/** Returns the last value of this Tuple or Product. */"} {"signature":"fun < T > Product11 < T , * , * , * , * , * , * , * , * , * , * > . first ( ) : T","body":"= this . _1 ( )","docstring":"/** Returns the first value of this Tuple or Product. */"} {"signature":"fun < T > Product11 < * , * , * , * , * , * , * , * , * , * , T > . last ( ) : T","body":"= this . _11 ( )","docstring":"/** Returns the last value of this Tuple or Product. */"} {"signature":"fun < T > Product12 < T , * , * , * , * , * , * , * , * , * , * , * > . first ( ) : T","body":"= this . _1 ( )","docstring":"/** Returns the first value of this Tuple or Product. */"} {"signature":"fun < T > Product12 < * , * , * , * , * , * , * , * , * , * , * , T > . last ( ) : T","body":"= this . _12 ( )","docstring":"/** Returns the last value of this Tuple or Product. */"} {"signature":"fun < T > Product13 < T , * , * , * , * , * , * , * , * , * , * , * , * > . first ( ) : T","body":"= this . _1 ( )","docstring":"/** Returns the first value of this Tuple or Product. */"} {"signature":"fun < T > Product13 < * , * , * , * , * , * , * , * , * , * , * , * , T > . last ( ) : T","body":"= this . _13 ( )","docstring":"/** Returns the last value of this Tuple or Product. */"} {"signature":"fun < T > Product14 < T , * , * , * , * , * , * , * , * , * , * , * , * , * > . first ( ) : T","body":"= this . _1 ( )","docstring":"/** Returns the first value of this Tuple or Product. */"} {"signature":"fun < T > Product14 < * , * , * , * , * , * , * , * , * , * , * , * , * , T > . last ( ) : T","body":"= this . _14 ( )","docstring":"/** Returns the last value of this Tuple or Product. */"} {"signature":"fun < T > Product15 < T , * , * , * , * , * , * , * , * , * , * , * , * , * , * > . first ( ) : T","body":"= this . _1 ( )","docstring":"/** Returns the first value of this Tuple or Product. */"} {"signature":"fun < T > Product15 < * , * , * , * , * , * , * , * , * , * , * , * , * , * , T > . last ( ) : T","body":"= this . _15 ( )","docstring":"/** Returns the last value of this Tuple or Product. */"} {"signature":"fun < T > Product16 < T , * , * , * , * , * , * , * , * , * , * , * , * , * , * , * > . first ( ) : T","body":"= this . _1 ( )","docstring":"/** Returns the first value of this Tuple or Product. */"} {"signature":"fun < T > Product16 < * , * , * , * , * , * , * , * , * , * , * , * , * , * , * , T > . last ( ) : T","body":"= this . _16 ( )","docstring":"/** Returns the last value of this Tuple or Product. */"} {"signature":"fun < T > Product17 < T , * , * , * , * , * , * , * , * , * , * , * , * , * , * , * , * > . first ( ) : T","body":"= this . _1 ( )","docstring":"/** Returns the first value of this Tuple or Product. */"} {"signature":"fun < T > Product17 < * , * , * , * , * , * , * , * , * , * , * , * , * , * , * , * , T > . last ( ) : T","body":"= this . _17 ( )","docstring":"/** Returns the last value of this Tuple or Product. */"} {"signature":"fun < T > Product18 < T , * , * , * , * , * , * , * , * , * , * , * , * , * , * , * , * , * > . first ( ) : T","body":"= this . _1 ( )","docstring":"/** Returns the first value of this Tuple or Product. */"} {"signature":"fun < T > Product18 < * , * , * , * , * , * , * , * , * , * , * , * , * , * , * , * , * , T > . last ( ) : T","body":"= this . _18 ( )","docstring":"/** Returns the last value of this Tuple or Product. */"} {"signature":"fun < T > Product19 < T , * , * , * , * , * , * , * , * , * , * , * , * , * , * , * , * , * , * > . first ( ) : T","body":"= this . _1 ( )","docstring":"/** Returns the first value of this Tuple or Product. */"} {"signature":"fun < T > Product19 < * , * , * , * , * , * , * , * , * , * , * , * , * , * , * , * , * , * , T > . last ( ) : T","body":"= this . _19 ( )","docstring":"/** Returns the last value of this Tuple or Product. */"} {"signature":"fun < T > Product20 < T , * , * , * , * , * , * , * , * , * , * , * , * , * , * , * , * , * , * , * > . first ( ) : T","body":"= this . _1 ( )","docstring":"/** Returns the first value of this Tuple or Product. */"} {"signature":"fun < T > Product20 < * , * , * , * , * , * , * , * , * , * , * , * , * , * , * , * , * , * , * , T > . last ( ) : T","body":"= this . _20 ( )","docstring":"/** Returns the last value of this Tuple or Product. */"} {"signature":"fun < T > Product21 < T , * , * , * , * , * , * , * , * , * , * , * , * , * , * , * , * , * , * , * , * > . first ( ) : T","body":"= this . _1 ( )","docstring":"/** Returns the first value of this Tuple or Product. */"} {"signature":"fun < T > Product21 < * , * , * , * , * , * , * , * , * , * , * , * , * , * , * , * , * , * , * , * , T > . last ( ) : T","body":"= this . _21 ( )","docstring":"/** Returns the last value of this Tuple or Product. */"} {"signature":"fun < T > Product22 < T , * , * , * , * , * , * , * , * , * , * , * , * , * , * , * , * , * , * , * , * , * > . first ( ) : T","body":"= this . _1 ( )","docstring":"/** Returns the first value of this Tuple or Product. */"} {"signature":"fun < T > Product22 < * , * , * , * , * , * , * , * , * , * , * , * , * , * , * , * , * , * , * , * , * , T > . last ( ) : T","body":"= this . _22 ( )","docstring":"/** Returns the last value of this Tuple or Product. */"} {"signature":"fun replaceVariables ( str : String , mapping : Map < String , String > , )","body":"= mapping . asSequence ( ) . fold ( str ) { s , template -> s . replace ( \"\" , template . value ) }","docstring":"/**\n * Replace all $ substrings in [str] with corresponding\n * [mapping] values\n */"} {"signature":"public fun useLogger ( logger : KotlinLogger ) : JvmCompilationConfiguration","body":"public fun useLogger ( logger : KotlinLogger ) : JvmCompilationConfiguration","docstring":"/**\n * @see [JvmCompilationConfiguration.logger]\n */"} {"signature":"public fun useKotlinScriptFilenameExtensions ( kotlinScriptExtensions : Collection < String > ) : JvmCompilationConfiguration","body":"public fun useKotlinScriptFilenameExtensions ( kotlinScriptExtensions : Collection < String > ) : JvmCompilationConfiguration","docstring":"/**\n * @see [JvmCompilationConfiguration.kotlinScriptFilenameExtensions]\n */"} {"signature":"public fun makeClasspathSnapshotBasedIncrementalCompilationConfiguration ( ) : ClasspathSnapshotBasedIncrementalJvmCompilationConfiguration","body":"public fun makeClasspathSnapshotBasedIncrementalCompilationConfiguration ( ) : ClasspathSnapshotBasedIncrementalJvmCompilationConfiguration","docstring":"/**\n * Provides a default [ClasspathSnapshotBasedIncrementalJvmCompilationConfiguration] allowing to use it as is or customizing for specific requirements.\n * Could be used as an overview to default values of the options (as they are implementation-specific).\n * @see [useIncrementalCompilation]\n */"} {"signature":"public fun < P : IncrementalCompilationApproachParameters > useIncrementalCompilation ( workingDirectory : File , sourcesChanges : SourcesChanges , approachParameters : P , options : IncrementalJvmCompilationConfiguration < P > , )","body":"{ error ( \"\" ) }","docstring":"/**\n * Configures usage of incremental compilation.\n * @param workingDirectory a working directory for incremental compilation internal state\n * @param sourcesChanges an instance of [SourcesChanges]\n * @param approachParameters an object representing mandatory parameters specific for the selected incremental compilation approach\n * @param options an object representing optional parameters and handles specific for the selected incremental compilation approach\n * @see [makeClasspathSnapshotBasedIncrementalCompilationConfiguration]\n */"} {"signature":"public fun setRootProjectDir ( rootProjectDir : File ) : IncrementalJvmCompilationConfiguration < P >","body":"public fun setRootProjectDir ( rootProjectDir : File ) : IncrementalJvmCompilationConfiguration < P >","docstring":"/**\n * @see [IncrementalJvmCompilationConfiguration.rootProjectDir]\n */"} {"signature":"public fun setBuildDir ( buildDir : File ) : IncrementalJvmCompilationConfiguration < P >","body":"public fun setBuildDir ( buildDir : File ) : IncrementalJvmCompilationConfiguration < P >","docstring":"/**\n * @see [IncrementalJvmCompilationConfiguration.buildDir]\n */"} {"signature":"public fun usePreciseJavaTracking ( value : Boolean ) : IncrementalJvmCompilationConfiguration < P >","body":"public fun usePreciseJavaTracking ( value : Boolean ) : IncrementalJvmCompilationConfiguration < P >","docstring":"/**\n * @see [IncrementalJvmCompilationConfiguration.preciseJavaTrackingEnabled]\n */"} {"signature":"public fun usePreciseCompilationResultsBackup ( value : Boolean ) : IncrementalJvmCompilationConfiguration < P >","body":"public fun usePreciseCompilationResultsBackup ( value : Boolean ) : IncrementalJvmCompilationConfiguration < P >","docstring":"/**\n * @see [IncrementalJvmCompilationConfiguration.preciseCompilationResultsBackupEnabled]\n */"} {"signature":"public fun keepIncrementalCompilationCachesInMemory ( value : Boolean ) : IncrementalJvmCompilationConfiguration < P >","body":"public fun keepIncrementalCompilationCachesInMemory ( value : Boolean ) : IncrementalJvmCompilationConfiguration < P >","docstring":"/**\n * @see [IncrementalJvmCompilationConfiguration.incrementalCompilationCachesKeptInMemory]\n */"} {"signature":"public fun forceNonIncrementalMode ( value : Boolean = true ) : IncrementalJvmCompilationConfiguration < P >","body":"public fun forceNonIncrementalMode ( value : Boolean = true ) : IncrementalJvmCompilationConfiguration < P >","docstring":"/**\n * @see [forcedNonIncrementalMode]\n */"} {"signature":"public fun useOutputDirs ( outputDirs : Collection < File > ) : IncrementalJvmCompilationConfiguration < P >","body":"public fun useOutputDirs ( outputDirs : Collection < File > ) : IncrementalJvmCompilationConfiguration < P >","docstring":"/**\n * @see [IncrementalJvmCompilationConfiguration.outputDirs]]\n */"} {"signature":"public fun assureNoClasspathSnapshotsChanges ( value : Boolean = true ) : ClasspathSnapshotBasedIncrementalJvmCompilationConfiguration","body":"public fun assureNoClasspathSnapshotsChanges ( value : Boolean = true ) : ClasspathSnapshotBasedIncrementalJvmCompilationConfiguration","docstring":"/**\n * @see [assuredNoClasspathSnapshotsChanges]\n */"} {"signature":"internal fun PhaseEngine < NativeGenerationState > . compileModule ( module : IrModuleFragment , bitcodeFile : java . io . File , cExportFiles : CExportFiles ? )","body":"{ runBackendCodegen ( module , cExportFiles ) val checkExternalCalls = context . config . checkStateAtExternalCalls if ( checkExternalCalls ) { runPhase ( CheckExternalCallsPhase ) } newEngine ( context as BitcodePostProcessingContext ) { it . runBitcodePostProcessing ( ) } if ( checkExternalCalls ) { runPhase ( RewriteExternalCallsCheckerGlobals ) } if ( context . config . produce . isFullCache ) { runPhase ( SaveAdditionalCacheInfoPhase ) } runPhase ( WriteBitcodeFilePhase , WriteBitcodeFileInput ( context . llvm . module , bitcodeFile ) ) }","docstring":"/**\n * 1. Runs IR lowerings\n * 2. Runs LTO.\n * 3. Translates IR to LLVM IR.\n * 4. Optimizes it.\n * 5. Serializes it to a bitcode file.\n */"} {"signature":"private fun PhaseEngine < NativeGenerationState > . runCodegen ( module : IrModuleFragment )","body":"{ val optimize = context . shouldOptimize ( ) module . files . forEach { runPhase ( ReturnsInsertionPhase , it ) } val moduleDFG = runPhase ( BuildDFGPhase , module , disable = ! optimize ) val devirtualizationAnalysisResults = runPhase ( DevirtualizationAnalysisPhase , DevirtualizationAnalysisInput ( module , moduleDFG ) , disable = ! optimize ) val dceResult = runPhase ( DCEPhase , DCEInput ( module , moduleDFG , devirtualizationAnalysisResults ) , disable = ! optimize ) runPhase ( RemoveRedundantCallsToStaticInitializersPhase , RedundantCallsInput ( moduleDFG , devirtualizationAnalysisResults , module ) , disable = ! optimize ) runPhase ( DevirtualizationPhase , DevirtualizationInput ( module , devirtualizationAnalysisResults ) , disable = ! optimize ) module . files . forEach { runPhase ( PropertyAccessorInlinePhase , it , disable = ! optimize ) runPhase ( InlineClassPropertyAccessorsPhase , it , disable = ! optimize ) runPhase ( RedundantCoercionsCleaningPhase , it ) runPhase ( UnboxInlinePhase , it , disable = ! optimize ) } runPhase ( CreateLLVMDeclarationsPhase , module ) runPhase ( GHAPhase , module , disable = ! optimize ) runPhase ( RTTIPhase , RTTIInput ( module , dceResult ) ) val lifetimes = runPhase ( EscapeAnalysisPhase , EscapeAnalysisInput ( module , moduleDFG , devirtualizationAnalysisResults ) , disable = ! optimize ) runPhase ( CodegenPhase , CodegenInput ( module , lifetimes ) ) }","docstring":"/**\n * Compile lowered [module] to object file.\n * @return absolute path to object file.\n */"} {"signature":"@ SinceKotlin ( \"\" ) fun KType . withNullability ( nullable : Boolean ) : KType","body":"{ return ( this as KTypeImpl ) . makeNullableAsSpecified ( nullable ) }","docstring":"/**\n * Returns a new type with the same classifier, arguments and annotations as the given type, and with the given nullability.\n */"} {"signature":"@ SinceKotlin ( \"\" ) fun KType . isSubtypeOf ( other : KType ) : Boolean","body":"{ return ( this as KTypeImpl ) . type . isSubtypeOf ( ( other as KTypeImpl ) . type ) }","docstring":"/**\n * Returns `true` if `this` type is the same or is a subtype of [other], `false` otherwise.\n */"} {"signature":"@ SinceKotlin ( \"\" ) fun KType . isSupertypeOf ( other : KType ) : Boolean","body":"{ return other . isSubtypeOf ( this ) }","docstring":"/**\n * Returns `true` if `this` type is the same or is a supertype of [other], `false` otherwise.\n */"} {"signature":"public fun PlotContext . coordFlip ( )","body":"{ plotFeatures [ CoordFlip . FEATURE_NAME ] = CoordFlip }","docstring":"/**\n * Flip the axes of the default coordinate system.\n *\n * After applying this function, the horizontal axis (typically the x-axis) will become vertical,\n * and the vertical axis (typically the y-axis) will become horizontal.\n *\n * > **Warning**: The API `coordFlip` will be revised in future releases.\n *\n * ### Example\n *\n * ```kotlin\n * plot {\n * bars {\n * x(listOf(\"a\", \"b\", \"c\"))\n * y(listOf(4, 3, 5))\n * }\n * coordFlip()\n * }\n * ```\n */"} {"signature":"fun main ( )","body":"{ val out = PrintWriter ( Files . newOutputStream ( TEST_KT ) ) out . println ( GENERATED_COMMENT ) out . println ( \"\" ) out . println ( ) out . println ( \"\" ) out . println ( ) out . println ( \"\" ) val cases = ArrayList < Pair < TestCaseType , Path > > ( ) for ( type in TestCaseType . values ( ) ) { Files . newDirectoryStream ( TEST_DATA_DIR , \"\" ) . use { for ( path in it ) cases += type to path } } cases . sortedBy { it . second . fileName } . forEachIndexed { index , ( type , inFile ) -> if ( index > ) out . println ( ) writeTest ( out , type , inFile ) } out . println ( \"\" ) out . close ( ) }","docstring":"/**\n * Writes [TestDataTest] based on the contents of `testdata` directory.\n */"} {"signature":"fun applyToCompilation ( kotlinCompilation : KotlinCompilation < * > ) : Provider < List < SubpluginOption > >","body":"fun applyToCompilation ( kotlinCompilation : KotlinCompilation < * > ) : Provider < List < SubpluginOption > >","docstring":"/**\n * Configures the compiler plugin to be incorporated into a specific [kotlinCompilation].\n * This function is only called on [kotlinCompilation]s approved by [isApplicable].\n * The [Provider] returned from this function may never get queried if the compilation is avoided in the current build.\n */"} {"signature":"fun getPluginArtifactForNative ( ) : SubpluginArtifact ?","body":"= null","docstring":"/**\n * Legacy Kotlin/Native-specific plugin artifact.\n *\n * It is used only if Gradle is configured not to use Kotlin/Native embeddable compiler jar\n * (with `kotlin.native.useEmbeddableCompilerJar=false` project property).\n *\n * Otherwise, [getPluginArtifact] is used by default.\n */"} {"signature":"@ GCUnsafeCall ( \"\" ) external public actual fun Char . isHighSurrogate ( ) : Boolean","body":"@ GCUnsafeCall ( \"\" ) external public actual 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":"@ GCUnsafeCall ( \"\" ) external public actual fun Char . isLowSurrogate ( ) : Boolean","body":"@ GCUnsafeCall ( \"\" ) external public actual 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":"@ GCUnsafeCall ( \"\" ) external public actual fun Char . isISOControl ( ) : Boolean","body":"@ GCUnsafeCall ( \"\" ) external public actual fun Char . isISOControl ( ) : Boolean","docstring":"/**\n * Returns `true` if this character is an ISO control character.\n *\n * A character is considered to be an ISO control character if its [category] is [CharCategory.CONTROL],\n * meaning the Char is in the range `'\\u0000'..'\\u001F'` or in the range `'\\u007F'..'\\u009F'`.\n *\n * @sample samples.text.Chars.isISOControl\n */"} {"signature":"@ ExperimentalNativeApi public fun Char . Companion . toCodePoint ( high : Char , low : Char ) : Int","body":"= ( ( ( high - MIN_HIGH_SURROGATE ) shl ) or ( low - MIN_LOW_SURROGATE ) ) + ","docstring":"/**\n * Converts a surrogate pair to a unicode code point. Doesn't validate that the characters are a valid surrogate pair.\n *\n * Note that this function is unstable.\n * In the future it could be deprecated in favour of an overload that would return a `CodePoint` type.\n */"} {"signature":"@ ExperimentalNativeApi public fun Char . Companion . isSupplementaryCodePoint ( codepoint : Int ) : Boolean","body":"= codepoint in MIN_SUPPLEMENTARY_CODE_POINT .. MAX_CODE_POINT","docstring":"/**\n * Checks if the codepoint specified is a supplementary codepoint or not.\n *\n * Note that this function is unstable.\n * In the future it could be deprecated in favour of an overload that would accept a `CodePoint` type.\n */"} {"signature":"@ ExperimentalNativeApi public fun Char . Companion . isSurrogatePair ( high : Char , low : Char ) : Boolean","body":"= high . isHighSurrogate ( ) && low . isLowSurrogate ( )","docstring":"/**\n * Checks if the specified [high] and [low] chars are [Char.isHighSurrogate] and [Char.isLowSurrogate] correspondingly.\n */"} {"signature":"@ ExperimentalNativeApi @ Suppress ( \"\" ) public fun Char . Companion . toChars ( codePoint : Int ) : CharArray","body":"= when { codePoint in until MIN_SUPPLEMENTARY_CODE_POINT -> charArrayOf ( codePoint . toChar ( ) ) codePoint in MIN_SUPPLEMENTARY_CODE_POINT .. MAX_CODE_POINT -> { val low = ( ( codePoint - ) and ) + MIN_LOW_SURROGATE . toInt ( ) val high = ( ( ( codePoint - ) ushr ) and ) + MIN_HIGH_SURROGATE . toInt ( ) charArrayOf ( high . toChar ( ) , low . toChar ( ) ) } else -> throw IllegalArgumentException ( ) }","docstring":"/**\n * Converts the codepoint specified to a char array. If the codepoint is not supplementary, the method will\n * return an array with one element otherwise it will return an array A with a high surrogate in A[0] and\n * a low surrogate in A[1].\n *\n *\n * Note that this function is unstable.\n * In the future it could be deprecated in favour of an overload that would accept a `CodePoint` type.\n */"} {"signature":"fun getMainClassName ( ) : String ?","body":"= Throwable ( ) . stackTrace . lastOrNull ( ) ? . className","docstring":"/** Must be called on the main thread, otherwise returns the root class of the worker thread. */"} {"signature":"override fun hashCode ( ) : Int","body":"= super < AbstractMap > . hashCode ( )","docstring":"/**\n * We provide [equals], so as a matter of style, we should also provide [hashCode].\n * However, the implementation from [AbstractMap] is enough.\n */"} {"signature":"fun alert ( msg : String )","body":"{ throw Error ( msg ) }","docstring":"/**\n * A JavaScript implementation of the DeltaBlue constraint-solving\n * algorithm, as described in:\n *\n * \"The DeltaBlue Algorithm: An Incremental Constraint Hierarchy Solver\"\n * Bjorn N. Freeman-Benson and John Maloney\n * January 1990 Communications of the ACM,\n * also available as University of Washington TR 89-08-06.\n *\n * Beware: this benchmark is written in a grotesque style where\n * the constraint model is built by side-effects from constructors.\n * I've kept it this way to avoid deviating too much from the original\n * implementation.\n */"} {"signature":"fun satisfy ( mark : Int , planner : Planner ) : Constraint ?","body":"{ chooseMethod ( mark ) if ( ! isSatisfied ( ) ) { if ( strength == Strength . REQUIRED ) alert ( \"\" ) return null } markInputs ( mark ) val out = this . output ( ) val overridden = out . determinedBy if ( overridden != null ) overridden . markUnsatisfied ( ) out . determinedBy = this if ( ! planner . addPropagate ( this , mark ) ) alert ( \"\" ) out . mark = mark return overridden }","docstring":"/**\n * Attempt to find a way to enforce this constraint. If successful,\n * record the solution, perhaps modifying the current dataflow\n * graph. Answer the constraint that this constraint overrides, if\n * there is one, or nil, if there isn't.\n * Assume: I am not already satisfied.\n */"} {"signature":"open fun isInput ( )","body":"= false","docstring":"/**\n * Normal constraints are not input constraints. An input constraint\n * is one that depends on external state, such as the mouse, the\n * keybord, a clock, or some arbitraty piece of imperative code.\n */"} {"signature":"override fun addToGraph ( )","body":"{ myOutput . addConstraint ( this ) satisfied = false }","docstring":"/**\n * Adds this constraint to the constraint graph\n */"} {"signature":"override fun chooseMethod ( mark : Int )","body":"{ satisfied = ( myOutput . mark != mark ) && Strength . stronger ( strength , myOutput . walkStrength ) }","docstring":"/**\n * Decides if this constraint can be satisfied and records that\n * decision.\n */"} {"signature":"override fun isSatisfied ( )","body":"= satisfied","docstring":"/**\n * Returns true if this constraint is satisfied in the current solution.\n */"} {"signature":"override fun output ( )","body":"= myOutput","docstring":"/**\n * Returns the current output variable.\n */"} {"signature":"override fun recalculate ( )","body":"{ myOutput . walkStrength = strength myOutput . stay = ! isInput ( ) if ( myOutput . stay ) execute ( ) }","docstring":"/**\n * Calculate the walkabout strength, the stay flag, and, if it is\n * 'stay', the value for the current output of this constraint. Assume\n * this constraint is satisfied.\n */"} {"signature":"override fun markUnsatisfied ( )","body":"{ this . satisfied = false }","docstring":"/**\n * Records that this constraint is unsatisfied\n */"} {"signature":"override fun isInput ( )","body":"= true","docstring":"/**\n * Edits indicate that a variable is to be changed by imperative code.\n */"} {"signature":"override fun chooseMethod ( mark : Int )","body":"{ if ( v1 . mark == mark ) { direction = if ( v2 . mark != mark && Strength . stronger ( strength , v2 . walkStrength ) ) Direction . FORWARD else Direction . NONE } if ( v2 . mark == mark ) { direction = if ( v1 . mark != mark && Strength . stronger ( strength , v1 . walkStrength ) ) Direction . BACKWARD else Direction . NONE } if ( Strength . weaker ( v1 . walkStrength , v2 . walkStrength ) ) { direction = if ( Strength . stronger ( strength , v1 . walkStrength ) ) Direction . BACKWARD else Direction . NONE } else { direction = if ( Strength . stronger ( strength , v2 . walkStrength ) ) Direction . FORWARD else Direction . BACKWARD } }","docstring":"/**\n * Decides if this constraint can be satisfied and records that\n * decision.\n */"} {"signature":"override fun addToGraph ( )","body":"{ v1 . addConstraint ( this ) v2 . addConstraint ( this ) direction = Direction . NONE }","docstring":"/**\n * Adds this constraint to the constraint graph\n */"} {"signature":"override fun isSatisfied ( )","body":"= direction != Direction . NONE","docstring":"/**\n * Returns true if this constraint is satisfied in the current solution.\n */"} {"signature":"fun input ( )","body":"= if ( direction == Direction . FORWARD ) v1 else v2","docstring":"/**\n * Returns the current input variable\n */"} {"signature":"override fun output ( )","body":"= if ( direction == Direction . FORWARD ) v2 else v1","docstring":"/**\n * Returns the current output variable.\n */"} {"signature":"override fun recalculate ( )","body":"{ val ihn = input ( ) val out = output ( ) out . walkStrength = Strength . weakestOf ( this . strength , ihn . walkStrength ) out . stay = ihn . stay if ( out . stay ) execute ( ) }","docstring":"/**\n * Calculate the walkabout strength, the stay flag, and, if it is\n * 'stay', the value for the current output of this constraint. Assume\n * this constraint is satisfied.\n */"} {"signature":"override fun markUnsatisfied ( )","body":"{ direction = Direction . NONE }","docstring":"/**\n * Records that this constraint is unsatisfied\n */"} {"signature":"override fun addToGraph ( )","body":"{ super . addToGraph ( ) scale . addConstraint ( this ) offset . addConstraint ( this ) }","docstring":"/**\n * Adds this constraint to the constraint graph\n */"} {"signature":"override fun recalculate ( )","body":"{ val ihn = input ( ) val out = output ( ) out . walkStrength = Strength . weakestOf ( strength , ihn . walkStrength ) out . stay = ihn . stay && scale . stay && offset . stay if ( out . stay ) execute ( ) }","docstring":"/**\n * Calculate the walkabout strength, the stay flag, and, if it is\n * 'stay', the value for the current output of this constraint. Assume\n * this constraint is satisfied.\n */"} {"signature":"fun addConstraint ( c : Constraint )","body":"= constraints . add ( c )","docstring":"/**\n * Add the given constraint to the set of all constraints that refer\n * this variable.\n */"} {"signature":"fun removeConstraint ( c : Constraint )","body":"{ constraints . remove ( c ) if ( determinedBy == c ) determinedBy = null }","docstring":"/**\n * Removes all traces of c from this variable.\n */"} {"signature":"fun add ( c : Constraint )","body":"{ c . addToGraph ( ) incrementalAdd ( c ) }","docstring":"/**\n * Activate the constraint and attempt to satisfy it.\n */"} {"signature":"fun incrementalAdd ( c : Constraint )","body":"{ val mark = newMark ( ) var overridden = c . satisfy ( mark , this ) while ( overridden != null ) overridden = overridden . satisfy ( mark , this ) }","docstring":"/**\n * Attempt to satisfy the given constraint and, if successful,\n * incrementally update the dataflow graph. Details: If satifying\n * the constraint is successful, it may override a weaker constraint\n * on its output. The algorithm attempts to resatisfy that\n * constraint using some other method. This process is repeated\n * until either a) it reaches a variable that was not previously\n * determined by any constraint or b) it reaches a constraint that\n * is too weak to be satisfied using any of its methods. The\n * variables of constraints that have been processed are marked with\n * a unique mark value so that we know where we've been. This allows\n * the algorithm to avoid getting into an infinite loop even if the\n * constraint graph has an inadvertent cycle.\n */"} {"signature":"fun incrementalRemove ( c : Constraint )","body":"{ val out = c . output ( ) c . markUnsatisfied ( ) c . removeFromGraph ( ) var unsatisfied = removePropagateFrom ( out ) var strength = Strength . REQUIRED do { for ( u in unsatisfied ) { if ( u . strength == strength ) this . incrementalAdd ( u ) } strength = strength . nextWeaker ( ) } while ( strength != Strength . WEAKEST ) }","docstring":"/**\n * Entry point for retracting a constraint. Remove the given\n * constraint and incrementally update the dataflow graph.\n * Details: Retracting the given constraint may allow some currently\n * unsatisfiable downstream constraint to be satisfied. We therefore collect\n * a list of unsatisfied downstream constraints and attempt to\n * satisfy each one in turn. This list is traversed by constraint\n * strength, strongest first, as a heuristic for avoiding\n * unnecessarily adding and then overriding weak constraints.\n * Assume: c is satisfied.\n */"} {"signature":"fun newMark ( )","body":"= ++ currentMark","docstring":"/**\n * Select a previously unused mark value.\n */"} {"signature":"fun makePlan ( sources : OrderedCollection < Constraint > ) : Plan","body":"{ var mark = this . newMark ( ) var plan = Plan ( ) var todo = sources while ( todo . size ( ) > ) { var c = todo . removeFirst ( ) if ( c . output ( ) . mark != mark && c . inputsKnown ( mark ) ) { plan . addConstraint ( c ) c . output ( ) . mark = mark addConstraintsConsumingTo ( c . output ( ) , todo ) } } return plan }","docstring":"/**\n * Extract a plan for resatisfaction starting from the given source\n * constraints, usually a set of input constraints. This method\n * assumes that stay optimization is desired the plan will contain\n * only constraints whose output variables are not stay. Constraints\n * that do no computation, such as stay and edit constraints, are\n * not included in the plan.\n * Details: The outputs of a constraint are marked when it is added\n * to the plan under construction. A constraint may be appended to\n * the plan when all its input variables are known. A variable is\n * known if either a) the variable is marked (indicating that has\n * been computed by a constraint appearing earlier in the plan), b)\n * the variable is 'stay' (i.e. it is a constant at plan execution\n * time), or c) the variable is not determined by any\n * constraint. The last provision is for past states of history\n * variables, which are not stay but which are also not computed by\n * any constraint.\n * Assume: sources are all satisfied.\n */"} {"signature":"fun extractPlanFromConstraints ( constraints : OrderedCollection < Constraint > ) : Plan","body":"{ val sources = OrderedCollection < Constraint > ( ) for ( c in constraints ) { if ( c . isInput ( ) && c . isSatisfied ( ) ) sources . add ( c ) } return makePlan ( sources ) }","docstring":"/**\n * Extract a plan for resatisfying starting from the output of the\n * given constraints, usually a set of input constraints.\n */"} {"signature":"fun addPropagate ( c : Constraint , mark : Int ) : Boolean","body":"{ val todo = OrderedCollection < Constraint > ( ) todo . add ( c ) while ( todo . size ( ) > ) { var d = todo . removeFirst ( ) if ( d . output ( ) . mark == mark ) { incrementalRemove ( c ) return false } d . recalculate ( ) addConstraintsConsumingTo ( d . output ( ) , todo ) } return true }","docstring":"/**\n * Recompute the walkabout strengths and stay flags of all variables\n * downstream of the given constraint and recompute the actual\n * values of all variables whose stay flag is true. If a cycle is\n * detected, remove the given constraint and answer\n * false. Otherwise, answer true.\n * Details: Cycles are detected when a marked variable is\n * encountered downstream of the given constraint. The sender is\n * assumed to have marked the inputs of the given constraint with\n * the given mark. Thus, encountering a marked node downstream of\n * the output constraint means that there is a path from the\n * constraint's output to one of its inputs.\n */"} {"signature":"fun removePropagateFrom ( out : Variable ) : OrderedCollection < Constraint >","body":"{ out . determinedBy = null out . walkStrength = Strength . WEAKEST out . stay = true val unsatisfied = OrderedCollection < Constraint > ( ) val todo = OrderedCollection < Variable > ( ) todo . add ( out ) while ( todo . size ( ) > ) { var v = todo . removeFirst ( ) for ( c in v . constraints ) { if ( ! c . isSatisfied ( ) ) unsatisfied . add ( c ) } var determining = v . determinedBy for ( next in v . constraints ) { if ( next != determining && next . isSatisfied ( ) ) { next . recalculate ( ) todo . add ( next . output ( ) ) } } } return unsatisfied }","docstring":"/**\n * Update the walkabout strengths and stay flags of all variables\n * downstream of the given constraint. Answer a collection of\n * unsatisfied constraints sorted in order of decreasing strength.\n */"} {"signature":"fun addConstraint ( c : Constraint )","body":"= v . add ( c )","docstring":"/**\n * Add the given constraint to the set of all constraints that refer\n * this variable.\n */"} {"signature":"fun chainTest ( n : Int )","body":"{ val planner = Planner ( ) val variables = ( .. n ) . map { Variable ( \"\" ) } . toList ( ) var first = variables . first ( ) var last = variables . last ( ) variables . windowed ( ) { ( v1 , v2 ) -> planner . add ( EqualityConstraint ( v1 , v2 , Strength . REQUIRED ) ) } planner . add ( StayConstraint ( last , Strength . STRONG_DEFAULT ) ) val edit = EditConstraint ( first , Strength . PREFERRED ) planner . add ( edit ) val edits = OrderedCollection < Constraint > ( ) edits . add ( edit ) val plan = planner . extractPlanFromConstraints ( edits ) for ( i in until ) { first . value = i plan . execute ( ) if ( last . value != i ) alert ( \"\" ) } }","docstring":"/**\n * This is the standard DeltaBlue benchmark. A long chain of equality\n * constraints is constructed with a stay constraint on one end. An\n * edit constraint is then added to the opposite end and the time is\n * measured for adding and removing this constraint, and extracting\n * and executing a constraint satisfaction plan. There are two cases.\n * In case 1, the added constraint is stronger than the stay\n * constraint and values must propagate down the entire length of the\n * chain. In case 2, the added constraint is weaker than the stay\n * constraint so it cannot be accomodated. The cost in this case is,\n * of course, very low. Typical situations lie somewhere between these\n * two extremes.\n */"} {"signature":"fun projectionTest ( n : Int )","body":"{ val planner = Planner ( ) var scale = Variable ( \"\" , ) var offset = Variable ( \"\" , ) var src : Variable ? = null var dst : Variable ? = null var dests = OrderedCollection < Variable > ( ) for ( i in until n ) { src = Variable ( \"\" , i ) dst = Variable ( \"\" , i ) dests . add ( dst ) planner . add ( StayConstraint ( src , Strength . NORMAL ) ) planner . add ( ScaleConstraint ( src , scale , offset , dst , Strength . REQUIRED ) ) } planner . change ( src ! ! , ) if ( dst ! ! . value != ) alert ( \"\" ) planner . change ( dst , ) if ( src . value != ) alert ( \"\" ) planner . change ( scale , ) for ( i in until n - ) { if ( dests . at ( i ) . value != i * + ) alert ( \"\" ) } planner . change ( offset , ) for ( i in until n - ) { if ( dests . at ( i ) . value != i * + ) alert ( \"\" ) } }","docstring":"/**\n * This test constructs a two sets of variables related to each\n * other by a simple linear transformation (scale and offset). The\n * time is measured to change a variable on either side of the\n * mapping and to change the scale and offset factors.\n */"} {"signature":"fun IrFunctionSymbol . findAnnotatedFunction ( testAnnotation : FqName ) : IrFunctionSymbol ?","body":"{ val owner = this . owner val parent = owner . parent if ( parent is IrClass && parent . isInterface ) { return null } if ( hasAnnotation ( testAnnotation ) ) { return this } return ( owner as? IrSimpleFunction ) ? . overriddenSymbols ? . firstNotNullOfOrNull { it . findAnnotatedFunction ( testAnnotation ) } }","docstring":"/**\n * Checks if [this] or any of its parent functions has the annotation with the given [testAnnotation].\n * If [this] contains the given annotation, returns [this].\n * If one of the parent functions contains the given annotation, returns the [IrFunctionSymbol] for it.\n * If the annotation isn't found or found only in interface methods, returns null.\n */"} {"signature":"private fun buildObjectGetter ( objectSymbol : IrClassSymbol , owner : IrClass , getterName : Name ) : IrSimpleFunction","body":"= context . irFactory . createSimpleFunction ( owner . startOffset , owner . endOffset , TEST_SUITE_GENERATED_MEMBER , getterName , DescriptorVisibilities . PROTECTED , isInline = false , isExpect = false , objectSymbol . starProjectedType , Modality . FINAL , IrSimpleFunctionSymbolImpl ( ) , isTailrec = false , isSuspend = false , isOperator = false , isInfix = false , ) . apply { parent = owner val superFunction = baseClassSuite . simpleFunctions ( ) . single { it . name == getterName && it . valueParameters . isEmpty ( ) } createDispatchReceiverParameter ( ) overriddenSymbols += superFunction . symbol body = context . createIrBuilder ( symbol , symbol . owner . startOffset , symbol . owner . endOffset ) . irBlockBody { + irReturn ( irGetObjectValue ( objectSymbol . typeWithArguments ( emptyList ( ) ) , objectSymbol ) ) } }","docstring":"/**\n * Builds a method in `[owner]` class with name `[getterName]`\n * returning a reference to an object represented by `[objectSymbol]`.\n */"} {"signature":"private fun buildInstanceGetter ( classSymbol : IrClassSymbol , owner : IrClass , getterName : Name ) : IrSimpleFunction","body":"= context . irFactory . createSimpleFunction ( owner . startOffset , owner . endOffset , TEST_SUITE_GENERATED_MEMBER , getterName , DescriptorVisibilities . PROTECTED , isInline = false , isExpect = false , classSymbol . starProjectedType , Modality . FINAL , IrSimpleFunctionSymbolImpl ( ) , isTailrec = false , isSuspend = false , isOperator = false , isInfix = false , ) . apply { parent = owner val superFunction = baseClassSuite . simpleFunctions ( ) . single { it . name == getterName && it . valueParameters . isEmpty ( ) } createDispatchReceiverParameter ( ) overriddenSymbols += superFunction . symbol body = context . createIrBuilder ( symbol , symbol . owner . startOffset , symbol . owner . endOffset ) . irBlockBody { val constructor = classSymbol . owner . constructors . single { it . valueParameters . isEmpty ( ) } + irReturn ( irCall ( constructor ) ) } }","docstring":"/**\n * Builds a method in `[testSuite]` class with name `[getterName]`\n * returning a new instance of class referenced by [classSymbol].\n */"} {"signature":"private fun buildClassSuiteConstructor ( suiteName : String , testClassType : IrType , testCompanionType : IrType , testSuite : IrClassSymbol , owner : IrClass , functions : Collection < TestFunction > , ignored : Boolean ) : IrConstructor","body":"= context . irFactory . createConstructor ( testSuite . owner . startOffset , testSuite . owner . endOffset , TEST_SUITE_GENERATED_MEMBER , Name . special ( \">\" ) , DescriptorVisibilities . PUBLIC , isInline = false , isExpect = false , testSuite . starProjectedType , IrConstructorSymbolImpl ( ) , isPrimary = true , ) . apply { parent = owner fun IrClass . getFunction ( name : String , predicate : ( IrSimpleFunction ) -> Boolean ) = simpleFunctions ( ) . single { it . name . asString ( ) == name && predicate ( it ) } val registerTestCase = baseClassSuite . getFunction ( \"\" ) { it . valueParameters . size == && it . valueParameters [ ] . type . isString ( ) && it . valueParameters [ ] . type . isFunction ( ) && it . valueParameters [ ] . type . isBoolean ( ) } val registerFunction = baseClassSuite . getFunction ( \"\" ) { it . valueParameters . size == && it . valueParameters [ ] . type . isTestFunctionKind ( ) && it . valueParameters [ ] . type . isFunction ( ) } body = context . createIrBuilder ( symbol , symbol . owner . startOffset , symbol . owner . endOffset ) . irBlockBody { + irDelegatingConstructorCall ( baseClassSuiteConstructor ) . apply { putTypeArgument ( , testClassType ) putTypeArgument ( , testCompanionType ) putValueArgument ( , irString ( suiteName ) ) putValueArgument ( , irBoolean ( ignored ) ) } generateFunctionRegistration ( testSuite . owner . thisReceiver ! ! , registerTestCase , registerFunction , functions ) } }","docstring":"/**\n * Builds a constructor for a test suite class representing a test class (any class in the original IrFile with\n * method(s) annotated with @Test). The test suite class is a subclass of ClassTestSuite\n * where T is the test class.\n */"} {"signature":"private fun buildClassSuite ( suiteName : String , testClass : IrClass , testCompanion : IrClass ? , functions : Collection < TestFunction > , irFile : IrFile ) : IrClass","body":"{ return context . irFactory . createClass ( testClass . startOffset , testClass . endOffset , TEST_SUITE_CLASS , testClass . name . synthesizeSuiteClassName ( ) , DescriptorVisibilities . PRIVATE , IrClassSymbolImpl ( ) , ClassKind . CLASS , Modality . FINAL , ) . apply { irFile . addChild ( this ) createParameterDeclarations ( ) val testClassType = testClass . defaultType val testCompanionType = if ( testClass . kind == ClassKind . OBJECT ) { testClassType } else { testCompanion ? . defaultType ? : context . irBuiltIns . nothingType } val constructor = buildClassSuiteConstructor ( suiteName , testClassType , testCompanionType , symbol , this , functions , testClass . ignored ) val instanceGetter : IrFunction val companionGetter : IrFunction ? if ( testClass . kind == ClassKind . OBJECT ) { instanceGetter = buildObjectGetter ( testClass . symbol , this , INSTANCE_GETTER_NAME ) companionGetter = buildObjectGetter ( testClass . symbol , this , COMPANION_GETTER_NAME ) } else { instanceGetter = buildInstanceGetter ( testClass . symbol , this , INSTANCE_GETTER_NAME ) companionGetter = testCompanion ? . let { buildObjectGetter ( it . symbol , this , COMPANION_GETTER_NAME ) } } declarations += constructor declarations += instanceGetter companionGetter ? . let { declarations += it } superTypes += symbols . baseClassSuite . typeWith ( listOf ( testClassType , testCompanionType ) ) addFakeOverrides ( context . typeSystem ) } }","docstring":"/**\n * Builds a test suite class representing a test class (any class in the original IrFile with method(s)\n * annotated with @Test). The test suite class is a subclass of ClassTestSuite where T is the test class.\n */"} {"signature":"private fun checkTopLevelSuiteName ( irFile : IrFile , topLevelSuiteName : String ) : Boolean","body":"{ if ( topLevelSuiteNames . contains ( topLevelSuiteName ) ) { context . reportCompilationError ( \"\" + \"\" ) } topLevelSuiteNames . add ( topLevelSuiteName ) return true }","docstring":"/** Check if this fqName already used or not. */"} {"signature":"internal open fun cancelCompletedResult ( takenState : Any ? , cause : Throwable )","body":"{ }","docstring":"/**\n * Called when this task was cancelled while it was being dispatched.\n */"} {"signature":"@ Suppress ( \"\" ) internal open fun < T > getSuccessfulResult ( state : Any ? ) : T","body":"= state as T","docstring":"/**\n * There are two implementations of `DispatchedTask`:\n * - [DispatchedContinuation] keeps only simple values as successfully results.\n * - [CancellableContinuationImpl] keeps additional data with values and overrides this method to unwrap it.\n */"} {"signature":"internal open fun getExceptionalResult ( state : Any ? ) : Throwable ?","body":"= ( state as? CompletedExceptionally ) ? . cause","docstring":"/**\n * There are two implementations of `DispatchedTask`:\n * - [DispatchedContinuation] is just an intermediate storage that stores the exception that has its stack-trace\n * properly recovered and is ready to pass to the [delegate] continuation directly.\n * - [CancellableContinuationImpl] stores raw cause of the failure in its state; when it needs to be dispatched\n * its stack-trace has to be recovered, so it overrides this method for that purpose.\n */"} {"signature":"internal fun handleFatalException ( exception : Throwable ? , finallyException : Throwable ? )","body":"{ if ( exception === null && finallyException === null ) return if ( exception !== null && finallyException !== null ) { exception . addSuppressed ( finallyException ) } val cause = exception ? : finallyException val reason = CoroutinesInternalError ( \"\" + \"\" , cause ! ! ) handleCoroutineException ( this . delegate . context , reason ) }","docstring":"/**\n * Machinery that handles fatal exceptions in kotlinx.coroutines.\n * There are two kinds of fatal exceptions:\n *\n * 1) Exceptions from kotlinx.coroutines code. Such exceptions indicate that either\n * the library or the compiler has a bug that breaks internal invariants.\n * They usually have specific workarounds, but require careful study of the cause and should\n * be reported to the maintainers and fixed on the library's side anyway.\n *\n * 2) Exceptions from [ThreadContextElement.updateThreadContext] and [ThreadContextElement.restoreThreadContext].\n * While a user code can trigger such exception by providing an improper implementation of [ThreadContextElement],\n * we can't ignore it because it may leave coroutine in the inconsistent state.\n * If you encounter such exception, you can either disable this context element or wrap it into\n * another context element that catches all exceptions and handles it in the application specific manner.\n *\n * Fatal exception handling can be intercepted with [CoroutineExceptionHandler] element in the context of\n * a failed coroutine, but such exceptions should be reported anyway.\n */"} {"signature":"fun taskNameForKotlinModule ( moduleName : String ) : String","body":"= lowerCamelCaseName ( defaultTaskName , moduleName )","docstring":"/**\n * The name of the default [FromKpmModule] task of the given [GradleKpmModule]'s name\n */"} {"signature":"@ ExperimentalNativeApi public fun < T > MutableList < T > . replaceAll ( transformation : ( T ) -> T )","body":"{ val it = listIterator ( ) while ( it . hasNext ( ) ) { val element = it . next ( ) it . set ( transformation ( element ) ) } }","docstring":"/**\n * Replaces each element in the list with a result of a transformation specified.\n */"} {"signature":"internal fun ExpectActualMatchingContext < * > . areEnumConstructors ( expectDeclaration : CallableSymbolMarker , actualDeclaration : CallableSymbolMarker , expectContainingClass : RegularClassSymbolMarker ? , actualContainingClass : RegularClassSymbolMarker ? , ) : Boolean","body":"= expectContainingClass ? . classKind == ClassKind . ENUM_CLASS && actualContainingClass ? . classKind == ClassKind . ENUM_CLASS && expectDeclaration is ConstructorSymbolMarker && actualDeclaration is ConstructorSymbolMarker","docstring":"/**\n * In terms of KMP, there is no such thing as `expect constructor` for enums,\n * but they are physically exist in FIR and IR, so we need to skip matching and checking for them\n */"} {"signature":"@ Benchmark fun removeAll_All ( ) : PersistentList < String >","body":"{ return persistentList . removeAll ( truePredicate ) }","docstring":"/** Removes all elements. */"} {"signature":"@ Benchmark fun removeAll_Non ( ) : PersistentList < String >","body":"{ return persistentList . removeAll ( falsePredicate ) }","docstring":"/** Removes no elements. */"} {"signature":"@ Benchmark fun removeAll_RandomHalf ( ) : PersistentList < String >","body":"{ return persistentList . removeAll ( randomHalfElementsPredicate ) }","docstring":"/** Removes half of the elements randomly selected. */"} {"signature":"@ Benchmark fun removeAll_RandomTen ( ) : PersistentList < String >","body":"{ return persistentList . removeAll ( randomTenElementsPredicate ) }","docstring":"/** Removes 10 random elements. */"} {"signature":"@ Benchmark fun removeAll_RandomOne ( ) : PersistentList < String >","body":"{ return persistentList . removeAll ( randomOneElementPredicate ) }","docstring":"/** Removes a random element. */"} {"signature":"@ Benchmark fun removeAll_Tail ( ) : PersistentList < String >","body":"{ return persistentList . removeAll ( tailElementsPredicate ) }","docstring":"/** Removes last [tailSize] elements. */"} {"signature":"public fun < T > DataRow < T > . diff ( firstRowResult : Long , expression : RowExpression < T , Long > ) : Long","body":"= prev ( ) ? . let { p -> expression ( this , this ) - expression ( p , p ) } ? : firstRowResult","docstring":"/**\n * @include [DiffDocs]\n */"} {"signature":"public fun < T > DataRow < T > . diff ( firstRowResult : Float , expression : RowExpression < T , Float > ) : Float","body":"= prev ( ) ? . let { p -> expression ( this , this ) - expression ( p , p ) } ? : firstRowResult","docstring":"/**\n * @include [DiffDocs]\n */"} {"signature":"public fun < T > DataRow < T > . diffOrNull ( expression : RowExpression < T , Int > ) : Int ?","body":"= prev ( ) ? . let { p -> expression ( this , this ) - expression ( p , p ) }","docstring":"/**\n * @include [DiffOrNullDocs]\n */"} {"signature":"public fun < T > DataRow < T > . diffOrNull ( expression : RowExpression < T , Long > ) : Long ?","body":"= prev ( ) ? . let { p -> expression ( this , this ) - expression ( p , p ) }","docstring":"/**\n * @include [DiffOrNullDocs]\n */"} {"signature":"public fun < T > DataRow < T > . diffOrNull ( expression : RowExpression < T , Float > ) : Float ?","body":"= prev ( ) ? . let { p -> expression ( this , this ) - expression ( p , p ) }","docstring":"/**\n * @include [DiffOrNullDocs]\n */"} {"signature":"private inline fun < reified S : FirCallableSymbol < * > > computeBaseSymbolsWithContainingClass ( klass : FirClass , originalSymbol : S , directOverridden : FirTypeScope . ( S ) -> List < S > , processOverridden : FirTypeScope . ( S , ( S ) -> ProcessorAction ) -> ProcessorAction ) : List < Pair < S , ConeClassLikeLookupTag > >","body":"{ val scope = klass . unsubstitutedScope ( c ) val classLookupTag = klass . symbol . toLookupTag ( ) val overriddenFirSymbols = computeBaseSymbols ( originalSymbol , directOverridden , scope , classLookupTag ) val typeContext = session . typeContext val overriddenPerSupertype = setMultimapOf < ConeClassLikeLookupTag , S > ( ) with ( typeContext ) { for ( symbol in overriddenFirSymbols ) { val symbolDispatchReceiver = symbol . containingClassLookupTag ( ) ? : continue for ( superType in klass . superConeTypes ) { val compatibleType = superType . anySuperTypeConstructor { it . typeConstructor ( ) == symbolDispatchReceiver } if ( ! compatibleType ) { continue } overriddenPerSupertype . put ( superType . lookupTag , symbol ) } } } val result = overriddenPerSupertype . map { ( superType , overridden ) -> val chosenOverridden = when ( overridden . size ) { -> shouldNotBeCalled ( ) -> overridden . first ( ) else -> chooseMostSpecificOverridden ( superType , overridden , processOverridden ) } chosenOverridden to superType } return result }","docstring":"/**\n * This functions takes a list of overridden symbols and associate each one with one of the supertypes, from which this symbol came\n * from. This mapping will be used later to generate proper fake-overrides in IR\n *\n * ```\n * open class A {\n * fun foo() {}\n * }\n *\n * interface B\n *\n * open class C : A()\n *\n * class D : C(), B {\n * override fun foo() {}\n * }\n * ```\n *\n * In this example FIR returns that `C.foo` overrides `A.foo`\n * But in IR there are fake-overrides on each level of the hierarchy, so we need to associate `A.foo` with class `C`,\n * so later it will be converted to IR f/o `B.foo`\n * To understand that we should choose `C` here instead of `B`, we check if the dispatch receiver of the overridden is supertype\n * of each of supertypes (here `A` from `A.foo` is not supertype of `B`, so supertype `B` is discarded)\n *\n * There might be some cases when the same overridden function is accessible from multiple supertypes.\n * Note that this example is simplified, and actually requires java classes on the way (see KT-65592)\n *\n * ```\n * interface A {\n * fun foo()\n * }\n *\n * open class AImpl : A {\n * override fun foo() {}\n * }\n *\n * interface B : A\n * open class BImpl : AImpl(), B\n *\n * interface C : B\n * class CImpl : BImpl(), C\n * ```\n *\n * Here we have f/o `CImpl.foo` function, which overrides `A.foo` and `AImpl.foo` from FIR point of view\n * `AImpl.foo` matches only with supertype `BImpl`\n * But receiver of `A.foo` is a supertype both of `BImpl` and `C`, which leads to the situation, when there are two different base\n * overridden functions matches `BImpl` supertype\n * To resolve this ambiguity (which one choose, `A.foo` or `AImpl.foo`), we need to understand, which of those functions override\n * all other candidates (see [chooseMostSpecificOverridden] function) and leave only `AImpl.foo`\n */"} {"signature":"@ ExperimentalNativeApi public fun ByteArray . getUByteAt ( index : Int ) : UByte","body":"= UByte ( get ( index ) )","docstring":"/**\n * Gets [UByte] out of the [ByteArray] byte buffer at specified index [index]\n * @throws IndexOutOfBoundsException if [index] is outside of array boundaries.\n */"} {"signature":"@ ExperimentalNativeApi @ GCUnsafeCall ( \"\" ) public external fun ByteArray . getCharAt ( index : Int ) : Char","body":"@ ExperimentalNativeApi @ GCUnsafeCall ( \"\" ) public external fun ByteArray . getCharAt ( index : Int ) : Char","docstring":"/**\n * Gets [Char] out of the [ByteArray] byte buffer at specified index [index]\n * @throws IndexOutOfBoundsException if [index] is outside of array boundaries.\n */"} {"signature":"@ ExperimentalNativeApi @ GCUnsafeCall ( \"\" ) public external fun ByteArray . getShortAt ( index : Int ) : Short","body":"@ ExperimentalNativeApi @ GCUnsafeCall ( \"\" ) public external fun ByteArray . getShortAt ( index : Int ) : Short","docstring":"/**\n * Gets [Short] out of the [ByteArray] byte buffer at specified index [index]\n * @throws IndexOutOfBoundsException if [index] is outside of array boundaries.\n */"} {"signature":"@ ExperimentalNativeApi @ GCUnsafeCall ( \"\" ) @ ExperimentalUnsignedTypes public external fun ByteArray . getUShortAt ( index : Int ) : UShort","body":"@ ExperimentalNativeApi @ GCUnsafeCall ( \"\" ) @ ExperimentalUnsignedTypes public external fun ByteArray . getUShortAt ( index : Int ) : UShort","docstring":"/**\n * Gets [UShort] out of the [ByteArray] byte buffer at specified index [index]\n * @throws IndexOutOfBoundsException if [index] is outside of array boundaries.\n */"} {"signature":"@ ExperimentalNativeApi @ GCUnsafeCall ( \"\" ) public external fun ByteArray . getIntAt ( index : Int ) : Int","body":"@ ExperimentalNativeApi @ GCUnsafeCall ( \"\" ) public external fun ByteArray . getIntAt ( index : Int ) : Int","docstring":"/**\n * Gets [Int] out of the [ByteArray] byte buffer at specified index [index]\n * @throws IndexOutOfBoundsException if [index] is outside of array boundaries.\n */"} {"signature":"@ ExperimentalNativeApi @ GCUnsafeCall ( \"\" ) @ ExperimentalUnsignedTypes public external fun ByteArray . getUIntAt ( index : Int ) : UInt","body":"@ ExperimentalNativeApi @ GCUnsafeCall ( \"\" ) @ ExperimentalUnsignedTypes public external fun ByteArray . getUIntAt ( index : Int ) : UInt","docstring":"/**\n * Gets [UInt] out of the [ByteArray] byte buffer at specified index [index]\n * @throws IndexOutOfBoundsException if [index] is outside of array boundaries.\n */"} {"signature":"@ ExperimentalNativeApi @ GCUnsafeCall ( \"\" ) public external fun ByteArray . getLongAt ( index : Int ) : Long","body":"@ ExperimentalNativeApi @ GCUnsafeCall ( \"\" ) public external fun ByteArray . getLongAt ( index : Int ) : Long","docstring":"/**\n * Gets [Long] out of the [ByteArray] byte buffer at specified index [index]\n * @throws IndexOutOfBoundsException if [index] is outside of array boundaries.\n */"} {"signature":"@ ExperimentalNativeApi @ GCUnsafeCall ( \"\" ) @ ExperimentalUnsignedTypes public external fun ByteArray . getULongAt ( index : Int ) : ULong","body":"@ ExperimentalNativeApi @ GCUnsafeCall ( \"\" ) @ ExperimentalUnsignedTypes public external fun ByteArray . getULongAt ( index : Int ) : ULong","docstring":"/**\n * Gets [ULong] out of the [ByteArray] byte buffer at specified index [index]\n * @throws IndexOutOfBoundsException if [index] is outside of array boundaries.\n */"} {"signature":"@ ExperimentalNativeApi @ GCUnsafeCall ( \"\" ) public external fun ByteArray . getFloatAt ( index : Int ) : Float","body":"@ ExperimentalNativeApi @ GCUnsafeCall ( \"\" ) public external fun ByteArray . getFloatAt ( index : Int ) : Float","docstring":"/**\n * Gets [Float] out of the [ByteArray] byte buffer at specified index [index]\n * @throws IndexOutOfBoundsException if [index] is outside of array boundaries.\n */"} {"signature":"@ ExperimentalNativeApi @ GCUnsafeCall ( \"\" ) public external fun ByteArray . getDoubleAt ( index : Int ) : Double","body":"@ ExperimentalNativeApi @ GCUnsafeCall ( \"\" ) public external fun ByteArray . getDoubleAt ( index : Int ) : Double","docstring":"/**\n * Gets [Double] out of the [ByteArray] byte buffer at specified index [index]\n * @throws IndexOutOfBoundsException if [index] is outside of array boundaries.\n */"} {"signature":"@ ExperimentalNativeApi @ GCUnsafeCall ( \"\" ) public external fun ByteArray . setUByteAt ( index : Int , value : UByte )","body":"@ ExperimentalNativeApi @ GCUnsafeCall ( \"\" ) public external fun ByteArray . setUByteAt ( index : Int , value : UByte )","docstring":"/**\n * Sets [UByte] out of the [ByteArray] byte buffer at specified index [index]\n * @throws IndexOutOfBoundsException if [index] is outside of array boundaries.\n */"} {"signature":"@ ExperimentalNativeApi @ GCUnsafeCall ( \"\" ) public external fun ByteArray . setCharAt ( index : Int , value : Char )","body":"@ ExperimentalNativeApi @ GCUnsafeCall ( \"\" ) public external fun ByteArray . setCharAt ( index : Int , value : Char )","docstring":"/**\n * Sets [Char] out of the [ByteArray] byte buffer at specified index [index]\n * @throws IndexOutOfBoundsException if [index] is outside of array boundaries.\n */"} {"signature":"@ ExperimentalNativeApi @ GCUnsafeCall ( \"\" ) public external fun ByteArray . setShortAt ( index : Int , value : Short )","body":"@ ExperimentalNativeApi @ GCUnsafeCall ( \"\" ) public external fun ByteArray . setShortAt ( index : Int , value : Short )","docstring":"/**\n * Sets [Short] out of the [ByteArray] byte buffer at specified index [index]\n * @throws IndexOutOfBoundsException if [index] is outside of array boundaries.\n */"} {"signature":"@ ExperimentalNativeApi @ GCUnsafeCall ( \"\" ) @ ExperimentalUnsignedTypes public external fun ByteArray . setUShortAt ( index : Int , value : UShort )","body":"@ ExperimentalNativeApi @ GCUnsafeCall ( \"\" ) @ ExperimentalUnsignedTypes public external fun ByteArray . setUShortAt ( index : Int , value : UShort )","docstring":"/**\n * Sets [UShort] out of the [ByteArray] byte buffer at specified index [index]\n * @throws IndexOutOfBoundsException if [index] is outside of array boundaries.\n */"} {"signature":"@ ExperimentalNativeApi @ GCUnsafeCall ( \"\" ) public external fun ByteArray . setIntAt ( index : Int , value : Int )","body":"@ ExperimentalNativeApi @ GCUnsafeCall ( \"\" ) public external fun ByteArray . setIntAt ( index : Int , value : Int )","docstring":"/**\n * Sets [Int] out of the [ByteArray] byte buffer at specified index [index]\n * @throws IndexOutOfBoundsException if [index] is outside of array boundaries.\n */"} {"signature":"@ ExperimentalNativeApi @ GCUnsafeCall ( \"\" ) public external fun ByteArray . setUIntAt ( index : Int , value : UInt )","body":"@ ExperimentalNativeApi @ GCUnsafeCall ( \"\" ) public external fun ByteArray . setUIntAt ( index : Int , value : UInt )","docstring":"/**\n * Sets [UInt] out of the [ByteArray] byte buffer at specified index [index]\n * @throws IndexOutOfBoundsException if [index] is outside of array boundaries.\n */"} {"signature":"@ ExperimentalNativeApi @ GCUnsafeCall ( \"\" ) public external fun ByteArray . setLongAt ( index : Int , value : Long )","body":"@ ExperimentalNativeApi @ GCUnsafeCall ( \"\" ) public external fun ByteArray . setLongAt ( index : Int , value : Long )","docstring":"/**\n * Sets [Long] out of the [ByteArray] byte buffer at specified index [index]\n * @throws IndexOutOfBoundsException if [index] is outside of array boundaries.\n */"} {"signature":"@ ExperimentalNativeApi @ GCUnsafeCall ( \"\" ) @ ExperimentalUnsignedTypes public external fun ByteArray . setULongAt ( index : Int , value : ULong )","body":"@ ExperimentalNativeApi @ GCUnsafeCall ( \"\" ) @ ExperimentalUnsignedTypes public external fun ByteArray . setULongAt ( index : Int , value : ULong )","docstring":"/**\n * Sets [ULong] out of the [ByteArray] byte buffer at specified index [index]\n * @throws IndexOutOfBoundsException if [index] is outside of array boundaries.\n */"} {"signature":"@ ExperimentalNativeApi @ GCUnsafeCall ( \"\" ) public external fun ByteArray . setFloatAt ( index : Int , value : Float )","body":"@ ExperimentalNativeApi @ GCUnsafeCall ( \"\" ) public external fun ByteArray . setFloatAt ( index : Int , value : Float )","docstring":"/**\n * Sets [Float] out of the [ByteArray] byte buffer at specified index [index]\n * @throws IndexOutOfBoundsException if [index] is outside of array boundaries.\n */"} {"signature":"@ ExperimentalNativeApi @ GCUnsafeCall ( \"\" ) public external fun ByteArray . setDoubleAt ( index : Int , value : Double )","body":"@ ExperimentalNativeApi @ GCUnsafeCall ( \"\" ) public external fun ByteArray . setDoubleAt ( index : Int , value : Double )","docstring":"/**\n * Sets [Double] out of the [ByteArray] byte buffer at specified index [index]\n * @throws IndexOutOfBoundsException if [index] is outside of array boundaries.\n */"} {"signature":"fun getOutputLines ( withErrors : Boolean = false ) : List < String >","body":"= getResult ( withErrors , handleError = true ) . outputLines","docstring":"/**\n * If withErrors is true then output from error stream will be added\n */"} {"signature":"fun create ( ) : EvaluatedConstTracker","body":"{ return DefaultEvaluatedConstTracker ( ) }","docstring":"/**\n * Right now there are two places where we want to create this tracker.\n * 1. Right before `fir2ir` phase. We need to store evaluated values to use them later in const value serialization.\n * 2. In tests for K1 IR. This is needed ONLY for tests to log results of interpretation on lowering level.\n */"} {"signature":"@ ExternalKotlinTargetApi fun < T : DecoratedExternalKotlinCompilation > DecoratedExternalKotlinTarget . createCompilation ( descriptor : ExternalKotlinCompilationDescriptor < T > , ) : T","body":"{ val compilationImplFactory = KotlinCompilationImplFactory ( compilerOptionsFactory = when ( platformType ) { KotlinPlatformType . common -> KotlinMultiplatformCommonCompilerOptionsFactory KotlinPlatformType . jvm -> KotlinJvmCompilerOptionsFactory KotlinPlatformType . androidJvm -> KotlinJvmCompilerOptionsFactory KotlinPlatformType . js -> KotlinJsCompilerOptionsFactory KotlinPlatformType . native -> KotlinNativeCompilerOptionsFactory KotlinPlatformType . wasm -> KotlinMultiplatformCommonCompilerOptionsFactory } , compilationSourceSetsContainerFactory = { _ , _ -> KotlinCompilationSourceSetsContainer ( descriptor . defaultSourceSet ) } , compilationTaskNamesContainerFactory = { target , compilationName -> val default = DefaultKotlinCompilationTaskNamesContainerFactory . create ( target , compilationName ) default . copy ( compileTaskName = descriptor . compileTaskName ? : default . compileTaskName , compileAllTaskName = descriptor . compileAllTaskName ? : default . compileAllTaskName ) } , compilationAssociator = @ Suppress ( \"\" ) KotlinCompilationAssociator { _ , first , second -> descriptor . compilationAssociator . associate ( first . decoratedInstance as T , second . decoratedInstance as DecoratedExternalKotlinCompilation ) } , compilationFriendPathsResolver = DefaultKotlinCompilationFriendPathsResolver ( DefaultKotlinCompilationFriendPathsResolver . FriendArtifactResolver . composite ( DefaultKotlinCompilationFriendPathsResolver . DefaultFriendArtifactResolver , descriptor . friendArtifactResolver ? . let { declaredResolver -> DefaultKotlinCompilationFriendPathsResolver . FriendArtifactResolver { compilation -> @ Suppress ( \"\" ) declaredResolver . resolveFriendPaths ( compilation . decoratedInstance as T ) } } ) ) ) val compilationImpl = compilationImplFactory . create ( this , descriptor . compilationName ) val decoratedCompilation = descriptor . compilationFactory . create ( Delegate ( compilationImpl ) ) decoratedCompilation . sourceSetTreeClassifier = descriptor . sourceSetTreeClassifierV2 ? : @ Suppress ( \"\" ) SourceSetTreeClassifierWrapper ( descriptor . sourceSetTreeClassifier ) descriptor . configure ? . invoke ( decoratedCompilation ) this . delegate . compilations . add ( decoratedCompilation ) setupCompileTask ( decoratedCompilation ) return decoratedCompilation }","docstring":"/**\n * Creates a compilation for External Kotlin Targets adhering to the configuration provided in the [descriptor]\n * - The _kind_ of compilation will be chosen automatically by the specified [DecoratedExternalKotlinTarget.platformType]\n * - The compilation will use the [ExternalKotlinCompilationDescriptor.defaultSourceSet] as its (default) source set\n * - The compilation wil reference the compile task using the [ExternalKotlinCompilationDescriptor.compileTaskName] if specified\n * - The compilation will reference the compile all task name using the[ExternalKotlinCompilationDescriptor.compileAllTaskName] if specified\n * - Compilations .associateWith calls will be handled by the [ExternalKotlinCompilationDescriptor.compilationAssociator] if specified\n * - An additional friendArtifactResolver will be respected if the [ExternalKotlinCompilationDescriptor.friendArtifactResolver] is specified\n * - The [ExternalKotlinCompilationDescriptor.configure] method will be called before the compilation is available in [KotlinTarget.compilations]\n * container\n */"} {"signature":"@ ExternalKotlinTargetApi fun < T : DecoratedExternalKotlinCompilation > DecoratedExternalKotlinTarget . createCompilation ( descriptor : ExternalKotlinCompilationDescriptorBuilder < T > . ( ) -> Unit , ) : T","body":"{ return createCompilation ( ExternalKotlinCompilationDescriptor ( descriptor ) ) }","docstring":"/**\n * @see createCompilation\n */"} {"signature":"protected fun compareCallsByUsedArguments ( call1 : FlatSignature < Candidate > , call2 : FlatSignature < Candidate > , discriminateGenerics : Boolean , useOriginalSamTypes : Boolean ) : Boolean","body":"{ if ( discriminateGenerics ) { val isGeneric1 = call1 . isGeneric val isGeneric2 = call2 . isGeneric if ( isGeneric1 && ! isGeneric2 ) return false if ( ! isGeneric1 && isGeneric2 ) return true if ( isGeneric1 && isGeneric2 ) return false } if ( call1 . contextReceiverCount > call2 . contextReceiverCount ) return true if ( call1 . contextReceiverCount < call2 . contextReceiverCount ) return false return createEmptyConstraintSystem ( ) . isSignatureNotLessSpecific ( call1 , call2 , SpecificityComparisonWithNumerics , specificityComparator , useOriginalSamTypes ) }","docstring":"/**\n * Returns `true` if [call1] is definitely more or equally specific [call2],\n * `false` otherwise.\n */"} {"signature":"internal fun Project . launch ( start : CoroutineStart = CoroutineStart . Default , block : suspend KotlinPluginLifecycle . ( ) -> Unit , )","body":"{ kotlinPluginLifecycle . launch ( start , block ) }","docstring":"/**\n * Launches the given [block] as coroutine inside the Kotlin Gradle Plugin which allows to suspend execution of the code.\n * Intended use cases for suspensions are:\n *\n * #### Waiting for a given [KotlinPluginLifecycle.Stage]\n *\n * ```kotlin\n * project.launch {\n * // code\n * await(Stage.AfterEvaluate) // <- suspends\n * assertEquals(Stage.AfterEvaluate, stage)\n *\n * await(Stage.FinaliseDsl) // suspends\n * assertEquals(Stage.FinaliseDsl, stage)\n * // code\n * }\n * ```\n *\n * #### Waiting for some Gradle property to return a final value\n *\n * ```kotlin\n * project.launch {\n * val value = myProperty.awaitFinalValue() // <- suspends until final value is available!\n * }\n * ```\n *\n * #### Waiting for other suspending code in the Kotlin Gradle Plugin\n *\n * ```kotlin\n * project.launch {\n * // code\n * callMyOtherSuspendingFunction() // <- suspends\n * }\n * ```\n *\n * When launching a coroutine, the execution start of the [block] is not guaranteed.\n * It can be executed right away, effectively executing the [block] before this launch function returns\n * However, when called inside an already existing coroutine (or once Gradle has started executing afterEvaluate listeners),\n * then this block executed after this launch function returns and put at the end of the execution queue\n *\n * If the lifecycle already finished and Gradle moved to its execution phase, then the block will be invoked right away.\n */"} {"signature":"internal fun Project . launchInStage ( stage : Stage , block : suspend KotlinPluginLifecycle . ( ) -> Unit )","body":"{ launch { await ( stage ) block ( ) } }","docstring":"/**\n * See [launch] and [launchInRequiredStage]\n *\n * This is a shortcut to [launch] and immediately awaiting the specified [stage]:\n * @param block Is guaranteed to be executed *not before* [stage]. However, when this function is called in a higher stage then specified\n * the [block] will still be launched.\n */"} {"signature":"internal fun Project . launchInRequiredStage ( stage : Stage , block : suspend KotlinPluginLifecycle . ( ) -> Unit )","body":"{ launchInStage ( stage ) { requiredStage ( stage ) { block ( ) } } }","docstring":"/**\n * See also [launch]\n *\n * Launches the given block in the specified lifecycle stage [stage].\n * It is guaranteed that [block] is only executed in the specified [stage]. Leaving the stage is forbidden.\n *\n * @throws IllegalLifecycleException if the [stage] was already executed or [block] tries to exit the required [stage]\n *\n * ```kotlin\n * project.launchInRequiredStage(Stage.BeforeFinaliseDsl) {\n * assertEquals(Stage.BeforeFinaliseDsl, stage) // guaranteed!\n * assertFails { await(Stage.FinaliseDsl) } // <- forbidden, as it tried to leave the required stage!\n * }\n * ```\n */"} {"signature":"internal fun Project . startKotlinPluginLifecycle ( )","body":"{ ( kotlinPluginLifecycle as KotlinPluginLifecycleImpl ) . start ( ) }","docstring":"/**\n * Will start the lifecycle, this shall be called before the [kotlinPluginLifecycle] is effectively used\n */"} {"signature":"internal suspend fun currentKotlinPluginLifecycle ( ) : KotlinPluginLifecycle","body":"{ return coroutineContext . kotlinPluginLifecycle }","docstring":"/**\n * Similar to [currentCoroutineContext]: Returns the current [KotlinPluginLifecycle] instance used to launch\n * the currently running coroutine. Throws if this coroutine was not started using a [KotlinPluginLifecycle]\n */"} {"signature":"internal suspend fun Stage . await ( )","body":"{ currentKotlinPluginLifecycle ( ) . await ( this ) }","docstring":"/**\n * Suspends execution until we *at least* reached the specified [this@await]\n * This will return right away if the specified [this@await] was already executed or we are currently executing the [this@await]\n */"} {"signature":"internal suspend fun < T : Any > Property < T > . awaitFinalValue ( ) : T ?","body":"{ Stage . AfterFinaliseDsl . await ( ) finalizeValue ( ) return orNull }","docstring":"/**\n * Will suspend until [Stage.FinaliseDsl], finalise the value using [Property.finalizeValue] and return the\n * final value.\n */"} {"signature":"internal suspend fun < T : Any > Property < T > . awaitFinalValueOrThrow ( ) : T","body":"{ Stage . AfterFinaliseDsl . await ( ) finalizeValue ( ) return orNull ? : throw IllegalLifecycleException ( \"\" ) }","docstring":"/**\n * Will suspend until [Stage.FinaliseDsl], finalise the value using [Property.finalizeValue] and return the\n * final value or throw if value wasn't set.\n */"} {"signature":"internal suspend fun < T > requiredStage ( stage : Stage , block : suspend ( ) -> T ) : T","body":"{ if ( currentKotlinPluginLifecycle ( ) . stage < stage ) stage . await ( ) return withRestrictedStages ( hashSetOf ( stage ) , block ) }","docstring":"/**\n * See also [withRestrictedStages]\n *\n * Will ensure that the given [block] can only execute in the given [stage]\n * Will wait for the given [stage] if not arrived yet\n */"} {"signature":"internal suspend fun < T > requireCurrentStage ( block : suspend ( ) -> T ) : T","body":"{ return requiredStage ( currentKotlinPluginLifecycle ( ) . stage , block ) }","docstring":"/**\n * See also [withRestrictedStages]\n *\n * Will ensure that the given [block] cannot leave the current stage\n * e.g.\n *\n * ```kotlin\n * project.launch {\n * requireCurrentStage {\n * await(stage.nextOrThrow) // <- fails! We are not allowed to switch stages!\n * }\n * }\n * ```\n */"} {"signature":"fun resnet18prediction ( )","body":"{ runImageRecognitionPrediction ( ONNXModels . CV . ResNet18 ) }","docstring":"/**\n * This examples demonstrates the inference concept on ResNet'18 model:\n * - Model configuration, model weights and labels are obtained from [ONNXModelHub].\n * - Model predicts on a few images located in resources.\n * - Special preprocessing (used in ResNet'18 during training on ImageNet dataset) is applied to each image before prediction.\n */"} {"signature":"fun main ( ) : Unit","body":"= resnet18prediction ( )","docstring":"/** */"} {"signature":"private fun fetchSourceFileMetadata ( srcFile : KotlinSourceFile , loadSignatures : Boolean )","body":"= kotlinLibrarySourceFileMetadata . getOrPut ( srcFile ) { val deserializer = idSignatureSerialization . getIdSignatureDeserializer ( srcFile ) fun < T > CodedInputStream . readDependencies ( signaturesReader : ( ) -> T ) = buildMapUntil ( readInt32 ( ) ) { val libFile = KotlinLibraryFile . fromProtoStream ( this @ readDependencies ) val depends = buildMapUntil ( readInt32 ( ) ) { val dependencySrcFile = KotlinSourceFile . fromProtoStream ( this @ readDependencies ) put ( dependencySrcFile , signaturesReader ( ) ) } put ( libFile , depends ) } fun CodedInputStream . readDirectDependencies ( ) = readDependencies { if ( loadSignatures ) { buildMapUntil ( readInt32 ( ) ) { val signature = deserializer . deserializeIdSignature ( this @ readDirectDependencies ) put ( signature , ICHash . fromProtoStream ( this @ readDirectDependencies ) ) } } else { repeat ( readInt32 ( ) ) { deserializer . skipIdSignature ( this @ readDirectDependencies ) ICHash . fromProtoStream ( this @ readDirectDependencies ) } emptyMap ( ) } } fun CodedInputStream . readInverseDependencies ( ) = readDependencies { if ( loadSignatures ) { buildSetUntil ( readInt32 ( ) ) { add ( deserializer . deserializeIdSignature ( this @ readInverseDependencies ) ) } } else { repeat ( readInt32 ( ) ) { deserializer . skipIdSignature ( this @ readInverseDependencies ) } emptySet ( ) } } srcFile . getCacheFile ( METADATA_SUFFIX ) . useCodedInputIfExists { val directDependencies = KotlinSourceFileMap ( readDirectDependencies ( ) ) val reverseDependencies = KotlinSourceFileMap ( readInverseDependencies ( ) ) KotlinSourceFileMetadataFromDisk ( reverseDependencies , directDependencies ) } ? : KotlinSourceFileMetadataNotExist }","docstring":"/**\n * Fetches cached data for a specific [srcFile].\n *\n * @param loadSignatures\n * If false, it loads only file names for the (direct and inverse) dependencies.\n * If true, it also loads the declaration signatures [IdSignature] and declaration hashes [ICHash] for every dependency.\n *\n * Note that if the file is modified or removed, the signatures cannot be loaded, and [loadSignatures] must be false.\n * This is because [IdSignatureSerialization] uses declaration indexes from the klib for serialization and deserialization.\n * If the file is modified, the indexes can be modified (for example, shifted) too, leading to incorrect deserialization.\n */"} {"signature":"fun JupyterIntegration . Builder . resources ( block : ResourcesBuilder . ( ) -> Unit )","body":"{ val resources = ResourcesBuilder ( notebook . loggerFactory ) . apply ( block ) resources . resources . forEach { resource ( it ) } }","docstring":"/**\n * Build a resource tree using [ResourcesBuilder]. The builder allows to construct `js` and `css` bundles. Each bundle\n * could contain multiple files or urls. Each of those could contain multiple fallback paths (for example if URL not\n * found, local resource is used.\n */"} {"signature":"@ OptIn ( ExperimentalStdlibApi :: class ) fun url ( url : String , localFallBack : String ? = null , classpathFallBack : String ? = null , embed : Boolean = false , )","body":"{ val libraryResource = ResourceFallbacksBundle ( buildList { if ( embed ) { add ( ResourceLocation ( url , ResourcePathType . URL_EMBEDDED ) ) } else { add ( ResourceLocation ( url , ResourcePathType . URL ) ) } localFallBack ? . let { checkLocalPath ( localFallBack ) add ( ResourceLocation ( localFallBack , ResourcePathType . LOCAL_PATH ) ) } classpathFallBack ? . let { add ( ResourceLocation ( classpathFallBack , ResourcePathType . CLASSPATH_PATH ) ) } } , ) bundles . add ( libraryResource ) }","docstring":"/**\n * Create an url resource with optional embedding (governed by [embed] flag) with optional local file fallback\n * and a class-path fallback. If fallbacks are null, they are not used.\n */"} {"signature":"fun local ( localPath : String )","body":"{ checkLocalPath ( localPath ) bundles . add ( ResourceFallbacksBundle ( listOf ( ResourceLocation ( localPath , ResourcePathType . LOCAL_PATH ) ) , ) , ) }","docstring":"/**\n * Use local resource from file\n */"} {"signature":"fun classPath ( classPath : String )","body":"{ bundles . add ( ResourceFallbacksBundle ( listOf ( ResourceLocation ( classPath , ResourcePathType . CLASSPATH_PATH ) ) , ) , ) }","docstring":"/**\n * Use Jar class-path resource\n */"} {"signature":"fun js ( name : String , block : BundleBuilder . ( ) -> Unit , )","body":"{ val bundles = BundleBuilder ( ) . apply ( block ) . bundles resources . add ( LibraryResource ( name = name , type = ResourceType . JS , bundles = bundles , ) , ) }","docstring":"/**\n * Create a JS resource bundle\n */"} {"signature":"fun css ( name : String , block : BundleBuilder . ( ) -> Unit , )","body":"{ val bundles = BundleBuilder ( ) . apply ( block ) . bundles resources . add ( LibraryResource ( name = name , type = ResourceType . CSS , bundles = bundles , ) , ) }","docstring":"/**\n * Create a Css resource bundle\n */"} {"signature":"protected abstract fun getTypeSystemContext ( session : Session ) : TypeSystemContext","body":"protected abstract fun getTypeSystemContext ( session : Session ) : TypeSystemContext","docstring":"/**\n * The type system to use to query properties of types, type parameters and type arguments.\n */"} {"signature":"protected open fun Declaration . visitParentForFunctionMangling ( )","body":"{ visitParent ( ) }","docstring":"/**\n * Like [visitParent], but may have some logic that makes it suitable specifically for mangling function names.\n */"} {"signature":"protected abstract fun Declaration . asTypeParameterContainer ( ) : TypeParameterContainer ?","body":"protected abstract fun Declaration . asTypeParameterContainer ( ) : TypeParameterContainer ?","docstring":"/**\n * Simply attempts to cast [Declaration] to [TypeParameterContainer].\n */"} {"signature":"protected abstract fun renderDeclaration ( declaration : Declaration ) : String","body":"protected abstract fun renderDeclaration ( declaration : Declaration ) : String","docstring":"/**\n * Used to show a meaningful exception message.\n */"} {"signature":"public fun rowsCount ( ) : Int","body":"= buffer . rowsCount ( )","docstring":"/**\n * Gets the count of rows in the current buffer.\n *\n * @return Number of rows in the buffer.\n */"} {"signature":"public fun data ( ) : TableData","body":"{ return if ( isGrouped ) { GroupedData ( buffer , groupKeys ! ! ) } else { NamedData ( buffer ) } }","docstring":"/**\n * Retrieves the dataset as [TableData].\n * If the dataset is grouped, it returns a [GroupedData], otherwise, a [NamedData] is returned.\n *\n * @return The dataset represented as [TableData].\n */"} {"signature":"public fun takeColumn ( name : String ) : String","body":"{ return referredColumns [ name ] ? : run { val columnId = internalAddColumn ( initialNamedData . dataFrame . getColumnOrNull ( name ) ? : error ( \"\" ) ) referredColumns [ name ] = columnId name } }","docstring":"/**\n * Attempts to fetch a column by its name.\n * If not present, the column is retrieved from the initial dataset and added to the internal buffer.\n *\n * @param name Name of the column.\n * @return Name of the retrieved column.\n */"} {"signature":"public fun addColumn ( column : ColumnReference < * > ) : String","body":"{ return if ( column is DataColumn < * > ) { internalAddColumn ( column ) } else takeColumn ( column . name ( ) ) }","docstring":"/**\n * Adds a column to the dataset.\n * Depending on the nature of the reference and the `columnAsRefOnly` flag,\n * it either directly adds the column or treats it as a reference.\n *\n * @param column The column to be added, represented as [ColumnReference].\n * @return The name of the added column.\n */"} {"signature":"public fun addColumn ( values : List < * > , name : String ) : String","body":"{ val columnId = internalAddColumn ( DataColumn . createValueColumn ( name , values , Infer . Type ) ) referredColumns [ name ] = columnId return internalAddColumn ( DataColumn . createValueColumn ( name , values , Infer . Type ) ) }","docstring":"/**\n * Directly adds a column with specified values and name to the dataset.\n * Useful for adding custom columns not present in the initial dataset.\n *\n * @param values A list of values for the column.\n * @param name Name for the column.\n * @return The name of the added column.\n */"} {"signature":"public fun of ( i : Int ) : DataType","body":"{ return when ( i ) { -> ByteDataType -> ShortDataType -> IntDataType -> LongDataType -> FloatDataType -> DoubleDataType -> ComplexFloatDataType -> ComplexDoubleDataType else -> throw IllegalStateException ( \"\" ) } }","docstring":"/**\n * Returns [DataType] by [nativeCode].\n */"} {"signature":"public inline fun < T > of ( element : T ) : DataType","body":"{ element ? : throw IllegalStateException ( \"\" ) return dataTypeOf ( element ! ! :: class ) }","docstring":"/**\n * Returns [DataType] by class of [element].\n */"} {"signature":"public inline fun < T : Any > ofKClass ( type : KClass < out T > ) : DataType","body":"= dataTypeOf ( type )","docstring":"/**\n * Returns [DataType] by [KClass] of [type]. [T] is `reified` type.\n */"} {"signature":"public fun < A , B > convert ( from : KType , to : KType , converter : ( A ) -> B )","body":"public fun < A , B > convert ( from : KType , to : KType , converter : ( A ) -> B )","docstring":"/**\n * Defines how to convert [from]: [A] to [to]: [B].\n *\n * Note: In most cases using `convert().with { }` is more convenient, however\n * if you only have [KType], this method can be used.\n */"} {"signature":"public fun convertIf ( condition : ( fromType : KType , toSchema : ColumnSchema ) -> Boolean , converter : ConverterScope . ( Any ? ) -> Any ? , )","body":"public fun convertIf ( condition : ( fromType : KType , toSchema : ColumnSchema ) -> Boolean , converter : ConverterScope . ( Any ? ) -> Any ? , )","docstring":"/**\n * Advanced version of [convert].\n * If you want to define a common conversion for multiple types (or any type), or\n * you need extra information about the target, such as its schema, use this method.\n *\n * The exact type conversion does have higher priority. After that, this flexible conversions will be checked\n * in order.\n *\n * @param condition a function that should return `true` if the conversion should be applied from the given `fromType`\n * to the given `toSchema`.\n * @param converter a function that performs the conversion with access to a [ConverterScope].\n */"} {"signature":"public inline fun < T , reified C > ConvertSchemaDsl < T > . fill ( noinline columns : ColumnsSelector < T , C > ) : ConvertToFill < T , C >","body":"= ConvertToFill ( this , columns )","docstring":"/**\n * Defines how to fill specified columns in destination schema that were not found in original dataframe.\n * All [fill] operations for missing columns are executed after successful conversion of matched columns, so converted values of matched columns can be safely used in [with] expression.\n * @param columns target columns in destination dataframe schema to be filled\n */"} {"signature":"public inline fun < reified C > ConvertSchemaDsl < * > . parser ( noinline parser : ( String ) -> C ) : Unit","body":"= convert < String > ( ) . with ( parser )","docstring":"/**\n * Defines how to convert `String` values into given type [C].\n */"} {"signature":"public inline fun < reified C > ConvertSchemaDsl < * > . convert ( ) : ConvertType < C >","body":"= ConvertType ( this , typeOf < C > ( ) )","docstring":"/**\n * Defines how to convert values of given type [C]\n */"} {"signature":"public inline fun < C , reified R > ConvertType < C > . with ( noinline converter : ( C ) -> R ) : Unit","body":"= dsl . convert ( from , typeOf < R > ( ) , converter )","docstring":"/**\n * Defines how to convert values of type [C] into type [R]\n */"} {"signature":"public inline fun < reified T : Any > AnyFrame . convertTo ( excessiveColumnsBehavior : ExcessiveColumns = ExcessiveColumns . Keep , noinline body : ConvertSchemaDsl < T > . ( ) -> Unit = { } ) : DataFrame < T >","body":"= convertToImpl ( typeOf < T > ( ) , true , excessiveColumnsBehavior , body ) . cast ( )","docstring":"/**\n * Converts values in [DataFrame] to match given column schema [T].\n *\n * Original columns are mapped to destination columns by column [path][DataColumn.path].\n *\n * Type converters for every column are selected automatically. See [convert] operation for details.\n *\n * To specify custom type converters for the particular types use [ConvertSchemaDsl].\n *\n * Example of Dsl:\n * ```kotlin\n * df.convertTo {\n * // defines how to convert Int? -> String\n * convert().with { it?.toString() ?: \"No input given\" }\n * // defines how to convert String -> SomeType\n * parser { SomeType(it) }\n * // fill missing column `sum` with expression `a + b`\n * fill { sum }.with { a + b }\n * }\n * ```\n *\n * @param [T] class that defines target schema for conversion.\n * @param [excessiveColumnsBehavior] how to handle excessive columns in the original [DataFrame].\n * @param [body] optional dsl to define custom type converters.\n * @throws [ColumnNotFoundException] if [DataFrame] doesn't contain columns that are required by destination schema.\n * @throws [ExcessiveColumnsException] if [DataFrame] contains columns that are not required by destination schema and [excessiveColumnsBehavior] is set to [ExcessiveColumns.Fail].\n * @throws [TypeConverterNotFoundException] if suitable type converter for some column was not found.\n * @throws [TypeConversionException] if type converter failed to convert column values.\n * @return converted [DataFrame].\n */"} {"signature":"public fun AnyFrame . convertTo ( schemaType : KType , excessiveColumnsBehavior : ExcessiveColumns = ExcessiveColumns . Keep , body : ConvertSchemaDsl < Any > . ( ) -> Unit = { } , ) : AnyFrame","body":"= convertToImpl ( schemaType , true , excessiveColumnsBehavior , body )","docstring":"/**\n * Converts values in [DataFrame] to match given column schema [schemaType].\n *\n * Original columns are mapped to destination columns by column [path][DataColumn.path].\n *\n * Type converters for every column are selected automatically. See [convert] operation for details.\n *\n * To specify custom type converters for the particular types use [ConvertSchemaDsl].\n *\n * Example of Dsl:\n * ```kotlin\n * df.convertTo {\n * // defines how to convert Int? -> String\n * convert().with { it?.toString() ?: \"No input given\" }\n * // defines how to convert String -> SomeType\n * parser { SomeType(it) }\n * // fill missing column `sum` with expression `a+b`\n * fill { sum }.with { a + b }\n * }\n * ```\n *\n * @param [schemaType] defines target schema for conversion.\n * @param [excessiveColumnsBehavior] how to handle excessive columns in the original [DataFrame].\n * @param [body] optional dsl to define custom type converters.\n * @throws [ColumnNotFoundException] if [DataFrame] doesn't contain columns that are required by destination schema.\n * @throws [ExcessiveColumnsException] if [DataFrame] contains columns that are not required by destination schema and [excessiveColumnsBehavior] is set to [ExcessiveColumns.Fail].\n * @throws [TypeConverterNotFoundException] if suitable type converter for some column was not found.\n * @throws [TypeConversionException] if type converter failed to convert column values.\n * @return converted [DataFrame].\n */"} {"signature":"fun < T1 > EmptyTuple . appendedBy ( other : T1 ) : Tuple1 < T1 >","body":"= Tuple1 < T1 > ( other )","docstring":"/**\n * This file provides functions to easily extend Scala Tuples.\n *\n * This means you can easily create a new tuple appended-, or prepended by a new value or tuple.\n *\n * For example (using tupleOf() to create a new tuple):\n * ```tupleOf(a, b).appendedBy(c) == tupleOf(a, b, c)```\n * and\n * ```tupleOf(a, b).prependedBy(c) == tupleOf(c, a, b)```\n *\n * or in shorthand:\n * ```tupleOf(a, b) + c == tupleOf(a, b, c)```\n * and\n * ```c + tupleOf(a, b) == tupleOf(c, a, b)```\n *\n * Note that ```tupleOf(a, b) + tupleOf(c, d)``` will merge the two into ```tupleOf(a, b, c, d)```:\n * If you mean to create ```tupleOf(a, b, tupleOf(c, d))``` or ```tupleOf(tupleOf(a, b), c, d)```,\n * use [appendedBy] and [prependedBy] explicitly.\n *\n * Note that [String.plus] concatenates any object to the string, so prepending it like ```myString + myTuple``` won't work.\n *\n * For concatenating two tuples, see [org.jetbrains.kotlinx.spark.api.tuples.concat].\n *\n */"} {"signature":"fun main ( )","body":"{ val ( train , _ ) = fashionMnist ( ) val inferenceModel = TensorFlowInferenceModel . load ( File ( PATH_TO_MODEL ) , loadOptimizerState = true ) inferenceModel . use { var accuracy = val amountOfTestSet = for ( imageId in .. amountOfTestSet ) { val prediction = it . predict ( train . getX ( imageId ) ) if ( prediction == train . getY ( imageId ) . toInt ( ) ) accuracy += ( / amountOfTestSet ) } println ( \"\" ) val amountOfOps = val start = System . currentTimeMillis ( ) for ( i in .. amountOfOps ) { it . predict ( train . getX ( i % ) ) } println ( \"\" ) println ( \"\" ) } }","docstring":"/**\n * Inference model is used here, separately from model training code to illustrate the ability to load model graph and weights to start prediction process.\n *\n * NOTE: The example requires the saved model in the appropriate directory (run [lenetOnFashionMnistExportImportToTxt] firstly).\n */"} {"signature":"public fun EchartsLayerContext . markPoint ( block : MarkPointContext . ( ) -> Unit )","body":"{ layerFeatures [ MarkPointFeature . FEATURE_NAME ] = MarkPointContext ( ) . apply ( block ) . toMarkPointFeature ( ) }","docstring":"/**\n * Sets mark points on a layer.\n *\n * - [points][MarkPointContext.points] - list of [mark point][MarkPoint]\n *\n * ```kotlin\n * plot {\n * line {\n * markPoint {\n * points = listOf(MarkPoint(\"avg\", MarkType.AVERAGE), MarkPoint(coord = 1.5 to 2.0, value = \"2\"))\n * }\n * }\n * }\n * ```\n *\n * @see MarkPoint\n */"} {"signature":"public fun EchartsLayerContext . markLine ( block : MarkLineContext . ( ) -> Unit )","body":"{ layerFeatures [ MarkLineFeature . FEATURE_NAME ] = MarkLineContext ( ) . apply ( block ) . toMarkLineFeature ( ) }","docstring":"/**\n * Sets mark lines on a layer.\n *\n * - [points][MarkLineContext.lines] - list of [mark line][MarkLine]\n *\n * ```kotlin\n * plot {\n * line {\n * markLine {\n * lines = listOf(\n * MarkLine(\"max\", MarkType.MAX),\n * MarkLine(\"two points\", MarkPoint(MarkType.MIN), MarkPoint(5, 3))\n* )\n * }\n * }\n * }\n * ```\n *\n * @see MarkLine\n */"} {"signature":"public fun EchartsLayerContext . markArea ( block : MarkAreaContext . ( ) -> Unit )","body":"{ layerFeatures [ MarkAreaFeature . FEATURE_NAME ] = MarkAreaContext ( ) . apply ( block ) . toMarkAreaFeature ( ) }","docstring":"/**\n * Sets mark areas on a layer.\n *\n * - [points][MarkAreaContext.areas] - list of [mark area][MarkArea]\n *\n * ```kotlin\n * plot {\n * line {\n * markArea {\n * areas = listOf(MarkArea(\"area\", MarkPoint(MarkType.MIN), MarkPoint(MarkType.MAX)))\n * }\n * }\n * }\n * ```\n *\n * @see MarkArea\n */"} {"signature":"@ kotlin . internal . InlineOnly public inline fun assert ( value : Boolean )","body":"{ assert ( value ) { \"\" } }","docstring":"/**\n * Throws an [AssertionError] if the [value] is false\n * and runtime assertions have been enabled on the JVM using the *-ea* JVM option.\n */"} {"signature":"@ kotlin . internal . InlineOnly public inline fun assert ( value : Boolean , lazyMessage : ( ) -> Any )","body":"{ if ( _Assertions . ENABLED ) { if ( ! value ) { val message = lazyMessage ( ) throw AssertionError ( message ) } } }","docstring":"/**\n * Throws an [AssertionError] calculated by [lazyMessage] if the [value] is false\n * and runtime assertions have been enabled on the JVM using the *-ea* JVM option.\n */"} {"signature":"fun down ( )","body":"{ gameState . sceneState . initialized = true previous = Vector2 . Zero }","docstring":"/**\n * To be called when the screen gets touched.\n */"} {"signature":"fun move ( total : Vector2 )","body":"{ val delta = total - previous if ( delta . length < ) return previous = total val ( axis , angle ) = movementToRotation ( delta ) gameState . manualRotate ( axis , angle ) }","docstring":"/**\n * To be called when finger moves;\n *\n * @param total the vector from the point where the screen have got touched to the current one.\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 ( ) ) . unsafeCast < Byte > ( ) }","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 ( ) ) . unsafeCast < Short > ( ) }","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 JsMath . max ( a , b ) }","docstring":"/**\n * Returns the greater of two values.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ Suppress ( \"\" ) 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 JsMath . max ( a , 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 JsMath . max ( a , 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 JsMath . max ( a . toInt ( ) , b . toInt ( ) , c . toInt ( ) ) . unsafeCast < Byte > ( ) }","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 JsMath . max ( a . toInt ( ) , b . toInt ( ) , c . toInt ( ) ) . unsafeCast < Short > ( ) }","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 JsMath . max ( a , 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 JsMath . max ( a , 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 JsMath . max ( a , 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 ( ) ) . unsafeCast < Byte > ( ) }","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 ( ) ) . unsafeCast < Short > ( ) }","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 JsMath . min ( a , b ) }","docstring":"/**\n * Returns the smaller of two values.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ Suppress ( \"\" ) 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 JsMath . min ( a , 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 JsMath . min ( a , 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 JsMath . min ( a . toInt ( ) , b . toInt ( ) , c . toInt ( ) ) . unsafeCast < Byte > ( ) }","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 JsMath . min ( a . toInt ( ) , b . toInt ( ) , c . toInt ( ) ) . unsafeCast < Short > ( ) }","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 JsMath . min ( a , 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 JsMath . min ( a , 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 JsMath . min ( a , 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":"public fun summary ( ) : ModelSummary","body":"public fun summary ( ) : ModelSummary","docstring":"/**\n * Returns model summary.\n *\n * @return model summary\n */"} {"signature":"fun remove ( target : KlibTarget )","body":"{ if ( ! _targets . remove ( target ) ) { return } topLevelDeclaration . remove ( target ) }","docstring":"/**\n * Remove the [target] from this dump.\n * If some declaration was declared only for [target], it will be removed from the dump.\n */"} {"signature":"fun retainTargetSpecificAbi ( target : KlibTarget )","body":"{ if ( ! _targets . contains ( target ) ) { _targets . clear ( ) topLevelDeclaration . children . clear ( ) topLevelDeclaration . targets . clear ( ) return } topLevelDeclaration . retainSpecific ( target , _targets ) _targets . retainAll ( setOf ( target ) ) }","docstring":"/**\n * Leave only declarations specific to a [target].\n * A declaration is considered target-specific if:\n * 1) it defined for some [targets] subset including [target], but not for all [targets];\n * 2) it defined for all [targets], but contains target-specific child declaration.\n */"} {"signature":"fun retainCommonAbi ( )","body":"{ topLevelDeclaration . retainCommon ( _targets ) if ( topLevelDeclaration . children . isEmpty ( ) ) { _targets . clear ( ) } }","docstring":"/**\n * Remove all declarations that are not defined for all [KlibAbiDumpMerger.targets].\n */"} {"signature":"fun mergeTargetSpecific ( other : KlibAbiDumpMerger )","body":"{ require ( other . _targets . size == ) { \"\" } require ( other . _targets . first ( ) !in _targets ) { \"\" + \"\" } _targets . addAll ( other . _targets ) topLevelDeclaration . mergeTargetSpecific ( other . topLevelDeclaration ) }","docstring":"/**\n * Merge the [other] dump containing declarations for a single target into this dump.\n * The dump [other] should contain exactly one target and this dump should not contain that target.\n */"} {"signature":"fun merge ( other : KlibAbiDumpMerger )","body":"{ if ( other . targets . isEmpty ( ) ) return targets . intersect ( other . targets ) . also { require ( it . isEmpty ( ) ) { \"\" } } if ( headerContent != other . headerContent ) { if ( headerContent . isEmpty ( ) && targets . isEmpty ( ) ) { headerContent . addAll ( other . headerContent ) } else { throw IllegalArgumentException ( \"\" ) } } _targets . addAll ( other . _targets ) topLevelDeclaration . merge ( other . topLevelDeclaration ) }","docstring":"/**\n * Merges other [KlibAbiDumpMerger] into this one.\n */"} {"signature":"fun overrideTargets ( targets : Set < KlibTarget > )","body":"{ _targets . clear ( ) _targets . addAll ( targets ) topLevelDeclaration . overrideTargets ( targets ) }","docstring":"/**\n * For each declaration change targets to a specified [targets] set.\n */"} {"signature":"fun remove ( target : KlibTarget )","body":"{ if ( parent != null && ! targets . contains ( target ) ) { return } targets . remove ( target ) mutateChildrenAndRemoveTargetless { it . remove ( target ) } }","docstring":"/**\n * Remove the [target] from this dump.\n * If some declaration was declared only for [target], it will be removed from the dump.\n */"} {"signature":"fun overrideTargets ( targets : Set < KlibTarget > )","body":"{ this . targets . clear ( ) this . targets . addAll ( targets ) children . forEach { it . value . overrideTargets ( targets ) } }","docstring":"/**\n * For each declaration change targets to a specified [targets] set.\n */"} {"signature":"public fun isScalar ( ) : Boolean","body":"public fun isScalar ( ) : Boolean","docstring":"/**\n * Returns `true` if the array contains only one element, otherwise `false`.\n */"} {"signature":"public fun isEmpty ( ) : Boolean","body":"public fun isEmpty ( ) : Boolean","docstring":"/**\n * Returns `true` if this ndarray is empty.\n */"} {"signature":"public fun isNotEmpty ( ) : Boolean","body":"public fun isNotEmpty ( ) : Boolean","docstring":"/**\n * Returns `true` if this ndarray is not empty.\n */"} {"signature":"public fun copy ( ) : MultiArray < T , D >","body":"public fun copy ( ) : MultiArray < T , D >","docstring":"/**\n * Returns new [MultiArray] which is a copy of the original ndarray.\n */"} {"signature":"public fun deepCopy ( ) : MultiArray < T , D >","body":"public fun deepCopy ( ) : MultiArray < T , D >","docstring":"/**\n * Returns new [MultiArray] which is a deep copy of the original ndarray.\n */"} {"signature":"public fun flatten ( ) : MultiArray < T , D1 >","body":"public fun flatten ( ) : MultiArray < T , D1 >","docstring":"/**\n * Returns new one-dimensional ndarray which is a copy of the original ndarray.\n */"} {"signature":"public fun reshape ( dim1 : Int ) : MultiArray < T , D1 >","body":"public fun reshape ( dim1 : Int ) : MultiArray < T , D1 >","docstring":"/**\n * Returns an ndarray with a new ([dim1]) shape without changing data.\n */"} {"signature":"public fun reshape ( dim1 : Int , dim2 : Int ) : MultiArray < T , D2 >","body":"public fun reshape ( dim1 : Int , dim2 : Int ) : MultiArray < T , D2 >","docstring":"/**\n * Returns an ndarray with a new ([dim1], [dim2]) shape without changing data.\n */"} {"signature":"public fun reshape ( dim1 : Int , dim2 : Int , dim3 : Int ) : MultiArray < T , D3 >","body":"public fun reshape ( dim1 : Int , dim2 : Int , dim3 : Int ) : MultiArray < T , D3 >","docstring":"/**\n * Returns an ndarray with a new ([dim1], [dim2], [dim3]) shape without changing data.\n */"} {"signature":"public fun reshape ( dim1 : Int , dim2 : Int , dim3 : Int , dim4 : Int ) : MultiArray < T , D4 >","body":"public fun reshape ( dim1 : Int , dim2 : Int , dim3 : Int , dim4 : Int ) : MultiArray < T , D4 >","docstring":"/**\n * Returns an ndarray with a new ([dim1], [dim2], [dim3], [dim4]) shape without changing data.\n */"} {"signature":"public fun reshape ( dim1 : Int , dim2 : Int , dim3 : Int , dim4 : Int , vararg dims : Int ) : MultiArray < T , DN >","body":"public fun reshape ( dim1 : Int , dim2 : Int , dim3 : Int , dim4 : Int , vararg dims : Int ) : MultiArray < T , DN >","docstring":"/**\n * Returns an ndarray with a new ([dim1], [dim2], [dim3], [dim4], [dims]) shape without changing data.\n */"} {"signature":"public fun transpose ( vararg axes : Int ) : MultiArray < T , D >","body":"public fun transpose ( vararg axes : Int ) : MultiArray < T , D >","docstring":"/**\n * Reverse or permute the [axes] of an array.\n */"} {"signature":"public fun squeeze ( vararg axes : Int ) : MultiArray < T , DN >","body":"public fun squeeze ( vararg axes : Int ) : MultiArray < T , DN >","docstring":"/**\n * Returns an ndarray with all axes removed equal to one.\n */"} {"signature":"public fun unsqueeze ( vararg axes : Int ) : MultiArray < T , DN >","body":"public fun unsqueeze ( vararg axes : Int ) : MultiArray < T , DN >","docstring":"/**\n * Returns a new ndarray with a dimension of size one inserted at the specified [axes].\n */"} {"signature":"public infix fun cat ( other : MultiArray < T , D > ) : NDArray < T , D >","body":"public infix fun cat ( other : MultiArray < T , D > ) : NDArray < T , D >","docstring":"/**\n * Concatenates this ndarray with [other].\n */"} {"signature":"public fun cat ( other : MultiArray < T , D > , axis : Int = ) : NDArray < T , D >","body":"public fun cat ( other : MultiArray < T , D > , axis : Int = ) : NDArray < T , D >","docstring":"/**\n * Concatenates this ndarray with [other] along the specified [axis].\n */"} {"signature":"public fun cat ( other : List < MultiArray < T , D > > , axis : Int = ) : NDArray < T , D >","body":"public fun cat ( other : List < MultiArray < T , D > > , axis : Int = ) : NDArray < T , D >","docstring":"/**\n * Concatenates this ndarray with a list of [other] ndarrays.\n */"} {"signature":"private fun readKlibUniqNameFromManifest ( ) : String","body":"{ val konanHome = compilerDistributionPath . get ( ) . absolutePath val resolver = defaultResolver ( repositories = emptyList ( ) , directLibs = emptyList ( ) , target = PlatformManager ( konanHome ) . targetByName ( target ) , distribution = Distribution ( konanHome ) , logger = object : Logger { override fun log ( message : String ) = logger . info ( message ) override fun warning ( message : String ) = logger . warn ( message ) override fun error ( message : String ) : Unit = logger . error ( message ) override fun fatal ( message : String ) : Nothing = kotlin . error ( message ) } ) return resolver . resolve ( originalKlib . asFile . get ( ) . absolutePath ) . uniqueName }","docstring":"/**\n * Note: we can't use this function instead of [klibUniqName] in [cacheFile],\n * because the latter is `@OutputDirectory`, so Gradle can call it even before\n * the task dependencies are finished, and [originalKlib] might be not build yet.\n */"} {"signature":"public fun KtDeclarationSymbol . getExpectsForActual ( ) : List < KtDeclarationSymbol >","body":"= withValidityAssertion { analysisSession . multiplatformInfoProvider . getExpectForActual ( this ) }","docstring":"/**\n * Gives expect symbol for the actual one if it is available.\n *\n * @return a single expect declaration corresponds to the [KtDeclarationSymbol] on valid code or multiple expects in a case of erroneous code with multiple expects.\n **/"} {"signature":"public inline fun < reified T : Any , reified D : Dim2 > Multik . readCSV ( fileName : String , delimiter : Char = '' , charset : Charset = Charsets . UTF_8 ) : NDArray < T , D >","body":"= readCSV ( fileName , DataType . ofKClass ( T :: class ) , dimensionClassOf < D > ( ) , delimiter , charset )","docstring":"/**\n * Returns an NDArray of type [T] and [D] dimension read from csv file.\n * @param T NDArray element type\n * @param D dimension of NDArray. It can be 1 or 2\n * @param fileName file path including file name and extensions\n * @param delimiter separator between elements\n * @param charset character encoding, by default is UTF_8\n */"} {"signature":"public fun < T , D : Dim2 > Multik . readCSV ( fileName : String , dtype : DataType , dim : Dim2 , delimiter : Char = '' , charset : Charset = Charsets . UTF_8 ) : NDArray < T , D >","body":"{ val file = File ( fileName ) if ( ! file . exists ( ) ) throw NoSuchFileException ( file ) return readCSV ( file , dtype , dim , delimiter , charset ) }","docstring":"/**\n * Returns an NDArray of type [T] and [D] dimension read from csv file.\n * @param T NDArray element type\n * @param D dimension of NDArray. It can be 1 or 2\n * @param fileName file path including file name and extensions\n * @param dtype NDArray element type\n * @param delimiter separator between elements\n * @param charset character encoding, by default is UTF_8\n */"} {"signature":"public fun Multik . readRaw ( fileName : String , dtype : DataType ? = null , dim : Dim2 ? = null , delimiter : Char = '' , charset : Charset = Charsets . UTF_8 ) : NDArray < * , D2 >","body":"{ val file = File ( fileName ) if ( ! file . exists ( ) ) throw NoSuchFileException ( file ) return readRaw ( file , dtype , dim , delimiter , charset ) }","docstring":"/**\n * Returns a raw array of dimension 2. The type casts to either [Double] or [ComplexDouble].\n * @param fileName file path including file name and extensions\n * @param dtype NDArray element type\n * @param dim dimension of NDArray\n * @param delimiter separator between elements\n * @param charset character encoding, by default is UTF_8\n */"} {"signature":"public inline fun < reified T : Any , reified D : Dim2 > Multik . readCSV ( file : File , delimiter : Char = '' , charset : Charset = Charsets . UTF_8 ) : NDArray < T , D >","body":"= readCSV ( file , DataType . ofKClass ( T :: class ) , dimensionClassOf < D > ( ) , delimiter , charset )","docstring":"/**\n * Returns an NDArray of type [T] and [D] dimension read from csv file.\n * @param T NDArray element type\n * @param D dimension of NDArray. It can be 1 or 2\n * @param file csv file\n * @param delimiter separator between elements\n * @param charset character encoding, by default is UTF_8\n */"} {"signature":"public fun < T , D : Dim2 > Multik . readCSV ( file : File , dtype : DataType , dim : Dim2 , delimiter : Char = '' , charset : Charset = Charsets . UTF_8 ) : NDArray < T , D >","body":"= readDelim ( FileInputStream ( file ) , dtype , dim , delimiter , charset , isCompressed ( file ) )","docstring":"/**\n * Returns an NDArray of type [T] and [D] dimension read from csv file.\n * @param T NDArray element type\n * @param D dimension of NDArray. It can be 1 or 2\n * @param dtype NDArray element type\n * @param file csv file\n * @param delimiter separator between elements\n * @param charset character encoding, by default is UTF_8\n */"} {"signature":"public fun Multik . readRaw ( file : File , dtype : DataType ? = null , dim : Dim2 ? = null , delimiter : Char = '' , charset : Charset = Charsets . UTF_8 ) : NDArray < * , D2 >","body":"= readDelim < Any , D2 > ( FileInputStream ( file ) , dtype , dim , delimiter , charset , isCompressed ( file ) )","docstring":"/**\n * Returns a raw array of dimension 2. The type casts to either [Double] or [ComplexDouble].\n * @param file csv file\n * @param dtype NDArray element type\n * @param dim dimension of NDArray\n * @param delimiter separator between elements\n * @param charset character encoding, by default is UTF_8\n */"} {"signature":"public fun < T , D : Dim2 > Multik . readDelim ( inStream : InputStream , dtype : DataType ? , dim : Dim2 ? , delimiter : Char = '' , charset : Charset , isCompressed : Boolean = false ) : NDArray < T , D >","body":"= if ( isCompressed ) { InputStreamReader ( GZIPInputStream ( inStream ) , charset ) } else { BufferedReader ( InputStreamReader ( inStream , charset ) ) } . run { readDelim ( this , CSVFormat . Builder . create ( CSVFormat . DEFAULT ) . setDelimiter ( delimiter ) . build ( ) , dtype , dim ) }","docstring":"/**\n * Returns an NDArray of type [T] and [D] dimension read from csv file.\n * @param T NDArray element type\n * @param D dimension of NDArray. It can be 1 or 2\n * @param inStream data input stream from file\n * @param dtype NDArray element type\n * @param dim dimension of NDArray\n * @param delimiter separator between elements\n * @param isCompressed shows whether the data is compressed, by default is false\n */"} {"signature":"public fun < T , D : Dim2 > Multik . readDelim ( reader : Reader , format : CSVFormat = CSVFormat . DEFAULT , dtype : DataType ? , dim : Dim2 ? ) : NDArray < T , D >","body":"{ val iSize : Int val jSize : Int val data : MemoryView < T > format . parse ( reader ) . use { csvParser -> val records = csvParser . records iSize = records . size jSize = records . first ( ) . size ( ) val type = dtype ? : records [ ] [ ] . parseDtype ( ) data = initMemoryView ( iSize * jSize , type ) var index = for ( record in records ) { for ( el in record ) { data [ index ++ ] = el . toType ( type ) } } } val d = dim ? : D2 return if ( d == D1 ) { val shape = intArrayOf ( jSize * iSize ) D1Array ( data , , shape , dim = D1 ) } else { val shape = intArrayOf ( iSize , jSize ) D2Array ( data , , shape , dim = D2 ) } as NDArray < T , D > }","docstring":"/**\n * Returns an NDArray of type [T] and [D] dimension read from csv file.\n * @param T NDArray element type\n * @param D dimension of NDArray. It can be 1 or 2\n * @param reader reading character-input streams\n * @param format csv format from apache\n * @param dtype NDArray element type\n * @param dim dimension of NDArray\n */"} {"signature":"public fun < T , D : Dim2 > Multik . writeCSV ( file : File , ndarray : NDArray < T , D > , delimiter : Char = '' ) : Unit","body":"= writeCSV ( FileWriter ( file ) , ndarray , CSVFormat . Builder . create ( CSVFormat . DEFAULT ) . setDelimiter ( delimiter ) . build ( ) )","docstring":"/**\n * Writes an NDArray to csv file. The NDArray must be up to the second dimension.\n * @param T NDArray element type\n * @param D dimension of NDArray. It can be 1 or 2\n * @param file file where the data will be written, if the file does not exist, it will be created\n * @param delimiter separator between elements\n */"} {"signature":"public fun < T , D : Dim2 > Multik . writeCSV ( path : String , ndarray : NDArray < T , D > , delimiter : Char = '' ) : Unit","body":"= writeCSV ( FileWriter ( path ) , ndarray , CSVFormat . Builder . create ( CSVFormat . DEFAULT ) . setDelimiter ( delimiter ) . build ( ) )","docstring":"/**\n * Writes an NDArray to csv file. The NDArray must be up to the second dimension.\n * @param T NDArray element type\n * @param D dimension of NDArray. It can be 1 or 2\n * @param path file path where the data will be written\n * @param delimiter separator between elements\n */"} {"signature":"public fun < T , D : Dim2 > Multik . writeCSV ( writer : Appendable , ndarray : NDArray < T , D > , format : CSVFormat = CSVFormat . DEFAULT ) : Unit","body":"= format . print ( writer ) . use { printer -> if ( ndarray . dim . d == ) { ndarray . forEach { printer . printRecord ( it ) } } else { ndarray as D2Array < T > for ( i in until ndarray . shape [ ] ) { for ( j in until ndarray . shape [ ] ) { printer . print ( ndarray [ i , j ] ) } printer . println ( ) } } }","docstring":"/**\n * Returns an NDArray of type [T] and [D] dimension read from csv file.\n * @param T NDArray element type\n * @param D dimension of NDArray. It can be 1 or 2\n * @param writer\n * @param ndarray array of data\n * @param format csv format from apache\n */"} {"signature":"@ Test fun testNotDoingDispatchesWhenNoTasksArePresent ( )","body":"= runTest { class NaggingDispatcher : CoroutineDispatcher ( ) { private val closed = atomic ( false ) override fun dispatch ( context : CoroutineContext , block : Runnable ) { if ( closed . value ) fail ( \"\" ) Dispatchers . Default . dispatch ( context , block ) } fun close ( ) { closed . value = true } } repeat ( stressTestMultiplier * ) { val dispatcher = NaggingDispatcher ( ) val view = dispatcher . limitedParallelism ( ) val deferred = CompletableDeferred < Unit > ( ) val job = launch ( view ) { deferred . await ( ) } launch ( Dispatchers . Default ) { deferred . complete ( Unit ) } job . join ( ) dispatcher . close ( ) } }","docstring":"/**\n * Tests that, when no tasks are present, the limited dispatcher does not dispatch any tasks.\n * This is important for the case when a dispatcher is closeable and the [CoroutineDispatcher.limitedParallelism]\n * machinery could trigger a dispatch after the dispatcher is closed.\n */"} {"signature":"@ Test fun testMainMocking ( )","body":"= runTest { val mainAtStart = TestMainDispatcher . currentTestDispatcher assertNotNull ( mainAtStart ) withContext ( Dispatchers . Main ) { delay ( ) } withContext ( Dispatchers . Default ) { delay ( ) } withContext ( Dispatchers . Main ) { delay ( ) } assertSame ( mainAtStart , TestMainDispatcher . currentTestDispatcher ) }","docstring":"/** Tests that asynchronous execution of tests does not happen concurrently with [AfterTest]. */"} {"signature":"@ Test fun testMockedMainImplementsDelay ( )","body":"= runTest { val main = Dispatchers . Main withContext ( main ) { delay ( ) } withContext ( Dispatchers . Default ) { delay ( ) } withContext ( main ) { delay ( ) } }","docstring":"/** Tests that the mocked [Dispatchers.Main] correctly forwards [Delay] methods. */"} {"signature":"@ Test fun testSelfSet ( )","body":"{ assertFailsWith < IllegalArgumentException > { Dispatchers . setMain ( Dispatchers . Main ) } }","docstring":"/** Tests that [Distpachers.setMain] fails when called with [Dispatchers.Main]. */"} {"signature":"fun isOverloadable ( a : DeclarationDescriptor , b : DeclarationDescriptor ) : Boolean","body":"{ val aCategory = getDeclarationCategory ( a ) val bCategory = getDeclarationCategory ( b ) if ( aCategory != bCategory ) return true if ( a !is CallableDescriptor || b !is CallableDescriptor ) return false return checkOverloadability ( a , b ) }","docstring":"/**\n * Does not check names.\n */"} {"signature":"private fun < Signature > findSuperImplementationForStubDelegation ( function : FunctionDescriptor , state : GenerationState , signatureByDescriptor : ( FunctionDescriptor ) -> Signature ) : FunctionDescriptor ?","body":"{ val implementation = findConcreteSuperDeclaration ( DescriptorBasedFunctionHandleForJvm ( function , state ) ) ? : return null if ( ! implementation . mayBeUsedAsSuperImplementation ) return null if ( signatureByDescriptor ( function ) == signatureByDescriptor ( implementation . descriptor ) ) return null return implementation . descriptor }","docstring":"/**\n * Stub is a method having signature from Kotlin built-ins that we generate for non-abstract declarations,\n * it's bytecode consists of INVOKESPECIAL-call to real declaration in super class.\n *\n * Note that stub is needed only for first Kotlin class in the hierarchy.\n *\n * For example:\n * class A : HashMap\n *\n * Here we generate `entrySet()` special bridge with INVOKEVIRTUAL getEntries(),\n * But the latter does not exists yet, so we create a stub for it with delegation to super-class\n *\n * Also note that there is no special bridges for final declarations, thus no stubs either\n */"} {"signature":"override fun close ( )","body":"{ isClosed = true tfGraph . close ( ) }","docstring":"/**\n * Closes internal TensorFlow graph.\n */"} {"signature":"public fun variableNames ( ) : List < String >","body":"= tfGraph . variableNames ( )","docstring":"/** Returns list of variable names in TensorFlow graph. */"} {"signature":"public fun copy ( ) : KGraph","body":"{ require ( ! isClosed ) { \"\" } return KGraph ( tfGraph . toGraphDef ( ) ) }","docstring":"/** Makes a graph copy. */"} {"signature":"public fun addOptimizerVariable ( variable : Variable < Float > )","body":"{ check ( ! optimizerVariables . contains ( variable ) ) { \"\" } optimizerVariables . add ( variable ) }","docstring":"/**\n * Adds a variable used in optimizer to the pool of tracked variables.\n *\n * @param variable Optimizer variable to track in KGraph.\n */"} {"signature":"public fun addOptimizerVariableInitializer ( initializer : Assign < * > )","body":"{ optimizerInitializers += initializer }","docstring":"/**\n * Adds an optimizer initializer for optimizer variable tracked in KGraph.\n *\n * @param initializer Assign TensorFlow operand to initialize optimizer variable.\n */"} {"signature":"public fun addOptimizerVariableAssignAddInitializer ( initializer : AssignAdd < Float > )","body":"{ optimizerAssignAddInitializers += initializer }","docstring":"/**\n * Adds an optimizer initializer of special 'AssignAdd' type for optimizer variable tracked in KGraph.\n *\n * @param initializer AssignAdd TensorFlow operand to initialize and increase optimizer variable.\n */"} {"signature":"public fun optimizerVariables ( ) : List < Variable < Float > >","body":"{ return optimizerVariables . toList ( ) }","docstring":"/**\n * Returns all variables used in optimizer and initialized by Assign TensorFlow operand.\n */"} {"signature":"public fun initializeOptimizerVariables ( session : Session )","body":"{ if ( optimizerInitializers . isNotEmpty ( ) ) { optimizerInitializers . forEach { val runner = session . runner ( ) runner . addTarget ( it ) runner . run ( ) } } runAssignAddOpsForOptimizers ( session ) }","docstring":"/**\n * Initializes TensorFlow graph variables used in optimizer.\n */"} {"signature":"internal actual fun safeAdd ( a : Long , b : Long ) : Long","body":"{ val sum = a + b if ( ( a xor sum ) < && ( a xor b ) >= ) { throw ArithmeticException ( \"\" ) } return sum }","docstring":"/**\n * Safely adds two long values.\n * throws [ArithmeticException] if the result overflows a long\n */"} {"signature":"internal actual fun safeMultiply ( a : Long , b : Long ) : Long","body":"{ when ( b ) { - -> { if ( a == Long . MIN_VALUE ) { throw ArithmeticException ( \"\" ) } return - a } -> return -> return a } val total = a * b if ( total / b != a ) { throw ArithmeticException ( \"\" ) } return total }","docstring":"/**\n * Safely multiply a long by an int.\n *\n * @param a the first value\n * @param b the second value\n * @return the new total\n * @throws ArithmeticException if the result overflows a long\n */"} {"signature":"@ InternalCoroutinesApi public fun handleCoroutineException ( context : CoroutineContext , exception : Throwable )","body":"{ try { context [ CoroutineExceptionHandler ] ? . let { it . handleException ( context , exception ) return } } catch ( t : Throwable ) { handleUncaughtCoroutineException ( context , handlerException ( exception , t ) ) return } handleUncaughtCoroutineException ( context , exception ) }","docstring":"/**\n * Helper function for coroutine builder implementations to handle uncaught and unexpected exceptions in coroutines,\n * that could not be otherwise handled in a normal way through structured concurrency, saving them to a future, and\n * cannot be rethrown. This is a last resort handler to prevent lost exceptions.\n *\n * If there is [CoroutineExceptionHandler] in the context, then it is used. If it throws an exception during handling\n * or is absent, all instances of [CoroutineExceptionHandler] found via [ServiceLoader] and\n * [Thread.uncaughtExceptionHandler] are invoked.\n */"} {"signature":"@ Suppress ( \"\" ) public inline fun CoroutineExceptionHandler ( crossinline handler : ( CoroutineContext , Throwable ) -> Unit ) : CoroutineExceptionHandler","body":"= object : AbstractCoroutineContextElement ( CoroutineExceptionHandler ) , CoroutineExceptionHandler { override fun handleException ( context : CoroutineContext , exception : Throwable ) = handler . invoke ( context , exception ) }","docstring":"/**\n * Creates a [CoroutineExceptionHandler] instance.\n * @param handler a function which handles exception thrown by a coroutine\n */"} {"signature":"public fun handleException ( context : CoroutineContext , exception : Throwable )","body":"public fun handleException ( context : CoroutineContext , exception : Throwable )","docstring":"/**\n * Handles uncaught [exception] in the given [context]. It is invoked\n * if coroutine has an uncaught exception.\n */"} {"signature":"public fun TensorResult . getFloatArray ( index : Int ) : FloatArray","body":"= tensors [ index ] . toFloatArray ( )","docstring":"/**\n * Returns the output at [index] as a [FloatArray].\n */"} {"signature":"public fun TensorResult . getLongArray ( index : Int ) : LongArray","body":"= tensors [ index ] . toLongArray ( )","docstring":"/**\n * Returns the output at [index] as a [LongArray].\n */"} {"signature":"public fun Tensor < * > . toFloatArray ( ) : FloatArray","body":"{ val buffer = FloatBuffer . allocate ( numElements ( ) ) writeTo ( buffer ) return buffer . array ( ) }","docstring":"/** Copies tensor data to float array. */"} {"signature":"public fun Tensor < * > . toLongArray ( ) : LongArray","body":"{ val buffer = LongBuffer . allocate ( numElements ( ) ) writeTo ( buffer ) return buffer . array ( ) }","docstring":"/** Copies tensor data to long array. */"} {"signature":"public fun Tensor < * > . toMultiDimensionalArray ( ) : Array < * >","body":"{ val shape = this . shape ( ) if ( shape . isEmpty ( ) ) return emptyArray < Any > ( ) if ( shape . size == ) return toFloatArray ( ) . toTypedArray ( ) val dst = when ( shape . size ) { -> create2DArray ( shape ) -> create3DArray ( shape ) -> create4DArray ( shape ) else -> { throw UnsupportedOperationException ( \"\" ) } } copyTo ( dst ) return dst }","docstring":"/** Copies tensor to multidimensional float array. Array rank is equal to tensor rank. */"} {"signature":"fun render ( withSeverity : Boolean = true , withLocation : Boolean = true , withException : Boolean = true , withStackTrace : Boolean = false ) : String","body":"= buildString { if ( withSeverity ) { append ( severity . name ) append ( '' ) } append ( message ) if ( withLocation && ( sourcePath != null || location != null ) ) { append ( \"\" ) sourcePath ? . let { append ( it . substringAfterLast ( File . separatorChar ) ) } location ? . let { append ( '' ) append ( it . start . line ) append ( '' ) append ( it . start . col ) } append ( '' ) } if ( withException && exception != null ) { append ( \"\" ) append ( exception ) if ( withStackTrace ) { ByteArrayOutputStream ( ) . use { os -> val ps = PrintStream ( os ) exception . printStackTrace ( ps ) ps . flush ( ) append ( \"\" ) append ( os . toString ( ) ) } } } }","docstring":"/**\n * Render diagnostics message as a string in a form:\n * \"[SEVERITY ]message[ (file:line:column)][: exception message[\\n exception stacktrace]]\"\n * @param withSeverity add severity prefix, true by default\n * @param withLocation add error location in the compiled script, if present, true by default\n * @param withException add exception message, if present, true by default\n * @param withStackTrace add exception stacktrace, if exception is present and [withException] is true, false by default\n */"} {"signature":"inline fun < R1 , R2 > ResultWithDiagnostics < R1 > . onSuccess ( body : ( R1 ) -> ResultWithDiagnostics < R2 > ) : ResultWithDiagnostics < R2 >","body":"= when ( this ) { is ResultWithDiagnostics . Success -> this . reports + body ( this . value ) is ResultWithDiagnostics . Failure -> this }","docstring":"/**\n * Chains actions on successful result:\n * If receiver is success - executes [body] and merge diagnostic reports\n * otherwise returns the failure as is\n */"} {"signature":"inline fun < T , R > Iterable < T > . mapSuccess ( body : ( T ) -> ResultWithDiagnostics < R > ) : ResultWithDiagnostics < List < R > >","body":"= mapSuccessImpl ( body ) { results , r -> results . add ( r ) }","docstring":"/**\n * maps transformation ([body]) over iterable merging diagnostics\n * return failure with merged diagnostics after first failed transformation\n * and success with merged diagnostics and list of results if all transformations succeeded\n */"} {"signature":"inline fun < T , R > Iterable < T > . mapNotNullSuccess ( body : ( T ) -> ResultWithDiagnostics < R ? > ) : ResultWithDiagnostics < List < R > >","body":"= mapSuccessImpl ( body ) { results , r -> if ( r != null ) results . add ( r ) }","docstring":"/**\n * maps transformation ([body]) over iterable merging diagnostics\n * return failure with merged diagnostics after first failed transformation\n * and success with merged diagnostics and list of not null results if all transformations succeeded\n */"} {"signature":"inline fun < T , R > Iterable < T > . flatMapSuccess ( body : ( T ) -> ResultWithDiagnostics < Collection < R > > ) : ResultWithDiagnostics < List < R > >","body":"= mapSuccessImpl ( body ) { results , r -> results . addAll ( r ) }","docstring":"/**\n * maps transformation ([body]) over iterable merging diagnostics and flatten the results\n * return failure with merged diagnostics after first failed transformation\n * and success with merged diagnostics and list of results if all transformations succeeded\n */"} {"signature":"inline fun < R > ResultWithDiagnostics < R > . onFailure ( body : ( ResultWithDiagnostics < R > ) -> Unit ) : ResultWithDiagnostics < R >","body":"{ if ( this is ResultWithDiagnostics . Failure ) { body ( this ) } return this }","docstring":"/**\n * Chains actions on failure:\n * If receiver is failure - executed [body]\n * otherwise returns the receiver as is\n */"} {"signature":"operator fun < R > List < ScriptDiagnostic > . plus ( result : ResultWithDiagnostics < R > ) : ResultWithDiagnostics < R >","body":"= when ( result ) { is ResultWithDiagnostics . Success -> ResultWithDiagnostics . Success ( result . value , this + result . reports ) is ResultWithDiagnostics . Failure -> ResultWithDiagnostics . Failure ( this + result . reports ) }","docstring":"/**\n * Merges diagnostics report with the [result] wrapper\n */"} {"signature":"fun < R > R . asSuccess ( reports : List < ScriptDiagnostic > = listOf ( ) ) : ResultWithDiagnostics . Success < R >","body":"= ResultWithDiagnostics . Success ( this , reports )","docstring":"/**\n * Converts the receiver value to the Success result wrapper with optional diagnostic [reports]\n */"} {"signature":"fun makeFailureResult ( reports : List < ScriptDiagnostic > ) : ResultWithDiagnostics . Failure","body":"= ResultWithDiagnostics . Failure ( reports )","docstring":"/**\n * Makes Failure result with optional diagnostic [reports]\n */"} {"signature":"fun makeFailureResult ( vararg reports : ScriptDiagnostic ) : ResultWithDiagnostics . Failure","body":"= ResultWithDiagnostics . Failure ( reports . asList ( ) )","docstring":"/**\n * Makes Failure result with optional diagnostic [reports]\n */"} {"signature":"fun makeFailureResult ( message : String , path : String ? = null , location : SourceCode . Location ? = null ) : ResultWithDiagnostics . Failure","body":"= ResultWithDiagnostics . Failure ( message . asErrorDiagnostics ( ScriptDiagnostic . unspecifiedError , path , location ) )","docstring":"/**\n * Makes Failure result with diagnostic [message] with optional [path] and [location]\n */"} {"signature":"fun makeFailureResult ( message : String , locationWithId : SourceCode . LocationWithId ? ) : ResultWithDiagnostics . Failure","body":"= ResultWithDiagnostics . Failure ( message . asErrorDiagnostics ( ScriptDiagnostic . unspecifiedError , locationWithId ) )","docstring":"/**\n * Makes Failure result with diagnostic [message] with optional [locationWithId]\n */"} {"signature":"fun Throwable . asDiagnostics ( code : Int = ScriptDiagnostic . unspecifiedException , customMessage : String ? = null , path : String ? = null , location : SourceCode . Location ? = null , severity : ScriptDiagnostic . Severity = ScriptDiagnostic . Severity . ERROR ) : ScriptDiagnostic","body":"= ScriptDiagnostic ( code , customMessage ? : message ? : \"\" , severity , path , location , this )","docstring":"/**\n * Converts the receiver Throwable to the Failure results wrapper with optional [customMessage], [path] and [location]\n */"} {"signature":"fun Throwable . asDiagnostics ( code : Int = ScriptDiagnostic . unspecifiedException , customMessage : String ? = null , locationWithId : SourceCode . LocationWithId ? , severity : ScriptDiagnostic . Severity = ScriptDiagnostic . Severity . ERROR ) : ScriptDiagnostic","body":"= ScriptDiagnostic ( code , customMessage ? : message ? : \"\" , severity , locationWithId , this )","docstring":"/**\n * Converts the receiver Throwable to the Failure results wrapper with optional [customMessage], [locationWithId]\n */"} {"signature":"fun String . asErrorDiagnostics ( code : Int = ScriptDiagnostic . unspecifiedError , path : String ? = null , location : SourceCode . Location ? = null ) : ScriptDiagnostic","body":"= ScriptDiagnostic ( code , this , ScriptDiagnostic . Severity . ERROR , path , location )","docstring":"/**\n * Converts the receiver String to error diagnostic report with optional [path] and [location]\n */"} {"signature":"fun String . asErrorDiagnostics ( code : Int = ScriptDiagnostic . unspecifiedError , locationWithId : SourceCode . LocationWithId ? ) : ScriptDiagnostic","body":"= ScriptDiagnostic ( code , this , ScriptDiagnostic . Severity . ERROR , locationWithId )","docstring":"/**\n * Converts the receiver String to error diagnostic report with optional [locationWithId]\n */"} {"signature":"fun < R > ResultWithDiagnostics < R > . valueOrNull ( ) : R ?","body":"= when ( this ) { is ResultWithDiagnostics . Success < R > -> value else -> null }","docstring":"/**\n * Extracts the result value from the receiver wrapper or null if receiver represents a Failure\n */"} {"signature":"inline fun < R > ResultWithDiagnostics < R > . valueOr ( body : ( ResultWithDiagnostics . Failure ) -> Nothing ) : R","body":"= when ( this ) { is ResultWithDiagnostics . Success < R > -> value is ResultWithDiagnostics . Failure -> body ( this ) }","docstring":"/**\n * Extracts the result value from the receiver wrapper or run non-returning lambda if receiver represents a Failure\n */"} {"signature":"fun < R > ResultWithDiagnostics < R > . valueOrThrow ( ) : R","body":"= valueOr { throw RuntimeException ( reports . joinToString ( \"\" ) { it . exception ? . toString ( ) ? : it . message } , reports . find { it . exception != null } ? . exception ) }","docstring":"/**\n * Extracts the result value from the receiver wrapper or throw RuntimeException with diagnostics\n */"} {"signature":"private fun ConeFlexibleType . hasFlexibleMutability ( ) : Boolean","body":"{ return JavaToKotlinClassMap . isMutable ( lowerBound . classId ) && JavaToKotlinClassMap . isReadOnly ( upperBound . classId ) }","docstring":"/**\n * `List` is represented as `MutableList..List?`.\n */"} {"signature":"private fun ConeFlexibleType . isArrayWithFlexibleVariance ( ) : Boolean","body":"{ return lowerBound . classId == StandardClassIds . Array && lowerBound . typeArguments . firstOrNull ( ) ? . kind != upperBound . typeArguments . firstOrNull ( ) ? . kind }","docstring":"/**\n * `Object[]` is represented as `Array..Array?`.\n */"} {"signature":"fun clearExtras ( )","body":"{ _builder . clearExtras ( ) }","docstring":"/**\n * optional .org.jetbrains.kotlin.gradle.idea.proto.generated.IdeaExtrasProto extras = 1;\n */"} {"signature":"fun hasExtras ( ) : kotlin . Boolean","body":"{ return _builder . hasExtras ( ) }","docstring":"/**\n * optional .org.jetbrains.kotlin.gradle.idea.proto.generated.IdeaExtrasProto extras = 1;\n * @return Whether the extras field is set.\n */"} {"signature":"fun clearType ( )","body":"{ _builder . clearType ( ) }","docstring":"/**\n * optional .org.jetbrains.kotlin.gradle.idea.proto.generated.tcs.IdeaKotlinSourceDependencyProto.Type type = 2;\n */"} {"signature":"fun hasType ( ) : kotlin . Boolean","body":"{ return _builder . hasType ( ) }","docstring":"/**\n * optional .org.jetbrains.kotlin.gradle.idea.proto.generated.tcs.IdeaKotlinSourceDependencyProto.Type type = 2;\n * @return Whether the type field is set.\n */"} {"signature":"fun clearCoordinates ( )","body":"{ _builder . clearCoordinates ( ) }","docstring":"/**\n * optional .org.jetbrains.kotlin.gradle.idea.proto.generated.tcs.IdeaKotlinProjectCoordinatesProto coordinates = 3;\n */"} {"signature":"fun hasCoordinates ( ) : kotlin . Boolean","body":"{ return _builder . hasCoordinates ( ) }","docstring":"/**\n * optional .org.jetbrains.kotlin.gradle.idea.proto.generated.tcs.IdeaKotlinProjectCoordinatesProto coordinates = 3;\n * @return Whether the coordinates field is set.\n */"} {"signature":"fun lenetWithAlternativeLossFunction ( )","body":"{ val ( train , test ) = mnist ( ) val ( newTrain , validation ) = train . split ( ) lenet5Classic . use { model -> model . compile ( optimizer = Adam ( ) , loss = Losses . HUBER , metric = Metrics . ACCURACY ) model . logSummary ( ) val history = model . fit ( trainingDataset = newTrain , validationDataset = validation , epochs = EPOCHS , trainBatchSize = TRAINING_BATCH_SIZE , validationBatchSize = TEST_BATCH_SIZE ) val accuracy = model . evaluate ( dataset = test , batchSize = TEST_BATCH_SIZE ) . metrics [ Metrics . ACCURACY ] println ( \"\" ) val accuracyByEpoch = history . epochHistory . map { it . metricValues [ ] } . toDoubleArray ( ) println ( accuracyByEpoch . contentToString ( ) ) } }","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 * - dataset splitting on train, test and validation subsets\n * - model compilation with alternative [Losses]\n * - model summary\n * - model training with validation\n * - model evaluation\n */"} {"signature":"fun main ( ) : Unit","body":"= lenetWithAlternativeLossFunction ( )","docstring":"/** */"} {"signature":"fun fill ( rangeStart : Int , rangeEnd : Int , categoryIdOf : ( Int ) -> String , charCode : Int , categoryId : String ) : Boolean","body":"{ require ( charCode == rangeStart - || charCode == rangeEnd + ) val attempt = categoryIds . copyOf ( ) for ( ch in rangeStart .. rangeEnd ) { if ( ! attempt . fill ( ch , categoryIdOf ( ch ) ) ) return false } if ( ! attempt . fill ( charCode , categoryId ) ) return false attempt . copyInto ( categoryIds ) return true }","docstring":"/**\n * Returns true if a range with the specified [rangeStart], [rangeEnd] and [categoryIdOf] was successfully added\n * together with a char with the specified [charCode] and [categoryId].\n *\n * The [charCode] must go immediately after the [rangeEnd] or before the [rangeStart].\n */"} {"signature":"fun fill ( charCode : Int , categoryId : String ) : Boolean","body":"{ return categoryIds . fill ( charCode , categoryId ) }","docstring":"/**\n * Returns true if the [charCode] with the [categoryId] was successfully placed in [categoryIds].\n */"} {"signature":"private fun Array < String ? > . fill ( charCode : Int , categoryId : String ) : Boolean","body":"{ val index = charCode % sequenceLength val current = this [ index ] if ( current == null || ( isPeriodic && current == categoryId ) ) { this [ index ] = categoryId return true } return false }","docstring":"/**\n * Returns true if the [charCode] with the [categoryId] was successfully placed in this array.\n *\n * The [charCode] is placed at index `charCode % sequenceLength`.\n */"} {"signature":"@ ExperimentalBuildToolsApi @ Suppress ( \"\" ) @ JvmName ( \"\" ) public fun SharedApiClassesClassLoader ( ) : ClassLoader","body":"= SharedApiClassesClassLoaderImpl ( SharedApiClassesClassLoaderImpl :: class . java . classLoader , SharedApiClassesClassLoaderImpl :: class . java . `package` . name , )","docstring":"/**\n * Creates a [ClassLoader] which reuses the API classes from the ClassLoader which loaded the API.\n * This way an API implementation can be loaded with almost fully isolated classpath, sharing only the classes from `org.jetbrains.kotlin.buildtools.api`,\n * so a caller still able to pass API parameters in a compatible way.\n */"} {"signature":"fun main ( )","body":"{ val preprocessing = pipeline < BufferedImage > ( ) . crop { left = right = top = bottom = } . rotate { degrees = } . resize { outputWidth = outputHeight = interpolation = InterpolationType . NEAREST } . grayscale ( ) . toFloatArray { } . rescale { scalingCoefficient = } val resource : URL = Operation :: class . java . getResource ( \"\" ) val imageDirectory = Paths . get ( resource . toURI ( ) ) . toFile ( ) val dataset = OnFlyImageDataset . create ( imageDirectory , EmptyLabels ( ) , preprocessing ) val batchIter : Dataset . BatchIterator = dataset . batchIterator ( ) val rawImage = batchIter . next ( ) . x [ ] val image = ImageConverter . floatArrayToBufferedImage ( rawImage , preprocessing . getOutputShape ( TensorShape ( - , - , ) ) , ColorMode . GRAYSCALE , isNormalized = true ) showFrame ( \"\" , ImagePanel ( image ) ) }","docstring":"/**\n * This example shows how to do image preprocessing from scratch using preprocessing DSL.\n *\n * It includes:\n * - dataset creation from images located in resource folder;\n * - image preprocessing;\n * - image visualisation with the [ImagePanel].\n */"} {"signature":"public fun toNormalizedVector ( bytes : ByteArray ) : FloatArray","body":"{ return FloatArray ( bytes . size ) { ( ( bytes [ it ] . toInt ( ) and ) ) . toFloat ( ) / } }","docstring":"/** Normalizes [bytes] via division on 255 to get values in range '[0; 1)'.*/"} {"signature":"public fun toRawVector ( bytes : ByteArray ) : FloatArray","body":"{ return FloatArray ( bytes . size ) { ( ( bytes [ it ] . toInt ( ) and ) . toFloat ( ) ) } }","docstring":"/** Converts [bytes] to [FloatArray]. */"} {"signature":"public fun KtDeclarationSymbol . getKlibSourceFileName ( ) : String ?","body":"= withValidityAssertion { analysisSession . klibSourceFileProvider . getKlibSourceFileName ( this ) }","docstring":"/**\n * If [KtDeclaration] is a deserialized, klib based symbol, then information about the original\n * [SourceFile] might be retained.\n */"} {"signature":"@ Test @ Suppress ( \"\" ) fun testActivation ( )","body":"= runTest { val barrier = CyclicBarrier ( ) val scope = CoroutineScope ( pool ) repeat ( N_ITERATIONS ) { var wasStarted = false val d = scope . async ( NonCancellable , start = CoroutineStart . LAZY ) { wasStarted = true throw TestException ( ) } val causeHolder = object { var cause : Throwable ? = null } d . invokeOnCompletion { synchronized ( causeHolder ) { causeHolder . cause = it ? : Error ( \"\" ) ( causeHolder as Object ) . notifyAll ( ) } } val canceller = scope . launch { barrier . await ( ) d . cancel ( ) } val starter = scope . launch { barrier . await ( ) d . start ( ) } barrier . await ( ) joinAll ( d , canceller , starter ) if ( wasStarted ) { val exception = d . getCompletionExceptionOrNull ( ) assertIs < TestException > ( exception , \"\" ) val cause = synchronized ( causeHolder ) { while ( causeHolder . cause == null ) ( causeHolder as Object ) . wait ( ) causeHolder . cause } assertIs < TestException > ( cause , \"\" ) } } }","docstring":"/**\n * Perform concurrent start & cancel of a job with prior installed completion handlers\n */"} {"signature":"fun get ( annotated : FirAnnotationContainer , config : LombokConfig , session : FirSession ) : T","body":"= extract ( annotated . annotations . findAnnotation ( annotationName ) , config , session )","docstring":"/**\n * Get from annotation or config or default\n */"} {"signature":"fun getIfAnnotated ( annotated : FirAnnotationContainer , config : LombokConfig , session : FirSession ) : T ?","body":"= annotated . annotations . findAnnotation ( annotationName ) ? . let { annotation -> extract ( annotation , config , session ) }","docstring":"/**\n * If element is annotated, get from it or config or default\n */"} {"signature":"@ JvmName ( \"\" ) public fun LinAlg . norm ( mat : MultiArray < Float , D2 > , norm : Norm = Norm . Fro ) : Float","body":"= this . linAlgEx . normF ( mat , norm )","docstring":"/**\n * Returns norm of float matrix\n */"} {"signature":"@ JvmName ( \"\" ) public fun LinAlg . norm ( mat : MultiArray < Double , D2 > , norm : Norm = Norm . Fro ) : Double","body":"= this . linAlgEx . norm ( mat , norm )","docstring":"/**\n * Returns norm of double matrix\n */"} {"signature":"@ Suppress ( \"\" ) public fun SupervisorJob ( parent : Job ? = null ) : CompletableJob","body":"= SupervisorJobImpl ( parent )","docstring":"/**\n * Creates a _supervisor_ job object in an active state.\n * Children of a supervisor job can fail independently of each other.\n * \n * A failure or cancellation of a child does not cause the supervisor job to fail and does not affect its other children,\n * so a supervisor can implement a custom policy for handling failures of its children:\n *\n * - A failure of a child job that was created using [launch][CoroutineScope.launch] can be handled via [CoroutineExceptionHandler] in the context.\n * - A failure of a child job that was created using [async][CoroutineScope.async] can be handled via [Deferred.await] on the resulting deferred value.\n *\n * If a [parent] job is specified, then this supervisor job becomes a child job of [parent] and is cancelled when the\n * parent fails or is cancelled. All this supervisor's children are cancelled in this case, too.\n */"} {"signature":"@ Suppress ( \"\" ) @ Deprecated ( level = DeprecationLevel . HIDDEN , message = \"\" ) @ JvmName ( \"\" ) public fun SupervisorJob0 ( parent : Job ? = null ) : Job","body":"= SupervisorJob ( parent )","docstring":"/** @suppress Binary compatibility only */"} {"signature":"public suspend fun < R > supervisorScope ( block : suspend CoroutineScope . ( ) -> R ) : R","body":"{ contract { callsInPlace ( block , InvocationKind . EXACTLY_ONCE ) } return suspendCoroutineUninterceptedOrReturn { uCont -> val coroutine = SupervisorCoroutine ( uCont . context , uCont ) coroutine . startUndispatchedOrReturn ( coroutine , block ) } }","docstring":"/**\n * Creates a [CoroutineScope] with [SupervisorJob] and calls the specified suspend [block] with this scope.\n * The provided scope inherits its [coroutineContext][CoroutineScope.coroutineContext] from the outer scope, using the\n * [Job] from that context as the parent for the new [SupervisorJob].\n * This function returns as soon as the given block and all its child coroutines are completed.\n *\n * Unlike [coroutineScope], a failure of a child does not cause this scope to fail and does not affect its other children,\n * so a custom policy for handling failures of its children can be implemented. See [SupervisorJob] for additional details.\n *\n * If an exception happened in [block], then the supervisor job is failed and all its children are cancelled.\n * If the current coroutine was cancelled, then both the supervisor job itself and all its children are cancelled.\n *\n * The method may throw a [CancellationException] if the current job was cancelled externally,\n * or rethrow an exception thrown by the given [block].\n */"} {"signature":"public operator fun contains ( char : Char ) : Boolean","body":"public operator fun contains ( char : Char ) : Boolean","docstring":"/**\n * Returns `true` if [char] character belongs to this category.\n */"} {"signature":"@ ExperimentalCoroutinesApi public fun advanceTimeBy ( delayTimeMillis : Long ) : Long","body":"@ ExperimentalCoroutinesApi public fun advanceTimeBy ( delayTimeMillis : Long ) : Long","docstring":"/**\n * Moves the Dispatcher's virtual clock forward by a specified amount of time.\n *\n * The amount the clock is progressed may be larger than the requested `delayTimeMillis` if the code under test uses\n * blocking coroutines.\n *\n * The virtual clock time will advance once for each delay resumed until the next delay exceeds the requested\n * `delayTimeMills`. In the following test, the virtual time will progress by 2_000 then 1 to resume three different\n * calls to delay.\n *\n * ```\n * @Test\n * fun advanceTimeTest() = runBlockingTest {\n * foo()\n * advanceTimeBy(2_000) // advanceTimeBy(2_000) will progress through the first two delays\n * // virtual time is 2_000, next resume is at 2_001\n * advanceTimeBy(2) // progress through the last delay of 501 (note 500ms were already advanced)\n * // virtual time is 2_0002\n * }\n *\n * fun CoroutineScope.foo() {\n * launch {\n * delay(1_000) // advanceTimeBy(2_000) will progress through this delay (resume @ virtual time 1_000)\n * // virtual time is 1_000\n * delay(500) // advanceTimeBy(2_000) will progress through this delay (resume @ virtual time 1_500)\n * // virtual time is 1_500\n * delay(501) // advanceTimeBy(2_000) will not progress through this delay (resume @ virtual time 2_001)\n * // virtual time is 2_001\n * }\n * }\n * ```\n *\n * @param delayTimeMillis The amount of time to move the CoroutineContext's clock forward.\n * @return The amount of delay-time that this Dispatcher's clock has been forwarded.\n */"} {"signature":"@ ExperimentalCoroutinesApi public fun advanceUntilIdle ( ) : Long","body":"@ ExperimentalCoroutinesApi public fun advanceUntilIdle ( ) : Long","docstring":"/**\n * Immediately execute all pending tasks and advance the virtual clock-time to the last delay.\n *\n * If new tasks are scheduled due to advancing virtual time, they will be executed before `advanceUntilIdle`\n * returns.\n *\n * @return the amount of delay-time that this Dispatcher's clock has been forwarded in milliseconds.\n */"} {"signature":"@ ExperimentalCoroutinesApi public fun runCurrent ( )","body":"@ ExperimentalCoroutinesApi public fun runCurrent ( )","docstring":"/**\n * Run any tasks that are pending at or before the current virtual clock-time.\n *\n * Calling this function will never advance the clock.\n */"} {"signature":"@ ExperimentalCoroutinesApi @ Throws ( AssertionError :: class ) public fun cleanupTestCoroutines ( )","body":"@ ExperimentalCoroutinesApi @ Throws ( AssertionError :: class ) public fun cleanupTestCoroutines ( )","docstring":"/**\n * Call after test code completes to ensure that the dispatcher is properly cleaned up.\n *\n * @throws AssertionError if any pending tasks are active, however it will not throw for suspended\n * coroutines.\n */"} {"signature":"@ Deprecated ( \"\" , level = DeprecationLevel . ERROR ) public suspend fun pauseDispatcher ( block : suspend ( ) -> Unit )","body":"@ Deprecated ( \"\" , level = DeprecationLevel . ERROR ) public suspend fun pauseDispatcher ( block : suspend ( ) -> Unit )","docstring":"/**\n * Run a block of code in a paused dispatcher.\n *\n * By pausing the dispatcher any new coroutines will not execute immediately. After block executes, the dispatcher\n * will resume auto-advancing.\n *\n * This is useful when testing functions that start a coroutine. By pausing the dispatcher assertions or\n * setup may be done between the time the coroutine is created and started.\n */"} {"signature":"@ Deprecated ( \"\" , level = DeprecationLevel . ERROR ) public fun pauseDispatcher ( )","body":"@ Deprecated ( \"\" , level = DeprecationLevel . ERROR ) public fun pauseDispatcher ( )","docstring":"/**\n * Pause the dispatcher.\n *\n * When paused, the dispatcher will not execute any coroutines automatically, and you must call [runCurrent] or\n * [advanceTimeBy], or [advanceUntilIdle] to execute coroutines.\n */"} {"signature":"@ Deprecated ( \"\" , level = DeprecationLevel . ERROR ) public fun resumeDispatcher ( )","body":"@ Deprecated ( \"\" , level = DeprecationLevel . ERROR ) public fun resumeDispatcher ( )","docstring":"/**\n * Resume the dispatcher from a paused state.\n *\n * Resumed dispatchers will automatically progress through all coroutines scheduled at the current time. To advance\n * time and execute coroutines scheduled in the future use, one of [advanceTimeBy],\n * or [advanceUntilIdle].\n */"} {"signature":"@ Deprecated ( \"\" , ReplaceWith ( \"\" ) , level = DeprecationLevel . ERROR ) override fun advanceTimeBy ( delayTimeMillis : Long ) : Long","body":"{ val oldTime = scheduler . currentTime scheduler . advanceTimeBy ( delayTimeMillis ) scheduler . runCurrent ( ) return scheduler . currentTime - oldTime }","docstring":"/** @suppress */"} {"signature":"@ Deprecated ( \"\" , ReplaceWith ( \"\" ) , level = DeprecationLevel . ERROR ) override fun advanceUntilIdle ( ) : Long","body":"{ val oldTime = scheduler . currentTime scheduler . advanceUntilIdle ( ) return scheduler . currentTime - oldTime }","docstring":"/** @suppress */"} {"signature":"@ Deprecated ( \"\" , ReplaceWith ( \"\" ) , level = DeprecationLevel . ERROR ) override fun runCurrent ( ) : Unit","body":"= scheduler . runCurrent ( )","docstring":"/** @suppress */"} {"signature":"@ ExperimentalCoroutinesApi override fun cleanupTestCoroutines ( )","body":"{ scheduler . runCurrent ( ) if ( ! scheduler . isIdle ( strict = false ) ) { throw UncompletedCoroutinesError ( \"\" + \"\" ) } }","docstring":"/** @suppress */"} {"signature":"public fun < T > yIntercept ( column : ColumnReference < T > ) : PositionalMapping < T >","body":"{ return addPositionalMapping < T > ( Y_INTERCEPT , column . name ( ) , null ) }","docstring":"/**\n * Maps the `yIntercept` 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 > yIntercept ( column : KProperty < T > ) : PositionalMapping < T >","body":"{ return addPositionalMapping < T > ( Y_INTERCEPT , column . name , null ) }","docstring":"/**\n * Maps the `yIntercept` 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 yIntercept ( column : String ) : PositionalMapping < Any ? >","body":"{ return addPositionalMapping ( Y_INTERCEPT , column , null ) }","docstring":"/**\n * Maps the `yIntercept` 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 > yIntercept ( values : Iterable < T > ) : PositionalMapping < T >","body":"{ return addPositionalMapping < T > ( Y_INTERCEPT , values . toList ( ) , null , null ) }","docstring":"/**\n * Maps the `yIntercept` 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 > yIntercept ( values : DataColumn < T > ) : PositionalMapping < T >","body":"{ return addPositionalMapping < T > ( Y_INTERCEPT , values , null ) }","docstring":"/**\n * Maps the `yIntercept` 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":"fun getSystemClasspathFiles ( ) : Set < File >","body":"{ return getSystemClasspaths ( ) . map { File ( it ) } . toSet ( ) }","docstring":"/**\n * Returns the list of File's in the system classpath\n *\n * @see getSystemClasspaths\n */"} {"signature":"fun getSystemClasspaths ( ) : Set < String >","body":"{ val pathSeparator = System . getProperty ( \"\" ) ! ! return System . getProperty ( \"\" ) ! ! . split ( pathSeparator ) . toSet ( ) }","docstring":"/**\n * Returns the file paths from the system class loader\n *\n * @see getSystemClasspathFiles\n */"} {"signature":"private fun chooseMaximallySpecificCandidates ( candidates : Set < Candidate > , discriminateAbstracts : Boolean , discriminateGenerics : Boolean , ) : Set < Candidate >","body":"{ if ( candidates . size == ) return candidates val fixedCandidates = if ( candidates . first ( ) . callInfo . candidateForCommonInvokeReceiver != null ) chooseCandidatesWithMostSpecificInvokeReceiver ( candidates ) else candidates val candidatesWithoutOverrides = filterOverrides ( fixedCandidates ) val noCompatibilityMode = inferenceComponents . session . languageVersionSettings . supportsFeature ( LanguageFeature . DisableCompatibilityModeForNewInference ) return chooseMaximallySpecificCandidates ( candidatesWithoutOverrides , DiscriminationFlags ( lowPrioritySAMs = noCompatibilityMode , adaptationsInPostponedAtoms = noCompatibilityMode , generics = discriminateGenerics , abstracts = discriminateAbstracts , SAMs = true , suspendConversions = true , byUnwrappedSmartCastOrigin = true , ) ) }","docstring":"/**\n * Partial mirror of [org.jetbrains.kotlin.resolve.calls.results.OverloadingConflictResolver.chooseMaximallySpecificCandidates]\n */"} {"signature":"private fun filterOverrides ( candidateSet : Set < Candidate > , ) : Set < Candidate >","body":"{ if ( candidateSet . size <= ) return candidateSet val result = mutableSetOf < Candidate > ( ) outerLoop @ for ( me in candidateSet ) { val iterator = result . iterator ( ) while ( iterator . hasNext ( ) ) { val other = iterator . next ( ) if ( me . overrides ( other ) ) { iterator . remove ( ) } else if ( other . overrides ( me ) ) { continue@outerLoop } } result . add ( me ) } require ( result . isNotEmpty ( ) ) { \"\" } return result }","docstring":"/**\n * See K1 version at OverridingUtil.filterOverrides\n */"} {"signature":"private fun isNotLessSpecificCallWithArgumentMapping ( call1 : CandidateSignature , call2 : CandidateSignature , discriminateGenerics : Boolean , useOriginalSamTypes : Boolean = false ) : Boolean","body":"{ return compareCallsByUsedArguments ( call1 , call2 , discriminateGenerics , useOriginalSamTypes ) }","docstring":"/**\n * `call1` is not less specific than `call2`\n */"} {"signature":"public fun < T > flux ( context : CoroutineContext = EmptyCoroutineContext , @ BuilderInference block : suspend ProducerScope < T > . ( ) -> Unit ) : Flux < T >","body":"{ require ( context [ Job ] === null ) { \"\" + \"\" } return Flux . from ( reactorPublish ( GlobalScope , context , block ) ) }","docstring":"/**\n * Creates a cold reactive [Flux] that runs the given [block] in a coroutine.\n * Every time the returned flux is subscribed, it starts a new coroutine in the specified [context].\n * The coroutine emits ([Subscriber.onNext]) values with [send][ProducerScope.send], completes ([Subscriber.onComplete])\n * when the coroutine completes, or, in case the coroutine throws an exception or the channel is closed,\n * emits the error ([Subscriber.onError]) and closes the channel with the cause.\n * Unsubscribing cancels the running coroutine.\n *\n * Invocations of [send][ProducerScope.send] are suspended appropriately when subscribers apply back-pressure and to\n * ensure that [onNext][Subscriber.onNext] is not invoked concurrently.\n *\n * **Note: This is an experimental api.** Behaviour of publishers that work as children in a parent scope with respect\n * to cancellation and error handling may change in the future.\n *\n * @throws IllegalArgumentException if the provided [context] contains a [Job] instance.\n */"} {"signature":"private fun < T > Subscriber < T > ? . reject ( t : Throwable )","body":"{ if ( this == null ) throw NullPointerException ( \"\" ) onSubscribe ( object : Subscription { override fun request ( n : Long ) { } override fun cancel ( ) { } } ) onError ( t ) }","docstring":"/** The proper way to reject the subscriber, according to\n * [the reactive spec](https://github.com/reactive-streams/reactive-streams-jvm/blob/v1.0.3/README.md#1.9)\n */"} {"signature":"@ Deprecated ( message = \"\" , level = DeprecationLevel . HIDDEN , replaceWith = ReplaceWith ( \"\" ) ) public fun < T > CoroutineScope . flux ( context : CoroutineContext = EmptyCoroutineContext , @ BuilderInference block : suspend ProducerScope < T > . ( ) -> Unit ) : Flux < T >","body":"= Flux . from ( reactorPublish ( this , context , block ) )","docstring":"/**\n * @suppress\n */"} {"signature":"@ Test fun testNotAllocatingExtraDispatchers ( )","body":"{ val barrier = BlockingBarrier ( ) val lock = SynchronizedObject ( ) suspend fun spin ( set : MutableSet < Worker > ) { repeat ( ) { synchronized ( lock ) { set . add ( Worker . current ) } delay ( ) } } val dispatcher = newFixedThreadPoolContext ( , \"\" ) try { runBlocking { val encounteredWorkers = mutableSetOf < Worker > ( ) val coroutine1 = launch ( dispatcher ) { barrier . await ( ) spin ( encounteredWorkers ) } val coroutine2 = launch ( dispatcher ) { barrier . await ( ) spin ( encounteredWorkers ) } listOf ( coroutine1 , coroutine2 ) . joinAll ( ) assertEquals ( , encounteredWorkers . size ) } } finally { dispatcher . close ( ) } }","docstring":"/**\n * Test that [newFixedThreadPoolContext] does not allocate more dispatchers than it needs to.\n * Incidentally also tests that it will allocate enough workers for its needs. Otherwise, the test will hang.\n */"} {"signature":"@ Test fun timeoutsNotPreventingClosing ( ) : Unit","body":"= runBlocking { val dispatcher = WorkerDispatcher ( \"\" ) withContext ( dispatcher ) { withTimeout ( . seconds ) { } } withTimeout ( . seconds ) { dispatcher . close ( ) yield ( ) } }","docstring":"/**\n * Test that [newSingleThreadContext] will not wait for the cancelled scheduled coroutines before closing.\n */"} {"signature":"public operator fun get ( index : Int ) : Int","body":"{ checkBounds ( index ) return array . atomicGet ( index ) }","docstring":"/**\n * Atomically gets the value of the element at the given [index].\n *\n * Provides sequential consistent ordering guarantees.\n *\n * @throws [IndexOutOfBoundsException] if the [index] is out of bounds of this array.\n */"} {"signature":"public operator fun set ( index : Int , newValue : Int ) : Unit","body":"{ checkBounds ( index ) array . atomicSet ( index , newValue ) }","docstring":"/**\n * Atomically sets the value of the element at the given [index] to the [new value][newValue].\n *\n * Provides sequential consistent ordering guarantees.\n *\n * @throws [IndexOutOfBoundsException] if the [index] is out of bounds of this array.\n */"} {"signature":"public fun getAndSet ( index : Int , newValue : Int ) : Int","body":"{ checkBounds ( index ) return array . getAndSet ( index , newValue ) }","docstring":"/**\n * Atomically sets the value of the element at the given [index] to the [new value][newValue]\n * and returns the old value of the element.\n *\n * Provides sequential consistent ordering guarantees.\n *\n * @throws [IndexOutOfBoundsException] if the [index] is out of bounds of this array.\n */"} {"signature":"public fun compareAndSet ( index : Int , expectedValue : Int , newValue : Int ) : Boolean","body":"{ checkBounds ( index ) return array . compareAndSet ( index , expectedValue , newValue ) }","docstring":"/**\n * Atomically sets the value of the element at the given [index] to the [new value][newValue]\n * if the current value equals the [expected value][expectedValue].\n * Returns true if the operation was successful and false only if the current value of the element was not equal to the expected value.\n *\n * Provides sequential consistent ordering guarantees and never fails spuriously.\n *\n * @throws [IndexOutOfBoundsException] if the [index] is out of bounds of this array.\n */"} {"signature":"public fun compareAndExchange ( index : Int , expectedValue : Int , newValue : Int ) : Int","body":"{ checkBounds ( index ) return array . compareAndExchange ( index , expectedValue , newValue ) }","docstring":"/**\n * Atomically sets the value of the element at the given [index] to the [new value][newValue]\n * if the current value equals the [expected value][expectedValue] and returns the old value of the element in any case.\n *\n * Provides sequential consistent ordering guarantees and never fails spuriously.\n *\n * @throws [IndexOutOfBoundsException] if the [index] is out of bounds of this array.\n */"} {"signature":"public fun getAndAdd ( index : Int , delta : Int ) : Int","body":"{ checkBounds ( index ) return array . getAndAdd ( index , delta ) }","docstring":"/**\n * Atomically adds the given [delta] to the element at the given [index] and returns the old value of the element.\n *\n * Provides sequential consistent ordering guarantees.\n *\n * @throws [IndexOutOfBoundsException] if the [index] is out of bounds of this array.\n */"} {"signature":"public fun addAndGet ( index : Int , delta : Int ) : Int","body":"{ checkBounds ( index ) return array . getAndAdd ( index , delta ) + delta }","docstring":"/**\n * Atomically adds the given [delta] to the element at the given [index] and returns the new value of the element.\n *\n * Provides sequential consistent ordering guarantees.\n *\n * @throws [IndexOutOfBoundsException] if the [index] is out of bounds of this array.\n */"} {"signature":"public fun getAndIncrement ( index : Int ) : Int","body":"{ checkBounds ( index ) return array . getAndAdd ( index , ) }","docstring":"/**\n * Atomically increments the element at the given [index] by one and returns the old value of the element.\n *\n * Provides sequential consistent ordering guarantees.\n *\n * @throws [IndexOutOfBoundsException] if the [index] is out of bounds of this array.\n */"} {"signature":"public fun incrementAndGet ( index : Int ) : Int","body":"{ checkBounds ( index ) return array . getAndAdd ( index , ) + }","docstring":"/**\n * Atomically increments the element at the given [index] by one and returns the new value of the element.\n *\n * Provides sequential consistent ordering guarantees.\n *\n * @throws [IndexOutOfBoundsException] if the [index] is out of bounds of this array.\n */"} {"signature":"public fun getAndDecrement ( index : Int ) : Int","body":"{ checkBounds ( index ) return array . getAndAdd ( index , - ) }","docstring":"/**\n * Atomically decrements the element at the given [index] by one and returns the old value of the element.\n *\n * Provides sequential consistent ordering guarantees.\n *\n * @throws [IndexOutOfBoundsException] if the [index] is out of bounds of this array.\n */"} {"signature":"public fun decrementAndGet ( index : Int ) : Int","body":"{ checkBounds ( index ) return array . getAndAdd ( index , - ) - }","docstring":"/**\n * Atomically decrements the element at the given [index] by one and returns the new value of the element.\n *\n * Provides sequential consistent ordering guarantees.\n *\n * @throws [IndexOutOfBoundsException] if the [index] is out of bounds of this array.\n */"} {"signature":"public override fun toString ( ) : String","body":"= array . toString ( )","docstring":"/**\n * Returns the string representation of the underlying [IntArray][array].\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ RequireKotlin ( version = \"\" , versionKind = RequireKotlinVersionKind . COMPILER_VERSION ) @ ExperimentalStdlibApi public inline fun AtomicIntArray ( size : Int , init : ( Int ) -> Int ) : AtomicIntArray","body":"{ val inner = IntArray ( size ) for ( index in until size ) { inner [ index ] = init ( index ) } return AtomicIntArray ( inner ) }","docstring":"/**\n * Creates a new [AtomicIntArray] of the given [size], where each element is initialized by calling the given [init] function.\n *\n * The function [init] is called for each array element sequentially starting from the first one.\n * It should return the value for an array element given its index.\n *\n * @throws RuntimeException if the specified [size] is negative.\n */"} {"signature":"public operator fun get ( index : Int ) : Long","body":"{ checkBounds ( index ) return array . atomicGet ( index ) }","docstring":"/**\n * Atomically gets the value of the element at the given [index].\n *\n * Provides sequential consistent ordering guarantees.\n *\n * @throws [IndexOutOfBoundsException] if the [index] is out of bounds of this array.\n */"} {"signature":"public operator fun set ( index : Int , newValue : Long ) : Unit","body":"{ checkBounds ( index ) array . atomicSet ( index , newValue ) }","docstring":"/**\n * Atomically sets the value of the element at the given [index] to the [new value][newValue].\n *\n * Provides sequential consistent ordering guarantees.\n *\n * @throws [IndexOutOfBoundsException] if the [index] is out of bounds of this array.\n */"} {"signature":"public fun getAndSet ( index : Int , newValue : Long ) : Long","body":"{ checkBounds ( index ) return array . getAndSet ( index , newValue ) }","docstring":"/**\n * Atomically sets the value of the element at the given [index] to the [new value][newValue]\n * and returns the old value of the element.\n *\n * Provides sequential consistent ordering guarantees.\n *\n * @throws [IndexOutOfBoundsException] if the [index] is out of bounds of this array.\n */"} {"signature":"public fun compareAndSet ( index : Int , expectedValue : Long , newValue : Long ) : Boolean","body":"{ checkBounds ( index ) return array . compareAndSet ( index , expectedValue , newValue ) }","docstring":"/**\n * Atomically sets the value of the element at the given [index] to the [new value][newValue]\n * if the current value equals the [expected value][expectedValue].\n * Returns true if the operation was successful and false only if the current value of the element was not equal to the expected value.\n *\n * Provides sequential consistent ordering guarantees and never fails spuriously.\n *\n * @throws [IndexOutOfBoundsException] if the [index] is out of bounds of this array.\n */"} {"signature":"public fun compareAndExchange ( index : Int , expectedValue : Long , newValue : Long ) : Long","body":"{ checkBounds ( index ) return array . compareAndExchange ( index , expectedValue , newValue ) }","docstring":"/**\n * Atomically sets the value of the element at the given [index] to the [new value][newValue]\n * if the current value equals the [expected value][expectedValue] and returns the old value of the element in any case.\n *\n * Provides sequential consistent ordering guarantees and never fails spuriously.\n *\n * @throws [IndexOutOfBoundsException] if the [index] is out of bounds of this array.\n */"} {"signature":"public fun getAndAdd ( index : Int , delta : Long ) : Long","body":"{ checkBounds ( index ) return array . getAndAdd ( index , delta ) }","docstring":"/**\n * Atomically adds the given [delta] to the element at the given [index] and returns the old value of the element.\n *\n * Provides sequential consistent ordering guarantees.\n *\n * @throws [IndexOutOfBoundsException] if the [index] is out of bounds of this array.\n */"} {"signature":"public fun addAndGet ( index : Int , delta : Long ) : Long","body":"{ checkBounds ( index ) return array . getAndAdd ( index , delta ) + delta }","docstring":"/**\n * Atomically adds the given [delta] to the element at the given [index] and returns the new value of the element.\n *\n * Provides sequential consistent ordering guarantees.\n *\n * @throws [IndexOutOfBoundsException] if the [index] is out of bounds of this array.\n */"} {"signature":"public fun getAndIncrement ( index : Int ) : Long","body":"{ checkBounds ( index ) return array . getAndAdd ( index , ) }","docstring":"/**\n * Atomically increments the element at the given [index] by one and returns the old value of the element.\n *\n * Provides sequential consistent ordering guarantees.\n *\n * @throws [IndexOutOfBoundsException] if the [index] is out of bounds of this array.\n */"} {"signature":"public fun incrementAndGet ( index : Int ) : Long","body":"{ checkBounds ( index ) return array . getAndAdd ( index , ) + }","docstring":"/**\n * Atomically increments the element at the given [index] by one and returns the new value of the element.\n *\n * Provides sequential consistent ordering guarantees.\n *\n * @throws [IndexOutOfBoundsException] if the [index] is out of bounds of this array.\n */"} {"signature":"public fun getAndDecrement ( index : Int ) : Long","body":"{ checkBounds ( index ) return array . getAndAdd ( index , - ) }","docstring":"/**\n * Atomically decrements the element at the given [index] by one and returns the old value of the element.\n *\n * Provides sequential consistent ordering guarantees.\n *\n * @throws [IndexOutOfBoundsException] if the [index] is out of bounds of this array.\n */"} {"signature":"public fun decrementAndGet ( index : Int ) : Long","body":"{ checkBounds ( index ) return array . getAndAdd ( index , - ) - }","docstring":"/**\n * Atomically decrements the element at the given [index] by one and returns the new value of the element.\n *\n * Provides sequential consistent ordering guarantees.\n *\n * @throws [IndexOutOfBoundsException] if the [index] is out of bounds of this array.\n */"} {"signature":"public override fun toString ( ) : String","body":"= array . toString ( )","docstring":"/**\n * Returns the string representation of the underlying [IntArray][array].\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ RequireKotlin ( version = \"\" , versionKind = RequireKotlinVersionKind . COMPILER_VERSION ) @ ExperimentalStdlibApi public inline fun AtomicLongArray ( size : Int , init : ( Int ) -> Long ) : AtomicLongArray","body":"{ val inner = LongArray ( size ) for ( index in until size ) { inner [ index ] = init ( index ) } return AtomicLongArray ( inner ) }","docstring":"/**\n * Creates a new [AtomicLongArray] of the given [size], where each element is initialized by calling the given [init] function.\n *\n * The function [init] is called for each array element sequentially starting from the first one.\n * It should return the value for an array element given its index.\n *\n * @throws RuntimeException if the specified [size] is negative.\n */"} {"signature":"public operator fun get ( index : Int ) : T","body":"{ checkBounds ( index ) return array . atomicGet ( index ) }","docstring":"/**\n * Atomically gets the value of the element at the given [index].\n *\n * Provides sequential consistent ordering guarantees.\n *\n * @throws [IndexOutOfBoundsException] if the [index] is out of bounds of this array.\n */"} {"signature":"public operator fun set ( index : Int , newValue : T ) : Unit","body":"{ checkBounds ( index ) array . atomicSet ( index , newValue ) }","docstring":"/**\n * Atomically sets the value of the element at the given [index] to the [new value][newValue].\n *\n * Provides sequential consistent ordering guarantees.\n *\n * @throws [IndexOutOfBoundsException] if the [index] is out of bounds of this array.\n */"} {"signature":"public fun getAndSet ( index : Int , newValue : T ) : T","body":"{ checkBounds ( index ) return array . getAndSet ( index , newValue ) }","docstring":"/**\n * Atomically sets the value of the element at the given [index] to the [new value][newValue]\n * and returns the old value of the element.\n *\n * Provides sequential consistent ordering guarantees.\n *\n * @throws [IndexOutOfBoundsException] if the [index] is out of bounds of this array.\n */"} {"signature":"public fun compareAndSet ( index : Int , expectedValue : T , newValue : T ) : Boolean","body":"{ checkBounds ( index ) return array . compareAndSet ( index , expectedValue , newValue ) }","docstring":"/**\n * Atomically sets the value of the element at the given [index] to the [new value][newValue]\n * if the current value equals the [expected value][expectedValue].\n * Returns true if the operation was successful and false only if the current value of the element was not equal to the expected value.\n *\n * Provides sequential consistent ordering guarantees and never fails spuriously.\n *\n * @throws [IndexOutOfBoundsException] if the [index] is out of bounds of this array.\n */"} {"signature":"public fun compareAndExchange ( index : Int , expectedValue : T , newValue : T ) : T","body":"{ checkBounds ( index ) return array . compareAndExchange ( index , expectedValue , newValue ) }","docstring":"/**\n * Atomically sets the value of the element at the given [index] to the [new value][newValue]\n * if the current value equals the [expected value][expectedValue] and returns the old value of the element in any case.\n *\n * Provides sequential consistent ordering guarantees and never fails spuriously.\n *\n * @throws [IndexOutOfBoundsException] if the [index] is out of bounds of this array.\n */"} {"signature":"public override fun toString ( ) : String","body":"= array . toString ( )","docstring":"/**\n * Returns the string representation of the underlying [IntArray][array].\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ RequireKotlin ( version = \"\" , versionKind = RequireKotlinVersionKind . COMPILER_VERSION ) @ ExperimentalStdlibApi @ Suppress ( \"\" ) public inline fun < reified T > AtomicArray ( size : Int , init : ( Int ) -> T ) : AtomicArray < T >","body":"{ val inner = arrayOfNulls < T > ( size ) for ( index in until size ) { inner [ index ] = init ( index ) } return AtomicArray ( inner as Array < T > ) }","docstring":"/**\n * Creates a new [AtomicArray] of the given [size], where each element is initialized by calling the given [init] function.\n *\n * The function [init] is called for each array element sequentially starting from the first one.\n * It should return the value for an array element given its index.\n *\n * @throws RuntimeException if the specified [size] is negative.\n */"} {"signature":"@ TypedIntrinsic ( IntrinsicType . ATOMIC_GET_ARRAY_ELEMENT ) internal external fun IntArray . atomicGet ( index : Int ) : Int","body":"@ TypedIntrinsic ( IntrinsicType . ATOMIC_GET_ARRAY_ELEMENT ) internal external fun IntArray . atomicGet ( index : Int ) : Int","docstring":"/**\n * Atomically gets the value of the [IntArray][this] element at the given [index].\n *\n * Provides sequential consistent ordering guarantees.\n *\n * NOTE: Ensure that the provided [index] does not exceed the size of the [array][this]. Exceeding the array size may result in undefined behavior.\n */"} {"signature":"@ TypedIntrinsic ( IntrinsicType . ATOMIC_SET_ARRAY_ELEMENT ) internal external fun IntArray . atomicSet ( index : Int , newValue : Int )","body":"@ TypedIntrinsic ( IntrinsicType . ATOMIC_SET_ARRAY_ELEMENT ) internal external fun IntArray . atomicSet ( index : Int , newValue : Int )","docstring":"/**\n * Atomically sets the value of the [IntArray][this] element at the given [index] to the [new value][newValue].\n *\n * Provides sequential consistent ordering guarantees.\n *\n * NOTE: Ensure that the provided [index] does not exceed the size of the [array][this]. Exceeding the array size may result in undefined behavior.\n */"} {"signature":"@ TypedIntrinsic ( IntrinsicType . GET_AND_SET_ARRAY_ELEMENT ) internal external fun IntArray . getAndSet ( index : Int , newValue : Int ) : Int","body":"@ TypedIntrinsic ( IntrinsicType . GET_AND_SET_ARRAY_ELEMENT ) internal external fun IntArray . getAndSet ( index : Int , newValue : Int ) : Int","docstring":"/**\n * Atomically sets the value of the [IntArray][this] element at the given [index] to the [new value][newValue]\n * and returns the old value of the element.\n *\n * Provides sequential consistent ordering guarantees.\n *\n * NOTE: Ensure that the provided [index] does not exceed the size of the [array][this]. Exceeding the array size may result in undefined behavior.\n */"} {"signature":"@ TypedIntrinsic ( IntrinsicType . GET_AND_ADD_ARRAY_ELEMENT ) internal external fun IntArray . getAndAdd ( index : Int , delta : Int ) : Int","body":"@ TypedIntrinsic ( IntrinsicType . GET_AND_ADD_ARRAY_ELEMENT ) internal external fun IntArray . getAndAdd ( index : Int , delta : Int ) : Int","docstring":"/**\n * Atomically adds the given [delta] to the [IntArray][this] element at the given [index]\n * and returns the old value of the element.\n *\n * Provides sequential consistent ordering guarantees.\n *\n * NOTE: Ensure that the provided [index] does not exceed the size of the [array][this]. Exceeding the array size may result in undefined behavior.\n */"} {"signature":"@ TypedIntrinsic ( IntrinsicType . COMPARE_AND_EXCHANGE_ARRAY_ELEMENT ) internal external fun IntArray . compareAndExchange ( index : Int , expectedValue : Int , newValue : Int ) : Int","body":"@ TypedIntrinsic ( IntrinsicType . COMPARE_AND_EXCHANGE_ARRAY_ELEMENT ) internal external fun IntArray . compareAndExchange ( index : Int , expectedValue : Int , newValue : Int ) : Int","docstring":"/**\n * Atomically sets the value of the [IntArray][this] element at the given [index] to the [new value][newValue]\n * if the current value equals the [expected value][expectedValue] and returns the old value of the element in any case.\n *\n * Provides sequential consistent ordering guarantees and never fails spuriously.\n *\n * NOTE: Ensure that the provided [index] does not exceed the size of the [array][this]. Exceeding the array size may result in undefined behavior.\n */"} {"signature":"@ TypedIntrinsic ( IntrinsicType . COMPARE_AND_SET_ARRAY_ELEMENT ) internal external fun IntArray . compareAndSet ( index : Int , expectedValue : Int , newValue : Int ) : Boolean","body":"@ TypedIntrinsic ( IntrinsicType . COMPARE_AND_SET_ARRAY_ELEMENT ) internal external fun IntArray . compareAndSet ( index : Int , expectedValue : Int , newValue : Int ) : Boolean","docstring":"/**\n * Atomically sets the value of the [IntArray][this] element at the given [index] to the [new value][newValue]\n * if the current value equals the [expected value][expectedValue].\n * Returns true if the operation was successful and false only if the current value of the element was not equal to the expected value.\n *\n * Provides sequential consistent ordering guarantees and never fails spuriously.\n *\n * NOTE: Ensure that the provided [index] does not exceed the size of the [array][this]. Exceeding the array size may result in undefined behavior.\n */"} {"signature":"@ TypedIntrinsic ( IntrinsicType . ATOMIC_GET_ARRAY_ELEMENT ) internal external fun LongArray . atomicGet ( index : Int ) : Long","body":"@ TypedIntrinsic ( IntrinsicType . ATOMIC_GET_ARRAY_ELEMENT ) internal external fun LongArray . atomicGet ( index : Int ) : Long","docstring":"/**\n * Atomically gets the value of the [LongArray][this] element at the given [index].\n *\n * Provides sequential consistent ordering guarantees.\n *\n * NOTE: Ensure that the provided [index] does not exceed the size of the [array][this]. Exceeding the array size may result in undefined behavior.\n */"} {"signature":"@ TypedIntrinsic ( IntrinsicType . ATOMIC_SET_ARRAY_ELEMENT ) internal external fun LongArray . atomicSet ( index : Int , newValue : Long )","body":"@ TypedIntrinsic ( IntrinsicType . ATOMIC_SET_ARRAY_ELEMENT ) internal external fun LongArray . atomicSet ( index : Int , newValue : Long )","docstring":"/**\n * Atomically sets the value of the [LongArray][this] element at the given [index] to the [new value][newValue].\n *\n * Provides sequential consistent ordering guarantees.\n *\n * NOTE: Ensure that the provided [index] does not exceed the size of the [array][this]. Exceeding the array size may result in undefined behavior.\n */"} {"signature":"@ TypedIntrinsic ( IntrinsicType . GET_AND_SET_ARRAY_ELEMENT ) internal external fun LongArray . getAndSet ( index : Int , newValue : Long ) : Long","body":"@ TypedIntrinsic ( IntrinsicType . GET_AND_SET_ARRAY_ELEMENT ) internal external fun LongArray . getAndSet ( index : Int , newValue : Long ) : Long","docstring":"/**\n * Atomically sets the value of the [LongArray][this] element at the given [index] to the [new value][newValue]\n * and returns the old value of the element.\n *\n * Provides sequential consistent ordering guarantees.\n *\n * NOTE: Ensure that the provided [index] does not exceed the size of the [array][this]. Exceeding the array size may result in undefined behavior.\n */"} {"signature":"@ TypedIntrinsic ( IntrinsicType . GET_AND_ADD_ARRAY_ELEMENT ) internal external fun LongArray . getAndAdd ( index : Int , delta : Long ) : Long","body":"@ TypedIntrinsic ( IntrinsicType . GET_AND_ADD_ARRAY_ELEMENT ) internal external fun LongArray . getAndAdd ( index : Int , delta : Long ) : Long","docstring":"/**\n * Atomically adds the given [delta] to the [LongArray][this] element at the given [index]\n * and returns the old value of the element.\n *\n * Provides sequential consistent ordering guarantees.\n *\n * NOTE: Ensure that the provided [index] does not exceed the size of the [array][this]. Exceeding the array size may result in undefined behavior.\n */"} {"signature":"@ TypedIntrinsic ( IntrinsicType . COMPARE_AND_EXCHANGE_ARRAY_ELEMENT ) internal external fun LongArray . compareAndExchange ( index : Int , expectedValue : Long , newValue : Long ) : Long","body":"@ TypedIntrinsic ( IntrinsicType . COMPARE_AND_EXCHANGE_ARRAY_ELEMENT ) internal external fun LongArray . compareAndExchange ( index : Int , expectedValue : Long , newValue : Long ) : Long","docstring":"/**\n * Atomically sets the value of the [LongArray][this] element at the given [index] to the [new value][newValue]\n * if the current value equals the [expected value][expectedValue] and returns the old value of the element in any case.\n *\n * Provides sequential consistent ordering guarantees and never fails spuriously.\n *\n * NOTE: Ensure that the provided [index] does not exceed the size of the [array][this]. Exceeding the array size may result in undefined behavior.\n */"} {"signature":"@ TypedIntrinsic ( IntrinsicType . COMPARE_AND_SET_ARRAY_ELEMENT ) internal external fun LongArray . compareAndSet ( index : Int , expectedValue : Long , newValue : Long ) : Boolean","body":"@ TypedIntrinsic ( IntrinsicType . COMPARE_AND_SET_ARRAY_ELEMENT ) internal external fun LongArray . compareAndSet ( index : Int , expectedValue : Long , newValue : Long ) : Boolean","docstring":"/**\n * Atomically sets the value of the [LongArray][this] element at the given [index] to the [new value][newValue]\n * if the current value equals the [expected value][expectedValue].\n * Returns true if the operation was successful and false only if the current value of the element was not equal to the expected value.\n *\n * Provides sequential consistent ordering guarantees and never fails spuriously.\n *\n * NOTE: Ensure that the provided [index] does not exceed the size of the [array][this]. Exceeding the array size may result in undefined behavior.\n */"} {"signature":"@ TypedIntrinsic ( IntrinsicType . ATOMIC_GET_ARRAY_ELEMENT ) internal external fun < T > Array < T > . atomicGet ( index : Int ) : T","body":"@ TypedIntrinsic ( IntrinsicType . ATOMIC_GET_ARRAY_ELEMENT ) internal external fun < T > Array < T > . atomicGet ( index : Int ) : T","docstring":"/**\n * Atomically gets the value of the [Array][this] element at the given [index].\n *\n * Provides sequential consistent ordering guarantees.\n *\n * NOTE: Ensure that the provided [index] does not exceed the size of the [array][this]. Exceeding the array size may result in undefined behavior.\n */"} {"signature":"@ TypedIntrinsic ( IntrinsicType . ATOMIC_SET_ARRAY_ELEMENT ) internal external fun < T > Array < T > . atomicSet ( index : Int , newValue : T )","body":"@ TypedIntrinsic ( IntrinsicType . ATOMIC_SET_ARRAY_ELEMENT ) internal external fun < T > Array < T > . atomicSet ( index : Int , newValue : T )","docstring":"/**\n * Atomically sets the value of the [Array][this] element at the given [index] to the [new value][newValue].\n *\n * Provides sequential consistent ordering guarantees.\n *\n * NOTE: Ensure that the provided [index] does not exceed the size of the [array][this]. Exceeding the array size may result in undefined behavior.\n */"} {"signature":"@ TypedIntrinsic ( IntrinsicType . GET_AND_SET_ARRAY_ELEMENT ) internal external fun < T > Array < T > . getAndSet ( index : Int , value : T ) : T","body":"@ TypedIntrinsic ( IntrinsicType . GET_AND_SET_ARRAY_ELEMENT ) internal external fun < T > Array < T > . getAndSet ( index : Int , value : T ) : T","docstring":"/**\n * Atomically sets the value of the [Array][this] element at the given [index] to the [new value][newValue]\n * and returns the old value of the element.\n *\n * Provides sequential consistent ordering guarantees.\n *\n * NOTE: Ensure that the provided [index] does not exceed the size of the [array][this]. Exceeding the array size may result in undefined behavior.\n */"} {"signature":"@ TypedIntrinsic ( IntrinsicType . COMPARE_AND_EXCHANGE_ARRAY_ELEMENT ) internal external fun < T > Array < T > . compareAndExchange ( index : Int , expectedValue : T , newValue : T ) : T","body":"@ TypedIntrinsic ( IntrinsicType . COMPARE_AND_EXCHANGE_ARRAY_ELEMENT ) internal external fun < T > Array < T > . compareAndExchange ( index : Int , expectedValue : T , newValue : T ) : T","docstring":"/**\n * Atomically sets the value of the [Array][this] element at the given [index] to the [new value][newValue]\n * if the current value equals the [expected value][expectedValue] and returns the old value of the element in any case.\n *\n * Comparison of values is done by reference.\n *\n * Provides sequential consistent ordering guarantees and never fails spuriously.\n *\n * NOTE: Ensure that the provided [index] does not exceed the size of the [array][this]. Exceeding the array size may result in undefined behavior.\n */"} {"signature":"@ TypedIntrinsic ( IntrinsicType . COMPARE_AND_SET_ARRAY_ELEMENT ) internal external fun < T > Array < T > . compareAndSet ( index : Int , expectedValue : T , newValue : T ) : Boolean","body":"@ TypedIntrinsic ( IntrinsicType . COMPARE_AND_SET_ARRAY_ELEMENT ) internal external fun < T > Array < T > . compareAndSet ( index : Int , expectedValue : T , newValue : T ) : Boolean","docstring":"/**\n * Atomically sets the value of the [Array][this] element at the given [index] to the [new value][newValue]\n * if the current value equals the [expected value][expectedValue].\n * Returns true if the operation was successful and false only if the current value of the element was not equal to the expected value.\n *\n * Comparison of values is done by reference.\n *\n * Provides sequential consistent ordering guarantees and never fails spuriously.\n *\n * NOTE: Ensure that the provided [index] does not exceed the size of the [array][this]. Exceeding the array size may result in undefined behavior.\n */"} {"signature":"fun parse ( testProject : TestProject , logger : DokkaLogger ) : DModule","body":"{ return withTempDirectory ( logger ) { tempDirectory -> val ( _ , context ) = testProject . initialize ( outputDirectory = tempDirectory , logger ) generateDocumentableModel ( context , logger ) } }","docstring":"/**\n * A quick way to analyze a [TestProject], for cases when only the documentable\n * model is needed to verify the result.\n *\n * Creates the input test files, runs Dokka and then deletes them right after the documentable\n * model has been created, leaving no trailing files or any other garbage behind.\n *\n * @see [TestProject.parse] for a user-friendly way to call it\n */"} {"signature":"fun analyze ( testProject : TestProject , persistentDirectory : File , logger : DokkaLogger ) : Pair < TestAnalysisServices , TestAnalysisContext >","body":"{ val ( dokkaConfiguration , dokkaContext ) = testProject . initialize ( outputDirectory = persistentDirectory , logger ) val analysisServices = createTestAnalysisServices ( dokkaContext , logger ) val testAnalysisContext = TestAnalysisContext ( context = dokkaContext , configuration = dokkaConfiguration , module = generateDocumentableModel ( dokkaContext , logger ) ) return analysisServices to testAnalysisContext }","docstring":"/**\n * Works in the same way as [parse], but it returns the context and configuration used for\n * running Dokka, and does not delete the input test files at the end of the execution - it\n * must be taken care of on call site.\n *\n * @param persistentDirectory a directory that will be used to generate the input test files into.\n * It must be available during the test run, especially if services are used,\n * otherwise parts of Dokka might not work as expected. Can be safely deleted\n * at the end of the test after all asserts have been run.\n *\n * @see [TestProject.useServices] for a user-friendly way to call it\n */"} {"signature":"private fun TestProject . initialize ( outputDirectory : File , logger : DokkaLogger ) : Pair < DokkaConfiguration , DokkaContext >","body":"{ logger . progress ( \"\" ) this . verify ( ) require ( outputDirectory . isDirectory ) { \"\" } this . initializeTestFiles ( relativeToDir = outputDirectory , logger ) logger . progress ( \"\" ) val testDokkaConfiguration = this . getConfiguration ( ) val dokkaConfiguration = testDokkaConfiguration . toDokkaConfiguration ( projectDir = outputDirectory ) . also { it . verify ( ) } return dokkaConfiguration to createContext ( dokkaConfiguration , logger , getPluginList ( ) ) }","docstring":"/**\n * Prepares this [TestProject] for analysis by creating\n * the test files, setting up context and configuration.\n */"} {"signature":"private fun TestProject . initializeTestFiles ( relativeToDir : File , logger : DokkaLogger )","body":"{ logger . progress ( \"\" ) this . getTestData ( ) . getFiles ( ) . forEach { val testDataFile = relativeToDir . resolve ( it . pathFromProjectRoot . removePrefix ( \"\" ) ) try { testDataFile . parentFile . mkdirs ( ) } catch ( e : Exception ) { throw IllegalStateException ( \"\" , e ) } logger . debug ( \"\" ) check ( testDataFile . createNewFile ( ) ) { \"\" } testDataFile . writeText ( it . getContents ( ) , Charsets . UTF_8 ) } }","docstring":"/**\n * Takes the virtual [TestDataFile] of this [TestProject] and creates\n * the real files relative to the [relativeToDir] param.\n */"} {"signature":"private fun DokkaConfiguration . verify ( )","body":"{ this . includes . forEach { verifyFileExists ( it ) } this . sourceSets . forEach { sourceSet -> sourceSet . classpath . forEach { verifyFileExists ( it ) } sourceSet . includes . forEach { verifyFileExists ( it ) } sourceSet . samples . forEach { verifyFileExists ( it ) } } }","docstring":"/**\n * Verifies this [DokkaConfiguration] to make sure there are no unexpected\n * parameter option values, such as non-existing classpath entries.\n *\n * If this method fails, it's likely there's a configuration error in the test,\n * or an exception must be made in one of the checks.\n */"} {"signature":"private fun generateDocumentableModel ( context : DokkaContext , logger : DokkaLogger ) : DModule","body":"{ logger . progress ( \"\" ) val sourceSetModules = context . configuration . sourceSets . map { sourceSet -> translateSources ( sourceSet , context , logger ) } . flatten ( ) if ( sourceSetModules . isEmpty ( ) ) { throw IllegalStateException ( \"\" ) } return DefaultDocumentableMerger ( context ) . invoke ( sourceSetModules ) ? : error ( \"\" ) }","docstring":"/**\n * Generates the documentable model by using all available [SourceToDocumentableTranslator] extensions,\n * and then merging all the results into a single [DModule] by calling [DocumentableMerger].\n */"} {"signature":"private fun translateSources ( sourceSet : DokkaConfiguration . DokkaSourceSet , context : DokkaContext , logger : DokkaLogger ) : List < DModule >","body":"{ val translators = context [ CoreExtensions . sourceToDocumentableTranslator ] require ( translators . isNotEmpty ( ) ) { \"\" } logger . debug ( \"\" ) return translators . map { it . invoke ( sourceSet , context ) } }","docstring":"/**\n * Translates input source files to the documentable model by using\n * all registered [SourceToDocumentableTranslator] core extensions.\n */"} {"signature":"private fun createTestAnalysisServices ( context : DokkaContext , logger : DokkaLogger ) : TestAnalysisServices","body":"{ logger . progress ( \"\" ) val publicAnalysisPlugin = context . plugin < KotlinAnalysisPlugin > ( ) val internalAnalysisPlugin = context . plugin < InternalKotlinAnalysisPlugin > ( ) return TestAnalysisServices ( sampleAnalysisEnvironmentCreator = publicAnalysisPlugin . querySingle { sampleAnalysisEnvironmentCreator } , externalDocumentableProvider = publicAnalysisPlugin . querySingle { externalDocumentableProvider } , moduleAndPackageDocumentationReader = internalAnalysisPlugin . querySingle { moduleAndPackageDocumentationReader } ) }","docstring":"/**\n * A helper function to query analysis services, to avoid\n * boilerplate and misconfiguration in the tests.\n *\n * The idea is to provide the users with ready-to-use services,\n * without them having to know how to query or configure them.\n */"} {"signature":"abstract fun findClass ( name : String , pathSegments : List < String > ) : JavaClassifier ?","body":"abstract fun findClass ( name : String , pathSegments : List < String > ) : JavaClassifier ?","docstring":"/**\n * @param name name of a class to find\n * @param pathSegments name of a class to find that is split into path segments (e.g. Outer.Inner -> {\"Outer\", \"Inner\"})\n */"} {"signature":"fun FunctionSymbolMarker . allRecursivelyOverriddenDeclarationsIncludingSelf ( containingClass : RegularClassSymbolMarker ? ) : List < CallableSymbolMarker >","body":"fun FunctionSymbolMarker . allRecursivelyOverriddenDeclarationsIncludingSelf ( containingClass : RegularClassSymbolMarker ? ) : List < CallableSymbolMarker >","docstring":"/**\n * Returns all symbols that are overridden by [this] symbol, including self\n */"} {"signature":"fun skipCheckingAnnotationsOfActualClassMember ( actualMember : DeclarationSymbolMarker ) : Boolean","body":"fun skipCheckingAnnotationsOfActualClassMember ( actualMember : DeclarationSymbolMarker ) : Boolean","docstring":"/**\n * Determines whether it is needed to skip checking annotations on class member in [AbstractExpectActualAnnotationMatchChecker].\n *\n * This is needed to prevent checking member twice if it is real `actual` member (not fake override or member of\n * class being typealiased).\n * Example:\n * ```\n * actual class A {\n * actual fun foo() {} // 1: checked itself, 2: checked as member of A\n * }\n * ```\n */"} {"signature":"fun check ( expectAnnotations : List < AnnotationCallInfo > , actualAnnotations : List < AnnotationCallInfo > , actualTypeRefSource : SourceElementMarker , )","body":"fun check ( expectAnnotations : List < AnnotationCallInfo > , actualAnnotations : List < AnnotationCallInfo > , actualTypeRefSource : SourceElementMarker , )","docstring":"/**\n * Implementation must check `expect` and `actual` annotations and report diagnostic in case of incompatibility.\n * [actualTypeRefSource] is needed in order to know where on the `actual` declaration to insert the missing annotation\n * from the `expect` declaration (see [AbstractExpectActualAnnotationMatchChecker.Incompatibility.actualAnnotationTargetElement]).\n */"} {"signature":"fun checkAnnotationsOnTypeRefAndArguments ( expectContainingSymbol : DeclarationSymbolMarker , actualContainingSymbol : DeclarationSymbolMarker , expectTypeRef : TypeRefMarker , actualTypeRef : TypeRefMarker , checker : AnnotationsCheckerCallback , )","body":"fun checkAnnotationsOnTypeRefAndArguments ( expectContainingSymbol : DeclarationSymbolMarker , actualContainingSymbol : DeclarationSymbolMarker , expectTypeRef : TypeRefMarker , actualTypeRef : TypeRefMarker , checker : AnnotationsCheckerCallback , )","docstring":"/**\n * Finds pairs of matching expect and actual types, on which annotations must be checked by [AbstractExpectActualAnnotationMatchChecker].\n *\n * This is done by recursively traversing [expectTypeRef] and [actualTypeRef] and their arguments, which is needed in case of\n * complex types like `T1>`. Founded expect and actual annotations are passed to [checker] callback.\n * For functional types (e.g. `ReceiverType.(Arg1Type) -> ReturnType`) receiver, argument and return types and their arguments\n * are checked.\n *\n * **Example**: for type `@Ann1 List<@Ann2 Map<@Ann3 Int, @Ann4 String>>`, there are 4 types to check in [checker].\n */"} {"signature":"inline fun < reified T : Any > onVariable ( noinline callback : VariableDeclarationCallback < T > )","body":"{ addTypeConverter ( FieldHandlerFactory . createDeclareHandler ( TypeDetection . COMPILE_TIME , callback ) ) }","docstring":"/**\n * Runs [callback] for every snippet property of compile-time subtype of type [T]\n *\n * [callback] gives access to both runtime value of the property and its [KProperty] object\n */"} {"signature":"inline fun < reified T : Any > updateVariable ( noinline callback : VariableUpdateCallback < T > )","body":"{ addTypeConverter ( FieldHandlerFactory . createUpdateHandler ( TypeDetection . COMPILE_TIME , callback ) ) }","docstring":"/**\n * Runs [callback] for every snippet property of compile-time subtype of type [T]\n *\n * [callback] gives access to both runtime value of the property and its [KProperty] object\n *\n * [callback] should usually execute some code that:\n * - has non-Unit result and return the name of result field\n * - defines some variable and return its name\n *\n * Original variable will then be **reassigned** to this new name.\n *\n * For example:\n *\n * ```\n * updateVariable { value, kProperty ->\n * // MyWrapper class should be previously defined in the notebook\n * execute(\"MyWrapper(${kProperty.name})\").name\n * }\n * ```\n * or\n * ```\n * updateVariable { value, kProperty ->\n * // MyWrapper class should be previously defined in the notebook\n * execute(\"val wrapper = MyWrapper(${kProperty.name})\")\n * return \"wrapper\"\n * }\n * ```\n */"} {"signature":"inline fun < reified T : Any > onVariableByRuntimeType ( noinline callback : VariableDeclarationCallback < T > )","body":"{ addTypeConverter ( FieldHandlerFactory . createDeclareHandler ( TypeDetection . RUNTIME , callback ) ) }","docstring":"/**\n * Same as [onVariable], but based on runtime type that is figured out by reflection\n */"} {"signature":"inline fun < reified T : Any > updateVariableByRuntimeType ( noinline callback : VariableUpdateCallback < T > )","body":"{ addTypeConverter ( FieldHandlerFactory . createUpdateHandler ( TypeDetection . RUNTIME , callback ) ) }","docstring":"/**\n * Same as [updateVariable], but based on runtime type that is figured out by reflection\n */"} {"signature":"fun addIntegrationTypeNameRule ( rule : AcceptanceRule < TypeName > )","body":"{ integrationTypeNameRules . add ( rule ) }","docstring":"/**\n * All integrations transitively loaded by this integration will be tested against\n * passed acceptance rule and won't be loaded if the rule returned `false`.\n * If there were no acceptance rules that returned not-null values, integration\n * **will be loaded**. If there are several acceptance rules that returned not-null values,\n * the latest one will be taken into account.\n */"} {"signature":"fun acceptIntegrationTypeNameIf ( predicate : ( TypeName ) -> Boolean )","body":"{ addIntegrationTypeNameRule ( NameAcceptanceRule ( true , predicate ) ) }","docstring":"/**\n * See [addIntegrationTypeNameRule]\n */"} {"signature":"fun discardIntegrationTypeNameIf ( predicate : ( TypeName ) -> Boolean )","body":"{ addIntegrationTypeNameRule ( NameAcceptanceRule ( false , predicate ) ) }","docstring":"/**\n * See [addIntegrationTypeNameRule]\n */"} {"signature":"fun resnet50easyPrediction2 ( )","body":"{ val modelHub = TFModelHub ( cacheDirectory = File ( \"\" ) ) val model = modelHub [ TFModels . CV . ResNet50 ( ) ] model . use { for ( i in .. ) { val imageFile = getFileFromResource ( \"\" ) val recognizedObject = it . predictObject ( imageFile = imageFile ) println ( recognizedObject ) val top5 = it . predictTopKObjects ( imageFile = imageFile , topK = ) println ( top5 . toString ( ) ) } } }","docstring":"/**\n * This example demonstrates the inference concept on ResNet'50 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 * - No additional training.\n * - No new layers are added.\n * - Special preprocessing (used in ResNet'50 during training on ImageNet dataset) is applied to each image before prediction.\n */"} {"signature":"fun main ( ) : Unit","body":"= resnet50easyPrediction2 ( )","docstring":"/** */"} {"signature":"@ Test fun testCreateThrowsOnInvalidArguments ( )","body":"{ for ( ctx in invalidContexts ) { assertFailsWith < IllegalArgumentException > { TestScope ( ctx ) } } }","docstring":"/** Tests failing to create a [TestScope] with incorrect contexts. */"} {"signature":"@ Test fun testCreateProvidesScheduler ( )","body":"{ run { val scope = TestScope ( ) assertNotNull ( scope . coroutineContext [ TestCoroutineScheduler ] ) } run { val dispatcher = StandardTestDispatcher ( ) val scope = TestScope ( dispatcher ) assertSame ( dispatcher . scheduler , scope . coroutineContext [ TestCoroutineScheduler ] ) } run { val scheduler = TestCoroutineScheduler ( ) val scope = TestScope ( scheduler ) assertSame ( scheduler , scope . coroutineContext [ TestCoroutineScheduler ] ) assertSame ( scheduler , ( scope . coroutineContext [ ContinuationInterceptor ] as TestDispatcher ) . scheduler ) } run { val scheduler = TestCoroutineScheduler ( ) val dispatcher = StandardTestDispatcher ( scheduler ) val scope = TestScope ( scheduler + dispatcher ) assertSame ( scheduler , scope . coroutineContext [ TestCoroutineScheduler ] ) assertSame ( dispatcher , scope . coroutineContext [ ContinuationInterceptor ] ) } }","docstring":"/** Tests that a newly-created [TestScope] provides the correct scheduler. */"} {"signature":"@ Test fun testCreateReusesScheduler ( )","body":"{ run { val scheduler = TestCoroutineScheduler ( ) val mainDispatcher = StandardTestDispatcher ( scheduler ) Dispatchers . setMain ( mainDispatcher ) try { val scope = TestScope ( ) assertSame ( scheduler , scope . coroutineContext [ TestCoroutineScheduler ] ) assertNotSame ( mainDispatcher , scope . coroutineContext [ ContinuationInterceptor ] ) } finally { Dispatchers . resetMain ( ) } } run { val mainDispatcher = StandardTestDispatcher ( ) Dispatchers . setMain ( mainDispatcher ) try { val scheduler = TestCoroutineScheduler ( ) val scope = TestScope ( scheduler ) assertSame ( scheduler , scope . coroutineContext [ TestCoroutineScheduler ] ) assertNotSame ( mainDispatcher . scheduler , scope . coroutineContext [ TestCoroutineScheduler ] ) assertNotSame ( mainDispatcher , scope . coroutineContext [ ContinuationInterceptor ] ) } finally { Dispatchers . resetMain ( ) } } }","docstring":"/** Part of [testCreateProvidesScheduler], disabled for Native */"} {"signature":"@ Test fun testPresentDelaysThrowing ( )","body":"{ val scope = TestScope ( ) var result = false scope . launch { delay ( ) result = true } assertFalse ( result ) scope . asSpecificImplementation ( ) . enter ( ) assertFailsWith < UncompletedCoroutinesError > { scope . asSpecificImplementation ( ) . legacyLeave ( ) } assertFalse ( result ) }","docstring":"/** Tests that the cleanup procedure throws if there were uncompleted delays by the end. */"} {"signature":"@ Test fun testActiveJobsThrowing ( )","body":"{ val scope = TestScope ( ) var result = false val deferred = CompletableDeferred < String > ( ) scope . launch { deferred . await ( ) result = true } assertFalse ( result ) scope . asSpecificImplementation ( ) . enter ( ) assertFailsWith < UncompletedCoroutinesError > { scope . asSpecificImplementation ( ) . legacyLeave ( ) } assertFalse ( result ) }","docstring":"/** Tests that the cleanup procedure throws if there were active jobs by the end. */"} {"signature":"@ Test fun testCancelledDelaysThrowing ( )","body":"{ val scope = TestScope ( ) var result = false val deferred = CompletableDeferred < String > ( ) val job = scope . launch { deferred . await ( ) result = true } job . cancel ( ) assertFalse ( result ) scope . asSpecificImplementation ( ) . enter ( ) assertFailsWith < UncompletedCoroutinesError > { scope . asSpecificImplementation ( ) . legacyLeave ( ) } assertFalse ( result ) }","docstring":"/** Tests that the cleanup procedure throws even if it detects that the job is already cancelled. */"} {"signature":"@ Test fun testGetsCancelledOnChildFailure ( ) : TestResult","body":"{ val scope = TestScope ( ) val exception = TestException ( \"\" ) scope . launch { throw exception } return testResultMap ( { try { it ( ) fail ( \"\" ) } catch ( e : TestException ) { } } ) { scope . runTest { } } }","docstring":"/** Tests that uncaught exceptions are thrown at the cleanup. */"} {"signature":"@ Test fun testSuppressedExceptions ( )","body":"{ TestScope ( ) . apply { asSpecificImplementation ( ) . enter ( ) launch ( SupervisorJob ( ) ) { throw TestException ( \"\" ) } launch ( SupervisorJob ( ) ) { throw TestException ( \"\" ) } launch ( SupervisorJob ( ) ) { throw TestException ( \"\" ) } runCurrent ( ) val e = asSpecificImplementation ( ) . legacyLeave ( ) assertEquals ( , e . size ) assertEquals ( \"\" , e [ ] . message ) assertEquals ( \"\" , e [ ] . message ) assertEquals ( \"\" , e [ ] . message ) } }","docstring":"/** Tests that, when reporting several exceptions, the first one is thrown, with the rest suppressed. */"} {"signature":"@ Test fun testBackgroundWorkBeingRun ( ) : TestResult","body":"= runTest { var i = var j = backgroundScope . launch { ++ i } backgroundScope . launch { delay ( ) ++ j } assertEquals ( , i ) assertEquals ( , j ) delay ( ) assertEquals ( , i ) assertEquals ( , j ) delay ( ) assertEquals ( , i ) assertEquals ( , j ) }","docstring":"/** Tests that the background work is being run at all. */"} {"signature":"@ Test fun testBackgroundWorkCancelled ( ) : TestResult","body":"{ var cancelled = false return testResultMap ( { it ( ) assertTrue ( cancelled ) } ) { runTest { var i = backgroundScope . launch { try { while ( isActive ) { ++ i yield ( ) } } catch ( e : CancellationException ) { cancelled = true } } repeat ( ) { assertEquals ( i , it ) yield ( ) } } } }","docstring":"/**\n * Tests that the background work gets cancelled after the test body finishes.\n */"} {"signature":"@ Test fun testBackgroundWorkTimeControl ( ) : TestResult","body":"= runTest { var i = var j = backgroundScope . launch { while ( true ) { ++ i delay ( ) } } backgroundScope . launch { while ( true ) { ++ j delay ( ) } } advanceUntilIdle ( ) assertEquals ( , i ) assertEquals ( , j ) val job = launch { delay ( ) assertEquals ( , i ) assertEquals ( , j ) } job . join ( ) advanceTimeBy ( . milliseconds ) assertEquals ( , i ) assertEquals ( , j ) advanceUntilIdle ( ) assertEquals ( , i ) assertEquals ( , j ) runCurrent ( ) assertEquals ( , i ) assertEquals ( , j ) launch { delay ( ) assertEquals ( , i ) assertEquals ( , j ) } advanceUntilIdle ( ) }","docstring":"/** Tests the interactions between the time-control commands and the background work. */"} {"signature":"@ Test fun testBackgroundWorkErrorReporting ( ) : TestResult","body":"{ var testFinished = false val exception = RuntimeException ( \"\" ) return testResultMap ( { try { it ( ) fail ( \"\" ) } catch ( e : Throwable ) { assertSame ( e , exception ) assertTrue ( testFinished ) } } ) { runTest { backgroundScope . launch { throw exception } delay ( ) testFinished = true } } }","docstring":"/**\n * Tests that an error in a background coroutine does not cancel the test, but is reported at the end.\n */"} {"signature":"@ Test fun testBackgroundWorkFinalizing ( ) : TestResult","body":"{ var taskEnded = val nTasks = return testResultMap ( { try { it ( ) fail ( \"\" ) } catch ( e : TestException ) { assertEquals ( , e . suppressedExceptions . size ) assertEquals ( nTasks , taskEnded ) } } ) { runTest { repeat ( nTasks ) { backgroundScope . launch { try { while ( true ) { delay ( ) } } finally { ++ taskEnded if ( taskEnded <= ) throw TestException ( ) } } } delay ( ) throw TestException ( ) } } }","docstring":"/**\n * Tests that the background work gets to finish what it's doing after the test is completed.\n */"} {"signature":"@ Test fun testExampleBackgroundJob1 ( )","body":"= runTest { val myFlow = flow { var i = while ( true ) { emit ( ++ i ) delay ( ) } } val stateFlow = myFlow . stateIn ( backgroundScope , SharingStarted . Eagerly , ) var j = repeat ( ) { assertEquals ( j ++ , stateFlow . value ) delay ( ) } }","docstring":"/**\n * Tests using [Flow.stateIn] as a background job.\n */"} {"signature":"@ Test fun testExampleBackgroundJob2 ( )","body":"= runTest { val channel = Channel < Int > ( ) backgroundScope . launch { var i = while ( true ) { channel . send ( i ++ ) } } repeat ( ) { assertEquals ( it , channel . receive ( ) ) } }","docstring":"/**\n * A test from the documentation of [TestScope.backgroundScope].\n */"} {"signature":"@ Test fun testBackgroundWorkNotPreventingTimeout ( ) : TestResult","body":"= testResultMap ( { try { it ( ) fail ( \"\" ) } catch ( _ : UncompletedCoroutinesError ) { } } ) { runTest ( timeout = . milliseconds ) { backgroundScope . launch { while ( true ) { yield ( ) } } backgroundScope . launch { while ( true ) { delay ( ) } } val deferred = CompletableDeferred < Unit > ( ) deferred . await ( ) } }","docstring":"/**\n * Tests that the test will timeout due to idleness even if some background tasks are running.\n */"} {"signature":"@ Test fun testUnconfinedBackgroundWorkNotPreventingTimeout ( ) : TestResult","body":"= testResultMap ( { try { it ( ) fail ( \"\" ) } catch ( _ : UncompletedCoroutinesError ) { } } ) { runTest ( UnconfinedTestDispatcher ( ) , timeout = . milliseconds ) { backgroundScope . launch { while ( true ) { delay ( ) } } val deferred = CompletableDeferred < Unit > ( ) deferred . await ( ) } }","docstring":"/**\n * Tests that the background work will not prevent the test from timing out even in some cases\n * when the unconfined dispatcher is used.\n */"} {"signature":"@ Test fun testAsyncFailureInBackgroundReported ( )","body":"= testResultMap ( { try { it ( ) fail ( \"\" ) } catch ( e : TestException ) { assertEquals ( \"\" , e . message ) assertEquals ( setOf ( \"\" , \"\" ) , e . suppressedExceptions . map { it . message } . toSet ( ) ) } } ) { runTest { backgroundScope . async { throw TestException ( \"\" ) } backgroundScope . produce < Unit > { throw TestException ( \"\" ) } delay ( ) throw TestException ( \"\" ) } }","docstring":"/**\n * Tests that even the exceptions in the background scope that don't typically get reported and need to be queried\n * (like failures in [async]) will still surface in some simple scenarios.\n */"} {"signature":"@ Test fun testNoDuplicateExceptions ( )","body":"= testResultMap ( { try { it ( ) fail ( \"\" ) } catch ( e : TestException ) { assertEquals ( \"\" , e . message ) assertEquals ( listOf ( \"\" ) , e . suppressedExceptions . map { it . message } ) } } ) { runTest { backgroundScope . launch { throw TestException ( \"\" ) } delay ( ) throw TestException ( \"\" ) } }","docstring":"/**\n * Tests that, if an exception reaches the [TestScope] exception reporting mechanism via several\n * channels, it will only be reported once.\n */"} {"signature":"@ Test fun testTimingOutWithVirtualTimeMessage ( )","body":"= runTest { try { withTimeout ( ) { Channel < Unit > ( ) . receive ( ) } } catch ( e : TimeoutCancellationException ) { assertContains ( e . message ! ! , \"\" ) } }","docstring":"/**\n * Tests that [TestScope.withTimeout] notifies the programmer about using the virtual time.\n */"} {"signature":"@ Test fun testReportingStrayUncaughtExceptionsDuringTest ( ) : TestResult","body":"{ val thrown = TestException ( \"\" ) return testResultChain ( { _ -> runTest { val job = launch ( Dispatchers . Default + NonCancellable ) { throw thrown } job . join ( ) } } , { runTest { assertEquals ( thrown , it . exceptionOrNull ( ) ) } } ) }","docstring":"/**\n * Tests that the uncaught exceptions that happen during the test are reported.\n */"} {"signature":"override fun check ( declaration : IrDeclaration , type : SpecialDeclarationType ) : Boolean","body":"{ return declaration . accept ( if ( compatibleMode ) compatibleChecker else checker , null ) }","docstring":"/**\n * @return true if [declaration] is exportable from klib point of view.\n * Depending on [compatibleMode] option the same declaration could have FileLocal or Common signature.\n */"} {"signature":"@ GeneratedTest fun BuildConfigurator . testLogLevel ( )","body":"{ val headerText = \"\" addProjectWithKover { sourcesFrom ( \"\" ) kover { reports { total { log { header . set ( headerText ) } } } } } run ( \"\" , \"\" ) { assertContains ( output , headerText ) } run ( \"\" , \"\" ) { assertContains ( output , headerText ) } }","docstring":"/**\n * Check that coverage log is printed even if log level strictly limited (e.g. warn or quiet).\n */"} {"signature":"public fun < T > height ( column : ColumnReference < T > , ) : NonPositionalMapping < T , Double >","body":"= addNonPositionalMapping < T , Double > ( HEIGHT , column . name ( ) , null )","docstring":"/**\n * Maps the `height` 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 > height ( column : KProperty < T > , ) : NonPositionalMapping < T , Double >","body":"= addNonPositionalMapping < T , Double > ( HEIGHT , column . name , null )","docstring":"/**\n * Maps the `height` 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 height ( column : String ) : NonPositionalMapping < Any ? , Double >","body":"= addNonPositionalMapping ( HEIGHT , column , null )","docstring":"/**\n * Maps the `height` 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 > height ( values : Iterable < T > , name : String ? = null ) : NonPositionalMapping < T , Double >","body":"= addNonPositionalMapping ( HEIGHT , values . toList ( ) , name , null )","docstring":"/**\n * Maps the `height` aesthetic to the iterable of values.\n *\n * @param values the iterable of values to be mapped.\n * @param name optional name for this aesthetic mapping.\n * @return a [NonPositionalMapping] object representing the mapping.\n */"} {"signature":"public fun < T > height ( values : DataColumn < T > ) : PositionalMapping < T >","body":"= addPositionalMapping ( HEIGHT , values , null )","docstring":"/**\n * Maps the `height` 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":"internal fun IrSimpleFunction . findInterfaceImplementation ( jvmDefaultMode : JvmDefaultMode ) : IrSimpleFunction ?","body":"{ if ( ! isFakeOverride ) return null val parent = parent if ( parent is IrClass && ( parent . isJvmInterface || parent . isFromJava ( ) ) ) return null val implementation = resolveFakeOverride ( toSkip = :: isDefaultImplsBridge ) ? : return null if ( ! implementation . hasInterfaceParent ( ) || DescriptorVisibilities . isPrivate ( implementation . visibility ) || implementation . isDefinitelyNotDefaultImplsMethod ( jvmDefaultMode , implementation ) || implementation . isMethodOfAny ( ) ) { return null } if ( overriddenSymbols . any { ! it . owner . parentAsClass . isInterface && it . owner . modality != Modality . ABSTRACT && it . owner . resolveFakeOverride ( toSkip = :: isDefaultImplsBridge ) == implementation } ) { return null } return implementation }","docstring":"/**\n * Given a fake override in a class, returns an overridden declaration with implementation in interface, such that a method delegating to that\n * interface implementation should be generated into the class containing the fake override; or null if the given function is not a fake\n * override of any interface implementation or such method was already generated into the superclass or is a method from Any.\n */"} {"signature":"internal fun < V : Any > createCache ( compute : ( Class < * > ) -> V ) : CacheByClass < V >","body":"{ return if ( useClassValue ) ClassValueCache ( compute ) else ConcurrentHashMapCache ( compute ) }","docstring":"/**\n * Creates a **softly referenced** cache of values associated with [Class].\n * Values are computed using provided [compute] function.\n *\n * `null` values are not supported, though there aren't any technical limitations.\n */"} {"signature":"fun String . underlineAsText ( from : Int , to : Int ) : String","body":"{ val lines = StringBuilder ( ) var marks = StringBuilder ( ) var lineWasMarked = false for ( i in indices ) { val c = this [ i ] val mark : Char mark = when ( i ) { in from .. to -> '' else -> '' } lines . append ( c ) marks . append ( mark ) lineWasMarked = lineWasMarked || mark != '' if ( isEndOfLine ( c . code ) ) { if ( lineWasMarked ) { lines . appendLine ( marks . toString ( ) . trimEnd ( ) ) lineWasMarked = false } marks = StringBuilder ( ) } } if ( lineWasMarked ) { lines . appendLine ( ) lines . append ( marks . toString ( ) ) } return lines . toString ( ) }","docstring":"/**\n * Underlines string in given rage.\n *\n * For example:\n * var = 10;\n * ^^^^\n */"} {"signature":"private fun String . wildcardsToClassFileRegex ( ) : String","body":"{ val filenameWithWildcards = this . replace ( '' , File . separatorChar ) + \"\" return KoverFeatures . koverWildcardToRegex ( filenameWithWildcards ) }","docstring":"/**\n * Replaces characters `.` to `|` or `\\` and added `.class` as postfix and `.* /` or `.*\\` as prefix.\n */"} {"signature":"fun findStaticallyKnownSubtype ( supertype : ConeKotlinType , subTypeClassSymbol : FirRegularClassSymbol , context : CheckerContext ) : ConeKotlinType","body":"{ assert ( ! supertype . isMarkedNullable ) { \"\" } val session = context . session val typeContext = session . typeContext val subtypeWithVariablesType = subTypeClassSymbol . defaultType ( ) val typeCheckerState = context . session . typeContext . newTypeCheckerState ( errorTypesEqualToAnything = false , stubTypesEqualToAnything = false ) val normalizedTypes = if ( supertype is ConeIntersectionType ) { supertype . intersectedTypes } else { ArrayList < ConeKotlinType > ( ) . also { it . add ( supertype ) } } val resultSubstitution = mutableMapOf < FirTypeParameterSymbol , ConeKotlinType > ( ) for ( normalizedType in normalizedTypes ) { val supertypeWithVariables = findCorrespondingSupertypes ( typeCheckerState , subtypeWithVariablesType , normalizedType . typeConstructor ( typeContext ) ) . firstOrNull ( ) val variables : List < FirTypeParameterSymbol > = subTypeClassSymbol . typeParameterSymbols val substitution = if ( supertypeWithVariables != null ) { val result = mutableMapOf < FirTypeParameterSymbol , ConeTypeProjection > ( ) if ( context . session . doUnify ( supertype , supertypeWithVariables as ConeKotlinTypeProjection , variables . toSet ( ) , result ) ) { result } else { mutableMapOf ( ) } } else { mutableMapOf ( ) } for ( variable in variables ) { val resultValue = when ( val value = substitution [ variable ] ) { null -> null is ConeStarProjection -> { ConeStubTypeForTypeVariableInSubtyping ( ConeTypeVariable ( \"\" , null ) , ConeNullability . NULLABLE ) } else -> value . type } if ( resultValue != null ) { resultSubstitution [ variable ] = resultValue } } } val substitutor = ConeSubstitutorByMap . create ( resultSubstitution , session ) return substitutor . substituteOrSelf ( subtypeWithVariablesType ) }","docstring":"/**\n * Remember that we are trying to cast something of type `supertype` to `subtype`.\n\n * Since at runtime we can only check the class (type constructor), the rest of the subtype should be known statically, from supertype.\n * This method reconstructs all static information that can be obtained from supertype.\n\n * Example 1:\n * supertype = Collection\n * subtype = List<...>\n * result = List, all arguments are inferred\n\n * Example 2:\n * supertype = Any\n * subtype = List<...>\n * result = List<*>, some arguments were not inferred, replaced with '*'\n */"} {"signature":"public fun resumeWith ( result : Result < T > )","body":"public fun resumeWith ( result : Result < T > )","docstring":"/**\n * Resumes the execution of the corresponding coroutine passing a successful or failed [result] as the\n * return value of the last suspension point.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ InlineOnly public inline fun < T > Continuation < T > . resume ( value : T ) : Unit","body":"= resumeWith ( Result . success ( value ) )","docstring":"/**\n * Resumes the execution of the corresponding coroutine passing [value] as the return value of the last suspension point.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ InlineOnly public inline fun < T > Continuation < T > . resumeWithException ( exception : Throwable ) : Unit","body":"= resumeWith ( Result . failure ( exception ) )","docstring":"/**\n * Resumes the execution of the corresponding coroutine so that the [exception] is re-thrown right after the\n * last suspension point.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ InlineOnly public inline fun < T > Continuation ( context : CoroutineContext , crossinline resumeWith : ( Result < T > ) -> Unit ) : Continuation < T >","body":"= object : Continuation < T > { override val context : CoroutineContext get ( ) = context override fun resumeWith ( result : Result < T > ) = resumeWith ( result ) }","docstring":"/**\n * Creates a [Continuation] instance with the given [context] and implementation of [resumeWith] method.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ Suppress ( \"\" ) public fun < T > ( suspend ( ) -> T ) . createCoroutine ( completion : Continuation < T > ) : Continuation < Unit >","body":"= SafeContinuation ( createCoroutineUnintercepted ( completion ) . intercepted ( ) , COROUTINE_SUSPENDED )","docstring":"/**\n * Creates a coroutine without a receiver and with result type [T].\n * This function creates a new, fresh instance of suspendable computation every time it is invoked.\n *\n * To start executing the created coroutine, invoke `resume(Unit)` on the returned [Continuation] instance.\n * The [completion] continuation is invoked when the coroutine completes with a result or an exception.\n * Subsequent invocation of any resume function on the resulting continuation will produce an [IllegalStateException].\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ Suppress ( \"\" ) public fun < R , T > ( suspend R . ( ) -> T ) . createCoroutine ( receiver : R , completion : Continuation < T > ) : Continuation < Unit >","body":"= SafeContinuation ( createCoroutineUnintercepted ( receiver , completion ) . intercepted ( ) , COROUTINE_SUSPENDED )","docstring":"/**\n * Creates a coroutine with receiver type [R] and result type [T].\n * This function creates a new, fresh instance of suspendable computation every time it is invoked.\n *\n * To start executing the created coroutine, invoke `resume(Unit)` on the returned [Continuation] instance.\n * The [completion] continuation is invoked when the coroutine completes with a result or an exception.\n * Subsequent invocation of any resume function on the resulting continuation will produce an [IllegalStateException].\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ Suppress ( \"\" ) public fun < T > ( suspend ( ) -> T ) . startCoroutine ( completion : Continuation < T > )","body":"{ createCoroutineUnintercepted ( completion ) . intercepted ( ) . resume ( Unit ) }","docstring":"/**\n * Starts a coroutine without a receiver and with result type [T].\n * This function creates and starts a new, fresh instance of suspendable computation every time it is invoked.\n * The [completion] continuation is invoked when the coroutine completes with a result or an exception.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ Suppress ( \"\" ) public fun < R , T > ( suspend R . ( ) -> T ) . startCoroutine ( receiver : R , completion : Continuation < T > )","body":"{ createCoroutineUnintercepted ( receiver , completion ) . intercepted ( ) . resume ( Unit ) }","docstring":"/**\n * Starts a coroutine with receiver type [R] and result type [T].\n * This function creates and starts a new, fresh instance of suspendable computation every time it is invoked.\n * The [completion] continuation is invoked when the coroutine completes with a result or an exception.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ InlineOnly public suspend inline fun < T > suspendCoroutine ( crossinline block : ( Continuation < T > ) -> Unit ) : T","body":"{ contract { callsInPlace ( block , InvocationKind . EXACTLY_ONCE ) } return suspendCoroutineUninterceptedOrReturn { c : Continuation < T > -> val safe = SafeContinuation ( c . intercepted ( ) ) block ( safe ) safe . getOrThrow ( ) } }","docstring":"/**\n * Obtains the current continuation instance inside suspend functions and suspends\n * the currently running coroutine.\n *\n * In this function both [Continuation.resume] and [Continuation.resumeWithException] can be used either synchronously in\n * the same stack-frame where the suspension function is run or asynchronously later in the same thread or\n * from a different thread of execution. Subsequent invocation of any resume function will produce an [IllegalStateException].\n */"} {"signature":"open fun isLineTerminator ( char : Char ) : Boolean","body":"= isLineTerminator ( char . toInt ( ) )","docstring":"/** Checks if the single character is a line terminator or not. */"} {"signature":"abstract fun isLineTerminator ( codepoint : Int ) : Boolean","body":"abstract fun isLineTerminator ( codepoint : Int ) : Boolean","docstring":"/** Checks if the codepoint is a line terminator or not */"} {"signature":"abstract fun isLineTerminatorPair ( char1 : Char , char2 : Char ) : Boolean","body":"abstract fun isLineTerminatorPair ( char1 : Char , char2 : Char ) : Boolean","docstring":"/** Checks if the pair of symbols is a line terminator (e.g. for \\r\\n case) */"} {"signature":"abstract fun isAfterLineTerminator ( previous : Char , checked : Char ) : Boolean","body":"abstract fun isAfterLineTerminator ( previous : Char , checked : Char ) : Boolean","docstring":"/** Checks if a [checked] character is after a line terminator using the [previous] character.*/"} {"signature":"fun lenetOnMnistExportImportToJson ( )","body":"{ val ( train , test ) = mnist ( ) val ( newTrain , validation ) = train . split ( ) lenet5 ( ) . use { it . compile ( optimizer = SGD ( learningRate = ) , loss = Losses . SOFT_MAX_CROSS_ENTROPY_WITH_LOGITS , metric = Metrics . ACCURACY ) it . logSummary ( ) it . fit ( trainingDataset = newTrain , validationDataset = validation , epochs = EPOCHS , trainBatchSize = TRAINING_BATCH_SIZE , validationBatchSize = TEST_BATCH_SIZE ) it . save ( File ( PATH_TO_MODEL ) , SavingFormat . JsonConfigCustomVariables ( ) , writingMode = WritingMode . OVERRIDE ) val accuracy = it . evaluate ( dataset = test , batchSize = TEST_BATCH_SIZE ) . metrics [ Metrics . ACCURACY ] println ( \"\" ) } val model = Sequential . loadModelConfiguration ( File ( \"\" ) ) model . use { it . layers . filterIsInstance < Conv2D > ( ) . forEach ( Layer :: freeze ) it . compile ( optimizer = RMSProp ( ) , loss = Losses . SOFT_MAX_CROSS_ENTROPY_WITH_LOGITS , metric = Metrics . ACCURACY ) it . logSummary ( ) it . loadWeights ( File ( PATH_TO_MODEL ) ) 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 examples demonstrates model and model weights export and import back:\n * - Model is exported in Keras-style JSON format; weights are exported in custom (TXT) format.\n * - Model is trained on Mnist dataset.\n * - It saves all the data to the project root directory.\n * - [Sequential] model is created via JSON configuration and weights loading.\n * - After loading model is trained again with another optimizer with frozen Conv2D layers. Only weights in Dense layers can be updated.\n */"} {"signature":"fun main ( ) : Unit","body":"= lenetOnMnistExportImportToJson ( )","docstring":"/** */"} {"signature":"public fun < R , T : InferenceModel < * > > T . predict ( dataset : Dataset , predictionFunction : T . ( FloatData ) -> R ) : List < R >","body":"{ return dataset . map { predictionFunction ( it ) } }","docstring":"/**\n * Runs [predictionFunction] for all observations in [dataset]\n * and collects predictions to the list.\n *\n * NOTE: Slow method.\n *\n * @param [R] Prediction result type.\n * @param [T] Model type.\n * @param [dataset] Dataset.\n * @param [predictionFunction] Prediction function to make predictions with.\n */"} {"signature":"public fun < T : InferenceModel < * > > T . evaluate ( dataset : Dataset , metric : Metrics , predictionFunction : T . ( FloatData ) -> Int ) : Double","body":"{ if ( metric != Metrics . ACCURACY ) return Double . NaN var counter = for ( i in until dataset . xSize ( ) ) { val predictedLabel = predictionFunction ( dataset . getX ( i ) ) if ( predictedLabel == dataset . getY ( i ) . toInt ( ) ) counter ++ } return ( counter . toDouble ( ) / dataset . xSize ( ) ) }","docstring":"/**\n * Evaluates [dataset] via [metric] with the given [predictionFunction].\n *\n * NOTE: Slow method.\n *\n * @param [T] Model type.\n * @param [dataset] Dataset.\n * @param [metric] Metric to use.\n * @param [predictionFunction] Prediction function to make predictions with.\n */"} {"signature":"fun resnet50noTopAdditionalTraining ( )","body":"{ val modelHub = TFModelHub ( cacheDirectory = File ( \"\" ) ) val modelType = TFModels . CVnoTop . ResNet50 ( inputShape = intArrayOf ( IMAGE_SIZE , IMAGE_SIZE , ) ) val model = modelHub . loadModel ( modelType ) val hdfFile = modelHub . loadWeights ( modelType ) val layers = mutableListOf < Layer > ( ) for ( layer in model . layers ) { layers . add ( layer ) } val newGlobalAvgPool2DLayer = GlobalAvgPool2D ( name = \"\" , ) newGlobalAvgPool2DLayer . inboundLayers . add ( layers . last ( ) ) layers . add ( newGlobalAvgPool2DLayer ) val newDenseLayer = Dense ( name = \"\" , kernelInitializer = GlorotUniform ( ) , biasInitializer = GlorotUniform ( ) , outputSize = , activation = Activations . Relu ) newDenseLayer . inboundLayers . add ( layers . last ( ) ) layers . add ( newDenseLayer ) val newDenseLayer2 = Dense ( name = \"\" , kernelInitializer = GlorotUniform ( ) , biasInitializer = GlorotUniform ( ) , outputSize = NUM_CLASSES , activation = Activations . Linear ) newDenseLayer2 . inboundLayers . add ( layers . last ( ) ) layers . add ( newDenseLayer2 ) val model2 = Functional . of ( layers ) val dataset = OnFlyImageDataset . create ( File ( dogsCatsSmallDatasetPath ( ) ) , FromFolders ( mapping = mapOf ( \"\" to , \"\" to ) ) , modelType . createPreprocessing ( model2 ) ) . shuffle ( ) val ( train , test ) = dataset . split ( TRAIN_TEST_SPLIT_RATIO ) model2 . use { it . compile ( optimizer = Adam ( ) , loss = Losses . SOFT_MAX_CROSS_ENTROPY_WITH_LOGITS , metric = Metrics . ACCURACY ) it . loadWeightsForFrozenLayers ( hdfFile ) val accuracyBeforeTraining = it . evaluate ( dataset = test , batchSize = TEST_BATCH_SIZE ) . metrics [ Metrics . ACCURACY ] println ( \"\" ) it . fit ( dataset = train , batchSize = TRAINING_BATCH_SIZE , epochs = EPOCHS ) val accuracyAfterTraining = it . evaluate ( dataset = test , batchSize = TEST_BATCH_SIZE ) . metrics [ Metrics . ACCURACY ] println ( \"\" ) } }","docstring":"/**\n * This example demonstrates the transfer learning concept on ResNet'50 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 * - All layers, are added to the new Neural Network, its weights are frozen.\n * - New GlobalAvgPool2D and Dense layers are added and initialized via defined initializers.\n * - Model is re-trained on [dogsCatsSmallDatasetPath] dataset.\n *\n * We use the preprocessing DSL to describe the dataset generation pipeline.\n * We demonstrate the workflow on the subset of Kaggle Cats vs Dogs binary classification dataset.\n */"} {"signature":"fun main ( ) : Unit","body":"= resnet50noTopAdditionalTraining ( )","docstring":"/** */"} {"signature":"private fun FirTypeParameterRefsOwner . buildSubstitutorWithUpperBounds ( session : FirSession , type : ConeClassLikeType ) : ConeSubstitutor ?","body":"{ if ( typeParameters . isEmpty ( ) ) return null fun createMapping ( substitutor : ConeSubstitutor ) : Map < FirTypeParameterSymbol , ConeKotlinType > { return typeParameters . zip ( type . typeArguments ) . associate { ( parameter , projection ) -> val typeArgument = ( projection as? ConeKotlinTypeProjection ) ? . type ? : parameter . symbol . fir . bounds . firstOrNull ( ) ? . coneTypeSafe ( ) ? : session . builtinTypes . nullableAnyType . type Pair ( parameter . symbol , substitutor . substituteOrSelf ( typeArgument ) ) } } var substitutor : ConeSubstitutor = ConeSubstitutor . Empty var containsNonSubstitutedArguments = false for ( i in typeParameters . indices ) { val mapping = createMapping ( substitutor ) substitutor = substitutorByMap ( mapping , session ) containsNonSubstitutedArguments = mapping . values . any { bound -> bound . contains { type -> type is ConeTypeParameterType && typeParameters . any { it . symbol == type . lookupTag . typeParameterSymbol } } } if ( ! containsNonSubstitutedArguments ) { break } } if ( containsNonSubstitutedArguments ) { val errorSubstitution = typeParameters . associate { val diagnostic = ConeSimpleDiagnostic ( reason = \"\" , DiagnosticKind . CannotInferParameterType ) it . symbol to ConeErrorType ( diagnostic ) } val errorSubstitutor = substitutorByMap ( errorSubstitution , session ) substitutor = substitutorByMap ( createMapping ( errorSubstitutor ) , session ) } return substitutor }","docstring":"/**\n * This function creates a substitutor for SAM class/SAM constructor based on the expected SAM type.\n * If there is a typeless projection in some argument of the expected type then the upper bound of the corresponding type parameters is used\n */"} {"signature":"private fun FirSimpleFunction . isPublicInObject ( checkOnlyName : Boolean ) : Boolean","body":"{ if ( ! isJavaOrEnhancement ) return false if ( name . asString ( ) !in PUBLIC_METHOD_NAMES_IN_OBJECT ) return false if ( checkOnlyName ) return true return when ( name . asString ( ) ) { \"\" , \"\" , \"\" , \"\" , \"\" -> valueParameters . isEmpty ( ) \"\" -> valueParameters . singleOrNull ( ) ? . hasTypeOf ( StandardClassIds . Any , allowNullable = true ) == true \"\" -> when ( valueParameters . size ) { -> true -> valueParameters [ ] . hasTypeOf ( StandardClassIds . Long , allowNullable = false ) -> valueParameters [ ] . hasTypeOf ( StandardClassIds . Long , allowNullable = false ) && valueParameters [ ] . hasTypeOf ( StandardClassIds . Int , allowNullable = false ) else -> false } else -> errorWithAttachment ( \"\" ) { withEntry ( \"\" , name . asString ( ) ) } } }","docstring":"/**\n * From the definition of function interfaces in the Java specification (pt. 9.8):\n * \"methods that are members of I that do not have the same signature as any public instance method of the class Object\"\n * It means that if an interface declares `int hashCode()` then the method won't be taken into account when\n * checking if the interface is SAM.\n *\n * For K1 compatibility, this only applies to members declared in Java, see KT-67283.\n */"} {"signature":"public fun unpin ( )","body":"{ disposeStablePointer ( this . stablePtr ) }","docstring":"/**\n * Disposes the handle. It must not be [used][get] after that.\n */"} {"signature":"public fun get ( ) : T","body":"= @ Suppress ( \"\" ) ( derefStablePointer ( stablePtr ) as T )","docstring":"/**\n * Returns the underlying pinned object.\n */"} {"signature":"internal fun DObject ? . staticPropertiesForJava ( ) : List < DProperty >","body":"{ if ( this == null ) return emptyList ( ) return properties . filter { it . isJvmField || it . isConst || it . isLateInit } }","docstring":"/**\n * @return properties that will be visible as static for java.\n * See [Static fields](https://kotlinlang.org/docs/java-to-kotlin-interop.html#static-fields)\n */"} {"signature":"internal fun DObject . hasNothingToRender ( ) : Boolean","body":"{ val nonStaticPropsCount = properties . size - staticPropertiesForJava ( ) . size val nonStaticFunctionsCount = functions . size - staticFunctionsForJava ( ) . size val classLikesCount = classlikes . size val superTypesCount = supertypes . values . firstOrNull ( ) ? . size ? : return nonStaticFunctionsCount + nonStaticPropsCount + classLikesCount + superTypesCount == }","docstring":"/**\n * Hide companion object if there isn't members of parents.\n * Properties and functions that are moved to outer class are not counted as members.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ Deprecated ( \"\" , ReplaceWith ( \"\" ) ) @ DeprecatedSinceKotlin ( warningSince = \"\" , errorSince = \"\" ) public actual fun String ( chars : CharArray ) : String","body":"{ var result = \"\" for ( char in chars ) { result += char } return result }","docstring":"/**\n * Converts the characters in the specified array to a string.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ Deprecated ( \"\" , ReplaceWith ( \"\" ) ) @ DeprecatedSinceKotlin ( warningSince = \"\" , errorSince = \"\" ) public actual fun String ( chars : CharArray , offset : Int , length : Int ) : String","body":"{ if ( offset < || length < || chars . size - offset < length ) throw IndexOutOfBoundsException ( \"\" ) var result = \"\" for ( index in offset until offset + length ) { result += chars [ index ] } return result }","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 actual fun CharArray . concatToString ( ) : String","body":"{ var result = \"\" for ( char in this ) { result += char } return result }","docstring":"/**\n * Concatenates characters in this [CharArray] into a String.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ Suppress ( \"\" ) public actual fun CharArray . concatToString ( startIndex : Int = , endIndex : Int = this . size ) : String","body":"{ AbstractList . checkBoundsIndexes ( startIndex , endIndex , this . size ) var result = \"\" for ( index in startIndex until endIndex ) { result += this [ index ] } return result }","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 actual fun String . toCharArray ( ) : CharArray","body":"{ return CharArray ( length ) { get ( it ) } }","docstring":"/**\n * Returns a [CharArray] containing characters of this string.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ Suppress ( \"\" ) public actual fun String . toCharArray ( startIndex : Int = , endIndex : Int = this . length ) : CharArray","body":"{ AbstractList . checkBoundsIndexes ( startIndex , endIndex , length ) return CharArray ( endIndex - startIndex ) { get ( startIndex + it ) } }","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 ( \"\" ) @ Suppress ( \"\" ) public actual fun String . toCharArray ( destination : CharArray , destinationOffset : Int = , startIndex : Int = , endIndex : Int = length ) : CharArray","body":"{ AbstractList . checkBoundsIndexes ( startIndex , endIndex , length ) AbstractList . checkBoundsIndexes ( destinationOffset , destinationOffset + endIndex - startIndex , destination . size ) var destIndex = destinationOffset for ( i in startIndex until endIndex ) { destination [ destIndex ++ ] = this [ i ] } return destination }","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 actual fun ByteArray . decodeToString ( ) : String","body":"{ return decodeUtf8 ( this , , size , false ) }","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 ( \"\" ) @ Suppress ( \"\" ) public actual fun ByteArray . decodeToString ( startIndex : Int = , endIndex : Int = this . size , throwOnInvalidSequence : Boolean = false ) : String","body":"{ AbstractList . checkBoundsIndexes ( startIndex , endIndex , this . size ) return decodeUtf8 ( this , startIndex , endIndex , throwOnInvalidSequence ) }","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 actual fun String . encodeToByteArray ( ) : ByteArray","body":"{ return encodeUtf8 ( this , , length , false ) }","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 ( \"\" ) @ Suppress ( \"\" ) public actual fun String . encodeToByteArray ( startIndex : Int = , endIndex : Int = this . length , throwOnInvalidSequence : Boolean = false ) : ByteArray","body":"{ AbstractList . checkBoundsIndexes ( startIndex , endIndex , length ) return encodeUtf8 ( this , startIndex , endIndex , throwOnInvalidSequence ) }","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":"@ Deprecated ( \"\" , ReplaceWith ( \"\" ) ) @ DeprecatedSinceKotlin ( warningSince = \"\" ) @ kotlin . internal . InlineOnly public actual inline fun String . toUpperCase ( ) : String","body":"= asDynamic ( ) . toUpperCase ( )","docstring":"/**\n * Returns a copy of this string converted to upper case using the rules of the default locale.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalStdlibApi :: class ) @ kotlin . internal . InlineOnly public actual inline fun String . uppercase ( ) : String","body":"= asDynamic ( ) . toUpperCase ( )","docstring":"/**\n * Returns a copy of this string converted to upper case using Unicode mapping rules of the invariant locale.\n *\n * This function supports one-to-many and many-to-one character mapping,\n * thus the length of the returned string can be different from the length of the original string.\n *\n * @sample samples.text.Strings.uppercase\n */"} {"signature":"@ Deprecated ( \"\" , ReplaceWith ( \"\" ) ) @ DeprecatedSinceKotlin ( warningSince = \"\" ) @ kotlin . internal . InlineOnly public actual inline fun String . toLowerCase ( ) : String","body":"= asDynamic ( ) . toLowerCase ( )","docstring":"/**\n * Returns a copy of this string converted to lower case using the rules of the default locale.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalStdlibApi :: class ) @ kotlin . internal . InlineOnly public actual inline fun String . lowercase ( ) : String","body":"= asDynamic ( ) . toLowerCase ( )","docstring":"/**\n * Returns a copy of this string converted to lower case using Unicode mapping rules of the invariant locale.\n *\n * This function supports one-to-many and many-to-one character mapping,\n * thus the length of the returned string can be different from the length of the original string.\n *\n * @sample samples.text.Strings.lowercase\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ Suppress ( \"\" ) public actual fun String . compareTo ( other : String , ignoreCase : Boolean = false ) : Int","body":"{ if ( ignoreCase ) { val n1 = this . length val n2 = other . length val min = minOf ( n1 , n2 ) if ( min == ) return n1 - n2 for ( index in until min ) { var thisChar = this [ index ] var otherChar = other [ index ] if ( thisChar != otherChar ) { thisChar = thisChar . uppercaseChar ( ) otherChar = otherChar . uppercaseChar ( ) if ( thisChar != otherChar ) { thisChar = thisChar . lowercaseChar ( ) otherChar = otherChar . lowercaseChar ( ) if ( thisChar != otherChar ) { return thisChar . compareTo ( otherChar ) } } } } return n1 - n2 } else { return compareTo ( other ) } }","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":"@ SinceKotlin ( \"\" ) public actual infix fun CharSequence ? . contentEquals ( other : CharSequence ? ) : Boolean","body":"= contentEqualsImpl ( other )","docstring":"/**\n * Returns `true` if the contents of this char sequence are equal to the contents of the specified [other],\n * i.e. both char sequences contain the same number of the same characters in the same order.\n *\n * @sample samples.text.Strings.contentEquals\n */"} {"signature":"@ SinceKotlin ( \"\" ) public actual fun CharSequence ? . contentEquals ( other : CharSequence ? , ignoreCase : Boolean ) : Boolean","body":"{ return if ( ignoreCase ) this . contentEqualsIgnoreCaseImpl ( other ) else this . contentEqualsImpl ( other ) }","docstring":"/**\n * Returns `true` if the contents of this char sequence are equal to the contents of the specified [other], optionally ignoring case difference.\n *\n * @param ignoreCase `true` to ignore character case when comparing contents.\n *\n * @sample samples.text.Strings.contentEquals\n */"} {"signature":"fun ssdMobileLightAPI ( )","body":"{ val modelHub = ONNXModelHub ( cacheDirectory = File ( \"\" ) ) val model = ONNXModels . ObjectDetection . SSDMobileNetV1 . 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 [SSDMobileNetV1ObjectDetectionModel] 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":"fun main ( ) : Unit","body":"= ssdMobileLightAPI ( )","docstring":"/** */"} {"signature":"private fun FirBlock . tryConvertDynamicIncrementOrDecrementToIr ( ) : IrExpression ?","body":"{ val unary = statements . findIsInstanceAnd < FirProperty > { it . name == SpecialNames . UNARY } val operationReceiver = ( unary ? . initializer ? : statements . lastOrNull ( ) ) ? . unwrapDesugaredAssignmentValueReference ( ) as? FirQualifiedAccessExpression ? : return null if ( operationReceiver . resolvedType !is ConeDynamicType ) { return null } val operationCall = when ( val it = statements [ statements . lastIndex - ] ) { is FirVariableAssignment -> it . rValue as? FirFunctionCall ? : return null is FirFunctionCall -> extractOperationFromDynamicSetCall ( it ) ? : return null else -> return null } val operationReceiverReceiver = statements . findIsInstanceAnd < FirProperty > { it . name == SpecialNames . RECEIVER || it . name == SpecialNames . ARRAY } ? . initializer ? : ( operationReceiver as? FirQualifiedAccessExpression ) ? . explicitReceiver val isArray = statements . find { it is FirProperty && it . name == SpecialNames . ARRAY } != null val convertedOperationReceiver = callGenerator . convertToIrCall ( operationReceiver , operationReceiver . resolvedType , convertToIrReceiverExpression ( operationReceiverReceiver , operationReceiver ) , noArguments = isArray , ) . applyIf ( isArray ) { require ( this is IrDynamicOperatorExpression ) val arrayAccess = operationReceiver as? FirFunctionCall ? : return null val originalVararg = arrayAccess . resolvedArgumentMapping ? . keys ? . filterIsInstance < FirVarargArgumentsExpression > ( ) ? . firstOrNull ( ) originalVararg ? . arguments ? . forEach { val indexNVariable = ( it as? FirPropertyAccessExpression ) ? . calleeReference ? . toResolvedPropertySymbol ( ) ? . fir val initializer = indexNVariable ? . initializer ? : return@forEach arguments . add ( convertToIrExpression ( initializer ) ) } this } return callGenerator . convertToIrCall ( operationCall , operationCall . resolvedType , convertedOperationReceiver , ) }","docstring":"/**\n * This function tries to \"sugar back\" `FirBlock`s generated in\n * [org.jetbrains.kotlin.fir.builder.AbstractRawFirBuilder.generateIncrementOrDecrementBlockForArrayAccess] and\n * [org.jetbrains.kotlin.fir.resolve.transformers.body.resolve.FirExpressionsResolveTransformer.transformIncrementDecrementExpression]\n */"} {"signature":"private fun FirWhenExpression . isDeeplyProperlyExhaustive ( ) : Boolean","body":"{ if ( ! isProperlyExhaustive ) { return false } val nestedElseIfExpression = branches . lastOrNull ( ) ? . nestedElseIfOrNull ( ) ? : return true return nestedElseIfExpression . isDeeplyProperlyExhaustive ( ) }","docstring":"/**\n * TODO this shouldn't be required anymore once KT-65997 is fixed.\n */"} {"signature":"private fun FirWhenExpression . convertWhenBranchesTo ( result : MutableList < IrBranch > , whenExpressionType : ConeKotlinType , flattenElse : Boolean , ) : MutableList < IrBranch >","body":"{ for ( branch in branches ) { if ( flattenElse ) { val elseIfExpression = branch . nestedElseIfOrNull ( ) if ( elseIfExpression != null ) { elseIfExpression . convertWhenBranchesTo ( result , whenExpressionType , flattenElse = true ) break } } result . add ( branch . toIrWhenBranch ( whenExpressionType ) ) } return result }","docstring":"/**\n * Converts the branches to [IrBranch]es.\n *\n * If [flattenElse] is `true` and the else branch contains another [FirWhenExpression] that's built from an `if`,\n * its branches will be added directly to the [result] list instead.\n *\n * TODO this shouldn't be required anymore once KT-65997 is fixed.\n */"} {"signature":"fun entry ( action : Action < in Entry > )","body":"{ entries . add ( project . provider { val instance = project . objects . newInstance < Entry > ( _target ) . apply { action . execute ( this ) } project . objects . newInstance < GenerateCompilationDatabase . Entry > ( ) . apply { directory . set ( instance . directory ) files . from ( instance . files ) arguments . set ( instance . arguments ) output . set ( instance . output ) } } ) }","docstring":"/**\n * Add an entry to the compilation database for [target] with optional [sanitizer].\n *\n * @param action configure [Entry]\n */"} {"signature":"fun testArchiveWithRelativePath ( )","body":"{ doTestFriendPaths ( File ( tmpdir , \"\" ) . relativeTo ( File ( \"\" ) . absoluteFile ) ) }","docstring":"/** Regression test for KT-29933. */"} {"signature":"fun testDirectoryWithRelativePath ( )","body":"{ doTestFriendPaths ( File ( tmpdir , \"\" ) . relativeTo ( File ( \"\" ) . absoluteFile ) ) }","docstring":"/** Regression test for KT-29933. */"} {"signature":"protected fun checkPackageContent ( session : FirSession , packageFqName : FqName , moduleDescriptor : ModuleDescriptor , testDataPath : String )","body":"{ val declarationNames = DescriptorUtils . getAllDescriptors ( moduleDescriptor . getPackage ( packageFqName ) . memberScope ) . mapTo ( sortedSetOf ( ) ) { it . name } val provider = session . symbolProvider val builder = StringBuilder ( ) val firRenderer = FirRenderer ( builder ) for ( name in declarationNames ) { for ( symbol in provider . getTopLevelCallableSymbols ( packageFqName , name ) ) { firRenderer . renderElementAsString ( symbol . fir ) builder . appendLine ( ) } } for ( name in declarationNames ) { val classLikeSymbol = provider . getClassLikeSymbolByClassId ( ClassId . topLevel ( packageFqName . child ( name ) ) ) ? : continue firRenderer . renderElementAsString ( classLikeSymbol . fir ) builder . appendLine ( ) } KotlinTestUtils . assertEqualsToFile ( File ( testDataPath ) , builder . toString ( ) . trimEnd ( ) + \"\" ) }","docstring":"/**\n * Since fir symbol providers can't get all names in package (only fir provider can do it),\n * we should collect that names from module descriptor from FE 1.0\n */"} {"signature":"private fun getFilePath ( filePattern : String ) : String","body":"{ return substitutePropertiesValues ( filePattern ) { propertyValue -> propertyValue . replace ( '' , '' ) . replace ( \"\" , \"\" ) } . replace ( '' , '' ) }","docstring":"/**\n * Get file path from a string pattern\n *\n * Implementation is mostly copied from [DefaultMavenSettingsBuilder.getFile]\n */"} {"signature":"fun CliJavaModuleFinder . computeDefaultRootModules ( ) : List < String >","body":"{ val result = arrayListOf < String > ( ) val systemModules = systemModules . associateBy ( JavaModule :: name ) val javaSeExists = \"\" in systemModules if ( javaSeExists ) { result . add ( \"\" ) } fun JavaModule . Explicit . exportsAtLeastOnePackageUnqualified ( ) : Boolean = moduleInfo . exports . any { it . toModules . isEmpty ( ) } if ( ! javaSeExists ) { for ( ( name , module ) in systemModules ) { if ( name . startsWith ( \"\" ) && module . exportsAtLeastOnePackageUnqualified ( ) ) { result . add ( name ) } } } for ( ( name , module ) in systemModules ) { if ( ! name . startsWith ( \"\" ) && module . exportsAtLeastOnePackageUnqualified ( ) ) { result . add ( name ) } } return result }","docstring":"/**\n * Computes the JDK's default root modules. See [JEP 261: Module System](http://openjdk.java.net/jeps/261).\n */"} {"signature":"private fun handleAsGenericTypeQualifier ( element : KtElement ) : KtCallInfo ?","body":"{ if ( element !is KtExpression ) return null val wholeQualifier = element . getQualifiedExpressionForSelector ( ) as? KtDotQualifiedExpression ? : element val call = wholeQualifier . getPossiblyQualifiedCallExpression ( ) ? : return null if ( call . typeArgumentList == null || call . valueArgumentList != null ) return null return KtSuccessCallInfo ( KtGenericTypeQualifier ( token , wholeQualifier ) ) }","docstring":"/**\n * Handles call expressions like `Foo` or `test.Foo` in calls like `Foo::foo` and `test.Foo::foo`.\n *\n * ATM does not perform any resolve checks, since it does not seem possible with [BindingContext], so it might give some\n * false positives.\n */"} {"signature":"private inline fun < reified T > assertUnsignedNumberEncoding ( expected : String , actual : T , actualPrimitive : JsonPrimitive , )","body":"{ assertEquals ( expected , actualPrimitive . toString ( ) , \"\" ) parametrizedTest { mode -> assertEquals ( expected , default . encodeToString ( JsonElement . serializer ( ) , actualPrimitive , mode ) , \"\" , ) } }","docstring":"/**\n * Helper function for [testJsonPrimitiveUnsignedNumbers]\n *\n * Asserts that an [unsigned number][actual] can be used to create a [JsonPrimitive][actualPrimitive],\n * which can be decoded correctly.\n *\n * @param expected the expected string value of [actual]\n * @param actual the unsigned number\n * @param T should be an unsigned number\n */"} {"signature":"abstract fun runtimeJarForTests ( ) : File","body":"abstract fun runtimeJarForTests ( ) : File","docstring":"/**\n * kotlin-stdlib.jar\n */"} {"signature":"abstract fun runtimeJarForTestsWithJdk8 ( ) : File","body":"abstract fun runtimeJarForTestsWithJdk8 ( ) : File","docstring":"/**\n * kotlin-stdlib-jdk8.jar\n */"} {"signature":"abstract fun minimalRuntimeJarForTests ( ) : File","body":"abstract fun minimalRuntimeJarForTests ( ) : File","docstring":"/**\n * Jar with minimal version of kotlin stdlib (may be same as runtimeJarForTests)\n */"} {"signature":"abstract fun reflectJarForTests ( ) : File","body":"abstract fun reflectJarForTests ( ) : File","docstring":"/**\n * kotlin-reflect.jar\n */"} {"signature":"abstract fun kotlinTestJarForTests ( ) : File","body":"abstract fun kotlinTestJarForTests ( ) : File","docstring":"/**\n * kotlin-test.jar\n */"} {"signature":"abstract fun scriptRuntimeJarForTests ( ) : File","body":"abstract fun scriptRuntimeJarForTests ( ) : File","docstring":"/**\n * kotlin-script-runtime.jar\n */"} {"signature":"abstract fun jvmAnnotationsForTests ( ) : File","body":"abstract fun jvmAnnotationsForTests ( ) : File","docstring":"/**\n * kotlin-annotations-jvm.jar\n */"} {"signature":"abstract fun getAnnotationsJar ( ) : File","body":"abstract fun getAnnotationsJar ( ) : File","docstring":"/**\n * compiler/testData/mockJDK/jre/lib/annotations.jar\n */"} {"signature":"abstract fun fullJsStdlib ( ) : File","body":"abstract fun fullJsStdlib ( ) : File","docstring":"/**\n * kotlin-stdlib-js.klib\n */"} {"signature":"abstract fun defaultJsStdlib ( ) : File","body":"abstract fun defaultJsStdlib ( ) : File","docstring":"/**\n * Jar with minimal version of kotlin stdlib JS (may be same as fullJsStdlib)\n */"} {"signature":"abstract fun kotlinTestJsKLib ( ) : File","body":"abstract fun kotlinTestJsKLib ( ) : File","docstring":"/**\n * kotlin-test-js.jar\n */"} {"signature":"fun Tuple1 < * > . take0 ( ) : EmptyTuple","body":"= EmptyTuple","docstring":"/**\n * This file contains all functions to take N items from the beginning or end of a Tuple.\n * If 0 items are taken, the result will be [EmptyTuple].\n *\n * For example:\n * ```kotlin\n * tupleOf(1, 2, 3, 4).take2() == tupleOf(1, 2)\n * tupleOf(1, 2, 3, 4).takeLast2() == tupleOf(3, 4)\n * ```\n */"} {"signature":"override fun put ( key : K , value : V ) : V ?","body":"{ if ( put ( array , shift , key , value ) ) { if ( ++ size_ >= ( THRESHOLD ushr shift ) ) { rehash ( ) } } return null }","docstring":"/**\n * Never returns previous values\n */"} {"signature":"@ SinceKotlin ( \"\" ) public fun String . toByteOrNull ( ) : Byte ?","body":"= toByteOrNull ( radix = )","docstring":"/**\n * Parses the string as a signed [Byte] number and returns the result\n * or `null` if the string is not a valid representation of a number.\n */"} {"signature":"@ SinceKotlin ( \"\" ) public fun String . toByteOrNull ( radix : Int ) : Byte ?","body":"{ val int = this . toIntOrNull ( radix ) ? : return null if ( int < Byte . MIN_VALUE || int > Byte . MAX_VALUE ) return null return int . toByte ( ) }","docstring":"/**\n * Parses the string as a signed [Byte] number and returns the result\n * or `null` if the string is not a valid representation of a number.\n *\n * @throws IllegalArgumentException when [radix] is not a valid radix for string to number conversion.\n */"} {"signature":"@ SinceKotlin ( \"\" ) public fun String . toShortOrNull ( ) : Short ?","body":"= toShortOrNull ( radix = )","docstring":"/**\n * Parses the string as a [Short] number and returns the result\n * or `null` if the string is not a valid representation of a number.\n */"} {"signature":"@ SinceKotlin ( \"\" ) public fun String . toShortOrNull ( radix : Int ) : Short ?","body":"{ val int = this . toIntOrNull ( radix ) ? : return null if ( int < Short . MIN_VALUE || int > Short . MAX_VALUE ) return null return int . toShort ( ) }","docstring":"/**\n * Parses the string as a [Short] number and returns the result\n * or `null` if the string is not a valid representation of a number.\n *\n * @throws IllegalArgumentException when [radix] is not a valid radix for string to number conversion.\n */"} {"signature":"@ SinceKotlin ( \"\" ) public fun String . toIntOrNull ( ) : Int ?","body":"= toIntOrNull ( radix = )","docstring":"/**\n * Parses the string as an [Int] number and returns the result\n * or `null` if the string is not a valid representation of a number.\n */"} {"signature":"@ SinceKotlin ( \"\" ) public fun String . toIntOrNull ( radix : Int ) : Int ?","body":"{ checkRadix ( radix ) val length = this . length if ( length == ) return null val start : Int val isNegative : Boolean val limit : Int val firstChar = this [ ] if ( firstChar < '' ) { if ( length == ) return null start = if ( firstChar == '' ) { isNegative = true limit = Int . MIN_VALUE } else if ( firstChar == '' ) { isNegative = false limit = - Int . MAX_VALUE } else return null } else { start = isNegative = false limit = - Int . MAX_VALUE } val limitForMaxRadix = ( - Int . MAX_VALUE ) / var limitBeforeMul = limitForMaxRadix var result = for ( i in start until length ) { val digit = digitOf ( this [ i ] , radix ) if ( digit < ) return null if ( result < limitBeforeMul ) { if ( limitBeforeMul == limitForMaxRadix ) { limitBeforeMul = limit / radix if ( result < limitBeforeMul ) { return null } } else { return null } } result *= radix if ( result < limit + digit ) return null result -= digit } return if ( isNegative ) result else - result }","docstring":"/**\n * Parses the string as an [Int] number and returns the result\n * or `null` if the string is not a valid representation of a number.\n *\n * @throws IllegalArgumentException when [radix] is not a valid radix for string to number conversion.\n */"} {"signature":"@ SinceKotlin ( \"\" ) public fun String . toLongOrNull ( ) : Long ?","body":"= toLongOrNull ( radix = )","docstring":"/**\n * Parses the string as a [Long] number and returns the result\n * or `null` if the string is not a valid representation of a number.\n */"} {"signature":"@ SinceKotlin ( \"\" ) public fun String . toLongOrNull ( radix : Int ) : Long ?","body":"{ checkRadix ( radix ) val length = this . length if ( length == ) return null val start : Int val isNegative : Boolean val limit : Long val firstChar = this [ ] if ( firstChar < '' ) { if ( length == ) return null start = if ( firstChar == '' ) { isNegative = true limit = Long . MIN_VALUE } else if ( firstChar == '' ) { isNegative = false limit = - Long . MAX_VALUE } else return null } else { start = isNegative = false limit = - Long . MAX_VALUE } val limitForMaxRadix = ( - Long . MAX_VALUE ) / var limitBeforeMul = limitForMaxRadix var result = for ( i in start until length ) { val digit = digitOf ( this [ i ] , radix ) if ( digit < ) return null if ( result < limitBeforeMul ) { if ( limitBeforeMul == limitForMaxRadix ) { limitBeforeMul = limit / radix if ( result < limitBeforeMul ) { return null } } else { return null } } result *= radix if ( result < limit + digit ) return null result -= digit } return if ( isNegative ) result else - result }","docstring":"/**\n * Parses the string as a [Long] number and returns the result\n * or `null` if the string is not a valid representation of a number.\n *\n * @throws IllegalArgumentException when [radix] is not a valid radix for string to number conversion.\n */"} {"signature":"private fun isNotLessSpecificCallWithArgumentMapping ( call1 : FlatSignature < C > , call2 : FlatSignature < C > , discriminateGenerics : Boolean , useOriginalSamTypes : Boolean ) : Boolean","body":"{ return tryCompareDescriptorsFromScripts ( call1 . candidateDescriptor ( ) , call2 . candidateDescriptor ( ) ) ? : compareCallsByUsedArguments ( call1 , call2 , discriminateGenerics , useOriginalSamTypes ) }","docstring":"/**\n * `call1` is not less specific than `call2`\n */"} {"signature":"private fun compareCallsByUsedArguments ( call1 : FlatSignature < C > , call2 : FlatSignature < C > , discriminateGenerics : Boolean , useOriginalSamTypes : Boolean ) : Boolean","body":"{ if ( discriminateGenerics ) { val isGeneric1 = call1 . isGeneric val isGeneric2 = call2 . isGeneric if ( isGeneric1 && ! isGeneric2 ) return false if ( ! isGeneric1 && isGeneric2 ) return true if ( isGeneric1 && isGeneric2 ) return false } if ( ! call1 . isExpect && call2 . isExpect ) return true if ( call1 . isExpect && ! call2 . isExpect ) return false if ( call1 . contextReceiverCount > call2 . contextReceiverCount ) return true if ( call1 . contextReceiverCount < call2 . contextReceiverCount ) return false return createEmptyConstraintSystem ( ) . isSignatureNotLessSpecific ( call1 , call2 , SpecificityComparisonWithNumerics , specificityComparator , useOriginalSamTypes ) }","docstring":"/**\n * Returns `true` if [call1] is definitely more or equally specific [call2],\n * `false` otherwise.\n */"} {"signature":"private fun tryCompareDescriptorsFromScripts ( d1 : CallableDescriptor , d2 : CallableDescriptor ) : Boolean ?","body":"{ val containingDeclaration1 = d1 . containingDeclaration val containingDeclaration2 = d2 . containingDeclaration if ( containingDeclaration1 is ScriptDescriptor && containingDeclaration2 is ScriptDescriptor ) { when { containingDeclaration1 . priority > containingDeclaration2 . priority -> return true containingDeclaration1 . priority < containingDeclaration2 . priority -> return false } } return null }","docstring":"/**\n * Returns `true` if `d1` is definitely not less specific than `d2`,\n * `false` if `d1` is definitely less specific than `d2`,\n * `null` if undecided.\n */"} {"signature":"private fun isNotLessSpecificCallableReferenceDescriptor ( f : CallableDescriptor , g : CallableDescriptor ) : Boolean","body":"{ if ( f . valueParameters . size != g . valueParameters . size ) return false if ( f . varargParameterPosition ( ) != g . varargParameterPosition ( ) ) return false val fSignature = FlatSignature . createFromCallableDescriptor ( f ) val gSignature = FlatSignature . createFromCallableDescriptor ( g ) if ( ! createEmptyConstraintSystem ( ) . isSignatureNotLessSpecific ( fSignature , gSignature , SpecificityComparisonWithNumerics , specificityComparator ) ) { return false } if ( f is CallableMemberDescriptor && g is CallableMemberDescriptor ) { if ( ! f . isExpect && g . isExpect ) return true if ( f . isExpect && ! g . isExpect ) return false } if ( platformOverloadsSpecificityComparator . isMoreSpecificShape ( g , f ) ) { return false } return true }","docstring":"/**\n * Returns `true` if `f` is definitely not less specific than `g`,\n * `false` if `f` is definitely less specific than `g`,\n * `null` if undecided.\n */"} {"signature":"fun getContributedClassifier ( name : Name , location : LookupLocation ) : ClassifierDescriptor ?","body":"fun getContributedClassifier ( name : Name , location : LookupLocation ) : ClassifierDescriptor ?","docstring":"/**\n * Returns only non-deprecated classifiers.\n *\n * See [getContributedClassifierIncludeDeprecated] to get all classifiers.\n */"} {"signature":"fun getContributedClassifierIncludeDeprecated ( name : Name , location : LookupLocation ) : DescriptorWithDeprecation < ClassifierDescriptor > ?","body":"= getContributedClassifier ( name , location ) ? . let { DescriptorWithDeprecation . createNonDeprecated ( it ) }","docstring":"/**\n * Returns contributed classifier, but discriminates deprecated\n *\n * This method can return some classifier where [getContributedClassifier] haven't returned any,\n * but it should never return different one, even if it is deprecated.\n * Note that implementors are encouraged to provide non-deprecated classifier if it doesn't contradict\n * contract above.\n */"} {"signature":"fun getContributedDescriptors ( kindFilter : DescriptorKindFilter = DescriptorKindFilter . ALL , nameFilter : ( Name ) -> Boolean = MemberScope . ALL_NAME_FILTER ) : Collection < DeclarationDescriptor >","body":"fun getContributedDescriptors ( kindFilter : DescriptorKindFilter = DescriptorKindFilter . ALL , nameFilter : ( Name ) -> Boolean = MemberScope . ALL_NAME_FILTER ) : Collection < DeclarationDescriptor >","docstring":"/**\n * All visible descriptors from current scope possibly filtered by the given name and kind filters\n * (that means that the implementation is not obliged to use the filters but may do so when it gives any performance advantage).\n */"} {"signature":"fun abiMetadataProcessor ( annotationVisitor : AnnotationVisitor , removeDataClassCopyIfConstructorIsPrivate : Boolean , preserveDeclarationOrder : Boolean , classesToBeDeleted : Set < String > , pruneClass : Boolean , treatInternalAsPrivate : Boolean , ) : AnnotationVisitor","body":"= kotlinClassHeaderVisitor { header -> val metadataVersion = header . metadataVersion . takeIf { v -> val major = v . getOrNull ( ) ? : val minor = v . getOrNull ( ) ? : major > || major == && minor >= } ? : intArrayOf ( , ) val newHeader = runCatching { KotlinClassMetadata . transform ( header ) { metadata -> when ( metadata ) { is KotlinClassMetadata . Class -> { metadata . kmClass . removePrivateDeclarations ( removeDataClassCopyIfConstructorIsPrivate , preserveDeclarationOrder , classesToBeDeleted , pruneClass , treatInternalAsPrivate , ) } is KotlinClassMetadata . FileFacade -> { metadata . kmPackage . removePrivateDeclarations ( preserveDeclarationOrder , pruneClass , treatInternalAsPrivate ) } is KotlinClassMetadata . MultiFileClassPart -> { metadata . kmPackage . removePrivateDeclarations ( preserveDeclarationOrder , pruneClass , treatInternalAsPrivate ) } else -> Unit } } } . getOrElse { cause -> if ( System . getProperty ( \"\" ) . toBoolean ( ) ) { val actual = \"\" val expected = JvmMetadataVersion . LATEST_STABLE_SUPPORTED . toString ( ) throw AssertionError ( \"\" + \"\" + \"\" + \"\" + \"\" + \"\" + \"\" + \"\" + \"\" , cause ) } header } annotationVisitor . visitKotlinMetadata ( newHeader ) }","docstring":"/**\n * Wrap the visitor for a Kotlin Metadata annotation to strip out private and local\n * functions, properties, and type aliases as well as local delegated properties.\n */"} {"signature":"private fun kotlinClassHeaderVisitor ( body : ( Metadata ) -> Unit ) : AnnotationVisitor","body":"= object : AnnotationVisitor ( Opcodes . API_VERSION ) { var kind : Int = var metadataVersion : IntArray = intArrayOf ( ) var data1 : MutableList < String > = mutableListOf ( ) var data2 : MutableList < String > = mutableListOf ( ) var extraString : String ? = null var packageName : String ? = null var extraInt : Int = override fun visit ( name : String , value : Any ? ) { when ( name ) { KIND_FIELD_NAME -> kind = value as Int METADATA_EXTRA_INT_FIELD_NAME -> extraInt = value as Int METADATA_VERSION_FIELD_NAME -> metadataVersion = value as IntArray METADATA_EXTRA_STRING_FIELD_NAME -> extraString = value as String METADATA_PACKAGE_NAME_FIELD_NAME -> packageName = value as String } } override fun visitArray ( name : String ) : AnnotationVisitor ? { val destination = when ( name ) { METADATA_DATA_FIELD_NAME -> data1 METADATA_STRINGS_FIELD_NAME -> data2 else -> return null } return object : AnnotationVisitor ( Opcodes . API_VERSION ) { override fun visit ( name : String ? , value : Any ? ) { destination += value as String } } } override fun visitEnd ( ) { body ( Metadata ( kind , metadataVersion , data1 . toTypedArray ( ) , data2 . toTypedArray ( ) , extraString , packageName , extraInt ) ) } }","docstring":"/**\n * Parse a KotlinClassHeader from an existing Kotlin Metadata annotation visitor.\n */"} {"signature":"private fun AnnotationVisitor . visitKotlinMetadata ( header : Metadata )","body":"{ visit ( KIND_FIELD_NAME , header . kind ) visit ( METADATA_VERSION_FIELD_NAME , header . metadataVersion ) if ( header . data1 . isNotEmpty ( ) ) { visitArray ( METADATA_DATA_FIELD_NAME ) . apply { header . data1 . forEach { visit ( null , it ) } visitEnd ( ) } } if ( header . data2 . isNotEmpty ( ) ) { visitArray ( METADATA_STRINGS_FIELD_NAME ) . apply { header . data2 . forEach { visit ( null , it ) } visitEnd ( ) } } if ( header . extraString . isNotEmpty ( ) ) { visit ( METADATA_EXTRA_STRING_FIELD_NAME , header . extraString ) } if ( header . packageName . isNotEmpty ( ) ) { visit ( METADATA_PACKAGE_NAME_FIELD_NAME , header . packageName ) } if ( header . extraInt != ) { visit ( METADATA_EXTRA_INT_FIELD_NAME , header . extraInt ) } visitEnd ( ) }","docstring":"/**\n * Serialize a KotlinClassHeader to an existing Kotlin Metadata annotation visitor.\n */"} {"signature":"public fun KtExpression . getKtType ( ) : KtType ?","body":"= withValidityAssertion { analysisSession . expressionTypeProvider . getKtExpressionType ( this ) }","docstring":"/**\n * Get type of given expression.\n *\n * Return:\n * - [KtExpression] type if given [KtExpression] is real expression;\n * - `null` for [KtExpression] inside pacakges and import declarations;\n * - `Unit` type for statements;\n */"} {"signature":"public fun KtDeclaration . getReturnKtType ( ) : KtType","body":"= withValidityAssertion { analysisSession . expressionTypeProvider . getReturnTypeForKtDeclaration ( this ) }","docstring":"/**\n * Returns the return type of the given [KtDeclaration] as [KtType].\n *\n * IMPORTANT: For `vararg foo: T` parameter returns full `Array` type (unlike\n * [KtValueParameterSymbol.returnType][org.jetbrains.kotlin.analysis.api.symbols.KtValueParameterSymbol.returnType],\n * which returns `T`).\n */"} {"signature":"public fun KtFunction . getFunctionalType ( ) : KtType","body":"= withValidityAssertion { analysisSession . expressionTypeProvider . getFunctionalTypeForKtFunction ( this ) }","docstring":"/**\n * Returns the functional type of the given [KtFunction].\n *\n * For a regular function, it would be kotlin.FunctionN where\n * N is the number of value parameters in the function;\n * Ps are types of value parameters;\n * R is the return type of the function.\n * Depending on the function's attributes, such as `suspend` or reflective access, different functional type,\n * such as `SuspendFunction`, `KFunction`, or `KSuspendFunction`, will be constructed.\n */"} {"signature":"public fun PsiElement . getExpectedType ( ) : KtType ?","body":"= withValidityAssertion { analysisSession . expressionTypeProvider . getExpectedType ( this ) }","docstring":"/**\n * Returns the expected [KtType] of this [PsiElement] if it is an expression. The returned value should not be a\n * [org.jetbrains.kotlin.analysis.api.types.KtErrorType].\n */"} {"signature":"public fun KtExpression . isDefinitelyNull ( ) : Boolean","body":"= withValidityAssertion { analysisSession . expressionTypeProvider . isDefinitelyNull ( this ) }","docstring":"/**\n * Returns `true` if this expression is definitely null, based on declared nullability and smart cast types derived from\n * data-flow analysis facts. Examples:\n * ```\n * public fun foo(t: T, nt: T?, s: String, ns: String?) {\n * t // t.isDefinitelyNull() == false && t.isDefinitelyNotNull() == true\n * nt // nt.isDefinitelyNull() == false && nt.isDefinitelyNotNull() == false\n * s // s.isDefinitelyNull() == false && s.isDefinitelyNotNull() == true\n * ns // ns.isDefinitelyNull() == false && ns.isDefinitelyNotNull() == false\n *\n * if (ns != null) {\n * ns // ns.isDefinitelyNull() == false && ns.isDefinitelyNotNull() == true\n * } else {\n * ns // ns.isDefinitelyNull() == true && ns.isDefinitelyNotNull() == false\n * }\n *\n * ns!! // From this point on: ns.isDefinitelyNull() == false && ns.isDefinitelyNotNull() == true\n * }\n * ```\n * Note that only nullability from \"stable\" smart cast types is considered. The\n * [spec](https://kotlinlang.org/spec/type-inference.html#smart-cast-sink-stability) provides an explanation on smart cast stability.\n */"} {"signature":"public fun KtExpression . isDefinitelyNotNull ( ) : Boolean","body":"= withValidityAssertion { analysisSession . expressionTypeProvider . isDefinitelyNotNull ( this ) }","docstring":"/**\n * Returns `true` if this expression is definitely not null. See [isDefinitelyNull] for examples.\n */"} {"signature":"fun multiPoseDetectionMoveNet ( )","body":"{ val modelHub = ONNXModelHub ( cacheDirectory = File ( \"\" ) ) val modelType = ONNXModels . PoseDetection . MoveNetMultiPoseLighting val model = modelHub . loadModel ( modelType ) model . printSummary ( ) model . use { println ( it ) val imageFile = getFileFromResource ( \"\" ) val inputImage = ImageConverter . toBufferedImage ( imageFile ) val preprocessor = pipeline < BufferedImage > ( ) . resize { outputHeight = outputWidth = } . convert { colorMode = ColorMode . BGR } . toFloatArray { } . call ( modelType . preprocessor ) val inputData = preprocessor . apply ( inputImage ) val rawPoseLandmarks = it . predict ( inputData ) { result -> result . get2DFloatArray ( \"\" ) } println ( rawPoseLandmarks . contentDeepToString ( ) ) val poses = rawPoseLandmarks . mapNotNull { floats -> val probability = floats [ ] if ( probability < ) return@mapNotNull null val foundPoseLandmarks = mutableListOf < PoseLandmark > ( ) for ( keyPointIdx in .. ) { val poseLandmark = PoseLandmark ( x = floats [ * keyPointIdx + ] , y = floats [ * keyPointIdx ] , probability = floats [ * keyPointIdx + ] , label = \"\" ) foundPoseLandmarks . add ( poseLandmark ) } val detectedObject = DetectedObject ( xMin = floats [ ] , xMax = floats [ ] , yMin = floats [ ] , yMax = floats [ ] , probability = probability ) val detectedPose = DetectedPose ( foundPoseLandmarks , emptyList ( ) ) detectedObject to detectedPose } val multiPoseDetectionResult = MultiPoseDetectionResult ( poses ) showFrame ( \"\" , createMultipleDetectedPosesPanel ( inputImage , multiPoseDetectionResult ) ) } }","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":"= multiPoseDetectionMoveNet ( )","docstring":"/** */"} {"signature":"@ Test fun testBasicNoSuspend ( )","body":"= runTest { expect ( ) val result = withTimeout ( ) { expect ( ) \"\" } assertEquals ( \"\" , result ) finish ( ) }","docstring":"/**\n * Tests a case of no timeout and no suspension inside.\n */"} {"signature":"@ Test fun testBasicSuspend ( )","body":"= runTest { expect ( ) val result = withTimeout ( ) { expect ( ) yield ( ) expect ( ) \"\" } assertEquals ( \"\" , result ) finish ( ) }","docstring":"/**\n * Tests a case of no timeout and one suspension inside.\n */"} {"signature":"@ Test fun testDispatch ( )","body":"= runTest { expect ( ) launch { expect ( ) yield ( ) expect ( ) } expect ( ) val result = withTimeout ( ) { expect ( ) yield ( ) expect ( ) \"\" } assertEquals ( \"\" , result ) expect ( ) yield ( ) finish ( ) }","docstring":"/**\n * Tests proper dispatching of `withTimeout` blocks\n */"} {"signature":"@ Test fun testYieldBlockingWithTimeout ( )","body":"= runTest ( expected = { it is CancellationException } ) { withTimeout ( ) { while ( true ) { yield ( ) } } }","docstring":"/**\n * Tests that a 100% CPU-consuming loop will react on timeout if it has yields.\n */"} {"signature":"@ Test fun testWithTimeoutChildWait ( )","body":"= runTest { expect ( ) withTimeout ( ) { expect ( ) launch { expect ( ) } expect ( ) } finish ( ) }","docstring":"/**\n * Tests that [withTimeout] waits for children coroutines to complete.\n */"} {"signature":"fun collectTailSuspendCalls ( context : CommonBackendContext , irFunction : IrSimpleFunction ) : TailSuspendCalls","body":"{ require ( irFunction . isSuspend ) { \"\" } val body = irFunction . body ? : return TailSuspendCalls ( emptySet ( ) , false ) class VisitorState ( val insideTryBlock : Boolean , val isTailExpression : Boolean ) val isUnitReturn = irFunction . returnType . isUnit ( ) var hasNotTailSuspendCall = false val tailSuspendCalls = mutableSetOf < IrCall > ( ) val tailReturnableBlocks = mutableSetOf < IrReturnableBlockSymbol > ( ) val visitor = object : IrElementVisitor < Unit , VisitorState > { override fun visitElement ( element : IrElement , data : VisitorState ) { element . acceptChildren ( this , VisitorState ( data . insideTryBlock , isTailExpression = false ) ) } override fun visitTypeOperator ( expression : IrTypeOperatorCall , data : VisitorState ) { if ( expression . operator == IrTypeOperator . IMPLICIT_CAST ) { expression . acceptChildren ( this , data ) } else { super . visitTypeOperator ( expression , data ) } } override fun visitTry ( aTry : IrTry , data : VisitorState ) { aTry . tryResult . accept ( this , VisitorState ( insideTryBlock = true , isTailExpression = false ) ) aTry . catches . forEach { it . result . accept ( this , data ) } require ( aTry . finallyExpression == null ) { \"\" } } private fun isTailReturn ( expression : IrReturn ) = expression . returnTargetSymbol == irFunction . symbol || expression . returnTargetSymbol in tailReturnableBlocks override fun visitReturn ( expression : IrReturn , data : VisitorState ) { expression . value . accept ( this , VisitorState ( data . insideTryBlock , isTailReturn ( expression ) ) ) } override fun visitExpressionBody ( body : IrExpressionBody , data : VisitorState ) = body . acceptChildren ( this , data ) override fun visitBlockBody ( body : IrBlockBody , data : VisitorState ) = visitStatementContainer ( body , data ) override fun visitContainerExpression ( expression : IrContainerExpression , data : VisitorState ) { if ( expression is IrReturnableBlock && data . isTailExpression ) tailReturnableBlocks . add ( expression . symbol ) visitStatementContainer ( expression , data ) } private fun visitStatementContainer ( expression : IrStatementContainer , data : VisitorState ) { expression . statements . forEachIndexed { index , irStatement -> val isTailStatement = if ( index == expression . statements . lastIndex ) { data . isTailExpression } else { isUnitReturn && expression . statements [ index + ] . let { it is IrReturn && isTailReturn ( it ) && it . value . isUnitRead ( ) } } irStatement . accept ( this , VisitorState ( data . insideTryBlock , isTailStatement ) ) } } override fun visitWhen ( expression : IrWhen , data : VisitorState ) { expression . branches . forEach { it . condition . accept ( this , VisitorState ( data . insideTryBlock , isTailExpression = false ) ) it . result . accept ( this , data ) } } override fun visitCall ( expression : IrCall , data : VisitorState ) { if ( expression . isSuspend ) { if ( ! data . insideTryBlock && data . isTailExpression ) tailSuspendCalls . add ( expression ) else hasNotTailSuspendCall = true } val isTailExpression = data . isTailExpression && expression . isReturnIfSuspendedCall ( ) expression . acceptChildren ( this , VisitorState ( data . insideTryBlock , isTailExpression ) ) } private fun IrExpression . isUnitRead ( ) : Boolean { if ( this is IrTypeOperatorCall ) { return this . argument . isUnitRead ( ) } return this is IrGetObjectValue && symbol == context . irBuiltIns . unitClass } private fun IrCall . isReturnIfSuspendedCall ( ) = symbol == context . ir . symbols . returnIfSuspended } body . accept ( visitor , VisitorState ( insideTryBlock = false , isTailExpression = true ) ) return TailSuspendCalls ( tailSuspendCalls , hasNotTailSuspendCall ) }","docstring":"/**\n * Collects calls to be treated as tail calls: \"last\" expressions which are either direct return statement with a call\n * to other suspend function, or, for a Unit-returning function, a call to other suspend function, also returning Unit.\n */"} {"signature":"protected open fun doTestByMainFile ( mainFile : KtFile , mainModule : KtTestModule , testServices : TestServices )","body":"{ throw UnsupportedOperationException ( \"\" + \"\" ) }","docstring":"/**\n * Consider implementing this method if you can choose some main file in your test case. It can be, for example, a file with a caret.\n *\n * Examples of use cases:\n *\n * - Collect diagnostics of the file\n * - Get an element at the caret and invoke some logic\n * - Do some operations on [mainFile] and dump a state of other files in [mainModule]\n *\n * Only one [KtFile] can be the main one.\n *\n * The main file is selected based on the following rules:\n *\n * - A single file in the [main][isMainModule] module\n * - A single file in the project\n * - The file has a selected expression\n * - The file has a caret\n * - The file name is equal to \"main\" or equal to the defined [AnalysisApiTestDirectives.MAIN_FILE_NAME]\n *\n * @see findMainFile\n * @see isMainFile\n * @see AnalysisApiTestDirectives.MAIN_FILE_NAME\n */"} {"signature":"protected open fun doTestByMainModuleAndOptionalMainFile ( mainFile : KtFile ? , mainModule : KtTestModule , testServices : TestServices )","body":"{ doTestByMainFile ( mainFile ? : error ( \"\" ) , mainModule , testServices ) }","docstring":"/**\n * Consider implementing this method if you have logic around [KtTestModule], or you don't always have a [mainFile] and have some custom\n * logic for such exceptional cases (e.g., taking the first file from [mainModule]).\n *\n * Examples of use cases:\n *\n * - Find all declarations in the module\n * - Find a declaration by qualified name and invoke some logic\n * - Process all files in the module\n *\n * Only one [KtTestModule] can be the main one.\n *\n * The main module is selected based on the following rules:\n *\n * - It is the only module\n * - It has a main file (see [doTestByMainFile] for details)\n * - The module has a defined [AnalysisApiTestDirectives.MAIN_MODULE] directive\n * - The module name is equal to [ModuleStructureExtractor.DEFAULT_MODULE_NAME]\n *\n * Use [doTestByMainModuleAndOptionalMainFile] only if [doTestByMainFile] is not suitable for your use case.\n *\n * @param mainFile a dedicated main file if it exists (see [findMainFile])\n *\n * @see findMainModule\n * @see isMainModule\n * @see AnalysisApiTestDirectives.MAIN_MODULE\n */"} {"signature":"protected open fun doTest ( testServices : TestServices )","body":"{ val ( mainFile , mainModule ) = findMainFileAndModule ( testServices ) doTestByMainModuleAndOptionalMainFile ( mainFile , mainModule , testServices ) }","docstring":"/**\n * Consider implementing this method if your test logic needs the whole\n * [KtTestModuleStructure][org.jetbrains.kotlin.analysis.test.framework.project.structure.KtTestModuleStructure].\n *\n * Examples of use cases:\n *\n * - Find all files in all modules\n * - Find two declarations from different files and different modules and compare them\n *\n * The [KtTestModuleStructure][org.jetbrains.kotlin.analysis.test.framework.project.structure.KtTestModuleStructure] can be accessed via\n * [ktTestModuleStructure] on [testServices].\n *\n * Use only if [doTestByMainModuleAndOptionalMainFile] is not suitable for your use case.\n */"} {"signature":"private fun String . addAllDependenciesFromOtherConfigurations ( project : Project , vararg configurationNames : String )","body":"{ project . configurations . named ( this ) . configure { receiverConfiguration -> receiverConfiguration . dependencies . addAllLater ( project . listProperty < Dependency > { configurationNames . map { project . configurations . getByName ( it ) } . flatMap { it . allDependencies } } ) } }","docstring":"/**\n * Adds `allDependencies` of configurations mentioned in `configurationNames` to configuration named [this] in\n * a lazy manner\n */"} {"signature":"public fun < T > middle ( column : ColumnReference < T > , ) : PositionalMapping < T >","body":"{ return addPositionalMapping < T > ( MIDDLE , column . name ( ) , null ) }","docstring":"/**\n * Maps the `middle` 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 > middle ( column : KProperty < T > , ) : PositionalMapping < T >","body":"{ return addPositionalMapping < T > ( MIDDLE , column . name , null ) }","docstring":"/**\n * Maps the `middle` 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 middle ( column : String , ) : PositionalMapping < Any ? >","body":"{ return addPositionalMapping ( MIDDLE , column , null ) }","docstring":"/**\n * Maps the `middle` 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 > middle ( values : Iterable < T > , ) : PositionalMapping < T >","body":"{ return addPositionalMapping < T > ( MIDDLE , values . toList ( ) , null , null ) }","docstring":"/**\n * Maps the `middle` 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 > middle ( values : DataColumn < T > , ) : PositionalMapping < T >","body":"{ return addPositionalMapping < T > ( MIDDLE , values , null ) }","docstring":"/**\n * Maps the `middle` 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 fun < T > DataFrame < T > . take ( n : Int ) : DataFrame < T >","body":"{ require ( n >= ) { \"\" } return getRows ( until n . coerceAtMost ( nrow ) ) }","docstring":"/**\n * Returns a DataFrame containing first [n] rows.\n *\n * @throws IllegalArgumentException if [n] is negative.\n */"} {"signature":"public fun < T > DataFrame < T > . takeLast ( n : Int = ) : DataFrame < T >","body":"{ require ( n >= ) { \"\" } return drop ( ( nrow - n ) . coerceAtLeast ( ) ) }","docstring":"/**\n * Returns a DataFrame containing last [n] rows.\n *\n * @throws IllegalArgumentException if [n] is negative.\n */"} {"signature":"public fun < T > DataFrame < T > . takeWhile ( predicate : RowFilter < T > ) : DataFrame < T >","body":"= firstOrNull { ! predicate ( it , it ) } ? . let { take ( it . index ) } ? : this","docstring":"/**\n * Returns a DataFrame containing first rows that satisfy the given [predicate].\n */"} {"signature":"public fun < C > ColumnSet < C > . take ( n : Int ) : ColumnSet < C >","body":"= transform { it . take ( n ) }","docstring":"/**\n * @include [CommonTakeFirstDocs]\n * @set [CommonTakeAndDropDocs.ExampleArg]\n *\n * `df.`[select][DataFrame.select]` { `[colsOf][SingleColumn.colsOf]`<`[String][String]`>().`[take][ColumnSet.take]`(2) }`\n *\n * `df.`[select][DataFrame.select]` { `[cols][ColumnsSelectionDsl.cols]` { .. }.`[take][ColumnSet.take]`(2) }`\n */"} {"signature":"public fun ColumnsSelectionDsl < * > . take ( n : Int ) : ColumnSet < * >","body":"= this . asSingleColumn ( ) . takeCols ( n )","docstring":"/**\n * @include [CommonTakeFirstDocs]\n * @set [CommonTakeAndDropDocs.ExampleArg]\n *\n * `df.`[select][DataFrame.select]` { `[take][ColumnsSelectionDsl.take]`(5) }`\n */"} {"signature":"public fun SingleColumn < DataRow < * > > . takeCols ( n : Int ) : ColumnSet < * >","body":"= this . ensureIsColumnGroup ( ) . transformSingle { it . cols ( ) . take ( n ) }","docstring":"/**\n * @include [CommonTakeFirstDocs]\n * @set [CommonTakeAndDropDocs.ExampleArg]\n *\n * `df.`[select][DataFrame.select]` { myColumnGroup.`[takeCols][SingleColumn.takeCols]`(1) }`\n */"} {"signature":"public fun String . takeCols ( n : Int ) : ColumnSet < * >","body":"= columnGroup ( this ) . takeCols ( n )","docstring":"/**\n * @include [CommonTakeFirstDocs]\n * @set [CommonTakeAndDropDocs.ExampleArg]\n *\n * `df.`[select][DataFrame.select]` { \"myColumnGroup\".`[takeCols][String.takeCols]`(1) }`\n */"} {"signature":"public fun KProperty < * > . takeCols ( n : Int ) : ColumnSet < * >","body":"= columnGroup ( this ) . takeCols ( n )","docstring":"/**\n * @include [CommonTakeFirstDocs]\n * @set [CommonTakeAndDropDocs.ExampleArg]\n *\n * `df.`[select][DataFrame.select]` { Type::myColumnGroup.`[takeCols][SingleColumn.takeCols]`(1) }`\n *\n * `df.`[select][DataFrame.select]` { DataSchemaType::myColumnGroup.`[takeCols][KProperty.takeCols]`(1) }`\n */"} {"signature":"public fun ColumnPath . takeCols ( n : Int ) : ColumnSet < * >","body":"= columnGroup ( this ) . takeCols ( n )","docstring":"/**\n * @include [CommonTakeFirstDocs]\n * @set [CommonTakeAndDropDocs.ExampleArg]\n *\n * `df.`[select][DataFrame.select]` { \"pathTo\"[\"myColumnGroup\"].`[takeCols][ColumnPath.takeCols]`(1) }`\n */"} {"signature":"public fun < C > ColumnSet < C > . takeLast ( n : Int = ) : ColumnSet < C >","body":"= transform { it . takeLast ( n ) }","docstring":"/**\n * @include [CommonTakeLastDocs]\n * @set [CommonTakeAndDropDocs.ExampleArg]\n *\n * `df.`[select][DataFrame.select]` { `[colsOf][SingleColumn.colsOf]`<`[String][String]`>().`[takeLast][ColumnSet.takeLast]`(2) }`\n *\n * `df.`[select][DataFrame.select]` { `[cols][ColumnsSelectionDsl.cols]` { .. }.`[takeLast][ColumnSet.takeLast]`(2) }`\n */"} {"signature":"public fun ColumnsSelectionDsl < * > . takeLast ( n : Int = ) : ColumnSet < * >","body":"= asSingleColumn ( ) . takeLastCols ( n )","docstring":"/**\n * @include [CommonTakeLastDocs]\n * @set [CommonTakeAndDropDocs.ExampleArg]\n *\n * `df.`[select][DataFrame.select]` { `[takeLast][ColumnsSelectionDsl.takeLast]`(5) }`\n */"} {"signature":"public fun SingleColumn < DataRow < * > > . takeLastCols ( n : Int ) : ColumnSet < * >","body":"= this . ensureIsColumnGroup ( ) . transformSingle { it . cols ( ) . takeLast ( n ) }","docstring":"/**\n * @include [CommonTakeLastDocs]\n * @set [CommonTakeAndDropDocs.ExampleArg]\n *\n * `df.`[select][DataFrame.select]` { myColumnGroup.`[takeLast][SingleColumn.takeLastCols]`(1) }`\n */"} {"signature":"public fun String . takeLastCols ( n : Int ) : ColumnSet < * >","body":"= columnGroup ( this ) . takeLastCols ( n )","docstring":"/**\n * @include [CommonTakeLastDocs]\n * @set [CommonTakeAndDropDocs.ExampleArg]\n *\n * `df.`[select][DataFrame.select]` { \"myColumnGroup\".`[takeLastCols][String.takeLastCols]`(1) }`\n */"} {"signature":"public fun KProperty < * > . takeLastCols ( n : Int ) : ColumnSet < * >","body":"= columnGroup ( this ) . takeLastCols ( n )","docstring":"/**\n * @include [CommonTakeLastDocs]\n * @set [CommonTakeAndDropDocs.ExampleArg]\n *\n * `df.`[select][DataFrame.select]` { Type::myColumnGroup.`[takeLastCols][SingleColumn.takeLastCols]`(1) }`\n *\n * `df.`[select][DataFrame.select]` { DataSchemaType::myColumnGroup.`[takeLastCols][KProperty.takeLastCols]`(1) }`\n */"} {"signature":"public fun ColumnPath . takeLastCols ( n : Int ) : ColumnSet < * >","body":"= columnGroup ( this ) . takeLastCols ( n )","docstring":"/**\n * @include [CommonTakeLastDocs]\n * @set [CommonTakeAndDropDocs.ExampleArg]\n *\n * `df.`[select][DataFrame.select]` { \"pathTo\"[\"myColumnGroup\"].`[takeLastCols][ColumnPath.takeLastCols]`(1) }`\n */"} {"signature":"public fun < C > ColumnSet < C > . takeWhile ( predicate : ColumnFilter < C > ) : ColumnSet < C >","body":"= transform { it . takeWhile ( predicate ) }","docstring":"/**\n * @include [CommonTakeFirstWhileDocs]\n * @set [CommonTakeAndDropWhileDocs.ExampleArg]\n *\n * `df.`[select][DataFrame.select]` { `[colsOf][SingleColumn.colsOf]`<`[String][String]`>().`[takeWhile][ColumnSet.takeWhile]` { it.`[any][ColumnWithPath.any]` { it == \"Alice\" } } }`\n *\n * `df.`[select][DataFrame.select]` { `[cols][ColumnsSelectionDsl.cols]` { .. }.`[takeWhile][ColumnSet.takeWhile]` { it.`[name][ColumnWithPath.name]`.`[startsWith][String.startsWith]`(\"my\") } }`\n */"} {"signature":"public fun ColumnsSelectionDsl < * > . takeWhile ( predicate : ColumnFilter < * > ) : ColumnSet < * >","body":"= asSingleColumn ( ) . takeColsWhile ( predicate )","docstring":"/**\n * @include [CommonTakeFirstWhileDocs]\n * @set [CommonTakeAndDropWhileDocs.ExampleArg]\n *\n * `df.`[select][DataFrame.select]` { `[takeWhile][ColumnsSelectionDsl.takeWhile]` { it.`[any][ColumnWithPath.any]` { it == \"Alice\" } } }`\n */"} {"signature":"public fun SingleColumn < DataRow < * > > . takeColsWhile ( predicate : ColumnFilter < * > ) : ColumnSet < * >","body":"= this . ensureIsColumnGroup ( ) . transformSingle { it . cols ( ) . takeWhile ( predicate ) }","docstring":"/**\n * @include [CommonTakeFirstWhileDocs]\n * @set [CommonTakeAndDropWhileDocs.ExampleArg]\n *\n * `df.`[select][DataFrame.select]` { myColumnGroup.`[takeWhile][SingleColumn.takeColsWhile]` { it.`[name][ColumnWithPath.name]`.`[startsWith][String.startsWith]`(\"my\") } }`\n */"} {"signature":"public fun String . takeColsWhile ( predicate : ColumnFilter < * > ) : ColumnSet < * >","body":"= columnGroup ( this ) . takeColsWhile ( predicate )","docstring":"/**\n * @include [CommonTakeFirstWhileDocs]\n * @set [CommonTakeAndDropWhileDocs.ExampleArg]\n *\n * `df.`[select][DataFrame.select]` { \"myColumnGroup\".`[takeColsWhile][String.takeColsWhile]` { it.`[name][ColumnWithPath.name]`.`[startsWith][String.startsWith]`(\"my\") } }`\n */"} {"signature":"public fun KProperty < * > . takeColsWhile ( predicate : ColumnFilter < * > ) : ColumnSet < * >","body":"= columnGroup ( this ) . takeColsWhile ( predicate )","docstring":"/**\n * @include [CommonTakeFirstWhileDocs]\n * @set [CommonTakeAndDropWhileDocs.ExampleArg]\n *\n * `df.`[select][DataFrame.select]` { Type::myColumnGroup.`[takeColsWhile][SingleColumn.takeColsWhile]` { it.`[name][ColumnWithPath.name]`.`[startsWith][String.startsWith]`(\"my\") } }`\n *\n * `df.`[select][DataFrame.select]` { DataSchemaType::myColumnGroup.`[takeColsWhile][KProperty.takeColsWhile]` { it.`[any][ColumnWithPath.any]` { it == \"Alice\" } } }`\n */"} {"signature":"public fun ColumnPath . takeColsWhile ( predicate : ColumnFilter < * > ) : ColumnSet < * >","body":"= columnGroup ( this ) . takeColsWhile ( predicate )","docstring":"/**\n * @include [CommonTakeFirstWhileDocs]\n * @set [CommonTakeAndDropWhileDocs.ExampleArg]\n *\n * `df.`[select][DataFrame.select]` { \"pathTo\"[\"myColumnGroup\"].`[takeColsWhile][ColumnPath.takeColsWhile]` { it.`[name][ColumnWithPath.name]`.`[startsWith][String.startsWith]`(\"my\") } }`\n */"} {"signature":"public fun < C > ColumnSet < C > . takeLastWhile ( predicate : ColumnFilter < C > ) : ColumnSet < C >","body":"= transform { it . takeLastWhile ( predicate ) }","docstring":"/**\n * @include [CommonTakeLastWhileDocs]\n * @set [CommonTakeAndDropWhileDocs.ExampleArg]\n *\n * `df.`[select][DataFrame.select]` { `[colsOf][SingleColumn.colsOf]`<`[String][String]`>().`[takeLastWhile][ColumnSet.takeLastWhile]` { it.`[any][ColumnWithPath.any]` { it == \"Alice\" } } }`\n *\n * `df.`[select][DataFrame.select]` { `[cols][ColumnsSelectionDsl.cols]` { .. }.`[takeLastWhile][ColumnSet.takeLastWhile]` { it.`[name][ColumnWithPath.name]`.`[startsWith][String.startsWith]`(\"my\") } }`\n */"} {"signature":"public fun ColumnsSelectionDsl < * > . takeLastWhile ( predicate : ColumnFilter < * > ) : ColumnSet < * >","body":"= asSingleColumn ( ) . takeLastColsWhile ( predicate )","docstring":"/**\n * @include [CommonTakeLastWhileDocs]\n * @set [CommonTakeAndDropWhileDocs.ExampleArg]\n *\n * `df.`[select][DataFrame.select]` { `[takeLastWhile][ColumnsSelectionDsl.takeLastWhile]` { it.`[any][ColumnWithPath.any]` { it == \"Alice\" } } }`\n */"} {"signature":"public fun SingleColumn < DataRow < * > > . takeLastColsWhile ( predicate : ColumnFilter < * > ) : ColumnSet < * >","body":"= this . ensureIsColumnGroup ( ) . transformSingle { it . cols ( ) . takeLastWhile ( predicate ) }","docstring":"/**\n * @include [CommonTakeLastWhileDocs]\n * @set [CommonTakeAndDropWhileDocs.ExampleArg]\n *\n * `df.`[select][DataFrame.select]` { myColumnGroup.`[takeLastColsWhile][SingleColumn.takeLastColsWhile]` { it.`[name][ColumnWithPath.name]`.`[startsWith][String.startsWith]`(\"my\") } }`\n */"} {"signature":"public fun String . takeLastColsWhile ( predicate : ColumnFilter < * > ) : ColumnSet < * >","body":"= columnGroup ( this ) . takeLastColsWhile ( predicate )","docstring":"/**\n * @include [CommonTakeLastWhileDocs]\n * @set [CommonTakeAndDropWhileDocs.ExampleArg]\n *\n * `df.`[select][DataFrame.select]` { \"myColumnGroup\".`[takeLastColsWhile][String.takeLastColsWhile]` { it.`[name][ColumnWithPath.name]`.`[startsWith][String.startsWith]`(\"my\") } }`\n */"} {"signature":"public fun KProperty < * > . takeLastColsWhile ( predicate : ColumnFilter < * > ) : ColumnSet < * >","body":"= columnGroup ( this ) . takeLastColsWhile ( predicate )","docstring":"/**\n * @include [CommonTakeLastWhileDocs]\n * @set [CommonTakeAndDropWhileDocs.ExampleArg]\n *\n * `df.`[select][DataFrame.select]` { Type::myColumnGroup.`[takeLastColsWhile][SingleColumn.takeLastColsWhile]` { it.`[name][ColumnWithPath.name]`.`[startsWith][String.startsWith]`(\"my\") } }`\n *\n * `df.`[select][DataFrame.select]` { DataSchemaType::myColumnGroup.`[takeLastColsWhile][KProperty.takeLastColsWhile]` { it.`[any][ColumnWithPath.any]` { it == \"Alice\" } } }`\n */"} {"signature":"public fun ColumnPath . takeLastColsWhile ( predicate : ColumnFilter < * > ) : ColumnSet < * >","body":"= columnGroup ( this ) . takeLastColsWhile ( predicate )","docstring":"/**\n * @include [CommonTakeLastWhileDocs]\n * @set [CommonTakeAndDropWhileDocs.ExampleArg]\n *\n * `df.`[select][DataFrame.select]` { \"pathTo\"[\"myColumnGroup\"].`[takeLastColsWhile][ColumnPath.takeLastColsWhile]` { it.`[name][ColumnWithPath.name]`.`[startsWith][String.startsWith]`(\"my\") } }`\n */"} {"signature":"internal fun < F , S , R > applyIfBothNotNull ( first : F ? , second : S ? , operation : ( F , S ) -> R ) : R ?","body":"= if ( first == null || second == null ) null else operation ( first , second )","docstring":"/**\n * Applies [operation] to [first] and [second] if both not-null, otherwise returns null\n */"} {"signature":"internal fun < F : R , S : R , R > applyWithDefault ( first : F ? , second : S ? , operation : ( F , S ) -> R ) : R ?","body":"= when { first == null && second == null -> null first == null -> second second == null -> first else -> operation ( first , second ) }","docstring":"/**\n * If both [first] and [second] are null, then return null\n * If only one of [first] and [second] is null, then return other one\n * Otherwise, return result of [operation]\n */"} {"signature":"public abstract operator fun times ( scalar : Int ) : DateTimeUnit","body":"public abstract operator fun times ( scalar : Int ) : DateTimeUnit","docstring":"/** Produces a date-time unit that is a multiple of this unit times the specified integer [scalar] value. */"} {"signature":"internal fun ArtifactContent . write ( artifactFile : File , rootDir : File )","body":"{ val sources = sources . joinToString ( \"\" ) { it . toRelativeString ( rootDir ) } val outputs = outputs . joinToString ( \"\" ) { it . toRelativeString ( rootDir ) } val reports = reports . joinToString ( \"\" ) { it . toRelativeString ( rootDir ) } artifactFile . writeText ( \"\" ) }","docstring":"/**\n * Write Kover artifact content to the file.\n */"} {"signature":"internal fun File . parseArtifactFile ( rootDir : File ) : ArtifactContent","body":"{ if ( ! exists ( ) || ! name . endsWith ( \"\" ) ) return ArtifactContent ( emptySet ( ) , emptySet ( ) , emptySet ( ) ) val iterator = readLines ( ) . iterator ( ) val sources = iterator . groupUntil { it . isEmpty ( ) } . map { rootDir . resolve ( it ) } . toSet ( ) val outputs = iterator . groupUntil { it . isEmpty ( ) } . map { rootDir . resolve ( it ) } . toSet ( ) val reports = iterator . groupUntil { it . isEmpty ( ) } . map { rootDir . resolve ( it ) } . toSet ( ) return ArtifactContent ( sources , outputs , reports ) }","docstring":"/**\n * Read Kover artifact content from the file.\n */"} {"signature":"public operator fun BufferedInputStream . iterator ( ) : ByteIterator","body":"= object : ByteIterator ( ) { var nextByte = - var nextPrepared = false var finished = false private fun prepareNext ( ) { if ( ! nextPrepared && ! finished ) { nextByte = read ( ) nextPrepared = true finished = ( nextByte == - ) } } public override fun hasNext ( ) : Boolean { prepareNext ( ) return ! finished } public override fun nextByte ( ) : Byte { prepareNext ( ) if ( finished ) throw NoSuchElementException ( \"\" ) val res = nextByte . toByte ( ) nextPrepared = false return res } }","docstring":"/** Returns an [Iterator] of bytes read from this input stream. */"} {"signature":"@ kotlin . internal . InlineOnly public inline fun String . byteInputStream ( charset : Charset = Charsets . UTF_8 ) : ByteArrayInputStream","body":"= ByteArrayInputStream ( toByteArray ( charset ) )","docstring":"/** Creates a new byte input stream for the string. */"} {"signature":"@ kotlin . internal . InlineOnly public inline fun ByteArray . inputStream ( ) : ByteArrayInputStream","body":"= ByteArrayInputStream ( this )","docstring":"/**\n * Creates an input stream for reading data from this byte array.\n */"} {"signature":"@ kotlin . internal . InlineOnly public inline fun ByteArray . inputStream ( offset : Int , length : Int ) : ByteArrayInputStream","body":"= ByteArrayInputStream ( this , offset , length )","docstring":"/**\n * Creates an input stream for reading data from the specified portion of this byte array.\n * @param offset the start offset of the portion of the array to read.\n * @param length the length of the portion of the array to read.\n */"} {"signature":"@ kotlin . internal . InlineOnly public inline fun InputStream . buffered ( bufferSize : Int = DEFAULT_BUFFER_SIZE ) : BufferedInputStream","body":"= if ( this is BufferedInputStream ) this else BufferedInputStream ( this , bufferSize )","docstring":"/**\n * Creates a buffered input stream wrapping this stream.\n * @param bufferSize the buffer size to use.\n */"} {"signature":"@ kotlin . internal . InlineOnly public inline fun InputStream . reader ( charset : Charset = Charsets . UTF_8 ) : InputStreamReader","body":"= InputStreamReader ( this , charset )","docstring":"/** Creates a reader on this input stream using UTF-8 or the specified [charset]. */"} {"signature":"@ kotlin . internal . InlineOnly public inline fun InputStream . bufferedReader ( charset : Charset = Charsets . UTF_8 ) : BufferedReader","body":"= reader ( charset ) . buffered ( )","docstring":"/** Creates a buffered reader on this input stream using UTF-8 or the specified [charset]. */"} {"signature":"@ kotlin . internal . InlineOnly public inline fun OutputStream . buffered ( bufferSize : Int = DEFAULT_BUFFER_SIZE ) : BufferedOutputStream","body":"= if ( this is BufferedOutputStream ) this else BufferedOutputStream ( this , bufferSize )","docstring":"/**\n * Creates a buffered output stream wrapping this stream.\n * @param bufferSize the buffer size to use.\n */"} {"signature":"@ kotlin . internal . InlineOnly public inline fun OutputStream . writer ( charset : Charset = Charsets . UTF_8 ) : OutputStreamWriter","body":"= OutputStreamWriter ( this , charset )","docstring":"/** Creates a writer on this output stream using UTF-8 or the specified [charset]. */"} {"signature":"@ kotlin . internal . InlineOnly public inline fun OutputStream . bufferedWriter ( charset : Charset = Charsets . UTF_8 ) : BufferedWriter","body":"= writer ( charset ) . buffered ( )","docstring":"/** Creates a buffered writer on this output stream using UTF-8 or the specified [charset]. */"} {"signature":"public fun InputStream . copyTo ( out : OutputStream , bufferSize : Int = DEFAULT_BUFFER_SIZE ) : Long","body":"{ var bytesCopied : Long = val buffer = ByteArray ( bufferSize ) var bytes = read ( buffer ) while ( bytes >= ) { out . write ( buffer , , bytes ) bytesCopied += bytes bytes = read ( buffer ) } return bytesCopied }","docstring":"/**\n * Copies this stream to the given output stream, returning the number of bytes copied\n *\n * **Note** It is the caller's responsibility to close both of these resources.\n */"} {"signature":"@ Deprecated ( \"\" , ReplaceWith ( \"\" ) ) @ DeprecatedSinceKotlin ( warningSince = \"\" , errorSince = \"\" ) public fun InputStream . readBytes ( estimatedSize : Int = DEFAULT_BUFFER_SIZE ) : ByteArray","body":"{ val buffer = ByteArrayOutputStream ( maxOf ( estimatedSize , this . available ( ) ) ) copyTo ( buffer ) return buffer . toByteArray ( ) }","docstring":"/**\n * Reads this stream completely into a byte array.\n *\n * **Note**: It is the caller's responsibility to close this stream.\n */"} {"signature":"@ SinceKotlin ( \"\" ) public fun InputStream . readBytes ( ) : ByteArray","body":"{ val buffer = ByteArrayOutputStream ( maxOf ( DEFAULT_BUFFER_SIZE , this . available ( ) ) ) copyTo ( buffer ) return buffer . toByteArray ( ) }","docstring":"/**\n * Reads this stream completely into a byte array.\n *\n * **Note**: It is the caller's responsibility to close this stream.\n */"} {"signature":"fun resolve ( sourceSet : KotlinSourceSet , dependencies : Set < IdeaKotlinDependency > )","body":"fun resolve ( sourceSet : KotlinSourceSet , dependencies : Set < IdeaKotlinDependency > )","docstring":"/**\n * This function is intended to resolve 'additional' artifacts:\n * This means 'artifacts' that can be attached to some existing/already resolved dependency.\n * One good example of such an 'additional artifact' would be a -sources.jar file:\n * It is not a dependency on its own: It shares the coordinates with some [IdeaKotlinBinaryDependency] and can be\n * attached to this dependency to provide extra functionality.\n *\n * Contract:\n * - This function is allowed to attach data to a given [IdeaKotlinDependency]\n * - This function is not allowed to remove data from a given [IdeaKotlinBinaryDependency]\n * - This function is not supposed to modify the [sourceSet]\n *\n * @param sourceSet: The current SourceSet which shall resolve additional dependencies\n * @param dependencies: The already resolved dependencies from prior stages\n */"} {"signature":"internal fun IdeAdditionalArtifactResolver ( resolver : IdeDependencyResolver )","body":"= IdeAdditionalArtifactResolver { sourceSet , dependencies -> val dependenciesByCoordinates = dependencies . filterIsInstance < IdeaKotlinResolvedBinaryDependency > ( ) . filter { it . binaryType == IdeaKotlinBinaryDependency . KOTLIN_COMPILE_BINARY_TYPE } . groupBy { it . coordinates ? . copy ( sourceSetName = null ) } resolver . resolve ( sourceSet ) . filterIsInstance < IdeaKotlinResolvedBinaryDependency > ( ) . filter { it . binaryType == SOURCES_BINARY_TYPE || it . binaryType == DOCUMENTATION_BINARY_TYPE } . forEach forEachSourceOrDocumentationDependency @ { sourceOrDocumentationDependency -> dependenciesByCoordinates [ sourceOrDocumentationDependency . coordinates ? : return@forEachSourceOrDocumentationDependency ] . orEmpty ( ) . forEach forEachMatchedDependency @ { dependency -> val classpath = when ( sourceOrDocumentationDependency . binaryType ) { SOURCES_BINARY_TYPE -> dependency . sourcesClasspath DOCUMENTATION_BINARY_TYPE -> dependency . documentationClasspath else -> return@forEachMatchedDependency } classpath . addAll ( dependency . classpath ) } } }","docstring":"/**\n * Creates an [IdeAdditionalArtifactResolver] from a given [IdeDependencyResolver]:\n * Dependencies from the [IdeDependencyResolver] need to resolve sources and javadoc using\n * the [SOURCES_BINARY_TYPE] or [DOCUMENTATION_BINARY_TYPE]\n */"} {"signature":"@ InternalCoroutinesApi public fun < T > ( suspend ( ) -> T ) . startCoroutineCancellable ( completion : Continuation < T > ) : Unit","body":"= runSafely ( completion ) { createCoroutineUnintercepted ( completion ) . intercepted ( ) . resumeCancellableWith ( Result . success ( Unit ) ) }","docstring":"/**\n * Use this function to start coroutine in a cancellable way, so that it can be cancelled\n * while waiting to be dispatched.\n */"} {"signature":"internal fun < R , T > ( suspend ( R ) -> T ) . startCoroutineCancellable ( receiver : R , completion : Continuation < T > , onCancellation : ( ( cause : Throwable ) -> Unit ) ? = null )","body":"= runSafely ( completion ) { createCoroutineUnintercepted ( receiver , completion ) . intercepted ( ) . resumeCancellableWith ( Result . success ( Unit ) , onCancellation ) }","docstring":"/**\n * Use this function to start coroutine in a cancellable way, so that it can be cancelled\n * while waiting to be dispatched.\n */"} {"signature":"internal fun Continuation < Unit > . startCoroutineCancellable ( fatalCompletion : Continuation < * > )","body":"= runSafely ( fatalCompletion ) { intercepted ( ) . resumeCancellableWith ( Result . success ( Unit ) ) }","docstring":"/**\n * Similar to [startCoroutineCancellable], but for already created coroutine.\n * [fatalCompletion] is used only when interception machinery throws an exception\n */"} {"signature":"private inline fun runSafely ( completion : Continuation < * > , block : ( ) -> Unit )","body":"{ try { block ( ) } catch ( e : Throwable ) { dispatcherFailure ( completion , e ) } }","docstring":"/**\n * Runs given block and completes completion with its exception if it occurs.\n * Rationale: [startCoroutineCancellable] is invoked when we are about to run coroutine asynchronously in its own dispatcher.\n * Thus if dispatcher throws an exception during coroutine start, coroutine never completes, so we should treat dispatcher exception\n * as its cause and resume completion.\n */"} {"signature":"fun createCandidate ( callInfo : CallInfo , symbol : FirBasedSymbol < * > , explicitReceiverKind : ExplicitReceiverKind , scope : FirScope ? , dispatchReceiver : FirExpression ? = null , givenExtensionReceiverOptions : List < FirExpression > = emptyList ( ) , objectsByName : Boolean = false , isFromOriginalTypeInPresenceOfSmartCast : Boolean = false , ) : Candidate","body":"{ var pluginAmbiguity : AmbiguousInterceptedSymbol ? = null @ Suppress ( \"\" ) @ OptIn ( FirExtensionApiInternals :: class ) val symbol = if ( callRefinementExtensions != null && callInfo . callKind == CallKind . Function && symbol is FirNamedFunctionSymbol ) { val result = symbol . replaceFromPluginsIfNeeded ( callRefinementExtensions , callInfo ) pluginAmbiguity = result . second result . first } else { symbol . unwrapIntegerOperatorSymbolIfNeeded ( callInfo ) } val result = Candidate ( symbol , dispatchReceiver , givenExtensionReceiverOptions , explicitReceiverKind , context . inferenceComponents . constraintSystemFactory , baseSystem , callInfo , scope , isFromCompanionObjectTypeScope = when ( explicitReceiverKind ) { ExplicitReceiverKind . EXTENSION_RECEIVER -> givenExtensionReceiverOptions . singleOrNull ( ) . isCandidateFromCompanionObjectTypeScope ( callInfo . session ) ExplicitReceiverKind . DISPATCH_RECEIVER -> dispatchReceiver . isCandidateFromCompanionObjectTypeScope ( callInfo . session ) ExplicitReceiverKind . NO_EXPLICIT_RECEIVER , ExplicitReceiverKind . BOTH_RECEIVERS -> false } , isFromOriginalTypeInPresenceOfSmartCast , context . bodyResolveContext . inferenceSession , ) if ( pluginAmbiguity != null ) { result . addDiagnostic ( pluginAmbiguity ) } val callSite = callInfo . callSite if ( callSite is FirCallableReferenceAccess ) { when { symbol is FirValueParameterSymbol || symbol is FirPropertySymbol && symbol . isLocal || symbol is FirBackingFieldSymbol -> { result . addDiagnostic ( Unsupported ( \"\" , callSite . calleeReference . source ) ) } symbol is FirEnumEntrySymbol -> { result . addDiagnostic ( Unsupported ( \"\" , callSite . calleeReference . source ) ) } } } else if ( objectsByName && symbol . isRegularClassWithoutCompanion ( callInfo . session ) ) { result . addDiagnostic ( NoCompanionObject ) } if ( callInfo . origin == FirFunctionCallOrigin . Operator ) { val normalizedSymbol = when ( symbol ) { !is FirFunctionSymbol -> symbol else -> callInfo . candidateForCommonInvokeReceiver ? . symbol ? . takeIf { it !is FirFunctionSymbol } } normalizedSymbol ? . let { result . addDiagnostic ( NotFunctionAsOperator ( normalizedSymbol ) ) } } if ( symbol is FirPropertySymbol && ! context . session . languageVersionSettings . supportsFeature ( LanguageFeature . PrioritizedEnumEntries ) ) { val containingClass = symbol . containingClassLookupTag ( ) ? . toFirRegularClass ( context . session ) if ( containingClass != null && symbol . fir . isEnumEntries ( containingClass ) ) { result . addDiagnostic ( LowerPriorityToPreserveCompatibilityDiagnostic ) } } return result }","docstring":"/**\n * [createCandidate] doesn't make any guarantees for inapplicable calls. Errors in the call or callee do not necessarily result in an\n * inapplicable [Candidate].\n */"} {"signature":"protected abstract fun crop ( tf : Ops , input : Operand < Float > ) : Operand < Float >","body":"protected abstract fun crop ( tf : Ops , input : Operand < Float > ) : Operand < Float >","docstring":"/**\n * The actual implementation of cropping operation which each subclassed layer needs to\n * implement. This method will then be called from [build] method to crop the input tensor.\n */"} {"signature":"@ ExternalKotlinTargetApi fun Jar . includeSources ( compilation : DecoratedExternalKotlinCompilation )","body":"{ includeSources ( compilation . internal ) }","docstring":"/**\n *\n * Will add all sources (including transitive dependsOn edges) from the compilation into this jar task given\n * the multiplatform convention.\n *\n * e.g.\n * ```\n * src/commonMain/kotlin/CommonMain.kt\n * src/jvmMain/kotlin/JvmMain.kt\n * ```\n *\n * will be packaged like\n * ```\n * /commonMain/CommonMain.kt\n * /jvmMain/JvmMain.kt\n * ```\n *\n * @since 1.9.20\n */"} {"signature":"@ ExternalKotlinTargetApi fun DecoratedExternalKotlinTarget . sourcesJarTask ( compilation : DecoratedExternalKotlinCompilation ) : TaskProvider < Jar >","body":"{ return sourcesJarTask ( compilation , componentName = lowerCamelCaseName ( targetName , compilation . name . takeUnless { compilation . isMain ( ) } ) , artifactNameAppendix = targetName . toLowerCaseAsciiOnly ( ) ) }","docstring":"/**\n * Registers, or returns if already existing, a sources jar task that contains\n * all sources of the given compilation (see [includeSources])\n *\n * @since 1.9.20\n */"} {"signature":"@ ExternalKotlinTargetApi fun DecoratedExternalKotlinTarget . publishSources ( jarTask : TaskProvider < Jar > )","body":"{ delegate . sourcesElementsPublishedConfiguration . outgoing . artifact ( jarTask ) { artifact -> artifact . classifier = \"\" } }","docstring":"/**\n * Publishes the sources packaged by the given [jarTask] in this targets' publication.\n *\n * @since 1.9.20\n */"} {"signature":"@ ExternalKotlinTargetApi fun DecoratedExternalKotlinTarget . publishSources ( compilation : DecoratedExternalKotlinCompilation )","body":"{ publishSources ( sourcesJarTask ( compilation ) ) }","docstring":"/**\n * Publishes the sources associated with the given [compilation] in this targets' publication.\n * Will register the corresponding [sourcesJarTask] if necessary.\n *\n * @since 1.9.20\n */"} {"signature":"fun test1 ( )","body":"{ }","docstring":"/**\n * block comment\n */"} {"signature":"public operator fun < @ kotlin . internal . OnlyInputTypes T > Sequence < T > . contains ( element : T ) : Boolean","body":"{ return indexOf ( element ) >= }","docstring":"/**\n * Returns `true` if [element] is found in the sequence.\n *\n * The operation is _terminal_.\n */"} {"signature":"public fun < T > Sequence < T > . elementAt ( index : Int ) : T","body":"{ 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 sequence.\n *\n * The operation is _terminal_.\n * \n * @sample samples.collections.Collections.Elements.elementAt\n */"} {"signature":"public fun < T > Sequence < T > . elementAtOrElse ( index : Int , defaultValue : ( Int ) -> T ) : T","body":"{ contract { callsInPlace ( defaultValue , InvocationKind . AT_MOST_ONCE ) } 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 sequence.\n *\n * The operation is _terminal_.\n * \n * @sample samples.collections.Collections.Elements.elementAtOrElse\n */"} {"signature":"public fun < T > Sequence < T > . elementAtOrNull ( index : Int ) : T ?","body":"{ 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 sequence.\n *\n * The operation is _terminal_.\n * \n * @sample samples.collections.Collections.Elements.elementAtOrNull\n */"} {"signature":"@ kotlin . internal . InlineOnly public inline fun < T > Sequence < 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 * The operation is _terminal_.\n * \n * @sample samples.collections.Collections.Elements.find\n */"} {"signature":"@ kotlin . internal . InlineOnly public inline fun < T > Sequence < 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 * The operation is _terminal_.\n * \n * @sample samples.collections.Collections.Elements.find\n */"} {"signature":"public fun < T > Sequence < T > . first ( ) : T","body":"{ val iterator = iterator ( ) if ( ! iterator . hasNext ( ) ) throw NoSuchElementException ( \"\" ) return iterator . next ( ) }","docstring":"/**\n * Returns the first element.\n *\n * The operation is _terminal_.\n * \n * @throws NoSuchElementException if the sequence is empty.\n */"} {"signature":"public inline fun < T > Sequence < 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 *\n * The operation is _terminal_.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . internal . InlineOnly public inline fun < T , R : Any > Sequence < 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 sequence in iteration order,\n * or throws [NoSuchElementException] if no non-null value was produced.\n *\n * The operation is _terminal_.\n * \n * @sample samples.collections.Collections.Transformations.firstNotNullOf\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . internal . InlineOnly public inline fun < T , R : Any > Sequence < 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 sequence in iteration order,\n * or `null` if no non-null value was produced.\n *\n * The operation is _terminal_.\n * \n * @sample samples.collections.Collections.Transformations.firstNotNullOf\n */"} {"signature":"public fun < T > Sequence < T > . firstOrNull ( ) : T ?","body":"{ val iterator = iterator ( ) if ( ! iterator . hasNext ( ) ) return null return iterator . next ( ) }","docstring":"/**\n * Returns the first element, or `null` if the sequence is empty.\n *\n * The operation is _terminal_.\n */"} {"signature":"public inline fun < T > Sequence < 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 *\n * The operation is _terminal_.\n */"} {"signature":"public fun < @ kotlin . internal . OnlyInputTypes T > Sequence < T > . indexOf ( element : T ) : Int","body":"{ 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 sequence does not contain element.\n *\n * The operation is _terminal_.\n */"} {"signature":"public inline fun < T > Sequence < 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 sequence does not contain such element.\n *\n * The operation is _terminal_.\n */"} {"signature":"public inline fun < T > Sequence < 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 sequence does not contain such element.\n *\n * The operation is _terminal_.\n */"} {"signature":"public fun < T > Sequence < T > . last ( ) : T","body":"{ 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 * The operation is _terminal_.\n * \n * @throws NoSuchElementException if the sequence is empty.\n * \n * @sample samples.collections.Collections.Elements.last\n */"} {"signature":"public inline fun < T > Sequence < 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 * The operation is _terminal_.\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 > Sequence < T > . lastIndexOf ( element : T ) : Int","body":"{ 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 sequence does not contain element.\n *\n * The operation is _terminal_.\n */"} {"signature":"public fun < T > Sequence < T > . lastOrNull ( ) : T ?","body":"{ 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 sequence is empty.\n *\n * The operation is _terminal_.\n * \n * @sample samples.collections.Collections.Elements.last\n */"} {"signature":"public inline fun < T > Sequence < 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 * The operation is _terminal_.\n * \n * @sample samples.collections.Collections.Elements.last\n */"} {"signature":"public fun < T > Sequence < T > . single ( ) : T","body":"{ 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 sequence is empty or has more than one element.\n *\n * The operation is _terminal_.\n */"} {"signature":"public inline fun < T > Sequence < 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 *\n * The operation is _terminal_.\n */"} {"signature":"public fun < T > Sequence < T > . singleOrNull ( ) : T ?","body":"{ 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 sequence is empty or has more than one element.\n *\n * The operation is _terminal_.\n */"} {"signature":"public inline fun < T > Sequence < 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 *\n * The operation is _terminal_.\n */"} {"signature":"public fun < T > Sequence < T > . drop ( n : Int ) : Sequence < T >","body":"{ require ( n >= ) { \"\" } return when { n == -> this this is DropTakeSequence -> this . drop ( n ) else -> DropSequence ( this , n ) } }","docstring":"/**\n * Returns a sequence containing all elements except first [n] elements.\n *\n * The operation is _intermediate_ and _stateless_.\n * \n * @throws IllegalArgumentException if [n] is negative.\n * \n * @sample samples.collections.Collections.Transformations.drop\n */"} {"signature":"public fun < T > Sequence < T > . dropWhile ( predicate : ( T ) -> Boolean ) : Sequence < T >","body":"{ return DropWhileSequence ( this , predicate ) }","docstring":"/**\n * Returns a sequence containing all elements except first elements that satisfy the given [predicate].\n *\n * The operation is _intermediate_ and _stateless_.\n * \n * @sample samples.collections.Collections.Transformations.drop\n */"} {"signature":"public fun < T > Sequence < T > . filter ( predicate : ( T ) -> Boolean ) : Sequence < T >","body":"{ return FilteringSequence ( this , true , predicate ) }","docstring":"/**\n * Returns a sequence containing only elements matching the given [predicate].\n *\n * The operation is _intermediate_ and _stateless_.\n * \n * @sample samples.collections.Collections.Filtering.filter\n */"} {"signature":"public fun < T > Sequence < T > . filterIndexed ( predicate : ( index : Int , T ) -> Boolean ) : Sequence < T >","body":"{ return TransformingSequence ( FilteringSequence ( IndexingSequence ( this ) , true , { predicate ( it . index , it . value ) } ) , { it . value } ) }","docstring":"/**\n * Returns a sequence 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 * The operation is _intermediate_ and _stateless_.\n * \n * @sample samples.collections.Collections.Filtering.filterIndexed\n */"} {"signature":"public inline fun < T , C : MutableCollection < in T > > Sequence < 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 * The operation is _terminal_.\n * \n * @sample samples.collections.Collections.Filtering.filterIndexedTo\n */"} {"signature":"public inline fun < reified R > Sequence < * > . filterIsInstance ( ) : Sequence < @ kotlin . internal . NoInfer R >","body":"{ @ Suppress ( \"\" ) return filter { it is R } as Sequence < R > }","docstring":"/**\n * Returns a sequence containing all elements that are instances of specified type parameter R.\n *\n * The operation is _intermediate_ and _stateless_.\n * \n * @sample samples.collections.Collections.Filtering.filterIsInstance\n */"} {"signature":"public inline fun < reified R , C : MutableCollection < in R > > Sequence < * > . 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 * The operation is _terminal_.\n * \n * @sample samples.collections.Collections.Filtering.filterIsInstanceTo\n */"} {"signature":"public fun < T > Sequence < T > . filterNot ( predicate : ( T ) -> Boolean ) : Sequence < T >","body":"{ return FilteringSequence ( this , false , predicate ) }","docstring":"/**\n * Returns a sequence containing all elements not matching the given [predicate].\n *\n * The operation is _intermediate_ and _stateless_.\n * \n * @sample samples.collections.Collections.Filtering.filter\n */"} {"signature":"public fun < T : Any > Sequence < T ? > . filterNotNull ( ) : Sequence < T >","body":"{ @ Suppress ( \"\" ) return filterNot { it == null } as Sequence < T > }","docstring":"/**\n * Returns a sequence containing all elements that are not `null`.\n *\n * The operation is _intermediate_ and _stateless_.\n * \n * @sample samples.collections.Collections.Filtering.filterNotNull\n */"} {"signature":"public fun < C : MutableCollection < in T > , T : Any > Sequence < 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 * The operation is _terminal_.\n * \n * @sample samples.collections.Collections.Filtering.filterNotNullTo\n */"} {"signature":"public inline fun < T , C : MutableCollection < in T > > Sequence < 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 * The operation is _terminal_.\n * \n * @sample samples.collections.Collections.Filtering.filterTo\n */"} {"signature":"public inline fun < T , C : MutableCollection < in T > > Sequence < 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 * The operation is _terminal_.\n * \n * @sample samples.collections.Collections.Filtering.filterTo\n */"} {"signature":"public fun < T > Sequence < T > . take ( n : Int ) : Sequence < T >","body":"{ require ( n >= ) { \"\" } return when { n == -> emptySequence ( ) this is DropTakeSequence -> this . take ( n ) else -> TakeSequence ( this , n ) } }","docstring":"/**\n * Returns a sequence containing first [n] elements.\n *\n * The operation is _intermediate_ and _stateless_.\n * \n * @throws IllegalArgumentException if [n] is negative.\n * \n * @sample samples.collections.Collections.Transformations.take\n */"} {"signature":"public fun < T > Sequence < T > . takeWhile ( predicate : ( T ) -> Boolean ) : Sequence < T >","body":"{ return TakeWhileSequence ( this , predicate ) }","docstring":"/**\n * Returns a sequence containing first elements satisfying the given [predicate].\n *\n * The operation is _intermediate_ and _stateless_.\n * \n * @sample samples.collections.Collections.Transformations.take\n */"} {"signature":"public fun < T : Comparable < T > > Sequence < T > . sorted ( ) : Sequence < T >","body":"{ return object : Sequence < T > { override fun iterator ( ) : Iterator < T > { val sortedList = this@sorted . toMutableList ( ) sortedList . sort ( ) return sortedList . iterator ( ) } } }","docstring":"/**\n * Returns a sequence that yields elements of this sequence 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 *\n * The operation is _intermediate_ and _stateful_.\n */"} {"signature":"public inline fun < T , R : Comparable < R > > Sequence < T > . sortedBy ( crossinline selector : ( T ) -> R ? ) : Sequence < T >","body":"{ return sortedWith ( compareBy ( selector ) ) }","docstring":"/**\n * Returns a sequence that yields elements of this sequence 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 * The operation is _intermediate_ and _stateful_.\n * \n * @sample samples.collections.Collections.Sorting.sortedBy\n */"} {"signature":"public inline fun < T , R : Comparable < R > > Sequence < T > . sortedByDescending ( crossinline selector : ( T ) -> R ? ) : Sequence < T >","body":"{ return sortedWith ( compareByDescending ( selector ) ) }","docstring":"/**\n * Returns a sequence that yields elements of this sequence 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 *\n * The operation is _intermediate_ and _stateful_.\n */"} {"signature":"public fun < T : Comparable < T > > Sequence < T > . sortedDescending ( ) : Sequence < T >","body":"{ return sortedWith ( reverseOrder ( ) ) }","docstring":"/**\n * Returns a sequence that yields elements of this sequence 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 *\n * The operation is _intermediate_ and _stateful_.\n */"} {"signature":"public fun < T > Sequence < T > . sortedWith ( comparator : Comparator < in T > ) : Sequence < T >","body":"{ return object : Sequence < T > { override fun iterator ( ) : Iterator < T > { val sortedList = this@sortedWith . toMutableList ( ) sortedList . sortWith ( comparator ) return sortedList . iterator ( ) } } }","docstring":"/**\n * Returns a sequence that yields elements of this sequence 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 *\n * The operation is _intermediate_ and _stateful_.\n */"} {"signature":"public inline fun < T , K , V > Sequence < T > . associate ( transform : ( T ) -> Pair < K , V > ) : Map < K , V >","body":"{ return associateTo ( LinkedHashMap < K , V > ( ) , transform ) }","docstring":"/**\n * Returns a [Map] containing key-value pairs provided by [transform] function\n * applied to elements of the given sequence.\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 sequence.\n *\n * The operation is _terminal_.\n * \n * @sample samples.collections.Collections.Transformations.associate\n */"} {"signature":"public inline fun < T , K > Sequence < T > . associateBy ( keySelector : ( T ) -> K ) : Map < K , T >","body":"{ return associateByTo ( LinkedHashMap < K , T > ( ) , keySelector ) }","docstring":"/**\n * Returns a [Map] containing the elements from the given sequence 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 sequence.\n *\n * The operation is _terminal_.\n * \n * @sample samples.collections.Collections.Transformations.associateBy\n */"} {"signature":"public inline fun < T , K , V > Sequence < T > . associateBy ( keySelector : ( T ) -> K , valueTransform : ( T ) -> V ) : Map < K , V >","body":"{ return associateByTo ( LinkedHashMap < K , V > ( ) , keySelector , valueTransform ) }","docstring":"/**\n * Returns a [Map] containing the values provided by [valueTransform] and indexed by [keySelector] functions applied to elements of the given sequence.\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 sequence.\n *\n * The operation is _terminal_.\n * \n * @sample samples.collections.Collections.Transformations.associateByWithValueTransform\n */"} {"signature":"public inline fun < T , K , M : MutableMap < in K , in T > > Sequence < 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 sequence\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 * The operation is _terminal_.\n * \n * @sample samples.collections.Collections.Transformations.associateByTo\n */"} {"signature":"public inline fun < T , K , V , M : MutableMap < in K , in V > > Sequence < 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 sequence.\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 operation is _terminal_.\n * \n * @sample samples.collections.Collections.Transformations.associateByToWithValueTransform\n */"} {"signature":"public inline fun < T , K , V , M : MutableMap < in K , in V > > Sequence < 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 sequence.\n * \n * If any of two pairs would have the same key the last one gets added to the map.\n *\n * The operation is _terminal_.\n * \n * @sample samples.collections.Collections.Transformations.associateTo\n */"} {"signature":"@ SinceKotlin ( \"\" ) public inline fun < K , V > Sequence < K > . associateWith ( valueSelector : ( K ) -> V ) : Map < K , V >","body":"{ val result = LinkedHashMap < K , V > ( ) return associateWithTo ( result , valueSelector ) }","docstring":"/**\n * Returns a [Map] where keys are elements from the given sequence 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 sequence.\n *\n * The operation is _terminal_.\n * \n * @sample samples.collections.Collections.Transformations.associateWith\n */"} {"signature":"@ SinceKotlin ( \"\" ) public inline fun < K , V , M : MutableMap < in K , in V > > Sequence < 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 sequence,\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 * The operation is _terminal_.\n * \n * @sample samples.collections.Collections.Transformations.associateWithTo\n */"} {"signature":"public fun < T , C : MutableCollection < in T > > Sequence < 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 *\n * The operation is _terminal_.\n */"} {"signature":"public fun < T > Sequence < T > . toHashSet ( ) : HashSet < T >","body":"{ return toCollection ( HashSet < T > ( ) ) }","docstring":"/**\n * Returns a new [HashSet] of all elements.\n *\n * The operation is _terminal_.\n */"} {"signature":"public fun < T > Sequence < T > . toList ( ) : List < T >","body":"{ val it = iterator ( ) if ( ! it . hasNext ( ) ) return emptyList ( ) val element = it . next ( ) if ( ! it . hasNext ( ) ) return listOf ( element ) val dst = ArrayList < T > ( ) dst . add ( element ) while ( it . hasNext ( ) ) dst . add ( it . next ( ) ) return dst }","docstring":"/**\n * Returns a [List] containing all elements.\n *\n * The operation is _terminal_.\n */"} {"signature":"public fun < T > Sequence < T > . toMutableList ( ) : MutableList < T >","body":"{ return toCollection ( ArrayList < T > ( ) ) }","docstring":"/**\n * Returns a new [MutableList] filled with all elements of this sequence.\n *\n * The operation is _terminal_.\n */"} {"signature":"public fun < T > Sequence < T > . toSet ( ) : Set < T >","body":"{ val it = iterator ( ) if ( ! it . hasNext ( ) ) return emptySet ( ) val element = it . next ( ) if ( ! it . hasNext ( ) ) return setOf ( element ) val dst = LinkedHashSet < T > ( ) dst . add ( element ) while ( it . hasNext ( ) ) dst . add ( it . next ( ) ) return dst }","docstring":"/**\n * Returns a [Set] of all elements.\n * \n * The returned set preserves the element iteration order of the original sequence.\n *\n * The operation is _terminal_.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ OptIn ( kotlin . experimental . ExperimentalTypeInference :: class ) @ OverloadResolutionByLambdaReturnType @ kotlin . jvm . JvmName ( \"\" ) public fun < T , R > Sequence < T > . flatMap ( transform : ( T ) -> Iterable < R > ) : Sequence < R >","body":"{ return FlatteningSequence ( this , transform , Iterable < R > :: iterator ) }","docstring":"/**\n * Returns a single sequence of all elements from results of [transform] function being invoked on each element of original sequence.\n *\n * The operation is _intermediate_ and _stateless_.\n * \n * @sample samples.collections.Collections.Transformations.flatMap\n */"} {"signature":"public fun < T , R > Sequence < T > . flatMap ( transform : ( T ) -> Sequence < R > ) : Sequence < R >","body":"{ return FlatteningSequence ( this , transform , Sequence < R > :: iterator ) }","docstring":"/**\n * Returns a single sequence of all elements from results of [transform] function being invoked on each element of original sequence.\n *\n * The operation is _intermediate_ and _stateless_.\n * \n * @sample samples.collections.Collections.Transformations.flatMap\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ OptIn ( kotlin . experimental . ExperimentalTypeInference :: class ) @ OverloadResolutionByLambdaReturnType @ kotlin . jvm . JvmName ( \"\" ) public fun < T , R > Sequence < T > . flatMapIndexed ( transform : ( index : Int , T ) -> Iterable < R > ) : Sequence < R >","body":"{ return flatMapIndexed ( this , transform , Iterable < R > :: iterator ) }","docstring":"/**\n * Returns a single sequence of all elements yielded from results of [transform] function being invoked on each element\n * and its index in the original sequence.\n *\n * The operation is _intermediate_ and _stateless_.\n * \n * @sample samples.collections.Collections.Transformations.flatMapIndexed\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ OptIn ( kotlin . experimental . ExperimentalTypeInference :: class ) @ OverloadResolutionByLambdaReturnType @ kotlin . jvm . JvmName ( \"\" ) public fun < T , R > Sequence < T > . flatMapIndexed ( transform : ( index : Int , T ) -> Sequence < R > ) : Sequence < R >","body":"{ return flatMapIndexed ( this , transform , Sequence < R > :: iterator ) }","docstring":"/**\n * Returns a single sequence of all elements yielded from results of [transform] function being invoked on each element\n * and its index in the original sequence.\n *\n * The operation is _intermediate_ and _stateless_.\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 > > Sequence < 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 sequence, to the given [destination].\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 , R , C : MutableCollection < in R > > Sequence < 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 sequence, to the given [destination].\n *\n * The operation is _terminal_.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ OptIn ( kotlin . experimental . ExperimentalTypeInference :: class ) @ OverloadResolutionByLambdaReturnType @ kotlin . jvm . JvmName ( \"\" ) public inline fun < T , R , C : MutableCollection < in R > > Sequence < 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 sequence, to the given [destination].\n *\n * The operation is _terminal_.\n */"} {"signature":"public inline fun < T , R , C : MutableCollection < in R > > Sequence < 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 sequence, to the given [destination].\n *\n * The operation is _terminal_.\n */"} {"signature":"public inline fun < T , K > Sequence < T > . groupBy ( keySelector : ( T ) -> K ) : Map < K , List < T > >","body":"{ return groupByTo ( LinkedHashMap < K , MutableList < T > > ( ) , keySelector ) }","docstring":"/**\n * Groups elements of the original sequence 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 sequence.\n *\n * The operation is _terminal_.\n * \n * @sample samples.collections.Collections.Transformations.groupBy\n */"} {"signature":"public inline fun < T , K , V > Sequence < 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 sequence\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 sequence.\n *\n * The operation is _terminal_.\n * \n * @sample samples.collections.Collections.Transformations.groupByKeysAndValues\n */"} {"signature":"public inline fun < T , K , M : MutableMap < in K , MutableList < T > > > Sequence < 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 sequence 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 * The operation is _terminal_.\n * \n * @sample samples.collections.Collections.Transformations.groupBy\n */"} {"signature":"public inline fun < T , K , V , M : MutableMap < in K , MutableList < V > > > Sequence < 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 sequence\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 * The operation is _terminal_.\n * \n * @sample samples.collections.Collections.Transformations.groupByKeysAndValues\n */"} {"signature":"@ SinceKotlin ( \"\" ) public inline fun < T , K > Sequence < 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 sequence 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 * The operation is _intermediate_ and _stateless_.\n * \n * @sample samples.collections.Grouping.groupingByEachCount\n */"} {"signature":"public fun < T , R > Sequence < T > . map ( transform : ( T ) -> R ) : Sequence < R >","body":"{ return TransformingSequence ( this , transform ) }","docstring":"/**\n * Returns a sequence containing the results of applying the given [transform] function\n * to each element in the original sequence.\n *\n * The operation is _intermediate_ and _stateless_.\n * \n * @sample samples.collections.Collections.Transformations.map\n */"} {"signature":"public fun < T , R > Sequence < T > . mapIndexed ( transform : ( index : Int , T ) -> R ) : Sequence < R >","body":"{ return TransformingIndexedSequence ( this , transform ) }","docstring":"/**\n * Returns a sequence containing the results of applying the given [transform] function\n * to each element and its index in the original sequence.\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 *\n * The operation is _intermediate_ and _stateless_.\n */"} {"signature":"public fun < T , R : Any > Sequence < T > . mapIndexedNotNull ( transform : ( index : Int , T ) -> R ? ) : Sequence < R >","body":"{ return TransformingIndexedSequence ( this , transform ) . filterNotNull ( ) }","docstring":"/**\n * Returns a sequence containing only the non-null results of applying the given [transform] function\n * to each element and its index in the original sequence.\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 *\n * The operation is _intermediate_ and _stateless_.\n */"} {"signature":"public inline fun < T , R : Any , C : MutableCollection < in R > > Sequence < 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 sequence\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 *\n * The operation is _terminal_.\n */"} {"signature":"public inline fun < T , R , C : MutableCollection < in R > > Sequence < 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 sequence\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 *\n * The operation is _terminal_.\n */"} {"signature":"public fun < T , R : Any > Sequence < T > . mapNotNull ( transform : ( T ) -> R ? ) : Sequence < R >","body":"{ return TransformingSequence ( this , transform ) . filterNotNull ( ) }","docstring":"/**\n * Returns a sequence containing only the non-null results of applying the given [transform] function\n * to each element in the original sequence.\n *\n * The operation is _intermediate_ and _stateless_.\n * \n * @sample samples.collections.Collections.Transformations.mapNotNull\n */"} {"signature":"public inline fun < T , R : Any , C : MutableCollection < in R > > Sequence < 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 sequence\n * and appends only the non-null results to the given [destination].\n *\n * The operation is _terminal_.\n */"} {"signature":"public inline fun < T , R , C : MutableCollection < in R > > Sequence < 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 sequence\n * and appends the results to the given [destination].\n *\n * The operation is _terminal_.\n */"} {"signature":"public fun < T > Sequence < T > . withIndex ( ) : Sequence < IndexedValue < T > >","body":"{ return IndexingSequence ( this ) }","docstring":"/**\n * Returns a sequence that wraps each element of the original sequence\n * into an [IndexedValue] containing the index of that element and the element itself.\n *\n * The operation is _intermediate_ and _stateless_.\n */"} {"signature":"public fun < T > Sequence < T > . distinct ( ) : Sequence < T >","body":"{ return this . distinctBy { it } }","docstring":"/**\n * Returns a sequence containing only distinct elements from the given sequence.\n * \n * Among equal elements of the given sequence, only the first one will be present in the resulting sequence.\n * The elements in the resulting sequence are in the same order as they were in the source sequence.\n *\n * The operation is _intermediate_ and _stateful_.\n * \n * @sample samples.collections.Collections.Transformations.distinctAndDistinctBy\n */"} {"signature":"public fun < T , K > Sequence < T > . distinctBy ( selector : ( T ) -> K ) : Sequence < T >","body":"{ return DistinctSequence ( this , selector ) }","docstring":"/**\n * Returns a sequence containing only elements from the given sequence\n * having distinct keys returned by the given [selector] function.\n * \n * Among elements of the given sequence with equal keys, only the first one will be present in the resulting sequence.\n * The elements in the resulting sequence are in the same order as they were in the source sequence.\n *\n * The operation is _intermediate_ and _stateful_.\n * \n * @sample samples.collections.Collections.Transformations.distinctAndDistinctBy\n */"} {"signature":"public fun < T > Sequence < T > . toMutableSet ( ) : MutableSet < T >","body":"{ val set = LinkedHashSet < T > ( ) for ( item in this ) set . add ( item ) return set }","docstring":"/**\n * Returns a new [MutableSet] containing all distinct elements from the given sequence.\n * \n * The returned set preserves the element iteration order of the original sequence.\n *\n * The operation is _terminal_.\n */"} {"signature":"public inline fun < T > Sequence < T > . all ( predicate : ( T ) -> Boolean ) : Boolean","body":"{ 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 sequence 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 * The operation is _terminal_.\n * \n * @sample samples.collections.Collections.Aggregates.all\n */"} {"signature":"public fun < T > Sequence < T > . any ( ) : Boolean","body":"{ return iterator ( ) . hasNext ( ) }","docstring":"/**\n * Returns `true` if sequence has at least one element.\n *\n * The operation is _terminal_.\n * \n * @sample samples.collections.Collections.Aggregates.any\n */"} {"signature":"public inline fun < T > Sequence < T > . any ( predicate : ( T ) -> Boolean ) : Boolean","body":"{ 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 * The operation is _terminal_.\n * \n * @sample samples.collections.Collections.Aggregates.anyWithPredicate\n */"} {"signature":"public fun < T > Sequence < T > . count ( ) : Int","body":"{ var count = for ( element in this ) checkCountOverflow ( ++ count ) return count }","docstring":"/**\n * Returns the number of elements in this sequence.\n *\n * The operation is _terminal_.\n */"} {"signature":"public inline fun < T > Sequence < T > . count ( predicate : ( T ) -> Boolean ) : Int","body":"{ 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 *\n * The operation is _terminal_.\n */"} {"signature":"public inline fun < T , R > Sequence < 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 sequence is empty.\n * \n * @param [operation] function that takes current accumulator value and an element, and calculates the next accumulator value.\n *\n * The operation is _terminal_.\n */"} {"signature":"public inline fun < T , R > Sequence < 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 sequence.\n * \n * Returns the specified [initial] value if the sequence 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 *\n * The operation is _terminal_.\n */"} {"signature":"public inline fun < T > Sequence < T > . forEach ( action : ( T ) -> Unit ) : Unit","body":"{ for ( element in this ) action ( element ) }","docstring":"/**\n * Performs the given [action] on each element.\n *\n * The operation is _terminal_.\n */"} {"signature":"public inline fun < T > Sequence < 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 *\n * The operation is _terminal_.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . jvm . JvmName ( \"\" ) @ Suppress ( \"\" ) public fun Sequence < 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 * The operation is _terminal_.\n * \n * @throws NoSuchElementException if the sequence is empty.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . jvm . JvmName ( \"\" ) @ Suppress ( \"\" ) public fun Sequence < 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 * The operation is _terminal_.\n * \n * @throws NoSuchElementException if the sequence is empty.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . jvm . JvmName ( \"\" ) @ Suppress ( \"\" ) public fun < T : Comparable < T > > Sequence < 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 * The operation is _terminal_.\n * \n * @throws NoSuchElementException if the sequence is empty.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . jvm . JvmName ( \"\" ) @ Suppress ( \"\" ) public inline fun < T , R : Comparable < R > > Sequence < 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 * The operation is _terminal_.\n * \n * @throws NoSuchElementException if the sequence is empty.\n * \n * @sample samples.collections.Collections.Aggregates.maxBy\n */"} {"signature":"@ SinceKotlin ( \"\" ) public inline fun < T , R : Comparable < R > > Sequence < 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 * The operation is _terminal_.\n * \n * @sample samples.collections.Collections.Aggregates.maxByOrNull\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ OptIn ( kotlin . experimental . ExperimentalTypeInference :: class ) @ OverloadResolutionByLambdaReturnType @ kotlin . internal . InlineOnly public inline fun < T > Sequence < 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 sequence.\n * \n * If any of values produced by [selector] function is `NaN`, the returned result is `NaN`.\n *\n * The operation is _terminal_.\n * \n * @throws NoSuchElementException if the sequence is empty.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ OptIn ( kotlin . experimental . ExperimentalTypeInference :: class ) @ OverloadResolutionByLambdaReturnType @ kotlin . internal . InlineOnly public inline fun < T > Sequence < 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 sequence.\n * \n * If any of values produced by [selector] function is `NaN`, the returned result is `NaN`.\n *\n * The operation is _terminal_.\n * \n * @throws NoSuchElementException if the sequence is empty.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ OptIn ( kotlin . experimental . ExperimentalTypeInference :: class ) @ OverloadResolutionByLambdaReturnType @ kotlin . internal . InlineOnly public inline fun < T , R : Comparable < R > > Sequence < 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 sequence.\n *\n * The operation is _terminal_.\n * \n * @throws NoSuchElementException if the sequence is empty.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ OptIn ( kotlin . experimental . ExperimentalTypeInference :: class ) @ OverloadResolutionByLambdaReturnType @ kotlin . internal . InlineOnly public inline fun < T > Sequence < 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 sequence 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 *\n * The operation is _terminal_.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ OptIn ( kotlin . experimental . ExperimentalTypeInference :: class ) @ OverloadResolutionByLambdaReturnType @ kotlin . internal . InlineOnly public inline fun < T > Sequence < 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 sequence 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 *\n * The operation is _terminal_.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ OptIn ( kotlin . experimental . ExperimentalTypeInference :: class ) @ OverloadResolutionByLambdaReturnType @ kotlin . internal . InlineOnly public inline fun < T , R : Comparable < R > > Sequence < 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 sequence or `null` if there are no elements.\n *\n * The operation is _terminal_.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ OptIn ( kotlin . experimental . ExperimentalTypeInference :: class ) @ OverloadResolutionByLambdaReturnType @ kotlin . internal . InlineOnly public inline fun < T , R > Sequence < 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 sequence.\n * \n * @throws NoSuchElementException if the sequence is empty.\n *\n * The operation is _terminal_.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ OptIn ( kotlin . experimental . ExperimentalTypeInference :: class ) @ OverloadResolutionByLambdaReturnType @ kotlin . internal . InlineOnly public inline fun < T , R > Sequence < 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 sequence or `null` if there are no elements.\n *\n * The operation is _terminal_.\n */"} {"signature":"@ SinceKotlin ( \"\" ) public fun Sequence < 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 *\n * The operation is _terminal_.\n */"} {"signature":"@ SinceKotlin ( \"\" ) public fun Sequence < 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 *\n * The operation is _terminal_.\n */"} {"signature":"@ SinceKotlin ( \"\" ) public fun < T : Comparable < T > > Sequence < 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 *\n * The operation is _terminal_.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . jvm . JvmName ( \"\" ) @ Suppress ( \"\" ) public fun < T > Sequence < 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 * The operation is _terminal_.\n * \n * @throws NoSuchElementException if the sequence is empty.\n */"} {"signature":"@ SinceKotlin ( \"\" ) public fun < T > Sequence < 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 *\n * The operation is _terminal_.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . jvm . JvmName ( \"\" ) @ Suppress ( \"\" ) public fun Sequence < 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 * The operation is _terminal_.\n * \n * @throws NoSuchElementException if the sequence is empty.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . jvm . JvmName ( \"\" ) @ Suppress ( \"\" ) public fun Sequence < 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 * The operation is _terminal_.\n * \n * @throws NoSuchElementException if the sequence is empty.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . jvm . JvmName ( \"\" ) @ Suppress ( \"\" ) public fun < T : Comparable < T > > Sequence < 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 * The operation is _terminal_.\n * \n * @throws NoSuchElementException if the sequence is empty.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . jvm . JvmName ( \"\" ) @ Suppress ( \"\" ) public inline fun < T , R : Comparable < R > > Sequence < 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 * The operation is _terminal_.\n * \n * @throws NoSuchElementException if the sequence is empty.\n * \n * @sample samples.collections.Collections.Aggregates.minBy\n */"} {"signature":"@ SinceKotlin ( \"\" ) public inline fun < T , R : Comparable < R > > Sequence < 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 * The operation is _terminal_.\n * \n * @sample samples.collections.Collections.Aggregates.minByOrNull\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ OptIn ( kotlin . experimental . ExperimentalTypeInference :: class ) @ OverloadResolutionByLambdaReturnType @ kotlin . internal . InlineOnly public inline fun < T > Sequence < 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 sequence.\n * \n * If any of values produced by [selector] function is `NaN`, the returned result is `NaN`.\n *\n * The operation is _terminal_.\n * \n * @throws NoSuchElementException if the sequence is empty.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ OptIn ( kotlin . experimental . ExperimentalTypeInference :: class ) @ OverloadResolutionByLambdaReturnType @ kotlin . internal . InlineOnly public inline fun < T > Sequence < 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 sequence.\n * \n * If any of values produced by [selector] function is `NaN`, the returned result is `NaN`.\n *\n * The operation is _terminal_.\n * \n * @throws NoSuchElementException if the sequence is empty.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ OptIn ( kotlin . experimental . ExperimentalTypeInference :: class ) @ OverloadResolutionByLambdaReturnType @ kotlin . internal . InlineOnly public inline fun < T , R : Comparable < R > > Sequence < 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 sequence.\n *\n * The operation is _terminal_.\n * \n * @throws NoSuchElementException if the sequence is empty.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ OptIn ( kotlin . experimental . ExperimentalTypeInference :: class ) @ OverloadResolutionByLambdaReturnType @ kotlin . internal . InlineOnly public inline fun < T > Sequence < 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 sequence 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 *\n * The operation is _terminal_.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ OptIn ( kotlin . experimental . ExperimentalTypeInference :: class ) @ OverloadResolutionByLambdaReturnType @ kotlin . internal . InlineOnly public inline fun < T > Sequence < 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 sequence 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 *\n * The operation is _terminal_.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ OptIn ( kotlin . experimental . ExperimentalTypeInference :: class ) @ OverloadResolutionByLambdaReturnType @ kotlin . internal . InlineOnly public inline fun < T , R : Comparable < R > > Sequence < 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 sequence or `null` if there are no elements.\n *\n * The operation is _terminal_.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ OptIn ( kotlin . experimental . ExperimentalTypeInference :: class ) @ OverloadResolutionByLambdaReturnType @ kotlin . internal . InlineOnly public inline fun < T , R > Sequence < 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 sequence.\n * \n * @throws NoSuchElementException if the sequence is empty.\n *\n * The operation is _terminal_.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ OptIn ( kotlin . experimental . ExperimentalTypeInference :: class ) @ OverloadResolutionByLambdaReturnType @ kotlin . internal . InlineOnly public inline fun < T , R > Sequence < 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 sequence or `null` if there are no elements.\n *\n * The operation is _terminal_.\n */"} {"signature":"@ SinceKotlin ( \"\" ) public fun Sequence < 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 *\n * The operation is _terminal_.\n */"} {"signature":"@ SinceKotlin ( \"\" ) public fun Sequence < 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 *\n * The operation is _terminal_.\n */"} {"signature":"@ SinceKotlin ( \"\" ) public fun < T : Comparable < T > > Sequence < 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 *\n * The operation is _terminal_.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ kotlin . jvm . JvmName ( \"\" ) @ Suppress ( \"\" ) public fun < T > Sequence < 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 * The operation is _terminal_.\n * \n * @throws NoSuchElementException if the sequence is empty.\n */"} {"signature":"@ SinceKotlin ( \"\" ) public fun < T > Sequence < 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 *\n * The operation is _terminal_.\n */"} {"signature":"public fun < T > Sequence < T > . none ( ) : Boolean","body":"{ return ! iterator ( ) . hasNext ( ) }","docstring":"/**\n * Returns `true` if the sequence has no elements.\n *\n * The operation is _terminal_.\n * \n * @sample samples.collections.Collections.Aggregates.none\n */"} {"signature":"public inline fun < T > Sequence < T > . none ( predicate : ( T ) -> Boolean ) : Boolean","body":"{ for ( element in this ) if ( predicate ( element ) ) return false return true }","docstring":"/**\n * Returns `true` if no elements match the given [predicate].\n *\n * The operation is _terminal_.\n * \n * @sample samples.collections.Collections.Aggregates.noneWithPredicate\n */"} {"signature":"@ SinceKotlin ( \"\" ) public fun < T > Sequence < T > . onEach ( action : ( T ) -> Unit ) : Sequence < T >","body":"{ return map { action ( it ) it } }","docstring":"/**\n * Returns a sequence which performs the given [action] on each element of the original sequence as they pass through it.\n *\n * The operation is _intermediate_ and _stateless_.\n */"} {"signature":"@ SinceKotlin ( \"\" ) public fun < T > Sequence < T > . onEachIndexed ( action : ( index : Int , T ) -> Unit ) : Sequence < T >","body":"{ return mapIndexed { index , element -> action ( index , element ) element } }","docstring":"/**\n * Returns a sequence which performs the given [action] on each element of the original sequence as they pass through it.\n * @param [action] function that takes the index of an element and the element itself\n * and performs the action on the element.\n *\n * The operation is _intermediate_ and _stateless_.\n */"} {"signature":"public inline fun < S , T : S > Sequence < 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 sequence is empty. If the sequence 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 * The operation is _terminal_.\n * \n * @sample samples.collections.Collections.Aggregates.reduce\n */"} {"signature":"public inline fun < S , T : S > Sequence < 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 sequence.\n * \n * Throws an exception if this sequence is empty. If the sequence 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 * The operation is _terminal_.\n * \n * @sample samples.collections.Collections.Aggregates.reduce\n */"} {"signature":"@ SinceKotlin ( \"\" ) public inline fun < S , T : S > Sequence < 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 sequence.\n * \n * Returns `null` if the sequence 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 * The operation is _terminal_.\n * \n * @sample samples.collections.Collections.Aggregates.reduceOrNull\n */"} {"signature":"@ SinceKotlin ( \"\" ) public inline fun < S , T : S > Sequence < 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 sequence is empty.\n * \n * @param [operation] function that takes current accumulator value and an element,\n * and calculates the next accumulator value.\n *\n * The operation is _terminal_.\n * \n * @sample samples.collections.Collections.Aggregates.reduceOrNull\n */"} {"signature":"@ SinceKotlin ( \"\" ) public fun < T , R > Sequence < T > . runningFold ( initial : R , operation : ( acc : R , T ) -> R ) : Sequence < R >","body":"{ return sequence { yield ( initial ) var accumulator = initial for ( element in this @ runningFold ) { accumulator = operation ( accumulator , element ) yield ( accumulator ) } } }","docstring":"/**\n * Returns a sequence 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 sequence.\n * The [initial] value should also be immutable (or should not be mutated)\n * as it may be passed to [operation] function later because of sequence's lazy nature.\n * \n * @param [operation] function that takes current accumulator value and an element, and calculates the next accumulator value.\n *\n * The operation is _intermediate_ and _stateless_.\n * \n * @sample samples.collections.Collections.Aggregates.runningFold\n */"} {"signature":"@ SinceKotlin ( \"\" ) public fun < T , R > Sequence < T > . runningFoldIndexed ( initial : R , operation : ( index : Int , acc : R , T ) -> R ) : Sequence < R >","body":"{ return sequence { yield ( initial ) var index = var accumulator = initial for ( element in this @ runningFoldIndexed ) { accumulator = operation ( checkIndexOverflow ( index ++ ) , accumulator , element ) yield ( accumulator ) } } }","docstring":"/**\n * Returns a sequence containing successive accumulation values generated by applying [operation] from left to right\n * to each element, its index in the original sequence 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 sequence.\n * The [initial] value should also be immutable (or should not be mutated)\n * as it may be passed to [operation] function later because of sequence's lazy nature.\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 * The operation is _intermediate_ and _stateless_.\n * \n * @sample samples.collections.Collections.Aggregates.runningFold\n */"} {"signature":"@ SinceKotlin ( \"\" ) public fun < S , T : S > Sequence < T > . runningReduce ( operation : ( acc : S , T ) -> S ) : Sequence < S >","body":"{ return sequence { val iterator = iterator ( ) if ( iterator . hasNext ( ) ) { var accumulator : S = iterator . next ( ) yield ( accumulator ) while ( iterator . hasNext ( ) ) { accumulator = operation ( accumulator , iterator . next ( ) ) yield ( accumulator ) } } } }","docstring":"/**\n * Returns a sequence 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 sequence.\n * \n * Note that `acc` value passed to [operation] function should not be mutated;\n * otherwise it would affect the previous value in resulting sequence.\n * \n * @param [operation] function that takes current accumulator value and the element, and calculates the next accumulator value.\n *\n * The operation is _intermediate_ and _stateless_.\n * \n * @sample samples.collections.Collections.Aggregates.runningReduce\n */"} {"signature":"@ SinceKotlin ( \"\" ) public fun < S , T : S > Sequence < T > . runningReduceIndexed ( operation : ( index : Int , acc : S , T ) -> S ) : Sequence < S >","body":"{ return sequence { val iterator = iterator ( ) if ( iterator . hasNext ( ) ) { var accumulator : S = iterator . next ( ) yield ( accumulator ) var index = while ( iterator . hasNext ( ) ) { accumulator = operation ( checkIndexOverflow ( index ++ ) , accumulator , iterator . next ( ) ) yield ( accumulator ) } } } }","docstring":"/**\n * Returns a sequence containing successive accumulation values generated by applying [operation] from left to right\n * to each element, its index in the original sequence and current accumulator value that starts with the first element of this sequence.\n * \n * Note that `acc` value passed to [operation] function should not be mutated;\n * otherwise it would affect the previous value in resulting sequence.\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 * The operation is _intermediate_ and _stateless_.\n * \n * @sample samples.collections.Collections.Aggregates.runningReduce\n */"} {"signature":"@ SinceKotlin ( \"\" ) public fun < T , R > Sequence < T > . scan ( initial : R , operation : ( acc : R , T ) -> R ) : Sequence < R >","body":"{ return runningFold ( initial , operation ) }","docstring":"/**\n * Returns a sequence 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 sequence.\n * The [initial] value should also be immutable (or should not be mutated)\n * as it may be passed to [operation] function later because of sequence's lazy nature.\n * \n * @param [operation] function that takes current accumulator value and an element, and calculates the next accumulator value.\n *\n * The operation is _intermediate_ and _stateless_.\n * \n * @sample samples.collections.Collections.Aggregates.scan\n */"} {"signature":"@ SinceKotlin ( \"\" ) public fun < T , R > Sequence < T > . scanIndexed ( initial : R , operation : ( index : Int , acc : R , T ) -> R ) : Sequence < R >","body":"{ return runningFoldIndexed ( initial , operation ) }","docstring":"/**\n * Returns a sequence containing successive accumulation values generated by applying [operation] from left to right\n * to each element, its index in the original sequence 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 sequence.\n * The [initial] value should also be immutable (or should not be mutated)\n * as it may be passed to [operation] function later because of sequence's lazy nature.\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 * The operation is _intermediate_ and _stateless_.\n * \n * @sample samples.collections.Collections.Aggregates.scan\n */"} {"signature":"@ Deprecated ( \"\" , ReplaceWith ( \"\" ) ) @ DeprecatedSinceKotlin ( warningSince = \"\" ) public inline fun < T > Sequence < 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 sequence.\n *\n * The operation is _terminal_.\n */"} {"signature":"@ Deprecated ( \"\" , ReplaceWith ( \"\" ) ) @ DeprecatedSinceKotlin ( warningSince = \"\" ) public inline fun < T > Sequence < 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 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 ) -> 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 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 ) -> 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 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 ) -> 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 sequence.\n *\n * The operation is _terminal_.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ OptIn ( kotlin . experimental . ExperimentalTypeInference :: class ) @ OverloadResolutionByLambdaReturnType @ kotlin . jvm . JvmName ( \"\" ) @ WasExperimental ( ExperimentalUnsignedTypes :: class ) @ kotlin . internal . InlineOnly public inline fun < T > Sequence < 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 sequence.\n *\n * The operation is _terminal_.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ OptIn ( kotlin . experimental . ExperimentalTypeInference :: class ) @ OverloadResolutionByLambdaReturnType @ kotlin . jvm . JvmName ( \"\" ) @ WasExperimental ( ExperimentalUnsignedTypes :: class ) @ kotlin . internal . InlineOnly public inline fun < T > Sequence < 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 sequence.\n *\n * The operation is _terminal_.\n */"} {"signature":"public fun < T : Any > Sequence < T ? > . requireNoNulls ( ) : Sequence < T >","body":"{ return map { it ? : throw IllegalArgumentException ( \"\" ) } }","docstring":"/**\n * Returns an original collection containing all the non-`null` elements, throwing an [IllegalArgumentException] if there are any `null` elements.\n *\n * The operation is _intermediate_ and _stateless_.\n */"} {"signature":"@ SinceKotlin ( \"\" ) public fun < T > Sequence < T > . chunked ( size : Int ) : Sequence < List < T > >","body":"{ return windowed ( size , size , partialWindows = true ) }","docstring":"/**\n * Splits this sequence into a sequence of lists each not exceeding the given [size].\n * \n * The last list in the resulting sequence 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 sequence.\n *\n * The operation is _intermediate_ and _stateful_.\n * \n * @sample samples.collections.Collections.Transformations.chunked\n */"} {"signature":"@ SinceKotlin ( \"\" ) public fun < T , R > Sequence < T > . chunked ( size : Int , transform : ( List < T > ) -> R ) : Sequence < R >","body":"{ return windowed ( size , size , partialWindows = true , transform = transform ) }","docstring":"/**\n * Splits this sequence into several lists each not exceeding the given [size]\n * and applies the given [transform] function to an each.\n * \n * @return sequence 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 sequence.\n *\n * The operation is _intermediate_ and _stateful_.\n * \n * @sample samples.text.Strings.chunkedTransform\n */"} {"signature":"public operator fun < T > Sequence < T > . minus ( element : T ) : Sequence < T >","body":"{ return object : Sequence < T > { override fun iterator ( ) : Iterator < T > { var removed = false return this@minus . filter { if ( ! removed && it == element ) { removed = true ; false } else true } . iterator ( ) } } }","docstring":"/**\n * Returns a sequence containing all elements of the original sequence without the first occurrence of the given [element].\n *\n * The operation is _intermediate_ and _stateless_.\n */"} {"signature":"public operator fun < T > Sequence < T > . minus ( elements : Array < out T > ) : Sequence < T >","body":"{ if ( elements . isEmpty ( ) ) return this return object : Sequence < T > { override fun iterator ( ) : Iterator < T > { return this@minus . filterNot { it in elements } . iterator ( ) } } }","docstring":"/**\n * Returns a sequence containing all elements of original sequence except the elements contained in the given [elements] array.\n * \n * Note that the source sequence and the array being subtracted are iterated only when an `iterator` is requested from\n * the resulting sequence. Changing any of them between successive calls to `iterator` may affect the result.\n *\n * The operation is _intermediate_ and _stateful_.\n */"} {"signature":"public operator fun < T > Sequence < T > . minus ( elements : Iterable < T > ) : Sequence < T >","body":"{ return object : Sequence < T > { override fun iterator ( ) : Iterator < T > { val other = elements . convertToListIfNotCollection ( ) if ( other . isEmpty ( ) ) return this@minus . iterator ( ) else return this@minus . filterNot { it in other } . iterator ( ) } } }","docstring":"/**\n * Returns a sequence containing all elements of original sequence except the elements contained in the given [elements] collection.\n * \n * Note that the source sequence and the collection being subtracted are iterated only when an `iterator` is requested from\n * the resulting sequence. Changing any of them between successive calls to `iterator` may affect the result.\n *\n * The operation is _intermediate_ and _stateful_.\n */"} {"signature":"public operator fun < T > Sequence < T > . minus ( elements : Sequence < T > ) : Sequence < T >","body":"{ return object : Sequence < T > { override fun iterator ( ) : Iterator < T > { val other = elements . toList ( ) if ( other . isEmpty ( ) ) return this@minus . iterator ( ) else return this@minus . filterNot { it in other } . iterator ( ) } } }","docstring":"/**\n * Returns a sequence containing all elements of original sequence except the elements contained in the given [elements] sequence.\n * \n * Note that the source sequence and the sequence being subtracted are iterated only when an `iterator` is requested from\n * the resulting sequence. Changing any of them between successive calls to `iterator` may affect the result.\n * \n * The operation is _intermediate_ for this sequence and _terminal_ and _stateful_ for the [elements] sequence.\n */"} {"signature":"@ kotlin . internal . InlineOnly public inline fun < T > Sequence < T > . minusElement ( element : T ) : Sequence < T >","body":"{ return minus ( element ) }","docstring":"/**\n * Returns a sequence containing all elements of the original sequence without the first occurrence of the given [element].\n *\n * The operation is _intermediate_ and _stateless_.\n */"} {"signature":"public inline fun < T > Sequence < 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 sequence 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 * The operation is _terminal_.\n * \n * @sample samples.collections.Sequences.Transformations.partition\n */"} {"signature":"public operator fun < T > Sequence < T > . plus ( element : T ) : Sequence < T >","body":"{ return sequenceOf ( this , sequenceOf ( element ) ) . flatten ( ) }","docstring":"/**\n * Returns a sequence containing all elements of the original sequence and then the given [element].\n *\n * The operation is _intermediate_ and _stateless_.\n */"} {"signature":"public operator fun < T > Sequence < T > . plus ( elements : Array < out T > ) : Sequence < T >","body":"{ return this . plus ( elements . asList ( ) ) }","docstring":"/**\n * Returns a sequence containing all elements of original sequence and then all elements of the given [elements] array.\n * \n * Note that the source sequence and the array being added are iterated only when an `iterator` is requested from\n * the resulting sequence. Changing any of them between successive calls to `iterator` may affect the result.\n *\n * The operation is _intermediate_ and _stateless_.\n */"} {"signature":"public operator fun < T > Sequence < T > . plus ( elements : Iterable < T > ) : Sequence < T >","body":"{ return sequenceOf ( this , elements . asSequence ( ) ) . flatten ( ) }","docstring":"/**\n * Returns a sequence containing all elements of original sequence and then all elements of the given [elements] collection.\n * \n * Note that the source sequence and the collection being added are iterated only when an `iterator` is requested from\n * the resulting sequence. Changing any of them between successive calls to `iterator` may affect the result.\n *\n * The operation is _intermediate_ and _stateless_.\n */"} {"signature":"public operator fun < T > Sequence < T > . plus ( elements : Sequence < T > ) : Sequence < T >","body":"{ return sequenceOf ( this , elements ) . flatten ( ) }","docstring":"/**\n * Returns a sequence containing all elements of original sequence and then all elements of the given [elements] sequence.\n * \n * Note that the source sequence and the sequence being added are iterated only when an `iterator` is requested from\n * the resulting sequence. Changing any of them between successive calls to `iterator` may affect the result.\n *\n * The operation is _intermediate_ and _stateless_.\n */"} {"signature":"@ kotlin . internal . InlineOnly public inline fun < T > Sequence < T > . plusElement ( element : T ) : Sequence < T >","body":"{ return plus ( element ) }","docstring":"/**\n * Returns a sequence containing all elements of the original sequence and then the given [element].\n *\n * The operation is _intermediate_ and _stateless_.\n */"} {"signature":"@ SinceKotlin ( \"\" ) public fun < T > Sequence < T > . windowed ( size : Int , step : Int = , partialWindows : Boolean = false ) : Sequence < List < T > >","body":"{ return windowedSequence ( size , step , partialWindows , reuseBuffer = false ) }","docstring":"/**\n * Returns a sequence of snapshots of the window of the given [size]\n * sliding along this sequence 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 sequence.\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 > Sequence < T > . windowed ( size : Int , step : Int = , partialWindows : Boolean = false , transform : ( List < T > ) -> R ) : Sequence < R >","body":"{ return windowedSequence ( size , step , partialWindows , reuseBuffer = true ) . map ( transform ) }","docstring":"/**\n * Returns a sequence 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 sequence 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 sequence.\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 > Sequence < T > . zip ( other : Sequence < R > ) : Sequence < Pair < T , R > >","body":"{ return MergingSequence ( this , other ) { t1 , t2 -> t1 to t2 } }","docstring":"/**\n * Returns a sequence of values built from the elements of `this` sequence and the [other] sequence with the same index.\n * The resulting sequence ends as soon as the shortest input sequence ends.\n *\n * The operation is _intermediate_ and _stateless_.\n * \n * @sample samples.collections.Sequences.Transformations.zip\n */"} {"signature":"public fun < T , R , V > Sequence < T > . zip ( other : Sequence < R > , transform : ( a : T , b : R ) -> V ) : Sequence < V >","body":"{ return MergingSequence ( this , other , transform ) }","docstring":"/**\n * Returns a sequence of values built from the elements of `this` sequence and the [other] sequence with the same index\n * using the provided [transform] function applied to each pair of elements.\n * The resulting sequence ends as soon as the shortest input sequence ends.\n *\n * The operation is _intermediate_ and _stateless_.\n * \n * @sample samples.collections.Sequences.Transformations.zipWithTransform\n */"} {"signature":"@ SinceKotlin ( \"\" ) public fun < T > Sequence < T > . zipWithNext ( ) : Sequence < Pair < T , T > >","body":"{ return zipWithNext { a , b -> a to b } }","docstring":"/**\n * Returns a sequence of pairs of each two adjacent elements in this sequence.\n * \n * The returned sequence is empty if this sequence contains less than two elements.\n *\n * The operation is _intermediate_ and _stateless_.\n * \n * @sample samples.collections.Collections.Transformations.zipWithNext\n */"} {"signature":"@ SinceKotlin ( \"\" ) public fun < T , R > Sequence < T > . zipWithNext ( transform : ( a : T , b : T ) -> R ) : Sequence < R >","body":"{ return sequence result @ { val iterator = iterator ( ) if ( ! iterator . hasNext ( ) ) return@result var current = iterator . next ( ) while ( iterator . hasNext ( ) ) { val next = iterator . next ( ) yield ( transform ( current , next ) ) current = next } } }","docstring":"/**\n * Returns a sequence containing the results of applying the given [transform] function\n * to an each pair of two adjacent elements in this sequence.\n * \n * The returned sequence is empty if this sequence contains less than two elements.\n *\n * The operation is _intermediate_ and _stateless_.\n * \n * @sample samples.collections.Collections.Transformations.zipWithNextToFindDeltas\n */"} {"signature":"public fun < T , A : Appendable > Sequence < 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 * The operation is _terminal_.\n * \n * @sample samples.collections.Collections.Transformations.joinTo\n */"} {"signature":"public fun < T > Sequence < 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 * The operation is _terminal_.\n * \n * @sample samples.collections.Collections.Transformations.joinToString\n */"} {"signature":"public fun < T > Sequence < T > . asIterable ( ) : Iterable < T >","body":"{ return Iterable { this . iterator ( ) } }","docstring":"/**\n * Creates an [Iterable] instance that wraps the original sequence returning its elements when being iterated.\n */"} {"signature":"@ kotlin . internal . InlineOnly public inline fun < T > Sequence < T > . asSequence ( ) : Sequence < T >","body":"{ return this }","docstring":"/**\n * Returns this sequence as a [Sequence].\n */"} {"signature":"@ kotlin . jvm . JvmName ( \"\" ) public fun Sequence < 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 sequence.\n *\n * The operation is _terminal_.\n */"} {"signature":"@ kotlin . jvm . JvmName ( \"\" ) public fun Sequence < 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 sequence.\n *\n * The operation is _terminal_.\n */"} {"signature":"@ kotlin . jvm . JvmName ( \"\" ) public fun Sequence < 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 sequence.\n *\n * The operation is _terminal_.\n */"} {"signature":"@ kotlin . jvm . JvmName ( \"\" ) public fun Sequence < 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 sequence.\n *\n * The operation is _terminal_.\n */"} {"signature":"@ kotlin . jvm . JvmName ( \"\" ) public fun Sequence < 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 sequence.\n *\n * The operation is _terminal_.\n */"} {"signature":"@ kotlin . jvm . JvmName ( \"\" ) public fun Sequence < 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 sequence.\n *\n * The operation is _terminal_.\n */"} {"signature":"@ kotlin . jvm . JvmName ( \"\" ) public fun Sequence < 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 sequence.\n *\n * The operation is _terminal_.\n */"} {"signature":"@ kotlin . jvm . JvmName ( \"\" ) public fun Sequence < 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 sequence.\n *\n * The operation is _terminal_.\n */"} {"signature":"@ kotlin . jvm . JvmName ( \"\" ) public fun Sequence < 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 sequence.\n *\n * The operation is _terminal_.\n */"} {"signature":"@ kotlin . jvm . JvmName ( \"\" ) public fun Sequence < 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 sequence.\n *\n * The operation is _terminal_.\n */"} {"signature":"@ kotlin . jvm . JvmName ( \"\" ) public fun Sequence < 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 sequence.\n *\n * The operation is _terminal_.\n */"} {"signature":"@ kotlin . jvm . JvmName ( \"\" ) public fun Sequence < 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 sequence.\n *\n * The operation is _terminal_.\n */"} {"signature":"override fun toProtobufMessage ( ) : TestData . MessageWithOptionals","body":"= TestData . MessageWithOptionals . newBuilder ( ) . also { builder -> val defaults = MessageWithOptionals ( ) if ( a != defaults . a ) builder . a = a if ( b != defaults . b ) builder . b = b if ( c != defaults . c ) builder . c = c . toProtoBuf ( ) if ( d != defaults . d ) builder . d = d if ( e != defaults . e ) builder . addAllE ( e ) } . build ( )","docstring":"/**\n * Convert this [Serializable] object to its expected [TestData.MessageWithOptionals] ProtoBuf message.\n *\n * For this test we expect that default values are not encoded.\n */"} {"signature":"public expect fun Double . isNaN ( ) : Boolean","body":"public expect fun Double . isNaN ( ) : Boolean","docstring":"/**\n * Returns `true` if the specified number is a\n * Not-a-Number (NaN) value, `false` otherwise.\n */"} {"signature":"public expect fun Float . isNaN ( ) : Boolean","body":"public expect fun Float . isNaN ( ) : Boolean","docstring":"/**\n * Returns `true` if the specified number is a\n * Not-a-Number (NaN) value, `false` otherwise.\n */"} {"signature":"public expect fun Double . isInfinite ( ) : Boolean","body":"public expect fun Double . isInfinite ( ) : Boolean","docstring":"/**\n * Returns `true` if this value is infinitely large in magnitude.\n */"} {"signature":"public expect fun Float . isInfinite ( ) : Boolean","body":"public expect fun Float . isInfinite ( ) : Boolean","docstring":"/**\n * Returns `true` if this value is infinitely large in magnitude.\n */"} {"signature":"public expect fun Double . isFinite ( ) : Boolean","body":"public expect fun Double . isFinite ( ) : Boolean","docstring":"/**\n * Returns `true` if the argument is a finite floating-point value; returns `false` otherwise (for `NaN` and infinity arguments).\n */"} {"signature":"public expect fun Float . isFinite ( ) : Boolean","body":"public expect fun Float . isFinite ( ) : Boolean","docstring":"/**\n * Returns `true` if the argument is a finite floating-point value; returns `false` otherwise (for `NaN` and infinity arguments).\n */"} {"signature":"@ SinceKotlin ( \"\" ) public expect fun Double . toBits ( ) : Long","body":"@ SinceKotlin ( \"\" ) public expect fun Double . toBits ( ) : Long","docstring":"/**\n * Returns a bit representation of the specified floating-point value as [Long]\n * according to the IEEE 754 floating-point \"double format\" bit layout.\n */"} {"signature":"@ SinceKotlin ( \"\" ) public expect fun Double . toRawBits ( ) : Long","body":"@ SinceKotlin ( \"\" ) public expect fun Double . toRawBits ( ) : Long","docstring":"/**\n * Returns a bit representation of the specified floating-point value as [Long]\n * according to the IEEE 754 floating-point \"double format\" bit layout,\n * preserving `NaN` values exact layout.\n */"} {"signature":"@ SinceKotlin ( \"\" ) public expect fun Double . Companion . fromBits ( bits : Long ) : Double","body":"@ SinceKotlin ( \"\" ) public expect fun Double . Companion . fromBits ( bits : Long ) : Double","docstring":"/**\n * Returns the [Double] value corresponding to a given bit representation.\n */"} {"signature":"@ SinceKotlin ( \"\" ) public expect fun Float . toBits ( ) : Int","body":"@ SinceKotlin ( \"\" ) public expect fun Float . toBits ( ) : Int","docstring":"/**\n * Returns a bit representation of the specified floating-point value as [Int]\n * according to the IEEE 754 floating-point \"single format\" bit layout.\n */"} {"signature":"@ SinceKotlin ( \"\" ) public expect fun Float . toRawBits ( ) : Int","body":"@ SinceKotlin ( \"\" ) public expect fun Float . toRawBits ( ) : Int","docstring":"/**\n * Returns a bit representation of the specified floating-point value as [Int]\n * according to the IEEE 754 floating-point \"single format\" bit layout,\n * preserving `NaN` values exact layout.\n */"} {"signature":"@ SinceKotlin ( \"\" ) public expect fun Float . Companion . fromBits ( bits : Int ) : Float","body":"@ SinceKotlin ( \"\" ) public expect fun Float . Companion . fromBits ( bits : Int ) : Float","docstring":"/**\n * Returns the [Float] value corresponding to a given bit representation.\n */"} {"signature":"public expect fun < T > lazy ( mode : LazyThreadSafetyMode , initializer : ( ) -> T ) : Lazy < T >","body":"public expect fun < T > lazy ( mode : LazyThreadSafetyMode , initializer : ( ) -> T ) : Lazy < T >","docstring":"/**\n * Creates a new instance of the [Lazy] that uses the specified initialization function [initializer].\n *\n * The [mode] parameter is ignored. */"} {"signature":"@ Deprecated ( \"\" , ReplaceWith ( \"\" ) ) @ DeprecatedSinceKotlin ( warningSince = \"\" ) public expect fun < T > lazy ( lock : Any ? , initializer : ( ) -> T ) : Lazy < T >","body":"@ Deprecated ( \"\" , ReplaceWith ( \"\" ) ) @ DeprecatedSinceKotlin ( warningSince = \"\" ) public expect fun < T > lazy ( lock : Any ? , initializer : ( ) -> T ) : Lazy < T >","docstring":"/**\n * Creates a new instance of the [Lazy] that uses the specified initialization function [initializer].\n *\n * The [lock] parameter is ignored.\n */"} {"signature":"fun BuildResult . assertOutputContains ( expectedSubString : String , message : String = \"\" , )","body":"{ assert ( output . contains ( expectedSubString ) ) { printBuildOutput ( ) message } }","docstring":"/**\n * Asserts Gradle output contains [expectedSubString] string.\n */"} {"signature":"fun BuildResult . assertOutputContainsAny ( vararg expectedSubStrings : String , )","body":"{ assert ( expectedSubStrings . any { output . contains ( it ) } ) { printBuildOutput ( ) \"\" } }","docstring":"/**\n * Asserts Gradle output contains any of [expectedSubStrings] strings.\n */"} {"signature":"fun BuildResult . assertOutputContainsExactTimes ( expectedSubString : String , expectedRepetitionTimes : Int = , )","body":"{ var currentOffset = var count = var nextIndex = output . indexOf ( expectedSubString , currentOffset ) while ( nextIndex != - && count < expectedRepetitionTimes + ) { count ++ currentOffset = nextIndex + expectedSubString . length nextIndex = output . indexOf ( expectedSubString , currentOffset ) } assert ( count == expectedRepetitionTimes ) { printBuildOutput ( ) \"\" } }","docstring":"/**\n * Asserts Gradle output contains [expectedSubString] string exact times.\n */"} {"signature":"fun BuildResult . assertOutputDoesNotContain ( notExpectedSubString : String , wrappingCharsCount : Int = , )","body":"{ assert ( ! output . contains ( notExpectedSubString ) ) { printBuildOutput ( ) val occurrences = mutableListOf < Pair < Int , Int > > ( ) var startIndex = output . indexOf ( notExpectedSubString ) var endIndex = startIndex + notExpectedSubString . length do { occurrences . add ( startIndex to endIndex ) startIndex = output . indexOf ( notExpectedSubString , endIndex ) endIndex = startIndex + notExpectedSubString . length } while ( startIndex != - ) val linesContainingSubString = occurrences . map { ( startIndex , endIndex ) -> output . subSequence ( ( startIndex - wrappingCharsCount ) . coerceAtLeast ( ) , ( endIndex + wrappingCharsCount ) . coerceAtMost ( output . length ) ) } \"\"\"\"\"\" . trimMargin ( ) } }","docstring":"/**\n * Asserts Gradle output does not contain [notExpectedSubString] string.\n *\n * @param wrappingCharsCount amount of chars to include before and after [notExpectedSubString] occurrence\n */"} {"signature":"fun BuildResult . assertOutputContains ( expected : Regex , message : String = \"\" , )","body":"{ assert ( output . contains ( expected ) ) { printBuildOutput ( ) message } }","docstring":"/**\n * Assert build output contains one or more strings matching [expected] regex.\n */"} {"signature":"fun BuildResult . assertOutputDoesNotContain ( regexToCheck : Regex , )","body":"{ assert ( ! output . contains ( regexToCheck ) ) { printBuildOutput ( ) val matchedStrings = regexToCheck . findAll ( output ) . map { it . value } . joinToString ( prefix = \"\" , separator = \"\" ) \"\" } }","docstring":"/**\n * Asserts build output does not contain any lines matching [regexToCheck] regex.\n */"} {"signature":"fun BuildResult . assertOutputContainsExactlyTimes ( expected : String , expectedCount : Int = , )","body":"{ assertOutputContainsExactlyTimes ( expected . toRegex ( RegexOption . LITERAL ) , expectedCount ) }","docstring":"/**\n * Asserts build output contains exactly [expectedCount] of occurrences of [expected] string.\n */"} {"signature":"fun BuildResult . assertNoBuildWarnings ( additionalExpectedWarnings : Set < String > = emptySet ( ) , )","body":"{ val expectedWarnings = setOf ( \"\" ) val cleanedOutput = ( expectedWarnings + additionalExpectedWarnings ) . fold ( output ) { acc , s -> acc . replace ( s , \"\" ) } val warnings = cleanedOutput . lineSequence ( ) . filter { it . trim ( ) . startsWith ( \"\" ) } . toList ( ) assert ( warnings . isEmpty ( ) ) { printBuildOutput ( ) \"\" } }","docstring":"/**\n * Assert build contains no warnings.\n */"} {"signature":"fun BuildResult . assertKotlinDaemonJvmOptions ( expectedJvmArgs : List < String > , )","body":"{ val jvmArgsCommonMessage = \"\" assertOutputContains ( jvmArgsCommonMessage ) val argsRegex = \"\" . toRegex ( ) val argsStrings = output . lineSequence ( ) . filter { it . contains ( jvmArgsCommonMessage ) } . map { argsRegex . findAll ( it ) . last ( ) . value . removePrefix ( \"\" ) . removeSuffix ( \"\" ) . split ( \"\" ) } val containsArgs = argsStrings . any { it . containsAll ( expectedJvmArgs ) } assert ( containsArgs ) { printBuildOutput ( ) \"\" } }","docstring":"/**\n * Asserts compilation is running via Kotlin daemon with given jvm arguments.\n */"} {"signature":"fun BuildResult . assertDeprecationWarningsArePresent ( warningMode : WarningMode )","body":"{ assertOutputContains ( \"\" , NO_GRADLE_WARNINGS_DETECTOR_PLUGIN_ERROR_MESSAGE ) assertOutputContains ( \"\" , getWarningModeChangeAdvice ( warningMode ) ) }","docstring":"/**\n * Asserts that the build produced some deprecation warnings.\n *\n * Expected to be executed only for the case when [BuildOptions.warningMode] is not set to [WarningMode.Fail]\n */"} {"signature":"fun BuildResult . assertNativeTasksClasspath ( vararg tasksPaths : String , toolName : NativeToolKind = NativeToolKind . KONANC , assertions : ( List < String > ) -> Unit , )","body":"= tasksPaths . forEach { taskPath -> assertions ( extractNativeCompilerClasspath ( getOutputForTask ( taskPath , LogLevel . INFO ) , toolName ) ) }","docstring":"/**\n * Asserts classpath of the given K/N compiler tool for given tasks' paths.\n *\n * Note: Log level of output must be set to [LogLevel.INFO].\n *\n * @param tasksPaths tasks' paths, for which classpath should be checked with give assertions\n * @param toolName name of build tool\n * @param assertions assertions, with will be applied to each classpath of each given task\n */"} {"signature":"fun BuildResult . extractTaskCompilerArguments ( taskPath : String , logLevel : LogLevel = LogLevel . INFO ) : String","body":"{ val taskOutput = getOutputForTask ( taskPath , logLevel ) return taskOutput . lines ( ) . first { it . contains ( \"\" ) } . substringAfter ( \"\" ) }","docstring":"/**\n * Extracts compiler arguments used in compilation for a given Kotlin task under [taskPath] path.\n *\n * @param logLevel [LogLevel] with which build was running, default to [LogLevel.INFO].\n */"} {"signature":"fun BuildResult . assertNativeTasksCustomEnvironment ( vararg tasksPaths : String , toolName : NativeToolKind = NativeToolKind . KONANC , assertions : ( Map < String , String > ) -> Unit , )","body":"= tasksPaths . forEach { taskPath -> assertions ( extractNativeCustomEnvironment ( taskPath , toolName ) ) }","docstring":"/**\n * Asserts environment variables of the given K/N compiler for given tasks' paths\n *\n * Note: Log level of output must be set to [LogLevel.INFO].\n *\n * @param tasksPaths tasks' paths, for which command line arguments should be checked with give assertions.\n * @param toolName name of build tool\n * @param assertions assertions, with will be applied to each command line arguments of each given task\n */"} {"signature":"fun CommandLineArguments . assertCommandLineArgumentsDoNotContain ( vararg expectedArgs : String , )","body":"{ expectedArgs . forEach { assert ( ! args . contains ( it ) ) { this . buildResult . printBuildOutput ( ) \"\" } } }","docstring":"/**\n * Asserts that the given list of command line arguments does not contain any of the expected arguments.\n *\n * @param expectedArgs the list of expected arguments\n * @throws AssertionError if any of the expected arguments are found in the actual arguments list\n */"} {"signature":"fun CommandLineArguments . assertCommandLineArgumentsContain ( vararg expectedArgs : String , )","body":"{ expectedArgs . forEach { assert ( args . contains ( it ) ) { this . buildResult . printBuildOutput ( ) \"\" } } }","docstring":"/**\n * Asserts that the given list of command line arguments contains all the expected arguments.\n *\n * @param expectedArgs the list of expected arguments\n * @throws AssertionError if any of the expected arguments are missing from the actual arguments list\n */"} {"signature":"fun CommandLineArguments . assertCommandLineArgumentsContainSequentially ( vararg expectedArgs : String , )","body":"{ expectedArgs . forEach { assert ( expectedArgs . isNotEmpty ( ) && Collections . indexOfSubList ( args , expectedArgs . toList ( ) ) != - ) { this . buildResult . printBuildOutput ( ) \"\" } } }","docstring":"/**\n * Asserts that the given list of command line arguments contains sequentially all the expected arguments.\n *\n * @param expectedArgs the list of expected arguments\n * @throws AssertionError if any of the expected arguments are missing from the actual arguments list\n */"} {"signature":"fun BuildResult . assertOutputContainsNativeFrameworkVariant ( variantName : String , gradleVersion : GradleVersion )","body":"{ val isAtLeastGradle75 = gradleVersion >= GradleVersion . version ( TestVersions . Gradle . G_7_5 ) try { assertOutputContains ( if ( isAtLeastGradle75 ) \"\" else \"\" ) } catch ( originalError : AssertionError ) { val regexPattern = if ( isAtLeastGradle75 ) { \"\" } else { \"\" } val matchedVariants = Regex ( regexPattern ) . findAll ( output ) . toList ( ) throw AssertionError ( \"\" + if ( matchedVariants . isNotEmpty ( ) ) \"\" + matchedVariants . joinToString { it . groupValues [ ] } else \"\" , originalError ) } }","docstring":"/**\n * Asserts that the output of a Gradle build contains a variant with the given name.\n *\n * @param variantName The name of the variant to look for in the output.\n * @param gradleVersion The version of Gradle used to build the variant.\n * @throws AssertionError if no variant with the given name and Gradle version is found in the output.\n */"} {"signature":"fun CommandLineArguments . assertNoDuplicates ( )","body":"{ val argsWithoutLibraries = args . filter { it != \"\" } assertEquals ( argsWithoutLibraries . joinToString ( \"\" ) , argsWithoutLibraries . toSet ( ) . joinToString ( \"\" ) , \"\" ) }","docstring":"/**\n * Asserts that the command line arguments do not contain any duplicates.\n */"} {"signature":"public fun copy ( copiedModelName : String ? = null , copyOptimizerState : Boolean = false , copyWeights : Boolean = true ) : Sequential","body":"{ val serializedModel = serializeModel ( true ) return deserializeSequentialModel ( serializedModel ) . also { modelCopy -> if ( copiedModelName != null ) modelCopy . name = copiedModelName if ( copyWeights ) copyWeightsTo ( modelCopy , copyOptimizerState ) } }","docstring":"/**\n * Creates a copy of this model.\n *\n * @param [copiedModelName] a name for the copy\n * @param [copyOptimizerState] whether optimizer state needs to be copied\n * @param [copyWeights] whether model weights need to be copied\n * @return A copied inference model.\n */"} {"signature":"@ JvmStatic public fun of ( vararg layers : Layer , noInput : Boolean = false , gpuConfiguration : GpuConfiguration ? = null ) : Sequential","body":"{ if ( ! noInput ) { layerValidation ( layers . toList ( ) ) } preProcessLayerNames ( layers ) return Sequential ( * layers , gpuConfiguration = gpuConfiguration ) }","docstring":"/**\n * Creates the [Sequential] model.\n *\n * @param [noInput] If true it disables input layer check.\n * @param [layers] The layers to describe the model design.\n * @param [gpuConfiguration] The configuration of a model passed to the Tensorflow Runtime.\n *\n * NOTE: The first layer should be an input layer if you want to compile a model.\n *\n * @return the [Sequential] model.\n */"} {"signature":"@ JvmStatic public fun of ( vararg layers : Layer , noInput : Boolean = false ) : Sequential","body":"{ return of ( layers = layers , noInput = noInput , gpuConfiguration = null ) }","docstring":"/**\n * Creates the [Sequential] model.\n *\n * @param [noInput] If true it disables input layer check.\n * @param [layers] The layers to describe the model design.\n *\n * NOTE: The first layer should be an input layer if you want to compile a model.\n *\n * @return the [Sequential] model.\n */"} {"signature":"@ JvmStatic public fun of ( layers : List < Layer > , noInput : Boolean = false , gpuConfiguration : GpuConfiguration ? = null ) : Sequential","body":"{ if ( ! noInput ) { layerValidation ( layers . toList ( ) ) } preProcessLayerNames ( layers . toTypedArray ( ) ) return Sequential ( * layers . toTypedArray ( ) , gpuConfiguration = gpuConfiguration ) }","docstring":"/**\n * Creates the [Functional] model.\n *\n * @param [noInput] If true it disables input layer check.\n * @param [layers] The layers to describe the model design.\n * @param [gpuConfiguration] The configuration of a model passed to the Tensorflow Runtime.\n *\n * NOTE: The first layer should be an input layer if you want to compile a model.\n *\n * @return the [Sequential] model.\n */"} {"signature":"@ JvmStatic public fun of ( layers : List < Layer > , noInput : Boolean = false ) : Sequential","body":"{ return of ( layers = layers , noInput = noInput , gpuConfiguration = null ) }","docstring":"/**\n * Creates the [Sequential] model.\n *\n * @param [noInput] If true it disables input layer check.\n * @param [layers] The layers to describe the model design.\n *\n * NOTE: The first layer should be an input layer if you want to compile a model.\n *\n * @return the [Sequential] model.\n */"} {"signature":"@ JvmStatic public fun loadModelConfiguration ( configuration : File , inputShape : IntArray ? = null ) : Sequential","body":"{ require ( configuration . isFile ) { \"\" } return loadSequentialModelConfiguration ( configuration , inputShape ) }","docstring":"/**\n * Loads a [Sequential] model from json file with model configuration.\n *\n * @param [configuration] File in .json format, containing the [Sequential] model.\n * @return Non-compiled and non-trained Sequential model.\n */"} {"signature":"@ JvmStatic public fun loadModelLayersFromConfiguration ( configuration : File , inputShape : IntArray ? = null ) : Pair < Input , List < Layer > >","body":"{ require ( configuration . isFile ) { \"\" } val config = loadSerializedModel ( configuration ) return loadSequentialModelLayers ( config , inputShape ) }","docstring":"/**\n * Loads a [Sequential] model layers from json file with model configuration.\n *\n * @param [configuration] File in .json format, containing the [Sequential] model.\n * @return Pair of .\n */"} {"signature":"@ JvmStatic public fun loadDefaultModelConfiguration ( modelDirectory : File , inputShape : IntArray ? = null ) : Sequential","body":"{ require ( modelDirectory . isDirectory ) { \"\" } val configuration = File ( \"\" ) if ( ! configuration . exists ( ) ) throw FileNotFoundException ( \"\" + \"\" ) return loadSequentialModelConfiguration ( configuration , inputShape ) }","docstring":"/**\n * Loads a [Sequential] model from json file with name 'modelConfig.json' with model configuration located in [modelDirectory].\n *\n * @param [modelDirectory] Directory, containing file 'modelConfig.json'.\n * @throws [FileNotFoundException] If 'modelConfig.json' file is not found.\n * @return Non-compiled and non-trained Sequential model.\n */"} {"signature":"@ JvmStatic public fun loadModelLayersFromDefaultConfiguration ( modelDirectory : File , inputShape : IntArray ? = null ) : Pair < Input , List < Layer > >","body":"{ require ( modelDirectory . isDirectory ) { \"\" } val configuration = File ( \"\" ) if ( ! configuration . exists ( ) ) throw FileNotFoundException ( \"\" + \"\" ) val config = loadSerializedModel ( configuration ) return loadSequentialModelLayers ( config , inputShape ) }","docstring":"/**\n * Loads a [Sequential] model layers from json file with name 'modelConfig.json' with model configuration located in [modelDirectory].\n *\n * @param [modelDirectory] Directory, containing file 'modelConfig.json'.\n * @throws [FileNotFoundException] If 'modelConfig.json' file is not found.\n * @return Pair of .\n */"} {"signature":"override fun toString ( ) : String","body":"= buildString { val sign = if ( allNonpositive ( ) ) { append ( '' ) ; - } else append ( '' ) if ( years != ) append ( years * sign ) . append ( '' ) if ( months != ) append ( months * sign ) . append ( '' ) if ( days != ) append ( days * sign ) . append ( '' ) var t = \"\" if ( hours != ) append ( t ) . append ( hours * sign ) . append ( '' ) . also { t = \"\" } if ( minutes != ) append ( t ) . append ( minutes * sign ) . append ( '' ) . also { t = \"\" } if ( seconds or nanoseconds != ) { append ( t ) append ( when { seconds != -> seconds * sign nanoseconds * sign < -> \"\" else -> \"\" } ) if ( nanoseconds != ) append ( '' ) . append ( ( nanoseconds . absoluteValue ) . toString ( ) . padStart ( , '' ) ) append ( '' ) } if ( length == ) append ( \"\" ) }","docstring":"/**\n * Converts this period to the ISO-8601 string representation for durations.\n *\n * @see DateTimePeriod.parse\n */"} {"signature":"public fun parse ( text : String ) : DateTimePeriod","body":"{ fun parseException ( message : String , position : Int ) : Nothing = throw DateTimeFormatException ( \"\" ) val START = val AFTER_P = val AFTER_YEAR = val AFTER_MONTH = val AFTER_WEEK = val AFTER_DAY = val AFTER_T = val AFTER_HOUR = val AFTER_MINUTE = val AFTER_SECOND_AND_NANO = var state = START var i = var sign = var years = var months = var weeks = var days = var hours = var minutes = var seconds = var nanoseconds = while ( true ) { if ( i >= text . length ) { if ( state == START ) parseException ( \"\" , i ) if ( state == AFTER_T ) parseException ( \"\" , i ) val daysTotal = when ( val n = days . toLong ( ) + weeks * ) { in Int . MIN_VALUE .. Int . MAX_VALUE -> n . toInt ( ) else -> parseException ( \"\" , ) } return DateTimePeriod ( years , months , daysTotal , hours , minutes , seconds , nanoseconds . toLong ( ) ) } if ( state == START ) { if ( i + >= text . length && ( text [ i ] == '' || text [ i ] == '' ) ) parseException ( \"\" , i ) when ( text [ i ] ) { '' , '' -> { if ( text [ i ] == '' ) sign = - if ( text [ i + ] != '' ) parseException ( \"\" , i + ) i += } '' -> { i += } else -> parseException ( \"\" , i ) } state = AFTER_P continue } var localSign = sign val iStart = i when ( text [ i ] ) { '' , '' -> { if ( text [ i ] == '' ) localSign *= - i += if ( i >= text . length || text [ i ] !in '' .. '' ) parseException ( \"\" , i ) } in '' .. '' -> { } '' -> { if ( state >= AFTER_T ) parseException ( \"\" , i ) state = AFTER_T i += continue } } var number = while ( i < text . length && text [ i ] in '' .. '' ) { try { number = safeAdd ( safeMultiply ( number , ) , ( text [ i ] - '' ) . toLong ( ) ) } catch ( e : ArithmeticException ) { parseException ( \"\" , iStart ) } i += } number *= localSign if ( i == text . length ) parseException ( \"\" , i ) val wrongOrder = \"\" fun Long . toIntThrowing ( component : Char ) : Int { if ( this < Int . MIN_VALUE || this > Int . MAX_VALUE ) parseException ( \"\" , iStart ) return toInt ( ) } when ( text [ i ] . uppercaseChar ( ) ) { '' -> { if ( state >= AFTER_YEAR ) parseException ( wrongOrder , i ) state = AFTER_YEAR years = number . toIntThrowing ( '' ) } '' -> { if ( state >= AFTER_T ) { if ( state >= AFTER_MINUTE ) parseException ( wrongOrder , i ) state = AFTER_MINUTE minutes = number . toIntThrowing ( '' ) } else { if ( state >= AFTER_MONTH ) parseException ( wrongOrder , i ) state = AFTER_MONTH months = number . toIntThrowing ( '' ) } } '' -> { if ( state >= AFTER_WEEK ) parseException ( wrongOrder , i ) state = AFTER_WEEK weeks = number . toIntThrowing ( '' ) } '' -> { if ( state >= AFTER_DAY ) parseException ( wrongOrder , i ) state = AFTER_DAY days = number . toIntThrowing ( '' ) } '' -> { if ( state >= AFTER_HOUR || state < AFTER_T ) parseException ( wrongOrder , i ) state = AFTER_HOUR hours = number . toIntThrowing ( '' ) } '' -> { if ( state >= AFTER_SECOND_AND_NANO || state < AFTER_T ) parseException ( wrongOrder , i ) state = AFTER_SECOND_AND_NANO seconds = number . toIntThrowing ( '' ) } '' , '' -> { i += if ( i >= text . length ) parseException ( \"\" , i ) val iStartFraction = i while ( i < text . length && text [ i ] in '' .. '' ) i += val fractionLength = i - iStartFraction if ( fractionLength > ) parseException ( \"\" , iStartFraction ) val fractionalPart = text . substring ( iStartFraction , i ) + \"\" . repeat ( - fractionLength ) nanoseconds = fractionalPart . toInt ( ) * localSign if ( text [ i ] != '' ) parseException ( \"\" , i ) if ( state >= AFTER_SECOND_AND_NANO || state < AFTER_T ) parseException ( wrongOrder , i ) state = AFTER_SECOND_AND_NANO seconds = number . toIntThrowing ( '' ) } else -> parseException ( \"\" , i ) } i += } }","docstring":"/**\n * Parses a ISO-8601 duration string as a [DateTimePeriod].\n * If the time components are absent or equal to zero, returns a [DatePeriod].\n *\n * Additionally, we support the `W` signifier to represent weeks.\n *\n * Examples of durations in the ISO-8601 format:\n * - `P1Y40D` is one year and 40 days\n * - `-P1DT1H` is minus (one day and one hour)\n * - `P1DT-1H` is one day minus one hour\n * - `-PT0.000000001S` is minus one nanosecond\n *\n * @throws IllegalArgumentException if the text cannot be parsed or the boundaries of [DateTimePeriod] are\n * exceeded.\n */"} {"signature":"@ Deprecated ( \"\" , ReplaceWith ( \"\" ) , DeprecationLevel . WARNING ) public fun String . toDateTimePeriod ( ) : DateTimePeriod","body":"= DateTimePeriod . parse ( this )","docstring":"/**\n * @suppress\n */"} {"signature":"public fun parse ( text : String ) : DatePeriod","body":"= when ( val period = DateTimePeriod . parse ( text ) ) { is DatePeriod -> period else -> throw DateTimeFormatException ( \"\" ) }","docstring":"/**\n * Parses the ISO-8601 duration representation as a [DatePeriod].\n *\n * This function is equivalent to [DateTimePeriod.parse], but will fail if any of the time components are not\n * zero.\n *\n * @throws IllegalArgumentException if the text cannot be parsed, the boundaries of [DatePeriod] are exceeded,\n * or any time components are not zero.\n *\n * @see DateTimePeriod.parse\n */"} {"signature":"@ Deprecated ( \"\" , ReplaceWith ( \"\" ) , DeprecationLevel . WARNING ) public fun String . toDatePeriod ( ) : DatePeriod","body":"= DatePeriod . parse ( this )","docstring":"/**\n * @suppress\n */"} {"signature":"public fun DateTimePeriod ( years : Int = , months : Int = , days : Int = , hours : Int = , minutes : Int = , seconds : Int = , nanoseconds : Long = ) : DateTimePeriod","body":"= buildDateTimePeriod ( totalMonths ( years , months ) , days , totalNanoseconds ( hours , minutes , seconds , nanoseconds ) )","docstring":"/**\n * Constructs a new [DateTimePeriod]. If all the time components are zero, returns a [DatePeriod].\n *\n * It is recommended to always explicitly name the arguments when constructing this manually,\n * like `DateTimePeriod(years = 1, months = 12)`.\n *\n * The passed numbers are not stored as is but are normalized instead for human readability, so, for example,\n * `DateTimePeriod(months = 24)` becomes `DateTimePeriod(years = 2)`.\n *\n * @throws IllegalArgumentException if the total number of months in [years] and [months] overflows an [Int].\n * @throws IllegalArgumentException if the total number of months in [hours], [minutes], [seconds] and [nanoseconds]\n * overflows a [Long].\n */"} {"signature":"public fun Duration . toDateTimePeriod ( ) : DateTimePeriod","body":"= buildDateTimePeriod ( totalNanoseconds = inWholeNanoseconds )","docstring":"/**\n * Constructs a [DateTimePeriod] from a [Duration].\n *\n * If the duration value is too big to be represented as a [Long] number of nanoseconds,\n * the result will be [Long.MAX_VALUE] nanoseconds.\n */"} {"signature":"public operator fun DateTimePeriod . plus ( other : DateTimePeriod ) : DateTimePeriod","body":"= buildDateTimePeriod ( safeAdd ( totalMonths , other . totalMonths ) , safeAdd ( days , other . days ) , safeAdd ( totalNanoseconds , other . totalNanoseconds ) , )","docstring":"/**\n * Adds two [DateTimePeriod] instances.\n *\n * @throws DateTimeArithmeticException if arithmetic overflow happens.\n */"} {"signature":"public operator fun DatePeriod . plus ( other : DatePeriod ) : DatePeriod","body":"= DatePeriod ( safeAdd ( totalMonths , other . totalMonths ) , safeAdd ( days , other . days ) , )","docstring":"/**\n * Adds two [DatePeriod] instances.\n *\n * @throws DateTimeArithmeticException if arithmetic overflow happens.\n */"} {"signature":"private fun computeNonTrivialTypeArgumentForScopeSubstitutor ( typeParameterSymbol : FirTypeParameterSymbol , originalTypeArgument : ConeTypeProjection , session : FirSession , capturedTypeArgument : ConeKotlinType ) : ConeKotlinType ?","body":"{ if ( typeParameterSymbol . variance != Variance . OUT_VARIANCE ) return null return when ( originalTypeArgument . kind ) { ProjectionKind . OUT -> originalTypeArgument . type ! ! ProjectionKind . STAR -> session . typeApproximator . approximateToSuperType ( capturedTypeArgument , TypeApproximatorConfiguration . FinalApproximationAfterResolutionAndInference ) else -> null } }","docstring":"/**\n * Returns null if `capturedTypeArgument` should be used\n */"} {"signature":"private fun KotlinPackageEntry . matchesImportPath ( importPath : ImportPath , ignoreAlias : Boolean ) : Boolean","body":"{ if ( ! ignoreAlias && importPath . hasAlias ( ) ) { return this == ALL_OTHER_ALIAS_IMPORTS_ENTRY } if ( this == KotlinPackageEntry . ALL_OTHER_IMPORTS_ENTRY ) return true return matchesPackageName ( importPath . pathStr ) }","docstring":"/**\n * In current implementation we assume that aliased import can be matched only by\n * [ALL_OTHER_ALIAS_IMPORTS_ENTRY] which is always present.\n */"} {"signature":"inline fun < T : Flow < Int > > CoroutineScope . testSubscriptionByFirstSuspensionInCollect ( flow : T , emit : T . ( Int ) -> Unit )","body":"{ var received = val job = launch ( start = CoroutineStart . UNDISPATCHED ) { flow . collect { received = it } } flow . emit ( ) assertEquals ( , received ) job . cancel ( ) }","docstring":"/**\n * Check that, by the time [SharedFlow.collect] suspends for the first time, its subscription is already active.\n */"} {"signature":"public fun detectObjects ( image : I , topK : Int = ) : List < DetectedObject >","body":"{ val objects = predict ( image ) . sortedByDescending { it . probability } if ( topK > ) { return objects . take ( topK ) } return objects }","docstring":"/**\n * Returns the detected object for the given image sorted by the score.\n *\n * @param [image] Input 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":"public fun reshape ( vararg dims : Long )","body":"{ inputShape = longArrayOf ( * dims ) }","docstring":"/**\n * Setter for input shape of the internal model. Images are going to be resized to this shape.\n *\n * @param dims The input shape.\n */"} {"signature":"fun findImplementationFromInterface ( descriptor : CallableMemberDescriptor ) : CallableMemberDescriptor ?","body":"{ val overridden = OverridingUtil . getOverriddenDeclarations ( descriptor ) val filtered = OverridingUtil . filterOutOverridden ( overridden ) val result = filtered . firstOrNull { it . modality != Modality . ABSTRACT } ? : return null if ( DescriptorUtils . isClassOrEnumClass ( result . containingDeclaration ) ) return null return result }","docstring":"/**\n * Given a fake override, returns an overridden non-abstract function from an interface which is the actual implementation of this function\n * that should be called when the given fake override is called.\n */"} {"signature":"@ JvmOverloads fun findInterfaceImplementation ( descriptor : CallableMemberDescriptor , returnImplNotDelegate : Boolean = false ) : CallableMemberDescriptor ?","body":"{ if ( descriptor . kind . isReal ) return null if ( isOrOverridesSynthesized ( descriptor ) ) return null val implementation = findImplementationFromInterface ( descriptor ) ? : return null val immediateConcreteSuper = firstSuperMethodFromKotlin ( descriptor , implementation ) ? : return null if ( ! DescriptorUtils . isInterface ( immediateConcreteSuper . containingDeclaration ) ) { return null } return if ( returnImplNotDelegate ) implementation else immediateConcreteSuper }","docstring":"/**\n * Given a fake override in a class, returns an overridden declaration with implementation in trait, such that a method delegating to that\n * trait implementation should be generated into the class containing the fake override; or null if the given function is not a fake\n * override of any trait implementation or such method was already generated into the superclass or is a method from Any.\n */"} {"signature":"fun firstSuperMethodFromKotlin ( descriptor : CallableMemberDescriptor , implementation : CallableMemberDescriptor ) : CallableMemberDescriptor ?","body":"{ return descriptor . overriddenDescriptors . firstOrNull { overridden -> overridden . modality != Modality . ABSTRACT && ( overridden == implementation || OverridingUtil . overrides ( overridden , implementation , overridden . module . isTypeRefinementEnabled ( ) , true ) ) } }","docstring":"/**\n * Given a fake override and its implementation (non-abstract declaration) somewhere in supertypes,\n * returns the first immediate super function of the given fake override which overrides that implementation.\n * The returned function should be called from TImpl-bridges generated for the given fake override.\n */"} {"signature":"fun IrFunction . varargParameterIndex ( )","body":"= valueParameters . indexOfFirst { it . varargElementType != null }","docstring":"/**\n * Returns the index of the vararg parameter of the function if there is one, otherwise returns -1.\n */"} {"signature":"private fun IrDeclarationWithName . originalNameForUseInSourceMap ( policy : SourceMapNamesPolicy ) : String ?","body":"{ if ( policy == SourceMapNamesPolicy . NO ) return null when ( this ) { is IrField -> correspondingPropertySymbol ? . let { return it . owner . originalNameForUseInSourceMap ( policy ) } is IrFunction -> if ( policy == SourceMapNamesPolicy . FULLY_QUALIFIED_NAMES ) { fqNameWhenAvailable ? . let { return it . asString ( ) } } is IrValueDeclaration -> if ( origin !in nameMappingOriginAllowList ) { return null } } return name . asString ( ) }","docstring":"/**\n * Returns a name of the original Kotlin declaration, or null, if it is a compiler generated declaration.\n */"} {"signature":"public infix fun < C > ColumnSet < C > . except ( selector : ( ) -> ColumnsResolver < * > ) : ColumnSet < C >","body":"= except ( selector ( ) )","docstring":"/**\n * @include [ColumnSetInfixDocs]\n * @set [CommonExceptDocs.ParamArg] @param [selector\\] A lambda in which you specify the columns that need to be\n * excluded from the [ColumnSet]. The scope of the selector is the same as the outer scope.\n * @set [ColumnSetInfixDocs.ArgumentArg1] `{ \"age\" `[and][ColumnsSelectionDsl.and]` height }`\n * @set [ColumnSetInfixDocs.ArgumentArg2] `{ name.firstName }`\n */"} {"signature":"public infix fun < C > ColumnSet < C > . except ( other : ColumnsResolver < * > ) : ColumnSet < C >","body":"= exceptInternal ( other )","docstring":"/**\n * @include [ColumnSetInfixDocs]\n * @set [CommonExceptDocs.ParamArg] @param [other\\] A [ColumnsResolver] containing the columns that need to be\n * excluded from the [ColumnSet].\n * @set [ColumnSetInfixDocs.ArgumentArg1] `\"age\" `[and][ColumnsSelectionDsl.and]` height`\n * @set [ColumnSetInfixDocs.ArgumentArg2] `name.firstName`\n */"} {"signature":"public fun < C > ColumnSet < C > . except ( vararg others : ColumnsResolver < * > ) : ColumnSet < C >","body":"= except ( others . toColumnSet ( ) )","docstring":"/**\n * @include [ColumnSetVarargDocs]\n * @set [CommonExceptDocs.ParamArg] @param [others\\] Any number of [ColumnsResolvers][ColumnsResolver] containing\n * the columns that need to be excluded from the [ColumnSet].\n * @set [ColumnSetVarargDocs.ArgumentArg1] `(age, userData.height)`\n * @set [ColumnSetVarargDocs.ArgumentArg2] `(name.firstName, name.middleName)`\n */"} {"signature":"public infix fun < C > ColumnSet < C > . except ( other : String ) : ColumnSet < C >","body":"= except ( column < Any ? > ( other ) )","docstring":"/**\n * @include [ColumnSetInfixDocs]\n * @set [CommonExceptDocs.ParamArg] @param [other\\] A [String] referring to\n * the column (relative to the current scope) that needs to be excluded from the [ColumnSet].\n * @set [ColumnSetInfixDocs.ArgumentArg1] `\"age\"`\n * @set [ColumnSetInfixDocs.ArgumentArg2] `\"name\"`\n */"} {"signature":"public fun < C > ColumnSet < C > . except ( vararg others : String ) : ColumnSet < C >","body":"= except ( others . toColumnSet ( ) )","docstring":"/**\n * @include [ColumnSetVarargDocs]\n * @set [CommonExceptDocs.ParamArg] @param [others\\] Any number of [Strings][String] referring to\n * the columns (relative to the current scope) that need to be excluded from the [ColumnSet].\n * @set [ColumnSetVarargDocs.ArgumentArg1] `(\"age\", \"height\")`\n * @set [ColumnSetVarargDocs.ArgumentArg2] `(\"name\")`\n */"} {"signature":"public infix fun < C > ColumnSet < C > . except ( other : KProperty < C > ) : ColumnSet < C >","body":"= except ( column ( other ) )","docstring":"/**\n * @include [ColumnSetInfixDocs]\n * @set [CommonExceptDocs.ParamArg] @param [other\\] A [KProperty] referring to\n * the column (relative to the current scope) that needs to be excluded from the [ColumnSet].\n * @set [ColumnSetInfixDocs.ArgumentArg1] `Person::age`\n * @set [ColumnSetInfixDocs.ArgumentArg2] `Person::name`\n */"} {"signature":"public fun < C > ColumnSet < C > . except ( vararg others : KProperty < C > ) : ColumnSet < C >","body":"= except ( others . toColumnSet ( ) )","docstring":"/**\n * @include [ColumnSetVarargDocs]\n * @set [CommonExceptDocs.ParamArg] @param [others\\] Any number of [KProperties][KProperty] referring to\n * the columns (relative to the current scope) that need to be excluded from the [ColumnSet].\n * @set [ColumnSetVarargDocs.ArgumentArg1] `(Person::age, Person::height)`\n * @set [ColumnSetVarargDocs.ArgumentArg2] `(Person::name)`\n */"} {"signature":"public infix fun < C > ColumnSet < C > . except ( other : ColumnPath ) : ColumnSet < C >","body":"= except ( column < Any ? > ( other ) )","docstring":"/**\n * @include [ColumnSetInfixDocs]\n * @set [CommonExceptDocs.ParamArg] @param [other\\] A [ColumnPath] referring to\n * the column (relative to the current scope) that needs to be excluded from the [ColumnSet].\n * @set [ColumnSetInfixDocs.ArgumentArg1] `\"userdata\"[\"age\"]`\n * @set [ColumnSetInfixDocs.ArgumentArg2] `pathOf(\"name\", \"firstName\")`\n */"} {"signature":"public fun < C > ColumnSet < C > . except ( vararg others : ColumnPath ) : ColumnSet < C >","body":"= except ( others . toColumnSet ( ) )","docstring":"/**\n * @include [ColumnSetVarargDocs]\n * @set [CommonExceptDocs.ParamArg] @param [others\\] Any number of [ColumnPaths][ColumnPath] referring to\n * the columns (relative to the current scope) that need to be excluded from the [ColumnSet].\n * @set [ColumnSetVarargDocs.ArgumentArg1] `(pathOf(\"age\"), \"userdata\"[\"height\"])`\n * @set [ColumnSetVarargDocs.ArgumentArg2] `(\"name\"[\"firstName\"], \"name\"[\"middleName\"])`\n */"} {"signature":"public fun < C > ColumnsSelectionDsl < C > . allExcept ( selector : ColumnsSelector < C , * > ) : ColumnSet < * >","body":"= this . asSingleColumn ( ) . allColsExcept ( selector )","docstring":"/**\n * @include [ColumnsSelectionDslDocs]\n * @set [CommonExceptDocs.ParamArg] @param [selector\\] A lambda in which you specify the columns that need to be\n * excluded from the current selection. The scope of the selector is the same as the outer scope.\n * @set [ColumnsSelectionDslDocs.ArgumentArg1] ` { \"age\" `[and][ColumnsSelectionDsl.and]` height }`\n * @set [ColumnsSelectionDslDocs.ArgumentArg2] ` { name.firstName }`\n */"} {"signature":"public fun ColumnsSelectionDsl < * > . allExcept ( vararg others : ColumnsResolver < * > ) : ColumnSet < * >","body":"= asSingleColumn ( ) . allColsExceptInternal ( others . toColumnSet ( ) )","docstring":"/**\n * {@comment No scoping issues, this function can exist for legacy purposes}\n * @include [ColumnsSelectionDslDocs]\n * @set [CommonExceptDocs.ParamArg] @param [others\\] A [ColumnsResolver] containing the columns that need to be\n * excluded from the current selection.\n * @set [ColumnsSelectionDslDocs.ArgumentArg1] `(age, height)`\n * @set [ColumnsSelectionDslDocs.ArgumentArg2] `(name.firstName, name.middleName)`\n */"} {"signature":"public fun ColumnsSelectionDsl < * > . allExcept ( vararg others : String ) : ColumnSet < * >","body":"= asSingleColumn ( ) . allColsExceptInternal ( others . toColumnSet ( ) )","docstring":"/**\n * @include [ColumnsSelectionDslDocs]\n * @set [CommonExceptDocs.ParamArg] @param [others\\] Any number of [Strings][String] referring to\n * the columns (relative to the current scope) that need to be excluded from the current selection.\n * @set [ColumnsSelectionDslDocs.ArgumentArg1] `(\"age\", \"height\")`\n * @set [ColumnsSelectionDslDocs.ArgumentArg2] `(\"name\")`\n */"} {"signature":"public fun ColumnsSelectionDsl < * > . allExcept ( vararg others : KProperty < * > ) : ColumnSet < * >","body":"= asSingleColumn ( ) . allColsExceptInternal ( others . toColumnSet ( ) )","docstring":"/**\n * @include [ColumnsSelectionDslDocs]\n * @set [CommonExceptDocs.ParamArg] @param [others\\] Any number of [KProperties][KProperty] referring to\n * the columns (relative to the current scope) that need to be excluded from the current selection.\n * @set [ColumnsSelectionDslDocs.ArgumentArg1] `(Person::age, Person::height)`\n * @set [ColumnsSelectionDslDocs.ArgumentArg2] `(Person::name)`\n */"} {"signature":"public fun ColumnsSelectionDsl < * > . allExcept ( vararg others : ColumnPath ) : ColumnSet < * >","body":"= asSingleColumn ( ) . allColsExceptInternal ( others . toColumnSet ( ) )","docstring":"/**\n * @include [ColumnsSelectionDslDocs]\n * @set [CommonExceptDocs.ParamArg] @param [others\\] Any number of [ColumnPaths][ColumnPath] referring to\n * the columns (relative to the current scope) that need to be excluded from the current selection.\n * @set [ColumnsSelectionDslDocs.ArgumentArg1] `(pathOf(\"age\"), \"userdata\"[\"height\"])`\n * @set [ColumnsSelectionDslDocs.ArgumentArg2] `(\"name\"[\"firstName\"], \"name\"[\"middleName\"])`\n */"} {"signature":"public fun < C > SingleColumn < DataRow < C > > . allColsExcept ( selector : ColumnsSelector < C , * > ) : ColumnSet < * >","body":"= allColsExceptInternal ( selector . toColumns ( ) )","docstring":"/**\n * @include [ColumnGroupDocs]\n * @include [ColumnGroupDocs.SingleColumnReceiverArgs]\n * @include [ColumnGroupDocs.SelectorArgs]\n */"} {"signature":"public fun SingleColumn < DataRow < * > > . allColsExcept ( vararg others : String ) : ColumnSet < * >","body":"= allColsExceptInternal ( others . toColumnSet ( ) )","docstring":"/**\n * @include [ColumnGroupDocs]\n * @include [ColumnGroupDocs.SingleColumnReceiverArgs]\n * @include [ColumnGroupDocs.StringArgs]\n */"} {"signature":"public fun SingleColumn < DataRow < * > > . allColsExcept ( vararg others : KProperty < * > ) : ColumnSet < * >","body":"= allColsExceptInternal ( others . toColumnSet ( ) )","docstring":"/**\n * @include [ColumnGroupDocs]\n * @include [ColumnGroupDocs.SingleColumnReceiverArgs]\n * @include [ColumnGroupDocs.KPropertyArgs]\n */"} {"signature":"public fun SingleColumn < DataRow < * > > . allColsExcept ( vararg other : ColumnPath ) : ColumnSet < * >","body":"= allColsExceptInternal ( other . toColumnSet ( ) )","docstring":"/**\n * @include [ColumnGroupDocs]\n * @include [ColumnGroupDocs.SingleColumnReceiverArgs]\n * @include [ColumnGroupDocs.ColumnPathArgs]\n */"} {"signature":"public fun String . allColsExcept ( selector : ColumnsSelector < * , * > ) : ColumnSet < * >","body":"= columnGroup ( this ) . allColsExcept ( selector )","docstring":"/**\n * @include [ColumnGroupDocs]\n * @include [ColumnGroupDocs.StringReceiverArgs]\n * @include [ColumnGroupDocs.SelectorArgs]\n */"} {"signature":"public fun String . allColsExcept ( vararg others : String ) : ColumnSet < * >","body":"= columnGroup ( this ) . allColsExceptInternal ( others . toColumnSet ( ) )","docstring":"/**\n * @include [ColumnGroupDocs]\n * @include [ColumnGroupDocs.StringReceiverArgs]\n * @include [ColumnGroupDocs.StringArgs]\n */"} {"signature":"public fun String . allColsExcept ( vararg others : KProperty < * > ) : ColumnSet < * >","body":"= columnGroup ( this ) . allColsExceptInternal ( others . toColumnSet ( ) )","docstring":"/**\n * @include [ColumnGroupDocs]\n * @include [ColumnGroupDocs.StringReceiverArgs]\n * @include [ColumnGroupDocs.KPropertyArgs]\n */"} {"signature":"public fun String . allColsExcept ( vararg others : ColumnPath ) : ColumnSet < * >","body":"= columnGroup ( this ) . allColsExceptInternal ( others . toColumnSet ( ) )","docstring":"/**\n * @include [ColumnGroupDocs]\n * @include [ColumnGroupDocs.StringReceiverArgs]\n * @include [ColumnGroupDocs.ColumnPathArgs]\n */"} {"signature":"@ OptIn ( ExperimentalTypeInference :: class ) @ OverloadResolutionByLambdaReturnType public fun < C > KProperty < C > . allColsExcept ( selector : ColumnsSelector < C , * > ) : ColumnSet < * >","body":"= columnGroup ( this ) . allColsExcept ( selector )","docstring":"/**\n * @include [ColumnGroupDocs]\n * ## NOTE: {@comment TODO fix warning}\n * If you get a warning `CANDIDATE_CHOSEN_USING_OVERLOAD_RESOLUTION_BY_LAMBDA_ANNOTATION`, you\n * can safely ignore this. It is caused by a workaround for a bug in the Kotlin compiler\n * ([KT-64092](https://youtrack.jetbrains.com/issue/KT-64092/OVERLOADRESOLUTIONAMBIGUITY-caused-by-lambda-argument)).\n * @include [ColumnGroupDocs.KPropertyReceiverArgs]\n * @include [ColumnGroupDocs.SelectorArgs]\n */"} {"signature":"@ Suppress ( \"\" ) @ JvmName ( \"\" ) public fun < C > KProperty < DataRow < C > > . allColsExcept ( selector : ColumnsSelector < C , * > ) : ColumnSet < * >","body":"= columnGroup ( this ) . allColsExcept ( selector )","docstring":"/**\n * @include [ColumnGroupDocs]\n * ## NOTE: {@comment TODO fix warning}\n * If you get a warning `CANDIDATE_CHOSEN_USING_OVERLOAD_RESOLUTION_BY_LAMBDA_ANNOTATION`, you\n * can safely ignore this. It is caused by a workaround for a bug in the Kotlin compiler\n * ([KT-64092](https://youtrack.jetbrains.com/issue/KT-64092/OVERLOADRESOLUTIONAMBIGUITY-caused-by-lambda-argument)).\n * @include [ColumnGroupDocs.KPropertyReceiverArgs]\n * @include [ColumnGroupDocs.SelectorArgs]\n */"} {"signature":"public fun KProperty < * > . allColsExcept ( vararg others : String ) : ColumnSet < * >","body":"= columnGroup ( this ) . allColsExceptInternal ( others . toColumnSet ( ) )","docstring":"/**\n * @include [ColumnGroupDocs]\n * @include [ColumnGroupDocs.KPropertyReceiverArgs]\n * @include [ColumnGroupDocs.StringArgs]\n */"} {"signature":"public fun KProperty < * > . allColsExcept ( vararg others : KProperty < * > ) : ColumnSet < * >","body":"= columnGroup ( this ) . allColsExceptInternal ( others . toColumnSet ( ) )","docstring":"/**\n * @include [ColumnGroupDocs]\n * @include [ColumnGroupDocs.KPropertyReceiverArgs]\n * @include [ColumnGroupDocs.KPropertyArgs]\n */"} {"signature":"public fun KProperty < * > . allColsExcept ( vararg others : ColumnPath ) : ColumnSet < * >","body":"= columnGroup ( this ) . allColsExceptInternal ( others . toColumnSet ( ) )","docstring":"/**\n * @include [ColumnGroupDocs]\n * @include [ColumnGroupDocs.KPropertyReceiverArgs]\n * @include [ColumnGroupDocs.ColumnPathArgs]\n */"} {"signature":"public fun ColumnPath . allColsExcept ( selector : ColumnsSelector < * , * > ) : ColumnSet < * >","body":"= columnGroup ( this ) . allColsExcept ( selector )","docstring":"/**\n * @include [ColumnGroupDocs]\n * @include [ColumnGroupDocs.ColumnPathReceiverArgs]\n * @include [ColumnGroupDocs.SelectorArgs]\n */"} {"signature":"public fun ColumnPath . allColsExcept ( vararg others : String ) : ColumnSet < * >","body":"= columnGroup ( this ) . allColsExceptInternal ( others . toColumnSet ( ) )","docstring":"/**\n * @include [ColumnGroupDocs]\n * @include [ColumnGroupDocs.ColumnPathReceiverArgs]\n * @include [ColumnGroupDocs.StringArgs]\n */"} {"signature":"public fun ColumnPath . allColsExcept ( vararg others : KProperty < * > ) : ColumnSet < * >","body":"= columnGroup ( this ) . allColsExceptInternal ( others . toColumnSet ( ) )","docstring":"/**\n * @include [ColumnGroupDocs]\n * @include [ColumnGroupDocs.ColumnPathReceiverArgs]\n * @include [ColumnGroupDocs.KPropertyArgs]\n */"} {"signature":"public fun ColumnPath . allColsExcept ( vararg others : ColumnPath ) : ColumnSet < * >","body":"= columnGroup ( this ) . allColsExceptInternal ( others . toColumnSet ( ) )","docstring":"/**\n * @include [ColumnGroupDocs]\n * @include [ColumnGroupDocs.ColumnPathReceiverArgs]\n * @include [ColumnGroupDocs.ColumnPathArgs]\n */"} {"signature":"@ ExperimentalExceptCsDsl public infix fun < C > SingleColumn < DataRow < C > > . exceptNew ( selector : ColumnsSelector < C , * > ) : SingleColumn < DataRow < C > >","body":"= exceptExperimentalInternal ( selector . toColumns ( ) )","docstring":"/**\n * @include [ExperimentalExceptDocs]\n */"} {"signature":"@ ExperimentalExceptCsDsl public infix fun < C > SingleColumn < DataRow < C > > . exceptNew ( other : String ) : SingleColumn < DataRow < C > >","body":"= exceptExperimentalInternal ( column < Any ? > ( other ) )","docstring":"/**\n * @include [ExperimentalExceptDocs]\n */"} {"signature":"@ ExperimentalExceptCsDsl public fun < C > SingleColumn < DataRow < C > > . exceptNew ( vararg others : String ) : SingleColumn < DataRow < C > >","body":"= exceptExperimentalInternal ( others . toColumnSet ( ) )","docstring":"/**\n * @include [ExperimentalExceptDocs]\n */"} {"signature":"@ ExperimentalExceptCsDsl public infix fun < C > SingleColumn < DataRow < C > > . exceptNew ( other : KProperty < C > ) : SingleColumn < DataRow < C > >","body":"= exceptExperimentalInternal ( column ( other ) )","docstring":"/**\n * @include [ExperimentalExceptDocs]\n */"} {"signature":"@ ExperimentalExceptCsDsl public fun < C > SingleColumn < DataRow < C > > . exceptNew ( vararg others : KProperty < * > ) : SingleColumn < DataRow < C > >","body":"= exceptExperimentalInternal ( others . toColumnSet ( ) )","docstring":"/**\n * @include [ExperimentalExceptDocs]\n */"} {"signature":"@ ExperimentalExceptCsDsl public infix fun < C > SingleColumn < DataRow < C > > . exceptNew ( other : ColumnPath ) : SingleColumn < DataRow < C > >","body":"= exceptExperimentalInternal ( column < Any ? > ( other ) )","docstring":"/**\n * @include [ExperimentalExceptDocs]\n */"} {"signature":"@ ExperimentalExceptCsDsl public fun < C > SingleColumn < DataRow < C > > . exceptNew ( vararg others : ColumnPath ) : SingleColumn < DataRow < C > >","body":"= exceptExperimentalInternal ( others . toColumnSet ( ) )","docstring":"/**\n * @include [ExperimentalExceptDocs]\n */"} {"signature":"@ ExperimentalExceptCsDsl public infix fun String . exceptNew ( selector : ColumnsSelector < * , * > ) : SingleColumn < DataRow < * > >","body":"= columnGroup ( this ) . exceptNew ( selector )","docstring":"/**\n * @include [ExperimentalExceptDocs]\n */"} {"signature":"@ ExperimentalExceptCsDsl public infix fun String . exceptNew ( other : String ) : SingleColumn < DataRow < * > >","body":"= columnGroup ( this ) . exceptExperimentalInternal ( column < Any ? > ( other ) )","docstring":"/**\n * @include [ExperimentalExceptDocs]\n */"} {"signature":"@ ExperimentalExceptCsDsl public fun String . exceptNew ( vararg others : String ) : SingleColumn < DataRow < * > >","body":"= columnGroup ( this ) . exceptExperimentalInternal ( others . toColumnSet ( ) )","docstring":"/**\n * @include [ExperimentalExceptDocs]\n */"} {"signature":"@ ExperimentalExceptCsDsl public infix fun String . exceptNew ( other : KProperty < * > ) : SingleColumn < DataRow < * > >","body":"= columnGroup ( this ) . exceptExperimentalInternal ( column ( other ) )","docstring":"/**\n * @include [ExperimentalExceptDocs]\n */"} {"signature":"@ ExperimentalExceptCsDsl public fun String . exceptNew ( vararg others : KProperty < * > ) : SingleColumn < DataRow < * > >","body":"= columnGroup ( this ) . exceptExperimentalInternal ( others . toColumnSet ( ) )","docstring":"/**\n * @include [ExperimentalExceptDocs]\n */"} {"signature":"@ ExperimentalExceptCsDsl public infix fun String . exceptNew ( other : ColumnPath ) : SingleColumn < DataRow < * > >","body":"= columnGroup ( this ) . exceptExperimentalInternal ( column < Any ? > ( other ) )","docstring":"/**\n * @include [ExperimentalExceptDocs]\n */"} {"signature":"@ ExperimentalExceptCsDsl public fun String . exceptNew ( vararg others : ColumnPath ) : SingleColumn < DataRow < * > >","body":"= columnGroup ( this ) . exceptExperimentalInternal ( others . toColumnSet ( ) )","docstring":"/**\n * @include [ExperimentalExceptDocs]\n */"} {"signature":"@ ExperimentalExceptCsDsl @ OptIn ( ExperimentalTypeInference :: class ) @ OverloadResolutionByLambdaReturnType public infix fun < C > KProperty < C > . exceptNew ( selector : ColumnsSelector < C , * > ) : SingleColumn < DataRow < C > >","body":"= columnGroup ( this ) . exceptExperimentalInternal ( selector . toColumns ( ) )","docstring":"/**\n * @include [ExperimentalExceptDocs]\n */"} {"signature":"@ ExperimentalExceptCsDsl @ Suppress ( \"\" ) @ JvmName ( \"\" ) public infix fun < C > KProperty < DataRow < C > > . exceptNew ( selector : ColumnsSelector < C , * > ) : SingleColumn < DataRow < C > >","body":"= columnGroup ( this ) . exceptExperimentalInternal ( selector . toColumns ( ) )","docstring":"/**\n * @include [ExperimentalExceptDocs]\n */"} {"signature":"@ ExperimentalExceptCsDsl public infix fun < C > KProperty < C > . exceptNew ( other : String ) : SingleColumn < DataRow < C > >","body":"= columnGroup ( this ) . exceptExperimentalInternal ( column < Any ? > ( other ) )","docstring":"/**\n * @include [ExperimentalExceptDocs]\n */"} {"signature":"@ ExperimentalExceptCsDsl public fun < C > KProperty < C > . exceptNew ( vararg others : String ) : SingleColumn < DataRow < C > >","body":"= columnGroup ( this ) . exceptExperimentalInternal ( others . toColumnSet ( ) )","docstring":"/**\n * @include [ExperimentalExceptDocs]\n */"} {"signature":"@ ExperimentalExceptCsDsl @ Suppress ( \"\" ) @ JvmName ( \"\" ) public infix fun < C > KProperty < DataRow < C > > . exceptNew ( other : String ) : SingleColumn < DataRow < C > >","body":"= columnGroup ( this ) . exceptExperimentalInternal ( column < Any ? > ( other ) )","docstring":"/**\n * @include [ExperimentalExceptDocs]\n */"} {"signature":"@ ExperimentalExceptCsDsl @ Suppress ( \"\" ) @ JvmName ( \"\" ) public fun < C > KProperty < DataRow < C > > . exceptNew ( vararg others : String ) : SingleColumn < DataRow < C > >","body":"= columnGroup ( this ) . exceptExperimentalInternal ( others . toColumnSet ( ) )","docstring":"/**\n * @include [ExperimentalExceptDocs]\n */"} {"signature":"@ ExperimentalExceptCsDsl public infix fun < C > KProperty < C > . exceptNew ( other : KProperty < * > ) : SingleColumn < DataRow < C > >","body":"= columnGroup ( this ) . exceptExperimentalInternal ( column ( other ) )","docstring":"/**\n * @include [ExperimentalExceptDocs]\n */"} {"signature":"@ ExperimentalExceptCsDsl public fun < C > KProperty < C > . exceptNew ( vararg others : KProperty < * > ) : SingleColumn < DataRow < C > >","body":"= columnGroup ( this ) . exceptExperimentalInternal ( others . toColumnSet ( ) )","docstring":"/**\n * @include [ExperimentalExceptDocs]\n */"} {"signature":"@ ExperimentalExceptCsDsl @ Suppress ( \"\" ) @ JvmName ( \"\" ) public infix fun < C > KProperty < DataRow < C > > . exceptNew ( other : KProperty < * > ) : SingleColumn < DataRow < C > >","body":"= columnGroup ( this ) . exceptExperimentalInternal ( column ( other ) )","docstring":"/**\n * @include [ExperimentalExceptDocs]\n */"} {"signature":"@ ExperimentalExceptCsDsl @ Suppress ( \"\" ) @ JvmName ( \"\" ) public fun < C > KProperty < DataRow < C > > . exceptNew ( vararg others : KProperty < * > ) : SingleColumn < DataRow < C > >","body":"= columnGroup ( this ) . exceptExperimentalInternal ( others . toColumnSet ( ) )","docstring":"/**\n * @include [ExperimentalExceptDocs]\n */"} {"signature":"@ ExperimentalExceptCsDsl public infix fun < C > KProperty < C > . exceptNew ( other : ColumnPath ) : SingleColumn < DataRow < C > >","body":"= columnGroup ( this ) . exceptExperimentalInternal ( column < Any ? > ( other ) )","docstring":"/**\n * @include [ExperimentalExceptDocs]\n */"} {"signature":"@ ExperimentalExceptCsDsl public fun < C > KProperty < C > . exceptNew ( vararg others : ColumnPath ) : SingleColumn < DataRow < C > >","body":"= columnGroup ( this ) . exceptExperimentalInternal ( others . toColumnSet ( ) )","docstring":"/**\n * @include [ExperimentalExceptDocs]\n */"} {"signature":"@ ExperimentalExceptCsDsl @ Suppress ( \"\" ) @ JvmName ( \"\" ) public infix fun < C > KProperty < DataRow < C > > . exceptNew ( other : ColumnPath ) : SingleColumn < DataRow < C > >","body":"= columnGroup ( this ) . exceptExperimentalInternal ( column < Any ? > ( other ) )","docstring":"/**\n * @include [ExperimentalExceptDocs]\n */"} {"signature":"@ ExperimentalExceptCsDsl @ Suppress ( \"\" ) @ JvmName ( \"\" ) public fun < C > KProperty < DataRow < C > > . exceptNew ( vararg others : ColumnPath ) : SingleColumn < DataRow < C > >","body":"= columnGroup ( this ) . exceptExperimentalInternal ( others . toColumnSet ( ) )","docstring":"/**\n * @include [ExperimentalExceptDocs]\n */"} {"signature":"@ ExperimentalExceptCsDsl public infix fun ColumnPath . exceptNew ( selector : ColumnsSelector < * , * > ) : SingleColumn < DataRow < * > >","body":"= columnGroup ( this ) . exceptExperimentalInternal ( selector . toColumns < Any ? , Any ? > ( ) )","docstring":"/**\n * @include [ExperimentalExceptDocs]\n */"} {"signature":"@ ExperimentalExceptCsDsl public infix fun ColumnPath . exceptNew ( other : String ) : SingleColumn < DataRow < * > >","body":"= columnGroup ( this ) . exceptExperimentalInternal ( column < Any ? > ( other ) )","docstring":"/**\n * @include [ExperimentalExceptDocs]\n */"} {"signature":"@ ExperimentalExceptCsDsl public fun ColumnPath . exceptNew ( vararg others : String ) : SingleColumn < DataRow < * > >","body":"= columnGroup ( this ) . exceptExperimentalInternal ( others . toColumnSet ( ) )","docstring":"/**\n * @include [ExperimentalExceptDocs]\n */"} {"signature":"@ ExperimentalExceptCsDsl public infix fun ColumnPath . exceptNew ( other : KProperty < * > ) : SingleColumn < DataRow < * > >","body":"= columnGroup ( this ) . exceptExperimentalInternal ( column ( other ) )","docstring":"/**\n * @include [ExperimentalExceptDocs]\n */"} {"signature":"@ ExperimentalExceptCsDsl public infix fun ColumnPath . exceptNew ( other : ColumnPath ) : SingleColumn < DataRow < * > >","body":"= columnGroup ( this ) . exceptExperimentalInternal ( column < Any ? > ( other ) )","docstring":"/**\n * @include [ExperimentalExceptDocs]\n */"} {"signature":"@ ExperimentalExceptCsDsl public fun ColumnPath . exceptNew ( vararg others : ColumnPath ) : SingleColumn < DataRow < * > >","body":"= columnGroup ( this ) . exceptExperimentalInternal ( others . toColumnSet ( ) )","docstring":"/**\n * @include [ExperimentalExceptDocs]\n */"} {"signature":"@ Suppress ( \"\" ) internal fun < C > ColumnSet < C > . exceptInternal ( other : ColumnsResolver < * > ) : ColumnSet < C >","body":"= createColumnSet { context -> val resolvedCols = this . resolve ( context ) val resolvedColsToExcept = other . resolve ( context ) resolvedCols . allColumnsExceptKeepingStructure ( resolvedColsToExcept ) } as ColumnSet < C >","docstring":"/**\n * Removes the columns in the \"other\" ColumnsResolver from the current ColumnSet while keeping the structure intact.\n * Returns a new ColumnSet with the remaining columns.\n *\n * @param other The ColumnsResolver containing the columns to be removed.\n * @return The new ColumnSet with the remaining columns.\n */"} {"signature":"internal fun SingleColumn < DataRow < * > > . allColsExceptInternal ( other : ColumnsResolver < * > ) : ColumnSet < Any ? >","body":"= selectInternal { all ( ) . exceptInternal ( other ) }","docstring":"/**\n * Returns a new ColumnSet that contains all columns from inside the receiver column group\n * except those specified in the \"other\" ColumnsResolver.\n *\n * @param other The ColumnsResolver containing the columns to be removed.\n * @return The new ColumnSet with the remaining columns.\n */"} {"signature":"@ Suppress ( \"\" ) internal fun < C > SingleColumn < DataRow < C > > . exceptExperimentalInternal ( other : ColumnsResolver < * > ) : SingleColumn < DataRow < C > >","body":"= this . ensureIsColumnGroup ( ) . transformSingle { singleCol -> val columnsToExcept = singleCol . asColumnGroup ( ) . getColumnsWithPaths { other } . map { it . changePath ( singleCol . path + it . path ) } val newCols = listOf ( singleCol ) . allColumnsExceptKeepingStructure ( columnsToExcept ) newCols as List < ColumnWithPath < DataRow < * > > > } . singleInternal ( ) as SingleColumn < DataRow < C > >","docstring":"/**\n * Returns a new SingleColumn> that has the same structure as the receiver, but excludes columns\n * specified in the \"other\" ColumnsResolver.\n *\n * @param other The [ColumnsResolver] to use for excluding columns.\n * @return A new [SingleColumn] with the filtered columns excluded.\n */"} {"signature":"@ SinceKotlin ( \"\" ) @ WasExperimental ( ExperimentalStdlibApi :: class ) public operator fun < T , R > DeepRecursiveFunction < T , R > . invoke ( value : T ) : R","body":"= DeepRecursiveScopeImpl < T , R > ( block , value ) . runCallLoop ( )","docstring":"/**\n * Initiates a call to this deep recursive function, forming a root of the call tree.\n *\n * This operator should not be used from inside of [DeepRecursiveScope] as it uses the call stack slot for\n * initial recursive invocation. From inside of [DeepRecursiveScope] use\n * [callRecursive][DeepRecursiveScope.callRecursive].\n */"} {"signature":"public abstract suspend fun callRecursive ( value : T ) : R","body":"public abstract suspend fun callRecursive ( value : T ) : R","docstring":"/**\n * Makes recursive call to this [DeepRecursiveFunction] function putting the call activation frame on the heap,\n * as opposed to the actual call stack that is used by a regular recursive call.\n */"} {"signature":"public abstract suspend fun < U , S > DeepRecursiveFunction < U , S > . callRecursive ( value : U ) : S","body":"public abstract suspend fun < U , S > DeepRecursiveFunction < U , S > . callRecursive ( value : U ) : S","docstring":"/**\n * Makes call to the specified [DeepRecursiveFunction] function putting the call activation frame on the heap,\n * as opposed to the actual call stack that is used by a regular call.\n */"} {"signature":"expect fun getCurrentDate ( ) : String","body":"expect fun getCurrentDate ( ) : String","docstring":"/**\n * Common `expect` declaration\n */"} {"signature":"fun getDate ( ) : String","body":"{ return \"\" }","docstring":"/**\n * Common date util function\n */"} {"signature":"private fun getProvider ( gradle : Gradle ) : Provider < VariantImplementationFactories >","body":"{ val configProvider = VariantImplementationFactoriesConfigurator . getProvider ( gradle ) return gradle . sharedServices . registerIfAbsent ( \"\" , VariantImplementationFactories :: class . java ) { it . parameters . factories . value ( configProvider . get ( ) . factories ) } }","docstring":"/**\n * Please don't change the visibility modifier. This method isn't intended to be used directly.\n * This method doesn't declare the service usage from Gradle tasks.\n */"} {"signature":"@ Test fun testResettingExceptionHandler ( )","body":"= withExceptionHandler ( handler ) { withFixedThreadPool ( ) { dispatcher -> val flow = rxFlowable < Unit > ( dispatcher ) { if ( ( .. ) . random ( ) == ) { Thread . sleep ( ) } throw TestException ( ) } . asFlow ( ) runBlocking { combine ( flow , flow ) { _ , _ -> Unit } . catch { } . collect { } } } }","docstring":"/**\n * This test doesn't test much and was added to display a problem with straighforward use of\n * [withExceptionHandler].\n *\n * If one was to remove `dispatcher` and launch `rxFlowable` with an empty coroutine context,\n * this test would fail fairly often, while other tests were also vulnerable, but the problem is\n * much more difficult to reproduce. Thus, this test is a justification for adding `dispatcher`\n * to other tests.\n *\n * See the commit that introduced this test for a better explanation.\n */"} {"signature":"private fun withFixedThreadPool ( numberOfThreads : Int , block : ( CoroutineDispatcher ) -> Unit )","body":"{ val pool = Executors . newFixedThreadPool ( numberOfThreads ) val dispatcher = pool . asCoroutineDispatcher ( ) block ( dispatcher ) pool . shutdown ( ) while ( ! pool . awaitTermination ( , TimeUnit . SECONDS ) ) { } }","docstring":"/**\n * Run in a thread pool, then wait for all the tasks to finish.\n */"} {"signature":"fun usage ( )","body":"{ }","docstring":"/**\n * [Foo.nonExtFun]\n * [test.Foo.nonExtFun]\n *\n * [Foo.nonExtProp]\n * [test.Foo.nonExtProp]\n */"} {"signature":"inline fun < T > withChildClassName ( name : Name , isExpect : Boolean , forceLocalContext : Boolean = false , l : ( ) -> T , )","body":"= when { forceLocalContext -> withForcedLocalContext { withChildClassNameRegardlessLocalContext ( name , isExpect , l ) } else -> { withChildClassNameRegardlessLocalContext ( name , isExpect , l ) } }","docstring":"/**** Class name utils ****/"} {"signature":"inline fun < T > withContainerSymbol ( symbol : FirBasedSymbol < * > , isLocal : Boolean = false , block : ( ) -> T , ) : T","body":"{ if ( ! isLocal ) { context . pushContainerSymbol ( symbol ) } return try { block ( ) } finally { if ( ! isLocal ) { context . popContainerSymbol ( symbol ) } } }","docstring":"/**\n * @param isLocal if true [symbol] will be ignored\n *\n * @see Context.containerSymbol\n * @see Context.pushContainerSymbol\n * @see Context.popContainerSymbol\n */"} {"signature":"protected fun dispatchReceiverForInnerClassConstructor ( ) : ConeClassLikeType ?","body":"{ val dispatchReceivers = context . dispatchReceiverTypesStack return dispatchReceivers . getOrNull ( dispatchReceivers . lastIndex - ) }","docstring":"/**\n * @return second from the end dispatch receiver. For the inner class constructor it would be the outer class.\n */"} {"signature":"fun < T > MutableList < T > . removeLast ( ) : T","body":"{ return removeAt ( size - ) }","docstring":"/**** Function utils ****/"} {"signature":"private fun generateIncrementOrDecrementBlockForArrayAccess ( wholeExpression : T , operationReference : T ? , receiver : T , callName : Name , prefix : Boolean , convert : T . ( ) -> FirExpression , ) : FirExpression","body":"{ val array = receiver . arrayExpression val isInc = when ( callName ) { OperatorNameConventions . INC -> true OperatorNameConventions . DEC -> false else -> error ( \"\" ) } val sourceKind = sourceKindForIncOrDec ( callName , prefix ) return buildBlockPossiblyUnderSafeCall ( array , convert , receiver . toFirSourceElement ( ) , ) { arrayReceiver -> val baseSource = wholeExpression ? . toFirSourceElement ( ) val desugaredSource = baseSource ? . fakeElement ( sourceKind ) source = desugaredSource val indices = receiver . indexExpressions requireNotNull ( indices ) { \"\" } val arrayVariable = generateTemporaryVariable ( baseModuleData , array ? . toFirSourceElement ( KtFakeSourceElementKind . ArrayAccessNameReference ) , name = SpecialNames . ARRAY , initializer = arrayReceiver , ) . also { statements += it } val indexVariables = indices . mapIndexed { i , index -> generateTemporaryVariable ( baseModuleData , index . toFirSourceElement ( KtFakeSourceElementKind . ArrayIndexExpressionReference ) , name = SpecialNames . subscribeOperatorIndex ( i ) , index . convert ( ) ) . also { statements += it } } fun buildGetCall ( sourceKind : KtFakeSourceElementKind ) = buildFunctionCall { val fakeSource = receiver ? . toFirSourceElement ( sourceKind ) source = fakeSource calleeReference = buildSimpleNamedReference { source = fakeSource name = OperatorNameConventions . GET } explicitReceiver = generateResolvedAccessExpression ( arrayVariable . source , arrayVariable ) argumentList = buildArgumentList { for ( indexVar in indexVariables ) { arguments += generateResolvedAccessExpression ( indexVar . source , indexVar ) } } origin = FirFunctionCallOrigin . Operator } fun buildSetCall ( argumentExpression : FirExpression , sourceElementKind : KtFakeSourceElementKind ) = buildFunctionCall { source = desugaredSource calleeReference = buildSimpleNamedReference { source = receiver . toFirSourceElement ( sourceElementKind ) name = OperatorNameConventions . SET } explicitReceiver = generateResolvedAccessExpression ( arrayVariable . source , arrayVariable ) argumentList = buildArgumentList { for ( indexVar in indexVariables ) { arguments += generateResolvedAccessExpression ( indexVar . source , indexVar ) } arguments += argumentExpression } origin = FirFunctionCallOrigin . Operator } fun buildIncDecCall ( kind : KtFakeSourceElementKind , receiver : FirExpression ) = buildFunctionCall { source = desugaredSource calleeReference = buildSimpleNamedReference { source = operationReference ? . toFirSourceElement ( kind ) name = callName } explicitReceiver = receiver origin = FirFunctionCallOrigin . Operator } if ( prefix ) { statements += buildSetCall ( buildIncDecCall ( sourceKind , buildGetCall ( sourceKind ) , ) , sourceKind ) statements += buildGetCall ( if ( isInc ) { KtFakeSourceElementKind . DesugaredPrefixIncSecondGetReference } else { KtFakeSourceElementKind . DesugaredPrefixDecSecondGetReference } ) } else { val initialValueVar = generateTemporaryVariable ( baseModuleData , desugaredSource , SpecialNames . UNARY , buildGetCall ( sourceKind ) ) statements += initialValueVar statements += buildSetCall ( buildIncDecCall ( sourceKind , generateResolvedAccessExpression ( null , initialValueVar ) ) , sourceKind ) statements += generateResolvedAccessExpression ( null , initialValueVar ) } } }","docstring":"/**\n * given:\n * a[b, c]++\n *\n * result:\n * {\n * val = a\n * val = b\n * val = c\n * val = .get(, )\n * .set(, , .inc())\n * ^\n * }\n *\n * given:\n * ++a[b, c]\n *\n * result:\n * {\n * val = a\n * val = b\n * val = c\n * .set(b, c, .get(, ).inc())\n * ^.get(, )\n * }\n *\n */"} {"signature":"fun List < FirAnnotationCall > . filterConstructorPropertyRelevantAnnotations ( isVar : Boolean )","body":"= filter { it . useSiteTarget == null || it . useSiteTarget == AnnotationUseSiteTarget . PROPERTY || ! isVar && ( it . useSiteTarget == AnnotationUseSiteTarget . SETTER_PARAMETER || it . useSiteTarget == AnnotationUseSiteTarget . PROPERTY_SETTER ) }","docstring":"/**\n * Not the same as [filterStandalonePropertyRelevantAnnotations], because on\n * primary constructor value parameters annotations should go to the\n * [FirValueParameter] first.\n */"} {"signature":"inline fun copying ( block : ExecuteRequest . ( ) -> Unit ) : ExecuteRequest","body":"= copy ( ) . apply ( block )","docstring":"/**\n * Create a copy of this [ExecuteRequest], modify the copy by running [block] on it, and return that copy.\n */"} {"signature":"fun assertSuccess ( ) : ExecuteResponse","body":"{ check ( exitCode == ) { if ( exitCode == null ) { \"\" } else { \"\" } } return this }","docstring":"/**\n * Checks that [exitCode] is `0`.\n *\n * @throws IllegalStateException if [exitCode] is not 0.\n */"} {"signature":"fun execute ( request : ExecuteRequest ) : ExecuteResponse","body":"fun execute ( request : ExecuteRequest ) : ExecuteResponse","docstring":"/**\n * Run the process and wait for its completion.\n */"} {"signature":"private fun BodyGenerator . createBinaryTable ( selectorLocal : WasmLocal , intBranches : List < ExtractedWhenBranch < Int > > )","body":"{ val sortedCaseToBranchIndex = mutableListOf < Pair < Int , Int > > ( ) intBranches . flatMapIndexedTo ( sortedCaseToBranchIndex ) { index , branch -> branch . conditions . map { it . const . value to index } } sortedCaseToBranchIndex . sortBy { it . first } val location = SourceLocation . NoLocation ( \"\" ) val thenBody = { result : Int -> body . buildConstI32 ( result , location ) } val elseBody : ( ) -> Unit = { body . buildConstI32 ( intBranches . size , location ) } createBinaryTable ( selectorLocal , WasmI32 , sortedCaseToBranchIndex , , sortedCaseToBranchIndex . size , thenBody , elseBody ) }","docstring":"/**\n * Create binary search for when that emit branches index in leafs\n * when (a) {\n * 123 -> expr1\n * 456 -> expr2\n * else -> elseExpr\n * }\n * crates binary search linked to index of branch\n * IF (a < 456) {\n * IF (a == 123)\n * #expr1\n * ELSE\n * #else\n * END IF\n * ELSE\n * IF (1 == 456)\n * #expr2\n * ELSE\n * #else\n * END IF\n * END IF\n * }\n */"} {"signature":"private fun BodyGenerator . createBinaryTable ( selectorLocal : WasmLocal , intBranches : List < ExtractedWhenBranch < Int > > , elseExpression : IrExpression ? , resultType : WasmType ? , expectedType : IrType , )","body":"{ val sortedCaseToBranchIndex = mutableListOf < Pair < Int , IrExpression > > ( ) intBranches . mapTo ( sortedCaseToBranchIndex ) { branch -> branch . conditions [ ] . const . value to branch . expression } sortedCaseToBranchIndex . sortBy { it . first } body . buildBlock ( \"\" , resultType ) { currentBlock -> val thenBody = { result : IrExpression -> generateWithExpectedType ( result , expectedType ) body . buildBr ( currentBlock , SourceLocation . NoLocation ( \"\" ) ) } createBinaryTable ( selectorLocal = selectorLocal , resultType = null , sortedCases = sortedCaseToBranchIndex , fromIncl = , toExcl = sortedCaseToBranchIndex . size , thenBody = thenBody , elseBody = { } ) if ( elseExpression != null ) { generateWithExpectedType ( elseExpression , expectedType ) } else { if ( resultType != null ) { if ( expectedType . isUnit ( ) ) { body . buildGetUnit ( ) } else { error ( \"\" ) } } } } }","docstring":"/**\n * Create binary search for when that emit when expressions in leafs\n * when (a) {\n * 123 -> expr1\n * 456 -> expr2\n * else -> elseExpr\n * }\n * crates binary search linked to index of branch\n * BLOCK\n * IF (a < 456) {\n * IF (a == 123)\n * #expr1\n * GOTO END BLOCK\n * END IF\n * ELSE\n * IF (1 == 456)\n * #expr2\n * GOTO END BLOCK\n * END IF\n * END IF\n * elseExpr\n * END BLOCK\n * }\n*/"} {"signature":"private fun BodyGenerator . genTableIntSwitch ( selectorLocal : WasmLocal , resultType : WasmType ? , branches : List < ExtractedWhenBranch < Int > > , elseExpression : IrExpression ? , shift : Int , brTable : List < Int > , expectedType : IrType , )","body":"{ val location = SourceLocation . NoLocation ( \"\" ) val baseBlockIndex = body . numberOfNestedBlocks repeat ( branches . size + ) { body . buildBlock ( resultType ) } if ( resultType != null && resultType !is WasmUnreachableType ) { generateDefaultInitializerForType ( resultType , body ) } body . buildGetLocal ( selectorLocal , location ) if ( shift != ) { body . buildConstI32 ( shift , location ) body . buildInstr ( WasmOp . I32_SUB , location ) } body . buildInstr ( WasmOp . BR_TABLE , location , WasmImmediate . LabelIdxVector ( brTable ) , WasmImmediate . LabelIdx ( branches . size ) ) body . buildEnd ( ) for ( expression in branches ) { if ( resultType != null && resultType !is WasmUnreachableType ) { body . buildDrop ( location ) } generateWithExpectedType ( expression . expression , expectedType ) body . buildBr ( baseBlockIndex + , location ) body . buildEnd ( ) } if ( elseExpression != null ) { if ( resultType != null && resultType !is WasmUnreachableType ) { body . buildDrop ( location ) } generateWithExpectedType ( elseExpression , expectedType ) } body . buildEnd ( ) check ( baseBlockIndex == body . numberOfNestedBlocks ) }","docstring":"/**\n * Create table switch with expressions\n * when (a) {\n * 0 -> expr1\n * 1 -> expr2\n * else -> elseExpr\n * }\n * crates binary search linked to index of branch\n * BLOCK FOR ELSE\n * BLOCK1\n * BLOCK2\n * BLOCK FOR BRTABLE\n * BRTABLE 0 1 2\n * END BLOCK FOR BRTABLE\n * expr1\n * GOTO END BLOCK FOR ELSE\n * END BLOCK1\n * expr2\n * GOTO END BLOCK FOR ELSE\n * END BLOCK2\n * elseExpr\n * END BLOCK FOR ELSE\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":"private fun invalidate ( module : KtModule )","body":"{ ApplicationManager . getApplication ( ) . assertWriteAccessAllowed ( ) sessionInvalidationEventPublisher . collectSessionsAndPublishInvalidationEvent { val didSessionExist = sessionCache . removeSession ( module ) if ( ! didSessionExist ) return@collectSessionsAndPublishInvalidationEvent KotlinModuleDependentsProvider . getInstance ( project ) . getTransitiveDependents ( module ) . forEach ( sessionCache :: removeSession ) if ( module is KtScriptModule || module is KtScriptDependencyModule || module is KtLibraryModule ) { sessionCache . removeAllScriptSessions ( ) } if ( module is KtDanglingFileModule ) { sessionCache . removeContextualDanglingFileSessions ( module ) } else { sessionCache . removeAllDanglingFileSessions ( ) } } }","docstring":"/**\n * Invalidates the session(s) associated with [module].\n *\n * Per the contract of [LLFirSessionInvalidationService], [invalidate] may only be called from a write action.\n */"} {"signature":"fun report ( filePath : String , owner : String , name : String , constType : String )","body":"fun report ( filePath : String , owner : String , name : String , constType : String )","docstring":"/**\n * Report Java constant, which is defined as [name] in [owner] java class.\n * This constant is used in Kotlin file [filePath].\n * [constType] is one of Kotlin's [Byte, Short, Int, Long, Float, Double, Boolean, Char, String],\n * that correspond to the eight primitive Java types or String\n * Format of [owner] class is \"package.Outer$Inner\"\n */"} {"signature":"fun isExported ( module : KtModule ) : Boolean","body":"fun isExported ( module : KtModule ) : Boolean","docstring":"/**\n * Will return true if the module is considered 'exported' in the build.\n * e.g. the Gradle project building the framework should always be considered as 'exported'.\n * However, dependencies of such a Gradle project (e.g. a 'utils' module) can either be declared\n * as 'exported' or not exported.\n *\n * Exported modules will get their full API surface includced in the final framework.\n * Non-exported modules will get an additional module 'string' attached to exported classifiers.\n */"} {"signature":"internal fun KtObjCExportSession . isExported ( module : KtModule ) : Boolean","body":"= cached ( IsExportedCacheKey ( module ) ) { internal . moduleClassifier . isExported ( module ) }","docstring":"/**\n * See [KtObjCExportDefaultModuleClassifier.isExported]:\n * Note: This method will be cached.\n */"} {"signature":"public fun expectedLocationForDri ( dri : DRI ) : String","body":"= ( listOf ( dri . packageName ) + dri . classNames ? . split ( \"\" ) ? . map { identifierToFilename ( it ) } . orEmpty ( ) + listOf ( dri . callable ? . let { identifierToFilename ( it . name ) } ? : \"\" ) ) . filterNotNull ( ) . joinToString ( \"\" )","docstring":"/**\n * This method should return guessed filesystem location for a given [DRI]\n * It is used to decide if a [DRI] should be present in the relocation list of the\n * generated package-list so it is ok if the path differs from the one returned by [resolve]\n * @return Path to a giver [DRI] or null if path should not be considered for relocations\n */"} {"signature":"public fun < T > CoroutineScope . future ( context : CoroutineContext = EmptyCoroutineContext , start : CoroutineStart = CoroutineStart . DEFAULT , block : suspend CoroutineScope . ( ) -> T ) : ListenableFuture < T >","body":"{ require ( ! start . isLazy ) { \"\" } val newContext = newCoroutineContext ( context ) val coroutine = ListenableFutureCoroutine < T > ( newContext ) coroutine . start ( start , coroutine , block ) return coroutine . future }","docstring":"/**\n * Starts [block] in a new coroutine and returns a [ListenableFuture] pointing to its result.\n *\n * The coroutine is started immediately. Passing [CoroutineStart.LAZY] to [start] throws\n * [IllegalArgumentException], because Futures don't have a way to start lazily.\n *\n * When the created coroutine [isCompleted][Job.isCompleted], it will try to\n * *synchronously* complete the returned Future with the same outcome. This will\n * succeed, barring a race with external cancellation of returned [ListenableFuture].\n *\n * Cancellation is propagated bidirectionally.\n *\n * `CoroutineContext` is inherited from this [CoroutineScope]. Additional context elements can be\n * added/overlaid by passing [context].\n *\n * If the context does not have a [CoroutineDispatcher], nor any other [ContinuationInterceptor]\n * member, [Dispatchers.Default] is used.\n *\n * The parent job is inherited from this [CoroutineScope], and can be overridden by passing\n * a [Job] in [context].\n *\n * See [newCoroutineContext][CoroutineScope.newCoroutineContext] for a description of debugging\n * facilities.\n *\n * Note that the error and cancellation semantics of [future] are _different_ than [async]'s.\n * In contrast to [Deferred], [Future] doesn't have an intermediate `Cancelling` state. If\n * the returned `Future` is successfully cancelled, and `block` throws afterward, the thrown\n * error is dropped, and getting the `Future`'s value will throw a `CancellationException` with\n * no cause. This is to match the specification and behavior of\n * `java.util.concurrent.FutureTask`.\n *\n * @param context added overlaying [CoroutineScope.coroutineContext] to form the new context.\n * @param start coroutine start option. The default value is [CoroutineStart.DEFAULT].\n * @param block the code to execute.\n */"} {"signature":"public fun < T > ListenableFuture < T > . asDeferred ( ) : Deferred < T >","body":"{ if ( this is InternalFutureFailureAccess ) { val t : Throwable ? = InternalFutures . tryInternalFastPathGetFailure ( this ) if ( t != null ) { return CompletableDeferred < T > ( ) . also { it . completeExceptionally ( t ) } } } if ( isDone ) { return try { CompletableDeferred ( Uninterruptibles . getUninterruptibly ( this ) ) } catch ( e : CancellationException ) { CompletableDeferred < T > ( ) . also { it . cancel ( e ) } } catch ( e : ExecutionException ) { CompletableDeferred < T > ( ) . also { it . completeExceptionally ( e . nonNullCause ( ) ) } } } val deferred = CompletableDeferred < T > ( ) Futures . addCallback ( this , object : FutureCallback < T > { override fun onSuccess ( result : T ) { runCatching { deferred . complete ( result ) } . onFailure { handleCoroutineException ( EmptyCoroutineContext , it ) } } override fun onFailure ( t : Throwable ) { runCatching { deferred . completeExceptionally ( t ) } . onFailure { handleCoroutineException ( EmptyCoroutineContext , it ) } } } , MoreExecutors . directExecutor ( ) ) deferred . invokeOnCompletion { cancel ( false ) } return object : Deferred < T > by deferred { } }","docstring":"/**\n * Returns a [Deferred] that is completed or failed by `this` [ListenableFuture].\n *\n * Completion is non-atomic between the two promises.\n *\n * Cancellation is propagated bidirectionally.\n *\n * When `this` `ListenableFuture` completes (either successfully or exceptionally) it will try to\n * complete the returned `Deferred` with the same value or exception. This will succeed, barring a\n * race with cancellation of the `Deferred`.\n *\n * When `this` `ListenableFuture` is [successfully cancelled][java.util.concurrent.Future.cancel],\n * it will cancel the returned `Deferred`.\n *\n * When the returned `Deferred` is [cancelled][Deferred.cancel], it will try to propagate the\n * cancellation to `this` `ListenableFuture`. Propagation will succeed, barring a race with the\n * `ListenableFuture` completing normally. This is the only case in which the returned `Deferred`\n * will complete with a different outcome than `this` `ListenableFuture`.\n */"} {"signature":"private fun ExecutionException . nonNullCause ( ) : Throwable","body":"{ return this . cause ! ! }","docstring":"/**\n * Returns the cause from an [ExecutionException] thrown by a [Future.get] or similar.\n *\n * [ExecutionException] _always_ wraps a non-null cause when Future.get() throws. A Future cannot\n * fail without a non-null `cause`, because the only way a Future _can_ fail is an uncaught\n * [Exception].\n *\n * If this !! throws [NullPointerException], a Future is breaking its interface contract and losing\n * state - a serious fundamental bug.\n */"} {"signature":"public fun < T > Deferred < T > . asListenableFuture ( ) : ListenableFuture < T >","body":"{ val listenableFuture = JobListenableFuture < T > ( this ) invokeOnCompletion { throwable -> if ( throwable == null ) { listenableFuture . complete ( getCompleted ( ) ) } else { listenableFuture . completeExceptionallyOrCancel ( throwable ) } } return listenableFuture }","docstring":"/**\n * Returns a [ListenableFuture] that is completed or failed by `this` [Deferred].\n *\n * Completion is non-atomic between the two promises.\n *\n * When either promise successfully completes, it will attempt to synchronously complete its\n * counterpart with the same value. This will succeed barring a race with cancellation.\n *\n * When either promise completes with an Exception, it will attempt to synchronously complete its\n * counterpart with the same Exception. This will succeed barring a race with cancellation.\n *\n * Cancellation is propagated bidirectionally.\n *\n * When the returned [Future] is successfully cancelled - meaning [Future.cancel] returned true -\n * [Deferred.cancel] will be synchronously called on `this` [Deferred]. This will attempt to cancel\n * the `Deferred`, though cancellation may not succeed and the `Deferred` may complete in a\n * non-cancelled terminal state.\n *\n * When `this` `Deferred` reaches its \"cancelled\" state with a successful cancellation - meaning it\n * completes with [kotlinx.coroutines.CancellationException] - `this` `Deferred` will synchronously\n * cancel the returned `Future`. This can only race with cancellation of the returned `Future`, so\n * the returned `Future` will always _eventually_ reach its cancelled state when either promise is\n * successfully cancelled, for their different meanings of \"successfully cancelled\".\n *\n * This is inherently a race. See [Future.cancel] for a description of `Future` cancellation\n * semantics. See [Job] for a description of coroutine cancellation semantics. See\n * [JobListenableFuture.cancel] for greater detail on the overlapped cancellation semantics and\n * corner cases of this method.\n */"} {"signature":"public suspend fun < T > ListenableFuture < T > . await ( ) : T","body":"{ try { if ( isDone ) return Uninterruptibles . getUninterruptibly ( this ) } catch ( e : ExecutionException ) { throw e . nonNullCause ( ) } return suspendCancellableCoroutine { cont : CancellableContinuation < T > -> addListener ( ToContinuation ( this , cont ) , MoreExecutors . directExecutor ( ) ) cont . invokeOnCancellation { cancel ( false ) } } }","docstring":"/**\n * Awaits completion of `this` [ListenableFuture] without blocking a thread.\n *\n * This suspend function is cancellable.\n *\n * If the [Job] of the current coroutine is cancelled while this suspending function is waiting, this function\n * stops waiting for the future and immediately resumes with [CancellationException][kotlinx.coroutines.CancellationException].\n *\n * This method is intended to be used with one-shot Futures, so on coroutine cancellation, the Future is cancelled as well.\n * If cancelling the given future is undesired, use [Futures.nonCancellationPropagating] or\n * [kotlinx.coroutines.NonCancellable].\n */"} {"signature":"fun complete ( result : T ) : Boolean","body":"= auxFuture . set ( result )","docstring":"/**\n * When the attached coroutine [isCompleted][Job.isCompleted] successfully\n * its outcome should be passed to this method.\n *\n * This should succeed barring a race with external cancellation.\n */"} {"signature":"fun completeExceptionallyOrCancel ( t : Throwable ) : Boolean","body":"= if ( t is CancellationException ) auxFuture . set ( Cancelled ( t ) ) else auxFuture . setException ( t ) . also { if ( it ) auxFutureIsFailed = true }","docstring":"/**\n * When the attached coroutine [isCompleted][Job.isCompleted] [exceptionally][Job.isCancelled]\n * its outcome should be passed to this method.\n *\n * This method will map coroutine's exception into corresponding Future's exception.\n *\n * This should succeed barring a race with external cancellation.\n */"} {"signature":"override fun isCancelled ( ) : Boolean","body":"{ return auxFuture . isCancelled || isDone && ! auxFutureIsFailed && try { Uninterruptibles . getUninterruptibly ( auxFuture ) is Cancelled } catch ( e : CancellationException ) { true } catch ( e : ExecutionException ) { auxFutureIsFailed = true false } }","docstring":"/**\n * Returns cancellation _in the sense of [Future]_. This is _not_ equivalent to\n * [Job.isCancelled].\n *\n * When done, this Future is cancelled if its [auxFuture] is cancelled, or if [auxFuture]\n * contains [CancellationException].\n *\n * See [cancel].\n */"} {"signature":"override fun get ( ) : T","body":"{ return getInternal ( auxFuture . get ( ) ) }","docstring":"/**\n * Waits for [auxFuture] to complete by blocking, then uses its `result`\n * to get the `T` value `this` [ListenableFuture] is pointing to or throw a [CancellationException].\n * This establishes happens-after ordering for completion of the entangled coroutine.\n *\n * [SettableFuture.get] can only throw [CancellationException] if it was cancelled externally.\n * Otherwise it returns [Cancelled] that encapsulates outcome of the entangled coroutine.\n *\n * [auxFuture] _must be complete_ in order for the [isDone] and [isCancelled] happens-after\n * contract of [Future] to be correctly followed.\n */"} {"signature":"override fun get ( timeout : Long , unit : TimeUnit ) : T","body":"{ return getInternal ( auxFuture . get ( timeout , unit ) ) }","docstring":"/** See [get()]. */"} {"signature":"private fun getInternal ( result : Any ? ) : T","body":"= if ( result is Cancelled ) { throw CancellationException ( ) . initCause ( result . exception ) } else { @ Suppress ( \"\" ) result as T }","docstring":"/** See [get()]. */"} {"signature":"override fun cancel ( mayInterruptIfRunning : Boolean ) : Boolean","body":"{ return if ( auxFuture . cancel ( mayInterruptIfRunning ) ) { jobToCancel . cancel ( ) true } else { false } }","docstring":"/**\n * Tries to cancel [jobToCancel] if `this` future was cancelled. This is fundamentally racy.\n *\n * The call to `cancel()` will try to cancel [auxFuture]: if and only if cancellation of [auxFuture]\n * succeeds, [jobToCancel] will have its [Job.cancel] called.\n *\n * This arrangement means that [jobToCancel] _might not successfully cancel_, if the race resolves\n * in a particular way. [jobToCancel] may also be in its \"cancelling\" state while this\n * ListenableFuture is complete and cancelled.\n */"} {"signature":"fun resolveWithDependencies ( unresolvedLibraries : List < UnresolvedLibrary > , noStdLib : Boolean = false , noDefaultLibs : Boolean = false , noEndorsedLibs : Boolean = false , ) : KotlinLibraryResolveResult","body":"= resolveWithoutDependencies ( unresolvedLibraries , noStdLib , noDefaultLibs , noEndorsedLibs ) . resolveDependencies ( )","docstring":"/**\n * Given the list of Kotlin/Native library names, ABI version and other parameters\n * resolves libraries and evaluates dependencies between them.\n */"} {"signature":"@ JvmStatic fun disposeApplicationEnvironment ( )","body":"{ synchronized ( APPLICATION_LOCK ) { val environment = ourApplicationEnvironment ? : return ourApplicationEnvironment = null Disposer . dispose ( environment . parentDisposable ) resetApplicationManager ( environment . application ) ZipHandler . clearFileAccessorCache ( ) } }","docstring":"/**\n * This method is also used in Gradle after configuration phase finished.\n */"} {"signature":"@ JvmStatic fun resetApplicationManager ( applicationToReset : Application ? = null )","body":"{ val currentApplication = ApplicationManager . getApplication ( ) ? : return if ( applicationToReset != null && applicationToReset != currentApplication ) { return } try { val ourApplicationField = ApplicationManager :: class . java . getDeclaredField ( \"\" ) ourApplicationField . isAccessible = true ourApplicationField . set ( null , null ) } catch ( exception : Exception ) { if ( currentApplication . isUnitTestMode ) { throw exception } } }","docstring":"/**\n * Resets the application managed by [ApplicationManager] to `null`. If [applicationToReset] is specified, [resetApplicationManager]\n * will only reset the application if it's the expected one. Otherwise, the application will already have been changed to another\n * application. For example, application disposal can trigger one of the disposables registered via\n * [ApplicationManager.setApplication], which reset the managed application to the previous application.\n */"} {"signature":"fun IrType . unboxInlineClass ( )","body":"= InlineClassAbi . unboxType ( this ) ? : this","docstring":"/**\n * Replace inline classes by their underlying types.\n */"} {"signature":"fun unboxType ( type : IrType ) : IrType ?","body":"{ val klass = type . classOrNull ? . owner ? : return null val representation = klass . inlineClassRepresentation ? : return null var underlyingType = representation . underlyingType . unboxInlineClass ( ) if ( ! underlyingType . isNullable ( ) && underlyingType . isTypeParameter ( ) ) { underlyingType = underlyingType . erasedUpperBound . defaultType } if ( ! type . isNullable ( ) ) return underlyingType if ( underlyingType . isNullable ( ) || underlyingType . isPrimitiveType ( ) ) return null return underlyingType . makeNullable ( ) }","docstring":"/**\n * Unwraps inline class types to their underlying representation.\n * Returns null if the type cannot be unboxed.\n */"} {"signature":"fun mangledNameFor ( context : JvmBackendContext , irFunction : IrFunction , mangleReturnTypes : Boolean , useOldMangleRules : Boolean ) : Name","body":"{ if ( irFunction is IrConstructor ) { assert ( irFunction . constructedClass . isValue ) { \"\" } return Name . identifier ( \"\" ) } if ( irFunction . isAlreadyMangledMfvcFunction ( context ) ) { return irFunction . name } val suffix = hashSuffix ( irFunction , mangleReturnTypes , useOldMangleRules ) if ( suffix == null && ( ( irFunction . parent as? IrClass ) ? . isValue != true || irFunction . origin == IrDeclarationOrigin . IR_BUILTINS_STUB ) ) { return irFunction . name } val base = when { irFunction . isGetter -> JvmAbi . getterName ( irFunction . propertyName . asString ( ) ) irFunction . isSetter -> JvmAbi . setterName ( irFunction . propertyName . asString ( ) ) irFunction . name . isSpecial -> error ( \"\" ) else -> irFunction . name . asString ( ) } return Name . identifier ( \"\" ) }","docstring":"/**\n * Returns a mangled name for a function taking inline class arguments\n * to avoid clashes between overloaded methods.\n */"} {"signature":"fun accepts ( value : Any ? , fieldInfo : FieldInfo , ) : Boolean","body":"fun accepts ( value : Any ? , fieldInfo : FieldInfo , ) : Boolean","docstring":"/**\n * Tells if this handler accepts the given property\n * Called for each variable in the cells executed by users,\n * except those names are starting from [TEMP_PROPERTY_PREFIX]\n * or those that have been already consumed by another handler\n *\n * @param value Property value\n * @param fieldInfo Property runtime information\n */"} {"signature":"@ InternalCoroutinesApi public operator fun < R , T > invoke ( block : suspend R . ( ) -> T , receiver : R , completion : Continuation < T > ) : Unit","body":"= when ( this ) { DEFAULT -> block . startCoroutineCancellable ( receiver , completion ) ATOMIC -> block . startCoroutine ( receiver , completion ) UNDISPATCHED -> block . startCoroutineUndispatched ( receiver , completion ) LAZY -> Unit }","docstring":"/**\n * Starts the corresponding block with receiver as a coroutine with this coroutine start strategy.\n *\n * - [DEFAULT] uses [startCoroutineCancellable].\n * - [ATOMIC] uses [startCoroutine].\n * - [UNDISPATCHED] uses [startCoroutineUndispatched].\n * - [LAZY] does nothing.\n *\n * @suppress **This an internal API and should not be used from general code.**\n */"} {"signature":"public fun KtSymbolWithMembers . getMemberScope ( ) : KtScope","body":"= withValidityAssertion { analysisSession . scopeProvider . getMemberScope ( this ) }","docstring":"/**\n * Returns a [KtScope] containing *non-static* callable members (functions, properties, and constructors) and all classifier members\n * (classes and objects) of the given [KtSymbolWithMembers]. The scope includes members inherited from the symbol's supertypes, in\n * addition to members which are declared explicitly inside the symbol's body.\n *\n * The member scope doesn't include synthetic Java properties. To get such properties, use [getSyntheticJavaPropertiesScope].\n *\n * @see getStaticMemberScope\n */"} {"signature":"public fun KtSymbolWithMembers . getStaticMemberScope ( ) : KtScope","body":"= withValidityAssertion { analysisSession . scopeProvider . getStaticMemberScope ( this ) }","docstring":"/**\n * Returns a [KtScope] containing the *static* members of the given [KtSymbolWithMembers].\n *\n * The behavior of the scope differs based on whether the given [KtSymbolWithMembers] is a Kotlin or Java class:\n *\n * - **Kotlin class:** The scope contains static callables (functions and properties) and classifiers (classes and objects) declared\n * directly in the [KtSymbolWithMembers]. Hence, the static member scope for Kotlin classes is equivalent to [getDeclaredMemberScope].\n * - **Java class:** The scope contains static callables (functions and properties) declared in the [KtSymbolWithMembers] or any of its\n * superclasses (excluding static callables from super-interfaces), and classes declared directly in the [KtSymbolWithMembers]. This\n * follows Kotlin's rules about static inheritance in Java classes, where static callables are propagated from superclasses, but\n * nested classes are not.\n *\n * #### Kotlin Example\n *\n * ```kotlin\n * abstract class A {\n * class C1\n * inner class D1\n * object O1\n *\n * // There is no way to declare a static callable in an abstract class, as only enum classes define additional static callables.\n * }\n *\n * class B : A() {\n * class C2\n * inner class D2\n * object O2\n * companion object {\n * val baz: String = \"\"\n * }\n * }\n * ```\n *\n * The static member scope of `B` contains the following symbols:\n *\n * ```\n * class C2\n * inner class D2\n * object O2\n * companion object\n * ```\n *\n * #### Java Example\n *\n * ```java\n * // SuperInterface.java\n * public interface SuperInterface {\n * public static void fromSuperInterface() { }\n * }\n *\n * // SuperClass.java\n * public abstract class SuperClass implements SuperInterface {\n * static class NestedSuperClass { }\n * class InnerSuperClass { }\n * public static void fromSuperClass() { }\n * }\n *\n * // FILE: JavaClass.java\n * public class JavaClass extends SuperClass {\n * static class NestedClass { }\n * class InnerClass { }\n * public static void fromJavaClass() { }\n * }\n * ```\n *\n * The static member scope of `JavaClass` contains the following symbols:\n *\n * ```\n * public static void fromSuperClass()\n * public static void fromJavaClass()\n * static class NestedClass\n * class InnerClass\n * ```\n *\n * @see getMemberScope\n */"} {"signature":"public fun KtSymbolWithMembers . getCombinedMemberScope ( ) : KtScope","body":"= withValidityAssertion { analysisSession . scopeProvider . getCombinedMemberScope ( this ) }","docstring":"/**\n * Returns a [KtScope] containing all members from [getMemberScope] and [getStaticMemberScope].\n */"} {"signature":"public fun KtSymbolWithMembers . getDeclaredMemberScope ( ) : KtScope","body":"= withValidityAssertion { analysisSession . scopeProvider . getDeclaredMemberScope ( this ) }","docstring":"/**\n * Returns a [KtScope] containing the *non-static* callables (functions, properties, and constructors) and inner classes explicitly\n * declared in the given [KtSymbolWithMembers].\n *\n * The declared member scope does not contain classifiers (including the companion object) except for inner classes. To retrieve the\n * classifiers declared in this [KtSymbolWithMembers], please use the *static* declared member scope provided by\n * [getStaticDeclaredMemberScope].\n *\n * @see getStaticDeclaredMemberScope\n */"} {"signature":"public fun KtSymbolWithMembers . getStaticDeclaredMemberScope ( ) : KtScope","body":"= withValidityAssertion { analysisSession . scopeProvider . getStaticDeclaredMemberScope ( this ) }","docstring":"/**\n * Returns a [KtScope] containing the *static* callables (functions and properties) and all classifiers (classes and objects) explicitly\n * declared in the given [KtSymbolWithMembers].\n *\n * It is worth noting that, while Java classes may contain declarations of static callables freely, in Kotlin only enum classes define\n * static callables. Hence, for non-enum Kotlin classes, it is not expected that the static declared member scope will contain any\n * callables.\n *\n * @see getDeclaredMemberScope\n */"} {"signature":"public fun KtSymbolWithMembers . getCombinedDeclaredMemberScope ( ) : KtScope","body":"= withValidityAssertion { analysisSession . scopeProvider . getCombinedDeclaredMemberScope ( this ) }","docstring":"/**\n * Returns a [KtScope] containing *all* members explicitly declared in the given [KtSymbolWithMembers].\n *\n * In contrast to [getDeclaredMemberScope] and [getStaticDeclaredMemberScope], this scope contains both static and non-static members.\n */"} {"signature":"public fun KtType . getTypeScope ( ) : KtTypeScope ?","body":"= withValidityAssertion { analysisSession . scopeProvider . getTypeScope ( this ) }","docstring":"/**\n * Return a [KtTypeScope] for a given [KtType].\n * The type scope will include all members which are declared and callable on a given type.\n *\n * Comparing to the [KtScope], in the [KtTypeScope] all use-site type parameters are substituted.\n *\n * Consider the following code\n * ```\n * fun foo(list: List) {\n * list // get KtTypeScope for it\n * }\n *```\n *\n * Inside the `LIST_KT_ELEMENT.getKtType().getTypeScope()` would contain the `get(i: Int): String` method with substituted type `T = String`\n *\n * @return type scope for the given type if given `KtType` is not error type, `null` otherwise.\n * Returned [KtTypeScope] includes synthetic Java properties.\n *\n * @see KtTypeScope\n * @see KtTypeProviderMixIn.getKtType\n */"} {"signature":"public fun KtType . getSyntheticJavaPropertiesScope ( ) : KtTypeScope ?","body":"= withValidityAssertion { analysisSession . scopeProvider . getSyntheticJavaPropertiesScope ( this ) }","docstring":"/**\n * Returns a [KtTypeScope] with synthetic Java properties created for a given [KtType].\n */"} {"signature":"public fun KtFile . getScopeContextForPosition ( positionInFakeFile : KtElement ) : KtScopeContext","body":"= withValidityAssertion { analysisSession . scopeProvider . getScopeContextForPosition ( this , positionInFakeFile ) }","docstring":"/**\n * For each scope in [KtScopeContext] an index is calculated. The indexes are relative to position, and they are only known for\n * scopes obtained with [getScopeContextForPosition].\n *\n * Scopes with [KtScopeKind.TypeScope] include synthetic Java properties.\n */"} {"signature":"public fun KtFile . getImportingScopeContext ( ) : KtScopeContext","body":"= withValidityAssertion { analysisSession . scopeProvider . getImportingScopeContext ( this ) }","docstring":"/**\n * Returns a [KtScopeContext] formed by all imports in the [KtFile].\n *\n * By default, this will also include default importing scopes, which can be filtered by [KtScopeKind]\n */"} {"signature":"public fun KtScopeContext . getCompositeScope ( filter : ( KtScopeKind ) -> Boolean = { true } ) : KtScope","body":"= withValidityAssertion { val subScopes = scopes . filter { filter ( it . kind ) } . map { it . scope } subScopes . asCompositeScope ( ) }","docstring":"/**\n * Returns single scope, containing declarations from all scopes that satisfy [filter]. The order of declarations corresponds to the\n * order of their containing scopes, which are sorted according to their indexes in scope tower.\n */"} {"signature":"public fun KtSymbol . getContainingSymbol ( ) : KtDeclarationSymbol ?","body":"= withValidityAssertion { analysisSession . containingDeclarationProvider . getContainingDeclaration ( this ) }","docstring":"/**\n * Returns containing declaration for symbol:\n * for top-level declarations returns null\n * for class members returns containing class\n * for local declaration returns declaration it was declared it\n */"} {"signature":"public fun KtSymbol . getContainingFileSymbol ( ) : KtFileSymbol ?","body":"= withValidityAssertion { analysisSession . containingDeclarationProvider . getContainingFileSymbol ( this ) }","docstring":"/**\n * Returns containing [KtFile] as [KtFileSymbol]\n *\n * Caveat: returns `null` if the given symbol is already [KtFileSymbol], since there is no containing file.\n * Similarly, no containing file for libraries and Java, hence `null`.\n */"} {"signature":"public fun KtCallableSymbol . getContainingJvmClassName ( ) : String ?","body":"= withValidityAssertion { analysisSession . containingDeclarationProvider . getContainingJvmClassName ( this ) }","docstring":"/**\n * Returns containing JVM class name for [KtCallableSymbol]\n *\n * even for deserialized callables! (which is useful to look up the containing facade in [PsiElement])\n * for regular, non-local callables from source, it is a mere conversion of [ClassId] inside [CallableId]\n *\n * The returned JVM class name is of fully qualified name format, e.g., foo.bar.Baz.Companion\n *\n * Note that this API is applicable for common or JVM modules only, and returns `null` for non-JVM modules.\n */"} {"signature":"private fun mapArgument ( arg : IrExpression ) : Pair < IrExpression , IrVariable >","body":"{ var saveToTmp = arg var rootIntrinsicCall : IrCall ? = null var lastIntrinsicCall : IrCall ? = null while ( saveToTmp is IrCall && ( saveToTmp . symbol == boxIntrinsic || saveToTmp . symbol == unboxIntrinsic ) ) { if ( lastIntrinsicCall == null ) { lastIntrinsicCall = JsIrBuilder . buildCall ( saveToTmp . symbol , saveToTmp . type , saveToTmp . typeArguments . filterNotNull ( ) ) rootIntrinsicCall = lastIntrinsicCall } else { val nextCall = JsIrBuilder . buildCall ( saveToTmp . symbol , saveToTmp . type , saveToTmp . typeArguments . filterNotNull ( ) ) lastIntrinsicCall . putValueArgument ( , nextCall ) lastIntrinsicCall = nextCall } saveToTmp = saveToTmp . getValueArgument ( ) ? : error ( \"\" ) } val irTempVar = makeTempVar ( saveToTmp . type , saveToTmp ) val irGetTempVar = JsIrBuilder . buildGetValue ( irTempVar . symbol ) val newArg = lastIntrinsicCall ? . let { it . putValueArgument ( , irGetTempVar ) rootIntrinsicCall } ? : irGetTempVar return newArg to irTempVar }","docstring":"/**\n * Move the passing argument and store it in a temporary variable.\n * However, the box and unbox intrinsics should be preserved in the call.\n * They can be used later for optimizations, for example, in [EqualityAndComparisonCallsTransformer].\n * Example:\n * foo(boxIntrinsic())\n * should be transformed to:\n * var tmp = \n * foo(boxIntrinsic(tmp))\n */"} {"signature":"private fun resolveExpressionOrNull ( expression : IrElement ? ) : InferenceNode ?","body":"= when ( expression ) { is IrGetValue -> inferenceParameterOrNull ( expression ) ? : variableDeclarations [ expression . symbol ] is IrCall -> variableDeclarations [ expression . symbol ] else -> null }","docstring":"/**\n * Resolve references to local variables and parameters.\n */"} {"signature":"open fun recordScheme ( scheme : Scheme )","body":"{ }","docstring":"/**\n * Record a scheme for the function in metrics (if applicable).\n */"} {"signature":"abstract fun updateScheme ( scheme : Scheme )","body":"abstract fun updateScheme ( scheme : Scheme )","docstring":"/**\n * The scheme has changed so the corresponding attributes should be updated to match the\n * scheme provided.\n */"} {"signature":"abstract fun toDeclaredScheme ( defaultTarget : Item = Open ( ) ) : Scheme","body":"abstract fun toDeclaredScheme ( defaultTarget : Item = Open ( ) ) : Scheme","docstring":"/**\n * Return a declared scheme for the function.\n */"} {"signature":"open fun isOverlyWide ( ) : Boolean","body":"= false","docstring":"/**\n * Return true if this is a type with overly wide parameter types such as Any or\n * unconstrained or insufficiently constrained type parameters.\n */"} {"signature":"open fun parameterIndex ( node : InferenceNode ) : Int","body":"= - ","docstring":"/**\n * [node] is one of the parameters of this container node then return its index. -1 indicates\n * that [node] is not a parameter of this container (or this is not a container).\n */"} {"signature":"open fun isOverlyWide ( ) : Boolean","body":"= function ? . isOverlyWide ( ) == true","docstring":"/**\n * Return true if this is a type with overly wide parameter types such as Any or\n * unconstrained or insufficiently constrained type parameters.\n */"} {"signature":"private fun IrFunction . hasOverlyWideParameters ( ) : Boolean","body":"= valueParameters . any { it . type . isAny ( ) || it . type . isNullableAny ( ) }","docstring":"/**\n * A function with overly wide parameters should be ignored for traversal as well as when\n * it is called.\n */"} {"signature":"public fun PageContentBuilder . DocumentableContentBuilder . parametersBlock ( function : DFunction , paramBuilder : PageContentBuilder . DocumentableContentBuilder . ( DParameter ) -> Unit )","body":"{ group ( kind = SymbolContentKind . Parameters , styles = emptySet ( ) ) { function . parameters . dropLast ( ) . forEach { group ( kind = SymbolContentKind . Parameter ) { paramBuilder ( it ) punctuation ( \"\" ) } } group ( kind = SymbolContentKind . Parameter ) { paramBuilder ( function . parameters . last ( ) ) } } }","docstring":"/**\n * Builds a distinguishable [function] parameters block, so that it\n * can be processed or custom rendered down the road.\n *\n * Resulting structure:\n * ```\n * SymbolContentKind.Parameters(style = wrapped) {\n * SymbolContentKind.Parameter(style = indented) { param, }\n * SymbolContentKind.Parameter(style = indented) { param, }\n * SymbolContentKind.Parameter(style = indented) { param }\n * }\n * ```\n * Wrapping and indentation of parameters is applied conditionally, see [shouldWrapParams]\n */"} {"signature":"internal fun MutableMap < String , Any > . toBufferedImage ( scale : Number = , dpi : Number ? = null ) : BufferedImage","body":"{ val byteArray = PlotImageExport . buildImageFromRawSpecs ( this , PlotImageExport . Format . PNG , scale . toDouble ( ) , dpi ? . toDouble ( ) ? : Double . NaN ) . bytes return ImageIO . read ( ByteArrayInputStream ( byteArray ) ) }","docstring":"/**\n * Convert plot spec to `BufferedImage`\n *\n * @receiver the plot spec represented as `MutableMap`\n */"} {"signature":"public fun Plot . toBufferedImage ( scale : Number = , dpi : Number ? = null , ) : BufferedImage","body":"= this . toLetsPlot ( ) . toSpec ( ) . toBufferedImage ( scale , dpi )","docstring":"/**\n * Exports the current plot as a [BufferedImage].\n *\n * The parameters [scale] and [dpi] influence the quality and size of the rasterized image.\n *\n * @receiver [Plot] - the plot to export.\n * @param scale the scaling is applied to the plot when converting to a raster format (PNG).\n * It affects the resolution and size of the resulting [BufferedImage].\n * The default value is 1.\n * @param dpi the resolution of the exported image in dots per inch (DPI).\n * This parameter influences the quality of the rasterized image, with a higher value resulting in better quality.\n * By default, no specific DPI value is assigned, and it utilizes the system's default settings.\n * @return [BufferedImage] the created image representing the plot.\n */"} {"signature":"public fun Plot . toJPG ( scale : Number = , dpi : Number ? = null , ) : ByteArray","body":"{ val bufferedImage = this . toLetsPlot ( ) . toSpec ( ) . toBufferedImage ( scale , dpi ) val outputStream = ByteArrayOutputStream ( ) ImageIO . write ( bufferedImage , \"\" , outputStream ) return outputStream . toByteArray ( ) }","docstring":"/**\n * Exports the current plot grid as a [ByteArray] in the JPG format.\n *\n * The parameters [scale] and [dpi] influence the quality and size of the rasterized image.\n *\n * @receiver [Plot] - the plot grid to export.\n * @param scale the scaling is applied to the plot when converting to a raster format (PNG).\n * It affects the resolution and size of the resulting [BufferedImage].\n * The default value is 1.\n * @param dpi the resolution of the exported image in dots per inch (DPI).\n * This parameter influences the quality of the rasterized image, with a higher value resulting in better quality.\n * By default, no specific DPI value is assigned, and it utilizes the system's default settings.\n * @return [ByteArray] the created image representing the plot grid.\n */"} {"signature":"public fun Plot . toPNG ( scale : Number = , dpi : Number ? = null , ) : ByteArray","body":"{ val bufferedImage = this . toLetsPlot ( ) . toSpec ( ) . toBufferedImage ( scale , dpi ) val outputStream = ByteArrayOutputStream ( ) ImageIO . write ( bufferedImage , \"\" , outputStream ) return outputStream . toByteArray ( ) }","docstring":"/**\n * Exports the current plot grid as a [ByteArray] in the PNG format.\n *\n * The parameters [scale] and [dpi] influence the quality and size of the rasterized image.\n *\n * @receiver [Plot] - the plot grid to export.\n * @param scale the scaling is applied to the plot when converting to a raster format (PNG).\n * It affects the resolution and size of the resulting [BufferedImage].\n * The default value is 1.\n * @param dpi the resolution of the exported image in dots per inch (DPI).\n * This parameter influences the quality of the rasterized image, with a higher value resulting in better quality.\n * By default, no specific DPI value is assigned, and it utilizes the system's default settings.\n * @return [ByteArray] the created image representing the plot grid.\n */"} {"signature":"public fun PlotGrid . toBufferedImage ( scale : Number = , dpi : Number ? = null , ) : BufferedImage","body":"= this . wrap ( ) . toSpec ( ) . toBufferedImage ( scale , dpi )","docstring":"/**\n * Exports the current plot grid as a [BufferedImage].\n *\n * The parameters [scale] and [dpi] influence the quality and size of the rasterized image.\n *\n * @receiver [PlotGrid] - the plot grid to export.\n * @param scale the scaling is applied to the plot when converting to a raster format (PNG).\n * It affects the resolution and size of the resulting [BufferedImage].\n * The default value is 1.\n * @param dpi the resolution of the exported image in dots per inch (DPI).\n * This parameter influences the quality of the rasterized image, with a higher value resulting in better quality.\n * By default, no specific DPI value is assigned, and it utilizes the system's default settings.\n * @return [BufferedImage] the created image representing the plot grid.\n */"} {"signature":"public fun PlotGrid . toJPG ( scale : Number = , dpi : Number ? = null , ) : ByteArray","body":"{ val bufferedImage = this . wrap ( ) . toSpec ( ) . toBufferedImage ( scale , dpi ) val outputStream = ByteArrayOutputStream ( ) ImageIO . write ( bufferedImage , \"\" , outputStream ) return outputStream . toByteArray ( ) }","docstring":"/**\n * Exports the current plot grid as a [ByteArray] in the JPG format.\n *\n * The parameters [scale] and [dpi] influence the quality and size of the rasterized image.\n *\n * @receiver [PlotGrid] - the plot grid to export.\n * @param scale the scaling is applied to the plot when converting to a raster format (PNG).\n * It affects the resolution and size of the resulting [BufferedImage].\n * The default value is 1.\n * @param dpi the resolution of the exported image in dots per inch (DPI).\n * This parameter influences the quality of the rasterized image, with a higher value resulting in better quality.\n * By default, no specific DPI value is assigned, and it utilizes the system's default settings.\n * @return [ByteArray] the created image representing the plot grid.\n */"} {"signature":"public fun PlotGrid . toPNG ( scale : Number = , dpi : Number ? = null , ) : ByteArray","body":"{ val bufferedImage = this . wrap ( ) . toSpec ( ) . toBufferedImage ( scale , dpi ) val outputStream = ByteArrayOutputStream ( ) ImageIO . write ( bufferedImage , \"\" , outputStream ) return outputStream . toByteArray ( ) }","docstring":"/**\n * Exports the current plot grid as a [ByteArray] in the PNG format.\n *\n * The parameters [scale] and [dpi] influence the quality and size of the rasterized image.\n *\n * @receiver [PlotGrid] - the plot grid to export.\n * @param scale the scaling is applied to the plot when converting to a raster format (PNG).\n * It affects the resolution and size of the resulting [BufferedImage].\n * The default value is 1.\n * @param dpi the resolution of the exported image in dots per inch (DPI).\n * This parameter influences the quality of the rasterized image, with a higher value resulting in better quality.\n * By default, no specific DPI value is assigned, and it utilizes the system's default settings.\n * @return [ByteArray] the created image representing the plot grid.\n */"} {"signature":"public fun PlotBunch . toBufferedImage ( scale : Number = , dpi : Number ? = null , ) : BufferedImage","body":"= this . wrap ( ) . toSpec ( ) . toBufferedImage ( scale , dpi )","docstring":"/**\n * Exports the current plot bunch as a [BufferedImage].\n *\n * The parameters [scale] and [dpi] influence the quality and size of the rasterized image.\n *\n * @receiver [PlotBunch] - the plot bunch to export.\n * @param scale the scaling is applied to the plot when converting to a raster format (PNG).\n * It affects the resolution and size of the resulting [BufferedImage].\n * The default value is 1.\n * @param dpi the resolution of the exported image in dots per inch (DPI).\n * This parameter influences the quality of the rasterized image, with a higher value resulting in better quality.\n * By default, no specific DPI value is assigned, and it utilizes the system's default settings.\n * @return [BufferedImage] the created image representing the plot bunch.\n */"} {"signature":"public fun PlotBunch . toJPG ( scale : Number = , dpi : Number ? = null , ) : ByteArray","body":"{ val bufferedImage = this . wrap ( ) . toSpec ( ) . toBufferedImage ( scale , dpi ) val outputStream = ByteArrayOutputStream ( ) ImageIO . write ( bufferedImage , \"\" , outputStream ) return outputStream . toByteArray ( ) }","docstring":"/**\n * Exports the current plot grid as a [ByteArray] in the JPG format.\n *\n * The parameters [scale] and [dpi] influence the quality and size of the rasterized image.\n *\n * @receiver [PlotBunch] - the plot grid to export.\n * @param scale the scaling is applied to the plot when converting to a raster format (PNG).\n * It affects the resolution and size of the resulting [BufferedImage].\n * The default value is 1.\n * @param dpi the resolution of the exported image in dots per inch (DPI).\n * This parameter influences the quality of the rasterized image, with a higher value resulting in better quality.\n * By default, no specific DPI value is assigned, and it utilizes the system's default settings.\n * @return [ByteArray] the created image representing the plot grid.\n */"} {"signature":"public fun PlotBunch . toPNG ( scale : Number = , dpi : Number ? = null , ) : ByteArray","body":"{ val bufferedImage = this . wrap ( ) . toSpec ( ) . toBufferedImage ( scale , dpi ) val outputStream = ByteArrayOutputStream ( ) ImageIO . write ( bufferedImage , \"\" , outputStream ) return outputStream . toByteArray ( ) }","docstring":"/**\n * Exports the current plot grid as a [ByteArray] in the PNG format.\n *\n * The parameters [scale] and [dpi] influence the quality and size of the rasterized image.\n *\n * @receiver [PlotBunch] - the plot grid to export.\n * @param scale the scaling is applied to the plot when converting to a raster format (PNG).\n * It affects the resolution and size of the resulting [BufferedImage].\n * The default value is 1.\n * @param dpi the resolution of the exported image in dots per inch (DPI).\n * This parameter influences the quality of the rasterized image, with a higher value resulting in better quality.\n * By default, no specific DPI value is assigned, and it utilizes the system's default settings.\n * @return [ByteArray] the created image representing the plot grid.\n */"} {"signature":"@ Test fun testFailWithModulesNotInAnyScope ( )","body":"= parametrizedTest { mode -> val json = Json { serializersModule = BaseAndDerivedModule } checkNotRegisteredMessage ( \"\" , \"\" , assertFailsWith < SerializationException > { json . encodeToString ( MyPolyData . serializer ( ) , MyPolyData ( mapOf ( \"\" to PolyDerived ( \"\" ) ) ) , mode ) } ) }","docstring":"/**\n * This test should fail because PolyDerived registered in the scope of PolyBase, not kotlin.Any\n */"} {"signature":"@ Test fun testFailWithModulesNotInParticularScope ( )","body":"= parametrizedTest { mode -> val json = Json { serializersModule = baseAndDerivedModuleAtAny } checkNotRegisteredMessage ( \"\" , \"\" , assertFailsWith { json . encodeToString ( MyPolyDataWithPolyBase . serializer ( ) , MyPolyDataWithPolyBase ( mapOf ( \"\" to PolyDerived ( \"\" ) ) , PolyDerived ( \"\" ) ) , mode ) } ) }","docstring":"/**\n * This test should fail because PolyDerived registered in the scope of kotlin.Any, not PolyBase\n */"} {"signature":"fun FirConstructorSymbol . getObjCInitMethod ( session : FirSession ) : FirFunctionSymbol < * > ?","body":"{ this . annotations . getAnnotationByClassId ( NativeStandardInteropNames . objCConstructorClassId , session ) ? . let { annotation -> val initSelector : String = annotation . constStringArgument ( \"\" ) val classSymbol = containingClassLookupTag ( ) ? . toSymbol ( session ) as FirClassSymbol < * > val initSelectors = mutableListOf < FirFunctionSymbol < * > > ( ) session . declaredMemberScope ( classSymbol , memberRequiredPhase = null ) . processAllFunctions { if ( it . decodeObjCMethodAnnotation ( session ) ? . selector == initSelector ) initSelectors . add ( it ) } return initSelectors . singleOrNull ( ) ? : error ( \"\" ) } return null }","docstring":"/**\n * mimics ConstructorDescriptor.getObjCInitMethod()\n */"} {"signature":"internal fun List < FirAnnotation > . decodeObjCMethodAnnotation ( session : FirSession ) : ObjCMethodInfo ?","body":"= getAnnotationByClassId ( NativeStandardInteropNames . objCMethodClassId , session ) ? . let { ObjCMethodInfo ( selector = it . constStringArgument ( \"\" ) , encoding = it . constStringArgument ( \"\" ) , isStret = it . constBooleanArgumentOrNull ( \"\" ) ? : false , directSymbol = getAnnotationByClassId ( NativeStandardInteropNames . objCDirectClassId , session ) ? . constStringArgument ( \"\" ) , ) }","docstring":"/**\n * mimics FunctionDescriptor.decodeObjCMethodAnnotation()\n */"} {"signature":"internal fun FirFunction . isObjCClassMethod ( session : FirSession )","body":"= getContainingClass ( session ) . let { it is FirClass && it . symbol . isObjCClass ( session ) }","docstring":"/**\n * almost mimics FunctionDescriptor.isObjCClassMethod(), apart from `it.isObjCClass()` changed to `it.symbol.isObjCClass(session)` for simplicity\n */"} {"signature":"internal fun FirConstructorSymbol . isObjCConstructor ( session : FirSession )","body":"= this . annotations . hasAnnotation ( NativeStandardInteropNames . objCConstructorClassId , session )","docstring":"/**\n * mimics ConstructorDescriptor.isObjCConstructor()\n */"} {"signature":"fun FirClassSymbol < * > . isObjCClass ( session : FirSession )","body":"= classId . packageFqName != NativeStandardInteropNames . cInteropPackage && selfOrAnySuperClass ( session ) { it . classId == NativeStandardInteropNames . objCObjectClassId }","docstring":"/**\n * mimics IrClass.isObjCClass()\n */"}