Diff of autodoc.git/modref.xml (fa45b8db8fc564d648809d474f4c02aaeff17251 » a476a0853f5a8f1d3425a22c692440e737d0fe3c)

autodoc.git/modref.xml:1: <?xml version='1.0' encoding='utf-8'?> - <manual time-stamp='2020-10-28' version='Pike v8.0.1079'> + <manual time-stamp='2020-10-31' version='Pike v8.0.1085'> <dir name='./ignored'> <file name='./ignored/ignored'> <chapter number='1' title='ignored'> <autodoc> <namespace name=''> <doc><text>Symbols implicitly inherited from the virtual base class. These symbols exist mainly to simplify implementation of the corresponding lfuns. </text><group><seealso/><text><ref resolved='lfun::'>lfun::</ref> </text></group></doc>
autodoc.git/modref.xml:2392: </docgroup> </class> <class name='DES3'> <docgroup homogen-name='CBC' homogen-type='inherit'> <inherit name='CBC'><classname resolved='predef::Crypto.CBC'>Crypto.CBC</classname></inherit> </docgroup> </class> <class name='DHKeyExchange'> <doc><text>Implements Diffie-Hellman key-exchange. The following key exchange methods are implemented here: - <ref resolved='predef::SSL.Constants.KeyExchangeType.KE_dhe_dss'>KE_dhe_dss</ref>, <ref resolved='predef::SSL.Constants.KeyExchangeType.KE_dhe_rsa'>KE_dhe_rsa</ref> and <ref resolved='predef::SSL.Constants.KeyExchangeType.KE_dh_anon'>KE_dh_anon</ref>. + <ref resolved='7.8::SSL.Constants.KeyExchangeType.KE_dhe_dss'>KE_dhe_dss</ref>, <ref resolved='7.8::SSL.Constants.KeyExchangeType.KE_dhe_rsa'>KE_dhe_rsa</ref> and <ref resolved='7.8::SSL.Constants.KeyExchangeType.KE_dh_anon'>KE_dh_anon</ref>. </text></doc> <docgroup homogen-name='create' homogen-type='method'> <method name='create'><modifiers><protected/></modifiers> <arguments><argument name='p'><type><object resolved='7.8::SSL.Cipher.DHParameters'>DHParameters</object></type></argument></arguments> <returntype><void/></returntype> </method> </docgroup> </class> <class name='DHParameters'> <doc><text>Diffie-Hellman parameters.
autodoc.git/modref.xml:3176: <variable name='rsa'><type><object resolved='7.8::Crypto.RSA'>Crypto.RSA</object></type></variable> </docgroup> <docgroup homogen-name='set_cipher_suite' homogen-type='method'><doc><text>Sets the proper authentication method and cipher specification for the given cipher <ref resolved='7.8::SSL.session.set_cipher_suite.suite'>suite</ref> and <ref>verison</ref>. </text></doc> <method name='set_cipher_suite'> <arguments><argument name='suite'><type><int/></type></argument><argument name='version'><type><or><object resolved='7.8::SSL.Constants.ProtocolVersion'>ProtocolVersion</object><int/></or></type></argument></arguments> <returntype><void/></returntype> </method> </docgroup> - <docgroup homogen-name='set_compression_method' homogen-type='method'><doc><text>Sets the compression method. Currently only <ref resolved='predef::SSL.Constants.CompressionType.COMPRESSION_null'>COMPRESSION_null</ref> is + <docgroup homogen-name='set_compression_method' homogen-type='method'><doc><text>Sets the compression method. Currently only <ref resolved='7.8::SSL.Constants.CompressionType.COMPRESSION_null'>COMPRESSION_null</ref> is supported. </text></doc> <method name='set_compression_method'> <arguments><argument name='compr'><type><int/></type></argument></arguments> <returntype><void/></returntype> </method> </docgroup> </class> <class name='sslfile'> <doc><text>Interface similar to <ref resolved='7.8::Stdio.File'>Stdio.File</ref>.
autodoc.git/modref.xml:9751: <code><text>map(<ref resolved='predef::rows.index'>index</ref>, lambda(mixed x) { return <ref resolved='predef::rows.data'>data</ref>[x]; }) </text></code>That is, it indices data on every index in the array index and returns an array with the results. </text><group><seealso/><text><ref resolved='predef::column'>column()</ref> </text></group></doc> <method name='rows'> <arguments><argument name='data'><type><mixed/></type></argument><argument name='index'><type><array/></type></argument></arguments> <returntype><array/></returntype> </method> </docgroup> - <docgroup homogen-name='search' homogen-type='method'><doc><text>Search for <ref resolved='predef::search.needle'>needle</ref> in <ref resolved='predef::search.haystack'>haystack</ref>. Return the position of <ref resolved='predef::search.needle'>needle</ref> in - <ref resolved='predef::search.haystack'>haystack</ref> or <expr>-1</expr> if not found. - If the optional argument <ref resolved='predef::search.start'>start</ref> is present search is started at - this position. - <mixed name='haystack'><group><type><string/></type><text>When <ref resolved='predef::search.haystack'>haystack</ref> is a string <ref resolved='predef::search.needle'>needle</ref> must be a string or an int, + <docgroup homogen-name='search' homogen-type='method'><doc><text>Search for <ref resolved='predef::search.needle'>needle</ref> in <ref resolved='predef::search.haystack'>haystack</ref>. + </text><group><param name='haystack'/><text>Item to search in. This can be one of: + <mixed><group><type><string/></type><text>When <ref resolved='predef::search.haystack'>haystack</ref> is a string <ref resolved='predef::search.needle'>needle</ref> must be a string or an int, and the first occurrence of the string or int is returned. </text></group><group><type><array/></type><text>When <ref resolved='predef::search.haystack'>haystack</ref> is an array, <ref resolved='predef::search.needle'>needle</ref> is compared only to one value at a time in <ref resolved='predef::search.haystack'>haystack</ref>. </text></group><group><type><mapping/></type><text>When <ref resolved='predef::search.haystack'>haystack</ref> is a mapping, <ref resolved='predef::search'>search()</ref> tries to find the index connected to the data <ref resolved='predef::search.needle'>needle</ref>. That is, it tries to lookup the - mapping backwards. If <ref resolved='predef::search.needle'>needle</ref> isn't present in the mapping, zero - is returned, and zero_type() will return 1 for this zero. + mapping backwards. </text></group><group><type><object resolved='predef::search'/></type><text>When <ref resolved='predef::search.haystack'>haystack</ref> is an object implementing <ref resolved='lfun::_search'>lfun::_search()</ref>, - the result of calling <ref resolved='lfun::_search'>lfun::_search()</ref> with <ref resolved='predef::search.needle'>needle</ref> will - be returned. + the result of calling <ref resolved='lfun::_search'>lfun::_search()</ref> with <ref resolved='predef::search.needle'>needle</ref> and <ref resolved='predef::search.start'>start</ref> + will be returned. If <ref resolved='predef::search.haystack'>haystack</ref> is an object that doesn't implement <ref resolved='lfun::_search'>lfun::_search()</ref> it is assumed to be an <ref resolved='predef::Iterator'>Iterator</ref>, and implement <ref resolved='predef::Iterator.index'>Iterator()->index()</ref>, <ref resolved='predef::Iterator.value'>Iterator()->value()</ref>, and <ref resolved='predef::Iterator.next'>Iterator()->next()</ref>. <ref resolved='predef::search'>search()</ref> will then start comparing elements with <ref resolved='predef::`=='>`==()</ref> until a match with <ref resolved='predef::search.needle'>needle</ref> is found. If <ref resolved='predef::search.needle'>needle</ref> is found <ref resolved='predef::search.haystack'>haystack</ref> will be advanced to the element, and the iterator index will be returned. If <ref resolved='predef::search.needle'>needle</ref> is not - found, <ref resolved='predef::search.haystack'>haystack</ref> will be advanced to the end (and will thus - evaluate to false), and a zero with zero_type 1 will be returned. + found, <ref resolved='predef::search.haystack'>haystack</ref> will be advanced to the end. </text></group></mixed> - </text><group><note/><text>If <ref resolved='predef::search.start'>start</ref> is supplied to an iterator object without an + </text></group><group><param name='start'/><text>If the optional argument <ref resolved='predef::search.start'>start</ref> is present search is started at + this position. + </text></group><group><returns/><text>Returns the position of <ref resolved='predef::search.needle'>needle</ref> in <ref resolved='predef::search.haystack'>haystack</ref> if found. + If not found the returned value depends on the type of <ref resolved='predef::search.haystack'>haystack</ref>: + <mixed><group><type><or><string/><array/></or></type><text><expr>-1</expr>. + </text></group><group><type><or><mapping/><object resolved='predef::Iterator'>Iterator</object></or></type><text><ref resolved='predef::.UNDEFINED'>UNDEFINED</ref>. + </text></group><group><type><object resolved='predef::search'/></type><text>The value returned by <ref resolved='lfun::_search'>lfun::_search()</ref>. + </text></group></mixed> + </text></group><group><note/><text>If <ref resolved='predef::search.start'>start</ref> is supplied to an iterator object without an <ref resolved='lfun::_search'>lfun::_search()</ref>, <ref resolved='predef::search.haystack'>haystack</ref> will need to implement <ref resolved='predef::Iterator.set_index'>Iterator()->set_index()</ref>. </text></group><group><note/><text>For mappings and object <ref resolved='predef::.UNDEFINED'>UNDEFINED</ref> will be returned when not found. In all other cases <expr>-1</expr> will be returned when not found. </text></group><group><seealso/><text><ref resolved='predef::indices'>indices()</ref>, <ref resolved='predef::values'>values()</ref>, <ref resolved='predef::zero_type'>zero_type()</ref>, <ref resolved='predef::has_value'>has_value()</ref>, <ref resolved='predef::has_prefix'>has_prefix()</ref>, <ref resolved='predef::has_suffix'>has_suffix()</ref> </text></group></doc> <method name='search'> <arguments><argument name='haystack'><type><string/></type></argument><argument name='needle'><type><or><string/><int/></or></type></argument><argument name='start'><type><or><int/><void/></or></type></argument></arguments> <returntype><int/></returntype>

autodoc.git / modref.xml